You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I belive we would get better performance by alwayes keeping the keys of skemas sorted in lex order. The skema could be improved by not having a vector of name type pair but embedding it into the struct:
The type of an item can be extracted from the skema, so we should be able to do everything we do now, however it should be somewhat faster, but also somewhat more cumbersom.
The text was updated successfully, but these errors were encountered:
I belive we would get better performance by alwayes keeping the keys of skemas sorted in lex order. The skema could be improved by not having a vector of name type pair but embedding it into the struct:
The tuple class could be improved by not using a vector of any values. Instead we could
make a tuple like
The type of an item can be extracted from the skema, so we should be able to do everything we do now, however it should be somewhat faster, but also somewhat more cumbersom.
The text was updated successfully, but these errors were encountered: