/frameworks/opt/vcard/tests/res/raw/ |
v40_sort_as.vcf | 4 N;SORT-AS="????;???":??;???;;;
5 ORG;TYPE=WORK;SORT-AS="????;???????":????;????
|
v30_simple.vcf | 6 SORT-STRING:android
|
/external/dhcpcd/dhcpcd-hooks/ |
01-test | 4 set | grep "^\(interface\|metric\|pid\|reason\|skip_hooks\)=" | sort 5 set | grep "^\(new_\|old_\)" | sort
|
02-dump | 4 set | sed -ne 's/^new_//p' | sort
|
/build/tools/ |
print_module_licenses.sh | 2 find . -name MODULE_LICENSE_\* | sed 's/\/MODULE_LICENSE_/\ /' | sed 's/\.\///' | awk '{ print $2 " " $1; }' | sort
|
/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
p11.cpp | 4 template<class T> void sort(Array<T>& v); 6 // explicit specialization for sort(Array<int>&) 8 template<> void sort(Array<int>&);
|
p6.cpp | 44 template<class T> void sort(Array<T>& v) { /* ... */ } function 50 sort(v); // expected-note{{required}} 52 // sort(Array<T>&), T is String 55 template<> void sort<String>(Array<String>& v); // // expected-error{{after instantiation}} 56 template<> void sort<>(Array<char*>& v); // OK: sort<char*> not yet used
|
/cts/tests/tests/webkitsecurity/assets/ |
sort-no-jit-code-crash.js | 2 "This test checks that non-numeric sort functions always have JIT code. This test passes if it does not crash." 9 [].sort(f);
|
sort-no-jit-code-crash.html | 7 <script src="script-tests/sort-no-jit-code-crash.js"></script>
|
/external/oprofile/libpp/ |
symbol_sort.h | 22 // order give sort order if caller doesn't specify one 39 * Sort the given container by the given criteria. 41 void sort(symbol_collection & syms, bool reverse_sort, 45 * Sort the given container by the given criteria. 47 void sort(diff_collection & syms, bool reverse_sort,
|
/external/bluetooth/glib/tests/ |
qsort-test.c | 11 sort (gconstpointer a, gconstpointer b, gpointer user_data) function 24 g_qsort_with_data (array, SIZE, sizeof (guint32), sort, NULL); 30 g_qsort_with_data (array, 0, sizeof (guint32), sort, NULL);
|
/external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
p6.cpp | 4 template<class T> void sort(Array<T>& v) { } function 6 // instantiate sort(Array<int>&) - template-argument deduced 7 template void sort<>(Array<int>&); 9 template void sort(Array<long>&);
|
/ndk/sources/host-tools/make-3.81/tests/scripts/variables/ |
special | 9 X1 := $(sort $(filter FOO BAR,$(.VARIABLES))) 13 X2 := $(sort $(filter FOO BAR,$(.VARIABLES))) 20 @echo LAST = $(sort $(filter FOO BAR,$(.VARIABLES))) 31 # X1 := $(sort $(.TARGETS)) 36 # @echo LAST = $(sort $(.TARGETS)) 38 # X2 := $(sort $(.TARGETS))
|
/external/clang/test/CodeCompletion/ |
function-templates.cpp | 3 void sort(RandomAccessIterator first, RandomAccessIterator last); 15 std::sort(1, 2); 19 // CHECK-CC1: sort(<#RandomAccessIterator first#>, <#RandomAccessIterator last#>
|
/external/proguard/src/proguard/classfile/editor/ |
AttributeSorter.java | 45 // Sort the attributes. 46 Arrays.sort(programClass.attributes, 0, programClass.u2attributesCount, this); 48 // Sort the attributes of the class members. 58 // Sort the attributes. 59 Arrays.sort(programMember.attributes, 0, programMember.u2attributesCount, this); 61 // Sort the attributes of the attributes. 73 // Sort the attributes. 74 Arrays.sort(codeAttribute.attributes, 0, codeAttribute.u2attributesCount, this);
|
/external/chromium/chrome/browser/resources/shared/js/cr/ui/table/ |
table_data_model.js | 34 * array before sort. 74 * Returns current sort status. 75 * @return {!Object} Current sort status. 89 * This implementation runs sort after splice and creates permutation for 140 * This implementation runs sort after updating. 147 this.sort(this.sortStatus.field, this.sortStatus.direction); 151 * Creates sort status with given field and direction. 152 * @param {string} field Sort field. 153 * @param {string} direction Sort direction. 154 * @return {!Object} Created sort status [all...] |
/external/junit/src/org/junit/runner/manipulation/ |
package-info.java | 2 * Provides classes to {@link org.junit.runner.manipulation.Filter filter} or {@link org.junit.runner.manipulation.Sorter sort} tests.
|
/external/libvpx/tools/ |
gen_authors.sh | 9 $(git log --pretty=format:"%aN <%aE>" | sort | uniq)
|
/external/openssl/crypto/lhash/ |
num.pl | 13 @a=sort {$a <=> $b } keys %num;
|
/external/qemu-pc-bios/bochs/bios/ |
bios_usage | 2 gcc -E rombios.c | grep "^\.org" | sed -e 's/\.org //' | sed -e 's/ .*//' | sort >! temp.usage
|
/packages/apps/Contacts/tests/assets/ |
v30_simple.vcf | 6 SORT-STRING:android
|
/external/replicaisland/src/com/replica/replicaisland/ |
ShellSorter.java | 23 * Shell sort implementation based on the one found here: 30 public void sort(Type[] array, int count, Comparator<Type> comparator) { method in class:ShellSorter 33 // Sort by insertion sort at diminishing increments. 49 * Insertion sort modified to sort elements at a 53 * 'if', but I found that it made the sort slower.
|
/external/v8/test/mjsunit/regress/ |
regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0] 32 Array.prototype.sort.call(nonArray); 35 assertEquals(37, nonArray[0], "sort smallest first"); 36 assertEquals(42, nonArray[1], "sort largest last"); 38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
/frameworks/compile/libbcc/runtime/make/ |
lib_info.mk | 17 AvailableArchs := $(sort $(foreach key,$(SubDirKeys),\ 20 AvailableFunctions := $(sort $(foreach key,$(SubDirKeys),\ 23 CommonFunctions := $(sort\ 32 $(call Append,ArchFunctions.$(arch),$(sort \ 37 $(call Set,ArchFunctions.$(arch),$(sort $(ArchFunctions.$(arch))))\
|
/frameworks/native/include/utils/ |
StringArray.h | 29 // An expanding array of strings. Add, get, sort, delete. 47 // Sort the array. 49 void sort(int (*compare)(const void*, const void*)); 52 // Pass this to the sort routine to do an ascending alphabetical sort.
|