[BACK]Return to dr.sm1 CVS log [TXT][DIR] Up to [local] / OpenXM / src / kan96xx / Kan

Diff for /OpenXM/src/kan96xx/Kan/dr.sm1 between version 1.9 and 1.24

version 1.9, 2002/02/12 08:54:55 version 1.24, 2003/09/13 13:14:03
Line 1 
Line 1 
 % $OpenXM: OpenXM/src/kan96xx/Kan/dr.sm1,v 1.8 2002/02/09 06:21:02 takayama Exp $  % $OpenXM: OpenXM/src/kan96xx/Kan/dr.sm1,v 1.23 2003/09/12 02:52:50 takayama Exp $
 %% dr.sm1 (Define Ring) 1994/9/25, 26  %% dr.sm1 (Define Ring) 1994/9/25, 26
 %% This file is error clean.  %% This file is error clean.
   
Line 2506  newline
Line 2506  newline
 [(ord_w)  [(ord_w)
  [(ff [v1 w1 v2 w2 ... vm wm] ord_w d)   [(ff [v1 w1 v2 w2 ... vm wm] ord_w d)
   (poly ff; string v1; integer w1; ...)    (poly ff; string v1; integer w1; ...)
   (order of ff by the weight vector [w1 w2 ...])    (order of the initial of ff by the weight vector [w1 w2 ...])
   (Example: [(x,y) ring_of_polynomials 0] define_ring )    (Example: [(x,y) ring_of_polynomials 0] define_ring )
   (          (x^2 y^3-x). [(x) 2 (y) 1] ord_w ::)    (          (x^2 y^3-x). [(x) 2 (y) 1] ord_w ::)
  ]   ]
Line 2534  newline
Line 2534  newline
   arg1    arg1
 } def  } def
   
   [(ord_w_all)
    [(ff [v1 w1 v2 w2 ... vm wm] ord_w d)
     (poly ff; string v1; integer w1; ...)
     (order of ff by the weight vector [w1 w2 ...])
     (Example: [(x,y,t) ring_of_polynomials 0] define_ring )
     (          (x^2 y^3-x-t). [(t) 1 ] ord_w_all ::)
    ]
   ] putUsages
   /ord_w_all {
     /arg2 set /arg1 set
     [/ord_w_all-in /fff /fff-in /www /rrr /iii /ddd /zzz /ddd-tmp] pushVariables
     [
       /fff arg1 def
       /www arg2 def
       fff (0). eq { /ddd -intInfinity def /ord_w_all.LLL goto} { } ifelse
       /ddd -intInfinity def
       fff (ring) dc /rrr set
       /zzz (0) rrr ,, def
       fff init /fff-in set
       fff fff-in sub /fff set
       {
        /ddd-tmp 0 def
        0 2 www length 1 sub {
          /iii set
          fff-in << www iii get rrr ,, >> degree
          << www iii 1 add get >> mul
          ddd-tmp add /ddd-tmp set
        } for
        ddd-tmp ddd gt { /ddd ddd-tmp def }  {  } ifelse
        fff zzz eq { exit } {  } ifelse
        fff init /fff-in set
        fff fff-in sub /fff set
       } loop
       /ord_w_all.LLL
       /arg1 ddd def
     ] pop
     popVariables
     arg1
   } def
   
 [(laplace0)  [(laplace0)
  [   [
  (f [v1 ... vn] laplace0 g)   (f [v1 ... vn] laplace0 g)
Line 3282  newline
Line 3322  newline
 ]] putUsages  ]] putUsages
   
 /cancelCoeff {  /cancelCoeff {
     /arg1 set
     [(reduceContent) arg1] gbext 0 get
   } def
   /cancelCoeff_org {
  /arg1 set   /arg1 set
  [/in-cancelCoeff /ff /gg /dd /dd2] pushVariables   [/in-cancelCoeff /ff /gg /dd /dd2] pushVariables
  [  /ff arg1 def   [  /ff arg1 def
Line 3644  $ [ff ff] fromVectors :: $ 
Line 3688  $ [ff ff] fromVectors :: $ 
   (If the variable named << a >> is bounded to a value,)    (If the variable named << a >> is bounded to a value,)
   (it returns 1 else it returns 0.)    (it returns 1 else it returns 0.)
   $Example: (hoge) boundp ::$    $Example: (hoge) boundp ::$
   ]] putUsages
   [(isSubstr)
    [
     (s1 s2 isSubstr pos)
     (If s1 is a substring of s2, isSubstr returns the position in s2 from which)
     (s1 is contained in s2.)
     (If s1 is not a substring of s2, then isSubstr returns -1.)
    ]
   ] putUsages
   /isSubstr {
     /arg2 set /arg1 set
     [/in-isSubstr /s1 /s2 /i1 /i2 /n1 /n2
      /ans /flg
     ]  pushVariables
     [
       /s1 arg1 def
       /s2 arg2 def
       s1 (array) dc /s1 set
       s2 (array) dc /s2 set
       /n1 s1 length def
       /n2 s2 length def
       /ans -1 def
       0 1 n2 n1 sub {
         /i2 set
         /flg 1 def
         0 1 n1 1 sub {
           /i1 set
           s1 i1 get s2 i2 i1 add get eq {
           } {
             /flg 0 def exit
           } ifelse
         } for
         flg {
           /ans i2 def
           /isSubstr.L2 goto
         } { /ans -1 def } ifelse
       } for
       /isSubstr.L2
       /arg1 ans def
     ] pop
     popVariables
     arg1
   } def
   
   [(execve)
    [
      (command execve)
      ([arg0 arg1 arg2 ...] execve )
      (It executes the command by the system call execve.)
      (cf. system, forkExec)
    ]
   ] putUsages
   
   /execve {
     /execve.arg set
     [(forkExec) execve.arg [ ] 1] extension
   } def
   
   [(beginEcart)
    [
      (beginEcart)
      (Set the environments for the ecart division algorithm.)
    ]
   ] putUsages
   
   /ecart.debug_reduction1 0 def
   /beginEcart {
     (red@) (ecart) switch_function
     [(Ecart) 1] system_variable
     [(CheckHomogenization) 0] system_variable
     [(ReduceLowerTerms) 0] system_variable
     [(AutoReduce) 0] system_variable
     [(EcartAutomaticHomogenization) 0] system_variable
     ecart.debug_reduction1 {
       (red@) (debug) switch_function
     } {  } ifelse
   } def
   
   [(endEcart)
    [
      (endEcart)
      (End of using the ecart division algorithm.)
    ]
   ] putUsages
   
   /endEcart {
     (red@) (standard) switch_function
     [(Ecart) 0] system_variable
     [(degreeShift) (reset)] homogenize pop
   } def
   
   /ord_ws_all {
     /arg2 set /arg1 set
     [(ord_ws_all) arg1 arg2] gbext
   } def
   [(ord_ws_all)
    [
      (fv wv ord_ws_all degree)
      (  ord_ws_all returns the ord with respect to the weight vector wv.)
      $Example: [(x,y) ring_of_differential_operators 0] define_ring  $
      $        (Dx^2+x*Dx*Dy+2). [(Dx) 1 (Dy) 1] weightv ord_ws_all ::  $
      (  )
      (fv [wv shiftv] ord_ws_all degree)
      (  ord_ws_all returns the ord with respect to the weight vector wv and)
      (  the shift vector shiftv.)
      $Example: [(x,y) ring_of_differential_operators 0] define_ring  $
      $        [(Dx^2+x*Dx*Dy+2). (Dx).] [[(Dx) 1 (Dy) 1] weightv [0 2]] ord_ws_all ::$
      (  )
      (cf: init, gbext.   Obsolete: ord_w, ord_w_all)
    ]
   ] putUsages
   
   [(newVector)
    [( n newVector vec)
   ]] putUsages
   /newVector {
     /arg1 set
     [/in-newVector /n] pushVariables
     [
       /n arg1 def
       [(newVector) n] extension /arg1 set
     ] pop
     popVariables
     arg1
   } def
   
   [(newMatrix)
    [( [m n] newMatrix mat)
   ]] putUsages
   /newMatrix {
     /arg1 set
     [/in-newMatrix /n] pushVariables
     [
       /n arg1 def
       [(newMatrix) n 0 get n 1 get] extension /arg1 set
     ] pop
     popVariables
     arg1
   } def
   
   /usages {
     /arg1 set
     [/name /flag /n /k /slist /m /i /sss] pushVariables
     [
       /name arg1 def
       /flag true def
   
    %BUG: should use regular expression in a future.
    name tag 1 eq {
      @.usages { 0 get } map shell { (, ) nl } map /sss set
    } {
   
       /sss [ ] def
      @.usages length /n set
      0 1 << n 1 sub >>
      {
         /k set
         name << @.usages k get 0 get >> eq
         {
           /slist @.usages k get 1 get def
           /m slist length def
           0 1 << m 1 sub >> {
             /i set
             sss slist i get append nl append /sss set
           } for
           /flag false def
         }
         { }
         ifelse
      } for
   
      %BUG:  cannot get usages of primitives.
      flag
      {name Usage  /sss [(Usage of ) name ( could not obtained.) nl ] def}
      { }
      ifelse
    } ifelse
      /arg1 sss cat def
      ] pop
      popVariables
      arg1
   } def
   [(usages)
    [(key usages usages-as-a-string)
     (num usages list-of-key-words)
 ]] putUsages  ]] putUsages
   
 ;  ;
Legend:
Removed from v.1.9  
changed lines
  Added in v.1.24
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>