llrb

package module
v0.1.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Mar 29, 2025 License: Apache-2.0 Imports: 2 Imported by: 0

README

llrb

LLRB is a Left-leaning Red-Black tree implementation in Go. It's a pure Go implementation of Robert's Sedgewick Left-Leaning Red-Black Trees paper.

Advantages:

  • No dependencies (see go.mod).
  • Minimalist interface.

Documentation

Overview

* Copyright 2025 Alexandre Mahdhaoui * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License.

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Tree

type Tree[K cmp.Ordered, V any] struct {
	// contains filtered or unexported fields
}

func (*Tree[K, V]) Delete

func (t *Tree[K, V]) Delete(key K)

func (*Tree[K, V]) Insert

func (t *Tree[K, V]) Insert(key K, value V)

func (*Tree[K, V]) Search

func (t *Tree[K, V]) Search(key K) (V, bool)

Directories

Path Synopsis
* Copyright 2025 Alexandre Mahdhaoui * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License.
* Copyright 2025 Alexandre Mahdhaoui * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL