| commit | d882ea388a1bc5e24c1d1d2e3b3dbf5e169adeaa | |
| author | Jay Krell <jay.krell@cornell.edu> | |
| Wed, 17 Apr 2019 09:06:28 +0000 (17 02:06 -0700) | ||
| committer | monojenkins <jo.shields+jenkins@xamarin.com> | |
| Wed, 17 Apr 2019 09:06:28 +0000 (17 05:06 -0400) | ||
| tree | c991f558f1d2f8fb8f726901fd37bd9ad16ee99f | treesnapshot (tar.gz zip) |
| parent | cd5e14a3ccaa76e6ba6c58b26823863a2d0a0854 | commitdiff |
Replace two element hash table with two element array and cheap linear search. (#14049)
Replace two element hash table with two element array and cheap linear search.
Maybe I misunderstand the code?
Or significant expansion is expected?
Replace two element hash table with two element array and cheap linear search.
Maybe I misunderstand the code?
Or significant expansion is expected?
| mono/mini/mini-generic-sharing.c | diffblobblamehistory |