rev-list: --children and --count --left-right with --boundary in a symmetric difference
Both were refused, as depending on which commits git's search for the merge bases read. Compared with git, what differed came down to three rules, now matched: - An excluded commit passes its exclusion to its parents and not its side, so `--count --left-right --boundary` counts a boundary commit on the left only where a commit of the left side reached it or it was named there. - With a commit-graph, the search for merge bases does not count a candidate queued a second time before it came out when deciding whether to go on, as it already did not without one. Going on read commits git does not, and the exclusions then reached further than git's, which `--parents` and `--children` with paths showed. Checked against the commits git reads (the loose-object directories GIT_COMMIT_GRAPH_PARANOIA makes it list) in 8,936 searches. - A symmetric difference queues its merge bases before either side, which decides the order of commits of one date: with a commit-graph, where the search reads less, a side that is its own merge base was processed after the other, and paths listed nothing where git listed commits. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01P9FTtTrkEbuvbZnRyJCBir