bisect: use proper locking when updating bisect.state

bisect: remove class - rename core function to _bisect - rename command function to bisect - move state management to bisect

bisect: keep history of all bad revisions - use a single state dict - find the minimum bad revision

bisect: use more standard command syntax and help

bisect: move reporting out of core bisect function

bisect: add skip command - read/write skip lines in state - skip candidates in skipnodes - move bisect begin logic to next - add skip command

bisect: simplify state handling and init - use a single bisect.state file - unify init and reset (delete the state) - move write into good/bad

bisect: remove unused imports

bisect: rename autobad/good/next

bisect: slightly improve the help message

bisect: remove stale test function

bisect: use array.array rather than lists for ancestor lists This nearly doubles performance and cuts memory usage in half on large bisections.

bisect: switch individual ancestor lists from dict to list This saves quite a lot of memory and increases performance

bisect: turn ancestors into an array This makes things faster and eliminates the separate stop hash

bisect: greatly simplify the ancestor accumulating loop

bisect: switch to rev-based calculation - use revlog.parentrevs in search loops - calculate stop directly in O(N) without reachable - move badrev check into candidates