TODO(dsnet): Insert/remove operations on an array has O(n) complexity where n is the length of the array. We could improve this with more clever data structure that has efficient insertion, deletion, and indexing. One possibility is an "order statistic tree", which provide O(log n) behavior for the
(patch []byte)
source not stored for this graph (policy: none)