| commit | 67916dc4038918a940f38d08d073a9bbb4aea89b | |
| author | Jiří Techet <techet@gmail.com> | |
| Thu, 21 May 2015 22:49:03 +0000 (22 00:49 +0200) | ||
| committer | Jiří Techet <techet@gmail.com> | |
| Mon, 18 Jan 2016 21:56:10 +0000 (18 22:56 +0100) | ||
| tree | 917e9226d5be6ddeef12d2b69946ba7d1dc366c0 | treesnapshot (tar.gz zip) |
| parent | 2682d7973f0518ccfb3806901170ff8314c311c6 | commitdiff |
Use only binary search to find first/last element in a row of equal tags
The linear part may become expensive when there are many equal tags
which can happen when partial search, used for non-scope completion,
is used.
The linear part may become expensive when there are many equal tags
which can happen when partial search, used for non-scope completion,
is used.
| tagmanager/src/tm_tag.c | diffblobblamehistory |