mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-27 13:40:20 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fixed local imports in std.container.rbtree

Browse source
This commit is contained in:
Jack Stouffer 2016-06-30 17:17:03 -04:00
parent fb12e930c0
commit e51a044c19
1 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

8
std/container/rbtree.d
View file

@ -739,9 +739,9 @@ final class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false)
if (is(typeof(binaryFun!less(T.init, T.init)))) if (is(typeof(binaryFun!less(T.init, T.init))))
{ {
import std.meta : allSatisfy; import std.meta : allSatisfy;
import std.range.primitives; import std.range.primitives : isInputRange, walkLength;
import std.range : Take; import std.range : Take;
import std.traits; import std.traits : isIntegral, isDynamicArray, isImplicitlyConvertible;
alias _less = binaryFun!less; alias _less = binaryFun!less;
@ -1631,7 +1631,7 @@ assert(equal(rbt[], [5]));
*/ */
void printTree(Node n, int indent = 0) void printTree(Node n, int indent = 0)
{ {
import std.stdio; import std.stdio : write, writeln;
if (n !is null) if (n !is null)
{ {
printTree(n.right, indent + 2); printTree(n.right, indent + 2);
@ -1661,7 +1661,7 @@ assert(equal(rbt[], [5]));
// //
int recurse(Node n, string path) int recurse(Node n, string path)
{ {
import std.stdio; import std.stdio : writeln;
if (n is null) if (n is null)
return 1; return 1;
if (n.parent.left !is n && n.parent.right !is n) if (n.parent.left !is n && n.parent.right !is n)