gmane.comp.lang.factor.general

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 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

_ _ — 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://p.sf.net/sfu/alienvault_d2d

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.sourceforge.net/lists/listinfo/factor-talk

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 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

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

Re: multiple files

John Benediktsson — 2013-05-12T06:21:58

In the work directory, you can have multiple vocabularies, for example
something like this:

    work/foo/foo.factor
    work/bar/bar.factor
    work/some/other/other.factor

These would correspond to:

    USE: foo
    USE: bar
    USE: some.other

Does that help?


On Sat, May 11, 2013 at 11:19 PM, mr w <wzrd64-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
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

multiple files

mr w — 2013-05-12T06:19:11

Is it possible to have multiple files in the work directory?

Each file contains words to be attached to the same vocabulary root.

------------------------------------------------------------------------------
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

Re: site down

Alex Vondrak — 2013-05-04T15:52:49

Looks like it's back now.  I'm guessing it was this:
https://github.com/slavapestov/factor/issues/882


On Fri, May 3, 2013 at 11:35 PM, mr w <wzrd64-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite
It's a free troubleshooting tool designed for production
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://p.sf.net/sfu/appdyn_d2d_ap2_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

site down

mr w — 2013-05-04T06:35:58

Site down, no posts ... factorcode rapture?

------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite
It's a free troubleshooting tool designed for production
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://p.sf.net/sfu/appdyn_d2d_ap2

Re: Confused about run-pipeline

CW Alston — 2013-04-25T21:09:27

Hi Alex - just saw this. Thanks much; your example unclogs my confusion on
pipes nicely!
Onward ~cw


On Mon, Apr 22, 2013 at 3:06 PM, Alex Vondrak <ajvondrak-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

Went open source with my GA144 simulator written inFactor

Leon Konings — 2013-04-23T13:50:24

I am happy to say, I went public with the GA144 Simulator, I wrote in Factor.

As you might know the GA144 is a chip containing 144 small computers.  
Invented by Chuck Moore and produced by Greenarrays, Inc. See:  
http://www.greenarraychips.com/

It is a rather big project with the name arrayFactor. The repository  
is at Bitbucket. You can reach it via http://arrayfactor.org

Best regards,
Leon


------------------------------------------------------------------------------
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_apr

Re: Confused about run-pipeline

Alex Vondrak — 2013-04-22T22:06:51

Well, there's your problem: you don't want `run-pipeline` at all.  :)

  IN: scratchpad "echo \"Hi\"" run-detached my-process set-global
  IN: scratchpad my-process get-global .
  T{ process
      { command "echo \"Hi\"" }
      { environment H{ } }
      { environment-mode +append-environment+ }
      { group +same-group+ }
      { status 0 }
  }

`run-pipeline` is like a series of Unix pipes.  So,

  { "cat log.txt" "grep error" "sort" "uniq" } run-pipeline

is like typing

  $ cat log.txt | grep error | sort | uniq

at a bash prompt.  Except not every element of the pipeline has to be a
process descriptor---you can insert Factor code along the way.

Roughly, it works by sequentially calling `run-pipeline-element` on each
item in your sequence.  `run-pipeline-element` is defined by:

  IN: scratchpad \ run-pipeline-element see-methods
  USING: combinators destructors io io.pipes.private kernel
  quotations ;
  M: callable run-pipeline-element
      [
          [ [ ?reader ] [ ?writer ] bi* ] dip
          [ ( -- result ) call-effect ] curry with-streams*
      ] with-destructors ;

  USING: accessors destructors io.launcher io.pipes.private kernel
  ;
  M: object run-pipeline-element
      [ >process swap >>stdout swap >>stdin run-detached ]
      [ drop [ [ dispose ] when* ] bi< at > ] 3bi wait-for-process ;

I.e., it's already calling `run-detached` on anything in the pipeline
that's just a process description.  Otherwise, it expects a quotation that
takes no inputs, produces one output, and then calls that quotation with
the I/O streams rebound.  E.g.,

  IN: scratchpad { "cat /tmp/patch" [ readln >string ] } run-pipeline .
  {
      0
      "diff --git a/basis/prettyprint/prettyprint-tests.factor
b/basis/prettyprint/prettyprint-tests.factor"
  }

We see that the result of the first item in the pipeline is 0 (the exit
code of cat), and the result of the second item in the pipeline the output
from the Factor quotation, which it read from standard-input.  Except that
standard-input was bound to the output of the prior pipeline element (the
output of cat).

Hope that helps,
--Alex Vondrak
------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: Confused about run-pipeline

CW Alston — 2013-04-22T21:42:26

Hi -


Yes, indeed, the run-pipeline example works fine, composed

of strings of unix commands. My components are Factor callable

quotations and a launch descriptor:


SYMBOL: my-process

{

  <my-process>                       ! ( -- desc )

  [ run-detached ]                    ! ( -- process )

  [ my-process set-global t ]   ! ( -- t )

}

run-pipeline


Calling run-pipeline on the sequence fails with:


"Error in thread 341 (Future, [ ~slice~ ~quotation~ ~quotation~ dip
run-pipeline-element...):

Data stack underflow"


Note that the phrase "<my-process> run-detached my-process set-global t"

completes successfully in the listener. Also, the code compiles without
error in its

compilation unit.


I can step down through the code as far as the word map! successfully.
However,

trying to set a breakpoint on map! hangs the system, so I can't follow into
that word.

I added the boolean at the end to satisfy the requirement that each
component

must output a single value. I can't see how that alone would produce the
stack

underflow.


Since the vocabulary description for run-pipeline reads:


"Pipeline components must be one of the following:

• A quotation. The quotation is called with both input-stream and
output-stream   rebound, except for the first and last pipeline components,
and it must output a single value.

• A process launch descriptor. See Launch descriptors." ,


I suspect my problem is in the binding of the input/output streams. I'll
experiment

with that, but do let me know if I'm missing something simple. I just want
to find

out how to properly use run-pipeline with ordinary callables, especially
quotations

composed of words with stack effect ( -- ).


Thanks for the replies.

~cw



On Mon, Apr 22, 2013 at 6:20 AM, John Benediktsson <mrjbq7-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

Re: Idiomatic use of sequences for iterativefunctions?

Loryn Jenkins — 2013-04-22T15:52:01

Thank you, John. That's what I was looking for.

I must say: currying an entire sequence is pretty wild! It's a non-obvious
solution.


No, it's not undesirable, except for the fact that 30-40% of that code
exists for the sake of the side-effect.

Of course, computation by calculation is shorter again ...

USING: arrays math math.ranges math.primes.factors sequences ;
IN: lamps

: <people> ( -- seq )
    100 [1,b] >array ;

: calc-switching ( -- lamps )
    <people> [ divisors length even? ] map ;


(But then, that wasn't my purpose. I was trying to figure out how to get a
nested iteration done with sequences instead of always falling back to
recursion.)

Thanks, again.

Loryn Jenkins



On Tue, Apr 23, 2013 at 12:44 AM, John Benediktsson <mrjbq7-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org>wrote:

------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: Idiomatic use of sequences for iterativefunctions?

John Benediktsson — 2013-04-22T14:44:45

Something like this would be simpler:

http://paste.factorcode.org/paste?id=2914#1329

You don't need a symbol to pass the variable around, and even though it is
"side-effecting", I'm not sure that is undesirable here...?


On Mon, Apr 22, 2013 at 7:17 AM, Loryn Jenkins <lorynj-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Idiomatic use of sequences for iterative functions?

Loryn Jenkins — 2013-04-22T14:17:59

Hi

In "Factor Philosophy", slava writes: "Imperative programming and indexed
loops are almost always not the most idiomatic solution."

I've implemented this puzzle (
http://mindyourdecisions.com/blog/2013/04/22/100-light-bulbs-puzzle/ )
using a side-effecting function: http://paste.factorcode.org/paste?id=2914

The words do-switching and toggle-switches implement the equivalent of a
nested loop.

Without using recursion, counted for loops or side-effecting functions,
what is an idiomatic way of implementing this nested iteration?

Loryn Jenkins
------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: Confused about run-pipeline

John Benediktsson — 2013-04-22T13:20:08

The example is simple and works fine:

{ "cat log.txt" "grep error" "sort" "uniq" } run-pipeline

Can you explain the more complicated thing you're trying to do?


On Mon, Apr 22, 2013 at 4:30 AM, CW Alston <cwalstonsf-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk

Re: Confused about run-pipeline

Alexander Mueller — 2013-04-22T13:13:48

i guess you wand to use run-pipeline on factor quotes instead of just unix
commands so you would dispatch to run-pipeline-element on a callable
instead of a "object" which i guess is a string (?)

i would just throw a quote instead of a string into the sequence and it
should just work as long as run-pipeline creates input/outputs for it, your
quotation would though need to read stdin and write stdout i guess so it
would "fit in"


On Mon, Apr 22, 2013 at 1:30 PM, CW Alston <cwalstonsf-Re5JQEeQqe8AvxtiuMwx3w< at >public.gmane.org> wrote:

------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________
Factor-talk mailing list
Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f< at >public.gmane.org
https://lists.sourceforge.net/lists/listinfo/factor-talk