home *** CD-ROM | disk | FTP | other *** search
/ The Pier Shareware 6 / The_Pier_Shareware_Number_6_(The_Pier_Exchange)_(1995).iso / 038 / dho_9a.zip / SORTLIST.CC < prev    next >
C/C++ Source or Header  |  1994-10-12  |  3KB  |  119 lines
  1. // Developer Helper Object Set, (C) 1994 Thomas E. Bednarz, Jr.
  2. //  All rights reserved
  3.  
  4. #include"sortlist.h"
  5.  
  6. //-------------------------------------------------------------------
  7. //  TSortedList
  8. TSortedList::TSortedList(void)
  9. {
  10.    
  11. };
  12.  
  13.  
  14. //-------------------------------------------------------------------
  15. //  keyOf
  16. void *TSortedList::keyOf( TObject *item ) 
  17. { 
  18.    return item->getKey(); 
  19. }
  20.  
  21.  
  22. //-------------------------------------------------------------------
  23. //  TSortedList
  24. TSortedList::TSortedList( ListIndex aLimit, ListIndex aDelta) :
  25.         TList( aLimit, aDelta )
  26. {
  27.    fDelta = aDelta; 
  28.    setLimit( aLimit ); 
  29. }
  30.  
  31.  
  32. //-------------------------------------------------------------------
  33. //  indexOf
  34. ListIndex TSortedList::indexOf(TObject *item)
  35. {
  36.     ListIndex  i;
  37.  
  38.     if( search( keyOf(item), i ) == 0 )
  39.         return ccNotFound;
  40.     else
  41.         {
  42.         if( duplicates )
  43.             {
  44.             while( i < fCount && item != fItems[i] )
  45.                 i++;
  46.             }
  47.         if( i < fCount )
  48.             return i;
  49.         else
  50.             return ccNotFound;
  51.         }
  52. }
  53.  
  54.  
  55. //-------------------------------------------------------------------
  56. //  insert
  57. ListIndex TSortedList::insert( TObject *item )
  58. {
  59.     ListIndex  i;
  60.     if( search( keyOf(item), i ) == 0 || duplicates )   // order dependency!
  61.         atInsert( i, item );                            // must do Search
  62.                                                         // before calling
  63.                                                         // AtInsert
  64.     return i;
  65. }
  66.  
  67.  
  68. //-------------------------------------------------------------------
  69. //  search
  70. Boolean TSortedList::search( void *key, ListIndex& index )
  71. {
  72.     ListIndex l = 0;
  73.     ListIndex h = fCount - 1;
  74.     Boolean res = False;
  75.     while( l <= h )
  76.         {
  77.         ListIndex i = (l +  h) >> 1;
  78.         ListIndex c = compare( keyOf( fItems[i] ), key );
  79.         if( c < 0 )
  80.             l = i + 1;
  81.         else
  82.             {
  83.             h = i - 1;
  84.             if( c == 0 )
  85.                 {
  86.                 res = True;
  87.                 if( !duplicates )
  88.                     l = i;
  89.                 }
  90.             }
  91.         }
  92.     index = l;
  93.     return res;
  94. }
  95.  
  96.  
  97. //-------------------------------------------------------------------
  98. //  KeepDuplicates
  99. void TSortedList::KeepDuplicates(Boolean dups)
  100. {
  101.    duplicates = dups;
  102. }
  103.  
  104.  
  105. //-------------------------------------------------------------------
  106. //  getDuplicateState
  107. Boolean TSortedList::getDuplicateState(void)
  108. {
  109.    return duplicates;
  110. }
  111.  
  112. //-------------------------------------------------------------------
  113. //  getClassName
  114. const char *TSortedList::getClassName(void)
  115. {
  116.    return "TSortedList";
  117. }
  118.  
  119.