/third_party/icu/icu4c/source/tools/ctestfw/ |
D | ctest.c | 225 TestNode *nextNode, *curNode; in addTestNode() local 237 nextNode = curNode->child; in addTestNode() 245 if( nextNode == NULL ) in addTestNode() 265 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode() 267 curNode = nextNode; in addTestNode() 268 nextNode = nextNode -> sibling; in addTestNode() 270 if ( nextNode == NULL ) in addTestNode() 273 nextNode = createTestNode(name, nameLen); in addTestNode() 274 curNode->sibling = nextNode; in addTestNode() 283 return nextNode; in addTestNode() [all …]
|
/third_party/skia/third_party/externals/icu/source/tools/ctestfw/ |
D | ctest.c | 225 TestNode *nextNode, *curNode; in addTestNode() local 237 nextNode = curNode->child; in addTestNode() 245 if( nextNode == NULL ) in addTestNode() 265 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode() 267 curNode = nextNode; in addTestNode() 268 nextNode = nextNode -> sibling; in addTestNode() 270 if ( nextNode == NULL ) in addTestNode() 273 nextNode = createTestNode(name, nameLen); in addTestNode() 274 curNode->sibling = nextNode; in addTestNode() 283 return nextNode; in addTestNode() [all …]
|
/third_party/flutter/skia/third_party/externals/icu/source/tools/ctestfw/ |
D | ctest.c | 225 TestNode *nextNode, *curNode; in addTestNode() local 237 nextNode = curNode->child; in addTestNode() 245 if( nextNode == NULL ) in addTestNode() 265 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode() 267 curNode = nextNode; in addTestNode() 268 nextNode = nextNode -> sibling; in addTestNode() 270 if ( nextNode == NULL ) in addTestNode() 273 nextNode = createTestNode(name, nameLen); in addTestNode() 274 curNode->sibling = nextNode; in addTestNode() 283 return nextNode; in addTestNode() [all …]
|
/third_party/typescript/src/services/ |
D | smartSelection.ts | 15 const nextNode: Node | undefined = children[i + 1]; constant 39 … if (isTemplateSpan(parentNode) && nextNode && isTemplateMiddleOrTemplateTail(nextNode)) { 41 const end = nextNode.getStart() + "}".length; 47 …isBetweenMultiLineBookends = isSyntaxList(node) && isListOpener(prevNode) && isListCloser(nextNode) 48 … && !positionsAreOnSameLine(prevNode.getStart(), nextNode.getStart(), sourceFile); 50 … const end = isBetweenMultiLineBookends ? nextNode.getStart() : getEndPos(sourceFile, node); constant
|
/third_party/icu/icu4c/source/common/unicode/ |
D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument 301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode() 317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument 318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode() 319 length(len), next(nextNode) {} in LinearMatchNode() 408 Node *nextNode) const = 0;
|
D | bytestriebuilder.h | 158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode); 166 Node *nextNode) const;
|
D | ucharstriebuilder.h | 159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode); 167 Node *nextNode) const;
|
/third_party/node/deps/icu-small/source/common/unicode/ |
D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument 301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode() 317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument 318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode() 319 length(len), next(nextNode) {} in LinearMatchNode() 408 Node *nextNode) const = 0;
|
D | ucharstriebuilder.h | 159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode); 167 Node *nextNode) const override;
|
D | bytestriebuilder.h | 158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode); 166 Node *nextNode) const override;
|
/third_party/flutter/skia/third_party/externals/icu/source/common/unicode/ |
D | stringtriebuilder.h | 297 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument 298 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode() 314 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument 315 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode() 316 length(len), next(nextNode) {} in LinearMatchNode() 405 Node *nextNode) const = 0;
|
D | ucharstriebuilder.h | 155 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode); 163 Node *nextNode) const;
|
D | bytestriebuilder.h | 150 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode); 158 Node *nextNode) const;
|
/third_party/skia/third_party/externals/icu/source/common/unicode/ |
D | stringtriebuilder.h | 300 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument 301 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode() 317 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument 318 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode() 319 length(len), next(nextNode) {} in LinearMatchNode() 408 Node *nextNode) const = 0;
|
D | bytestriebuilder.h | 158 BTLinearMatchNode(const char *units, int32_t len, Node *nextNode); 166 Node *nextNode) const;
|
D | ucharstriebuilder.h | 159 UCTLinearMatchNode(const char16_t *units, int32_t len, Node *nextNode); 167 Node *nextNode) const;
|
/third_party/mesa3d/src/gallium/auxiliary/cso_cache/ |
D | cso_hash.h | 162 struct cso_node **nextNode = cso_hash_find_node(hash, key); in cso_hash_find() local 163 struct cso_hash_iter iter = {hash, *nextNode}; in cso_hash_find()
|
/third_party/flutter/skia/third_party/externals/icu/source/common/ |
D | ucharstriebuilder.cpp | 288 …rieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument 289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode() 315 Node *nextNode) const { in createLinearMatchNode() 319 nextNode); in createLinearMatchNode()
|
D | bytestriebuilder.cpp | 340 …esTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument 341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode() 368 Node *nextNode) const { in createLinearMatchNode() 372 nextNode); in createLinearMatchNode()
|
/third_party/skia/third_party/externals/icu/source/common/ |
D | ucharstriebuilder.cpp | 288 …rieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument 289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode() 315 Node *nextNode) const { in createLinearMatchNode() 319 nextNode); in createLinearMatchNode()
|
D | bytestriebuilder.cpp | 340 …esTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument 341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode() 368 Node *nextNode) const { in createLinearMatchNode() 372 nextNode); in createLinearMatchNode()
|
/third_party/icu/icu4c/source/common/ |
D | ucharstriebuilder.cpp | 288 …rieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument 289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode() 315 Node *nextNode) const { in createLinearMatchNode() 319 nextNode); in createLinearMatchNode()
|
D | bytestriebuilder.cpp | 340 …esTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument 341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode() 368 Node *nextNode) const { in createLinearMatchNode() 372 nextNode); in createLinearMatchNode()
|
/third_party/node/deps/icu-small/source/common/ |
D | ucharstriebuilder.cpp | 288 …rieBuilder::UCTLinearMatchNode::UCTLinearMatchNode(const UChar *units, int32_t len, Node *nextNode) in UCTLinearMatchNode() argument 289 : LinearMatchNode(len, nextNode), s(units) { in UCTLinearMatchNode() 315 Node *nextNode) const { in createLinearMatchNode() 319 nextNode); in createLinearMatchNode()
|
D | bytestriebuilder.cpp | 340 …esTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode) in BTLinearMatchNode() argument 341 : LinearMatchNode(len, nextNode), s(bytes) { in BTLinearMatchNode() 368 Node *nextNode) const { in createLinearMatchNode() 372 nextNode); in createLinearMatchNode()
|