@@ -37,8 +37,7 @@ rumCombineData(RBNode *existing, const RBNode *newdata, void *arg)
3737{
3838accum -> allocatedMemory -= GetMemoryChunkSpace (eo -> list );
3939eo -> maxcount *=2 ;
40- eo -> list = (RumEntryAccumulatorItem * )
41- repalloc (eo -> list ,sizeof (RumEntryAccumulatorItem )* eo -> maxcount );
40+ eo -> list = (RumKey * )repalloc (eo -> list ,sizeof (RumKey )* eo -> maxcount );
4241accum -> allocatedMemory += GetMemoryChunkSpace (eo -> list );
4342}
4443
@@ -150,7 +149,7 @@ rumInsertBAEntry(BuildAccumulator *accum,
150149RumEntryAccumulator eatmp ;
151150RumEntryAccumulator * ea ;
152151bool isNew ;
153- RumEntryAccumulatorItem item ;
152+ RumKey item ;
154153
155154/*
156155 * For the moment, fill only the fields of eatmp that will be looked at by
@@ -185,8 +184,7 @@ rumInsertBAEntry(BuildAccumulator *accum,
185184 * rumCombineData()
186185 */
187186ea -> shouldSort = accum -> rumstate -> useAlternativeOrder ;
188- ea -> list =
189- (RumEntryAccumulatorItem * )palloc (sizeof (RumEntryAccumulatorItem )* DEF_NPTR );
187+ ea -> list = (RumKey * )palloc (sizeof (RumKey )* DEF_NPTR );
190188ea -> list [0 ].iptr = * heapptr ;
191189ea -> list [0 ].addInfo = addInfo ;
192190ea -> list [0 ].addInfoIsNull = addInfoIsNull ;
@@ -280,13 +278,13 @@ rumBeginBAScan(BuildAccumulator *accum)
280278 * This consists of a single key datum and a list (array) of one or more
281279 * heap TIDs in which that key is found. The list is guaranteed sorted.
282280 */
283- RumEntryAccumulatorItem *
281+ RumKey *
284282rumGetBAEntry (BuildAccumulator * accum ,
285283OffsetNumber * attnum ,Datum * key ,RumNullCategory * category ,
286284uint32 * n )
287285{
288286RumEntryAccumulator * entry ;
289- RumEntryAccumulatorItem * list ;
287+ RumKey * list ;
290288
291289entry = (RumEntryAccumulator * )rb_iterate (accum -> tree );
292290
@@ -304,11 +302,10 @@ rumGetBAEntry(BuildAccumulator *accum,
304302if (entry -> count > 1 )
305303{
306304if (accum -> rumstate -> useAlternativeOrder )
307- qsort_arg (list ,entry -> count ,sizeof (RumEntryAccumulatorItem ),
305+ qsort_arg (list ,entry -> count ,sizeof (RumKey ),
308306qsortCompareRumKey ,accum -> rumstate );
309307else if (entry -> shouldSort )
310- qsort (list ,entry -> count ,sizeof (RumEntryAccumulatorItem ),
311- qsortCompareItemPointers );
308+ qsort (list ,entry -> count ,sizeof (RumKey ),qsortCompareItemPointers );
312309}
313310
314311return list ;