Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jschwartzi
on June 30, 2015
|
parent
|
context
|
favorite
| on:
The Universal Data Structure
They even mark the difference to the degree that foo[1] is stored in a special "array part" of the table, while foo["1"] ends up in the hash part. Predictably, the array part uses less memory.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: