Search - INT 1 - CodeBus

Search - INT 1 - List

[TreeView] PrtTView_demo DL : 0: 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 tree can be fragmented and be extremely un balanced (as the algorithm does not do any balanc ing step) so the tree also needs a way for balanci Vi the nodes. I tried to reduce the memory consum ption by grouping three nodes into one new "int" node.
Date : 2008-10-13 Size : 31.53kb User : gaowen
[TreeView] PrtTView_demo DL : 0: 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 tree can be fragmented and be extremely un balanced (as the algorithm does not do any balanc ing step) so the tree also needs a way for balanci Vi the nodes. I tried to reduce the memory consum ption by grouping three nodes into one new "int" node.
Date : 2026-01-09 Size : 31kb User : gaowen
[TreeView] Desktop DL : 0: package com.cqvie import android.graphics.* import android.graphics.Paint.Style public class Kuai { //public int HANG, LIE //最大行、最大列 public int hang, lie //?前行、?前列 public int BianChang //方?的?? public int YanSe //方?的?色 public void Hua(Bitmap bmp) //在?布上?方? { Canvas c=new Canvas(bmp) Rect rc=new Rect( lie * BianChang, hang * BianChang, (lie+1) * BianChang,(hang+1) * BianChang) Paint paint=new Paint() paint.setColor(YanSe) paint.setStyle(Style.STROKE) //空心 paint.setStrokeWidth(2) //?? c.drawRect(rc, paint) } }-package com.cqvie import android.graphics.* import android.graphics.Paint.Style public class Kuai { //public int HANG, LIE //最大行、最大列 public int hang, lie //?前行、?前列 public int BianChang //方?的?? public int YanSe //方?的?色 public void Hua(Bitmap bmp) //在?布上?方? { Canvas c=new Canvas(bmp) Rect rc=new Rect( lie* BianChang, hang* BianChang, (lie+1)* BianChang,(hang+1)* BianChang) Paint paint=new Paint() paint.setColor(YanSe) paint.setStyle(Style.STROKE) //空心 paint.setStrokeWidth(2) //?? c.drawRect(rc, paint) } }
Date : 2026-01-09 Size : 2kb User : 朱晨臨