[B! ã‚ã¨ã§èªã‚€] nfunatoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

nfunato id:nfunato

ã‚ã¨ã§èªã‚€ã«é–¢ã™ã‚‹nfunatoã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (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}}

Mosaic Documentation Web
nfunato 2016/03/24
ã‚ã¨ã§èªã‚€

forth
ãƒªãƒ³ã‚¯
morecat_lab Â» Arduino_STM32 Blue Pill Board (BPB)Arduino_STM32 with Blue Pill Board (BPB)
Arduino_STM32ã‚’å¼•ãç¶šãè©¦ã—ã¦ã„ã¾ã™ã€‚ é€šç§°Blue Pill Board (BPB)ã‚’è©¦ã—ãŸã®ã§ã€å ±å‘Šã—ã¾ã™ã€‚ 1.Blue Pill Boardã¨ã¯ Blue Pill Boardã¯STM32F103C8T6ã‚’ä¹—ã›ãŸãƒœãƒ¼ãƒ‰ã§ã™ã€‚Arduino_STM32ãƒ•ã‚©ãƒ¼ãƒ©ãƒ ã§ã¯æœ€ã‚‚å¤šãä½¿ã‚ã‚Œã¦ã„ã‚‹ãƒœãƒ¼ãƒ‰ã®ä¸€ã¤ã§ã™ã€‚ Aliexpressã‚„ebayã§éžå¸¸ã«å®‰ä¾¡ã«å…¥æ‰‹å¯èƒ½ã§ã™ã€‚ ã‚ãŸã—ã®è³¼å…¥ã—ãŸã‚‚ã®ã¯ã€ã“ã‚Œã§ã™ã€‚ä¸€æžš$2.45ã§ã€ãƒ”ãƒ³ãƒ˜ãƒƒãƒ€ãƒ¼ãŒä»˜å±žã—ã¦ã„ã¾ã™ã€‚æ—¥æœ¬ã¸ã®é€æ–™ã‚‚ç„¡æ–™ã§ã—ãŸã€‚ æ¥è€…ã«ã‚ˆã£ã¦ã„ãã¤ã‹ãƒãƒƒãƒˆé•ã„ï¼ˆãƒãƒªã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ï¼‰ãŒã‚ã‚‹ã‚ˆã†ã§ã€ã“ã®è¨˜äº‹ã®å†…å®¹ãã®ã¾ã¾é©ç”¨ã§ããªã„å¯èƒ½æ€§ãŒã‚ã‚Šã¾ã™ã€‚ ï¼ˆãƒ•ãƒ©ãƒƒã‚·ãƒ¥ã¯64K, ãƒ¡ãƒ¢ãƒªã¯20Kã§ã™ãŒã€æè¼‰ã•ã‚Œã¦ã„ã‚‹ãƒãƒƒãƒ—ã®ç•°ãªã‚‹ã‚‚ã®ã‚‚ã‚ã‚‹ã‚ˆã†ã§ã™ï¼‰ ã“ã®ãƒšãƒ¼ã‚¸ã«æ›¸ã„ã¦ã‚ã‚‹æ–¹æ³•ã¯ã€Roger Clarkæ°ã®ãƒšãƒ¼ã‚¸ï¼ˆã“ã“ï¼‰ã‚’å‚è€ƒã«ã—ã¦ã„ã¾ã™ã€‚ 2
nfunato 2016/03/24
ã‚ã¨ã§èªã‚€

electronic_parts

Arduino
ãƒªãƒ³ã‚¯
mrtg alternative
nfunato 2016/03/01
ã‚ã¨ã§èªã‚€

network
ãƒªãƒ³ã‚¯
done: builderscon prep meeting #1
buildersconèª¬æ˜Žä¼šãã®1ã‚’é–‹å‚¬ã—ã¾ã—ãŸã€‚ ä»Šå¹´ã®å†¬ã¾ã§ã«æœ€ä½Žä¸€å›žä¸è¦æ¨¡ã®ã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã‚’é–‹å‚¬ã™ã‚‹ãžï¼buildersconã¨ã¯ã€Œã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã€ã§ã‚ã‚Šã€ã€Œã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã‚’é–‹å‚¬ã™ã‚‹ãŸã‚ã®ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ã€ã§ã‚‚ã‚ã‚‹ã¨ã„ã†ã“ã¨ã‚’åˆã‚ã¦å…¬ã«èª¬æ˜Žã—ãŸä¼šã§ã—ãŸã€‚ ã“ã®ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯ã¨ã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹æœ¬ä½“ã¨ã„ã†æ¦‚å¿µã€ä¸€ä½“ä½•ã‚’ã—ã‚ˆã†ã¨ã—ã¦ã‚‹ã®ã‹ã€ãªã‚“ã§ã“ã‚“ãªäº‹ã‚’ã™ã‚‹ã®ã‹ã€åƒ•ã®ã‚ˆã†ã«ä½•å›žã‚‚ä½•å›žã‚‚ã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã‚’é–‹ã„ã¦ã„ã‚‹äººé–“ã§ãªã„ã¨ã™ãã«ã¯ç†è§£ã—ã¥ã‚‰ã„ã¨æ€ã†ã®ã§ã€ã“ã‚Œã‹ã‚‰ã‚‚ä½•å›žã‚‚èª¬æ˜Žã—ã¦ã„ãã“ã¨ã«ãªã‚‹ã¨æ€ã„ã¾ã™ã€‚ ã¡ãªã¿ã«4æœˆã«ã‚‚ builderscon prep meetup #2 ã‚‚é–‹å‚¬äºˆå®šã§ã™ã®ã§ã€ã¾ãšã¯Slackã«å‚åŠ ã—ã¦ãã ã•ã„ï¼ä»Šã¯å‚åŠ å¸Œæœ›è€…ãŒã©ã‚Œãã‚‰ã„ã„ã‚‹ã‹èª¿ã¹ã¦ã‚‹ã¨ã“ã‚ã§ã™ã®ã§ã€èˆˆå‘³ãŒã‚ã‚‹æ–¹ã¯ä»Šã®ã†ã¡ã«æ˜¯éžâ€¦
nfunato 2016/02/22
ã‚ã¨ã§èªã‚€
ãƒªãƒ³ã‚¯
Goè¨€èªžã§ API ã‚µãƒ¼ãƒãƒ¼ã‚’é–‹ç™ºã™ã‚‹ | ã‚«ãƒ¡ãƒªã‚ªé–‹ç™ºè€…ãƒ–ãƒã‚°
ã“ã‚“ã«ã¡ã¯ï¼ç™½ãƒ¤ã‚®ã®é–‹ç™ºè€…ã€æ£®æœ¬ã§ã™ã€‚ ç™½ãƒ¤ã‚®ã§ã¯ã„ã¾ API ã‚µãƒ¼ãƒãƒ¼ã‚’ Go è¨€èªžã§é–‹ç™ºã—ã¦ã„ã¾ã™ã€‚ çš†ã•ã‚“ã‚‚ Go ã®è©±é¡Œã‚’ã‚ˆãè¦‹èžãã™ã‚‹ã‚ˆã†ã«ãªã£ã¦ã„ã‚‹ã¨æ€ã„ã¾ã™ã€‚ä»Šå›žã¯ç™½ãƒ¤ã‚®ã®æ¥å‹™ã§ã©ã‚“ãªé¢¨ã« Go ã‚’ä½¿ã£ã¦é–‹ç™ºã—ã¦ã„ã‚‹ã‹ã®ä¸€ç«¯ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ ä½™è«‡ã§ã™ãŒã€å…ˆæ—¥ã€å¤§å¦ã®å…ˆç”Ÿã¨ãŠè©±ã—ã—ãŸã¨ãã«ã“ã‚“ãªè©±ã‚’ä¼ºã„ã¾ã—ãŸã€‚ãã®å…ˆç”Ÿã¯å¦ç”Ÿã«ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’æ•™ãˆã¦ã„ã‚‹ãã†ã§ã™ãŒã€ä½•å‰²ã‹ã®å¦ç”Ÿã¯åŠç¬¬ç‚¹ã«å±Šã‹ãªã„ãã†ã§ã™ã€‚ã—ã‹ã—ã€ãã†ã„ã£ãŸå¦ç”ŸãŒãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ç´ é¤ŠãŒãªã„ã‹ã¨ã„ã†ã¨ãã†ã„ã†è¨³ã§ã¯ãªãã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’å¦ã¶ä¸Šã§ãã®å¦ç”Ÿã«ã¨ã£ã¦ä½•ãŒç†è§£ã‚’ä¿ƒã™ã®ã‹ãŒé•ã†ã ã‘ãªã®ã ã¨ä»°ã£ã¦ã„ã¾ã—ãŸã€‚æ•™ãˆã‚‹å´ã¨ã—ã¦å…¨ã¦ã®å¦ç”ŸãŒç¿’å¾—ã§ãã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æ•™è‚²ã¨ã„ã†ã®ã‚’è¦‹ã¤ã‘ã‚‰ã‚Œã¦ã„ãªã„ã®ãŒæ‚”ã—ã„ã¨ã„ã£ãŸè©±ã‚’ã•ã‚Œã¦ã„ã¾ã—ãŸã€‚ ä½•ã‹ã‚’å¦ã¶ã¨ã„ã†ã®ã‚’ä¸€èˆ¬è«–ã§ã¯èªžã‚‹ã®ã¯é›£ã—ã„ã¨ã„ã†ã“ã¨ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ãã®ãŸã‚ã€ç§ã¯ã“ã†ã„
nfunato 2016/01/13
ã‚ã¨ã§èªã‚€

golang

tips
ãƒªãƒ³ã‚¯
C++11ã®ãƒ ãƒ¼ãƒ–ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ã®é€Ÿåº¦ã‚’è©¦ã™
C/C++ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã‚„Linuxé–¢ä¿‚ã®è©±é¡Œãªã©ãŒä¸å¿ƒã®ãƒ–ãƒã‚°ã§ã™ã€‚C/C++å…¥é–€ã‚’æ›¸ãå§‹ã‚ã¾ã—ãŸãŒæ€ã£ãŸã‚ˆã‚Šå¤§å¤‰ãƒ»ãƒ»ãƒ»é–“é•ã„ãªã©ã‚ã‚Šã¾ã‚ŠãŸã‚‰ã”æŒ‡æ‘˜ã‚’ãŠé¡˜ã„ã—ã¾ã™ã€‚ ã‚‚ã†C++14ãŒå‡ºã‚‹ã¨è¨€ã†è©±ãªã®ã§ä»Šæ›´ã§ã™ãŒã€C++ã®2011å¹´ãƒãƒ¼ã‚¸ãƒ§ãƒ³(C++11)ã®ãƒ ãƒ¼ãƒ–ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ï¼ˆå³è¾ºå€¤å‚ç…§ï¼‰ã«ã¤ã„ã¦ã§ã™ã€‚ C++11ã§ã¯C++ã®æ©Ÿèƒ½ã‚¢ãƒƒãƒ—ãŒè‰²ã€…ã¨ã‚ã‚Šã¾ã—ãŸãŒã€ç‰¹ã«ãƒ ãƒ¼ãƒ–ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ï¼ˆå³è¾ºå€¤å‚ç…§ï¼‰ã¯STLã‚’ä½¿ã£ã¦ã„ã‚Œã°ä½•ã‚‚ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’å¤‰æ›´ã›ãšã«é€Ÿåº¦å‘ä¸ŠãŒè¦‹è¾¼ã‚ã¾ã™ã—ã€ç´ æ™´ã‚‰ã—ã„ã§ã™ã€‚ ãƒ ãƒ¼ãƒ–ã‚³ãƒ³ã‚¹ãƒˆãƒ©ã‚¯ã‚¿ï¼ˆå³è¾ºå€¤å‚ç…§ï¼‰ã®ãƒ†ã‚¹ãƒˆç”¨ã«ä»¥ä¸‹ã®rvalue.cppã‚’ä½œæˆã—ã¦ã¿ã¾ã—ãŸã€‚å‹•ä½œã‚’åˆ‡ã‚Šæ›¿ãˆã‚‹ãŸã‚ã®ãƒžã‚¯ãƒãŒå¤šãã€è¦‹ã«ãã„ãƒ—ãƒã‚°ãƒ©ãƒ ã§ã™ã¿ã¾ã›ã‚“ã€‚ #include <stdio.h> #include <string.h> #include <vector> #include <memory>
nfunato 2015/09/15
ã‚ã¨ã§èªã‚€

c++11
ãƒªãƒ³ã‚¯
Spaghetti Source - Suffix Array
Suffix Array (Larsson-Sadakane) èª¬æ˜Ž Suffix Arrayã¨ã¯ï¼Œä¸Žãˆã‚‰ã‚ŒãŸæ–‡å—åˆ—ã®æŽ¥å°¾è¾žã®é›†åˆã‚’è¾žæ›¸é †ã‚½ãƒ¼ãƒˆã—ãŸã‚‚ã®ã§ã‚ã‚‹ï¼Žè¿‘å¹´ï¼Œã“ã‚Œã‚’ç”¨ã„ã‚‹ã“ã¨ã«ã‚ˆã£ã¦å¤šãã®æ–‡å—åˆ—ã®å•é¡ŒãŒè§£ã‹ã‚Œã‚‹ã“ã¨ãŒã‚ã‹ã£ã¦ããŸï¼Ž Larsson-Sadakane ã¯ Suffix Array ã‚’ O(n (log n)^2) æ™‚é–“ã§æ§‹æˆã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ï¼ŽMamber-Myers ã¨åŒæ§˜ã®ã‚¢ã‚¤ãƒ‡ã‚¢ã«ã‚ˆã£ã¦æ–‡å—åˆ—é•·ã‚’å€åŠ ã•ã›ï¼ŒO(log n) å›žã® multikey quicksort ã‚’è¡Œã†ã“ã¨ã«ã‚ˆã‚Šï¼Œå…¨ä½“ã§ O(n (log n)^2) ã®è¨ˆç®—é‡ã‚’é”æˆã™ã‚‹ï¼Žè©³ã—ãã¯é©å½“ãªæ–‡çŒ®ã‚’å‚ç…§ï¼Ž Suffix Array ã‚’ç”¨ã„ã¦è§£ã‘ã‚‹ã‚‚ã£ã¨ã‚‚å…¸åž‹çš„ãªå•é¡Œã¯ï¼Œæ–‡å—åˆ—ã®æ¤œç´¢ã§ã‚ã‚‹ï¼ŽSuffix Array ä¸Šã§äºŒåˆ†æŽ¢ç´¢ã‚’è¡Œãˆã°ï¼ŒO(m log n) ã§ãƒ‘ã‚¿ãƒ¼ãƒ³ã®æ¤œç´¢ãŒã§ãã‚‹ï¼Žã¾ãŸï¼ŒSuf
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm

data structure

succinct
ãƒªãƒ³ã‚¯
ã‚µãƒ•ã‚£ãƒƒã‚¯ã‚¹ãƒ„ãƒªãƒ¼ site:hatena.ne.jp - Google æ¤œç´¢
2012/01/19 Â· Suffix Array/TreeãŒæŒã¤æ–‡æ›¸æ¤œç´¢ã®æ©Ÿèƒ½ã¯ã€ã‚¯ã‚¨ãƒªã«ãƒžãƒƒãƒã—ãŸæ–‡æ›¸ã‚’åˆ—æŒ™ã™ã‚‹ã¨ã„ã†ã‚‚ã®ã§Document Listingã¨å‘¼ã°ã‚Œã‚‹ã€‚ã“ã®æ“ä½œã¯ã‚¯ã‚¨ãƒªé•·ã‚’pã€æ¤œç´¢å¯¾è±¡Â ...
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm
ãƒªãƒ³ã‚¯
compressed suffix tree sadakane - Google æ¤œç´¢
2007/02/07 Â· We introduce new data structures for compressed suffix trees whose size are linear in the text size. The size is measured in bits;Â ...
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm
ãƒªãƒ³ã‚¯
Compressed suffix tree implementation
SuDS project / Compressed suffix tree implementation News Our C++-implementation of compressed suffix tree is available for download (version 1.1). Note: If you have access to a 64-bit server machine with 32 GB memory, you can construct the compressed suffix tree of the complete Human Genome. The final memory requirement for HG is 8.8 GB, but during construction the memory peak is at 24 GB. This v
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm
ãƒªãƒ³ã‚¯
cplusplusdevelop.comÂ -Â ã“ã®ã‚¦ã‚§ãƒ–ã‚µã‚¤ãƒˆã¯è²©å£²ç”¨ã§ã™ï¼Â -Â cplusplusdevelop ãƒªã‚½ãƒ¼ã‚¹ãŠã‚ˆã³æƒ…å ±
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm

data structure
ãƒªãƒ³ã‚¯
MessagePack(msgpack): Compact and Fast Serialization Library
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm
ãƒªãƒ³ã‚¯
huffman/explicit_huffman at master Â· agorenst/huffman
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm
ãƒªãƒ³ã‚¯
GitHub - jnorthrup/patl: Roman Klyujkov's Practical Algorithm Template library
nfunato 2015/09/11
ã‚ã¨ã§èªã‚€

c++

algorithm

data structure
ãƒªãƒ³ã‚¯
tattsunã®ãƒ¡ãƒ¢å¸³
nfunato 2015/08/25
ã‚ã¨ã§èªã‚€

haskell

FRP
ãƒªãƒ³ã‚¯
Pointers to members in C++
nfunato 2015/08/15
ã‚ã¨ã§èªã‚€
ãƒªãƒ³ã‚¯
How are my array values getting overwritten
nfunato 2015/08/15
ã‚ã¨ã§èªã‚€
ãƒªãƒ³ã‚¯
Org-modeã§ã€ãƒ©ã‚¤ãƒ•ãƒã‚°ã‚’éŒ²ã‚ã† - Qiita
ä»Šå›žã¯ã€Org-modeãŒæä¾›ã™ã‚‹æ•°å¤šã®æ©Ÿèƒ½ã®ä¸ã‹ã‚‰ã€ãƒ©ã‚¤ãƒ•ãƒã‚°ã®éŒ²ã‚Šæ–¹ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ Org-modeã®ãƒ©ã‚¤ãƒ•ãƒã‚°ã¯ã€ã€Œã‚ã€ã“ã‚Œãƒ¡ãƒ¢ã—ã¦ãŠã“ã†ã€ã¨ã‹ã€ã€Œã‚ã‚Œã€ã“ã®ã‚µã‚¤ãƒˆã®ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ã¯ä½•ã ã£ãŸã‘ï¼Ÿã€ã¨ã„ã£ãŸã‚·ãƒ¼ãƒ³ã§ç°¡å˜ã«ä½¿ç”¨ã§ãã‚‹ã§ã€ä¸€åº¦ä½¿ã„ã ã™ã¨æ‰‹æ”¾ã›ãªããªã‚Šã¾ã™ã€‚ Org-modeã¨ã¯ Emacsã®ãƒ¡ã‚¸ãƒ£ãƒ¼ãƒ¢ãƒ¼ãƒ‰ã®1ã¤ã€‚Org-modeã®ãƒ›ãƒ¼ãƒ ãƒšãƒ¼ã‚¸ã§ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ã«ç´¹ä»‹ã—ã¦ã„ã¾ã™ã€‚ ã€ŒOrg-mode ã¯ã€ãƒŽãƒ¼ãƒˆã®ä¿å˜ã€TODOãƒªã‚¹ãƒˆã®ç®¡ç†ã€ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆè¨ˆç”»ã®ãŸã‚ã®ãƒ¢ãƒ¼ãƒ‰ã§ã™ã€‚é«˜é€Ÿã§åŠ¹çŽ‡çš„ãªãƒ—ãƒ¬ãƒ¼ãƒ³ãƒ†ã‚ã‚¹ãƒˆã®ã‚·ã‚¹ãƒ†ãƒ ã‚’ä½¿ã£ã¦ãƒ•ã‚¡ã‚¤ãƒ«ã‚’ç·¨é›†ã—ã¾ã™ã€‚ã€ æº–å‚™ ã“ã“ã‹ã‚‰ã¯ã€Ubuntu 14.10ã®Emacsã‚’ãƒ™ãƒ¼ã‚¹ã«èª¬æ˜Žã—ã¾ã™ã€‚ EmacsãŒå‹•ãç’°å¢ƒã§ã‚ã‚Œã°ã€Org-modeã¯ã€OSã‚’å•ã‚ãšå‹•ä½œã™ã‚‹ã¨æ€ã„ã¾ã™ã€‚ Org-modeã®ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« Ubuntu 14.10ã®Emacsãƒ‘ãƒƒã‚±ãƒ¼
nfunato 2015/01/27
ã‚ã¨ã§èªã‚€

orgmode
ãƒªãƒ³ã‚¯
1