diff options
author | Dana Robinson <43805+derobins@users.noreply.github.com> | 2023-05-05 15:28:59 (GMT) |
---|---|---|
committer | Dana Robinson <43805+derobins@users.noreply.github.com> | 2023-05-05 22:24:11 (GMT) |
commit | 986b6c01ce0a3850bd2623bf797ed9030c36f04e (patch) | |
tree | fa2f90cb4f14c8962e0ef9e5764a8ff0217d198b | |
parent | 0325220cc048465b59ca98ea0e7e4442608a76fe (diff) | |
download | hdf5-986b6c01ce0a3850bd2623bf797ed9030c36f04e.zip hdf5-986b6c01ce0a3850bd2623bf797ed9030c36f04e.tar.gz hdf5-986b6c01ce0a3850bd2623bf797ed9030c36f04e.tar.bz2 |
Remove H5TB discussion (#2899)
-rw-r--r-- | src/H5Cpkg.h | 10 |
1 files changed, 0 insertions, 10 deletions
diff --git a/src/H5Cpkg.h b/src/H5Cpkg.h index 056c181..7bd7087 100644 --- a/src/H5Cpkg.h +++ b/src/H5Cpkg.h @@ -3003,16 +3003,6 @@ typedef struct H5C_tag_info_t { * * Catchall structure for all variables specific to an instance of the cache. * - * While the individual fields of the structure are discussed below, the - * following overview may be helpful. - * - * Entries in the cache are stored in an instance of H5TB_TREE, indexed on - * the entry's disk address. While the H5TB_TREE is less efficient than - * hash table, it keeps the entries in address sorted order. As flushes - * in parallel mode are more efficient if they are issued in increasing - * address order, this is a significant benefit. Also the H5TB_TREE code - * was readily available, which reduced development time. - * * While the cache was designed with multiple replacement policies in mind, * at present only a modified form of LRU is supported. * |