Home | History | Annotate | Download | only in Support

Lines Matching full:small

1 //===- llvm/ADT/SmallPtrSet.cpp - 'Normally small' pointer set ------------===//
24 assert(!isSmall() && "Can't shrink a small set!");
45 // Nope, there isn't. If we stay small, just 'pushback' now.
145 // Small sets store their elements in order.
170 // If we're becoming small, prepare to insert into our stack space
199 // When small, just copy into our small buffer.
210 // Make the "that" object small and empty.
218 /// type, but may have a different small size.
224 "Cannot assign sets with different small sizes");
226 // If we're becoming small, prepare to insert into our stack space
263 // Copy a small RHS rather than moving.
276 // Make the RHS small and empty.
286 // We can only avoid copying elements if neither set is small.
295 // FIXME: From here on we assume that both sets have the same small size.
297 // If only RHS is small, copy the small elements into LHS and move the pointer
311 // If only LHS is small, copy the small elements into RHS and move the pointer
325 // Both a small, just swap the small elements.