Searched +refs:Tree +refs:insert (Results 1 - 13 of 13) sorted by relevance

/macosx-10.9.5/CPANInternal-140/Tree-Simple/t/
H A D12_Tree_Simple_exceptions_test.t10 ## Exception Tests for Tree::Simple
13 use Tree::Simple;
16 my $TEST_SUB_TREE = Tree::Simple->new("test");
24 Tree::Simple->new("test", 0);
29 Tree::Simple->new("test", []);
34 Tree::Simple->new("test", $BAD_OBJECT);
39 my $tree = Tree::Simple->new(Tree::Simple->ROOT);
57 } qr/^Insufficient Arguments : no tree\(s\) to insert/, '... this should die';
62 } qr/^Insufficient Arguments \: Child must be a Tree\
[all...]
/macosx-10.9.5/CPANInternal-140/Tree-Simple-1.18/t/
H A D12_Tree_Simple_exceptions_test.t10 ## Exception Tests for Tree::Simple
13 use Tree::Simple;
16 my $TEST_SUB_TREE = Tree::Simple->new("test");
24 Tree::Simple->new("test", 0);
29 Tree::Simple->new("test", []);
34 Tree::Simple->new("test", $BAD_OBJECT);
39 my $tree = Tree::Simple->new(Tree::Simple->ROOT);
57 } qr/^Insufficient Arguments : no tree\(s\) to insert/, '... this should die';
62 } qr/^Insufficient Arguments \: Child must be a Tree\
[all...]
/macosx-10.9.5/CPANInternal-140/Tree-Simple/lib/Tree/
H A DSimple.pm2 package Tree::Simple;
14 ## Tree::Simple
24 *Tree::Simple::weaken = \&Scalar::Util::weaken;
60 if (blessed($parent) && $parent->isa("Tree::Simple")) {
68 die "Insufficient Arguments : parent argument must be a Tree::Simple object";
79 (($parent eq $self->ROOT) || (blessed($parent) && $parent->isa("Tree::Simple"))))
80 || die "Insufficient Arguments : parent also must be a Tree::Simple object";
150 || die "Insufficient Arguments : Cannot insert child without index";
159 || die "Insufficient Arguments : no tree(s) to insert";
162 (blessed($tree) && $tree->isa("Tree
[all...]
/macosx-10.9.5/CPANInternal-140/Tree-Simple-1.18/lib/Tree/
H A DSimple.pm2 package Tree::Simple;
14 ## Tree::Simple
24 *Tree::Simple::weaken = \&Scalar::Util::weaken;
60 if (blessed($parent) && $parent->isa("Tree::Simple")) {
68 die "Insufficient Arguments : parent argument must be a Tree::Simple object";
79 (($parent eq $self->ROOT) || (blessed($parent) && $parent->isa("Tree::Simple"))))
80 || die "Insufficient Arguments : parent also must be a Tree::Simple object";
150 || die "Insufficient Arguments : Cannot insert child without index";
159 || die "Insufficient Arguments : no tree(s) to insert";
162 (blessed($tree) && $tree->isa("Tree
[all...]
/macosx-10.9.5/ruby-104/ruby/ext/tk/lib/tkextlib/blt/
H A Dtree.rb10 class Tree < TkObject class in class:Tk
84 @path = @id = tk_call(@tpath, 'insert', parent, keys)
350 Tk::BLT::Tree::Node.id2obj(@path, node)
441 cmd.call(Tk::BLT::Tree::Node.id2obj(@tree, id),
462 lst[0] = Tk::BLT::Tree::Notify.id2obj(@tree, lst[0])
546 tobj = Tk::BLT::Tree.id2obj(t)
547 if tobj.kind_of?(Tk::BLT::Tree)
548 nobj = Tk::BLT::Tree::Node.id2obj(tobj, id)
570 lst[0] = Tk::BLT::Tree::Trace.id2obj(@tree, lst[0])
621 *(names.collect{|n| (n.kind_of?(Tk::BLT::Tree))
782 def insert(parent, keys={}) method in class:Tk.Tree
[all...]
/macosx-10.9.5/ruby-104/ruby/ext/tk/lib/tkextlib/bwidget/
H A Dtree.rb12 class Tree < TkWindow class in class:Tk.BWidget
19 class Tk::BWidget::Tree
23 TkCommandNames = ['Tree'.freeze].freeze
24 WidgetClassName = 'Tree'.freeze
52 if tag.kind_of?(Tk::BWidget::Tree::Node)
193 Tk::BWidget::Tree::Node.id2obj(self, tk_send(findinfo, confine))
206 def insert(idx, parent, node, keys={}) method in class:Tk
207 tk_send('insert', idx, tagid(parent), tagid(node), *hash_kv(keys))
221 Tk::BWidget::Tree::Node.id2obj(self, tk_send('nodes', tagid(node), idx))
226 Tk::BWidget::Tree
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/
H A DReassociate.cpp519 assert(Visited.insert(Op) && "Not first visit!");
529 assert(Visited.insert(Op) && "Not first visit!");
793 RedoInsts.insert(NodesToRewrite[i]);
821 // instruction we are about to insert after them.
966 SmallVector<RepeatedValue, 8> Tree;
967 MadeChange |= LinearizeExprTree(BO, Tree);
969 Factors.reserve(Tree.size());
970 for (unsigned i = 0, e = Tree.size(); i != e; ++i) {
971 RepeatedValue E = Tree[i];
1006 RedoInsts.insert(B
[all...]
/macosx-10.9.5/tcl-102/tcl_ext/bwidget/bwidget/demo/
H A Dtree.tcl15 set frame [$nb insert end demoTree -text "Tree"]
22 set tree [Tree $sw.tree \
102 $tree insert end root home -text $rootdir -data $rootdir -open 1 \
133 $tree insert end $node n:$count \
204 $list insert end $subnode \
210 $list insert end f:$num \
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/tkextlib/bwidget/
H A Dtree.rb14 frame = nb.insert('end', 'demoTree', :text=>'Tree')
21 tree = Tk::BWidget::Tree.new(sw, :relief=>:flat, :borderwidth=>0,
134 tree.insert('end', 'root', 'home',
161 Tk::BWidget::Tree::Node.new(tree, node,
233 list.insert('end', subnode,
/macosx-10.9.5/tcl-102/tcl_ext/tclxml/tcldom/examples/
H A Ddomtree.tcl38 Tree::use
40 Widget::bwinclude domtree Tree .tree
66 # Create a DOM Tree widget
73 # Tree widget created
76 array set maps [list Tree {} :cmd {} .tree {}]
82 Widget::initFromODB domtree $path $maps(Tree)
86 set tree [eval ::Tree::create $path.tree $maps(.tree) \
161 eval Tree::delete $path.tree [Tree::nodes $path.tree root]
194 # Updates the Tree displa
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Vectorize/
H A DBBVectorize.cpp256 DenseMap<ValuePair, size_t> &Tree,
266 DenseMap<ValuePair, size_t> &Tree, ValuePair J);
585 AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(),
587 AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end());
825 Users.insert(J);
880 CandidatePairs.insert(ValuePair(I, J));
950 ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J)));
954 ConnectedPairs.insert(VPPair(P, ValuePair(*J, *I)));
966 ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J)));
989 ConnectedPairs.insert(VPPai
1125 buildInitialTreeFor( std::multimap<Value *, Value *> &CandidatePairs, std::vector<Value *> &PairableInsts, std::multimap<ValuePair, ValuePair> &ConnectedPairs, DenseSet<ValuePair> &PairableInstUsers, DenseMap<Value *, Value *> &ChosenPairs, DenseMap<ValuePair, size_t> &Tree, ValuePair J) argument
1181 pruneTreeFor( std::multimap<Value *, Value *> &CandidatePairs, std::vector<Value *> &PairableInsts, std::multimap<ValuePair, ValuePair> &ConnectedPairs, DenseSet<ValuePair> &PairableInstUsers, std::multimap<ValuePair, ValuePair> &PairableInstUserMap, DenseMap<Value *, Value *> &ChosenPairs, DenseMap<ValuePair, size_t> &Tree, DenseSet<ValuePair> &PrunedTree, ValuePair J, bool UseCycleCheck) argument
1376 DenseMap<ValuePair, size_t> Tree; local
[all...]
/macosx-10.9.5/CPANInternal-140/Perl-Ldap/contrib/
H A Dtklkup44 use Tk::Tree;
53 my %Tree = ();
179 $splashList->insert("0", "Reading initialization file")
195 $splashList->insert("0", "Setting tklkup GUI.")
226 $Global{'slist'}->insert("end", $Global{'LDAP_SERVER'});
652 $Tree{$ncbase} = $t1;
671 $splashList->insert("1", "Searching $ncbase")
678 $Tree{$ncbase} = $t1;
703 @NcKeys = sort(keys(%Tree));
741 $Global{dsadsls}->insert("en
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/utils/TableGen/
H A DCodeGenDAGPatterns.cpp599 DepVars.insert(i->first);
1022 DagInit *Tree = Operator->getValueAsDag("Fragment");
1024 if (Tree && dynamic_cast<DefInit*>(Tree->getOperator()))
1025 Op = dynamic_cast<DefInit*>(Tree->getOperator())->getDef();
1855 Children.insert(Children.begin(), IIDNode);
2050 SDNodes.insert(std::make_pair(Nodes.back(), Nodes.back()));
2068 SDNodeXForms.insert(std::make_pair(XFormNode, NodeXForm(SDNode, Code)));
2077 ComplexPatterns.insert(std::make_pair(AMs.back(), AMs.back()));
2093 DagInit *Tree local
2537 getInstructionsInTree(TreePatternNode *Tree, SmallVectorImpl<Record*> &Instrs) argument
3034 DagInit *Tree = CurPattern->getValueAsDag("PatternToMatch"); local
[all...]

Completed in 312 milliseconds