Post #1782103
2026-04-22 07:40 UTC
@screwlisp
Normal Pascal:
function search_ints(a: int_array; x: INTEGER): INTEGER
{ for loop or whatever, return i, or -1 for not found }
At most you might make a TYPE search_result with BOOLEAN & INT fields.
The Java book which came out YEARS after java.util.collections, claims there's no iteration & implements a very weird iterator there, too.
Talks about testing, but never presents a test case or runner, I think they only do whole-program testing. Write some inputs, see what it does.
Replies (1)
-
@mdhughes@appdot.net 2026-04-22 07:55
@screwlisp The Java book then has a design for (but no impl details) a GUI search engine with WAY too much database of its own, & a summary of Go4's Design Patterns. The CLU book has program verification, which is mathematically impossible (see Gödel), but at least it's not repeating a better book. They both go into waterfall design specificationm, apparently in a void or vast organization like IBM where developer time doesn't exist. It's like YT's Mom's job is to implement this stuff.