refactor(tvix/eval): persistent, memory-sharing OrdMap for NixAttrs
This uses the `im::OrdMap` for `NixAttrs` to enable sharing of memory between different iterations of a map. This slightly speeds up eval, but not significantly. Future work might include benchmarking whether using a `HashMap` and only ordering in cases where order is actually required would help. This switches to a fork of `im` that fixes some bugs with its OrdMap implementation. Change-Id: I2f6a5ff471b6d508c1e8a98b13f889f49c0d9537 Reviewed-on: https://cl.tvl.fyi/c/depot/+/7676 Reviewed-by: sterni <sternenseemann@systemli.org> Tested-by: BuildkiteCI
This commit is contained in:
parent
610c44ec1e
commit
91465dc78e
10 changed files with 144 additions and 172 deletions
|
|
@ -1,7 +1,7 @@
|
|||
//! This module implements Nix lists.
|
||||
use std::ops::Index;
|
||||
|
||||
use im::{vector, Vector};
|
||||
use imbl::{vector, Vector};
|
||||
|
||||
use crate::errors::ErrorKind;
|
||||
use crate::vm::VM;
|
||||
|
|
@ -119,7 +119,7 @@ impl NixList {
|
|||
|
||||
impl IntoIterator for NixList {
|
||||
type Item = Value;
|
||||
type IntoIter = im::vector::ConsumingIter<Value>;
|
||||
type IntoIter = imbl::vector::ConsumingIter<Value>;
|
||||
|
||||
fn into_iter(self) -> Self::IntoIter {
|
||||
self.0.into_iter()
|
||||
|
|
@ -128,7 +128,7 @@ impl IntoIterator for NixList {
|
|||
|
||||
impl<'a> IntoIterator for &'a NixList {
|
||||
type Item = &'a Value;
|
||||
type IntoIter = im::vector::Iter<'a, Value>;
|
||||
type IntoIter = imbl::vector::Iter<'a, Value>;
|
||||
|
||||
fn into_iter(self) -> Self::IntoIter {
|
||||
self.0.iter()
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue