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

1234567891011>>

/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];
/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/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/chromium_org/base/metrics/
H A Dsample_map.cc13 typedef HistogramBase::Count Count; typedef in namespace:base
20 void SampleMap::Accumulate(Sample value, Count 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;
35 for (map<Sample, Count>::const_iterator it = sample_counts_.begin();
51 Count count;
76 void SampleMapIterator::Get(Sample* min, Sample* max, Count* coun
[all...]
H A Dhistogram_samples.h26 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);
79 HistogramBase::Count* count) const = 0;
H A Dsample_map.h27 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;
/external/llvm/lib/Transforms/Scalar/
H A DLoopUnrollPass.cpp129 UP.Count = CurrentCount;
192 Pass *llvm::createLoopUnrollPass(int Threshold, int Count, int AllowPartial, argument
194 return new LoopUnroll(Threshold, Count, AllowPartial, Runtime);
270 unsigned Count = CountValue->getZExtValue(); local
271 assert(Count >= 1 && "Unroll count must be positive.");
272 return Count;
285 unsigned Count = UserCount ? CurrentCount : 0; local
289 if (Count == 0) {
291 Count = PragmaCount;
295 Count
356 unsigned Count = selectUnrollCount(L, TripCount, HasEnablePragma, PragmaCount, local
[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;
/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/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h26 bool UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime,
30 bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
/external/clang/lib/CodeGen/
H A DCodeGenPGO.h69 void setCurrentRegionCount(uint64_t Count) { CurrentRegionCount = Count; } argument
77 /// true and put the value in Count; else return false.
78 bool getStmtCount(const Stmt *S, uint64_t &Count) { argument
85 Count = I->second;
92 uint64_t Count; local
93 if (getStmtCount(S, Count))
94 setCurrentRegionCount(Count);
152 uint64_t Count; member in class:clang::CodeGen::RegionCounter
158 : PGO(&PGO), Counter(CounterIndex), Count(PG
[all...]
/external/chromium_org/third_party/webrtc/system_wrappers/source/
H A Dcritical_section_unittest.cc42 int Count() const { function in class:webrtc::__anon16156::ProtectedCount
63 while (count->Count() < target && loop_counter < 100 * target) {
67 return (count->Count() >= target);
88 // the lock, even though count.Count() locks and unlocks the critical section
91 ASSERT_EQ(0, count.Count());
121 EXPECT_LE(2, count.Count());
125 int count_before = count.Count();
129 EXPECT_EQ(count_before, count.Count());
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
H A Dradeon_code.c47 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;
[all...]
H A Dradeon_remove_constants.c73 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);
134 * Count even though the remapping function is identity. In that case,
136 c->Program.Constants.Count
[all...]
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_code.c47 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;
[all...]
H A Dradeon_remove_constants.c73 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);
134 * Count even though the remapping function is identity. In that case,
136 c->Program.Constants.Count
[all...]
/external/chromium_org/base/test/
H A Dhistogram_tester.h35 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,

Completed in 760 milliseconds

1234567891011>>