mhshams

class Address {
    String number
    String firstLine
    String secondLine
    String postCode
    String City
    String State
}

mhshams

class Person {
    String firstName
    String lastName
    Address address
}

mhshams

        println person.getAddress().getFirstLine()
        println person.getAddress().getSecondLine()

mhshams

class Person {
    String firstName
    String lastName
    private Address address
    
    String getAddressFirstLine() {
        address.firstLine
    }
    
    String getAddressSecondLine() {

mhshams

        println person.getAddressFirstLine()
        println person.getAddressSecondLine()

mhshams

    private static File generateFile(String prefix, String suffix, File dir)
        throws IOException
    {
        long n = LazyInitialization.random.nextLong();
        if (n == Long.MIN_VALUE) {
            n = 0;      // corner case
        } else {
            n = Math.abs(n);
        }
        return new File(dir, prefix + Long.toString(n) + suffix);

mhshams

def mergeSort(list) {
    def size = list.size()
    if (size < 2) {
        return list
    } else {
        def m = (int)(size / 2)
        
        def left = list[0..<m]
        def right = list[m..<size]

mhshams

def heapSort(list) {
    def size = list.size()
    
    if (size < 2) {
        return list
    } 
    
    /*We need to create a valid binary heap first*/
    heapify(list)
    

mhshams

def quickSort(list) {

    /*Make sure there are at least 2 elements in the list*/
    if (list == null || list.size() < 2) {
        return list
    }

    /*break the list to three different groups  
        group 1: with elements less than pivot 
        group 2: with elements equal to pivot

mhshams

class PriorityQueue {
    /*a list to contains the queue elments in a binary heap format*/
    def list = []
    
    /*Add new item to the queue*/
    def add(item) {
        list.add(item)
        
        /*After adding new item, we need to re-validate the heap*/
        siftUp(list, 0, list.size() - 1)