// Copyright (C) 1996 DIMACS Center, Rutgers, The State University of New Jersey
// Author(s): Jonathan Berry
// This software is copyrighted by the DIMACS Center at Rutgers, The State
// University of New Jersey.  IT IS PROVIDED AS IS, AND THE AUTHORS, DIMACS, AND
// RUTGERS, THE STATE UNIVERSITY OF NEW JERSEY  DISCLAIM
// ALL LIABILITY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL
// DAMAGES ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
// DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
// THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
// INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE
// IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE
// NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
// MODIFICATIONS.
// The authors hereby grant permission to use, copy, modify, distribute,
// and license this software and its documentation for any purpose, provided
// that existing copyright notices are retained in all copies and that this
// notice is included verbatim in any distributions. No written agreement,
// license, or royalty fee is required for any of the authorized uses.
// Modifications to this software may be copyrighted by their authors
// and need not follow the licensing terms described here, provided that
// the new terms are clearly indicated on the first page of each file where
// they apply.
// Last File Update: 21-Feb-1998
// 
//
//	This file is used to instantiate any template classes or objects
//	which are not handled by the auto-generation methods (see the
//	utilities "instantiate" and "genMethods")
//
//	Currently, the auto-generation mechanism doesn't handle multiple
//	template arguments (and may never).
#include<string.h>
#define DEFINE_ElementOps_TEMPLATE
#include <LINK/basic/ElementOps.h>
typedef char *String;

int ElementOps<String>::compareItems(const String& e1, const String& e2);

template class ElementOps<String>;
int ElementOps<String>::compareItems(const String& e1, const String& e2)
{
	return strcmp(e1,e2);
}
#undef DEFINE_ElementOps_TEMPLATE
#define DEFINE_Container_TEMPLATE
#include <LINK/basic/Container.h>
template class Dictionary<int,int>;
template class Dictionary<char,char>;
template class Dictionary<int,char>;
template class Dictionary<char,int>;
#undef DEFINE_Container_TEMPLATE
#define DEFINE_Array_TEMPLATE
#include <LINK/basic/Array.h>
template class Array<int>;
#undef DEFINE_Array_TEMPLATE
#define DEFINE_BinaryHeap_TEMPLATE
#include <LINK/basic/BinaryHeap.h>
template class BinaryHeap<int,int>;
template class BinaryHeap<char,char>;
template class BinaryHeap<int,char>;
template class BinaryHeap<char,int>;
#undef DEFINE_BinaryHeap_TEMPLATE
#ifdef __GNUC__
#define DEFINE_BinaryHeap_TEMPLATE
#include <LINK/basic/BinaryHeap.h>
template class BinaryHeapNode<int,int>;
template class BinaryHeapNode<char,char>;
template class BinaryHeapNode<int,char>;
template class BinaryHeapNode<char,int>;
#undef DEFINE_BinaryHeap_TEMPLATE
#define DEFINE_BinarySearchTree_TEMPLATE
#include <LINK/basic/BinarySearchTree.h>
template class BinarySearchTreeNode<int,int>;
template class BinarySearchTreeNode<char,char>;
template class BinarySearchTreeNode<int,char>;
template class BinarySearchTreeNode<char,int>;
#undef DEFINE_BinarySearchTree_TEMPLATE
#define DEFINE_RedBlackTree_TEMPLATE
#include <LINK/basic/RedBlackTree.h>
template class RedBlackTreeNode<int,int>;
template class RedBlackTreeNode<int,char>;
template class RedBlackTreeNode<char,int>;
template class RedBlackTreeNode<char,char>;
#undef DEFINE_RedBlackTree_TEMPLATE
#endif
#define DEFINE_BinarySearchTree_TEMPLATE
#include <LINK/basic/BinarySearchTree.h>
template class BinarySearchTree<int,int>;
template class BinarySearchTree<char,char>;
template class BinarySearchTree<int,char>;
template class BinarySearchTree<char,int>;
#undef DEFINE_BinarySearchTree_TEMPLATE
#define DEFINE_RedBlackTree_TEMPLATE
#include <LINK/basic/RedBlackTree.h>
template class RedBlackTree<int,int>;
template class RedBlackTree<int,char>;
template class RedBlackTree<char,int>;
template class RedBlackTree<char,char>;
#undef DEFINE_RedBlackTree_TEMPLATE
#define DEFINE_Deque_TEMPLATE
#include <LINK/basic/Deque.h>
template class Deque<int>;
template ostream& operator<<(ostream&, const Deque<int>&);
#undef DEFINE_Deque_TEMPLATE
#define DEFINE_Queue_TEMPLATE
#include <LINK/basic/Queue.h>
template class Queue<int>;
#undef DEFINE_Queue_TEMPLATE
#define DEFINE_Stack_TEMPLATE
#include <LINK/basic/Stack.h>
template class Stack<int>;
#undef DEFINE_Stack_TEMPLATE
#define DEFINE_Matrix_TEMPLATE
#include <LINK/basic/Matrix.h>
template class ElementOps<Matrix<int> >;
template class Matrix<int>;
template class SymMatrix<int>;
template ostream& operator<<(ostream&, const Matrix<int>&);
template class ElementOps<Matrix<double> >;
template class Matrix<double>;
template class SymMatrix<double>;
template ostream& operator<<(ostream&, const Matrix<double>&);
#define DEFINE_Matrix_TEMPLATE
