OlegDB OlegDB Blog Downloads FAQ Docs Community Content right_side_nav Grid Please send comments, corrections and angry letters to Quinlan Pfiffer. Overview What is OlegDB Installation Getting Started Cursor Iteration Prefix Matching Technical Internals Hash Table Splay Trees LZ4 Compression AOL File Values File Macros VERSION KEY_SIZE HASH_MALLOC PATH_LENGTH DB_NAME_SIZE DEVILS_SEED VALUES_FILENAME VALUES_DEFAULT_SIZE AOL_FILENAME_ALLOC AOL_FILENAME Type Definitions ol_val_array Enums ol_feature_flags ol_state_flags Structures ol_bucket ol_meta ol_database Functions ol_open ol_close ol_unjar ol_unjar_ds ol_jar ol_jar_ct ol_content_type ol_expiration ol_scoop ol_uptime ol_spoil ol_ht_bucket_max ol_prefix_match ol_exists ol_get_bucket ol_squish 0.1.0/ 0.1.1/ 0.1.2/ ¶ ¶ OlegDB is a concurrent, pretty fast K/V hashtable with an ...

~?~

~?~

~?~

Meta-X86 Evgeny Budilovsky's Blog Home About Posts RSS skip links for text browsers skip to main | skip to sidebar Home google_ad_section_start(name=default) CPU Cache Essentials This post came to my mind after watching the excellent presentation of Scott Meyers called "CPU Caches and Why You care". This post will try to summarize the ideas of the presentation so if you have some spare time you can just watch the presentation on video . To emphasize importance of cpu caches in our daily work we start with 2 examples: The first problem is a simple traversing of 2 dimensional array. The way we can do this in c-like language is by traversing the array row by row. Alternatively we can traverse it column by column. HTML generated using hilite.me uint64_t matrix[ROWS][COLUMNS]; uint64_t i,j; uint64_t ret; /* row by row */ for (...

Skip to content Sign up Sign in Explore Features Enterprise Blog This repository This repository /.select-menu-item All repositories /.select-menu-item Star 45 Fork 1 public google / cayley /.container /.repohead Code Issues 0 Pull Requests 0 Pulse Graphs Network HTTPS Subversion You can clone with HTTPS or Subversion . Download ZIP /.repository-sidebar An open-source graph database 6 commits 1 branch 0 releases 1 contributor Go 86.8% JavaScript 8.0% CSS 3.3% Python 1.1% Shell 0.8% Go JavaScript CSS Python Shell branch: master Switch branches/tags /.select-menu-header Branches Tags /.select-menu-tabs /.select-menu-filters master /.s...

Dear recruiters: While you read this, make sure that you remember that GitHub is not your C.V. and that these stats only provide a biased and one-sided view . This is just a toy. Don't take it too seriously! OK. I promise! The Open Source Report Card Powered by Fusion Quinlan P. Quinlan P. is an epic low-level hacker (one of the 13% most active C users) who loves pushing code . Quinlan is a fulltime hacker who works best in the morning (around 11 am) . Quinlan's developer personality is very similar to Pavol Rusnak 's but Pavol spends more of their time creating new repositories and branches. There is also an uncanny similarity between Quinlan's activity stream and those of Joel Leclerc , lingulist , buganini , ...

User's Guide PDF Top Programming Examples User's Guide Version 6.1 Expand All Contract All Chapters Records Top of chapter Records vs Tuples Defining a Record Creating a Record Accessing a Record Field Updating a Record Type Testing Pattern Matching Nested Records Example Funs Top of chapter Example 1 - map Example 2 - foreach The Syntax of Funs Variable Bindings Within a Fun Funs and the Module Lists Funs Which Return Funs List Comprehensions Top of chapter Simple Examples Quick Sort Permutations Pythagorean Triplets Simplifications with List Comprehensions Variable Bindings in List Comprehensions Bit Syntax Top of chapter Introduction A Lexical Note Segments Defaults Constructing Binaries and Bitstrings Matching Binaries Appending to a Binary 4.1  Introduction In Erlang a Bin is used for constructing binaries and matching binary patterns. A Bin is written...

Hey bro. Need some encouragement while you're absolutely slaying right now? Get Some Tweet This page is made possible by Natty Light, tight polos, and Old Spice Swagger. ...

OlegDB OlegDB Blog Downloads FAQ Docs Community Content right_side_nav Grid 2014-06-25 by Quinlan Pfiffer Comments This is a pretty heavy release, in which we introduce prefix matching , key/cursor iteration and a new mmap() based data architecture which you can read about here. Thanks to our contributors, Alessandro Gatti and Martijn Gerkes. Using OlegDB? Want help? Scared? Check out our IRC channel on freenode: #olegdb. Prefix matching via HTTP Cursor iteration via HTTP Values are now mmap() 'd in from a values file, which means they don't quite have to be resident in-memory for use. Erlang frontend now periodically calls fflush() and fsync() to ensure data is written to disk. Erlang frontend now periodically compacts and cleanses the AOL file More tests Various bugfixes $ git diff --stat v.0.1.1 HEAD ... 76 files changed, 5743 insertions(+), 6052 ...

~?~

<![endif] Twitter Search query Search Remove Verified account @ Suggested users Verified account @ Verified account @ Language: English Bahasa Indonesia Bahasa Melayu Dansk Deutsch EnglishUK Español Filipino français Italiano Magyar Nederlands Norsk Polski Português Suomi Svenska Türkçe Русский עִבְרִית اردو العربية فارسی हिन्दी ภาษาไทย 한국어 日本語 简体中文 繁體中文 Have an account? Sign in New to Twitter? Join Today » Sign In Username or email Password Sign in Remember me Forgot password? Already using Twitter via text message? Follow Following Unfollow Blocked Unblock Pending Cancel ◇◇ ‏ @ chipstian 3h At the core of the human condition is a Man in a Tap-Out Shirt eating Ribs and Explaining how Capitalism ...

Google Tag Manager End Google Tag Manager see if snrd cookie was set by trigger page Edition: U.S. Africa Arabic Argentina Brazil Canada China France Germany India Italy Japan Latin America Mexico Russia Spain United Kingdom Home Business Business Home Economy Legal Deals Business Video Aerospace & Defense Financial Institutions Autos Reuters Summits Small Business Markets Markets Home U.S. Markets European Markets Asian Markets Global Market Data Indices Stocks Bonds Currencies Comm odities Futures Funds peHUB Earnings Dividends World World Home U.S. Special Reports Reuters Investigates Euro Zone Middle East China Japan Mexico Brazil Africa Russia India Insight World Video Politics Politics Home Supreme Court Politics Video Tech Technology Home MediaFile Science Tech Video Top 100 Global Innovators Opinion Opin...

This page contains technical information about Symas's LMDB database library. LMDB is an ultra-fast, ultra-compact key-value embedded data store developed by Symas for the OpenLDAP Project. It uses memory-mapped files, so it has the read performance of a pure in-memory database while still offering the persistence of standard disk-based databases, and is only limited to the size of the virtual address space, (it is not limited to the size of physical RAM). Note: LMDB was originally called MDB, but was renamed to avoid confusion with other software associated with the name MDB Quick Overview Feature Comparison Documentation Support Publications Benchmarks Other Projects Other Languages LMDB is a tiny database with some great capabilities: Ordered-map interface (keys are always sorted, supports range lookups) Fully transactional, full ACID semantics with MVCC. Reader/wri...

Australia 1300 883 979 | USA (888) 250 8847 client services sign in web mail pay account account cancellation domain administration register your domain transfer your domain renew your domain manage your domains recover domain password whois service create account /span_12 /search-box /container /search /search-outer /span_3 managed hosting shared web hosting custom hosting solutions managed services anchor complete anchor enterprise anchor staging servers dedicated servers linux vps (virtual servers) cloud servers (IaaS) services hosting infrastructure hybrid cloud cloud storage (object) MySQL Database as a Service performance monitoring load testing service content delivery network network services professional services managed backups pci compliant hosting SSL certificates domain name registration support supported technologi...

Toggle navigation Home M1 Garand Assemble an M1 Garand Field Strip an M1 Garand The .30-06 Cartridge History of the M1 Garand M1 Garand Troubleshooting The M1 Garand on Parade M1 Garand & M14 Spreadsheets M1 Garand Gas Pressure Safely Load the M1 Garand Assemble a Garand Introduction — Get Started! Finding Manuals Getting the Parts Finish Reaming Determining the Vintage and Source of Parts Wood Restoration Final Assembly Ammunition Barrel Break-In Building a Custom Gun Case Guns Mosin-Nagant The Mosin-Nagant "Three Line" Field Strip a Mosin-Nagant Rifle AK-47 Build an AK-47 Field-Strip an AK-47 SKS Field-Strip an SKS The SKS Rifle on Parade Ammo .30-06 Springfield 7.62x54mmR 7.62x25mm Tokarev Cleaning and Maintenance How to Remove Bluing from Steel How to Parkize Steel Gun Cleaning Tools and Supplies Gunsmith Horror Stories ...

CentralNotice Vasa (ship) From Wikipedia, the free encyclopedia Jump to: navigation , search Vasa's port bow Career (Sweden) Laid down: 1626 Launched: 1627 Fate: Sank in 1628, salvaged in 1961, currently a museum ship General characteristics Tonnage: 1210 tonnes displacement Length: Sparred Length: 69 m (226 ft) Between perpendiculars 47.5 m (155.8 ft) Beam: 11.7 m (38 ft) Height: 52.5 m (172 ft) Draft: 4.8 m (16 ft) Propulsion: Sails, 1,275 square m (13,720 sq ft) Crew: 145 sailors, 300 soldiers Armament: 64 guns, including: 24-pounders—48 3-pounders—8 1-pounders—2 howitzers —6 Notes: Source for dimensions & Tonnage: "Vasa in Numbers, Vasa Museum Vasa (or Wasa ) [ 1 ] is a Swedish warship built 1626-1628. The ship foundered and sank after sailing about 1,300 m (1,400 yd) into her maiden voyage on 10 August...