gmane.comp.lang.factor.general

Re: spreadsheets

William Tanksley, Jr — 2013-05-22T15:48:40

Not really... It's the same error as losing track of the stack depth.
In both cases you have a seemingly unlimited array of seemingly
identical cells, and you have to have a function operate on a finite
number of them.

-Wm

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: spreadsheets

mr w — 2013-05-22T15:28:11

Guess that's the polar opposite of point-free style.

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: spreadsheets

William Tanksley, Jr — 2013-05-22T15:12:34

I used them for stochastic models (mostly linear systems with
constraints); most business majors can read the results, and some of
them are even trained well enough to follow the formulas and see how
the inputs generate the results. A Turing-complete language is "more
powerful", but by crossing the threshold from "data flow" (which is
about all a spreadsheet can do) to "full programming language" a whole
new world of complexity arises.

Now, I would be delighted to use a Factor library that allowed me to
lay out a business model as pure data -- that would get around some of
the horrid inconveniences that attend the spreadsheet model (for
example, adding an extra data element can be immensely disruptive,
because the range that contains the data has to be redefined, and you
get no warning at all if you fail to do so). But there are other
applications that do this, and they haven't killed off spreadsheets
even for this one use.

BTW -- why is the era of Lotus 123 officially ending today? I thought
it had been

Re: spreadsheets

mr w — 2013-05-22T14:08:33

Not sure if the values are right on that clock.

Point is that would like to travel back to the 80s and introduce Factor.

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: spreadsheets

mr w — 2013-05-22T13:57:03

http://cdn.funkyspacemonkey.com/wp-content/uploads/2010/11/flux_capacitor_2.jpg

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: spreadsheets

John Benediktsson — 2013-05-22T13:46:09

You should ask that question to the thousands (millions?) of businesses
managed largely by spreadsheet.  :P


On Wed, May 22, 2013 at 6:00 AM, mr w <wzrd64-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: List Comprehension in Factor

John Benediktsson — 2013-05-22T13:45:05

You're thinking of "rest-slice", which is a virtual version of "rest".
------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: List Comprehension in Factor

mr w — 2013-05-22T13:29:15

"Chuck Moore declared that the software problem was solved and that
the remaining problem was hardware."
  -- http://www.ultratechnology.com/

With the software problem solved, maybe the remaining problems are
hardware and pure math.

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: List Comprehension in Factor

mr w — 2013-05-22T13:16:31

How come "rest" doesn't just use a virtual sequence to offset the
original index by 1.

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

spreadsheets

mr w — 2013-05-22T13:00:18

With the era of Lotus-123 officially ending, I wondered whether
spreadsheets in general are still necessary.

Can any Factor users think of a computation more easily handled by a
spreadsheet than by a text editor and the Listener?

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: List Comprehension in Factor

John Benediktsson — 2013-05-22T12:58:32

Using ranges, "iota rest" is just "[1,b)" (and more memory efficient because rest causes the virtual sequence to become concrete).

The filter-combinations word is more efficient than all-combinations [ ... ] filter because it can ignore or skip the ones that are not triples as it builds the result.

I'm glad the final version is so elegant!

Best,
John.

On May 22, 2013, at 1:56 AM, mr w <wzrd64-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:


------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: List Comprehension in Factor

mr w — 2013-05-22T08:56:07

Out of all the examples given in several languages, this is by far the
most concise version.

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: List Comprehension in Factor

mr w — 2013-05-22T08:54:01

Does filter-combinations filter as it builds the list?
Or does it build the list then filter it?

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may

Re: List Comprehension in Factor

Alex Vondrak — 2013-05-21T02:11:24

Oo, or even

: triples ( n -- seq )
    iota rest 3 [ first3 triple? ] filter-combinations ;


On Mon, May 20, 2013 at 7:06 PM, Alex Vondrak <ajvondrak-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only SaaS-based application performance monitoring service 
that delivers powerful full stack analytics. Optimize and monitor your
browser, app, & servers with just a few lines of code. Try New Relic
and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_may_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: List Comprehension in Factor

Alex Vondrak — 2013-05-21T02:06:26

Or, going by the algorithms in the wiki:

```
USING: arrays kernel locals math math.ranges sequences
sequences.extras ;

:: triples ( n -- seq )
    n [1,b] [| x |
        x n [a,b] [| y |
            y n [a,b]
            [| z | x sq y sq + z sq = ]
            [| z | x y z 3array ]
            filter-map
        ] map concat
    ] map concat ;
```

Fun bug report: using `map-concat` from `sequences.extras` fails to compile
for me---complains about using `call` on a run-time computed value.

But, I really like your approach using `all-combinations`.  It yields a
much nicer-looking version:

```
: triple? ( x y z -- ? )
    [ sq ] tri< at > [ + ] dip = ;

: triples ( n -- seq )
    iota rest 3 all-combinations [ first3 triple? ] filter ;
```

Regards,
--Alex Vondrak



On Mon, May 20, 2013 at 8:18 AM, _ _ <wzrd64-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Try New Relic Now & We'll Send You this Cool Shirt
New Relic is the only Sa

Re: List Comprehension in Factor

_ _ — 2013-05-20T15:18:03

! Copyright (C) 2013 Your name.
! See http://factorcode.org/license.txt for BSD license.
USING: kernel sequences math math.functions arrays math.combinatorics ;
IN: pythagorean-triples

: a-b-list ( n -- seq )
    iota rest 2 all-combinations ;

: a-b-c ( seq1 -- seq2 )
    [ first ]
    [ second ]
    [ [ first sq ] [ second sq ] bi + sqrt ]
    tri
    3array ;

: a-b-c-list ( n -- seq )
    a-b-list [ a-b-c ] map ;

: float.0? ( n -- ? )
    dup floor 0 ~ ;

: (pythagoreans) ( n -- seq )
    a-b-c-list [ third float.0? ] filter ;

: pythagoreans ( n -- seq )
    (pythagoreans) [ [ first ] [ second ] [ third >integer ] tri 3array ] map ;

------------------------------------------------------------------------------
AlienVault Unified Security Management (USM) platform delivers complete
security visibility with the essential security capabilities. Easily and
efficiently configure, manage, and operate all of your security controls
from a single console and one unified framework. Download a free trial.
http:

Re: List Comprehension in Factor

John Benediktsson — 2013-05-20T14:00:44

We don't have "list comprehensions", per se - but instead have basic map
and filter operations...

Instead of

    [ x for x in range(5) if x % 2 == 0 ]

We would have:

    5 iota [ 2 mod zero? ] filter

Instead of

    [ x ** 3 for x in foo() ]

We would have:

    foo [ 3 ^ ] map

You could use locals if you felt they helped:

    foo [| x | x 3 ^ ] map





On Mon, May 20, 2013 at 5:55 AM, graham telfer <gakousei53-PkbjNfxxIARBDgjK7y7TUQ< at >public.gmane.org>wrote:

------------------------------------------------------------------------------
AlienVault Unified Security Management (USM) platform delivers complete
security visibility with the essential security capabilities. Easily and
efficiently configure, manage, and operate all of your security controls
from a single console and one unified framework. Download a free trial.
http://p.sf.net/sfu/alienvault_d2d_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.

List Comprehension in Factor

graham telfer — 2013-05-20T12:55:28

I was checking out the Rosetta Code site and noticed there is no example of list comprehension in Factor. How can we simulate this convenient tool?

------------------------------------------------------------------------------
AlienVault Unified Security Management (USM) platform delivers complete
security visibility with the essential security capabilities. Easily and
efficiently configure, manage, and operate all of your security controls
from a single console and one unified framework. Download a free trial.
http://p.sf.net/sfu/alienvault_d2d

Re: Code Review: Game of Life

John Benediktsson — 2013-05-12T17:00:03

Some ideas:

1) Your "frequencies" word is the same as "histogram" in math.statistics
vocabulary.

2) Your calculation of neighboring cells could use a constant to represent
the 8  adjacent cells, instead of computing it each time:

CONSTANT: coordinates {
    { 1 1 }
    { 1 0 }
    { 1 -1 }
    { 0 1 }
    { 0 -1 }
    { -1 1 }
    { -1 0 }
    { -1 -1 }
}

: neighbours ( loc -- neighbours )
  coordinates [ v+ ] with map ;

3) you might try factoring out the steps in "steps", perhaps something like
this:

: count-cells ( cells -- counts )
    [ neighbours ] map concat histogram ;

:: live? ( loc count cells -- ? )
    count 3 = [ t ] [ count 2 = loc cells in? ] if ;

:: steps ( cells -- cells' )
    cells count-cells [ cells live? ] assoc-filter keys ;
------------------------------------------------------------------------------
Learn Graph Databases - Download FREE O'Reilly Book
"Graph Databases" is the definitive new guide to graph databases and 
their applications. This 200-page book is written by thr

Code Review: Game of Life

kabelo moiloa — 2013-05-12T16:38:36

Hi there,
I ported a Clojure implementation of Conway's Game of Life to Factor.
Here is the original Clojure version:
http://clj-me.cgrand.net/2011/08/19/conways-game-of-life/
Here is my Factor port: http://paste.factorcode.org/paste?id=2932
How can I make the Factor variant more elegant and/or idiomatic?

Kind Regards,
Kabelo Moiloa
------------------------------------------------------------------------------
Learn Graph Databases - Download FREE O'Reilly Book
"Graph Databases" is the definitive new guide to graph databases and 
their applications. This 200-page book is written by three acclaimed 
leaders in the field. The early access version is available now. 
Download your free book today! http://p.sf.net/sfu/neotech_d2d_may_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: multiple files

mr w — 2013-05-12T06:23:45

Cheers.

------------------------------------------------------------------------------
Learn Graph Databases - Download FREE O'Reilly Book
"Graph Databases" is the definitive new guide to graph databases and 
their applications. This 200-page book is written by three acclaimed 
leaders in the field. The early access version is available now. 
Download your free book today! http://p.sf.net/sfu/neotech_d2d_may