Displaying 3 results from an estimated 3 matches for "sparsebitvectoriterator".
2007 Sep 07
0
[LLVMdev] [PATCH]: Add SparseBitmap implementation
...ed Idx) const {
+ return ElementIndex < Idx;
+ }
Are you sure that this is ok? For two Element's with equal indexes but
different contents, this will return "equal" based on their element count.
Generally !(x < y) && !(y < x) implies x == y.
+ typedef SparseBitVectorIterator iterator;
It looks like the iterator doesn't allow modification of the iterator, as
such you could also typedef "const_iterator".
+ while (ElementIter != RHS.Elements.end())
+ Elements.push_back(new SparseBitVectorElement<ElementSize>(*(*ElementIter)));
line too...
2007 Sep 04
6
[LLVMdev] [PATCH]: Add SparseBitmap implementation
On 9/4/07, Dan Gohman <djg at cray.com> wrote:
> On Tue, Sep 04, 2007 at 10:35:10AM -0400, Daniel Berlin wrote:
> > On 9/4/07, Dan Gohman <djg at cray.com> wrote:
> > > On Fri, Aug 31, 2007 at 08:10:33PM -0400, Daniel Berlin wrote:
> > > > + template <int ElementSize>
> > > > + class SparseBitmap {
> > >
> > > Do you
2007 Sep 07
1
[LLVMdev] [PATCH]: Add SparseBitmap implementation
...quot; based on their element count.
> Generally !(x < y) && !(y < x) implies x == y.
I removed both operator's since they weren't being used anymore. It
was when i was doing work on testing whether we could remove the
indirection/other containers.
>
> + typedef SparseBitVectorIterator iterator;
>
> It looks like the iterator doesn't allow modification of the iterator, as
> such you could also typedef "const_iterator".
Done
>
> + while (ElementIter != RHS.Elements.end())
> + Elements.push_back(new SparseBitVectorElement<ElementSize&...