about summary refs log tree commit diff stats
path: root/077hash.cc
Commit message (Collapse)AuthorAgeFilesLines
* 2685Kartik K. Agaram2016-02-221-1/+1
|
* 2678Kartik K. Agaram2016-02-201-1/+1
| | | | | | | Start using type names from the type tree rather than the property tree in most places. Hopefully the only occurrences of 'properties.at(0).second' left are ones where we're managing it. Next we can stop writing to it.
* 2685Kartik K. Agaram2016-02-191-2/+2
| | | | | | | | | | | | | | | | Stack of plans for cleaning up replace_type_ingredients() and a couple of other things, from main problem to subproblems: include type names in the type_tree rather than in the separate properties vector make type_tree and string_tree real cons cells, with separate leaf nodes redo the vocabulary for dumping various objects: do we really need to_string and debug_string? can we have a version with *all* information? can we have to_string not call debug_string? This commit nibbles at the edges of the final task, switching from member method syntax to global function like almost everything else. I'm mostly using methods just for STL in this project.
* 2680Kartik K. Agaram2016-02-191-1/+1
| | | | Memory leaks fixed.
* 2668 - add an escape hatch for 'hash'Kartik K. Agaram2016-02-171-0/+21
| | | | | | | | If you don't want a field of a container to be included in its hash, use the /ignore-for-hash property. This property only works for containers, not exclusive-containers or arrays. Mu will warn if you misuse it.
* 2667 - redo container data structureKartik K. Agaram2016-02-171-1/+1
| | | | I've been gradually Greenspunning reagents. Just go all the way.
* 2664 - 'hash' any typeKartik K. Agaram2016-02-161-3/+339
| | | | | | This is smart enough to only look at data and ignores internal book-keeping like addresses, refcounts and floating-point details. Though the last is not ideal yet.
* 2662 - rewrite 'hash' in C++Kartik K. Agaram2016-02-151-0/+36
Since it needs specialized non-overflowing types like unsigned long long, my plan is to eventually write it in straight machine code using Mu primitives to make that a slightly nicer process. Hopefully we'll need to deal with machine types only for a tiny set of crucial primitives and it won't be too painful to drop down to machine code for them.
20'>220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290