[B! Algorithm] Nnwwwã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

Nnwww id:Nnwww

Algorithmã«é–¢ã™ã‚‹Nnwwwã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (18)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

#89: Conflict-free Replicated Data Types
ä¸¦åˆ—ç·¨é›†ã—ã¦ã‚‚è¡çªã—ãªã„ãƒ‡ãƒ¼ã‚¿æ§‹é€ CRDT ã«æ£®ç”°ãŒå…¥é–€ã—ã¾ã™ã€‚æ„Ÿæƒ³ãªã©ã¯ãƒãƒƒã‚·ãƒ¥ã‚¿ã‚°Â #misreadingÂ ã‹Â [email protected]Â ã«ãŠå¯„ã›ãã ã•ã„ã€‚iTunesÂ ã®ãƒ¬ãƒ“ãƒ¥ãƒ¼ã‚„æ˜Ÿã‚‚æ“è¿Žã§ã™ã€‚ Conflict-free Replicated Data Types â€“ Archive ouverte HALA commutative replicated data type for cooperative editing â€“ Archive ouverte HALDynamo: Amazonâ€™s Highly Available Key-value StoreAbout CRDTs â€¢ Conflict-free Replicated Data Typesxi-editor/crdt-details.md at master Â· xi-editor/xi-edi
Nnwww 2020/11/26
crdt

podcast

algorithm
ãƒªãƒ³ã‚¯
TCP BBR congestion control comes to GCP â€“ your Internet just got faster | Google Cloud Blog
We're excited to announce that Google Cloud PlatformÂ (GCP) now features a cutting-edge new congestion control algorithm, TCP BBR, which achieves higher bandwidths and lower latencies for internet traffic. This is the same BBR that powers TCP traffic from google.com and that improved YouTube network throughput by 4 percent on average globallyÂ â€”Â and by more than 14 percent in some countries. BBR all
Nnwww 2020/07/25
TCP

network

algorithm
ãƒªãƒ³ã‚¯
æ§˜ã€…ãªrate limitã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - Carpe Diem
æ¦‚è¦ ã‚¤ãƒ³ã‚¿ãƒ¼ãƒãƒƒãƒˆã«æ™’ã•ã‚Œã¦ã„ã‚‹Webã‚µãƒ¼ãƒ“ã‚¹ã§ã¯ TVç‰ã§ç´¹ä»‹ã•ã‚ŒãŸã“ã¨ã«ã‚ˆã‚‹å¤§é‡æµå…¥ æ‚ªæ„ã‚ã‚‹äººç‰©ã‹ã‚‰ã®æ”»æ’ƒ ã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆã®ãƒã‚°ã«ä¾ã‚‹å¤§é‡ãƒªã‚¯ã‚¨ã‚¹ãƒˆ ãªã©ã€æœ¬æ¥æƒ³å®šã—ã¦ã„ãŸä»¥ä¸Šã®ãƒˆãƒ©ãƒ•ã‚£ãƒƒã‚¯ãŒæ¥ã‚‹ã“ã¨ã¯ã‚ˆãã‚ã‚Šã¾ã™ã€‚ å˜ç´”ã«ã‚·ã‚¹ãƒ†ãƒ ã‚’æ§‹ç¯‰ã™ã‚‹ã¨å¤§è¦æ¨¡ãƒˆãƒ©ãƒ•ã‚£ãƒƒã‚¯ã«å¯¾å¿œã§ããšã‚·ã‚¹ãƒ†ãƒ ãŒã‚¹ãƒãƒ¼ãƒ€ã‚¦ãƒ³ã—ã¦ã—ã¾ã†ãŸã‚ã€ä½•ã‹ã—ã‚‰rate limitã‚’ã‹ã‘ã¦ãŠã„ãŸæ–¹ãŒè‰¯ã„ã§ã™ã€‚ ãŸã ã—rate limitã¨ä¸€å£ã«å…¥ã£ã¦ã‚‚è‰²ã€…ã‚ã‚‹ãŸã‚ã€ä»Šå›žã¯ä¸»ãªrate limitã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ Leaky bucket Leaky bucketã¯ãƒ‡ãƒ¼ã‚¿è»¢é€ãƒ¬ãƒ¼ãƒˆã‚’ä¸€å®šã«ã™ã‚‹ï¼ˆï¼ä¸Šé™ã‚’è¨å®šã™ã‚‹ï¼‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ä¸‹ã®å›³ã®ã‚ˆã†ã«ã€æ§˜ã€…ãªæµé‡ã®æ°´æµãŒãã®ãƒã‚±ãƒ„ã«æµã‚Œè¾¼ã‚“ã§ã‚‚å°ã•ãªç©´ã‹ã‚‰ã¯ä¸€å®šã®æ°´æµãŒæµã‚Œå‡ºã™ä»•çµ„ã¿ã§ã™ã€‚ ref: What is the difference between token
Nnwww 2019/11/17
algorithm

performance

network
ãƒªãƒ³ã‚¯
æ—¥æœ¬ã®ä¸å¿ƒã¯ã©ã®çœŒã ï¼Ÿã‚°ãƒ©ãƒ•ç†è«–ï¼ˆãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ï¼‰ã®åŸºæœ¬çš„ãªè«¸æ¦‚å¿µ - ã‚¢ã‚¸ãƒžãƒ†ã‚£ã‚¯ã‚¹
ï¼±ï¼šã“ã‚Œã¯ä½•ã®æ§‹é€ ã‚’è¡¨ã—ã¦ã„ã‚‹ã§ã—ã‚‡ã†ï¼Ÿ ã‚°ãƒ©ãƒ•ç†è«– ä¸Šã®æ§‹é€ ã®ã‚ˆã†ã«ã€é ‚ç‚¹ï¼ˆãƒŽãƒ¼ãƒ‰ã¨ã‚‚ã„ã„ã¾ã™ï¼‰ã®é›†ã¾ã‚Šã¨ã€ï¼’ã¤ã®é ‚ç‚¹ã‚’ã¤ãªãè¾ºï¼ˆã‚¨ãƒƒã‚¸ã¨ã‚‚ã„ã„ã¾ã™ï¼‰ã®é›†ã¾ã‚Šã§ã§ããŸã‚‚ã®ã®ã“ã¨ã‚’ã€Œã‚°ãƒ©ãƒ•ã€ã‚ã‚‹ã„ã¯ã€Œãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã€ã¨å‘¼ã³*1ã€ã“ã®ã‚ˆã†ãªæ§‹é€ ã‚’ç ”ç©¶ã™ã‚‹åˆ†é‡Žã“ããŒã€Œã‚°ãƒ©ãƒ•ç†è«–ï¼ˆGraph theoryï¼‰ã€ã§ã™ã€‚ä»Šå›žã¯ãã‚“ãªã‚°ãƒ©ãƒ•ã‚’ä½¿ã†ã¨ã€èº«è¿‘ãªã‚‚ã®ã®æ–°ãŸãªå´é¢ãŒè¦‹ãˆã¦ãã‚‹è©±ã€‚ ï¼ˆä½™è«‡ã§ã™ãŒã€Œã‚°ãƒ©ãƒ•ã€ã¨ã„ã†ç”¨èªžã¯ã€æ•°å¦ã ã¨é–¢æ•°ã®ã‚°ãƒ©ãƒ•ã¨ã‹å††ã‚°ãƒ©ãƒ•ã¿ãŸã„ãªã‚„ã¤ã‚‚ã‚ã£ã¦æ¤œç´¢ç²¾åº¦ãŒæ‚ªã„ã§ã™ã€‚ã‚°ãƒ©ãƒ•ç†è«–ã«é–¢ã—ã¦ã‚ã‹ã‚‰ãªã„ã“ã¨ãŒã‚ã£ãŸå ´åˆã«ã€Œã‚°ãƒ©ãƒ•ã€€â—‹â—‹ã€ã‚„ã€Œã‚°ãƒ©ãƒ•ç†è«–ã€€â—‹â—‹ã€ã¨ã‚°ã‚°ã‚‹ã‚ˆã‚Šã‚‚ã€ã€Œãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã€€â—‹â—‹ã€ã¨ã‚°ã‚°ã£ãŸã»ã†ãŒå¾—ãŸã„æƒ…å ±ã«ãƒªãƒ¼ãƒã—ã‚„ã™ã„ã¨ã„ã†ãƒ©ã‚¤ãƒ•ãƒãƒƒã‚¯ãŒçŸ¥ã‚‰ã‚Œã¦ã„ã¾ã™ï¼‰ ã•ã¦ã€å†’é ã®ã‚°ãƒ©ãƒ•ã§ã™ã€‚ã‚°ãƒ©ãƒ•ç†è«–ã®çŸ¥è˜ãªã‚“ã‹ã²ã¨ã¤ã‚‚ãªãã¦ã‚‚ã€ã“ã®ã‚°ãƒ©ãƒ•ã‹ã‚‰èªã¿å–ã‚Œã‚‹ã“ã¨ã¯ã„ãã¤ã‚‚ã‚ã‚Šã¾ã™ã€‚ä¾‹
Nnwww 2019/03/12
graph

algorithm
ãƒªãƒ³ã‚¯
Elias-Fano encoding: å˜èª¿å¢—åŠ ã™ã‚‹æ•°åˆ—ã‚’ã»ã¼ç°¡æ½”ã«è¡¨ç¾ã™ã‚‹ - ãƒ¢ãƒŠãƒ‰ã¨ã‚ãŸã—ã¨ã‚³ãƒ¢ãƒŠãƒ‰
Haskell Advent Calendar 2018 20æ—¥ç›® å˜èª¿å¢—åŠ ã™ã‚‹è‡ªç„¶æ•°ã®åˆ—ã‚’ã€æœ€ä½Žé™ã®ãƒ“ãƒƒãƒˆæ•°ã§è¡¨ç¾ã™ã‚‹ãŸã‚ã®èˆˆå‘³æ·±ã„ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯ã¨ã€Haskellã«ã‚ˆã‚‹å®Ÿè£…ã‚’ç´¹ä»‹ã™ã‚‹ã€‚ Elias-Fano encoding ã“ã®æ‰‹æ³•ã¯ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«åˆ†é¡žã•ã‚Œã‚‹ã‚‚ã®ä¸€ã¤ã§ã‚ã‚‹ãŒã€åŽ³å¯†ã«ã¯æ¡ä»¶ã‚’æº€ãŸã•ãªã„ãŸã‚ç–‘ä¼¼ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨å‘¼ã°ã‚Œã‚‹ã€‚1970å¹´ä»£ã€Peter Eliasã¨Robert Mario Fanoã«ã‚ˆã£ã¦ç‹¬ç«‹ã—ã¦ç™ºè¦‹ã•ã‚ŒãŸã€‚ ä¾‹é¡Œã¨ã—ã¦1, 1, 4, 10, 17, 22, 23, 30ã¨ã„ã†åˆ—ã‚’ã‚¨ãƒ³ã‚³ãƒ¼ãƒ‰ã—ã¦ã¿ã‚ˆã†ã€‚ã¾ãšã€ãã‚Œãžã‚Œã®æ•°ã‚’ä¸Šä½3ãƒ“ãƒƒãƒˆã¨ä¸‹ä½2ãƒ“ãƒƒãƒˆã«åˆ†å‰²ã™ã‚‹ã€‚åˆ—ã®é•·ã•ã‚’Nã¨ã—ãŸã¨ãã€ä¸Šä½ã®ãƒ“ãƒƒãƒˆæ•°ã¯ã¨ã™ã‚‹ã€‚ ä¸Šä½ãƒ“ãƒƒãƒˆã®åˆ—ã¯000 000 001 010 100 101 101 111ã¨ãªã‚‹ã€‚ã“ã‚Œã‚’ãƒ’ã‚¹ãƒˆã‚°ãƒ©ãƒ ã®ã‚ˆã†ã«ã—ã¦23å€‹ã®ãƒ“ãƒ³ã«åˆ†ã‘ã‚‹ã€‚ 000: 2å€‹
Nnwww 2019/02/28
å˜èª¿å¢—åŠ ã™ã‚‹æ•°åˆ—ã®ç–‘ä¼¼ç°¡æ½”è¡¨ç¾(ã‚ªãƒ³ãƒ©ã‚¤ãƒ³æ€§ãŒä¸è¦ãªå ´åˆ)

haskell

algorithm

succint
ãƒªãƒ³ã‚¯
Left-leaning Red-Black Trees (PDF)
Robert Sedgewick is the founding chair and the William O. Baker Professor in the Department of Computer Science at Princeton University. He was a member of the board of directors of Adobe Systems from 1990 to 2016, served on the faculty at Brown University from 1975 to 1985, and has held visiting research positions at Xerox PARC, IDA, and INRIA. His research expertise is in algorithm science, data
Nnwww 2018/11/27
RBtreeè€ƒæ¡ˆè€…è‡ªèº«ã«ã‚ˆã‚‹å®Ÿè£…ç°¡å˜åŒ–ã®ãŸã‚ã®æ”¹è¨‚ç‰ˆ

algorithm
ãƒªãƒ³ã‚¯
A Very Simple Prime Sieve in Haskell - Donnacha OisÃn Kidney
A few days ago, the Computerphile YouTube channel put up a video about infinite lists in Haskell (Haran 2018). Itâ€™s pretty basic, but finishes up with a definition of an infinite list of prime numbers. The definition was something like this: primes = sieve [2..] sieve (p:ps) = p : sieve [ x | x <- ps, mod x p /= 0 ] This really demonstrates the elegance of list comprehensions coupled with lazy eva
Nnwww 2018/11/16
Haskellã®æœ‰åãªäºŒè¡Œã‚¨ãƒ©ãƒˆã‚¹ãƒ†ãƒã‚¹ã®ç¯©ã‚‚ã©ãã¯ã‚„ã£ã±ã‚Šè‹±èªžåœã§ã‚‚Disã‚‰ã‚Œã¦ã„ã‚‹ã‚‰ã—ãã€æ¥ã‚’ç…®ã‚„ã—ãŸæ–¹ãŒç¯©ã«ã‚ˆã‚‹ç„¡é™ç´ æ•°åˆ—ã®ç®—å‡ºã‚’å˜ç´”åŒ–ã—ã¦ã‚‰ã£ã—ã‚ƒã‚‹

haskell

algorithm

programming
ãƒªãƒ³ã‚¯
Cache-friendly binary search
High-speed memory caches present in modern computer architectures favor data structures with good locality of reference, i.e. the property by which elements accessed in sequence are located in memory addresses close to each other. This is the rationale behind classes such as Boost.Container flat associative containers, that emulate the functionality of standard C++ node-based associative container
Nnwww 2018/11/03
ã“ã®ç€ç›®ç‚¹è‡ªä½“é¢ç™½ã„ã‘ã©ã€ã‚€ã—ã‚æœ€é©åŒ–ã—ãŸã„æ™‚ã«æ‰±ã£ã¦ã„ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ã‚¢ã‚¯ã‚»ã‚¹é »åº¦ã®ãƒ’ãƒ¼ãƒˆãƒžãƒƒãƒ—ã‚’ä½œã£ã¦ã¿ã‚‹ã¨ã„ã†ã®ãŒãŸã‚ã«ãªã£ãŸ

algorithm

cache

programming
ãƒªãƒ³ã‚¯
OPIC: Object Persistence In C (Beta)
Nnwww 2017/05/11
Algorithm

c
ãƒªãƒ³ã‚¯
Writing a damn fast hash table with tiny memory footprints - Carpe diem (Felix's blog)
Hash table is probably the most commonly used data structure in software industry. Most implementations focus on its speed instead of memory usage, yet small memory footprint has significant impact on large in-memory tables and database hash indexes. In this post, Iâ€ll provide a step by step guide for writing a modern hash table that optimize for both speed and memory efficiency. Iâ€™ll also give so
Nnwww 2017/05/11
ãƒ¡ãƒ¢ãƒªä½¿ç”¨é‡ã‚’ä¸‹ç•Œè¿‘ãã¾ã§çµžã£ãŸä¸Šã§é€Ÿåº¦ã‚’è¿½æ±‚ã™ã‚‹hash tableã®è€ƒå¯ŸåŠã³ãã®æˆæžœç‰©!/ãŠã¾ã‘ã«å‡„ã¾ã˜ãèªã¿ã‚„ã™ã„è‹±èªž

hash

Algorithm

programming

c
ãƒªãƒ³ã‚¯
Rustã§ã‚°ãƒ©ãƒ•ã‚’è¡¨ç¾ã™ã‚‹ã«ã¯Typed ArenaãŒä¾¿åˆ© - ç°¡æ½”ãªQ
æ¦‚è¦: Rustã§ã‚°ãƒ©ãƒ•ã®ã‚ˆã†ã«ç›¸äº’å‚ç…§ã‚’å«ã‚€ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’è¡¨ç¾ã™ã‚‹ã«ã¯ã€Typed Arenaã¨ã„ã†æ–¹æ³•ãŒé©ã—ã¦ã„ã‚‹ã€‚ã“ã‚Œã«ã¤ã„ã¦èª¬æ˜Žã™ã‚‹ æ•´æ•°ã«ã‚ˆã‚‹è¡¨ç¾ ã‚°ãƒ©ãƒ•ã®è¡¨ç¾æ–¹æ³•ã§ã€æœ€ã‚‚ç°¡å˜ãªã®ã¯ã€ãƒŽãƒ¼ãƒ‰ã‚’æ•´æ•°ã§è¡¨ã—ã€ã‚°ãƒ©ãƒ•ã®ãƒ‡ãƒ¼ã‚¿ã‚’åˆ¥ã«æŒã¤æ–¹æ³•ã§ã‚ã‚‹ã€‚ fn main() { let mut edges = vec![vec![]]; edges[0].push(0); edges.push(vec![]); edges[1].push(0); } ã“ã‚Œã¯å¤§æŠµã©ã‚“ãªè¨€èªžã§ã‚‚åŒã˜ã‚ˆã†ã«ä½¿ãˆã‚‹ã—ã€å ´åˆã«ã‚ˆã£ã¦ã¯ã“ã¡ã‚‰ã§æ¸ˆã¾ã›ã¦ã—ã¾ã£ãŸã»ã†ãŒç°¡å˜ã‹ã‚‚ã—ã‚Œãªã„ã€‚ç‰¹ã«ç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯ãƒŽãƒ¼ãƒ‰ã«ä»˜ä¸Žã•ã‚Œã¦ã„ã‚‹æƒ…å ±ãŒå°‘ãªã‹ã£ãŸã‚Šã€ãƒŽãƒ¼ãƒ‰ã«æ˜Žç¤ºçš„ã«æ•´æ•°ãŒä»˜ç•ªã•ã‚Œã¦ã„ãŸã‚Šã™ã‚‹ãŸã‚ã€ã»ã¨ã‚“ã©ã®å ´åˆæ•´æ•°ã§è¡¨ç¾ã™ã‚‹ã»ã†ãŒæ‰±ã„ã‚„ã™ã„ã€‚ ã—ã‹ã—ã“ã®æ–¹æ³•ã§ã¯ã€æ•´æ•°ã¨ã‚°ãƒ©ãƒ•ãƒ‡ãƒ¼ã‚¿ã¨ã®å¯¾å¿œé–¢ä¿‚ã‚’è¦‹å¤±ã„ã‚„ã™ã„ã¨è€ƒãˆã‚‰ã‚Œã‚‹ã€‚æ•´
Nnwww 2017/04/29
Rust

Algorithm
ãƒªãƒ³ã‚¯
ESMAJ : EXACT STRING MATCHING ALGORITHMS
Contents EXACT STRING MATCHING ALGORITHMS Animation in Java Christian Charras - Thierry Lecroq Laboratoire d'Informatique de Rouen UniversitÃ© de Rouen FacultÃ© des Sciences et des Techniques 76821 Mont-Saint-Aignan Cedex FRANCE
Nnwww 2017/01/08
æ–‡å—åˆ—æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ é›†

programming

Algorithm
ãƒªãƒ³ã‚¯
Hash-flooding DoS ã¨ SipHash - ã‚ã©ã‘ãªã„è©±
ä»¥å‰ã€åƒ•ãŒå®Ÿè£…ã—ã¦ã„ã‚‹ web ã‚µãƒ¼ãƒ Mighty ãŒã€Haskell ã§æ›¸ã„ã¦ã„ã‚‹ã«ã‚‚é–¢ã‚ã‚‰ãšã€ã‚»ã‚°ãƒ¡ãƒ³ãƒ†ãƒ¼ã‚·ãƒ§ãƒ³ãƒ•ã‚©ãƒ¼ãƒ«ãƒˆã‚’èµ·ã“ã—ã¦ã„ãŸã€‚èª¿ã¹ãŸã¨ã“ã‚ hashable ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒãƒªãƒ³ã‚¯ã™ã‚‹ C ã® DJBX33X ãŒã€SipHash ã«å¤‰ã‚ã£ãŸã“ã¨ãŒåŽŸå› ã ã£ãŸã€‚ã“ã®ã¨ãã‹ã‚‰ SipHash ãŒæ°—ã«ãªã£ã¦ã„ãŸã—ã€ä»¥å‰ç¤¾å†…ã§èª¬æ˜Žã—ãŸ "Efficient Denial of Service Attacks" ã¨ã®é–¢ä¿‚ã‚‚çŸ¥ã‚ŠãŸã‹ã£ãŸã®ã§ã€å°‘ã—èª¿ã¹ã¦ã¿ãŸã€‚ã“ã®è¨˜äº‹ã¯ã€ãã®è¦šãˆæ›¸ãã€‚ Hash-flooding DoS ã®æ´å² 1998 å¹´ã« Alexander Peslyak æ°ãŒ Phrack Magazine ã§ã€Hash-flooding DoS ã‚’å—ã‘ãŸã“ã¨ã‚’å ±å‘Šã—ã¦ã„ã‚‹ã€‚ãƒãƒƒã‚·ãƒ¥ã¯ã€N å€‹ã®è¦ç´ ã‚’æŒ¿å…¥ã™ã‚‹ã®ã«é€šå¸¸ O(N) ã‹ã‹ã‚‹ãŒã€ãƒãƒƒã‚·ãƒ¥å€¤ãŒã™ã¹ã¦è¡çªã™ã‚‹æœ€æ‚ªã®å ´åˆã§ã¯ O
Nnwww 2016/12/04
hash

algorithm

security
ãƒªãƒ³ã‚¯
Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections
the morning paper a random walk through Computer Science research, by Adrian Colyer Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections â€“ Steinforder & Vinju, 2015 Youâ€™d think that the collection classes in modern JVM-based languages would be highly efficient at this point in time â€“ and indeed they are. But the wonderful thing is that there always seems to be room for im
Nnwww 2016/02/27
functional

algorithm

JVM
ãƒªãƒ³ã‚¯
What's new in purely functional data structures since Okasaki?
Since Chris Okasaki's 1998 book "Purely functional data structures", I haven't seen too many new exciting purely functional data structures appear; I can name just a few: IntMap (also invented by Okasaki in 1998, but not present in that book) Finger trees (and their generalization over monoids) There are also some interesting ways of implementing already known datastructures, such as using "nested
Nnwww 2016/02/11
Okasakiæœ¬ä»¥é™ã®ç´”ç²‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¤ã„ã¦ã®æ–‡çŒ®ãƒªã‚¹ãƒˆ

functional

programming

algorithm

FunctionalProgramming
ãƒªãƒ³ã‚¯
algorithm - PATRICIA ã«ä¸€ç•ªä¼¼åˆã†å§“ã¯ Crit-Bit ã‹ã‚‚ : 404 Blog Not Found
2013å¹´02æœˆ14æ—¥04:30 ã‚«ãƒ†ã‚´ãƒªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç™¾é¸Math algorithm - PATRICIA ã«ä¸€ç•ªä¼¼åˆã†å§“ã¯ Crit-Bit ã‹ã‚‚ é«˜é€Ÿæ–‡å—åˆ—è§£æžã®ä¸–ç•Œ å²¡é‡ŽåŽŸå¤§è¼” ã€Œé«˜é€Ÿæ–‡å—åˆ—è§£æžã®ä¸–ç•Œã€ã‚’èªã‚“ã ã‚‰ã€ç†±ãŒã¶ã‚Šã‹ãˆã—ã¦ããŸã®ã§ã€‚ ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ã‚„å¹³è¡¡äºŒåˆ†æœ¨ã«ä»£ã‚ã‚‹é€£æƒ³é…åˆ—ã‚’å®Ÿè£…ã™ã‚‹ã«ã¯ã©ã†ã—ãŸã‚‰ã‚ˆã„ã®ã‹ã¨ã„ã†ã€çŸ¥æµç†±ãŒã€‚ ã™ã¹ã¦ã®ãƒãƒƒã‚·ãƒ¥è¡çªã‚’ã€ç”Ÿã¾ã‚Œã‚‹å‰ã«æ¶ˆã—åŽ»ã‚ŠãŸã„ã€‚ã™ã¹ã¦ã®å®‡å®™ã€éŽåŽ»ã¨æœªæ¥ã®å…¨ã¦ã®ãƒãƒƒã‚·ãƒ¥è¡çªã‚’ã€ã“ã®æ‰‹ã§ãªãã¦ã‚‚ã„ã„ã‹ã‚‰ã€‚ ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ« - Wikipedia ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ« (hash table) ã¯ã€ã‚ãƒ¼ã¨å€¤ã®çµ„ï¼ˆã‚¨ãƒ³ãƒˆãƒªã¨å‘¼ã¶ï¼‰ã‚’è¤‡æ•°å€‹æ ¼ç´ã—ã€ã‚ãƒ¼ã«å¯¾å¿œã™ã‚‹å€¤ã‚’ã™ã°ã‚„ãå‚ç…§ã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€‚ãƒãƒƒã‚·ãƒ¥è¡¨ã¨ã‚‚ã„ã†ã€‚ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ã¯é€£æƒ³é…åˆ—ã‚„é›†åˆã®æœ€ã‚‚åŠ¹çŽ‡çš„ãªå®Ÿè£…ã®ã†ã¡1ã¤ã§ã‚ã‚‹ ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ã¯ã‚ã¾ã‚Šã«æ„›ç”¨ã•ã‚Œã¦ããŸãŸã‚ã€é€£æƒ³é…
Nnwww 2015/12/07
crit-bit

algorithm

DataStructure

hash

programming
ãƒªãƒ³ã‚¯
ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ LOUDS ã®è§£èª¬ï¼ˆå…¨12å›žã€ç·´ç¿’å•é¡Œä»˜ãï¼‰
ã€Œæ—¥æœ¬èªžå…¥åŠ›ã‚’æ”¯ãˆã‚‹æŠ€è¡“ã€ï¼ˆé€šç§°ã€Œå¾³æ°¸æœ¬ã€ï¼‰ã‚„ã€Œé«˜é€Ÿæ–‡å—åˆ—è§£æžã®ä¸–ç•Œã€ï¼ˆé€šç§°ã€Œå²¡é‡ŽåŽŸæœ¬ã€ï¼‰ã§ç´¹ä»‹ã•ã‚Œã¦ã„ã‚‹ LOUDS ã¨ã„ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’ã€12å›žã«åˆ†ã‘ã¦è§£èª¬ã—ã¾ã—ãŸã€‚ å‹é”ã«æ•™ãˆã‚‹æ™‚ã«ä½¿ã£ãŸã‚‚ã®ã§ã€ç·´ç¿’å•é¡Œä»˜ãã§ã™ã€‚ å®Ÿéš›ã«ç´™ã«æ›¸ã„ã¦ã‚„ã£ã¦ã¿ã‚‹ã¨ã‚ã‹ã‚Šã‚„ã™ã„ã¨æ€ã„ã¾ã™ã€‚ è©³è§£ LOUDS (1) LOUDS ã¨ã¯ è©³è§£ LOUDS (2) ãƒ“ãƒƒãƒˆåˆ—ã‚’ä½œã£ã¦ã¿ã‚‹ è©³è§£ LOUDS (3) 0ç•ªãƒŽãƒ¼ãƒ‰ è©³è§£ LOUDS (4) ãƒ“ãƒƒãƒˆã®æ„å‘³ è©³è§£ LOUDS (5) æœ¨æ§‹é€ ã®å¾©å…ƒ è©³è§£ LOUDS (6) ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã§ãƒŽãƒ¼ãƒ‰ã‚’è¡¨ã™ è©³è§£ LOUDS (7) ãƒŽãƒ¼ãƒ‰ç•ªå·ã‹ã‚‰ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‚’å¾—ã‚‹ è©³è§£ LOUDS (8) ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‹ã‚‰ãƒŽãƒ¼ãƒ‰ç•ªå·ã‚’å¾—ã‚‹ è©³è§£ LOUDS (9) åãƒŽãƒ¼ãƒ‰ã‹ã‚‰è¦ªãƒŽãƒ¼ãƒ‰ è©³è§£ LOUDS (10) è¦ªãƒŽãƒ¼ãƒ‰ã‹ã‚‰åãƒŽãƒ¼ãƒ‰ è©³è§£ LOUDS (11) æœ¨ã®æ¤œç´¢ è©³è§£
Nnwww 2015/11/22
programming

algorithm
ãƒªãƒ³ã‚¯
æœ¨ãƒ¡ãƒ¢ - Negative/Positive Thinking
ã¯ã˜ã‚ã« ç«‹æ´¾ãªåºå¸«ã«ãªã‚‹ãŸã‚ã«ã€æœ¨ã«ã¤ã„ã¦ã¡ã‚‡ã£ã¨èª¿ã¹ã¦ã¿ãŸã®ã§ã€ã¾ã¨ã‚ã¦ãŠãã€‚ æœ¨(æ§‹é€ )ã¨ã¯ é–‰è·¯ã‚’å«ã¾ãªã„ç„¡å‘ã‚°ãƒ©ãƒ•ã‚’ã€Œæ£®ã€ã¨ã„ã† é€£çµãªæ£®ã‚’ã€Œæœ¨ã€ã¨ã„ã† ä¸Žãˆã‚‰ã‚ŒãŸé ‚ç‚¹ãŒå…¨ã¦ã¤ãªãŒã£ã¦ã„ã¦ã€é–‰è·¯ã‚’å«ã‚“ã§ã„ãªã„ é–‰è·¯ã‚’å«ã¾ãªã„æœ‰å‘ã‚°ãƒ©ãƒ•ã¯ã€ŒDAG(Directed acyclic graph)ã€ã¨ã„ã† ã‚ã‚‹é ‚ç‚¹ã‚’æ ¹(Root)ã¨ã—ã¦ã‚‚ã¤æœ¨ã‚’ã€Œæ ¹ä»˜ãæœ¨ã€ã¨ã„ã† 2ç‚¹v,wãŒè¾ºã‚’æŒã¡ã€vã®æ–¹ãŒæ ¹ã«è¿‘ã„å ´åˆã€vã‚’ã€Œè¦ªã€ã€wã‚’ã€Œåã€ã¨ã„ã† 2ç‚¹v,wã«ã¤ã„ã¦ã€æ ¹ã¨vã¨ã®çµŒè·¯ã«wãŒå˜åœ¨ã™ã‚‹å ´åˆã€wã¯vã®ã€Œå…ˆç¥–ã€ã€vã¯wã®ã€Œåå«ã€ã¨ã„ã† åã‚’æŒãŸãªã„é ‚ç‚¹ã‚’ã€Œè‘‰ã€ã¨ã„ã† æ ¹ã‹ã‚‰å„ç‚¹ã¸ã®çµŒè·¯ã®é•·ã•(1è¾ºã‚’1ã¨ã™ã‚‹)ã‚’ã€Œé«˜ã•ã€ã¨ã„ã† å„ç‚¹ã®åã®æ•°ãŒå¸¸ã«nåã®æœ¨ã‚’ã€Œnåˆ†æœ¨ã€ã¨ã„ã† é€£çµã‚°ãƒ©ãƒ•Gã«ã¤ã„ã¦ã€é–‰è·¯ãŒã§ããªããªã‚‹ã¾ã§è¾ºã‚’é™¤åŽ»ã—ç¶šã‘ã‚‹ã¨ã€æ®‹ã£ãŸã‚‚ã®ã¯ã€Œå…¨åŸŸæœ¨ã€ã¨ãªã‚‹ æ ¹ä»˜ãæœ¨ã‚’æŽ¢ç´¢ãªã©ã«ç”¨ã„ã‚‹ã“
Nnwww 2015/11/22
programming

algorithm

tree
ãƒªãƒ³ã‚¯
1