{"added":null,"apiVersion":1,"behindSince":null,"buildDepends":[],"categories":["devel","perl5"],"comment":"Perl implementation of Red/Black tree, a type of balanced tree","compare":null,"dependentCount":null,"description":"Tree::RedBlack is a perl implementation of the Red/Black tree algorithm found in\nthe book \"Algorithms\", by Cormen, Leiserson \u0026 Rivest (more commonly known as\n\"CLR\" or \"The White Book\"). A Red/Black tree is a binary tree which remains\n\"balanced\"- that is, the longest length from root to a node is at most one more\nthan the shortest such length. It is fairly efficient; no operation takes more\nthan O(lg(n)) time.\n\nA Tree::RedBlack object supports the following methods: new(), root(), cmp(\u0026),\ninsert($, $), delete($), find($), node($), min() and max().","flavors":[],"html":"https://daemonports.org/dragonfly/devel/p5-Tree-RedBlack/","kind":"port","lastUpdate":null,"license":["ART10"],"maintainer":"sunpoet@FreeBSD.org","name":"p5-Tree-RedBlack","newest":true,"newestVersion":"0.5","noVulnData":false,"origin":"devel/p5-Tree-RedBlack","otherSystems":[{"maintainer":"sunpoet@FreeBSD.org","newest":true,"origin":"devel/p5-Tree-RedBlack","path":"/devel/p5-Tree-RedBlack/","system":"FreeBSD","version":"0.5_1"},{"maintainer":"sunpoet@FreeBSD.org","newest":true,"noVulnData":true,"origin":"devel/p5-Tree-RedBlack","path":"","system":"HardenedBSD","version":"0.5_1"},{"maintainer":"sunpoet@FreeBSD.org","newest":true,"noVulnData":true,"origin":"devel/p5-Tree-RedBlack","path":"","system":"GhostBSD","version":"0.5_1"}],"packages":null,"pkgName":"p5-Tree-RedBlack-0.5_1","related":null,"repository":"DPorts","requiredBy":[],"requiredByCount":0,"runDepends":["lang/perl5.36"],"status":null,"system":"dragonfly","systemLabel":"DragonFly","version":"0.5_1","versions":null,"vulnerabilities":null,"www":"https://metacpan.org/release/Tree-RedBlack"}