Reputation
3,894
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
1 11 20
Newest
 Organizer
Impact
~36k people reached

49m
revised How do I create a parse tree, given a grammar?
added 83 characters in body
54m
comment Saving tabular, spreadsheet-like data in a relational database?
No, I think the concerns are orthogonal: data quality issues exists across the board independent of technologies. I'd suggest investing in a solution for that more directly. For example, addresses usually get verified by a post office service, so that spelling differences (2nd vs. Second, ST vs. Street, etc..) are made canonical. This wholly independent of technological choice in persistence.
1h
answered How do I create a parse tree, given a grammar?
1h
comment Saving tabular, spreadsheet-like data in a relational database?
How do you think that using an alternative persistence technology will resolve your data quality & cleansing problem?
1d
comment Should there be print statements in a library
Printing is a pretty big and unexpected side effect for a function. It's also going to slow things down. There are better ways to test things. It is ok (good even, see @gnat's reference) to log if you allow the choice of logging to be the library user's not the library's, and it includes choices to expand/limit verbosity.
1d
comment Should there be print statements in a library
Are the print statements for logging?
1d
comment LSB-propagating left shift, conceptual equivalent of sign-propagating right shift
No, my bad. It needs to be y = toShift & 1; then the left shift, then OR in (y<<x)-y (instead of(y<<x)-1).
2d
answered LSB-propagating left shift, conceptual equivalent of sign-propagating right shift
Apr
27
comment Why do most mainstream languages not support “x < y < z” syntax for 3-way Boolean comparisons?
Sure it is doable, but why bother? Whose life is better for it; where's the demand for this?
Apr
27
comment Approach for comparing versions of hierarchy
If you use a db that has transactions, and get all changes from one user into a single transaction, then the db will tell you if there is a conflict where a redo would be necessary, without concerning yourself with version numbering. If you are versioning manually, you will have to have rigor around what versions mean, and their implication for use.
Apr
27
revised Is it ever appropriate to use subtyping for a has-a relationship?
added 191 characters in body
Apr
27
revised Is it ever appropriate to use subtyping for a has-a relationship?
added 191 characters in body
Apr
27
comment Binary Search Tree without Natural Ordering
When a relation exists for only some of the elements of a given set, we might call that a graph.
Apr
27
revised Is it ever appropriate to use subtyping for a has-a relationship?
added 122 characters in body
Apr
27
revised Binary Search Tree without Natural Ordering
added 11 characters in body
Apr
27
revised Is it ever appropriate to use subtyping for a has-a relationship?
added 86 characters in body
Apr
27
answered Is it ever appropriate to use subtyping for a has-a relationship?
Apr
27
revised Binary Search Tree without Natural Ordering
added 395 characters in body
Apr
27
answered Binary Search Tree without Natural Ordering
Apr
27
comment Binary Search Tree without Natural Ordering
What do you mean by "the data does not possess natural ordering". The whole point of an ordered data structure is to feed unordered (yet orderable) data into it, of course. So, perhaps you are talking about graph data that is not fully ordered or orderable? In graph data, you may know that foo is after bar, but not a total ordering of all the nodes. In other words, you're looking for a topological sort instead of a total order. For graphs we use different algorithms and data structures.