Added README detail on what NDBL does not provide
Getty Ritter
11 years ago
| 136 | 136 | user=abu-al-walid |
| 137 | 137 | nicename="H-G Remote Server" |
| 138 | 138 | |
| 139 | NDBL does not provide arbitrarily-nested hierarchical strutures, | |
| 140 | a list type, a numeric type, a boolean type, or other niceties. This does not | |
| 141 | prevent the programmer from interpreting a value as numeric or boolean, | |
| 142 | or from using groups in an ad-hoc way to represent hierarchical data—it | |
| 143 | merely means that NDBL does not understand those as primitives, nor does it | |
| 144 | provide an interface in its API for understanding or manipulating them. | |
| 145 | For example, a tree structure could hypothetically be represented | |
| 146 | b a series of named nodes | |
| 147 | ||
| 148 | name=A parent=root | |
| 149 | name=B parent=A | |
| 150 | name=C parent=A | |
| 151 | name=D parent=C | |
| 152 | ||
| 153 | but in the event that such structures arise, it would be better to switch from | |
| 154 | NDBL to a proper data storage format. | |
| 155 | ||
| 139 | 156 | Haskell API |
| 140 | 157 | ----------- |
| 141 | 158 |