Displaying 3 results from an estimated 3 matches for "uniquevector_8h_sourc".
Did you mean:
uniquevector_8h_source
2012 Jul 12
1
[LLVMdev] llvm::DenseSet with reverse iterator
...nts:
SmallVector uses less memory, better locality, and is faster while
pretty small, and the stl set is simpler to use and better when large.
I don't have a good feel for what exactly is "pretty small", but a lot
of the LLVM code chooses 4 or 8.
[1] http://llvm.org/docs/doxygen/html/UniqueVector_8h_source.html
[2] http://llvm.org/docs/doxygen/html/SmallSet_8h_source.html#l00048
On Thu, Jul 12, 2012 at 11:43 AM, Vassil Vassilev <vvasilev at cern.ch> wrote:
> Hi,
> Thanks a lot for the help!
> It seems that the SmallSetVector is the ADT I need (interface-wise). Is
> more effic...
2012 Jul 12
0
[LLVMdev] llvm::DenseSet with reverse iterator
Hi,
Thanks a lot for the help!
It seems that the SmallSetVector is the ADT I need (interface-wise).
Is more efficient than llvm::UniqueVector?
In my use case I have to insert a new element in the structure only
if the element is unique. I hardly expect more than 32 elements. Do you
think I gain a lot if I use the SmallSetVector instead of using
SmallVector + slow searching on every
2012 Jul 12
2
[LLVMdev] llvm::DenseSet with reverse iterator
Something that might interest you is the SetVector, which as its name
implies is both a set and a vector paired together. You get the
advantage of doing set-like operations (search) on the set and
vector-like operations (iteration, random access) on the vector, but
at the cost of paying the price for both data structures when
modifying the structure (and double the memory). This seems like it