| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/testutil/ |
| random_tree_gen.h | 36 // If one wants to generate multiple trees with the same depth, see also the
38 boosted_trees::trees::DecisionTreeConfig Generate(int depth);
42 boosted_trees::trees::DecisionTreeConfig Generate(
43 const boosted_trees::trees::DecisionTreeConfig& tree);
46 boosted_trees::trees::DecisionTreeEnsembleConfig GenerateEnsemble(
54 // Put together a deeper tree by combining two trees.
55 void Combine(boosted_trees::trees::DecisionTreeConfig* root,
56 boosted_trees::trees::DecisionTreeConfig* left_branch,
57 boosted_trees::trees::DecisionTreeConfig* right_branch);
61 void ShiftNodeIndex(boosted_trees::trees::DecisionTreeConfig* tree
[all...] |
| random_tree_gen_main.cc | 37 string filename = "/tmp/trees.pb";
58 const auto& trees = tree_gen.GenerateEnsemble(depth, tree_count); local
60 tensorflow::WriteBinaryProto(tensorflow::Env::Default(), filename, trees);
|
| random_tree_gen.cc | 25 using boosted_trees::trees::DenseFloatBinarySplit;
26 using tensorflow::boosted_trees::trees::DecisionTreeConfig;
27 using tensorflow::boosted_trees::trees::TreeNode;
67 boosted_trees::trees::DecisionTreeEnsembleConfig* ret) {
77 boosted_trees::trees::DecisionTreeEnsembleConfig
79 boosted_trees::trees::DecisionTreeEnsembleConfig ret;
83 *(ret.add_trees()) = Generate(ret.trees(0));
|
| /external/toolchain-utils/binary_search_tool/full_bisect_test/ |
| test_setup.sh | 15 gcc -o bin-trees work/*.o
|
| build.sh | 4 # the test binary, 'bin-trees'. The .o files all go into the 'work' directory.
21 gcc -o bin-trees work/main.o work/preorder.o work/inorder.o work/build.o work/preorder_norecurse.o work/inorder_norecurse.o work/stack.o
|
| /external/dtc/tests/ |
| dumptrees.c | 35 } trees[] = { variable in typeref:struct:__anon20731
42 #define NUM_TREES (sizeof(trees) / sizeof(trees[0]))
49 void *blob = trees[i].blob;
50 const char *filename = trees[i].filename;
|
| /external/brotli/csharp/org/brotli/dec/ |
| HuffmanTreeGroup.cs | 8 /// <summary>Contains a collection of huffman trees with the same alphabet size.</summary>
22 internal int[] trees;
field in class:Org.Brotli.Dec.HuffmanTreeGroup
32 group.trees = new int[n];
35 /// <summary>Decodes Huffman trees from input stream and constructs lookup tables.</summary>
41 int n = group.trees.Length;
44 group.trees[i] = next;
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/common/partitioners/ |
| example_partitioner.h | 19 #include "tensorflow/contrib/boosted_trees/lib/trees/decision_tree.h"
33 static void UpdatePartitions(const trees::DecisionTreeConfig& tree_config,
42 static void PartitionExamples(const trees::DecisionTreeConfig& tree_config,
|
| example_partitioner.cc | 23 const boosted_trees::trees::DecisionTreeConfig& tree_config,
41 example_partition = boosted_trees::trees::DecisionTree::Traverse(
56 const boosted_trees::trees::DecisionTreeConfig& tree_config,
73 uint32 partition = boosted_trees::trees::DecisionTree::Traverse(
|
| example_partitioner_test.cc | 41 boosted_trees::trees::DecisionTreeConfig tree_config;
53 boosted_trees::trees::DecisionTreeConfig tree_config;
76 boosted_trees::trees::DecisionTreeConfig tree_config;
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/common/stats/ |
| feature-split-candidate.h | 36 const boosted_trees::trees::TreeNode& node,
47 boosted_trees::trees::TreeNode tree_node;
|
| /external/freetype/src/gzip/ |
| infblock.c | 43 However, static trees define 32 codes (all 5 bits) to fill out the
75 ZFREE(z, s->sub.trees.blens);
218 s->sub.trees.table = t = (uInt)b & 0x3fff;
229 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
235 s->sub.trees.index = 0;
239 while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
242 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
245 while (s->sub.trees.index < 19
[all...] |
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/models/ |
| multiple_additive_trees.h | 30 // Multiple additive trees prediction model.
35 // output predictions accordingly, for the given list of trees.
39 // examples X num of trees.
41 const boosted_trees::trees::DecisionTreeEnsembleConfig& config,
|
| multiple_additive_trees.cc | 16 #include "tensorflow/contrib/boosted_trees/lib/trees/decision_tree.h"
25 const boosted_trees::trees::DecisionTreeEnsembleConfig& config,
51 const boosted_trees::trees::DecisionTreeConfig& tree =
52 config.trees(tree_idx);
54 const int leaf_idx = trees::DecisionTree::Traverse(tree, 0, example);
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/ |
| decision_tree.h | 23 namespace trees { namespace in namespace:tensorflow::boosted_trees
45 } // namespace trees
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/resources/ |
| decision_tree_ensemble_resource.h | 18 #include "tensorflow/contrib/boosted_trees/lib/trees/decision_tree.h"
35 boosted_trees::trees::DecisionTreeEnsembleConfig>(&arena_)) {}
42 const boosted_trees::trees::DecisionTreeEnsembleConfig&
65 boosted_trees::trees::GrowingMetadata* const growing_metadata =
76 boosted_trees::trees::DecisionTreeConfig* AddNewTree(const float weight) {
79 boosted_trees::trees::DecisionTreeMetadata* const metadata =
92 boosted_trees::trees::DecisionTreeConfig* LastTree() {
98 boosted_trees::trees::DecisionTreeMetadata* LastTreeMetadata() {
168 boosted_trees::trees::DecisionTreeEnsembleConfig>(&arena_);
176 boosted_trees::trees::DecisionTreeEnsembleConfig* decision_tree_ensemble_
[all...] |
| /external/zlib/src/watcom/ |
| watcom_l.mak | 10 trees.c uncompr.c zutil.c
15 trees.obj uncompr.obj zutil.obj
32 wlib -b -c $(ZLIB_LIB) -+trees.obj -+uncompr.obj -+zutil.obj
|
| watcom_f.mak | 10 trees.c uncompr.c zutil.c
15 trees.obj uncompr.obj zutil.obj
32 wlib -b -c $(ZLIB_LIB) -+trees.obj -+uncompr.obj -+zutil.obj
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/ |
| training_ops.cc | 34 using boosted_trees::trees::Leaf;
35 using boosted_trees::trees::TreeNode;
36 using boosted_trees::trees::TreeNodeMetadata;
145 // Traverse node children first and recursively prune their sub-trees.
147 boosted_trees::trees::DecisionTree::GetChildren(tree_node);
228 boosted_trees::trees::Leaf* const bias =
258 boosted_trees::trees::Leaf* RetrieveBias(
265 boosted_trees::trees::DecisionTreeConfig* const tree_config =
274 boosted_trees::trees::DecisionTreeConfig* const tree_config =
403 boosted_trees::trees::DecisionTreeConfig* const tree_config
[all...] |
| /external/zlib/src/contrib/delphi/ |
| zlibd32.mak | 22 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
24 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /external/zlib/src/contrib/pascal/ |
| zlibd32.mak | 22 OBJ2 = gzwrite.obj infback.obj inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
24 OBJP2 = +gzwrite.obj+infback.obj+inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
60 trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/python/training/functions/ |
| gbdt_batch_test.py | 274 self.assertEquals(len(output.trees), 0)
288 self.assertEquals(len(output.trees), 1)
316 self.assertProtoEquals(expected_tree, output.trees[0])
367 self.assertEquals(len(output.trees), 0)
377 self.assertEquals(len(output.trees), 1)
405 self.assertProtoEquals(expected_tree, output.trees[0])
412 self.assertEquals(len(output.trees), 1)
472 self.assertProtoEquals(expected_tree, output.trees[0])
538 self.assertEquals(len(output.trees), 0)
550 self.assertEquals(len(output.trees), 1
[all...] |
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| resources.cc | 57 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size());
58 const auto& node = tree_ensemble_->trees(tree_id).nodes(node_id);
84 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size());
85 const auto& node = tree_ensemble_->trees(tree_id).nodes(node_id);
120 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size());
156 return tree_ensemble_->trees(tree_id).nodes_size();
166 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size());
167 const auto& node = tree_ensemble_->trees(tree_id).nodes(node_id);
173 const auto node = tree_ensemble_->trees(tree_id).nodes(node_id);
180 const auto node = tree_ensemble_->trees(tree_id).nodes(node_id)
[all...] |
| /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/ |
| prediction_ops_test.py | 229 tree = tree_ensemble_config.trees.add()
257 tree = tree_ensemble_config.trees.add()
288 tree1 = tree_ensemble_config.trees.add()
293 tree2 = tree_ensemble_config.trees.add()
337 tree1 = tree_ensemble_config.trees.add()
342 tree2 = tree_ensemble_config.trees.add()
384 tree1 = tree_ensemble_config.trees.add()
389 tree2 = tree_ensemble_config.trees.add()
472 tree1 = tree_ensemble_config.trees.add()
477 tree2 = tree_ensemble_config.trees.add(
[all...] |
| /external/libpng/contrib/pngminim/encoder/ |
| makefile | 32 trees$(C) zutil$(C)
35 #ZH = zlib.h crc32.h deflate.h trees.h zutil.h
36 ZH = zlib.h crc32.h deflate.h trees.h zutil.h
51 trees$(O) zutil$(O)
|
