Searched refs:Capacity (Results 1 - 7 of 7) sorted by relevance
| /macosx-10.10.1/bmalloc-7600.1.17/bmalloc/ |
| H A D | FixedVector.h | 38 template<typename T, size_t Capacity>
51 size_t capacity() const { return Capacity; }
67 std::array<T, Capacity> m_buffer;
70 template<typename T, size_t Capacity>
71 inline FixedVector<T, Capacity>::FixedVector()
76 template<typename T, size_t Capacity>
77 inline T& FixedVector<T, Capacity>::operator[](size_t i)
83 template<typename T, size_t Capacity>
84 inline void FixedVector<T, Capacity>::push(const T& value)
86 BASSERT(m_size < Capacity);
[all...] |
| /macosx-10.10.1/llvmCore-3425.0.34/include/llvm/ADT/ |
| H A D | BitVector.h | 34 unsigned Capacity; // Size of allocated memory in BitWord. member in class:llvm::BitVector
74 BitVector() : Size(0), Capacity(0) {
81 Capacity = NumBitWords(s);
82 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
83 init_words(Bits, Capacity, t);
92 Capacity = 0;
96 Capacity = NumBitWords(RHS.size());
97 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
98 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord));
103 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RH
[all...] |
| H A D | IntervalMap.h | 195 enum { Capacity = N }; enumerator in enum:llvm::IntervalMapImpl::NodeBase::__anon9702
359 /// Elements + Grow <= Nodes * Capacity.
364 /// NewSize[i] <= Capacity.
372 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
378 /// @param Capacity The capacity of each node.
384 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
484 assert(n <= NodeT::Capacity && "Size too big for node");
600 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
1074 if (branched() || rootSize == RootLeaf::Capacity)
1150 const unsigned Nodes = RootLeaf::Capacity / Lea
[all...] |
| /macosx-10.10.1/llvmCore-3425.0.34/lib/Support/ |
| H A D | IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
150 assert(NewSize[n] <= Capacity && "Overallocated node");
|
| /macosx-10.10.1/xnu-2782.1.97/libkern/c++/ |
| H A D | OSSerializeBinary.cpp | 241 if (idx >= v##Capacity) \
243 uint32_t ncap = v##Capacity + 64; \
248 bcopy(v##Array, nbuf, v##Capacity * sizeof(o)); \
249 kfree(v##Array, v##Capacity * sizeof(o)); \
252 v##Capacity = ncap; \
|
| /macosx-10.10.1/IOKitUser-1050.1.21/ |
| H A D | IOCFSerialize.c | 1109 if (idx >= v##Capacity) \
1111 uint32_t ncap = v##Capacity + 64; \
1116 bcopy(v##Array, nbuf, v##Capacity * sizeof(o)); \
1120 v##Capacity = ncap; \
|
| /macosx-10.10.1/swig-12/Lib/csharp/ |
| H A D | std_vector.i | 63 public int Capacity {
69 throw new ArgumentOutOfRangeException("Capacity");
|
Completed in 145 milliseconds