Welcome![Sign In][Sign Up]
Location:
Search - hash stl

Search list

[Windows Developcpp_mru_cache

Description: I suppose you know what a MRU cache is, otherwise you wouldn t been reading this. This is an implementation of a very simple one using only STL. To implement a cache, derive a subclass from this template class. As an implementor, you d have to implement two methods: HandleNonExistingKeyFetch - to handle cache misses. In this method you access the real source of data behind the cache and return the value. HandleItemRelease - (optional) called when an item is removed from the cache. The cache class is a template of two types, a key and value (like hash map). The value type is the type of the resource and the key type is the type of the resource address. (this is how you fetch a resource)
Platform: | Size: 1828 | Author: haha | Hits:

[Otherstl_code

Description: c++ STL source code, hash and vector etc
Platform: | Size: 249657 | Author: cloudffx | Hits:

[ConsoleHash_STL(Time)

Description: 使用C++语言的STL开发的一个用来进行大规模hash计算的程序,用来处理大规模ip地址的查找问题,输入的文件可以是从internet 上下载的ip地址数据,也可以自己输入数据,可以支持几百兆的数据文件的分析与查找。格式如下 ip1 ip2 ip3 ... 例如:100.100.100.100 200.200.200.200
Platform: | Size: 349780 | Author: 魏木木 | Hits:

[Other resourcehash_map

Description: STL哈希表的使用范例:包括哈希表的创建、插入、查找、删除、内存分配和释放内存。-STL use examples include : Hash Table creation, insert, search, delete, memory allocation and release memory.
Platform: | Size: 10906 | Author: 何智峰 | Hits:

[Data structshash_map

Description: STL哈希表的使用范例:包括哈希表的创建、插入、查找、删除、内存分配和释放内存。-STL use examples include : Hash Table creation, insert, search, delete, memory allocation and release memory.
Platform: | Size: 10240 | Author: 何智峰 | Hits:

[Windows Developcpp_mru_cache

Description: I suppose you know what a MRU cache is, otherwise you wouldn t been reading this. This is an implementation of a very simple one using only STL. To implement a cache, derive a subclass from this template class. As an implementor, you d have to implement two methods: HandleNonExistingKeyFetch - to handle cache misses. In this method you access the real source of data behind the cache and return the value. HandleItemRelease - (optional) called when an item is removed from the cache. The cache class is a template of two types, a key and value (like hash map). The value type is the type of the resource and the key type is the type of the resource address. (this is how you fetch a resource) -I suppose you know what a MRU cache is, otherwise you wouldn t been reading this.This is an implementation of a very simple one using only STL.To implement a cache, derive a subclass from this template class.As an implementor, you d have to implement two methods: HandleNonExistingKeyFetch- to handle cache misses. In this method you access the real source of data behind the cache and return the value. HandleItemRelease- (optional) called when an item is removed from the cache.The cache class is a template of two types, a key and value (like hash map). The value type is the type of the resource and the key type is the type of the resource address. (this is how you fetch a resource)
Platform: | Size: 1024 | Author: | Hits:

[Otherstl_code

Description: c++ STL source code, hash and vector etc -c++ STL source code, hash and vector etc
Platform: | Size: 249856 | Author: cloudffx | Hits:

[ConsoleHash_STL(Time)

Description: 使用C++语言的STL开发的一个用来进行大规模hash计算的程序,用来处理大规模ip地址的查找问题,输入的文件可以是从internet 上下载的ip地址数据,也可以自己输入数据,可以支持几百兆的数据文件的分析与查找。格式如下 ip1 ip2 ip3 ... 例如:100.100.100.100 200.200.200.200 -The use of C++ Language STL to develop a large-scale used for hash calculation procedures used to deal with large-scale search ip address the problem, type of document can be downloaded from the internet the ip address of the data can also input their own data, can support several hundreds of megabytes of data file analysis and search. The following format ip1 ip2 ip3 ... for example: 100.100.100.100 200.200.200.200
Platform: | Size: 349184 | Author: 魏木木 | Hits:

[Other systemshash

Description: There are several problems related to the properties of the triangular mesh representation that describes a surface of an object. Sometimes, the surface is represented just as a set of triangles without any other information and the STL file format, which is used for data exchanges, is a typicalexampl e of this situation.
Platform: | Size: 489472 | Author: 李叶林 | Hits:

[VC/MFCBoostTechnologyAndApplication

Description: boost和loki是重要的c++库,此文档是侯捷关于boost的最新研究成果,包括boost和loki的一些组件(pool,any,hash等)实现与应用及与stl的比较,有一定难度。-loki is an important boost, and the c++ library, Hou Jie, this document on the boost of the latest research results, including the boost and some of loki component (pool, any, hash, etc.) with the application and comparison with stl There is a certain degree of difficulty.
Platform: | Size: 5720064 | Author: 张秋道 | Hits:

[OtherAstar

Description: A*算法实现的八数码问题,使用STL的优先队列及康拓展开的hash函数实现-A* algorithm implementation of the 8 digital issues, using priority queue in STL, and Courier function as hash function to implement
Platform: | Size: 2048 | Author: oily | Hits:

[Otherhashmap

Description: 哈希表的实现 hashmap.h - declaration of class HashMap hashmap.cpp - definition of class HashMap hash-driver.cpp demonstrates use of class HashMap and its member functions.-A Hash Table Implementation The following header file and implementation file declares and defines a template hash map class. The class takes four template parameters. The first is the key type and the second is the value type. The third parameter specifies the hash function and the fourth parameter specifies how to compare two objects of the key s data type. • hashmap.h- declaration of class HashMap • hashmap.cpp- definition of class HashMap The return type of the search member function of class HashMap is an STL class that we have not yet encountered. Function search returns an object of type pair. Class pair is an STL class that contains two data members. These members are named first and second. This class is used often by functions that need to return more than one piece of data. The search member function needs to return whether or not the item was found and what position it was found in. Thus, function search returns an object of type class pair<bool, int>
Platform: | Size: 667648 | Author: 刘亚 | Hits:

[VC/MFCthe-analysis-of-STL-sourse

Description: 本书所呈现的源码,使你踏上了基度山岛。源码之前了无秘密,你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现;你将看到各种算法(排序、查找、排列组合、数据移动与复制技术)的实现;你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。-The source code presented in this book, so that you set foot on the base of Monte island. Prior to the non-secret source code, you will see the vector implementation, list the implementation, heap implementation, deque implementation, Red Black tree implementation, hash table implementation, set/map for implementation you will see the various algorithms (sort, find, permutations and combinations, data movement and replication technology) is achieved you can even see the bottom of memory pook and higher-order abstract traits mechanism for implementation.
Platform: | Size: 10075136 | Author: 祝鹏 | Hits:

[OtherDataStructureswithUsingSTL

Description: 数据结构C.语言描述.应用标准摸板库STL第2版阐述了对象设计和编程原理;开发清晰的模板,针对每个STL容器提供了API;介绍了迭代器;详细讲述了红黑树、哈希表、堆和图表。-C. language to describe the data structure. Application of the standard template library STL version 2 describes the object design and programming principles development of a clear template, for each STL container provides the API introduced iterator detailed account of the red-black tree , hash tables, heap and charts.
Platform: | Size: 21202944 | Author: 品牌 | Hits:

[Data structsSTL

Description: 详细的讲述一些C排序的函数 STL 几乎封装了所有的数据结构中的算法,从链表到队列,从向量到堆栈,对hash 到二叉树,从搜索到排序,从增加到删除-Describe in detail the function of some sort STL C encapsulates almost all of the data structure algorithms, from the list to the queue, from the vector to a stack of hash to a binary tree, from the search to sort, to remove from the .... ..
Platform: | Size: 194560 | Author: 汪柏胜 | Hits:

[Data structsstl

Description: 一个用C写的模板类的hash功能实现,用来交数据结构的作业的-Write a template with the C class hash function implementation, the data structure used to pay operating
Platform: | Size: 6144 | Author: 陈萧 | Hits:

[Data structshash

Description: 采用六种数据结构(数组、链表、STL、箱、二分查找树、位向量),实现统计存储若干个随机数所需要的时间。-Using six data structures (arrays, lists, STL, containers, binary search tree, bit vector), to achieve a number of statistical random number stored in the time required.
Platform: | Size: 323584 | Author: songyanna | Hits:

[STLHashmap

Description: hash map 使用范例,帮你更好学习hashmap和C++stl-hash map usage examples to help you better learn the hashmap and C++ stl
Platform: | Size: 8180736 | Author: taidongzhe | Hits:

[VC/MFCSTL-source-code-analysis

Description: STL源码剖析-这本书不适合C++ 初学者,不适合Genericity(泛型技术)初学者,或STL 初 学者。这本书也不适合带领你学习对象导向(Object Oriented)技术— 是的,STL 与对象导向没有太多关连。本书前言清楚说明了书籍的定位和合适的读者,以及 各类基础读物。如果你的Generic Programming/STL 实力足以阅读本书所呈现的源 码,那么,恭喜,你踏㆖ 了基度山岛,这儿有㆒ 座大宝库等着你。源码之前了无 秘密,你将看到vector 的实作、list 的实作、heap 的实作、deque 的实作、RB-tree 的实作、hash-table 的实作、set/map 的实作;你将看到各种算法(排序、搜 寻、排列组合、数据搬移与复制…)的实作;你甚至将看到底层的memory pool 和 高阶抽象的traits 机制的实作。那些数据结构、那些算法、那些重要观念、那些 编程实务㆗ 最重要最根本的珍宝,那些蜇伏已久彷佛已经还给老师的记忆,将重 新在你的脑㆗ 闪闪发光。-STL source code analysis
Platform: | Size: 2176000 | Author: 陈宏鑫 | Hits:

[STLSTL

Description: 源码之前了无秘密,你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现;你将看到各种算法(排序、查找、排列组合、数据移动与复制技术)的实现;你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。(Before the secret source code, you will see the vector implementation, list implementation, heap implementation, deque implementation, Red Black tree, hash table, to achieve the realization of set/map; you will see a variety of algorithms (search, sorting, permutation and combination, and mobile data replication technology) to achieve even you; to see the realization of the underlying memory pook and higher order abstract traits mechanism.)
Platform: | Size: 226304 | Author: qwer@ | Hits:
« 12 »

CodeBus www.codebus.net