compiler.cfg.representations.selection: removing 10^ in favor of 10^.

diff --git a/basis/compiler/cfg/representations/selection/selection.factor b/basis/compiler/cfg/representations/selection/selection.factor
index 3d435edc0926ae5d00e3ce6fdc8197d7f3b71e1b..45f7a6d77ffab6350fa1c5c8303905f53586de7d 100644 (file)
--- a/basis/compiler/cfg/representations/selection/selection.factor
+++ b/basis/compiler/cfg/representations/selection/selection.factor
@@ -1,7 +1,8 @@
 ! Copyright (C) 2010 Slava Pestov.
 ! See http://factorcode.org/license.txt for BSD license.
 USING: accessors arrays assocs byte-arrays combinators
-disjoint-sets fry kernel locals math namespaces sequences sets
+disjoint-sets fry kernel locals math math.functions
+namespaces sequences sets
 compiler.cfg
 compiler.cfg.instructions
 compiler.cfg.loop-detection
@@ -73,8 +74,6 @@ SYMBOL: costs
     ! Initialize cost as 0 for each possibility.
     possibilities get [ [ 0 ] H{ } map>assoc ] assoc-map costs set ;
 
-: 10^ ( n -- x ) 10 <repetition> product ;
-
 : increase-cost ( rep scc factor -- )
     ! Increase cost of keeping vreg in rep, making a choice of rep less
     ! likely. If the rep is not in the cost alist, it means this