10 Commits

Author	SHA1	Message	Date
Anthony Romano	5c7efaa288	adt: Union for interval trees	2017-06-21 14:33:15 -07:00
Hitoshi Mitake	c4a45c5713	auth, adt: introduce a new type BytesAffineComparable ... It will be useful for avoiding a cost of casting from string to []byte. The permission checker is the first user of the type.	2017-04-05 13:17:24 +09:00
Anthony Romano	f67bdc2eed	*: support checking that an interval tree's keys cover an entire interval	2017-04-03 15:38:07 -07:00
Anthony Romano	25e3ce1feb	adt: Visit() interval trees in sorted order and terminate early ... For all intervals [x, y), Visit will visit intervals in ascending order sorted by x. Also fixes a bug where Visit would not terminate the search when requested by the visitor function.	2017-03-23 00:02:29 -07:00
Gyu-Ho Lee	beb58c434c	*: fix minor typos ... Signed-off-by: Gyu-Ho Lee <gyuhox@gmail.com>	2017-03-08 16:21:52 -08:00
Nikita Vetoshkin	eae70c9379	adt: fast path Stab in empty interval tree	2016-10-06 22:41:33 +05:00
Gyu-Ho Lee	8b77de4e99	pkg: update LICENSE header	2016-05-12 20:48:53 -07:00
Gyu-Ho Lee	c09f23c46d	*: clean up bool comparison	2016-04-02 18:27:54 -07:00
Anthony Romano	b539d3a411	test: check formatting for all relevant packages in pkg/	2016-03-30 15:14:24 -07:00
Anthony Romano	c0b06a7a32	pkg/adt: interval tree	2016-02-29 15:20:30 -08:00