aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/predefs.in
diff options
context:
space:
mode:
authorKristaps Dzonsons <kristaps@bsd.lv>2011-10-09 10:35:12 +0000
committerKristaps Dzonsons <kristaps@bsd.lv>2011-10-09 10:35:12 +0000
commit317d9eef07bdf21e9ea16e6ff439e7bfbf2b0f21 (patch)
tree389b33de547b0d3e112ab95c54473151c3e4b1ae /predefs.in
parentbcdfe0a625855aa24f8e4d94a5ae2578a315bffa (diff)
downloadmandoc-317d9eef07bdf21e9ea16e6ff439e7bfbf2b0f21.tar.gz
mandoc-317d9eef07bdf21e9ea16e6ff439e7bfbf2b0f21.tar.zst
mandoc-317d9eef07bdf21e9ea16e6ff439e7bfbf2b0f21.zip
Use a binary tree (for now, unbalanced) for deduping the records in the
results array. This is much faster than the previous method, a linear search, at a small cost. Note that array offsets are used instead of storing the res pointer because we may realloc the results vector.
Diffstat (limited to 'predefs.in')
0 files changed, 0 insertions, 0 deletions