binary_search
このタグの解説について
この解説文は、すでに終了したサービス「はてなキーワード」内で有志のユーザーが作成・編集した内容に基づいています。その正確性や網羅性をはてなが保証するものではありません。問題のある記述を発見した場合には、お問い合わせフォームよりご連絡ください。関連ブログ
ネットで話題
もっと見る
speakerdeck.com
dankogai.livedoor.blog33ブックマークStatic search trees: 40x faster than binary search1 Introduction1.1 Problem statement1.2 Motivation1.3 Recommended reading1.4 Binary search and Eytzinger layout1.5 Hugepages1.6 A note on benchmarking1.7 Cache lines1.8 S-trees and B-trees2 Optimizing find2.1 Linear2.2 Auto-vectorization2.3 Trailing zeros2.4 Popcount2.5 Manual SIMD3 Optimizing the...
curiouscoding.nl
curiouscoding.nl
probablydance.com16ブックマークRuby/Bsearch: a binary search library for RubyRuby/Bsearch is a binary search library for Ruby. It can search the FIRST or LAST occurrence in an array with a condition given by a block. The latest version of Ruby/Bsearch is available at <URL:/ruby-bsearch/> . Example % irb -r ./bsearch.rb >> %w(a b c c c d e f).bsearch_first {|x| x <=> "c"} ...
0xcc.net
0xcc.net
bannalia.blogspot.com
academy.realm.io5ブックマークA Formal Verification of Rust's Binary Search ImplementationThis post is about my ongoing master’s thesis under Jeremy Avigad at Carnegie Mellon University, in which I’m trying to tackle formal verification of Rust programs in the interactive theorem prover Lean, and a first result of the project: a complete verification of the Rust stdlib’s binary search...
kha.github.io
kha.github.io
en.wikipedia.org