Class: Algorithms::Containers::CRBTreeMap

Inherits:

Object

• Object
• Algorithms::Containers::CRBTreeMap

Defined in:

ext/containers/rbtree_map/rbtree.c

Instance Method Summary

• #delete(key) ⇒ Object
• #delete_max ⇒ Object
• #delete_min ⇒ Object
• #each ⇒ Object
• #empty? ⇒ Boolean
• #get(key) ⇒ Object (also: #[])
• #has_key?(key) ⇒ Boolean
• #height ⇒ Object
• #initialize ⇒ Object constructor
• #max_key ⇒ Object
• #min_key ⇒ Object
• #push(key, value) ⇒ Object (also: #[]=)
• #size ⇒ Object

Constructor Details

#initialize ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 307

static VALUE rbtree_init(VALUE self)
{
	return self;
}

Instance Method Details

#delete(key) ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 412

static VALUE rbtree_delete(VALUE self, VALUE key) {
	VALUE deleted_value;
	rbtree *tree = get_tree_from_self(self);
	if(!tree->root)
		return Qnil;
	
	tree->root = delete(tree, tree->root, key, &deleted_value);
	if(tree->root)
		tree->root->color = BLACK;
	
	if(deleted_value) {
		return deleted_value;
	}
		
	return Qnil;
}

#delete_max ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 446

static VALUE rbtree_delete_max(VALUE self) {
	VALUE deleted_value;
	rbtree *tree = get_tree_from_self(self);
	if(!tree->root)
		return Qnil;
	
	tree->root = delete_max(tree->root, &deleted_value);
	if(tree->root)
		tree->root->color = BLACK;
	
	if(deleted_value) {
		return deleted_value;
	}
		
	return Qnil;
}

#delete_min ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 429

static VALUE rbtree_delete_min(VALUE self) {
	VALUE deleted_value;
	rbtree *tree = get_tree_from_self(self);
	if(!tree->root)
		return Qnil;
	
	tree->root = delete_min(tree->root, &deleted_value);
	if(tree->root)
		tree->root->color = BLACK;
	
	if(deleted_value) {
		return deleted_value;
	}
		
	return Qnil;
}

#each ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 467

static VALUE rbtree_each(VALUE self) {
	rbtree *tree = get_tree_from_self(self);
	rbt_each(tree, &rbtree_each_helper, NULL);
	return self;
}

#empty? ⇒ Boolean

Returns:

• (Boolean)

# File 'ext/containers/rbtree_map/rbtree.c', line 377

static VALUE rbtree_is_empty(VALUE self) {
	rbtree *tree = get_tree_from_self(self);
	return (tree->root ? Qfalse : Qtrue);
}

#get(key) ⇒ Object Also known as: []

# File 'ext/containers/rbtree_map/rbtree.c', line 367

static VALUE rbtree_get(VALUE self, VALUE key) {
	rbtree *tree = get_tree_from_self(self);
	return get(tree, tree->root, key);
}

#has_key?(key) ⇒ Boolean

Returns:

• (Boolean)

# File 'ext/containers/rbtree_map/rbtree.c', line 387

static VALUE rbtree_has_key(VALUE self, VALUE key) {
	rbtree *tree = get_tree_from_self(self);
	if(!tree->root) { return Qfalse; }
	if(get(tree, tree->root, key) == Qnil)
		return Qfalse;
	
	return Qtrue;
}

#height ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 382

static VALUE rbtree_height(VALUE self) {
	rbtree *tree = get_tree_from_self(self);
	return INT2NUM(height(tree->root));
}

#max_key ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 404

static VALUE rbtree_max_key(VALUE self) {
	rbtree *tree = get_tree_from_self(self);
	if(!tree->root)
		return Qnil;
	
	return max_key(tree->root);
}

#min_key ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 396

static VALUE rbtree_min_key(VALUE self) {
	rbtree *tree = get_tree_from_self(self);
	if(!tree->root)
		return Qnil;
	
	return min_key(tree->root);
}

#push(key, value) ⇒ Object Also known as: []=

# File 'ext/containers/rbtree_map/rbtree.c', line 361

static VALUE rbtree_push(VALUE self, VALUE key, VALUE value) {
	rbtree *tree = get_tree_from_self(self);
	tree->root = insert(tree, tree->root, key, value);
	return value;
}

#size ⇒ Object

# File 'ext/containers/rbtree_map/rbtree.c', line 372

static VALUE rbtree_size(VALUE self) {
	rbtree *tree = get_tree_from_self(self);
	return INT2NUM(size(tree->root));
}