Searched refs:Count (Results 1 - 25 of 241) sorted by relevance

12345678910

/external/guava/guava-tests/test/com/google/common/collect/
H A DCountTest.java22 * Tests for {@code Count}.
29 assertEquals(20, new Count(20).get());
33 Count holder = new Count(20);
39 Count holder = new Count(20);
44 Count holder = new Count(10);
50 Count holder = new Count(1
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/
H A DStackList.cs63 object poppedItem = this[this.Count - 1];
64 RemoveAt(this.Count - 1);
74 return this[this.Count - 1];
H A DHashList.cs170 if (_index < _orderList.Count)
207 for (int i = 0; i < keys.Count; i++)
225 if ((Count == 0) && (other.Count == 0))
227 else if (Count == other.Count)
229 for (int i = 0; i < Count; i++)
252 public int Count property in class:Antlr.Runtime.Collections.HashList.KeyCollection
254 get { return _hashList.Count; }
323 public int Count property in class:Antlr.Runtime.Collections.HashList.ValueCollection
451 public int Count property in class:Antlr.Runtime.Collections.HashList
[all...]
/external/llvm/utils/count/
H A Dcount.c14 unsigned Count, NumLines, NumRead; local
22 Count = strtol(argv[1], &End, 10);
44 if (Count != NumLines) {
45 fprintf(stderr, "Expected %d lines, got %d.\n", Count, NumLines);
/external/clang/include/clang/Basic/
H A DAddressSpaces.h39 Count = Last-Offset enumerator in enum:clang::LangAS::ID
44 typedef unsigned Map[Count];
/external/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h25 bool UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime,
28 bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
H A DListStack`1.cs61 if (depth >= Count)
67 item = this[Count - depth - 1];
82 if (Count == 0)
88 item = this[Count - 1];
89 RemoveAt(Count - 1);
H A DFastQueue.cs56 public virtual int Count property in class:Antlr.Runtime.Misc.FastQueue
60 return _data.Count - _p;
84 if (absIndex >= _data.Count)
85 throw new ArgumentException(string.Format("queue index {0} > last index {1}", absIndex, _data.Count - 1));
99 if (Count == 0)
105 if ( _p == _data.Count )
133 int n = Count;
/external/guava/guava/src/com/google/common/collect/
H A DCount.java29 final class Count implements Serializable { class in inherits:Serializable
32 Count() { method in class:Count
36 Count(int value) { method in class:Count
71 return obj instanceof Count && ((Count) obj).value == value;
H A DAbstractMapBasedMultiset.java52 private transient Map<E, Count> backingMap;
62 protected AbstractMapBasedMultiset(Map<E, Count> backingMap) {
67 Map<E, Count> backingMap() {
72 void setBackingMap(Map<E, Count> backingMap) {
92 final Iterator<Map.Entry<E, Count>> backingEntries =
95 Map.Entry<E, Count> toRemove;
104 final Map.Entry<E, Count> mapEntry = backingEntries.next();
115 Count frequency = backingMap.get(getElement());
138 for (Count frequency : backingMap.values()) {
166 final Iterator<Map.Entry<E, Count>> entryIterato
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DDebugEventHub.cs73 for (int i = 0; i < _listeners.Count; i++) {
80 for (int i = 0; i < _listeners.Count; i++) {
87 for (int i = 0; i < _listeners.Count; i++) {
94 for (int i = 0; i < _listeners.Count; i++) {
101 for (int i = 0; i < _listeners.Count; i++) {
108 for (int i = 0; i < _listeners.Count; i++) {
115 for (int i = 0; i < _listeners.Count; i++) {
122 for (int i = 0; i < _listeners.Count; i++) {
129 for (int i = 0; i < _listeners.Count; i++) {
136 for (int i = 0; i < _listeners.Count;
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
H A DDebugEventHub.cs79 for ( int i = 0; i < _listeners.Count; i++ )
88 for ( int i = 0; i < _listeners.Count; i++ )
97 for ( int i = 0; i < _listeners.Count; i++ )
106 for ( int i = 0; i < _listeners.Count; i++ )
115 for ( int i = 0; i < _listeners.Count; i++ )
124 for ( int i = 0; i < _listeners.Count; i++ )
133 for ( int i = 0; i < _listeners.Count; i++ )
142 for ( int i = 0; i < _listeners.Count; i++ )
151 for ( int i = 0; i < _listeners.Count; i++ )
160 for ( int i = 0; i < _listeners.Count;
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DLoopUnrollPass.cpp110 Pass *llvm::createLoopUnrollPass(int Threshold, int Count, int AllowPartial) { argument
111 return new LoopUnroll(Threshold, Count, AllowPartial);
165 unsigned Count = CurrentCount; local
167 Count = UnrollRuntimeCount;
169 if (Count == 0) {
176 Count = TripCount;
189 uint64_t Size = (uint64_t)LoopSize*Count;
191 DEBUG(dbgs() << " Too large to fully unroll with count: " << Count
200 Count = Threshold / LoopSize;
201 while (Count !
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
H A DFastQueue.cs54 public virtual int Count { property in class:Antlr.Runtime.Misc.FastQueue
56 return _data.Count - _p;
77 if (absIndex >= _data.Count)
78 throw new ArgumentException(string.Format("queue index {0} > last index {1}", absIndex, _data.Count - 1));
91 if (Count == 0)
97 if (_p == _data.Count) {
120 int n = Count;
H A DLookaheadStream.cs94 if (_p == _data.Count && _markDepth == 0) {
115 int n = (_p + need - 1) - _data.Count + 1; // how many more elements we need?
132 public override int Count { property in class:Antlr.Runtime.Misc.LookaheadStream
147 if ((_p + k - 1) > _data.Count)
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DIIntStream.cs149 int Count { get; } property in interface:Antlr.Runtime.IIntStream
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
H A DIIntStream.cs145 int Count property in interface:Antlr.Runtime.IIntStream
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractMapBasedMultiset.java49 private transient Map<E, Count> backingMap;
59 protected AbstractMapBasedMultiset(Map<E, Count> backingMap) {
64 Map<E, Count> backingMap() {
69 void setBackingMap(Map<E, Count> backingMap) {
89 final Iterator<Map.Entry<E, Count>> backingEntries =
92 Map.Entry<E, Count> toRemove;
101 final Map.Entry<E, Count> mapEntry = backingEntries.next();
112 Count frequency = backingMap.get(getElement());
135 for (Count frequency : backingMap.values()) {
163 final Iterator<Map.Entry<E, Count>> entryIterato
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DSubList.cs22 if ( startIndex > endIndex || endIndex >= source.Count )
53 for ( int i = 0; i < Count; i++ )
97 if ( index < 0 || index >= Count )
104 if ( index < 0 || index >= Count )
123 if ( index + Count > array.Length )
126 for ( int i = 0; i < Count; i++ )
132 public int Count property in class:Antlr.Runtime.JavaExtensions.SubList
183 if ( startIndex > endIndex || endIndex >= source.Count )
210 if ( index + Count > array.Length )
213 for ( int i = 0; i < Count;
219 public int Count property in class:Antlr.Runtime.JavaExtensions.SubList
[all...]
H A DStackExtensions.cs71 return stack.Count;
77 if ( size > stack.Count )
80 while ( stack.Count > size )
/external/skia/include/utils/
H A DSkParse.h17 static int Count(const char str[]); // number of scalars or int values
18 static int Count(const char str[], char separator);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
H A DRewriteRuleXxxxStreamFixture.cs103 Assert.AreEqual(0, tokenTest.Count, "The number of elements should be zero.");
106 Assert.AreEqual(0, tokenTest.Count,
122 Assert.AreEqual(0, subtreeTest.Count, "The number of elements should be zero.");
125 Assert.AreEqual(0, subtreeTest.Count,
140 Assert.AreEqual(0, nodeTest.Count, "The number of elements should be zero.");
143 Assert.AreEqual(0, nodeTest.Count,
198 Assert.AreEqual(1, tokenTest.Count, "tokenTest should have the size 1 (1).");
205 Assert.AreEqual(1, tokenTest.Count, "tokenTest should have the size 1 (2).");
208 Assert.AreEqual(1, tokenTest.Count, "tokenTest should have the size 1 (3).");
215 Assert.AreEqual(1, tokenTest.Count, "tokenTes
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DRewriteRuleElementStream.cs144 int n = Count;
164 int n = Count;
207 (elements != null && cursor < elements.Count);
211 public virtual int Count { property in class:Antlr.Runtime.Tree.RewriteRuleElementStream
218 return elements.Count;
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DRewriteRuleElementStream.cs155 int n = Count;
177 int n = Count;
227 ( elements != null && cursor < elements.Count );
231 public virtual int Count property in class:Antlr.Runtime.Tree.RewriteRuleElementStream
242 return elements.Count;
/external/llvm/lib/VMCore/
H A DUse.cpp105 ptrdiff_t Count = Done; local
108 if (!Count) {
111 Count = Done;
113 new(Stop) Use(PrevPtrTag(Count & 1));
114 Count >>= 1;

Completed in 510 milliseconds

12345678910