-
使用OLE在不同或相同的Treeview内移动/复制项
使用OLE在不同或相同的Treeview内移动/复制项-Moving or Copying items between treeviews using OLE
- 2022-04-25 15:22:09下载
- 积分:1
-
platfhrmtireztion
说明: 移动手机开发的一些资料和源代码,很好用的培训资料(Mobile phone development of some materials and source code, easy-to-use training materials)
- 2019-04-02 17:14:51下载
- 积分:1
-
一个浮动的树状控件的例子,可以从xml中导入数据
一个浮动的树状控件的例子,可以从xml中导入数据--An example of floating tree control,which can load data from xml
- 2022-06-20 22:27:45下载
- 积分:1
-
一个简单的共享文件夹管理器,用树控制拖动
一个简单的共享文件夹管理器,用树控制拖动-a simple shared folder manager, Tree Drive Control
- 2022-01-25 17:03:47下载
- 积分:1
-
一个关于二维傅立叶的算法,我在做图像处理时用到的
一个关于二维傅立叶的算法,我在做图像处理时用到的
-on a two-dimensional Fourier"s algorithm, I was doing the image processing used in
- 2022-04-10 04:20:53下载
- 积分:1
-
AGV无线通讯物理层的方案探讨
AGV无线通讯物理层的方案探讨-AGV wireless physical layer on the program
- 2022-01-26 08:04:56下载
- 积分:1
-
DevExpress-cxTreeList
DevExpress系列,演示数据树状列表。是Treeview与Listview的结合体。(DevExpress Series, demo data tree list. Is Treeview and Listview combination.)
- 2013-11-18 13:46:01下载
- 积分:1
-
利用脚本语言组件,java程序,在数据库读取dtree的节点信息,然后在jsp利用循环动态装载节点,即可实现网页的树形结构...
利用脚本语言组件,java程序,在数据库读取dtree的节点信息,然后在jsp利用循环动态装载节点,即可实现网页的树形结构-The use of scripting language component, java program, the database read dtree node information, and then in the jsp using dynamic loading cycle node, you can realize the page tree structure
- 2022-06-18 10:38:51下载
- 积分:1
-
树形菜单较滑动菜单稍微复杂一点。其主要难点在于从简洁的数据描述来产生便于操纵的html结构。 本例用来展示树形菜单的编写。使用无线表格,算法上采用了递归,理论上...
树形菜单较滑动菜单稍微复杂一点。其主要难点在于从简洁的数据描述来产生便于操纵的html结构。 本例用来展示树形菜单的编写。使用无线表格,算法上采用了递归,理论上可构造无穷分制枝的树。 本代码可自由扩散。-tree menu than sliding menu a little more complicated. The main difficulty lies in concise description of the data to generate the html easy manipulation of the structure. The cases used to display the menu tree prepared. The use of wireless form, the algorithm used by recursive, theoretically infinite structure of the points system sticks of trees. The proliferation of free code.
- 2022-05-23 05:19:57下载
- 积分:1
-
这个项目是展示我的梦想当我第一次见到三元树的树图。
This project is to show the tree I dreamed when I first met the ternary tree concept. When I came upon the ternary tree, I get awed! It s amazing that an idea so simplistic could be so strong and fast. But it had flaws... the first one is the memory consumption. The hash table implementation consumes far less memory than the ternary tree! The second flaw is the ternary tree can be fragmented and be extremely unbalanced (as the algorithm doesn t do any balancing step) so the tree also needs a way for balancing the nodes. I tried to reduce the memory consumption by grouping three nodes into one new "int" node. -This project is to show the tree I dreamed wh en I first met the ternary tree concept. When I ca me upon the ternary tree, I get awed! It"s amazing that an idea so simplisti c could be so strong and fast. But it had flaws ... the first one is the memory consumption. The has h table implementation consumes far less memor y than the ternary tree! The second flaw is the te rnary
- 2022-01-25 20:11:40下载
- 积分:1