April 14, 2014 [phobos] [D-Programming-Language/phobos] 138b0d: Fix complexity in red-black tree documentation | ||||
---|---|---|---|---|
| ||||
Attachments:
| Branch: refs/heads/master Home: https://github.com/D-Programming-Language/phobos Commit: 138b0def6ba096e91f9085980107ce20d0eb23af https://github.com/D-Programming-Language/phobos/commit/138b0def6ba096e91f9085980107ce20d0eb23af Author: Safety0ff <safety0ff.dev@gmail.com> Date: 2014-04-14 (Mon, 14 Apr 2014) Changed paths: M std/container.d Log Message: ----------- Fix complexity in red-black tree documentation For the existing implementation front() and opSlice() are O(1). Commit: bfe036586bfedc27dc2c8ce06bc9b60f3aaadf20 https://github.com/D-Programming-Language/phobos/commit/bfe036586bfedc27dc2c8ce06bc9b60f3aaadf20 Author: Steven Schveighoffer <schveiguy@yahoo.com> Date: 2014-04-14 (Mon, 14 Apr 2014) Changed paths: M std/container.d Log Message: ----------- Merge pull request #2081 from Safety0ff/patch-2 Fix complexity in red-black tree documentation Compare: https://github.com/D-Programming-Language/phobos/compare/a7f08aaa3115...bfe036586bfe |
Copyright © 1999-2021 by the D Language Foundation