HomeSort by relevance Sort by last modified time
    Searched refs:Count (Results 1 - 25 of 302) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/guava/guava-tests/test/com/google/common/collect/
CountTest.java 22 * 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(10)
    [all...]
  /external/clang/include/clang/Basic/
AddressSpaces.h 39 Count = Last-Offset
44 typedef unsigned Map[Count];
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/
StackList.cs 63 object poppedItem = this[this.Count - 1];
64 RemoveAt(this.Count - 1);
74 return this[this.Count - 1];
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/
armVCM4P10_PredictIntraDC4x4.c 51 int x, y, Sum=0, Count = 0;
59 Count++;
67 Count++;
69 if (Count==0)
73 else if (Count==1)
77 else /* Count = 2 */
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/comm/src/
omxVCCOMM_Copy8x8_s.s 35 Count RN 14
43 MOV Count,step ;//Count=step
45 LDRD X0,[pSrc],Count ;//pSrc after loading : pSrc=pSrc+step
46 LDRD X1,[pSrc],Count
49 LDRD X0,[pSrc],Count
51 LDRD X1,[pSrc],Count
54 LDRD X0,[pSrc],Count
56 LDRD X1,[pSrc],Count
59 LDRD X0,[pSrc],Count
    [all...]
omxVCCOMM_Copy16x16_s.s 35 Count RN 14
45 SUB Count,step,#8 ;//Count=step-8
47 LDRD X1,[pSrc],Count ;//pSrc after loading pSrc=pSrc+step
53 LDRD X1,[pSrc],Count
59 LDRD X1,[pSrc],Count
65 LDRD X1,[pSrc],Count
71 LDRD X1,[pSrc],Count
77 LDRD X1,[pSrc],Count
83 LDRD X1,[pSrc],Count
    [all...]
  /external/llvm/utils/count/
count.c 1 /*===- count.c - The 'count' testing tool ---------------------------------===*\
14 unsigned Count, NumLines, NumRead;
18 fprintf(stderr, "usage: %s <expected line count>\n", argv[0]);
22 Count = strtol(argv[1], &End, 10);
24 fprintf(stderr, "%s: invalid count argument '%s'\n", argv[0], argv[1]);
44 if (Count != NumLines) {
45 fprintf(stderr, "Expected %d lines, got %d.\n", Count, NumLines);
  /external/llvm/include/llvm/Transforms/Utils/
UnrollLoop.h 25 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/
ListStack`1.cs 61 if (depth >= Count)
67 item = this[Count - depth - 1];
82 if (Count == 0)
88 item = this[Count - 1];
89 RemoveAt(Count - 1);
FastQueue.cs 56 public virtual int Count
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/
Count.java 29 final class Count implements Serializable {
32 Count() {
36 Count(int value) {
71 return obj instanceof Count && ((Count) obj).value == value;
AbstractMapBasedMultiset.java 52 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) {
82 * set always returns the current count of that element in the multiset, as
83 * opposed to the count at the time the entry was retrieved.
92 final Iterator<Map.Entry<E, Count>> backingEntries =
95 Map.Entry<E, Count> toRemove;
104 final Map.Entry<E, Count> mapEntry = backingEntries.next();
113 int count = mapEntry.getValue().get() local
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopUnrollPass.cpp 36 UnrollCount("unroll-count", cl::init(0), cl::Hidden,
37 cl::desc("Use this unroll count for all loops, for testing purposes"));
71 // Default unroll count for loops with run-time trip count if
72 // -unroll-count is not set
113 Pass *llvm::createLoopUnrollPass(int Threshold, int Count, int AllowPartial) {
114 return new LoopUnroll(Threshold, Count, AllowPartial);
159 // Find trip count and trip multiple if count is not available
162 // Find "latch trip count". UnrollLoop assumes that control cannot exi
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
FastQueue.cs 54 public virtual int Count {
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;
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
DebugEventHub.cs 73 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; i++)
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
DebugEventHub.cs 79 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; i++
    [all...]
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/
armVCM4P2_DecodeVLCZigzag_AC_unsafe_s.s 66 Count RN 6
110 MOV temp1,#0 ;// Initialize Count to zero
163 ADD temp2,storeRun,Count
165 BGE ExitError ;// error if Count+storeRun >= 64
180 ADD Count,Count,storeRun
181 LDRB zigzag,[pZigzagTable,Count]
182 ADD Count,Count,#1
280 ADD temp1,storeRun,Count ;// Exit with an error message if Run + Count exceeds 6
    [all...]
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/
armVCM4P2_DecodeVLCZigzag_AC_unsafe_s.s 66 Count RN 6
110 MOV temp1,#0 ;// Initialize Count to zero
163 ADD temp2,storeRun,Count
165 BGE ExitError ;// error if Count+storeRun >= 64
180 ADD Count,Count,storeRun
181 LDRB zigzag,[pZigzagTable,Count]
182 ADD Count,Count,#1
280 ADD temp1,storeRun,Count ;// Exit with an error message if Run + Count exceeds 6
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
AbstractMapBasedMultiset.java 49 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) {
79 * set always returns the current count of that element in the multiset, as
80 * opposed to the count at the time the entry was retrieved.
89 final Iterator<Map.Entry<E, Count>> backingEntries =
92 Map.Entry<E, Count> toRemove;
101 final Map.Entry<E, Count> mapEntry = backingEntries.next();
110 int count = mapEntry.getValue().get() local
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
StackExtensions.cs 71 return stack.Count;
77 if ( size > stack.Count )
80 while ( stack.Count > size )
  /external/skia/include/utils/
SkParse.h 17 static int Count(const char str[]); // number of scalars or int values
18 static int Count(const char str[], char separator);
25 static const char* FindScalars(const char str[], SkScalar value[], int count);
  /external/skia/legacy/include/utils/
SkParse.h 17 static int Count(const char str[]); // number of scalars or int values
18 static int Count(const char str[], char separator);
25 static const char* FindScalars(const char str[], SkScalar value[], int count);
  /external/webrtc/src/system_wrappers/source/
critical_section_unittest.cc 56 int Count() const {
71 // Waits a number of cycles for the count to reach a given value.
73 bool WaitForCount(int target, ProtectedCount* count) {
78 while (count->Count() < target && loop_counter < 100*target) {
83 return (count->Count() >= target);
102 ProtectedCount count(crit_sect);
104 &LockUnlockThenStopRunFunction, &count);
110 // the lock, even though count.Count() locks and unlocks the critical sectio
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
RewriteRuleXxxxStreamFixture.cs 103 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, "tokenTest should have the size 1 (4).")
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
IIntStream.cs 149 int Count { get; }

Completed in 1429 milliseconds

1 2 3 4 5 6 7 8 91011>>