| /external/clang/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /external/clang/tools/scan-build-py/libscanbuild/resources/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /external/guava/guava/src/com/google/common/collect/ |
| Ordering.java | 62 * <li>{@link #reverse}
326 * Returns the reverse of this ordering; the {@code Ordering} equivalent to
330 // Ordering<String> o = Ordering.<String>natural().reverse();
332 public <S extends T> Ordering<S> reverse() { method in class:Ordering
422 * <p>Note that {@code ordering.lexicographical().reverse()} is not
423 * equivalent to {@code ordering.reverse().lexicographical()} (consider how
775 return reverse().leastOf(iterable, k);
793 return reverse().leastOf(iterator, k);
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 443 for (auto X : reverse(Stack)) {
477 for (auto &MBB : reverse(MF)) {
478 for (auto &MI : reverse(MBB)) {
|
| /external/python/cpython2/Parser/ |
| asdl.py | 158 attributes.reverse()
164 fields.reverse()
186 fields.reverse()
|
| /external/tensorflow/tensorflow/contrib/bayesflow/python/ops/ |
| csiszar_divergence_impl.py | 124 """The reverse Kullback-Leibler Csiszar-function in log-space.
132 When `self_normalized = True`, the KL-reverse Csiszar-function is:
146 The KL is "reverse" because in maximum likelihood we think of minimizing `q`
243 In a sense, this divergence is the "reverse" of the Arithmetic-Geometric
301 In a sense, this divergence is the "reverse" of the Jensen-Shannon
[all...] |
| /frameworks/base/tools/preload/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /platform_testing/tests/jank/UbSystemUiJankTests/src/android/platform/systemui/tests/jank/ |
| LauncherJankTests.java | 193 allApps.fling(Direction.reverse(dir), FLING_SPEED);
236 workspace.fling(Direction.reverse(dir));
263 allWidgets.fling(Direction.reverse(dir), FLING_SPEED);
|
| /prebuilts/clang/host/darwin-x86/clang-3289846/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-3859424/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-3289846/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-3859424/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-4053586/tools/scan-build/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-4393122/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-4479392/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-4579689/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-4630689/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /prebuilts/clang/host/linux-x86/clang-4639204/share/scan-build/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
