deep-hash-struct 0.1.2 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: d75b9bdee86a1e833867d5f5c09a39af09dbe262
-  data.tar.gz: a9b9534aeb425c24a0cabc04f03ce417876c344f
+  metadata.gz: e9756a09b00c5be33e8b9196673a4439b3da918a
+  data.tar.gz: 86660d00023b2713ee316c11f71ef4e3df88fcff
 SHA512:
-  metadata.gz: 5d3676edb4c79c1dfcd232c9c550b00afd1acba038c39b389f719239c2948fb843c34be45e70ffb0e7d1389c01aa81c96026e158cd18668362955e48702d46bf
-  data.tar.gz: c882419641decdce45a9bbb6a6ae139ef8ca76730785b8c1b449e02da0b78f56a21a403dc36f867635e54da9257ad5b65425161a2f0967716b4ba1078d767ae9
+  metadata.gz: 2e1b5ad03894c35f73a2efa5887ebad6b072375cec42c63cbb7e4ad3d739707a8ba0bc4cb4610d4035069cd8e0f399db4830e7c37a282ecf5a79cf8e4f313939
+  data.tar.gz: 1ddc24f2c752217c34a865ee3ff5440d7542e273b94bfd40e06ce2a7973b89f664005a785c5075ce5d43fe3f7412a0646121841031e5dae50d474a100df5a597

data/LICENSE.txt

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2017 TODO: Write your name
+Copyright (c) 2017 by etiopiamokamame
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

data/README.md

@@ -19,8 +19,10 @@ Or install it yourself as:
 
     $ gem install deep-hash-struct
 
-## Usage
+## Wrapper Class Usage
+The basic usage is the same as Hash Class.
 
+### Basic
 ```ruby
 wrapper         = Deep::Hash::Struct::Wrapper.new
 wrapper.a       = 1
@@ -30,6 +32,850 @@ wrapper[:c].b   = 4
 wrapper.to_h # => {:a=>1, :b=>{:a=>2}, :c=>{:a=>3, :b=>4}}
 ```
 
+### Block
+```ruby
+wrapper.a do
+  1 + 1
+end
+wrapper.a # => 2
+
+wrapper.b do
+  { c: 3 }
+end
+wrapper.b.c # => 3
+```
+
+### #dig
+```ruby
+wrapper.a.b = { c: 1, d: [1, 2, [3, 4, 5]] }
+wrapper.dig(:a, :b, :c)       # => 1
+wrapper.dig(:a, :b, :d, 2, 0) # => 3
+wrapper.dig(:a, :c).blank?    # => true
+```
+
+### #merge
+#### Deep::Hash::Struct::Wrapper Class
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.c.b = 4
+wrapper.c.c = 5
+
+other       = wrapper.class.new
+other.a     = 6
+other.b     = 7
+other.c.a   = 8
+
+wrapper.merge(other).to_h # => {:a=>6, :b=>7, :c=>{:a=>8}}
+```
+
+#### Hash Class
+```ruby
+wrapper.a     = 1
+wrapper.b     = 2
+wrapper.c.a   = 3
+wrapper.c.b   = 4
+wrapper.c.c   = 5
+
+other         = {}
+other[:a]     = 6
+other[:b]     = 7
+other[:c]     = {}
+other[:c][:a] = 8
+
+wrapper.merge(other).to_h #=> {:a=>6, :b=>7, :c=>{:a=>8}}
+```
+
+### #merge! #update
+bang merge method
+
+### #deep_merge
+#### Deep::Hash::Struct::Wrapper Class
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.c.b = 4
+wrapper.c.c = 5
+
+other       = wrapper.class.new
+other.a     = 6
+other.b     = 7
+other.c.a   = 8
+
+wrapper.deep_merge(other).to_h # => {:a=>6, :b=>7, :c=>{:a=>8, :b=>4, :c=>5}}
+```
+
+#### Hash Class
+```ruby
+wrapper.a     = 1
+wrapper.b     = 2
+wrapper.c.a   = 3
+wrapper.c.b   = 4
+wrapper.c.c   = 5
+
+other         = {}
+other[:a]     = 6
+other[:b]     = 7
+other[:c]     = {}
+other[:c][:a] = 8
+
+wrapper.deep_merge(other).to_h # => {:a=>6, :b=>7, :c=>{:a=>8, :b=>4, :c=>5}}
+```
+
+### #deep_merge!
+bang deep_merge method
+
+### #reverse_merge
+#### Deep::Hash::Struct::Wrapper Class
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.c.b = 4
+wrapper.c.c = 5
+
+other       = wrapper.class.new
+other.a     = 6
+other.b     = 7
+other.c.a   = 8
+other.d.a   = 9
+
+wrapper.reverse_merge(other).to_h # => {:a=>1, :b=>2, :c=>{:a=>3, :b=>4, :c=>5}, :d=>{:a=>9}}
+```
+
+#### Hash Class
+```ruby
+wrapper.a     = 1
+wrapper.b     = 2
+wrapper.c.a   = 3
+wrapper.c.b   = 4
+wrapper.c.c   = 5
+
+other         = {}
+other[:a]     = 6
+other[:b]     = 7
+other[:c]     = {}
+other[:c][:a] = 8
+other[:d]     = {}
+other[:d][:a] = 9
+
+wrapper.reverse_merge(other).to_h # => {:a=>1, :b=>2, :c=>{:a=>3, :b=>4, :c=>5}, :d=>{:a=>9}}
+```
+
+### #reverse_merge!
+bang reverse_merge method
+
+### #reverse_deep_merge
+#### Deep::Hash::Struct::Wrapper Class
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.c.b = 4
+wrapper.c.c = 5
+
+other       = wrapper.class.new
+other.a     = 6
+other.b     = 7
+other.c.a   = 8
+other.c.d   = 9
+
+wrapper.reverse_deep_merge(other).to_h # => {:a=>1, :b=>2, :c=>{:a=>3, :b=>4, :c=>5, :d=>9}}
+```
+
+#### Hash Class
+```ruby
+wrapper.a     = 1
+wrapper.b     = 2
+wrapper.c.a   = 3
+wrapper.c.b   = 4
+wrapper.c.c   = 5
+
+other         = {}
+other[:a]     = 6
+other[:b]     = 7
+other[:c]     = {}
+other[:c][:a] = 8
+other[:c][:d] = 9
+
+wrapper.reverse_deep_merge(other).to_h # => {:a=>1, :b=>2, :c=>{:a=>3, :b=>4, :c=>5, :d=>9}}
+```
+
+### #reverse_deep_merge!
+bang reverse_deep_merge method
+
+### #fetch
+```ruby
+wrapper.a = 1
+wrapper.fetch(:a, :not_found)              # => 1
+wrapper.fetch(:a) { |k| "#{k} not found" } # => 1
+wrapper.fetch(:b)                          # => nil
+wrapper.fetch(:b, :not_found)              # => :not_found
+wrapper.fetch(:b) { |k| "#{k} not found" } # => "b not found"
+```
+
+### #default
+```ruby
+wrapper.a.default = 0
+wrapper.b.default = []
+wrapper.a.a # => 0
+wrapper.b.a # => []
+```
+
+### #map_key
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.map_key { |k| [k] } # => [[:a], [:b], [:c]]
+```
+
+### #map_value
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.map_value { |k| [k] } # => [[1], [2], [3]]
+```
+
+### #fetch_values
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.fetch_values(:a, :b)                  # => [1, 2]
+wrapper.fetch_values(:a, :c)                  # => KeyError: key not found: :c
+wrapper.fetch_values(:a, :c) { |k| k.upcase } # => [1, :C]
+```
+
+### #values_at
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.values_at(:a, :b, :d) # => [1, 2, nil]
+```
+
+### #invert
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.invert # => {1=>:a, 2=>:b, 3=>:c}
+```
+
+### #delete
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.delete(:a) # => 1
+wrapper.keys       # => [:b, :c]
+```
+
+### #delete_if
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.delete_if{ |k, v| k == :a || v == 2 }.to_h # => {:c=>3}
+wrapper.keys                                       # => [:c]
+```
+
+### #reject
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.reject { |k, v| v > 2 }.to_h # => {:a=>1, :b=>2}
+```
+
+### #reject!
+bang reject method
+
+### #clear
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.clear
+wrapper.to_h # => {}
+```
+
+### #flatten
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.c.b = 4
+wrapper.c.c = 5
+wrapper.flatten # => [:a, 1, :b, 2, :c, {:a=>3, :b=>4, :c=>5}]
+```
+
+### #has_key? #include?
+```ruby
+wrapper.a = 1
+wrapper.has_key?(:a) # => true
+wrapper.has_key?(:b) # => false
+```
+
+### #has_keys?
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.has_keys?(:a)     # => true
+wrapper.has_keys?(:c, :a) # => true
+wrapper.has_keys?(:d)     # => false
+wrapper.has_keys?(:c, :b) # => false
+wrapper.has_keys?(:d, :a) # => false
+```
+
+### #exclude?
+```ruby
+wrapper.a = 1
+wrapper.exclude?(:a) # => false
+wrapper.exclude?(:d) # => true
+```
+
+### #sort
+```ruby
+wrapper.c = 1
+wrapper.b = 2
+wrapper.a = 3
+wrapper.sort # => [[:a, 3], [:b, 2], [:c, 1]]
+```
+
+### #shift
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+wrapper.shift # => [:a, 1]
+wrapper.to_h  # => {:b=>2, :c=>3}
+```
+
+### #compact
+```ruby
+wrapper.a   = 1
+wrapper.b   = nil
+wrapper.c.a = 2
+wrapper.c.b = ""
+wrapper.d.a = nil
+
+wrapper.keys           # => [:a, :b, :c, :d]
+wrapper.c.keys         # => [:a, :b]
+wrapper.compact.keys   # => [:a, :c, :d]
+wrapper.compact.c.keys # => [:a, :b]
+wrapper.keys           # => [:a, :b, :c, :d]
+wrapper.c.keys         # => [:a, :b]
+```
+
+### #compact!
+bang compact method
+
+### #deep_compact
+```ruby
+wrapper.a   = 1
+wrapper.b   = nil
+wrapper.c.a = 2
+wrapper.c.b = ""
+wrapper.d.a = nil
+
+wrapper.keys                # => [:a, :b, :c, :d]
+wrapper.c.keys              # => [:a, :b]
+wrapper.deep_compact.keys   # => [:a, :c]
+wrapper.deep_compact.c.keys # => [:a, :b]
+wrapper.keys                # => [:a, :b, :c, :d]
+wrapper.c.keys              # => [:a, :b]
+```
+
+### #deep_compact!
+bang deep_compact method
+
+### #slice
+```ruby
+wrapper.a = 1
+wrapper.b = 2
+wrapper.c = 3
+
+wrapper.slice(:a, :b).to_h # => {:a=>1, :b=>2}
+wrapper.slice(:b, :c).to_h # => {:b=>2, :c=>3}
+wrapper.slice(:c, :d).to_h # => {:c=>3}
+wrapper.to_h               # => {:a=>1, :b=>2, :c=>3}
+```
+
+### #slice!
+bang slice method
+
+### #to_hash #to_h
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+
+wrapper.to_hash # => {:a=>1, :b=>2, :c=>{:a=>3}}
+```
+
+### #to_json
+```ruby
+wrapper.a   = 1
+wrapper.b   = 2
+wrapper.c.a = 3
+wrapper.to_json # => "{\"a\":1,\"b\":2,\"c\":{\"a\":3}}"
+```
+
+### #max_stages
+```ruby
+wrapper.a     = 1
+wrapper.b.a   = 2
+wrapper.b.b   = 3
+wrapper.c.a.b = 4
+wrapper.c.a.c = 5
+wrapper.c.a.d = 6
+
+wrapper.max_stages   # => 3
+wrapper.b.max_stages # => 1
+wrapper.c.max_stages # => 2
+```
+
+### #min_stages
+```ruby
+wrapper.a     = 1
+wrapper.b.a   = 2
+wrapper.b.b   = 3
+wrapper.c.a.b = 4
+wrapper.c.a.c = 5
+wrapper.c.a.d = 6
+
+wrapper.min_stages   # => 1
+wrapper.b.min_stages # => 1
+wrapper.c.min_stages # => 2
+```
+
+## Dashboard Class Usage
+It is used like a two-dimensional array representing a table.
+
+### Add matrix table
+```ruby
+dashboard = Deep::Hash::Struct::Dashboard.new
+dashboard.add_table(matrix: true, side_header: "sh") do |t|
+  t.add_header do |h|
+    h.a   = "h1"
+    h[:b] = "h2"
+    h.add :c, "h3"
+  end
+
+  t.add_side do |s|
+    s.a   = "s1"
+    s[:b] = "s2"
+    s.add :c, "s3"
+  end
+
+  t.add_body do |row|
+    row.a.a     = 11
+    row.a[:b]   = 12
+    row[:a][:c] = 13
+    row[:b].a   = 14
+    row.b.add :b, 15
+    row.b.c     = 16
+    row.c.a     = 17
+    row.c.b     = 18
+    row.c.c     = 19
+  end
+end
+
+dashboard.tables # => [#<Table matrix=true>]
+
+table = "<table>\n"
+dashboard.tables[0].each do |rows|
+  table << "  <tr>\n"
+  rows.each do |row|
+    if row.header? || row.side?
+      table << "    <th>#{row.name}</th>\n"
+    else
+      table << "    <td>#{row.value}</td>\n"
+    end
+  end
+  table << "  </tr>\n"
+end
+table << "</table>\n"
+
+puts table
+# => <table>
+# =>   <tr>
+# =>     <th>sh</th>
+# =>     <th>h1</th>
+# =>     <th>h2</th>
+# =>     <th>h3</th>
+# =>   </tr>
+# =>   <tr>
+# =>     <th>s1</th>
+# =>     <td>11</td>
+# =>     <td>14</td>
+# =>     <td>17</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <th>s2</th>
+# =>     <td>12</td>
+# =>     <td>15</td>
+# =>     <td>18</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <th>s3</th>
+# =>     <td>13</td>
+# =>     <td>16</td>
+# =>     <td>19</td>
+# =>   </tr>
+# => </table>
+```
+
+### Add segment table
+```ruby
+dashboard = Deep::Hash::Struct::Dashboard.new
+dashboard.add_table do |t|
+  t.add_header do |h|
+    h.a   = "h1"
+    h[:b] = "h2"
+    h.add :c, "h3"
+  end
+
+  t.add_body do |row|
+    row.a = 11
+    row.b = 12
+    row.c = 13
+  end
+
+  t.add_body do |row|
+    row.c = 16
+    row.b = 15
+    row.a = 14
+  end
+
+  t.add_body do |row|
+    row.c = 19
+    row.a = 17
+    row.b = 18
+  end
+end
+
+dashboard.tables # => [#<Table matrix=false>]
+
+table = "<table>\n"
+dashboard.tables[0].each do |rows|
+  table << "  <tr>\n"
+  rows.each do |row|
+    if row.header?
+      table << "    <th>#{row.name}</th>\n"
+    else
+      table << "    <td>#{row.value}</td>\n"
+    end
+  end
+  table << "  </tr>\n"
+end
+table << "</table>\n"
+
+puts table
+# => <table>
+# =>   <tr>
+# =>     <th>h1</th>
+# =>     <th>h2</th>
+# =>     <th>h3</th>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>11</td>
+# =>     <td>12</td>
+# =>     <td>13</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>14</td>
+# =>     <td>15</td>
+# =>     <td>16</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>17</td>
+# =>     <td>18</td>
+# =>     <td>19</td>
+# =>   </tr>
+# => </table>
+```
+
+### Unset value to matrix table
+```ruby
+dashboard = Deep::Hash::Struct::Dashboard.new
+dashboard.add_table(matrix: true) do |t|
+  t.add_header do |h|
+    h.a   = "h1"
+    h[:b] = "h2"
+    h.add :c, "h3"
+  end
+
+  t.add_side do |s|
+    s.a   = "s1"
+    s[:b] = "s2"
+    s.add :c, "s3"
+  end
+
+  t.add_body do |row|
+    row.a.b = 2
+    row.a.c = 3
+    row.b.a = 4
+    row.b.c = 6
+    row.c.a = 7
+    row.c.b = 8
+  end
+end
+
+dashboard.tables # => [#<Table matrix=true>]
+
+table = "<table>\n"
+dashboard.tables[0].each do |rows|
+  table << "  <tr>\n"
+  rows.each do |row|
+    if row.header? || row.side?
+      table << "    <th>#{row.name}</th>\n"
+    else
+      table << "    <td>#{row.value}</td>\n"
+    end
+  end
+  table << "  </tr>\n"
+end
+table << "</table>\n"
+
+puts table
+# => <table>
+# =>  <tr>
+# =>    <th></th>
+# =>    <th>h1</th>
+# =>    <th>h2</th>
+# =>    <th>h3</th>
+# =>  </tr>
+# =>  <tr>
+# =>    <th>s1</th>
+# =>    <td></td>
+# =>    <td>4</td>
+# =>    <td>7</td>
+# =>  </tr>
+# =>  <tr>
+# =>    <th>s2</th>
+# =>    <td>2</td>
+# =>    <td></td>
+# =>    <td>8</td>
+# =>  </tr>
+# =>  <tr>
+# =>    <th>s3</th>
+# =>    <td>3</td>
+# =>    <td>6</td>
+# =>    <td></td>
+# =>  </tr>
+# =></table>
+```
+### Unset value to segment table
+```ruby
+dashboard = Deep::Hash::Struct::Dashboard.new
+dashboard.add_table do |t|
+  t.add_header do |h|
+    h.a = "h1"
+    h.b = "h2"
+    h.c = "h3"
+  end
+
+  t.add_body do |row|
+    row.b = 2
+    row.c = 3
+  end
+
+  t.add_body do |row|
+    row.a = 4
+    row.c = 6
+  end
+
+  t.add_body do |row|
+    row.a = 7
+    row.b = 8
+  end
+end
+
+dashboard.tables # => [#<Table matrix=false>]
+
+table = "<table>\n"
+dashboard.tables[0].each do |rows|
+  table << "  <tr>\n"
+  rows.each do |row|
+    if row.header?
+      table << "    <th>#{row.name}</th>\n"
+    else
+      table << "    <td>#{row.value}</td>\n"
+    end
+  end
+  table << "  </tr>\n"
+end
+table << "</table>\n"
+
+puts table
+# => <table>
+# =>   <tr>
+# =>     <th>h1</th>
+# =>     <th>h2</th>
+# =>     <th>h3</th>
+# =>   </tr>
+# =>   <tr>
+# =>     <td></td>
+# =>     <td>2</td>
+# =>     <td>3</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>4</td>
+# =>     <td></td>
+# =>     <td>6</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>7</td>
+# =>     <td>8</td>
+# =>     <td></td>
+# =>   </tr>
+# => </table>
+```
+
+### Default to matrix table
+```ruby
+dashboard = Deep::Hash::Struct::Dashboard.new
+dashboard.add_table(matrix: true, default: 0) do |t|
+  t.add_header do |h|
+    h.a = "h1"
+    h.b = "h2"
+    h.c = "h3"
+  end
+
+  t.add_side do |s|
+    s.a = "s1"
+    s.b = "s2"
+    s.c = "s3"
+  end
+
+  t.add_body do |row|
+    row.a.b = 2
+    row.a.c = 3
+    row.b.a = 4
+    row.b.c = 6
+    row.c.a = 7
+    row.c.b = 8
+  end
+end
+
+dashboard.tables # => [#<Table matrix=true>]
+
+table = "<table>\n"
+dashboard.tables[0].each do |rows|
+  table << "  <tr>\n"
+  rows.each do |row|
+    if row.header? || row.side?
+      table << "    <th>#{row.name}</th>\n"
+    else
+      table << "    <td>#{row.value}</td>\n"
+    end
+  end
+  table << "  </tr>\n"
+end
+table << "</table>\n"
+
+puts table
+# => <table>
+# =>   <tr>
+# =>     <th></th>
+# =>     <th>h1</th>
+# =>     <th>h2</th>
+# =>     <th>h3</th>
+# =>   </tr>
+# =>   <tr>
+# =>     <th>s1</th>
+# =>     <td>0</td>
+# =>     <td>4</td>
+# =>     <td>7</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <th>s2</th>
+# =>     <td>2</td>
+# =>     <td>0</td>
+# =>     <td>8</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <th>s3</th>
+# =>     <td>3</td>
+# =>     <td>6</td>
+# =>     <td>0</td>
+# =>   </tr>
+# => </table>
+```
+
+### Default to segment table
+```ruby
+dashboard = Deep::Hash::Struct::Dashboard.new
+dashboard.add_table(default: 0) do |t|
+  t.add_header do |h|
+    h.a = "h1"
+    h.b = "h2"
+    h.c = "h3"
+  end
+
+  t.add_body do |row|
+    row.b = 2
+    row.c = 3
+  end
+
+  t.add_body do |row|
+    row.a = 4
+    row.c = 6
+  end
+
+  t.add_body do |row|
+    row.a = 7
+    row.b = 8
+  end
+end
+
+dashboard.tables # => [#<Table matrix=false>]
+
+table = "<table>\n"
+dashboard.tables[0].each do |rows|
+  table << "  <tr>\n"
+  rows.each do |row|
+    if row.header?
+      table << "    <th>#{row.name}</th>\n"
+    else
+      table << "    <td>#{row.value}</td>\n"
+    end
+  end
+  table << "  </tr>\n"
+end
+table << "</table>\n"
+
+puts table
+# => <table>
+# =>   <tr>
+# =>     <th>h1</th>
+# =>     <th>h2</th>
+# =>     <th>h3</th>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>0</td>
+# =>     <td>2</td>
+# =>     <td>3</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>4</td>
+# =>     <td>0</td>
+# =>     <td>6</td>
+# =>   </tr>
+# =>   <tr>
+# =>     <td>7</td>
+# =>     <td>8</td>
+# =>     <td>0</td>
+# =>   </tr>
+# => </table>
+```
+
 ## Contributing
 
 Bug reports and pull requests are welcome on GitHub at https://github.com/etiopiamokamame/deep-hash-struct. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.