Main Page
Related Pages
Data Structures
Files
Data Structures
Data Structure Index
Class Hierarchy
Data Fields
All
Data Structures
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Pages
Data Structures
Here are the data structures with brief descriptions:
[detail level
1
2
3
]
►
N
CxxTest
C
AbortTest
C
CommonDynamicSuiteDescription
C
DummySuiteDescription
C
DummyTestDescription
C
DummyWorldDescription
C
DynamicSuiteDescription
C
ErrorFormatter
►
C
ErrorPrinter
C
Adapter
C
GlobalFixture
C
GuiListener
C
GuiTuiRunner
C
Link
C
List
C
OutputStream
C
ParenPrinter
C
QtGui
C
RealSuiteDescription
C
RealTestDescription
C
RealWorldDescription
C
StaticSuiteDescription
►
C
StdioFilePrinter
C
Adapter
C
StdioPrinter
C
StdTraitsBase
C
SuiteDescription
C
TeeListener
C
TestDescription
C
TestListener
►
C
TestRunner
C
StateGuard
C
WorldGuard
C
TestSuite
C
TestTracker
C
ValueTraits
C
ValueTraits< const bool >
C
ValueTraits< const char >
C
ValueTraits< const CXXTEST_STD(basic_string< wchar_t >)>
C
ValueTraits< const CXXTEST_STD(string)>
C
ValueTraits< const double >
C
ValueTraits< const signed long int >
C
ValueTraits< const unsigned long int >
C
Win32Gui
C
WorldDescription
C
X11Gui
C
YesNoRunner
►
N
gitfan
C
facet
C
facet_compare
C
AFactor
C
AlgExtGenerator
Generate all elements in F_p(alpha) starting from 0
C
AlgExtInfo
Struct for passing initialization parameters to naInitChar
C
AlgExtRandomF
Generate random elements in F_p(alpha)
C
Array
C
bigintmat
Matrices of numbers
C
blackbox
C
borderElem
The old basis
C
Cache
Class
Cache
is a template-implementation of a cache with arbitrary classes for representing keys and values, respectively
C
CanonicalForm
Factory's main class
C
CAntiCommutativeSpecialPairMultiplier
C
CBasePolyEnumerator
Base polynomial enumerator for simple iteration over terms of polynomials
C
CCacheCompare
►
C
CCacheHash
C
CCacheItem
C
CCacheItem.a
C
CCacheItem.b
C
CCommutativeSpecialPairMultiplier
C
CDivisorEnumerator
TODO:
C
CDivisorEnumerator2
TODO:
C
CExternalSpecialPairMultiplier
C
CFFactory
C
CFGenerator
Virtual class for generators
C
CFGenFactory
C
CFIterator
Class to iterate through
CanonicalForm
's
C
CFMap
Class
CFMap
C
CFormulaPowerMultiplier
C
CFRandom
Virtual class for random element generation
C
CFRandomFactory
C
CFSwitches
Class
CFSwitches
C
CGlobalCacheHash
C
CGlobalMultiplier
C
CHWeylSpecialPairMultiplier
C
CLCM
C
CLeadingTerm
C
CListOld
C
cmdnames
C
CMultiplier
C
CNode
C
coeffs
C
coeffs
The main handler for Singular numbers which are suitable for Singular polynomials
C
CoeffsTestSuite
C
CoefIdx
C
condition_type
C
const_map
C
const_ring
C
convexHull
C
CountedRef
C
CountedRefData
This class stores a reference counter as well as a Singular interpreter object
C
CountedRefIndirectPtr
C
CountedRefPtr
This class implements a smart pointer which handles pointer-style access to a reference-counted structure and destructing the latter after use
C
CountedRefShared
C
CountedRefWeakPtr
C
CPairOld
structure of labeled critical pairs
C
CPolyCoeffsEnumerator
This is a polynomial enumerator for simple iteration over coefficients of polynomials
C
CPolynomialSummator
CPolynomialSummator
: unifies bucket and polynomial summation as the later is brocken in buckets :(
C
CPower
C
CPowerMultiplier
C
CQuasiCommutativeSpecialPairMultiplier
C
CRecursivePolyCoeffsEnumerator
Go into polynomials over an alg. extension recursively
C
CReducerFinder
C
CShiftSpecialPairMultiplier
C
CSpecialPairCacheHash
C
CSpecialPairMultiplier
C
CWeylSpecialPairMultiplier
C
DataNoroCacheNode
C
datum
C
DBM
C
DBM_info
►
C
DegreePattern
DegreePattern
provides a functionality to create, intersect and refine degree patterns
C
Pattern
C
denominator_list_s
C
DenseRow
C
entry
C
Evaluation
Class to evaluate a polynomial at points
C
exp_number_builder
C
exponentOverflowException
C
ext_entry
C
ExtensionInfo
ExtensionInfo
contains information about extension
C
facet
C
Factor
C
fe_option
C
feResourceConfig_s
C
FFGenerator
Generate all elements in F_p starting from 0
C
FFRandom
Generate random elements in F_p
C
fglmDdata
C
fglmDelem
C
fglmSdata
C
fglmSelem
C
fglmVector
C
fglmVectorRep
C
find_erg
C
flintZn_struct
C
gaussElem
C
gaussReducer
C
gcone
Implements the cone structure
C
gen_list_entry
C
generator_entry
C
GFGenerator
Generate all elements in GF starting from 0
C
GFInfo
Creation data needed for finite fields
C
GFRandom
Generate random elements in GF
C
GlobalPrintingFixture
C
gmp_complex
Gmp_complex numbers based on
C
gmp_float
C
groebnerCone
C
groebnerCone_compare
C
heBrowser_s
C
heEntry_s
C
IAccessor
Templated accessor interface for accessing individual data (for instance, of an enumerator)
C
IBaseEnumerator
Base enumerator interface for simple iteration over a generic collection
C
ideal
The following
sip_sideal
structure has many different uses thoughout Singular. Basic use-cases for it are:
C
ideal_list
C
idealFunctionals
C
idrec
C
IEnumerator
Templated enumerator interface for simple iteration over a generic collection of T's
C
indlist
C
int64vec
C
int_pair_node
C
int_poly
C
int_poly_pair
Obsolete
C
InternalCF
Virtual class for internal
CanonicalForm
's
C
InternalInteger
Factory's class for integers
C
InternalPoly
Factory's class for polynomials
C
InternalRational
Factory's class for rationals
C
IntGenerator
Generate integers starting from 0
C
IntMinorProcessor
Class
IntMinorProcessor
is derived from class
MinorProcessor
C
IntMinorValue
Class
IntMinorValue
is derived from
MinorValue
and can be used for representing values in a cache for sub-determinantes; see class
Cache
C
IntRandom
Generate random integers
C
intvec
C
ip_command
C
ip_link
C
ip_package
C
ip_smatrix
C
jList
C
kBucket
C
KMatrix
C
lattice
►
C
LeftvDeep
This class wraps
leftv
by taking into acount memory allocation, destruction as well as deeply copying of a given
leftv
, i.e
C
copy_tag
Construct even deeper copy: Skip identifier (if any) and take care of the data on our own
C
LeftvHelper
This class implements some recurrent code sniplets to be used with
leftv
and
idhdl.implements
a refernce counter which we can use
C
LeftvShallow
Ths class wraps
leftv
by taking into acount memory allocation, destruction as well as shallowly copying of a given
leftv
, i.e
C
libstack
C
LinearDependencyMatrix
C
linearForm
C
link_struct
C
List
C
ListItem
C
ListIterator
C
LList
C
LNode
C
LongComplexInfo
C
LongSpec
C
LPolyOld
class of labeled polynomials
C
LTagList
C
LTagNode
C
mac_poly_r
C
macoeff_s
C
maideal_s
C
mapoly_s
C
MapPair
Class
MapPair
C
matElem
The
idealFunctionals
C
matHeader
C
MathicToSingStream
C
Matrix
C
mayanPyramidAlg
C
MinorKey
Class
MinorKey
can be used for representing keys in a cache for sub-determinantes; see class
Cache
C
MinorProcessor
Class
MinorProcessor
implements the key methods for computing one or all sub-determinantes of a given size in a pre-defined matrix; either without caching or by using a cache
C
MinorValue
C
modp_result_entry
C
modpk
Class to do operations mod p^k for int's p and k
C
ModPMatrixBackSubstProxyOnArray
C
ModPMatrixProxyOnArray
C
mon_list_entry
C
monh
C
monom_poly
C
MonRedResNP
C
mp_array_list
C
mp_permmatrix
C
multiCnt
C
MyGlobalPrintingFixture
C
MYYSTYPE
C
NAConverter
C
nc_pProcs
C
nc_struct
C
newstruct_desc
C
newstruct_member
C
newstruct_proc
C
newtonPolygon
C
NewVectorMatrix
C
nf
C
nforder
C
nforder_ideal
C
NoroCache
C
NoroCacheNode
C
NTNumConverter
C
number
'SR_INT' is the type of those integers small enough to fit into 29 bits
C
number2
C
oldGaussElem
C
omallocClass
C
omBin_t
C
omBinPage_t
C
omBinPageRegion_t
C
omErrorString_s
C
omInfo_t
C
omMemCell_t
C
omOpts_t
C
omRetInfo_t
C
omSpecBin_t
C
onePointP
C
open_pairs
C
p_poly
C
ParseUtil
C
pipeInfo
C
PList
Class
PList
of lists of PNodes
C
PNode
Class
PNode
of nodes of polynomials
C
pointSet
C
Poly
C
poly_array_list
C
poly_list_node
C
poly_sort
C
poly_tree_node
C
PolyMinorProcessor
Class
PolyMinorProcessor
is derived from class
MinorProcessor
C
PolyMinorValue
Class
PolyMinorValue
is derived from
MinorValue
and can be used for representing values in a cache for sub-determinantes; see class
Cache
C
polyrec
C
PolySimple
C
PolysTestSuite
C
pProcs_s
C
proc_object
C
proc_singular
C
procinfo
C
procinfodata
C
proclevel
C
PUtilBase
C
PUtilCF
C
PUtilFactory
C
PUtilInt
C
PUtilVar
C
PythonCastDynamic
This class does conversion of Singular objects to python objects on runtime
C
PythonCastStatic
This template class does conversion of Singular objects to python objects on compile-time
C
PythonCastStatic< PythonObject::sequence_tag >
Template specialization for getting handling sequence
C
PythonInterpreter
This class initializes and finalized the python interpreter
►
C
PythonObject
This class defines an interface for calling PyObject from Singular
C
sequence_tag
C
Q_poly
C
RandomGenerator
►
C
Rational
C
rep
C
red_object
C
reduction_step
Makes on each
red_object
in a region a single_step
C
RefCounter
This class implements implements a refernce counter which we can use as a public base of objects managed by
C
resMatrixBase
Base class for sparse and dense u-Resultant computation
C
resMatrixDense
C
resMatrixSparse
C
resVector
C
REvaluation
Class to generate random evaluation points
C
RList
C
RNode
C
rootArranger
C
rootContainer
Complex root finder for univariate polynomials based on laguers algorithm
C
row_col_weight
C
row_list_entry
C
RTagList
C
RTagNode
C
RuleOld
structure of RuleOlds(i.e
C
s_buff
C
SArithBase
C
sattr
C
sBucket
C
SBucketFactory
SBucket Factory
C
sBucketPoly
C
SBucketWrapper
C
SchreyerSyzygyComputation
Computing syzygies after Schreyer
C
SchreyerSyzygyComputationFlags
Computation attribute storage
C
sConvertTypes
C
setID
C
si_link_extension
C
simple_reducer
C
SimplestTestSuite
C
simplex
Linear Programming / Linear Optimization using Simplex - Algorithm
C
skStrategy
C
sleftv
Class used for (list of) interpreter objects
C
slimgb_alg
C
slists
C
sLObject
C
sm_nrec
C
sm_prec
C
SModulFunctions
C
SObject
C
soptionStruct
C
sorted_pair_node
C
sparse_mat
C
sparse_number_mat
C
SparseRow
C
spectrum
C
spectrumPolyList
C
spectrumPolyNode
C
sro_am
C
sro_cp
C
sro_dp
C
sro_IS
C
sro_ISTemp
C
sro_ord
C
sro_ord.data
C
sro_syz
C
sro_syzcomp
C
sro_wp
C
sro_wp64
C
ssiInfo
C
ssyStrategy
C
sTObject
C
StoreFactors
Class to store factors that get removed during char set computation
C
Subexpr
C
SubMatrix
C
sValAssign
C
sValAssign_sys
C
sValCmd1
C
sValCmd2
C
sValCmd3
C
sValCmdM
C
sValCmdTab
C
term
C
TermNoroDataNode
C
TestDescription_CoeffsTestSuite_test_GF
C
TestDescription_CoeffsTestSuite_test_GF_toobig
C
TestDescription_CoeffsTestSuite_test_LC
C
TestDescription_CoeffsTestSuite_test_LR
C
TestDescription_CoeffsTestSuite_test_Q
C
TestDescription_CoeffsTestSuite_test_Q_special
C
TestDescription_CoeffsTestSuite_test_R
C
TestDescription_CoeffsTestSuite_test_Z
C
TestDescription_CoeffsTestSuite_test_Z2m2
C
TestDescription_CoeffsTestSuite_test_Z2m4
C
TestDescription_CoeffsTestSuite_test_Z2m8
C
TestDescription_CoeffsTestSuite_test_Zn3
C
TestDescription_CoeffsTestSuite_test_Zp101
C
TestDescription_PolysTestSuite_test_Q_Ext_a
C
TestDescription_PolysTestSuite_test_Q_Ext_b
C
TestDescription_PolysTestSuite_test_Q_Ext_Performance
C
TestDescription_PolysTestSuite_test_Q_Ext_s_t
C
TestDescription_PolysTestSuite_test_Q_Ext_s_t_NestedFractions
C
TestDescription_PolysTestSuite_test_QQ_t
C
TestDescription_PolysTestSuite_test_QQ_x_y_z
C
TestDescription_PolysTestSuite_test_QQ_x_y_z_ord_2_lp
C
TestDescription_PolysTestSuite_test_Z11_x_y_z
C
TestDescription_PolysTestSuite_test_Z13_t
C
TestDescription_PolysTestSuite_test_Z13_t_GF
C
TestDescription_PolysTestSuite_test_Z_17_Ext_a
C
TestDescription_SimplestTestSuite_testMyTest
C
TestDescription_SimplestTestSuite_testSIZEOFLONG
C
tgb_matrix
C
tgb_sparse_matrix
C
TopRed
C
TransExtInfo
Struct for passing initialization parameters to naInitChar
C
tropicalStrategy
C
uResultant
Base class for solving 0-dim poly systems using u-resultant
C
utypes
C
vandermonde
Vandermonde system solver for interpolating polynomials from their values
C
Variable
Factory's class for variables
C
Voice
C
weightOverflowException
C
YY_BUFFER_STATE
C
ZConeCompareDimensionFirst
C
ZnmInfo
Generated on Mon Mar 6 2017 11:17:45 by
doxygen 1.8.8
for
Singular debian-1:4.0.3-p3+ds-5~bpo8+1