{"shas":[["8f8f6f058d0e08534d38feb63c29f1586ed85790","3bc6f2208b90542717470de5278f48ae0e983c97@spencertipping.com","More benchmarks, including <= for integers and strings. It may be more feasible to implement a SpiderMonkey hashtable than to use their data structures.","Spencer Tipping"]],"repo":"spencertipping/caterwaul","actor":"spencertipping","ref":"refs/heads/0.7-macroexpander-optimization","size":1,"head":"8f8f6f058d0e08534d38feb63c29f1586ed85790","actor_gravatar":"16ee085631d5a17247a7b4cb46720632","push_id":27876973}