From b6c069f99a0e9dee76ab583e6e73d2cf875f27c5 Mon Sep 17 00:00:00 2001 From: John Benediktsson Date: Wed, 5 Sep 2012 09:25:26 -0700 Subject: [PATCH] compiler.cfg.representations.selection: removing 10^ in favor of 10^. --- .../compiler/cfg/representations/selection/selection.factor | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/basis/compiler/cfg/representations/selection/selection.factor b/basis/compiler/cfg/representations/selection/selection.factor index 3d435edc09..45f7a6d77f 100644 --- 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 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