HomeSort by relevance Sort by last modified time
    Searched defs:BitVector (Results 1 - 8 of 8) sorted by null

  /external/chromium_org/third_party/WebKit/Source/wtf/
BitVector.h 37 // This is a space-efficient, resizeable bitvector class. In the common case it
42 // - The bitvector remembers the bound of how many bits can be stored, but this
46 // - The bitvector can resize itself automatically (set, clear, get) or can be used
53 // On the other hand, this BitVector class may not be the fastest around, since
58 class WTF_EXPORT BitVector {
60 BitVector()
65 explicit BitVector(size_t numBits)
71 BitVector(const BitVector& other)
78 ~BitVector()
    [all...]
  /external/stlport/test/eh/
test_bit_vector.cpp 36 typedef EH_BIT_VECTOR BitVector;
39 container_category(const BitVector&)
53 gTestController.SetCurrentTestName("BitVector::reserve()");
56 void operator()( BitVector& v ) const
74 BitVector emptyVector;
75 BitVector testVector, testVector2;
93 StrongCheck(testVector, test_insert_one<BitVector>(testVector) );
94 StrongCheck(testVector, test_insert_one<BitVector>(testVector,0) );
95 StrongCheck(testVector, test_insert_one<BitVector>(testVector, (int)testVector.size()) );
97 StrongCheck(testVector, test_insert_n<BitVector>(testVector, random_number(random_base) ) )
    [all...]
  /art/runtime/base/
bit_vector.cc 38 BitVector::BitVector(uint32_t start_bits,
55 BitVector::~BitVector() {
62 bool BitVector::IsBitSet(uint32_t num) const {
73 void BitVector::ClearAllBits() {
82 void BitVector::SetBit(uint32_t num) {
103 void BitVector::ClearBit(uint32_t num) {
111 bool BitVector::SameBitsSet(const BitVector *src)
    [all...]
bit_vector.h 31 * from zero. All operations on a BitVector are unsynchronized.
33 class BitVector {
38 * @brief Convenient iterator across the indexes of the BitVector's set bits.
41 * to the highest index of the BitVector's set bits. Instances can be retrieved
42 * only through BitVector::Indexes() which returns an IndexContainer wrapper
87 IndexIterator(const BitVector* bit_vector, begin_tag)
92 IndexIterator(const BitVector* bit_vector, end_tag)
124 friend class BitVector::IndexContainer;
128 * @brief BitVector wrapper class for iteration across indexes of set bits.
132 explicit IndexContainer(const BitVector* bit_vector) : bit_vector_(bit_vector) {
    [all...]
  /external/llvm/include/llvm/ADT/
BitVector.h 1 //===- llvm/ADT/BitVector.h - Bit vectors -----------------------*- C++ -*-===//
10 // This file implements the BitVector class.
27 class BitVector {
33 unsigned Size; // Size of bitvector in bits.
40 friend class BitVector;
48 reference(BitVector &b, unsigned Idx) {
74 /// BitVector default ctor - Creates an empty bitvector.
75 BitVector() : Size(0), Capacity(0) {
79 /// BitVector ctor - Creates a bitvector of specified number of bits. Al
    [all...]
  /external/chromium_org/v8/src/
data-flow.h 18 class BitVector: public ZoneObject {
20 // Iterator for the elements of this BitVector.
23 explicit Iterator(BitVector* target)
57 BitVector* target_;
62 friend class BitVector;
65 BitVector(int length, Zone* zone)
73 BitVector(const BitVector& other, Zone* zone)
84 BitVector& operator=(const BitVector& rhs)
    [all...]
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_deadlock_detector.h 137 typedef BV BitVector;
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.lucene_1.9.1.v20100518-1140.jar 

Completed in 396 milliseconds