BPS使用twist指针实现了B树，基于哈希表的集合，性能非常高，whileusingseveraltimeslessmemoryandstillmaintainingorder.ThesetintroducesanewB-treevarietywithsuperiorsearchandeditqualities.ComparedwiththeGCCdistributedtr1::unordered_set,thenewsetisonly30%slowerwhileusing3timeslessmemory.Comparedwiththeorderedstd::set,itisalmost4timesfasterwhileusing5timeslessmemory.
点击空白处退出提示
评论