Changeset 851746 in git


Ignore:
Timestamp:
May 29, 2024, 3:04:59 PM (7 weeks ago)
Author:
Frédéric Chapoton <chapoton@…>
Branches:
(u'spielwiese', '3720ae8bfcff4a4649ee98a15552089151d2d59b')
Children:
d735977bc4c759f0ed30bd5cdc57a5b212075497
Parents:
4fa496c5b814dbde0a905c54f0796301d03f6dc9
git-author:
Frédéric Chapoton <chapoton@unistra.fr>2024-05-29 15:04:59+02:00
git-committer:
GitHub <noreply@github.com>2024-05-29 15:04:59+02:00
Message:
fixing many typos + one encoding issue (#1215)
Files:
36 edited

Legend:

Unmodified
Added
Removed
  • IntegerProgramming/Buchberger.cc

    r4fa496 r851746  
    6060    // is a subset of the union of (first_iter.get_element()).head_support and
    6161    // (second_iter.get_element()).head_support. As only elements before
    62     // second_iter.get_element() are tested, we can stop iteraton as soon as
     62    // second_iter.get_element() are tested, we can stop iteration as soon as
    6363    // we reach this element.
    6464
  • IntegerProgramming/globals.h

    r4fa496 r851746  
    136136#define SECOND_CRITERION  16
    137137
    138 // The names of tehse criteria are chosen according to the criteria
     138// The names of these criteria are chosen according to the criteria
    139139// described in Gebauer/Moeller (except from the last).
    140140// The first one (relatively prime leading terms) is a local criterion
  • IntegerProgramming/list.h

    r4fa496 r851746  
    283283
    284284  list_iterator& extract_element();
    285   // Only resets pointers so that the refenced binomial is no longer found
    286   // when iterating over the list.
     285  // Only resets pointers so that the referenced binomial
     286  // is no longer found when iterating over the list.
    287287
    288288  list_iterator& mark_element_done();
  • doc/memory/OMALLOC.texi

    r4fa496 r851746  
    7979(e.g., to store its size) then the total overhead of the
    8080memory manager could sum up to 25% of the overall used memory, which is
    81 an unnacceptable waste of memory.
     81an unacceptable waste of memory.
    8282@item (4) the memory manager must have a clean API and it must support debugging
    8383The API of the memory manager must be similar to the standard API's of
  • doc/singular.dic

    r4fa496 r851746  
    340340groebner
    341341groupid
    342 Gröbner
     342Gröbner
    343343GTZ
    344344GTZmod
     
    503503krueger
    504504Krull
    505 Krüger
     505KrÃŒger
    506506KSpencerKernel
    507507Kxt
     
    861861rtimer
    862862Ruediger
    863 Rüdiger
     863RÃŒdiger
    864864rvalue
    865865rvar
     
    874874Schimoyama
    875875Schoenemann
    876 Schönemann
     876Schönemann
    877877Schreyer
    878878Schreyer's
  • doc/usercard.tex

    r4fa496 r851746  
    419419                                return {\it int\/}-jet of {\it expression}.
    420420                                Return weighted {\it int\/}-jet if {\it
    421                                 intvec\/} is specifified.\cr
     421                                intvec\/} is specified.\cr
    422422\endsec
    423423
  • dox/Doxyfile.html.all

    r4fa496 r851746  
    11171117# created by doxygen. Using this option one can overrule certain style aspects.
    11181118# This is preferred over using HTML_STYLESHEET since it does not replace the
    1119 # standard style sheet and is therefor more robust against future updates.
     1119# standard style sheet and is therefore more robust against future updates.
    11201120# Doxygen will copy the style sheet file to the output directory. For an example
    11211121# see the documentation.
  • dox/Doxyfile.in

    r4fa496 r851746  
    10951095# created by doxygen. Using this option one can overrule certain style aspects.
    10961096# This is preferred over using HTML_STYLESHEET since it does not replace the
    1097 # standard style sheet and is therefor more robust against future updates.
     1097# standard style sheet and is therefore more robust against future updates.
    10981098# Doxygen will copy the style sheet file to the output directory. For an example
    10991099# see the documentation.
  • dox/Doxyfile.in1

    r4fa496 r851746  
    10751075# created by doxygen. Using this option one can overrule certain style aspects.
    10761076# This is preferred over using HTML_STYLESHEET since it does not replace the
    1077 # standard style sheet and is therefor more robust against future updates.
     1077# standard style sheet and is therefore more robust against future updates.
    10781078# Doxygen will copy the style sheet file to the output directory. For an example
    10791079# see the documentation.
  • emacs/cmpl.pl

    r4fa496 r851746  
    7575          $node =~ s/([\"#\\])/\\\1/g;    #'
    7676          $rawNode =~ s/([\"#\\])/\\\1/g; #'
    77           # only the first occurence of $node is inserted to @string!
     77          # only the first occurrence of $node is inserted to @string!
    7878          # all subsequent entries are discarded.
    7979          push @strings, "(\"$node\" . \"$rawNode\")" if $node ne $prev;
  • emacs/hlp-cmpl.el

    r4fa496 r851746  
    421421    ("calculateI" . "calculateI.          (line   6")
    422422    ("cancelunit, option" . "option.              (line 146")
    423     ("canoncial form" . "PtoCrep.             (line  23")
     423    ("canonical form" . "PtoCrep.             (line  23")
    424424    ("canonical" . "grobcov.             (line 121")
    425425    ("canonical form" . "DifConsLCSets.       (line  15")
  • emacs/singular.el

    r4fa496 r851746  
    19531953            (cons (singular-section-create simple-section type start end) nil))
    19541954
    1955     ;; we should not forget to pop off our auxilliary cons-cell
     1955    ;; we should not forget to pop off our auxiliary cons-cell
    19561956    (cdr sections)))
    19571957
     
    19591959  "Apply FUNC to each section in SECTIONS, and make a list of the results.
    19601960If optional argument TYPE-FILTER is non-nil it should be a list of section
    1961 types.  FUNC is then applied only to those sections with type occuring in
     1961types.  FUNC is then applied only to those sections with type occurring in
    19621962TYPE-FILTER.  If in addition optional argument NEGATE-FILTER is non-nil
    1963 FUNC is applied only to those sections with type not occuring in
     1963FUNC is applied only to those sections with type not occurring in
    19641964TYPE-FILTER.
    19651965
     
    24082408;;
    24092409;; To show some online help, the online help manual has to be available, of
    2410 ;; course.  There is a number of possibilites for the user to set the file
     2410;; course.  There is a number of possibilities for the user to set the file
    24112411;; name of the manual explicitly, as described in the documentation string
    24122412;; to `singular-help'.  But in general the file name should be recognized
     
    26632663
    26642664(defvar singular-help-topics-alist nil
    2665   "An alist containg all Singular help topics to complete.
     2665  "An alist containing all Singular help topics to complete.
    26662666
    26672667This variable is buffer-local.")
     
    28252825`singular-scan-header-pre-output-filter' searches the Singular header for
    28262826the path and sets this variable to the corresponding value.
    2827 Its value is redifined on every start of Singular.
     2827Its value is redefined on every start of Singular.
    28282828
    28292829This variable is buffer-local.")
     
    37533753  ;; functions.  NOT READY [should be moved to the respective foldings]
    37543754  (make-local-variable 'singular-pre-input-filter-functions)
    3755   ;;make-local-hook is obsolete in emcas >=21.1
     3755  ;;make-local-hook is obsolete in emacs >=21.1
    37563756  ;;(make-local-hook 'singular-post-input-filter-functions)
    37573757  (make-local-variable 'singular-pre-output-filter-functions)
     
    39843984
    39853985Deletes any old processes running in that buffer.
    3986 Removes any empty string in SWITCHES befor passing to Singular.
     3986Removes any empty string in SWITCHES before passing to Singular.
    39873987Moves point to the end of BUFFER.
    39883988Initializes all important markers and the simple sections.
     
    41824182
    41834183If called interactively, the user is asked in the minibuffer area for an
    4184 existing executable (with or without path), an exisiting directory or nil
     4184existing executable (with or without path), an existing directory or nil
    41854185(if non-nil, sets the buffers default directory to this directory), the
    41864186complete command line arguments to be passed to Singular (as a single
  • factory/NTLconvert.cc

    r4fa496 r851746  
    332332    // Compute the canonicalform coefficient by coefficient,
    333333    // bigone summarizes the result.
    334     // In constrast to the more general conversion to ZZpX
     334    // In contrast to the more general conversion to ZZpX
    335335    // the only possible coefficients are zero
    336336    // and one yielding the following simplified loop
  • factory/canonicalform.cc

    r4fa496 r851746  
    15361536 * Both operands should have coefficients from the same base domain.
    15371537 *
    1538  * The scheme how both operators are implemented is allmost the
     1538 * The scheme how both operators are implemented is almost the
    15391539 * same as for the assignment operators (check for immediates,
    15401540 * then check levels, then check levelcoeffs, then call the
  • factory/gfops.h

    r4fa496 r851746  
    219219//}}}
    220220
    221 //{{{ exponentation
     221//{{{ exponentiation
    222222inline int gf_power ( int a, int n )
    223223{
  • factory/templates/ftmpl_afactor.cc

    r4fa496 r851746  
    1818int operator== ( const AFactor<T> &f1, const AFactor<T> &f2 )
    1919{
    20     return (f1.exp() == f2.exp()) && (f1.factor() == f2.factor()) && (f1.minpoly() == f2.minpoly()); //minpoly comparision may not be enough but checking the fields they define are equal
     20    return (f1.exp() == f2.exp()) && (f1.factor() == f2.factor()) && (f1.minpoly() == f2.minpoly()); //minpoly comparison may not be enough but checking the fields they define are equal
    2121}
    2222
  • gfanlib/gfanlib_circuittableint.h

    r4fa496 r851746  
    245245};
    246246
    247 inline CircuitTableInt32 CircuitTableInt32::Double::castToSingle()const//casts and checks precission
     247inline CircuitTableInt32 CircuitTableInt32::Double::castToSingle()const//casts and checks precision
    248248{
    249249        if(v>=0x7fffffff || -v>=0x7fffffff) throw MVMachineIntegerOverflow;
  • gfanlib/gfanlib_matrix.h

    r4fa496 r851746  
    563563  /**
    564564     Computes a reduced row echelon form from a row echelon form. In
    565      Groebner basis terms this is the same as tranforming a minimal
     565     Groebner basis terms this is the same as transforming a minimal
    566566     Groebner basis to a reduced one except that we do not force
    567567     pivots to be 1 unless the scalePivotsToOne parameter is set.
  • gfanlib/gfanlib_paralleltraverser.cpp

    r4fa496 r851746  
    487487
    488488
    489   // Requst a job from another thread. The return value is NULL if all
     489  // Request a job from another thread. The return value is NULL if all
    490490  // jobs are done.
    491491  Job*  getJob( void )
  • gfanlib/gfanlib_traversal.cpp

    r4fa496 r851746  
    352352                  lastNumberOfEdges=boundary.size();
    353353
    354 //                  target.process(traverser);//Postponed until extrem rays have been computed
     354//                  target.process(traverser);//Postponed until extreme rays have been computed
    355355                  ZMatrix extremeRays=traverser.refToPolyhedralCone().extremeRays(&linealitySpaceGenerators);
    356356                  target.process(traverser);
  • gfanlib/gfanlib_tropicalhomotopy.h

    r4fa496 r851746  
    2020
    2121/**
    22  * We identify six possibly different types needed with possibly varying precission:
     22 * We identify six possibly different types needed with possibly varying precision:
    2323 * 1) The entries of the circuits (or possibly their packed representation)
    2424 * 2) The mixed volume contribution of a single cell. This is obtained from an entry of a circuit and therefore can be represented by the above type.
     
    3535 *  we assume that type 4 is the same as 1 and 2. This is reasonable, as we need some bound to make type 6 efficient.
    3636 *  we use a special (longer) type for 5, as that allows to do overflow checks at the end, assuming some bound on the target.
    37  *  In 6, we observe that there is no accumulation taking place. Moreover, with the assumption that 4 and 1 are the same, we only need a type with double precission to do the comparisons here, and now overflow check will be required.
     37 *  In 6, we observe that there is no accumulation taking place. Moreover, with the assumption that 4 and 1 are the same, we only need a type with double precision to do the comparisons here, and now overflow check will be required.
    3838 *
    3939 *
  • gfanlib/gfanlib_zcone.cpp

    r4fa496 r851746  
    762762          inequalities=LpSolver::fastNormals(inequalities2);
    763763          goto noFallBack;
    764         fallBack://alternativ (disabled)
     764        fallBack://alternative (disabled)
    765765          lpSolver.removeRedundantRows(inequalities,equations,true);
    766766        noFallBack:;
     
    11281128      /* At this point we know lineality space, implied equations and
    11291129         also inequalities for the ray. To construct a vector on the
    1130          ray which is stable under (or independant of) angle and
     1130         ray which is stable under (or independent of) angle and
    11311131         linearity preserving transformation we find the dimension 1
    11321132         subspace orthogonal to the implied equations and the
  • gfanlib/gfanlib_zcone.h

    r4fa496 r851746  
    204204
    205205     /**
    206       * Constructor for polyhedral cone with no inequalities or equations. Tthat is, the full space of some dimension.
     206      * Constructor for polyhedral cone with no inequalities or equations. That is, the full space of some dimension.
    207207      */
    208208     ZCone(int ambientDimension=0);
     
    338338    /**
    339339       For a ray (dim=linealitydim +1)
    340        the quotent lattice described in quotientLatticeBasis() is
     340       the quotient lattice described in quotientLatticeBasis() is
    341341       isomorphic to Z. In fact the ray intersected with Z^n modulo the
    342342       lineality space intersected with Z^n is a semigroup generated by
  • libpolys/libpolys.dox

    r4fa496 r851746  
    55
    66
    7  This is a (mostly) separate package containing the definition and implementaion for
     7 This is a (mostly) separate package containing the definition and implementation for
    88 Singular data structures, such as,
    99 numbers in coefficient rings and fields (\ref libpolys_coeffs_page),
  • m4/ax_compute_relative_paths.m4

    r4fa496 r851746  
    140140dnl to $RESULT.
    141141dnl
    142 dnl For instace:
     142dnl For instance:
    143143dnl    first_path=/somewhere/on/my/disk/bin
    144144dnl    second_path=/somewhere/on
  • m4/ax_prefix_config_h.m4

    r4fa496 r851746  
    2828#   Your configure.ac script should contain both macros in this order, and
    2929#   unlike the earlier variations of this prefix-macro it is okay to place
    30 #   the AX_PREFIX_CONFIG_H call before the AC_OUTPUT invokation.
     30#   the AX_PREFIX_CONFIG_H call before the AC_OUTPUT invocation.
    3131#
    3232#   Example:
  • m4/ax_prog_cc_for_build.m4

    r4fa496 r851746  
    142142
    143143dnl restore global variables ac_ext, ac_cpp, ac_compile,
    144 dnl ac_link, ac_compiler_gnu (dependant on the current
     144dnl ac_link, ac_compiler_gnu (dependent on the current
    145145dnl language after popping):
    146146AC_LANG_POP([C])
  • m4/ax_prog_cxx_for_build.m4

    r4fa496 r851746  
    104104popdef([ac_cv_prog_CXXCPP])dnl
    105105
    106 dnl restore global variables (dependant on the current
     106dnl restore global variables (dependent on the current
    107107dnl language after popping):
    108108AC_LANG_POP([C++])
  • m4/google-perftools.m4

    r4fa496 r851746  
    1616
    1717dnl
    18 dnl Autoconf support for linking with google's performace code
     18dnl Autoconf support for linking with google's performance code
    1919dnl
    2020
  • m4/options.m4

    r4fa496 r851746  
    2828if test "x$ENABLE_PLURAL" != xno; then
    2929  AC_DEFINE(HAVE_PLURAL,[1],[Enable non-commutative subsystem])
    30   #TODO make a seperate switch
     30  #TODO make a separate switch
    3131  AC_DEFINE(HAVE_SHIFTBBA,[1],[Enable letterplace])
    3232fi
  • omalloc/configure.ac

    r4fa496 r851746  
    205205  AC_DEFINE_UNQUOTED(SIZEOF_SYSTEM_PAGE, $ac_cv_pagesize, "Page-size of the build-system")
    206206else
    207 AC_MSG_ERROR([need sytem page to be of size 4096 or 8192, but is $ac_cv_pagesize])
     207AC_MSG_ERROR([need system page to be of size 4096 or 8192, but is $ac_cv_pagesize])
    208208fi
    209209
     
    261261fi
    262262if test "${with_external_config_c+set}" = set; then
    263     AC_DEFINE(OM_HAVE_EXTERNAL_CONFIG_C,1,"Wether we have an external config.c")
     263    AC_DEFINE(OM_HAVE_EXTERNAL_CONFIG_C,1,"Whether we have an external config.c")
    264264    EXTERNAL_CONFIG_SOURCE=${with_external_config_c}
    265265fi
  • omalloc/omDebugTrack.c

    r4fa496 r851746  
    438438  else
    439439  {
    440     /* Still need to check wheter we need to get rid of SpecBin */
     440    /* Still need to check whether we need to get rid of SpecBin */
    441441    if (bin->last_page == NULL && ! omIsStaticTrackBin(bin))
    442442      omDeleteSpecBin(&bin);
  • omalloc/omError.c

    r4fa496 r851746  
    3333  {omError_FalseAddrOrMemoryCorrupted,  "omError_FalseAddrOrMemoryCorrupted",  "addr not as returned by omalloc or memory corrupted", },
    3434  {omError_WrongSize,                   "omError_WrongSize",                   "wrong size specification of addr"},
    35   {omError_FreedAddr,                   "omError_FreedAddr",                   "addr had previosuly been freed"},
    36   {omError_FreedAddrOrMemoryCorrupted,  "omError_FreedAddrOrMemoryCorrupted",  "addr had previosuly been freed  or memory corrupted"},
     35  {omError_FreedAddr,                   "omError_FreedAddr",                   "addr had previously been freed"},
     36  {omError_FreedAddrOrMemoryCorrupted,  "omError_FreedAddrOrMemoryCorrupted",  "addr had previously been freed  or memory corrupted"},
    3737  {omError_WrongBin,                    "omError_WrongBin",                    "addr is not from given Bin"},
    3838  {omError_UnknownBin,                  "omError_UnknownBin",                  "given Bin is unknown"},
  • ppcc/autosetup/autosetup

    r4fa496 r851746  
    13121312# Module which provides common text formatting
    13131313
    1314 # This is designed for documenation which looks like:
     1314# This is designed for documentation which looks like:
    13151315# code {...}
    13161316# or
  • standalone.test/tt.cc

    r4fa496 r851746  
    3232  poly p1=p_ISet(1,R);
    3333
    34   // create tthe polynomial 2*x^3*z^2
     34  // create the polynomial 2*x^3*z^2
    3535  poly p2=p_ISet(2,R);
    3636  pSetExp(p2,1,3);
  • templates/test.h

    r4fa496 r851746  
    3333   * This is function 2.
    3434   *
    35    * @params <- We would prefere all parameters to be here...
     35   * @params <- We would prefer all parameters to be here...
    3636   *
    3737   * @param []
Note: See TracChangeset for help on using the changeset viewer.