Searched defs:newRight (Results 1 – 7 of 7) sorted by relevance
| /external/cronet/third_party/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | RopeByteString.java | 196 ByteString newRight = concatenateBytes(leftRope.right, right); in concatenate() local
207 ByteString newRight = new RopeByteString(leftRope.right, right); in concatenate() local
|
| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | RopeByteString.java | 196 ByteString newRight = concatenateBytes(leftRope.right, right); in concatenate() local
207 ByteString newRight = new RopeByteString(leftRope.right, right); in concatenate() local
|
| /external/angle/src/compiler/translator/tree_ops/msl/ |
| D | RewriteUnaddressableReferences.cpp | 343 TIntermTyped &newRight = traverse(rightNode, disableRight); in visitBinaryPre() local
|
| D | SeparateCompoundExpressions.cpp | 432 TIntermTyped *newRight = pullMappedExpr(right, true); in visitBinaryPost() local
455 TIntermTyped *newRight = pullMappedExpr(right, isAssign && !isCompoundAssign); in visitBinaryPost() local
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 477 TreeTy* createNode(TreeTy* newLeft, TreeTy* oldTree, TreeTy* newRight) { in createNode()
581 TreeTy* newRight = removeMinBinding(R,OldNode); in combineTrees() local
|
| /external/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 477 TreeTy* createNode(TreeTy* newLeft, TreeTy* oldTree, TreeTy* newRight) { in createNode()
581 TreeTy* newRight = removeMinBinding(R,OldNode); in combineTrees() local
|
| /external/angle/src/compiler/translator/msl/ |
| D | IntermRebuild.cpp | 585 auto *const newRight = traverseAnyAs<TIntermTyped>(*right); in traverseBinaryChildren() local
|