1fc9ba4885
Value now carries a shared_ptr<Bindings>, and all Bindings constructors return a unique_ptr<Bindings>. The test that wanted to compare two Bindings by putting them into Values has been modified to use the new Equal() method on Bindings (extracted from EvalState). Change-Id: I8dfb60e65fdabb717e3b3e5d56d5b3fc82f70883 Reviewed-on: https://cl.tvl.fyi/c/depot/+/1744 Tested-by: BuildkiteCI Reviewed-by: glittershark <grfn@gws.fyi> Reviewed-by: tazjin <mail@tazj.in>
76 lines
2.1 KiB
C++
76 lines
2.1 KiB
C++
// This file implements the underlying structure of Nix attribute sets.
|
|
#pragma once
|
|
|
|
#include <absl/container/btree_map.h>
|
|
|
|
#include "libexpr/nixexpr.hh"
|
|
#include "libexpr/symbol-table.hh"
|
|
#include "libutil/types.hh"
|
|
|
|
namespace nix { // TODO(tazjin): ::expr
|
|
|
|
class EvalState;
|
|
struct Value;
|
|
|
|
/* Map one attribute name to its value. */
|
|
struct Attr {
|
|
Symbol name;
|
|
Value* value; // TODO(tazjin): Who owns this?
|
|
Pos* pos; // TODO(tazjin): Who owns this?
|
|
Attr(Symbol name, Value* value, Pos* pos = &noPos)
|
|
: name(name), value(value), pos(pos){};
|
|
};
|
|
|
|
using AttributeMap = absl::btree_map<Symbol, Attr>;
|
|
|
|
class Bindings {
|
|
public:
|
|
using iterator = AttributeMap::iterator;
|
|
using const_iterator = AttributeMap::const_iterator;
|
|
|
|
// Allocate a new attribute set that is visible to the garbage
|
|
// collector.
|
|
static std::unique_ptr<Bindings> New(size_t capacity = 0);
|
|
|
|
// Create a new attribute set by merging two others. This is used to
|
|
// implement the `//` operator in Nix.
|
|
static std::unique_ptr<Bindings> Merge(const Bindings& lhs,
|
|
const Bindings& rhs);
|
|
|
|
// Return the number of contained elements.
|
|
size_t size() const;
|
|
|
|
// Is this attribute set empty?
|
|
bool empty();
|
|
|
|
// Insert, but do not replace, values in the attribute set.
|
|
void push_back(const Attr& attr);
|
|
|
|
// Are these two attribute sets deeply equal?
|
|
// Note: Does not special-case derivations. Use state.eqValues() to check
|
|
// attrsets that may be derivations.
|
|
bool Equal(const Bindings* other, EvalState& state) const;
|
|
|
|
// Look up a specific element of the attribute set.
|
|
iterator find(const Symbol& name);
|
|
|
|
iterator begin();
|
|
const_iterator cbegin() const;
|
|
iterator end();
|
|
const_iterator cend() const;
|
|
|
|
// Returns the elements of the attribute set as a vector, sorted
|
|
// lexicographically by keys.
|
|
//
|
|
// This is used primarily for builtins that have guaranteed
|
|
// ordering, such as `attrNames` or `attrValues`.
|
|
std::vector<const Attr*> SortedByKeys();
|
|
|
|
// oh no
|
|
friend class EvalState;
|
|
|
|
private:
|
|
AttributeMap attributes_;
|
|
};
|
|
|
|
} // namespace nix
|