文件名称:Partition
介绍说明－－下载内容均来自于网络，请自行研究使用
在n维空间（每维范围为0-1）内对插入的数值根据坐标进行分区。从一个没有分区的空间开始插入，一旦规定的cache满了就申请新的cache空间。cache全满后存数值于文件。分区每次一分为2n，内建有2n叉树结构用于管理。-In n-dimensional space (each dimension range of 0-1) to insert values on the basis of geographical coordinates. From a partition of space began to insert, once the provisions of the cache is full of the cache on the application of new space. cache after the full deposit value in the document. Each district is divided into one 2n, has a built-2n-tree structure used to manage.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Partition
.........\BFile.cpp
.........\BFile.h
.........\Cache.cpp
.........\Cache.h
.........\generaldef.h
.........\qtree.cpp
.........\qtree.h
.........\quadtree4.cpp
.........\utility.cpp
.........\utility.h
.........\BFile.cpp
.........\BFile.h
.........\Cache.cpp
.........\Cache.h
.........\generaldef.h
.........\qtree.cpp
.........\qtree.h
.........\quadtree4.cpp
.........\utility.cpp
.........\utility.h