about summary refs log tree commit diff
path: root/third_party/nix/src/libexpr/attr-set.hh
blob: 37e6d5e1ca8f2220d2e60c9ed6e3425f128a9cb6 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
// This file implements the underlying structure of Nix attribute sets.
#pragma once

#include <absl/container/btree_map.h>
#include <gc/gc_allocator.h>

#include "nixexpr.hh"
#include "symbol-table.hh"
#include "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){};
  Attr() : pos(&noPos){};
  bool operator<(const Attr& other) const { return name < other.name; }
};

// TODO: remove this, it only exists briefly while I get rid of the
// current Attr struct
inline bool operator==(const Attr& lhs, const Attr& rhs) {
  return lhs.name == rhs.name;
}

// Convenience alias for the backing map, with the garbage-collecting
// allocator explicitly specified.
using AttributeMap =
    absl::btree_map<Symbol, Attr, std::less<Symbol>,
                    gc_allocator<std::pair<const Symbol, Attr>>>;

class Bindings {
 public:
  typedef AttributeMap::iterator iterator;

  // Allocate a new attribute set that is visible to the garbage
  // collector.
  static Bindings* NewGC();

  // Return the number of contained elements.
  size_t size();

  // Is this attribute set empty?
  bool empty();

  // Insert, but do not replace, values in the attribute set.
  void push_back(const Attr& attr);

  // Insert a value, or replace an existing one.
  void insert_or_assign(const Attr& attr);

  // Look up a specific element of the attribute set.
  iterator find(const Symbol& name);

  // TODO
  iterator begin();
  iterator end();

  // Merge values from other into the current attribute
  void merge(const Bindings& other);

  // ???
  [[deprecated]] size_t capacity();

  // oh no
  // Attr& operator[](size_t pos); //  { return attrs[pos]; }

  // TODO: can callers just iterate?
  [[deprecated]] std::vector<const Attr*> lexicographicOrder();

  // oh no
  friend class EvalState;

 private:
  AttributeMap attributes_;
};

}  // namespace nix