source: git/libfac/factor.h @ be1d41

spielwiese
Last change on this file since be1d41 was b6bd55, checked in by Hans Schönemann <hannes@…>, 23 years ago
*hannes: added newfactoras git-svn-id: file:///usr/local/Singular/svn/trunk@5492 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 2.8 KB
Line 
1// Header file for libfac.a
2// Created by -- makeheader --
3///////////////////////////////////////
4#ifndef FACTOR_H
5#define FACTOR_H
6
7#include <factory.h>
8
9// Set this to a nonzero value to interrupt the computation
10extern int libfac_interruptflag;
11
12// some values you can ask for:
13extern const char * libfac_name;
14extern const char * libfac_version;
15extern const char * libfac_date;
16extern const char * libfac_author;
17
18//// Note: second argument for Factorize is for internal use only.
19CFFList Factorize( const CanonicalForm & F, int is_SqrFree=0 ) ;
20CFFList newfactoras( const CanonicalForm & f, const CFList & as, int success);
21
22//// Note: InternalSqrFree does only the work needed for factorization.
23// CFFList SqrFree( const CanonicalForm & f ) ;
24
25typedef List<CFList> ListCFList;
26typedef List<int> IntList ;
27typedef ListIterator<int> IntListIterator ;
28typedef List<Variable> Varlist;
29typedef ListIterator<Variable> VarlistIterator;
30
31////////////////////////////////////////
32/// from charsets:
33
34class PremForm {
35public:
36  CFList FS1;
37  CFList FS2;
38  inline PremForm& operator=( const PremForm&  value ){
39    if ( this != &value ){
40      FS1 = value.FS1;
41      FS2 = value.FS2;
42    }
43    return *this;
44  }
45};
46
47CanonicalForm  Prem( const CanonicalForm &f, const CanonicalForm &g );
48CanonicalForm  Prem( const CanonicalForm &f, const CFList &L );
49CFList         Prem( const CFList &AS, const CFList &L );
50CFList     MCharSetN( const CFList &PS, PremForm & Remembern );
51ListCFList IrrCharSeries( const CFList &PS, int opt=0 );
52
53// the next three give you a heuristically optimal reorderd list of the
54// variables. For internal and external (e.g. Singular/Macaulay2) library use.
55// This is really experimental!
56// See the comments in reorder.cc.
57//
58// this gives you a heuristically optimal ordering for the ring variables
59// if you use the irreducible characteristic series.
60Varlist  neworder( const CFList & PolyList );
61// the same as neworder(...) only returning a list of CanonicalForm 's
62// (i.e. the variables as CanonicalForms)
63CFList   newordercf(const CFList & PolyList );
64// the same as neworder(...) only returning a list of int 's (i.e. the levels)
65IntList  neworderint(const CFList & PolyList );
66
67// for library internal use only:
68// next function reorders the variables in PS:
69// a code segment to use:
70// ...
71// #include <tmpl_inst.h> // for typedef's
72// CFList PS= <setup-your-list-of-CanonicalForms>;
73// Varlist betterorder= neworder(PS);
74// PS= reorder(betterorder,PS); // reorder variables in PS from oldorder
75//                                 to betterorder
76// ListCFList Q= IrrCharSeries( PS );
77// Q= reorder(betterorder,Q);   // revert ordering to oldorder
78//
79CFList reorder( const Varlist & betterorder, const CFList & PS);
80CFFList reorder( const Varlist & betterorder, const CFFList & PS);
81ListCFList reorder(const Varlist & betterorder, const ListCFList & Q);
82
83
84#endif /* FACTOR_H */
Note: See TracBrowser for help on using the repository browser.