-
```
Currently, Serializer.create(Kryo kryo, Input input, Class type) method
often calls kryo.newInstance(type).
This newInstance calls results in at least one hash table lookup, because it
needs to …
-
```
Currently, Serializer.create(Kryo kryo, Input input, Class type) method
often calls kryo.newInstance(type).
This newInstance calls results in at least one hash table lookup, because it
needs to …
-
```
Currently, Serializer.create(Kryo kryo, Input input, Class type) method
often calls kryo.newInstance(type).
This newInstance calls results in at least one hash table lookup, because it
needs to …
-
```
Currently, Serializer.create(Kryo kryo, Input input, Class type) method
often calls kryo.newInstance(type).
This newInstance calls results in at least one hash table lookup, because it
needs to …
-
`alist` is being used to store `function` / `operator`. We could use a `hash-table`. Faster lookups?
+ Related file: `haskell-doc.el`
-
binary search on a sorted array might be better in the interim - smaller code and still fast lookups
-
Thinking about https://github.com/golang/go/issues/67161, I wanted to know whether the the new API should include Hasher. It complicates the API because it turns reads (lookups in typeutil.Map) into w…
-
For lookups with context for FAST, implement related LDPath in DAVE and QA:
https://docs.google.com/spreadsheets/d/1rPvEoP9iYNkxJ0eWC8gXe3ci7e6mhW0da59xkGhadi0/edit#gid=1966574591
-
Instead of mangling Name nodes to become context lookups, we can promote values out of the context into the local scope for mind bogglingly fast lookups.
We'd have to be careful of any nested scopes,…
-
I think at some point @jimi-c had mentioned something about lookups being potentially faster/a workaround to full module invocations, so doing something using `lookup('k8s'...` to get info instead of …