/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];
|
/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 | 26 bool UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime, 30 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/chromium_org/base/test/ |
histogram_tester.h | 35 base::HistogramBase::Count expected_count) const; 42 base::HistogramBase::Count expected_count) const; 48 base::HistogramBase::Count count) const; 61 base::Histogram::Count expected_count, 68 base::Histogram::Count expected_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/chromium_org/base/metrics/ |
sample_map.cc | 13 typedef HistogramBase::Count Count; 20 void SampleMap::Accumulate(Sample value, Count count) { 21 sample_counts_[value] += count; 22 IncreaseSum(count * value); 23 IncreaseRedundantCount(count); 26 Count SampleMap::GetCount(Sample value) const { 27 map<Sample, Count>::const_iterator it = sample_counts_.find(value); 33 Count SampleMap::TotalCount() const 34 Count count = 0; local 51 Count count; local [all...] |
histogram_samples.h | 26 HistogramBase::Count count) = 0; 27 virtual HistogramBase::Count GetCount(HistogramBase::Sample value) const = 0; 28 virtual HistogramBase::Count TotalCount() const = 0; 42 HistogramBase::Count redundant_count() const { 52 void IncreaseRedundantCount(HistogramBase::Count diff); 59 // this count to the sum of the counts (TotalCount() function), and detect 74 // Get the sample and count at current position. 75 // |min| |max| and |count| can be NULL if the value is not of interest. 79 HistogramBase::Count* count) const = 0 [all...] |
sample_map.h | 27 HistogramBase::Count count) OVERRIDE; 28 virtual HistogramBase::Count GetCount( 30 virtual HistogramBase::Count TotalCount() const OVERRIDE; 39 std::map<HistogramBase::Sample, HistogramBase::Count> sample_counts_; 46 typedef std::map<HistogramBase::Sample, HistogramBase::Count> 57 HistogramBase::Count* count) const OVERRIDE;
|
sample_vector.h | 30 HistogramBase::Count count) OVERRIDE; 31 virtual HistogramBase::Count GetCount( 33 virtual HistogramBase::Count TotalCount() const OVERRIDE; 36 // Get count of a specific bucket. 37 HistogramBase::Count GetCountAtIndex(size_t bucket_index) const; 68 HistogramBase::Count* count) const OVERRIDE;
|
/external/llvm/lib/Transforms/Scalar/ |
LoopUnrollPass.cpp | 40 UnrollCount("unroll-count", cl::init(0), cl::Hidden, 41 cl::desc("Use this unroll count for all loops including those with " 86 // Default unroll count for loops with run-time trip count if 87 // -unroll-count is not set 129 UP.Count = CurrentCount; 136 // Select and return an unroll count based on parameters from 138 // SetExplicitly is set to true if the unroll count is is set by 192 Pass *llvm::createLoopUnrollPass(int Threshold, int Count, int AllowPartial, 194 return new LoopUnroll(Threshold, Count, AllowPartial, Runtime) [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...] |
/external/clang/lib/CodeGen/ |
CodeGenPGO.h | 69 void setCurrentRegionCount(uint64_t Count) { CurrentRegionCount = Count; } 76 /// Check if an execution count is known for a given statement. If so, return 77 /// true and put the value in Count; else return false. 78 bool getStmtCount(const Stmt *S, uint64_t &Count) { 85 Count = I->second; 89 /// If the execution count for the current statement is known, record that 90 /// as the current count. 92 uint64_t Count; 93 if (getStmtCount(S, Count)) [all...] |
/external/chromium_org/third_party/webrtc/system_wrappers/source/ |
critical_section_unittest.cc | 42 int Count() const { 56 // Waits a number of cycles for the count to reach a given value. 58 bool WaitForCount(int target, ProtectedCount* count) { 63 while (count->Count() < target && loop_counter < 100 * target) { 67 return (count->Count() >= target); 80 ProtectedCount count(crit_sect); 82 &LockUnlockThenStopRunFunction, &count); 88 // the lock, even though count.Count() locks and unlocks the critical sectio [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
radeon_code.c | 47 dst->Constants = malloc(sizeof(struct rc_constant) * src->Count); 48 memcpy(dst->Constants, src->Constants, sizeof(struct rc_constant) * src->Count); 49 dst->Count = src->Count; 50 dst->_Reserved = src->Count; 61 unsigned index = c->Count; 63 if (c->Count >= c->_Reserved) { 71 memcpy(newlist, c->Constants, sizeof(struct rc_constant) * c->Count); 78 c->Count++; 92 for(index = 0; index < c->Count; ++index) [all...] |
radeon_remove_constants.c | 73 if (!c->Program.Constants.Count) { 78 const_used = malloc(c->Program.Constants.Count); 79 memset(const_used, 0, c->Program.Constants.Count); 93 for (unsigned i = 0; i < c->Program.Constants.Count; i++) 100 remap_table = malloc(c->Program.Constants.Count * sizeof(unsigned)); 101 inv_remap_table = malloc(c->Program.Constants.Count * sizeof(unsigned)); 104 for (unsigned i = 0; i < c->Program.Constants.Count; i++) { 122 assert( is_identity || new_count < c->Program.Constants.Count); 133 /* Set the new constant count. Note that new_count may be less than 134 * Count even though the remapping function is identity. In that case [all...] |
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_code.c | 47 dst->Constants = malloc(sizeof(struct rc_constant) * src->Count); 48 memcpy(dst->Constants, src->Constants, sizeof(struct rc_constant) * src->Count); 49 dst->Count = src->Count; 50 dst->_Reserved = src->Count; 61 unsigned index = c->Count; 63 if (c->Count >= c->_Reserved) { 71 memcpy(newlist, c->Constants, sizeof(struct rc_constant) * c->Count); 78 c->Count++; 92 for(index = 0; index < c->Count; ++index) [all...] |
radeon_remove_constants.c | 73 if (!c->Program.Constants.Count) { 78 const_used = malloc(c->Program.Constants.Count); 79 memset(const_used, 0, c->Program.Constants.Count); 93 for (unsigned i = 0; i < c->Program.Constants.Count; i++) 100 remap_table = malloc(c->Program.Constants.Count * sizeof(unsigned)); 101 inv_remap_table = malloc(c->Program.Constants.Count * sizeof(unsigned)); 104 for (unsigned i = 0; i < c->Program.Constants.Count; i++) { 122 assert( is_identity || new_count < c->Program.Constants.Count); 133 /* Set the new constant count. Note that new_count may be less than 134 * Count even though the remapping function is identity. In that case [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...] |