搜索资源列表
ir_expression_flattening
- Takes the leaves of expression trees and makes them dereferences of assignments of the leaves to temporaries, according to a predicate.
get_long_double_ru_RU
- inftrees.c generate Huffman trees for efficient decoding. -inftrees.c generate Huffman trees for efficient decoding.
ir_print_visitor
- Abstract base class of visitors of IR instruction trees.
splay-tree
- The major feature of splay trees is that all basic tree operations are amortized O(log n) time for a tree with n nodes.
ztrees
- *讨论 * 本PKZIP“通缩”的过程中使用了几个哈夫曼树。越 *共源的值由短比特序列表示。 * *每个代码树存储在ZIP文件以压缩形式 *这是本身的长度的霍夫曼编码 *所有的代码串（按升序排列按来源值）。 *实际代码串从长度重构 *解压缩过程中，如在“应用指南”中描述 *（APPNOTE.TXT）分布情况的PKWARE的PKZIP的计划的一部分。-*
weas-tour-star
- 这是一个完全自主开发的FLEX小软件。“大话西游黑名单”是对演员明星进行排序，可以增加或删除明星角色。主要用于FLEX环境下ACTIONscr ipt编程技术的训练。是列表、树等的编程训练。-This is a completely self-developed software FLEX small. Westward Journey blacklist is a star actor to sort, you can add or remove the star role. FLEX i
cell_exciting_forest
- 元胞自动机，描述exciting程度，还有树林种植扩散的描述。-Cellular automata, describe exciting degree, as well as descr iptions trees planted proliferation.
inftrees
- inftrees.c generate Huffman trees for efficient decoding. -inftrees.c generate Huffman trees for efficient decoding.
treewriter
- Trees map alphabets into huffman-like codes suitable for an arithmetic bit coder. Timothy S Murphy 11 October 2004.
HuffmanTree
- 哈夫曼树的基本构建以及哈夫曼树构建成功的基本举例-The basic building Huffman trees and Huffman basic building a successful example
trees
- header created automatically with -DGEN_TREES_H.
test3
- MFC树控件和Tab控件，点击树可以切换Tab属性页-MFC tree control and click on the Tab control that trees can switch the Tab property page
myregTrees
- 基于Python的回归树实验，包含预剪枝和后剪枝；模型树和回归树测试。-Python-based test regression trees, including the pre-pruning and pruning the model tree and regression tree test.
tree
- 二叉树是n（n>=0）个结点的有限集合，它或为空树，或是由一个称之为根的结点加上两棵分别称为左子树和右子树的互不相交的二叉树组成。 对二叉树的操作主要有：建立一棵二叉树；遍历二叉树；求二叉树的深度、结点数等。 1. 定义二叉链表类型； 2. 实现二叉树的基本操作：建立、先中后序遍历、层次遍历及输出。 -Binary Tree is n (n> = 0) a finite set of nodes, it is empty or tree, or the root no
_cstddef
- inftrees.c generate Huffman trees for efficient decoding. -inftrees.c generate Huffman trees for efficient decoding.
op_times_rep
- Red Black Trees Source Code for Embedded Linux.
1
- 给定一颗有权无根树，修改任意一条边，求最少的任意两点间的距离和:修改一条边是指删除树中的一条边，然后选择两个端点连线，形成一课新的树，并且不改变这条边的权值，在这棵树的基础上，求最少的任意两点间的距离和是多少 任意两点的距离和指：sum(a到b的距离，a<b,a和b都是树上的点) 输入：第一行是整数n，接下来n-1行，每行包括3个整数ai,bi,wi,表示节点ai与bi之间有一条权重为wi的边。 输出：最小的任意两点间的距离和 -Given a right to u
kdtree1.2
- Kd-trees are data structures which are used to store points in k-dimensional space. As it follows its name, kd-tree is a tree. Tree leafs store points of the dataset (one or several points in each leaf). Each point is stored in one and only one leaf,
119128676SwingUInterface
- JAVA界面开发，其中包括树，数据栅格，界面布局-JAVA interface development, including trees, data grids, interface layout, etc.
rm
- rm - for ReMoving files, directories & trees.