Welcome![Sign In][Sign Up]
Location:
Search - file based b-tree

Search list

[Windows Developtpbtreefiler_5_57

Description: B-Tree Filer is a fast library of file-based database routines for Borland Turbo Pascal & Delphi. B-Tree Filer supports stand-alone programs or those running on Microsoft-compatible networks including Novell Netware.-B-Tree Filer is a fast library of file-based database routines for Borland Turbo Pascal Delphi. B-Tree Filer supports stand-alone programs or those running on Microsoft-compatible networks including Novell Netware.
Platform: | Size: 2014027 | Author: 程序员 | Hits:

[Windows Developtpbtreefiler_5_57

Description: B-Tree Filer is a fast library of file-based database routines for Borland Turbo Pascal & Delphi. B-Tree Filer supports stand-alone programs or those running on Microsoft-compatible networks including Novell Netware.-B-Tree Filer is a fast library of file-based database routines for Borland Turbo Pascal Delphi. B-Tree Filer supports stand-alone programs or those running on Microsoft-compatible networks including Novell Netware.
Platform: | Size: 2014208 | Author: 程序员 | Hits:

[ARM-PowerPC-ColdFire-MIPSstm32_EFSL_demo

Description: 基于STM32微处理器的SD卡(TF卡)文件系统读写. 103ZC,ZD等有SDIO,检查中。-This is a simple demonstration, based on STM32 and working with ST Evaluation board MB525 revA (old board), using the Embeddeded Library File System “EFSL” with an "SD" memory card in order to explore the contents of this SD card and show, on the LCD color, the Tree of directories/files within the SD card and read files contents. PS: in last boards ( rev B) you should modify the joystick driver to get it working fine.
Platform: | Size: 163840 | Author: Highend | Hits:

[File Operatefilesystembegin

Description: 1. 设计和实现一个简单的文件系统,要求包括目录、普通文件和文件的存储 2. 文件系统的目录结构采用类似Linux的树状结构; 3. 要求模拟的操作包括: a) 目录的添加、删除、重命名; b) 目录的显示(列表) c) 文件的添加、删除、重命名 d) 文件和目录的拷贝 4. 用户进入时显示可用命令列表;用户输入help时显示所有命令的帮助文档; 输入某个命令+?时显示该条命令的使用说明 5. 用户输入exit时退出该系统 6. 实验实现基于windows平台; 7. 实验开发语言可以选用C/c++ -1. Design and implement a simple file system requirements include directories, regular files and file storage 2. File system directory structure similar to Linux' s tree 3. Requires simulation of the operation include: a) the directory to add, delete, rename b) display the directory (list) c) files to add, delete, rename, d) copies of files and directories 4. Displayed when the user enters a list of available commands user input help to display all commands with the help of documents enter a command+? Which command to display instructions 5. When the user enters exit to exit the system 6. Windows-based platform for experiments 7. Experimental development of language can be selected C/c++
Platform: | Size: 311296 | Author: 皇絮淡 | Hits:

[Data structsCIAdatabase

Description: 解析一个文件中的内容,以B tree的方式存储其中的国家,职位,人民,是一个基于B TREE的搜索算法实现。包括了源代码,原始文件以及搜索案例-Parse the contents of a file to B tree stored in a manner which the state, position, people, is a B TREE-based search algorithm. Including the source code, the original case file and search
Platform: | Size: 2110464 | Author: leo | Hits:

[Data structsDB_ii_Final

Description: 基于二进制文件的B+数索引和倒排文件,其中B+树的删除利用插入实现-Achieve based on the number of binaries B index and the inverted file, including the deletion of the B-tree by inserting
Platform: | Size: 281600 | Author: eros | Hits:

[Data structsalgorithms-master

Description: 1. 经典的算法实现 2. 服务器端 3. 正确,易于使用和改造, 一个头文件一个算法,并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后,请发起Pull Requests,代码被验证后入库,并在README中发布新算法实现。 已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Miller-Rabin s method) 2D Array Arbitary Integer Linear congruential generator Maximum subarray problem Bit-Set Queue Stack Binary Heap Fibonacci Heap Priority Queue (list based) Bubble sort Selection sort Insertion sort Radix sort Quick sort Merge sort Heap sort Double linked list Skip list Self-organized linked-list ops (move-to-front, move-ahead-one) Largest common sequence Binary search tree Dynamic order statistics Red-black tree Interval tree Prefix Tree(Trie) Suffix Tree B-Tree Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
Platform: | Size: 1636352 | Author: 汪小君 | Hits:

CodeBus www.codebus.net