Commit9f85784

committed

Support multiple iterators in the Red-Black Tree implementation.

While we don't need multiple iterators at the moment, the interface isnicer and less dangerous this way.Aleksander Alekseev, with some changes by me.

1 parent76f9dd4 commit9f85784Copy full SHA for 9f85784

File tree

+197

-163

lines changed

+197

-163

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -255,7 +255,7 @@ qsortCompareItemPointers(const void a, const void b)`
`255`	`255`	`void`
`256`	`256`	`ginBeginBAScan(BuildAccumulator*accum)`
`257`	`257`	`{`
`258`		`-rb_begin_iterate(accum->tree,LeftRightWalk);`
	`258`	`+rb_begin_iterate(accum->tree,LeftRightWalk,&accum->tree_walk);`
`259`	`259`	`}`
`260`	`260`
`261`	`261`	`/*`
`@@ -271,7 +271,7 @@ ginGetBAEntry(BuildAccumulator *accum,`
`271`	`271`	`GinEntryAccumulator*entry;`
`272`	`272`	`ItemPointerData*list;`
`273`	`273`
`274`		`-entry= (GinEntryAccumulator*)rb_iterate(accum->tree);`
	`274`	`+entry= (GinEntryAccumulator*)rb_iterate(&accum->tree_walk);`
`275`	`275`
`276`	`276`	`if (entry==NULL)`
`277`	`277`	`returnNULL;/* no more entries */`

Comments

(0)