var searchIndex = {};
searchIndex['lib'] = {"items":[[0,"","lib","",null,null],[0,"tree","","",null,null],[3,"AVLTree","lib::tree","",null,null],[12,"root","","",0,null],[11,"new","","This function will construct a new empty AVLTree.\n# Examples\n```\nextern crate avl_tree;\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\n```",0,{"inputs":[{"name":"avltree"}],"output":{"name":"avltree"}}],[11,"insert","","This function will insert the key,value pair into the tree, overwriting the old data if the key is allready\npart of the tree.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nassert_eq!(t.get(2), Some(&25));\nt.insert(2,30);\nassert_eq!(t.get(2), Some(&30));\n```",0,{"inputs":[{"name":"avltree"},{"name":"k"},{"name":"d"}],"output":null}],[11,"delete","","This function will remove the key,value pair from the tree, doing nothing if the key is not\npart of the tree.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nt.delete(2);\nassert!(t.empty());\nt.delete(3);\nassert!(t.empty());\n```",0,{"inputs":[{"name":"avltree"},{"name":"k"}],"output":null}],[11,"get","","This function will return the Some(data) stored under the given key or None if the key is not\nknown.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nassert_eq!(t.get(2), Some(&25));\nassert_eq!(t.get(3), None);",0,{"inputs":[{"name":"avltree"},{"name":"k"}],"output":{"name":"option"}}],[11,"get_or","","This function will return the data stored under the given key or the default if the key is not\nknown.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nassert_eq!(t.get_or(2,&2000), &25);\nassert_eq!(t.get_or(3,&2000), &2000);",0,{"inputs":[{"name":"avltree"},{"name":"k"},{"name":"d"}],"output":{"name":"d"}}],[11,"contains","","This function will return true if the tree contains the given key, false otherwise\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nassert!(!t.contains(3));\nassert!(t.contains(2));",0,{"inputs":[{"name":"avltree"},{"name":"k"}],"output":{"name":"bool"}}],[11,"empty","","This function will return true if the tree is empty, false otherwise.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nassert!(t.empty());\nt.insert(2,25);\nassert!(!t.empty());",0,{"inputs":[{"name":"avltree"}],"output":{"name":"bool"}}],[11,"min","","This function will return the key/value pair with the smallest key in the tree, or None if the\ntree is empty.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nt.insert(3,50);\nassert_eq!(t.min().unwrap().0, &2);\nassert_eq!(t.min().unwrap().1, &25);",0,{"inputs":[{"name":"avltree"}],"output":{"name":"option"}}],[11,"max","","This function will return the key/value pair with the biggest key in the tree, or None if the\ntree is empty.\n# Examples\n```\nlet mut t=avl_tree::AVLTree::<u64,i32>::new();\nt.insert(2,25);\nt.insert(3,50);\nassert_eq!(t.max().unwrap().0, &3);\nassert_eq!(t.max().unwrap().1, &50);",0,{"inputs":[{"name":"avltree"}],"output":{"name":"option"}}],[11,"iter","","This function will return a read only iterator for all (key,value) pairs in the tree.\n# Examples\n```\n# let mut t=avl_tree::AVLTree::<u64,i32>::new();\nfor (key,val) in t.iter() {\n    println!(\"{} -> {}\",key,val)\n}",0,{"inputs":[{"name":"avltree"}],"output":{"name":"rangepairiter"}}],[11,"range","","This function will return a read only iterator for all (key,value) pairs between the two bounds (which can\nbe inclusive, exclusive or unbounded).\n# Examples\n```\n#![feature(collections_bound)]\n# extern crate avl_tree;\nuse std::collections::Bound;\n//[...]\n# let mut t=avl_tree::AVLTree::<u64,i32>::new();\nfor (key,val) in t.range(Bound::Excluded(32), Bound::Excluded(38)) {\n    println!(\"{} -> {}\",key,val)\n}",0,{"inputs":[{"name":"avltree"},{"name":"bound"},{"name":"bound"}],"output":{"name":"rangepairiter"}}]],"paths":[[3,"AVLTree"]]};
initSearch(searchIndex);