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

1234567891011>>

/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
H A DANTLRxxxxStreamFixture.cs79 Assert.AreEqual(0, inputStream.Count);
90 Assert.AreEqual(grammarStr.Length, inputStream.Count);
109 while (inputStream.Index < inputStream.Count)
113 Assert.AreEqual(inputStream.Index, inputStream.Count);
124 while (inputStream.Index < inputStream.Count)
129 Assert.AreEqual(inputStream.Index, inputStream.Count);
295 Assert.AreEqual(0, s1.Count);
303 Assert.AreEqual(7, s1.Count);
306 Assert.AreEqual(grammarStr.Length, s2.Count);
309 Assert.AreEqual(10, s3.Count);
[all...]
H A DITreeNodeStreamFixture.cs645 for (int i = 0; i < nodes.Count; i++)
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.Collections/
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...]
H A DStackList.cs63 object poppedItem = this[this.Count - 1];
64 RemoveAt(this.Count - 1);
74 return this[this.Count - 1];
/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...]
H A DDebugTokenStream.cs147 public virtual int Count { property in class:Antlr.Runtime.Debug.DebugTokenStream
149 return input.Count;
H A DDebugTreeNodeStream.cs163 public virtual int Count { property in class:Antlr.Runtime.Debug.DebugTreeNodeStream
165 return input.Count;
H A DProfiler.cs235 return decisionStack.Count > 0;
466 //for (int i = 0; i < input.Count && lastRealTokenTouchedInDecision != null && i <= lastRealTokenTouchedInDecision.TokenIndex; i++)
477 stats.numUniqueRulesInvoked = uniqueRules.Count;
643 for (int ti = i; ti < input.Count && ti <= j; ti++) {
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.JavaExtensions/
H A DEnumerableExtensions.cs276 var array = new TSource[collection.Count];
/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)
H A DStats.cs78 int m = X.Count;
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DBaseTree.cs81 return Children.Count;
145 if (children == null || i >= children.Count)
193 c.ChildIndex = children.Count - 1;
209 t.ChildIndex = children.Count - 1;
301 replacingWithHowMany = newChildren.Count;
302 int numNewChildren = newChildren.Count;
416 if (children == null || children.Count == 0) {
425 for (int i = 0; children != null && i < children.Count; i++) {
H A DBufferedTreeNodeStream.cs80 if (_index < _outer.nodes.Count)
99 if (_index < _outer.nodes.Count)
102 return _index < _outer.nodes.Count;
172 public virtual int Count { property in class:Antlr.Runtime.Tree.BufferedTreeNodeStream
175 throw new InvalidOperationException("Cannot determine the Count before the buffer is filled.");
177 return nodes.Count;
284 for (int i = 0; i < nodes.Count; i++) {
335 if ((p + k - 1) >= nodes.Count) {
353 Console.Out.WriteLine( "start last node: " + i + " size==" + nodes.Count );
475 for (int i = 0; i < nodes.Count;
[all...]
H A DCommonErrorNode.cs74 j = ((ITokenStream)input).Count;
H A DCommonTree.cs201 for (int i = 0; i < Children.Count; i++) {
206 if (Children.Count > 0) {
208 CommonTree lastChild = (CommonTree)Children[Children.Count - 1];
H A DParseTree.cs108 for (int i = 0; i < hiddenTokens.Count; i++) {
135 for (int i = 0; Children != null && i < Children.Count; i++) {
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;
H A DRewriteRuleSubtreeStream.cs71 int n = Count;
H A DTreeIterator.cs100 if (nodes != null && nodes.Count > 0) {
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DANTLRStringStream.cs193 public virtual int Count { property in class:Antlr.Runtime.ANTLRStringStream
206 if (markDepth >= markers.Count) {
H A DBaseRecognizer.cs828 List<string> strings = new List<string>(tokens.Count);
920 n += ruleMap.Count; // how many input indexes are recorded?
H A DBufferedTokenStream.cs108 public virtual int Count { property in class:Antlr.Runtime.BufferedTokenStream
110 return _tokens.Count;
189 int n = i - _tokens.Count + 1; // how many more elements we need?
198 t.TokenIndex = _tokens.Count;
206 if (i < 0 || i >= _tokens.Count) {
207 throw new IndexOutOfRangeException("token index " + i + " out of range 0.." + (_tokens.Count - 1));
222 if (start + count >= _tokens.Count)
263 if (i >= _tokens.Count) {
265 return _tokens[_tokens.Count - 1];
294 if (stop >= _tokens.Count)
[all...]
H A DCommonToken.cs107 if (start < input.Count && stop < input.Count)

Completed in 371 milliseconds

1234567891011>>