TypeStack.java

package org.python.indexer;

import java.util.ArrayList;
import java.util.List;


public class TypeStack {

    class Pair {
        public Object first;
        public Object second;

        public Pair(Object first, Object second) {
            this.first = first;
            this.second = second;
        }

        @Override
        public int hashCode() {
            return (first.hashCode() + second.hashCode()) / 2;
        }
    }

    private List<Pair> stack = new ArrayList<Pair>();

    public void push(Object first, Object second) {
        stack.add(new Pair(first, second));
    }


    public void pop(Object first, Object second) {
//        stack.remove(new Pair(first, second));
        stack.remove(stack.size() - 1);
    }


    public boolean contains(Object first, Object second) {
        for (Pair p : stack) {
            if (p.first == first && p.second == second ||
                    p.first == second && p.second == first) {
                return true;
            }
        }
        return false;
    }

}