com.pogofish.jadt.samples.whathow.IntBinaryTreeUsage Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of jADT-samples Show documentation

Samples used in documenting the jADT project

There is a newer version: 0.3.0

/*
Copyright 2012 James Iry

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.
*/
package com.pogofish.jadt.samples.whathow;

// START SNIPPET: imports
import com.pogofish.jadt.samples.whathow.data.IntBinaryTree;
import com.pogofish.jadt.samples.whathow.data.IntBinaryTree.*;

import static com.pogofish.jadt.samples.whathow.data.IntBinaryTree.*;
// END SNIPPET: imports    

/**
 * Example usage of an IntBinaryTree used in the how page
 * It is marked up with START SNIPPET and END SNIPPET boundaries to support
 * /jADT/src/site/apt/*.apt
 * 
 * @author jiry
 */
public class IntBinaryTreeUsage {
    /**
     * Creates an example IntBinaryTree with some fixed values
     */
    public IntBinaryTree createExample() {
        // START SNIPPET: sampleTree    
        IntBinaryTree tree = _Node(42, _Node(12, _EmptyTree(), _EmptyTree()), _Node(103, _EmptyTree(), _Node(110, _EmptyTree(), _EmptyTree())));
        // END SNIPPET: sampleTree
        
        return tree;
    }
    
    /**
     * Find the max Integer of a tree where null means empty tree
     */
    // START SNIPPET: max  
    public Integer max(IntBinaryTree tree)  {
        return tree.match(new IntBinaryTree.MatchBlock() {
           @Override
           public Integer _case(Node x) {
              final Integer maxLeft = max(x.left);
              final int l = maxLeft == null ? Integer.MIN_VALUE : maxLeft;

              final Integer maxRight = max(x.right);
              final int r = maxRight == null ? Integer.MIN_VALUE : maxRight;

              return Math.max(Math.max(l, r), x.value);
           }

           @Override
           public Integer _case(EmptyTree x) {
              return null;
           }
        });
     }
    // END SNIPPET: max  
 }