/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | ... .util.Set nondetAlts
java.util.List sorted
public java.util.Set getDFAStatesWithSyntacticallyAmbiguousAlts () public java. ... |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3collections.h | 395 * to be sorted will be numeric indexes into some other structure such as an ANTLR3_VECTOR. 398 * array of the sorted noded indexes, in case you are not sorting ANTLR3_VECTORS but 417 * A vector used to build up the sorted output order. Note that 421 pANTLR3_UINT32 sorted; member in struct:ANTLR3_TOPO_struct 452 * One more than the largest node index that is contained in edges/sorted. 479 * A method that returns a pointer to an array of sorted node indexes. 480 * The array is sorted in topological sorted order. Note that the array 483 * was 16, then the returned array will be the sorted order of the first 16 487 * NB: If the structure that contains the array is freed, then the sorted [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 83 ArrayList<Object> sorted = new ArrayList<Object>(); 91 DFS(n, visited, sorted); 93 return sorted; 96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { argument 102 DFS(target, visited, sorted); 105 sorted.add(n.payload);
|
/external/chromium_org/chrome/browser/extensions/ |
H A D | extension_toolbar_model.cc | 365 // 1. Create a vector of extensions sorted by their pref values. This vector may 368 // 3. Remove holes from the sorted vector and append the unsorted vector. 382 ExtensionList sorted; local 383 sorted.resize(positions.size(), NULL); 405 sorted[pos - positions.begin()] = extension; 423 toolbar_items_.reserve(sorted.size() + unsorted.size()); 425 for (ExtensionList::const_iterator iter = sorted.begin(); 426 iter != sorted.end(); ++iter) {
|
/external/chromium_org/chrome/browser/safe_browsing/ |
H A D | safe_browsing_store.cc | 13 // Return |true| if the range is sorted by the given comparator. 15 bool sorted(CTI beg, CTI end, LESS less) { function in namespace:__anon4616 104 // Make sure things are sorted appropriately. 105 DCHECK(sorted(add_prefixes->begin(), add_prefixes->end(), 107 DCHECK(sorted(sub_prefixes->begin(), sub_prefixes->end(), 109 DCHECK(sorted(add_full_hashes->begin(), add_full_hashes->end(), 111 DCHECK(sorted(sub_full_hashes->begin(), sub_full_hashes->end(),
|
H A D | safe_browsing_store_file.cc | 28 // Starting with version 8, the storage is sorted and can be sharded to allow 292 // Return |true| if the range is sorted by the given comparator. 294 bool sorted(CTI beg, CTI end, LESS less) { function in namespace:__anon4617 304 // Merge |beg|..|end| into |container|. Both should be sorted by the given 310 DCHECK(sorted(container->begin(), container->end(), less)); 311 DCHECK(sorted(beg, end, less)); 342 DCHECK(sorted(container->begin(), container->end(), less)); 394 // The current state and the range given should corrospond to the same sorted
|
/external/chromium_org/chrome/common/extensions/docs/examples/apps/hello-python/httplib2/ |
H A D | __init__.py | 94 def sorted(seq): function in function:has_timeout 897 auth = auths and sorted(auths)[0][1] or None
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
H A D | HeapSnapshotGridNodes.js | 275 function sorted() 279 this._provider().sortAndRewind(this.comparator(), sorted.bind(this));
|
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
H A D | backward.py | 17 # Python 2.3 doesn't have `sorted`. 19 sorted = sorted variable 21 def sorted(iterable): function 22 """A 2.3-compatible implementation of `sorted`."""
|
H A D | cmdline.py | 5 from coverage.backward import sorted # pylint: disable=W0622 namespace 495 filenames = sorted(summary.keys())
|
H A D | data.py | 5 from coverage.backward import pickle, sorted # pylint: disable=W0622 namespace 16 * lines: a dict mapping filenames to sorted lists of line numbers 20 * arcs: a dict mapping filenames to sorted lists of line number pairs: 64 self.sorted = sorted 104 [(f, self.sorted(lmap.keys())) for f, lmap in self.lines.items()] 110 [(f, self.sorted(amap.keys())) for f, amap in self.arcs.items()]
|
H A D | misc.py | 4 from coverage.backward import md5, sorted # pylint: disable=W0622 namespace 103 for k in sorted(keys):
|
H A D | parser.py | 5 from coverage.backward import set, sorted, StringIO # pylint: disable=W0622 namespace 179 Returns a sorted list of the first lines. 190 return sorted(lset) 195 Return values are 1) a sorted list of executable line numbers, and 196 2) a sorted list of excluded line numbers. 213 Returns a sorted list of line number pairs. Line numbers have been 223 return sorted(all_arcs)
|
H A D | results.py | 5 from coverage.backward import set, sorted # pylint: disable=W0622 namespace 35 self.missing = sorted(set(self.statements) - set(exec1)) 73 """Returns a sorted list of the arcs in the code.""" 78 """Returns a sorted list of the arcs actually executed in the code.""" 82 return sorted(executed) 85 """Returns a sorted list of the arcs in the code not executed.""" 93 return sorted(missing) 96 """Returns a sorted list of the executed arcs missing from the code.""" 107 return sorted(unpredicted)
|
H A D | xmlreport.py | 7 from coverage.backward import sorted # pylint: disable=W0622 namespace 63 for pkg_name in sorted(self.packages.keys()): 70 for class_name in sorted(class_elts.keys()):
|
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |
/external/chromium_org/third_party/boringssl/src/include/openssl/ |
H A D | stack.h | 101 /* sorted is non-zero if the values pointed to by |data| are in ascending 103 size_t sorted; member in struct:stack_st 254 * stack will be sorted if need be so that a binary search can be used. 277 * comparison function. The stack maintains a |sorted| flag and sorting an 278 * already sorted stack is a no-op. */ 281 /* sk_is_sorted returns one if |sk| is known to be sorted and zero
|
/external/chromium_org/third_party/brotli/src/brotli/dec/ |
H A D | huffman.c | 74 int symbol; /* symbol index in original or sorted table */ 82 int* sorted; /* symbols sorted by code length */ local 84 int offset[MAX_LENGTH + 1]; /* offsets in sorted table for each length */ 86 sorted = (int*)malloc((size_t)code_lengths_size * sizeof(*sorted)); 87 if (sorted == NULL) { 96 /* generate offsets into sorted symbol table by code length */ 105 sorted[offset[code_lengths[symbol]]++] = symbol; 117 code.value = (uint16_t)sorted[ [all...] |
/external/chromium_org/third_party/closure_compiler/compiler/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ... |
/external/chromium_org/third_party/freetype/src/pshinter/ |
H A D | pshalgo.c | 119 PSH_Hint* sorted = table->sort_global; local 125 for ( ; count > 0; count--, sorted++ ) 127 hint2 = sorted[0]; 140 FT_TRACE0(( "psh_hint_table_record: too many sorted hints! BUG!\n" )); 317 /* will be already sorted -- and the sort will be linear */
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | EdgeWalker.cpp | 1463 // intersected. Later, when sorted, and this near-coincidence is found, 1875 HorizontalEdge** sorted = horizontal; local 1876 horzEdge = *sorted; 1912 horzEdge = *++sorted; 2330 // the coincident edges may not have been sorted above -- advance 2681 // walk the sorted edges from top to bottom, computing accumulated winding
|
H A D | ShapeOps.cpp | 43 SkTDArray<Angle*> sorted; local 44 bool sortable = Segment::SortAngles(angles, sorted); 45 int angleCount = sorted.count(); 47 sorted[0]->segment()->debugShowSort(__FUNCTION__, sorted, 0); 56 angle = sorted[++firstIndex]; 60 segment->debugShowSort(__FUNCTION__, sorted, firstIndex); 75 angle = sorted[nextIndex];
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsSkpClipTest.cpp | 619 SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) { 645 if (!sorted) { 651 *sorted[dirNo - firstDirNo].append() = (SortByName*) &testSet[index]; 653 if (sorted[dirNo - firstDirNo].count()) { 654 SkTQSort<SortByName>(sorted[dirNo - firstDirNo].begin(), 655 sorted[dirNo - firstDirNo].end() - 1); 702 SkTDArray<SortByName*> sorted[1]; local 703 if (!buildTestDir(dirNo, dirNo, tests, sorted)) { 719 int count = sorted[0].count(); 720 int idx = SkTSearch<SortByName, Less>(sorted[ 618 buildTestDir(int dirNo, int firstDirNo, SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) argument 880 buildTests(SkTDArray<TestResult>* tests, SkTDArray<SortByName*>* sorted) argument [all...] |
/external/chromium_org/third_party/sqlite/src/tool/ |
H A D | lemon.c | 278 struct state **sorted; /* Table of states sorted by state number */ member in struct:lemon 813 /* Extract the sorted basis of the new state. The basis was constructed 932 stp = lemp->sorted[i]; 941 stp = lemp->sorted[i]; 965 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ 973 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ 1005 stp = lemp->sorted[i]; 1029 Action_add(&lemp->sorted[0]->ap,ACCEPT,sp,0); 1035 stp = lemp->sorted[ [all...] |