HomeSort by relevance Sort by last modified time
    Searched defs:Mark (Results 26 - 47 of 47) sorted by null

12

  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
DebugEventRepeater.cs 89 public virtual void Mark(int i) {
90 _listener.Mark(i);
IDebugEventListener.cs 121 * The parser is going to look arbitrarily ahead; mark this location,
125 void Mark(int marker);
140 * Do not "pop" the marker off the state. mark(i)
173 * also must be rewound. Even the rewind for each mark must be unwount.
DebugEventSocketProxy.cs 196 public override void Mark(int i) {
197 Transmit("mark\t" + i);
Profiler.cs 288 * mark m
314 public override void Mark(int i) {
316 Console.WriteLine("mark " + i);
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
BufferedTokenStream.cs 67 /** Track the last mark() call result value for use in rewind(). */
166 public virtual int Mark()
LegacyCommonTokenStream.cs 74 /** <summary>Track the last mark() call result value for use in rewind().</summary> */
425 public virtual int Mark()
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Debug/
IDebugEventListener.cs 123 * The parser is going to look arbitrarily ahead; mark this location,
127 void Mark( int marker );
142 * Do not "pop" the marker off the state. mark(i)
175 * also must be rewound. Even the rewind for each mark must be unwount.
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
BlankDebugEventListener.cs 92 public virtual void Mark( int i )
DebugEventHub.cs 176 public virtual void Mark( int index )
181 listener.Mark( index );
DebugEventRepeater.cs 104 public virtual void Mark( int i )
106 _listener.Mark( i );
DebugEventSocketProxy.cs 223 public override void Mark( int i )
225 Transmit( "mark\t" + i );
Profiler.cs 314 * mark m
343 public override void Mark(int i)
346 Console.WriteLine("mark " + i);
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
BufferedTreeNodeStream.cs 48 * This stream knows how to mark/release for backtracking.
147 /** <summary>Track the last mark() call result value for use in rewind().</summary> */
388 public virtual int Mark() {
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
BufferedTreeNodeStream.cs 49 * This stream knows how to mark/release for backtracking.
156 /** <summary>Track the last mark() call result value for use in rewind().</summary> */
458 public virtual int Mark()
  /external/chromium_org/net/spdy/
spdy_priority_forest.h 89 // Mark the node as ready or not ready to read. Returns true on success, or
100 // Mark the node as ready or not ready to write. Returns true on success, or
138 bool Mark(NodeId node_id, unsigned int flag);
353 return Mark(node_id, kReadyToRead);
375 return Mark(node_id, kReadyToWrite);
397 bool SpdyPriorityForest<NodeId, Priority>::Mark(
  /external/libpcap/
optimize.c 103 * A block is marked if only if its mark equals the current mark.
108 #define isMarked(p) ((p)->mark == cur_mark)
110 #define Mark(p) ((p)->mark = cur_mark)
200 Mark(b);
    [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.pas 82 /// Executing Rewind(Mark()) on a stream should not affect the input position.
90 function Mark: Integer;
120 /// of the decision. Do not "pop" the marker off the state. Mark(I)
136 /// argument. So if you're nested 5 levels of Mark(), and then Release(2)
155 /// <see cref="IIntStream.Mark"/>/<see cref="IIntStream.Rewind(Integer)"/>
    [all...]
Antlr.Runtime.Tree.pas 696 /// This stream knows how to mark/release for backtracking.
    [all...]
  /external/chromium_org/third_party/re2/re2/
dfa.cc 90 // difficult to mark them as such.
379 #define Mark (-1)
388 // Constructor: n is number of normal slots, maxmark number of mark slots.
406 void mark() { function in class:re2::DFA::Workq
431 int nextmark_; // id of next mark
432 bool last_was_mark_; // last inserted was mark
536 if (state->inst_[i] == Mark) {
601 // This is implemented by separating different sets with Mark pointers.
618 bool sawmark = false; // whether queue contains a Mark
626 if (n > 0 && inst[n-1] != Mark) {
    [all...]
  /external/regex-re2/re2/
dfa.cc 88 // difficult to mark them as such.
377 #define Mark (-1)
386 // Constructor: n is number of normal slots, maxmark number of mark slots.
404 void mark() { function in class:re2::DFA::Workq
429 int nextmark_; // id of next mark
430 bool last_was_mark_; // last inserted was mark
534 if (state->inst_[i] == Mark) {
599 // This is implemented by separating different sets with Mark pointers.
616 bool sawmark = false; // whether queue contains a Mark
624 if (n > 0 && inst[n-1] != Mark) {
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.jasper_5.5.17.v201004212143.jar 
  /external/robolectric/lib/main/
javassist-3.14.0-GA.jar 

Completed in 1041 milliseconds

12