vm/libadt/vectset.cpp

56   size = 2;                     // Small initial size
57   data = (uint32_t *)_set_arena->Amalloc(size*sizeof(uint32_t));
82   size = s.size;                // Use new size
83   data = (uint32_t*)s._set_arena->Amalloc(size*sizeof(uint32_t)); // Make array of required size
84   memcpy( data, s.data, size*sizeof(uint32_t) ); // Fill the array
88 // Expand the existing set to a bigger size
92   uint x = size;
94   data = (uint32_t *)_set_arena->Arealloc(data, size*sizeof(uint32_t), x*sizeof(uint32_t));
95   memset((char *)(data + size), 0, (x - size)*sizeof(uint32_t));
96   size = x;
106   if( word >= size )            // Need to grow set?
117   if( word >= size )              // Beyond the last?
129   if( s.size < size ) size = s.size; // Get smaller size
132   for( uint i=0; i<size; i++)   // For data in set
149   register uint cnt = ((size<s.size)?size:s.size);
154   if( size < s.size ) {         // Is set 2 larger than set 1?
156     grow(s.size*sizeof(uint32_t)*8);
157     memcpy(&data[cnt], u2, (s.size - cnt)*sizeof(uint32_t));
174   register uint cnt = ((size<s.size)?size:s.size);
201   register uint cnt = ((size<s.size)?size:s.size);
213   if( size < s.size ) {
214     for( ; i<s.size; i++ )      // For data in larger set
217     for( ; i<size; i++ )        // For data in larger set
247   register uint small_size = ((size<s.size)?size:s.size);
289   if( word >= size )              // Beyond the last?
300   for( i=0; i<size; i++ )
313   if( size > 100 ) {            // Reclaim storage only if huge
314     FREE_RESOURCE_ARRAY(uint32_t,data,size);
315     size = 2;                   // Small initial size
316     data = NEW_RESOURCE_ARRAY(uint32_t,size);
318   memset( data, 0, size*sizeof(uint32_t) );
325   uint sum = 0;                 // Cumulative size so far.
327   for( uint32_t i = 0; i < (size<<2); i++) // While have bytes to process
328     sum += bitsInByte[*currByte++];      // Add bits in current byte to size.
342   uint lim = ((size<4)?size:4);
381     for( i++; (i<s->size) && (!s->data[i]); i++ ); // Skip to non-zero word
382   } while( i<s->size );