- i -

• Ideal() : Frobby::Ideal , Ideal
• idealBegin() : Frobby::IdealConsumer , IrreducibleIdealDecoder , LibIdealConsumer , LibIdealsConsumer
• IdealConsolidator() : IdealConsolidator
• idealEnd() : Frobby::IdealConsumer , IrreducibleIdealDecoder
• IdealFacade() : IdealFacade
• idealIsMinimal() : CommonParams
• idealNotSquareFree() : InputConsumer
• IdealTree() : IdealTree
• IdealWriter() : IO::IdealWriter
• independenceSplit() : HilbertStrategy , MsmStrategy
• initialIdealIsWeaklyGeneric() : SatBinomIdeal
• initialize() : Term , TermTranslator
• initializeEnumeration() : ScarfHilbertAlgorithm
• innerSlice() : MsmSlice , Slice
• inPlaceGenSplit() : EulerState
• inPlaceStdSplit() : EulerState
• inPlane() : Plane , TriPlane
• InputConsumer() : InputConsumer
• insert() : BigIdeal , Ideal , RawSquareFreeIdeal , SatBinomIdeal , SquareFreeIdeal
• insert_equal() : __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
• insert_equal_noresize() : __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
• insert_unique() : __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
• insert_unique_noresize() : __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
• insertIdentity() : RawSquareFreeIdeal , SquareFreeIdeal
• insertNonMultiples() : Ideal , RawSquareFreeIdeal
• insertReminimize() : Ideal
• IntegerParameter() : IntegerParameter
• InternalFrobbyException() : InternalFrobbyException
• intersect() : IntersectFacade
• IntersectFacade() : IntersectFacade
• IntersectionAction() : IntersectionAction
• inverseProject() : Projection
• inverseProjectVar() : Projection
• IOFacade() : IOFacade
• IOHandlerCommon() : IO::IOHandlerCommon
• IOHandlerImpl() : IO::IOHandlerImpl
• IOParameters() : IOParameters
• irrdecom_xx_yy_xz_yz() : IdealFactory
• IrreducibleDecomAction() : IrreducibleDecomAction
• IrreducibleIdealDecoder() : IrreducibleIdealDecoder
• IrreducibleIdealSplitter() : IrreducibleIdealSplitter
• is22() : Plane
• isDominating() : SatBinomIdeal
• isEmpty() : Arena::Block , Arena
• isFirstComputation() : SliceFacade
• isFlat() : Plane
• isGenerator() : Neighbor , SatBinomIdeal
• isGeneric() : SatBinomIdeal
• isIdentity() : Term
• isInBlock() : Arena::Block
• isIncomparable() : Ideal
• isIndependentIncludingMaybe() : SizeMaxIndepSetAlg
• isInterior() : GrobLat , SatBinomIdeal
• isInteriorEdge() : SatBinomIdeal
• isIrreducible() : Ideal
• isLabelSplit() : LabelSplit , SplitStrategy , SplitStrategyCommon
• isLine() : TriPlane
• isMinimallyGenerated() : Ideal , Minimizer , RawSquareFreeIdeal
• isNull() : Arena::Block , DataType
• isParallel() : TriPlane
• isParallelogram() : Mlfb
• isPivot() : Plane
• isPivotSplit() : PivotSplit , SplitStrategy , SplitStrategyCommon
• isPointFreeBody() : GrobLat , SatBinomIdeal
• isPrintingActions() : Facade
• isRedundant() : TreeNode
• isSidePivot() : Plane
• isSpecial() : Neighbor
• isSquareFree() : Ideal , Term
• isStronglyGeneric() : Ideal
• isSum() : GrobLat
• isTerminatingEdge() : SatBinomIdeal
• isValid() : Neighbor , RawSquareFreeIdeal
• isValidLatticeFormat() : IOFacade
• isValidMonomialIdealFormat() : IOFacade
• isWeaklyGeneric() : Ideal
• isZero() : Neighbor
• isZeroIdeal() : Ideal
• iterator() : RawSquareFreeIdeal::iterator