Red Blob Games: Hexagonal Grids
Mar 2013, updated in Mar 2015, Apr 2018, Feb 2019, May 2020, Oct 2021, Dec 2022, Feb 2023, Oct 2024, Mar 2025 This guide will cover various ways to make hexagonal grids, the relationships between different approaches, and common formulas and algorithms. I've been collecting hex grid resources[1] for over 25 years. I wrote this guide to the most elegant approaches that lead to the simplest code, st
research!rsc: Go Data Structures
When explaining Go to new programmers, I've found that it often helps to explain what Go values look like in memory, to build the right intuition about which operations are expensive and which are not. This post is about basic types, structs, arrays, and slices. Basic types Let's start with some simple examples: The variable i has type int, represented in memory as a single 32-bit word. (All these
Burrows Wheeler Transform 㨠Suffix Array - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
,. -â€'''''""¨¨¨ヽ (.＿＿_,,,... -ｧァﾌ|　　　　　　　　　　ã‚…ã‚ã‚Šã®ã¾ã¾ 今日　起ã“ã£ãŸäº‹ã‚’話ã™ãœï¼ |i i|　 　 }!　}} /ï¼| |l､{　 　j}　/,,ｨ//｜　　　　　　　『BWT ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ãŸã‚‰ Suffix Array ã®ãƒ©ã‚¤ãƒ–ラリãŒã§ãã¦ã„ãŸã€ i|:!ヾ､_ï¾‰ï¼ u {:}//ï¾ |ﾘ u' }　 ,ﾉ　_,!V,ﾊ | ï¼Â´fト､_{ï¾™{,ã‚£'ｅﾗ　, ﾀ人　　　　　　　　ãªâ€¦ã€€ä½•ã‚’言ã£ã¦ã‚‹ã®ã‹ã€€ã‚ã‹ã‚‰ãーã¨æ€ã†ãŒ /' 　 ヾ|宀| {´,)⌒`/ |<ヽﾄiã‚　　　　　　　　ãŠã‚Œã‚‚何をã•ã‚ŒãŸã®ã‹ã‚ã‹ã‚‰ãªã‹ã£ãŸâ€¦ ,ﾞ　 ï¼ )ヽ iLﾚ 　u' |　| ヾｌﾄﾊ〉 |ï¼_ï¼ã€€ ﾊ !ニ⊇　'ï¼:} 　V:::::ヽ　　　　　　　　é ãŒã©ã†ã«ã‹ãªã‚Šãã†ã ã£ãŸâ€¦ /ï¼ äºŒäºŒäºŒ7'T'' ï¼u'　__ /:::::::/｀ヽ /'
Suffix tree - Wikipedia
Suffix tree for the text BANANA. Each substring is terminated with special character $. The six paths from the root to the leaves (shown as boxes) correspond to the six suffixes A$, NA$, ANA$, NANA$, ANANA$ and BANANA$. The numbers in the leaves give the start position of the corresponding suffix. Suffix links, drawn dashed, are used during construction. In computer science, a suffix tree (also ca
20分ã§ã‚ã‹ã‚‹Purely Functional Data Structures (PDF)
20分ã§ã‚ã‹ã‚‹ Purely Functional Data Structures k.inaba (http://www.kmonos.net/) Apr. 4, 2010 ã‚らã™ã˜ イ ミ ュ ー ã‚¿ ブ ル デ ー ã‚¿ 構 é€ ã¯ é… ã„ Immutable Object ã ã‘ã§ä½œã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã“ã®æœ¬ã® 内 容を 全速力㧠布教ã™ã‚‹ ãŠé¡Œï¼šã‚ュー (Queue) • FIFO (First-In First-Out) • pushBack(e) ã§ãƒ‡ãƒ¼ã‚¿eを入れる • popFront() ã§å–り出ã›ã‚‹ • 入れãŸé †ã«å‡ºã¦ãã‚‹ • 以上 ç ´å£Šçš„ã‚ュー Immutable Object ã§ãªã„ 打倒ã™ã¹ã目標 代 å…¥ 手続ãåž‹ã§ã‚ˆãã‚ã‚‹ interface Queue<E> { void pushBack(E e); E popFront(); } よãã‚る実装 1 2 3 ・ 4 ・
Hey Judy, don't make it bad
AI & MLLearn about artificial intelligence and machine learning across the GitHub ecosystem and the wider industry. Generative AILearn how to build with generative AI. GitHub CopilotChange how you work with GitHub Copilot. LLMsEverything developers need to know about LLMs. Machine learningMachine learning tips, tricks, and best practices. How AI code generation worksExplore the capabilities and be
最近ã®trieã®è©±ï¼ˆxbwãªã©ï¼‰ - Preferred Networks Tech Blog
ブãƒã‚°ã®æ›´æ–°ãŒã¨ã¾ã£ã¦ã„ã¾ã—ãŸãŒã€ã¾ãŸå°‘ã—ãšã¤æ›´æ–°ã—ã¦ããŸã„ã¨æ€ã„ã¾ã™ã€‚ 今回ã¯trie（トライ）ã®æœ€è¿‘ã®è©±ã‚’ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ trieã¯ã‚ー集åˆã‚’扱ã†ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ç¨®ã§ã™ã€‚例ãˆã°ã€å˜èªžé›†åˆã‹ã‚‰ãªã‚‹è¾žæ›¸ã§ã‚ã£ãŸã‚Šã€ã‚¯ãƒãƒ¼ãƒ«ã—ãŸURLæƒ…å ±ã‚’æ‰±ã£ãŸã‚Šã€æœ€è¿‘ã ã¨ã€KVS（Key Value Store)ã®ã‚ˆã†ã«ã‚ーを介ã—ã¦ãƒ‡ãƒ¼ã‚¿ã‚’ä¿å˜ã€èªã¿è¾¼ã¿ã‚’ã—ãŸã‚Šã¨æ§˜ã€…ãªå ´é¢ã§åˆ©ç”¨ã•ã‚Œã¾ã™ã€‚ åŒã˜ã‚ˆã†ã«ã‚ー集åˆã‚’æ ¼ç´ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã—ã¦ãƒãƒƒã‚·ãƒ¥ã‚’利用ã™ã‚‹æ–¹æ³•ãŒã‚ã‚Šã¾ã™ã€‚ã‚ーã‹ã‚‰ãƒãƒƒã‚·ãƒ¥å€¤ã‚’計算ã—ã€ãã®å ´æ‰€ã«æ–‡å—列ã¸ã®ãƒã‚¤ãƒ³ã‚¿ã‚’æ ¼ç´ã—ã¦ãŠããƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚ãƒãƒƒã‚·ãƒ¥ã‚’利用ã—ãŸå ´åˆã¨trieを利用ã—ãŸå ´åˆã®ä¸€ç•ªã®å¤§ããªé•ã„ã¯ã€trieã®å ´åˆã ã¨ã€ã‚ã‚‹æ–‡å—列ã‹ã‚‰å§‹ã¾ã‚‹ã‚ーを全ã¦åˆ—挙ã™ã‚‹ã€ã„ã‚ゆる接é 辞探索ãŒã§ãã‚‹ã“ã¨ã§ã™ã€‚例ãˆã°â€teâ€ã§å§‹ã¾ã‚‹æ–‡å—列を網羅的ã«èª¿ã¹ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚木をãŸã©ã£ã¦ã€â€teâ€ã®ä¸‹
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}