My Project  debian-1:4.1.1-p2+ds-4build2
claptmpl.cc
Go to the documentation of this file.
1 // emacs edit mode for this file is -*- C++ -*-
2 /****************************************
3 * Computer Algebra System SINGULAR *
4 ****************************************/
5 /*
6 * ABSTRACT - instantiation of all templates
7 */
8 
9 
10 
11 
12 #include "kernel/mod2.h"
13 //using namespace std;
14  #define SINGULAR 1
15  #include "factory/factory.h"
17  #include "kernel/fglm/fglm.h"
18 
19 // templates for fglm:
20  template class List<fglmSelem>;
21  template class ListItem<fglmSelem>;
22  template class ListIterator<fglmSelem>;
23  template class List<fglmDelem>;
24  template class ListItem<fglmDelem>;
25  template class ListIterator<fglmDelem>;
26 
27 // ----------------------------------------------------------------------------
28 // kmatrix.cc
29 // begin of file
30 // Stephan Endrass, endrass@mathematik.uni-mainz.de
31 // 23.7.99
32 // ----------------------------------------------------------------------------
33 
34 #ifdef HAVE_SPECTRUM
35 
36 #ifdef KMATRIX_PRINT
37 #include <iostream.h>
38 #ifndef KMATRIX_IOSTREAM
39 #include <stdio.h>
40 #endif
41 #endif
42 
43 #include "kernel/spectrum/GMPrat.h"
45 
46 template class KMatrix<Rational>;
47 
48 #ifdef KMATRIX_PRINT
49 template OSTREAM & operator << ( OSTREAM&,const KMatrix<Rational>& );
50 template static void print_rational( OSTREAM&,int,const Rational& );
51 #endif
52 
53 #endif /* HAVE_SPECTRUM */
54 // ----------------------------------------------------------------------------
55 // kmatrix.cc
56 // end of file
57 // ----------------------------------------------------------------------------
58 
59 #ifdef HAVE_PLURAL
60 
61 #include "polys/nc/ncSAMult.h" // for CMultiplier etc classes
62 
63 template class CMultiplier<int>;
64 template class CMultiplier<poly>;
65 template class CMultiplier<CPower>;
66 
67 // #include "kernel/ncSACache.h" // for CCacheHash etc classes
68 // template class CCacheHash<poly>;
69 // template class CCacheHash<int>;
70 
71 #endif
72 
74 #ifdef HAVE_BOOST
75 #include <boost/dynamic_bitset.hpp>
76 #include <vector>
77 using std::vector;
78 using boost::dynamic_bitset;
79 template class dynamic_bitset<>;
80 template class vector<dynamic_bitset<> >;
81 #elif defined(USE_STDVECBOOL)
82 #include <vector>
83 using std::vector;
84 template class vector<bool>;
85 template class vector<vector<bool> >;
86 #endif
87 
88 template int pos_helper(kStrategy strat, poly p, int len, intset setL, polyset set);
89 template int pos_helper(kStrategy strat, poly p, wlen_type len, wlen_set setL, polyset set);
90 #ifdef NORO_CACHE
91 //template class std::map<PolySimple,std::pair<PolySimple,int> >;
92 //#include <queue>
93 template class std::vector<PolySimple>;
94 //template class std::priority_queue<MonRedRes>;
95 //template class std::vector<NoroPlaceHolder>;
96 //template class std::vector<std::vector<NoroPlaceHolder> >;
97 //template class std::vector<DataNoroCacheNode<tgb_uint16>* >;
98 //template class std::vector<DataNoroCacheNode<tgb_uint8>* >;
99 template class std::vector<DataNoroCacheNode<tgb_uint32>* >;
100 //template SparseRow<tgb_uint16> * noro_red_to_non_poly_t<tgb_uint16>(poly p, int &len, NoroCache<tgb_uint16>* cache,slimgb_alg* c);
102 //template SparseRow<tgb_uint8>* noro_red_to_non_poly_t<tgb_uint8>(poly p, int &len, NoroCache<tgb_uint8>* cache,slimgb_alg* c);
103 //template void simplest_gauss_modp<tgb_uint16> (tgb_uint16* a, int nrows,int ncols);
104 template void simplest_gauss_modp<tgb_uint32> (tgb_uint32* a, int nrows,int ncols);
105 //template void simplest_gauss_modp<tgb_uint8> (tgb_uint8* a, int nrows,int ncols);
106 //template poly row_to_poly<tgb_uint8>(tgb_uint8* row, poly* terms, int tn, ring r);
107 template poly row_to_poly<tgb_uint32>(tgb_uint32* row, poly* terms, int tn, ring r);
108 //template poly row_to_poly<tgb_uint16>(tgb_uint16* row, poly* terms, int tn, ring r);
109 template void noro_step<tgb_uint8>(poly*p,int &pn,slimgb_alg* c);
110 template void noro_step<tgb_uint16>(poly*p,int &pn,slimgb_alg* c);
111 template void noro_step<tgb_uint32>(poly*p,int &pn,slimgb_alg* c);
112 //std::priority_queue<MonRedRes>
113 //
114 #endif
115 
116 /* next lines are templates used in new minor code */
117 #include <list>
120 
121 template class std::list<int>;
122 template class std::list<MinorKey>;
123 template class std::list<IntMinorValue>;
124 template class std::list<PolyMinorValue>;
125 
126 
127 /*
128 template class std::_List_base<IntMinorValue, std::allocator<IntMinorValue> >;
129 template class std::_List_base<int, std::allocator<int> >;
130 template class std::_List_base<MinorKey, std::allocator<MinorKey> >;
131 template class std::_List_base<PolyMinorValue, std::allocator<PolyMinorValue> >;
132 */
133 
134 template class Cache<MinorKey, IntMinorValue>;
135 template class Cache<MinorKey, PolyMinorValue>;
136 
nrows
int nrows
Definition: cf_linsys.cc:32
row_to_poly< tgb_uint32 >
template poly row_to_poly< tgb_uint32 >(tgb_uint32 *row, poly *terms, int tn, ring r)
kmatrix.h
skStrategy
Definition: kutil.h:262
ncols
int int ncols
Definition: cf_linsys.cc:32
tgb_internal.h
tgb_uint32
unsigned int tgb_uint32
Definition: tgb_internal.h:427
noro_red_to_non_poly_t< tgb_uint32 >
template SparseRow< tgb_uint32 > * noro_red_to_non_poly_t< tgb_uint32 >(poly p, int &len, NoroCache< tgb_uint32 > *cache, slimgb_alg *c)
simplest_gauss_modp< tgb_uint32 >
template void simplest_gauss_modp< tgb_uint32 >(tgb_uint32 *a, int nrows, int ncols)
noro_step< tgb_uint16 >
template void noro_step< tgb_uint16 >(poly *p, int &pn, slimgb_alg *c)
polyset
poly * polyset
Definition: polys.h:246
KMatrix
Definition: kmatrix.h:41
Minor.h
operator<<
ostream & operator<<(ostream &s, const spectrum &spec)
Definition: semic.cc:249
SparseRow
Definition: tgb_internal.h:510
mod2.h
intset
int * intset
Definition: kutil.h:49
CMultiplier< int >
wlen_type
int64 wlen_type
Definition: kutil.h:50
ListItem< fglmSelem >
Cache.h
NoroCache
Definition: tgb_internal.h:586
slimgb_alg
Definition: tgb_internal.h:209
pos_helper
template int pos_helper(kStrategy strat, poly p, int len, intset setL, polyset set)
p
int p
Definition: cfModGcd.cc:4019
List< fglmSelem >
OSTREAM
#define OSTREAM
Definition: canonicalform.h:16
noro_step< tgb_uint8 >
template void noro_step< tgb_uint8 >(poly *p, int &pn, slimgb_alg *c)
ftmpl_list.cc
Cache
Class Cache is a template-implementation of a cache with arbitrary classes for representing keys and ...
Definition: Cache.h:68
fglm.h
wlen_set
wlen_type * wlen_set
Definition: kutil.h:51
Rational
Definition: GMPrat.h:14
noro_step< tgb_uint32 >
template void noro_step< tgb_uint32 >(poly *p, int &pn, slimgb_alg *c)
GMPrat.h
ListIterator
Definition: ftmpl_list.h:17
ncSAMult.h