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