Home
last modified time | relevance | path

Searched refs:newNode (Results 1 – 6 of 6) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/tests/
Dlinked_node_test.cpp91 JSHandle<LinkedNode> newNode = factory->NewLinkedNode(hash, key, value, hole); in HWTEST_F_L0() local
92 EXPECT_TRUE(!newNode.GetTaggedValue().IsHole()); in HWTEST_F_L0()
93 EXPECT_TRUE(newNode.GetTaggedValue().IsLinkedNode()); in HWTEST_F_L0()
Drb_tree_node_test.cpp72 JSHandle<RBTreeNode> newNode = factory->NewTreeNode(hash, key, value); in HWTEST_F_L0() local
74 EXPECT_TRUE(!newNode.GetTaggedValue().IsHole()); in HWTEST_F_L0()
75 EXPECT_TRUE(newNode.GetTaggedValue().IsRBTreeNode()); in HWTEST_F_L0()
/arkcompiler/ets_frontend/ts2panda/templates/
DbuiltinsMap.ts.erb57 let newNode;
100 newNode = new ir.<%= insn2node(instr)%>(codeImm, imm, <ir.VReg[]>operands);
103 newNode = new ir.<%= insn2node(instr)%>(codeImm<%= parameters%>);
112 return newNode;
/arkcompiler/ets_runtime/test/moduletest/spreadoperator/
Dspreadoperator.js116 function appendChild(newNode) { argument
117 this.childNodes = [...this.childNodes, newNode];
/arkcompiler/ets_runtime/ecmascript/
Dtagged_hash_array.cpp180 JSHandle<LinkedNode> newNode = TaggedHashArray::NewLinkedNode(thread, hash, key, value); in SetVal() local
181 table->Set(thread, index, newNode.GetTaggedValue()); in SetVal()
199 JSHandle<LinkedNode> newNode = TaggedHashArray::NewLinkedNode(thread, hash, key, value); in SetVal() local
200 root->SetNext(thread, newNode); in SetVal()
/arkcompiler/ets_frontend/es2panda/binder/
Dbinder.cpp963 auto newNode = Allocator()->New<ir::NumberLiteral>(initialization->AsNumberLiteral()->Number()); in ReplaceConstReferenceWithInitialization() local
964 if (newNode == nullptr) { in ReplaceConstReferenceWithInitialization()
969 newNode->SetRange(ident->Range()); in ReplaceConstReferenceWithInitialization()
975 return static_cast<ir::AstNode *>(newNode); in ReplaceConstReferenceWithInitialization()