Fast Compact Sparse Bit Sets
Imagine you need a relatively compact data structure for quickly checking membership of mostly-consecutive non-negative integers. (If this sounds really specific, it is because it is precisely what I needed for a particular project.) The Ruby standard library contains a Set class which may be a good starting point. Set is actually implemented as a Hash with the Set elements as keys and true as the
GitHub - lemire/javaewah: A compressed alternative to the Java BitSet class
This is a word-aligned compressed variant of the Java Bitset class. We provide both a 64-bit and a 32-bit RLE-like compression scheme. It can be used to implement bitmap indexes. The EWAH format it relies upon is used in the git implementation that runs GitHub. The goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, we try to
ã€Œæœ¨æ§‹é€ ã¨è‡ªç„¶æ•°ã®é‡è¤‡ã‚り集åˆã¯ç‰ä¾¡ã よãã€ã¨ã„ã†ã¯ãªã— - EchizenBlog-Zwei
ã€Œæœ¨æ§‹é€ ã¨è‡ªç„¶æ•°ã®é‡è¤‡ã‚り集åˆã¯ç‰ä¾¡ã よãã€ã¨ã„ã†ã¯ãªã—ã‚’ã™ã‚‹ã€‚ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ãªäººå‘ã‘ã«è¨€ã†ã¨LOUDSã®è©±ã€‚ ã¨ã¯ã„ãˆã“ã®è¨˜äº‹ã¯ç‰¹ã«ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®çŸ¥è˜ã‚’è¦æ±‚ã—ãªã„ã€‚ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‹æƒ…å ±é‡ã¨ã‹ã«èˆˆå‘³ãŒã‚る人全般を対象ã¨ã—ã¦ã„る。 ※簡潔勢ã«ã¨ã£ã¦ã¯æ—¢çŸ¥ãªè©±ã®ã¯ãšãªã®ã§ã‚ãˆã¦èªã‚€å¿…è¦ã¯ãªã„ã§ã™ã€‚ ã¾ãšçµè«–ã‹ã‚‰è¿°ã¹ã‚‹ã€‚以下ã®ã‚ˆã†ãªå¹…優先ã§ç•ªå·ã‚’振ã£ãŸæœ¨æ§‹é€ を考ãˆã‚‹ã€‚ 親 → å (1) → (2, 3) (2) → (4) (3) → (5)ã“ã®æœ¨æ§‹é€ ã¯ä»¥ä¸‹ã®é‡è¤‡ã‚り集åˆã«ã‚ˆã£ã¦è¡¨ç¾ã™ã‚‹ã“ã¨ãŒã§ãる。 { 2, 4, 5, 5, 5 }ã“ã‚Œã ã‘書ãã¨ãªã‚“ã®ã“ã¨ï¼Ÿã¨æ€ã‚れるã‹ã‚‚ã—ã‚Œãªã„。ãã“ã§ã“ã‚Œã‹ã‚‰2ã¤ã®ã“ã¨ã‚’説明ã™ã‚‹ã€‚ã²ã¨ã¤ã¯ã€Œä½•æ•…ã€æœ¨æ§‹é€ ãŒè‡ªç„¶æ•°ã®é‡è¤‡ã‚り集åˆã§è¡¨ç¾ã§ãã‚‹ã‹ã€ã€ã‚‚ã†ã²ã¨ã¤ã¯ã€Œé‡è¤‡ã‚り集åˆã§è¡¨ç¾ã™ã‚‹ã“ã¨ã«ä½•ã®æ„味ãŒã‚ã‚‹ã‹ã€ã¨ã„ã†ã“ã¨ã€‚ 何故ã€æœ¨æ§‹é€ ãŒè‡ªç„¶æ•°ã®é‡è¤‡ã‚り集åˆã§è¡¨ç¾
クヌース–モリス–プラット法 - Wikipedia
クヌース–モリス–プラット法（Knuth–Morris–Pratt algorithmã€KMP法ã¨ç•¥è¨˜ï¼‰ã¨ã¯ã€æ–‡å—列検索アルゴリズムã®ä¸€ç¨®ã€‚テã‚スト（文å—列）Sã‹ã‚‰å˜èªžWを探ã™ã«ã‚ãŸã‚Šã€ä¸ä¸€è‡´ã¨ãªã£ãŸä½ç½®ã¨å˜èªžè‡ªèº«ã®æƒ…å ±ã‹ã‚‰æ¬¡ã«ç…§åˆã‚’試ã™ã¹ãä½ç½®ã‚’決定ã™ã‚‹ã“ã¨ã§æ¤œç´¢ã‚’効率化ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚る。 ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯1977å¹´ã€ãƒ‰ãƒŠãƒ«ãƒ‰ãƒ»ã‚¯ãƒŒãƒ¼ã‚¹ã¨ Vaughan Pratt ãŠã‚ˆã³ï¼ˆå˜ç‹¬ã§ï¼‰J. H. Morris ãŒç™ºæ˜Žã—ã€3人共åŒã§ç™ºè¡¨ã—ãŸã€‚ æœ¬é …ç›®ã§ã¯æ–‡å—列を表ã™ã«ã‚ãŸã£ã¦ã€0 ã‹ã‚‰ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‚’開始ã™ã‚‹é…列を用ã„る。従ã£ã¦ï¼ˆå¾Œè¿°ã®ï¼‰å˜èªž W 内ã®æ–‡å— 'C' 㯠W[2] ã¨è¡¨ã•ã‚Œã‚‹ã€‚
Skip Lists
Skip Lists 㯠1990å¹´ã« William Pugh ã«ã‚ˆã£ã¦é–‹ç™ºã•ã‚ŒãŸãƒªã‚¹ãƒˆæ§‹é€ 体ã®ä¸€ç¨®ã§ã‚る。 オリジナルã®è«–文㯠William Pugh, "Skip Lists: A Probablistic Alternative to Balanced Trees", Communications of the ACM, June 1990 ã¨ãªã£ã¦ã„る。 ã“ã®è«–文㯠ftp://ftp.cs.umd.edu/pub/skipLists/skiplists.pdf ã‹ã‚‰ã‚³ãƒ”ーを入手å¯èƒ½ã§ã‚る。 ã¾ãŸã€Unix Magazine 1999å¹´ 1æœˆå· ã‚’å…¥æ‰‹ã§ãã‚Œã°ã€ ãã“ã«ã¯æ—¥æœ¬èªžã§æ›¸ã‹ã‚ŒãŸè§£èª¬ãŒã‚ã‚‹ãŒã€ ã“ã‚Œã¯ã»ã¨ã‚“ã©è«–文丸写ã—ã«è¿‘ã„ã®ã§ã€ãã£ã¨é‡å®ã™ã‚‹ã ã‚ã†ã€‚ 数多ãã®ã€è¦ç´ ãŒå¢—減ã—ãªãŠã‹ã¤å…¥ã‚Œæ›¿ã‚るよã†ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã€ ã•ã‚‰ã«ãƒ©ãƒ³ãƒ€ãƒ アクセスãŒ
プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ 2　～平衡二分探索木編～
自己紹介 • 秋葉 拓哉/ @iwiwi • æ±äº¬å¤§å¦ æƒ…å ±ç†å·¥å¦ç³»ç ”究科 コンピュータ科å¦å°‚æ”» • プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆå¥½ã • プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆãƒãƒ£ãƒ¬ãƒ³ã‚¸ãƒ–ック 2 ãƒ‡ãƒ¼ã‚¿æ§‹é€ ãŸã¡ (ã‚‚ã¡ã‚ã‚“ä»–ã«ã‚‚ã‚ã‚Šã¾ã™ãŒ) • 二分ヒープ • 組ã¿è¾¼ã¿è¾žæ›¸ (std::map) • Union-Find 木 åˆç´šç·¨ • Binary Indexed Tree コンテストã§ã® ãƒ‡ãƒ¼ã‚¿æ§‹é€ ï¼‘ • セグメント木 (2010 å¹´) • ãƒã‚±ãƒƒãƒˆæ³• ä¸ç´šç·¨ • 平衡二分探索木 • 動的木 本講義 • ï¼ˆæ°¸ç¶šãƒ‡ãƒ¼ã‚¿æ§‹é€ ï¼‰ 3
non-blockingã®æ„味ã™ã‚‹ã¨ã“ã‚ - ãã¾ãƒ¡ãƒ¢
海外ã®æ–‡çŒ®ã‚’èªã¿æ¼ã£ã¦ã„ã‚‹ã¨æ°—ã¥ãã®ã§ã™ãŒ 2003年を境ã«ã“ã®æ–‡è„ˆã§ä½¿ã‚れる言葉ã®å®šç¾©ãŒå¤‰ã‚ã‚Šã¾ã™ã€‚ ↑2003å¹´ã”ã‚ã¾ã§ã®æ§‹å›³ ↑ç¾åœ¨ã®æ§‹å›³ã€‚*1 non-blocking = obstruction-free ã¨ã„ã†ç†è§£ã§ã‚‚ãŠãŠã‚ˆãé–“é•ã„ã§ã¯ãªã„ã¨ã¯æ€ã„ã¾ã™ãŒ 論文をèªã‚€ã«å½“ãŸã£ã¦ non-blocking = ãƒãƒƒã‚¯ã‚’使ã‚ãªã„アルゴリズム全般 obstruction-free = éžlock-freeã ã‘ã©ãƒãƒƒã‚¯ã ã‘ã¯ã—ãªã„ ã¨ã„ã†ãƒ‹ãƒ¥ã‚¢ãƒ³ã‚¹ã®é•ã„ã‚’æ„Ÿã˜ã¾ã™ã€‚ 以後ã€ç¾åœ¨ã®æ§‹å›³ã®æ–¹ã‚’å‰æã«è©±ã—ã¾ã™ã€‚ã”注æ„ãã ã•ã„。 ã¾ãšã¯3ã¤ã®åˆ†é¡žã®é•ã„ã‹ã‚‰ wait-free æ“作ãŒã€Œä»–ã®ã‚¹ãƒ¬ãƒƒãƒ‰ã®å‹•å‘ã«é–¢ã‚らãšæœ‰é™ã‚¹ãƒ†ãƒƒãƒ—ã§å®Œäº†ã§ãã‚‹ã€å ´åˆã€ãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯wait-freeã¨å‘¼ã°ã‚Œã¾ã™ã€‚starvation-freeã¨å‘¼ã‚“ã ã‚Šã‚‚ã—ã¾ã™ã€‚ 実際ã«ã¯åˆã‚ã‹ã‚‰ã“ã“ã«åˆ†é¡žã•ã‚Œã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯å¤šãã‚
Ultimate Sets and Maps for Java, Part I
Highly Scalable BlogArticles on Big Data, NoSQL, and Highly Scalable Software Engineering Some time ago our team had been requested to develop several Java components for structured information retrieval. After the initial research, we concluded that standard approaches like inverted indexes are not well applicable to our problem because of specific business requirements. As a result we faced a ne
Lock-free スナップショットã®æ’®ã‚Šæ–¹ã‚’説明ã—ã¦ã¿ã‚‹ - ãã¾ãƒ¡ãƒ¢
マルãƒã‚¹ãƒ¬ãƒƒãƒ‰ãªã©ã®ç’°å¢ƒä¸‹ã§æ™‚間経éŽã«ã‚ˆã£ã¦å‹æ‰‹ã«å¤‰åŒ–ã™ã‚‹è¤‡æ•°ã®å¤‰æ•°ã‚’èªã¿ãŸã„å ´é¢ã¯å¤šãã‚ã‚Šã¾ã™ã€‚ ã—ã‹ã—CPUã¯ä¸€åº¦ã«ä¸€ã¤ã—ã‹å€¤ã‚’èªã¿æ›¸ãã§ããªã„ã®ã§ã€ç°¡å˜ã«ã¯å‡ºæ¥ã¾ã›ã‚“。 何故ãªã‚‰èªã‚“ã§ã‚‹ãã°ã‹ã‚‰å€¤ãŒå¤‰å‹•ã—ã¦ã§ãŸã‚‰ã‚ãªå€¤ã‚’èªã‚€ã‹ã‚‚知れãªã„ã‹ã‚‰ã§ã™ã€‚ 変動ã—ã¦ã‚‹ã‚‚ã®ã‚’èªã‚€ã®ã ã‹ã‚‰èªã‚€å´ãŒå®Œç’§ã˜ã‚ƒãªãã¦ã‚‚仕方ãªã„ã¨ã„ã†å¦¥å”ã¯æœ‰ã‚Šå¾—ã¾ã™ãŒ 特定ã®ã‚る一瞬ã®æ™‚刻ã§ã®çŠ¶æ…‹ã‚’写真ã®ã‚ˆã†ã«ãƒ‘ãƒãƒªã¨ãƒ•ã‚£ãƒ«ãƒ ã«åŽã‚られãŸã‚‰å¬‰ã—ã„ã§ã™ã‚ˆã。 一番簡å˜ãªã®ã¯ãƒãƒƒã‚¯ã‚’å–ã‚ŠãªãŒã‚‰èªã‚€äº‹ã§ã™ãŒã€ãƒãƒƒã‚¯ã¯è«¸èˆ¬ã®äº‹æƒ…ã«ã‚ˆã‚Šä½¿ãˆãªã„事ã¨ã—ã¾ã™ã€‚ å‰æ 値ãŒå‹æ‰‹ã«å¤‰å‹•ã™ã‚‹ã¨ã„ã†çŠ¶æ³ãŒåˆ†ã‹ã‚Šã«ãã„ã¨æ€ã†ã®ã§ã€é©å½“ãªä¾‹ãˆã¨ã—ã¦åµã®åµåŒ–を想åƒã—ã¦ã¿ã¾ã—ょã†ã€‚ 「åµã€â†’「ヒビã€â†’「ã²ã‚ˆã“ã€ã€€ã®é †ã§ãƒ©ãƒ³ãƒ€ãƒ ã«å‹æ‰‹ã«é€²ã‚“ã§è¡Œãã¾ã™ã€‚æ¢ã‚ã‚‹ã“ã¨ã¯å‡ºæ¥ã¾ã›ã‚“ã—後戻りもã—ã¾ã›ã‚“。 ã“ã‚“ãªåµãŒè¤‡æ•°ã‚ã‚‹åµåŒ–器ã®ç›£è¦–ã‚’ä»»ã•ã‚ŒãŸã¨ã—ã¾ã™ã€‚åµã®çŠ¶æ…‹
Story of Your Life » Blog Archive » Hopscotch Hashingを実装ã—ã¦ã¿ãŸ
å‹•æ©Ÿ æ•°å¹´å‰Cuckoo Hashingも知らãªã„ã®ï¼Ÿã¨å‹äººã‹ã‚‰ä¿¡ã˜ã‚‰ã‚Œãªã„ã¨ã„ã†ç›®ã§è¦‹ã‚‰ã‚ŒãŸçµŒé¨“ã‹ã‚‰ã€ã„ã¤ã‹Cuckoo Hashingを超ãˆã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を実装ã—ã¦ã‚„ã‚‹ã¨ã„ã†(考案ã—ã¦ã‚„ã‚‹ã¨ã„ã†ç¨‹ã¯é«˜ããªã„)野望をæŒã£ã¦ã„ã¾ã—ãŸã€‚ ãã“ã§ä»Šå›žã¯Hopscotch Hashingを実装ã—ã¦ã¿ã¾ã—ãŸã€‚ Herlihy, M., N. Shavit, and M. Tzafrir, “Hopscotch Hashing,†Proceedings of the 22nd International Symposium on Distributed Computing (DISC), pp. 350-364, Arcachon, France, September 2008. Hopscotch Hashingã¯Cuckoo Hashingã¨åŒæ§˜ã€å®šæ•°æ™‚é–“ã§ã®æ¤œç´¢ã‚’å¯èƒ½ã«ã™ã‚‹ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–
Parallel worlds of CRuby's GC
The document discusses parallelizing garbage collection (GC) in CRuby. It describes the current single-threaded GC approach and argues for a parallel marking GC to utilize multiple CPU cores. Key points covered include explaining GC concepts like dead objects and roots, an overview of CRuby's mark-and-sweep algorithm, and the motivation to parallelize marking to improve performance. The author has
Arora's Task Stealing Deque
作æˆæ—¥ï¼š2005.11.27 目次 å‰ç½®ã ãƒ‡ãƒ¼ã‚¿æ§‹é€ æ“作 擬似コード 動作 å•é¡Œç‚¹ å‚考文献 脚注 1. å‰ç½®ã マルãƒãƒ—ãƒã‚»ãƒƒã‚µä¸Šã§è¡Œã†ä¸¦åˆ—処ç†ã‚’è¡Œã†ãƒ—ãƒã‚°ãƒ©ãƒ ãŒã€ 仕事をå‡ç‰ã« N 分割ã§ãã‚‹ã‚‚ã®ã¯ç¨€ã 。 プãƒã‚°ãƒ©ãƒ ã®å‡¦ç†ã‚³ã‚¹ãƒˆã®æœ€å¤§å€¤ã‚„å¹³å‡å€¤ã‚’見ç©ã‚‚ã‚‹ã“ã¨ãŒã§ãã¦ã‚‚〠実際ã®å‡¦ç†æ™‚間や消費メモリã¯ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œå†…容ã«ã‚ˆã£ã¦å¤§ãã変ã‚ã£ã¦ã„ã。 ãã®ãŸã‚å„プãƒã‚»ãƒƒã‚µã«å‰²ã‚Šå½“ã¦ã‚‹è² è·(ãƒãƒ¼ãƒ‰)ãŒå‡ä¸€ã«ãªã‚‹ã‚ˆã†ã« è² è·åˆ†æ•£ã‚’è¡Œã†ã“ã¨ãŒé‡è¦ã«ãªã‚‹ã€‚ è² è·åˆ†æ•£ã‚’è¡Œã†ãŸã‚ã«ã¯ã€ プãƒã‚°ãƒ©ãƒ ã‚’ã‚る程度ã®ç²’度ã«åˆ†å‰²ã—〠プãƒã‚»ãƒƒã‚µé–“ã§æ‹…当をやりå–ã‚Šã§ãるよã†ã«ã™ã‚‹ã€‚ ã¨ã‚Šã‚ãˆãšãƒ—ãƒã‚°ãƒ©ãƒ を分割ã—ãŸã‚‚ã®ã‚’タスクã¨å‘¼ã¶ã“ã¨ã«ã—よã†ã€‚ タスクをやりå–ã‚Šã™ã‚‹æ–¹æ³•ã¯ã€ 大雑把ã«è¨€ã£ã¦ä¸‰ã¤ã‚る。 マãƒãƒ¼ã‚¸ãƒ£ãƒ¼ãŒã„ã¦ã€ã©ã®ãƒ—ãƒã‚»ãƒƒã‚µãŒã©ã®ã‚¿ã‚¹ã‚¯ã‚’è¡Œã†ã‹åˆ¶å¾¡ã™ã‚‹ã€‚ 暇ãªãƒ—ãƒã‚»ãƒƒã‚µãŒã€ã‚¿ã‚¹ã‚¯ã‚’多ã抱ãˆãŸãƒ—ãƒã‚»ãƒƒ
Towards a Scalable Non-Blocking Coding Style（状態é·ç§»æ©Ÿæ¢°ã®è¨è¨ˆã«é–¢ã—ã¦ï¼‰
Webinar: Managing the Security and Commercial Impact of Java Updates March 12, 2020 Live WebinarJoin Azul and SoftwareONE for this webinar about the security and commercial applications of Java...Read More dev.next March 24-27, 2020 Broomfield, CO, USAAzul is one of the sponsors at this event which brings together practitioners, experts, and...Read More
Cuckoo Hashing - Radium Software
ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã‹ã‚‰ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã‚’検索ã™ã‚‹å‡¦ç†ã¯ï¼Œä¸€èˆ¬ã«å®šæ•°æ™‚é–“ã§æ¸ˆã‚€ã¨ã•ã‚Œã¦ã„る。ã¤ã¾ã‚Šï¼Œã©ã‚“ãªã«ã‚¨ãƒ³ãƒˆãƒªãƒ¼ãŒå¢—ãˆã¦ã‚‚検索ã®é€Ÿã•ã¯å¤‰ã‚らãªã„，ã¨ã„ã†ã“ã¨ã€‚ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®æ•™ç§‘書ã«ã¯å¿…ãšè¼‰ã£ã¦ã„ã‚‹ã“ã¨ã ã。 ã§ã‚‚実際ã«ã¯ï¼Œãƒãƒƒã‚·ãƒ¥ã®è¡çªãŒèµ·ã“ã£ãŸå ´åˆã«ï¼Œé€Ÿåº¦ã®ä½Žä¸‹ãŒç™ºç”Ÿã™ã‚‹å¯èƒ½æ€§ãŒã‚る。例ãˆã°ï¼Œä¸€èˆ¬çš„ãªãƒã‚§ã‚¤ãƒ³æ³•ï¼ˆã‚ªãƒ¼ãƒ—ンãƒãƒƒã‚·ãƒ¥ï¼‰ã ã¨ï¼Œè¡çªã—ãŸã‚¨ãƒ³ãƒˆãƒªãƒ¼ã«é–¢ã—ã¦ç·šå½¢æ¤œç´¢ã‚’è¡Œã†ã“ã¨ã«ãªã‚‹ã‹ã‚‰ï¼Œè¡çªãŒå¤šã‘ã‚Œã°å¤šã„ã»ã©ï¼Œå®šæ•°æ™‚é–“ã‹ã‚‰ã¯é ã®ã„ã¦ã—ã¾ã†ã€‚ ã“ã®é€Ÿåº¦ä½Žä¸‹ã‚’防ã方法ã¯ã„ã‚ã„ã‚ã‚る。ãªã‹ã§ã‚‚ cuckoo hashing （カッコウ・ãƒãƒƒã‚·ãƒ³ã‚°ï¼‰ã¯ä»•çµ„ã¿ãŒé¢ç™½ã„。ã“ã„ã¤ã¯ï¼Œã‚¨ãƒ³ãƒˆãƒªãƒ¼ã®æ¤œç´¢ã‚’å¿…ãšå®šæ•°æ™‚é–“ã§æ¸ˆã¾ã›ã¦ãれるã¨ã„ã†å„ªã‚Œã‚‚ã®ãªã‚“ã 。 Cuckoo hashing ã§ã¯ï¼Œï¼’ã¤ã®ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã¨ï¼Œï¼’ã¤ã®ãƒ†ãƒ¼ãƒ–ルを用ã„る。ã“ã“ã§ã¯ï¼Œï¼’ã¤ã®ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã‚’ãã‚Œãžã‚Œ h1, h2 ã¨ã—ã¦ï¼Œï¼’ã¤ã®ãƒ†ãƒ¼
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
When is a bitmap faster than an integer list?
sparsebitmap/src/main/java/sparsebitmap/SparseBitmap.java at master · lemire/sparsebitmap
http://www.cs.columbia.edu/~nahum/w6998/papers/sosp87-timing-wheels.pdf
IBM Developer
{{#tags}}- {{label}}
{{/tags}}