| /external/tensorflow/tensorflow/compiler/xla/service/ |
| dfs_hlo_visitor_with_default.h | 109 Status HandleReverse(HloInstructionPtr reverse) override {
110 return DefaultAction(reverse);
|
| /external/tensorflow/tensorflow/core/platform/ |
| file_system.cc | 190 // directories in reverse order.;
219 // Now reverse the list of directories and delete them. The BFS ensures that
221 std::reverse(dir_list.begin(), dir_list.end());
253 // sub_dirs contains all the dirs to be created but in reverse order.
254 std::reverse(sub_dirs.begin(), sub_dirs.end());
|
| /external/v8/tools/ |
| trace-maps-processor.py | 148 root_maps = sorted(root_maps, key=CountTransitions, reverse=True)
170 reasons_list.sort(reverse=True)
|
| /frameworks/support/jetifier/jetifier/core/src/main/kotlin/com/android/tools/build/jetifier/core/rule/ |
| RewriteRule.kt | 88 fun reverse(): RewriteRule {
|
| /frameworks/support/jetifier/jetifier/core/src/test/kotlin/com/android/tools/build/jetifier/core/ |
| TypeRewriterTest.kt | 90 )).reverse(),
|
| /libcore/ojluni/src/main/java/java/lang/ |
| StringBuilder.java | 400 public StringBuilder reverse() { method in class:StringBuilder
401 super.reverse();
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
297 // Add the loop nests in the reverse order of LoopInfo. For some reason,
303 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
297 // Add the loop nests in the reverse order of LoopInfo. For some reason,
303 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
297 // Add the loop nests in the reverse order of LoopInfo. For some reason,
303 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
297 // Add the loop nests in the reverse order of LoopInfo. For some reason,
303 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
297 // Add the loop nests in the reverse order of LoopInfo. For some reason,
303 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
297 // Add the loop nests in the reverse order of LoopInfo. For some reason,
303 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Scalar/ |
| LoopPassManager.h | 109 /// structure, so we append to it in *reverse* postorder.
111 /// For trees, a preorder traversal is a viable reverse postorder, so we
120 // We walk the initial sequence of loops in reverse because we generally want
122 for (Loop *RootL : reverse(Loops)) {
298 // Add the loop nests in the reverse order of LoopInfo. For some reason,
304 internal::appendLoopsToWorklist(reverse(LI), Worklist);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| UserList.py | 82 def reverse(self): self.data.reverse() member in class:UserList
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| UserList.py | 82 def reverse(self): self.data.reverse() member in class:UserList
|
| /prebuilts/go/darwin-x86/src/sort/ |
| example_interface_test.go | 47 // are ignored.) Here we re-sort in reverse order: compare
|
| /prebuilts/go/linux-x86/src/sort/ |
| example_interface_test.go | 47 // are ignored.) Here we re-sort in reverse order: compare
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| UserList.py | 82 def reverse(self): self.data.reverse() member in class:UserList
|
