Location:
Search - cache_521
Search list
Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with \"least
recently used\" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses.
Platform: |
Size: 8260 |
Author: 洋场河 |
Hits:
Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with "least
recently used" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses.
Platform: |
Size: 8192 |
Author: 洋场河 |
Hits: