Lines Matching refs:IF
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
58 * Inserts a node into the tree with the specified key and value if
59 * the tree does not already contain a node with the specified key. If
66 if (this.isEmpty()) {
73 if (this.root_.key == key) {
77 if (key > this.root_.key) {
91 * Removes a node with the specified key from the tree if the tree
92 * contains a node with this key. The removed node is returned. If the
99 if (this.isEmpty()) {
103 if (this.root_.key != key) {
107 if (!this.root_.left) {
123 * Returns the node having the specified key or null if the tree doesn't contain
130 if (this.isEmpty()) {
142 if (this.isEmpty()) {
158 if (this.isEmpty()) {
166 if (this.root_.key < key) {
168 } else if (this.root_.left) {
181 if (!this.isEmpty()) {
190 * the given key to the top of the tree. If no node has the given
199 if (this.isEmpty()) {
211 if (key < current.key) {
212 if (!current.left) {
215 if (key < current.left.key) {
221 if (!current.left) {
229 } else if (key > current.key) {
230 if (!current.right) {
233 if (key > current.right.key) {
239 if (!current.right) {
295 if (left) left.traverse_(f);
302 if (f(this.root_.value)) return;
314 if (l) {
315 if (f(l.value)) return;
318 if (r) {
319 if (f(r.value)) return;
