/external/jmonkeyengine/engine/src/core/com/jme3/collision/ |
H A D | CollisionResults.java | 48 private boolean sorted = true; field in class:CollisionResults 63 if (!sorted){ 65 sorted = true; 73 sorted = false; 84 if (!sorted){ 86 sorted = true; 96 if (!sorted){ 98 sorted = true; 105 if (!sorted){ 107 sorted [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | 2007-04-05-PackedBitFieldsOverlap-2.cpp | 10 unsigned long sorted : 1; member in struct:M_Packed
|
/external/dhcpcd/ |
H A D | if-pref.c | 79 struct interface *sorted, *ifp, *ifn, *ift; local 83 sorted = ifaces; 85 sorted->next = NULL; 88 if (ifcmp(ifp, sorted) == -1) { 89 ifp->next = sorted; 90 sorted = ifp; 94 for (ift = sorted; ift->next; ift = ift->next) { 107 ifaces = sorted;
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntList.java | 34 /** whether the values are currently sorted */ 35 private boolean sorted; field in class:IntList 94 sorted = true; 122 if (sorted != otherList.sorted) { 199 sorted = false; 221 if (sorted && (size > 1)) { 222 sorted = (value >= values[size - 2]); 246 sorted = 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/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | SortUtil.java | 119 private static void test(Float[] original, Float[] sorted, Comparator<Float> ic) { argument 124 System.arraycopy(original, 0, sorted, 0, original.length); 125 gsort(sorted, ic); 132 System.arraycopy(original, 0, sorted, 0, original.length); 133 qsort(sorted, ic); 140 System.arraycopy(original, 0, sorted, 0, original.length); 141 msort(original, sorted, ic); 148 System.arraycopy(original, 0, sorted, 0, original.length); 149 Arrays.sort(sorted, ic); 165 Float[] sorted [all...] |
/external/llvm/utils/ |
H A D | sort_includes.py | 67 local_headers = sorted(set(local_headers)) 68 project_headers = sorted(set(project_headers)) 69 system_headers = sorted(set(system_headers))
|
/external/openfst/src/lib/ |
H A D | symbol-table-ops.cc | 86 map<int, string> sorted; local 89 sorted[stiter.Value()] = stiter.Symbol(); 93 for (map<int, string>::const_iterator si = sorted.begin(); 94 si != sorted.end(); ++si) {
|
/external/openssl/crypto/stack/ |
H A D | stack.c | 86 sk->sorted=0; 105 ret->sorted=sk->sorted; 134 ret->sorted=0; 176 st->sorted=0; 314 if (st && !st->sorted) 325 st->sorted=1; 333 return st->sorted;
|
/external/webkit/Tools/Scripts/webkitpy/common/net/ |
H A D | failuremap.py | 47 return sorted(set(sum(failing_revisions, []))) 60 return sorted(result)
|
/external/doclava/src/com/google/doclava/ |
H A D | NavTree.java | 65 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); 70 sorted.put(cl.qualifiedName(), cl); 79 sorted.put(name, pkg); 82 data = makeYamlHDF(sorted, "docs.pages", data); 86 public static Data makeYamlHDF(SortedMap<String, Object> sorted, String base, Data data) { argument 90 for (String s : sorted.keySet()) { 91 Object o = sorted.get(s);
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | dblist.c | 119 dblist->sorted = 1; 140 dblist->sorted = src->sorted; 180 dblist->sorted = 0; 200 dblist->sorted = 0; 214 dblist->sorted = 1; 231 if (!dblist->sorted)
|
H A D | ext2fsP.h | 40 int sorted; member in struct:ext2_struct_dblist
|
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
H A D | requireprovidesorter.py | 20 top of the file to manage dependencies. These statements should be sorted 43 stay with the statement as it gets sorted. 58 of provided objects sorted alphabetically. For example: 62 None is returned if all goog.provide statements are already sorted. 66 sorted_provide_strings = sorted(provide_strings) 83 of required dependencies sorted alphabetically. For example: 87 None is returned if all goog.require statements are already sorted. 91 sorted_require_strings = sorted(require_strings) 123 sorted_strings = sorted(strings)
|
/external/linux-tools-perf/scripts/python/ |
H A D | syscall-counts.py | 57 for id, val in sorted(syscalls.iteritems(), key = lambda(k, v): (v, k), \
|
H A D | failed-syscalls-by-pid.py | 72 for ret, val in sorted(syscalls[comm][pid][id].iteritems(), key = lambda(k, v): (v, k), reverse = True):
|
/external/skia/tools/ |
H A D | download_baselines.py | 61 subdirs = sorted(svn.ListSubdirs(root_url)) 161 repo_to_modify.AddFiles(sorted(new_files)) 169 repo_to_modify.SetProperty(sorted(fnmatch.filter(modified_files, '*.png')), 171 repo_to_modify.SetProperty(sorted(fnmatch.filter(modified_files, '*.pdf')),
|
/external/webkit/Tools/Scripts/ |
H A D | make-gypi | 58 return '\n'.join([build_file_line(file_name, indent) for file_name in sorted(source_code)])
|
/external/chromium/chrome/browser/extensions/ |
H A D | extension_toolbar_model.cc | 168 // 1. Create a vector of extensions sorted by their pref values. This vector may 171 // 3. Remove holes from the sorted vector and append the unsorted vector. 178 ExtensionList sorted; local 179 sorted.resize(pref_order.size(), NULL); 195 sorted[index] = extension; 202 toolitems_.reserve(sorted.size() + unsorted.size()); 203 for (ExtensionList::iterator iter = sorted.begin(); 204 iter != sorted.end(); ++iter) {
|
/external/e2fsprogs/resize/ |
H A D | extent.c | 31 int sorted; member in struct:_ext2_extent 50 extent->sorted = 1; 114 extent->sorted = 0; 148 if (!extent->sorted) { 151 extent->sorted = 1; 203 extent->num, extent->size, extent->cursor, extent->sorted);
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | FixedSizeArray.java | 24 * to provide a contiguous array of fixed length which can be accessed, sorted, and searched without 183 * Searches the array for the specified object. If the array has been sorted with sort(), 197 final boolean sorted = mSorted; 200 if (sorted && !ignoreComparator && count > LINEAR_SEARCH_CUTOFF) { 220 } else if (result > 0 && sorted) { 238 * Sorts the array. If the array is already sorted, no work will be performed unless
|
/external/clang/utils/TableGen/ |
H A D | ClangSACheckersEmitter.cpp | 268 std::map<int, const Record *> sorted; local 271 sorted[(*I)->getID()] = *I; 274 I = sorted.begin(), E = sorted.end(); I != E; ++I) 283 std::map<int, const Record *> sorted; local 286 sorted[(*I)->getID()] = *I; 289 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
|
/external/opencv/ml/src/ |
H A D | mlboost.cpp | 211 const CvPair32s32f* sorted = data->get_ord_var_data(node,vi); local 220 int idx = sorted[i].i; 228 int idx = sorted[i].i; 235 dir[sorted[i].i] = (char)0; 247 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local 262 int idx = sorted[i].i; 277 int idx = sorted[i].i; 287 if( sorted[i].val + epsilon < sorted[i+1].val ) 302 int idx = sorted[ 443 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local 574 const CvPair32s32f* sorted = data->get_ord_var_data(node, vi); local [all...] |
/external/icu4c/test/depstest/ |
H A D | depstest.py | 158 sorted(files_missing_from_deps)) 162 sorted(files_missing_from_build)) 173 sorted(virtual_classes_with_weak_destructors)) 183 print "Info: ignored symbols:\n%s" % sorted(_ignored_symbols)
|
/external/libvorbis/vq/ |
H A D | vqgen.h | 23 int sorted; member in struct:vqgen
|