cannam@167: (*
cannam@167:  * Copyright (c) 1997-1999 Massachusetts Institute of Technology
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  *)
cannam@167: 
cannam@167: (* 
cannam@167:  * The LittleSimplifier module implements a subset of the simplifications
cannam@167:  * of the AlgSimp module.  These simplifications can be executed
cannam@167:  * quickly here, while they would take a long time using the heavy
cannam@167:  * machinery of AlgSimp.  
cannam@167:  * 
cannam@167:  * For example, 0 * x is simplified to 0 tout court by the LittleSimplifier.
cannam@167:  * On the other hand, AlgSimp would first simplify x, generating lots
cannam@167:  * of common subexpressions, storing them in a table etc, just to
cannam@167:  * discard all the work later.  Similarly, the LittleSimplifier
cannam@167:  * reduces the constant FFT in Rader's algorithm to a constant sequence.
cannam@167:  *)
cannam@167: 
cannam@167: open Expr
cannam@167: 
cannam@167: let rec makeNum = function
cannam@167:   | n -> Num n
cannam@167: 
cannam@167: and makeUminus = function
cannam@167:   | Uminus a -> a 
cannam@167:   | Num a -> makeNum (Number.negate a)
cannam@167:   | a -> Uminus a
cannam@167: 
cannam@167: and makeTimes = function
cannam@167:   | (Num a, Num b) -> makeNum (Number.mul a b)
cannam@167:   | (Num a, Times (Num b, c)) -> makeTimes (makeNum (Number.mul a b), c)
cannam@167:   | (Num a, b) when Number.is_zero a -> makeNum (Number.zero)
cannam@167:   | (Num a, b) when Number.is_one a -> b
cannam@167:   | (Num a, b) when Number.is_mone a -> makeUminus b
cannam@167:   | (Num a, Uminus b) -> Times (makeUminus (Num a), b)
cannam@167:   | (a, (Num b as b')) -> makeTimes (b', a)
cannam@167:   | (a, b) -> Times (a, b)
cannam@167: 
cannam@167: and makePlus l = 
cannam@167:   let rec reduceSum x = match x with
cannam@167:     [] -> []
cannam@167:   | [Num a] -> if Number.is_zero a then [] else x
cannam@167:   | (Num a) :: (Num b) :: c -> 
cannam@167:       reduceSum ((makeNum (Number.add a b)) :: c)
cannam@167:   | ((Num _) as a') :: b :: c -> b :: reduceSum (a' :: c)
cannam@167:   | a :: s -> a :: reduceSum s
cannam@167: 
cannam@167:   in match reduceSum l with
cannam@167:     [] -> makeNum (Number.zero)
cannam@167:   | [a] -> a 
cannam@167:   | [a; b] when a == b -> makeTimes (Num Number.two, a)
cannam@167:   | [Times (Num a, b); Times (Num c, d)] when b == d ->
cannam@167:       makeTimes (makePlus [Num a; Num c], b)
cannam@167:   | a -> Plus a
cannam@167: