diff options
| author | Kartik K. Agaram <vc@akkartik.com> | 2016-07-22 14:00:12 -0700 |
|---|---|---|
| committer | Kartik K. Agaram <vc@akkartik.com> | 2016-07-22 14:00:48 -0700 |
| commit | be6e752626711047064fe176843972be5eaa2add (patch) | |
| tree | 81048e7ccad554ece3d69806366e6c9ea0d9d28b /036refcount.cc | |
| parent | 0c1ae52feb9ee7cc1858237d0c17da1cf863c2cc (diff) | |
| download | mu-be6e752626711047064fe176843972be5eaa2add.tar.gz | |
3124
Reorganize data structure for lambda cells. Create our first real unit test for the compiler in the process.
Diffstat (limited to '036refcount.cc')
| -rw-r--r-- | 036refcount.cc | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/036refcount.cc b/036refcount.cc index 02af0ab9..e1954cc8 100644 --- a/036refcount.cc +++ b/036refcount.cc @@ -316,7 +316,6 @@ void compute_container_address_offsets(type_tree* type) { void append_addresses(int base_offset, const type_tree* type, map<set<tag_condition_info>, set<address_element_info> >& out, const set<tag_condition_info>& key) { const type_info& info = get(Type, type->value); if (type->name == "address") { - assert(type->right && type->right->name != "array"); // array types can't be handled without a full reagent and its value get_or_insert(out, key).insert(address_element_info(base_offset, new type_tree(*type->right))); return; } |