http://blog.gmane.org/gmane.comp.lang.factor.general hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.lang.factor.general/6457 <pre>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 &amp; 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, &amp; 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 </pre> mr w 2013-05-22T13:00:18 http://comments.gmane.org/gmane.comp.lang.factor.general/6449 <pre>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 </pre> graham telfer 2013-05-20T12:55:28 http://comments.gmane.org/gmane.comp.lang.factor.general/6447 <pre>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&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> kabelo moiloa 2013-05-12T16:38:36 http://comments.gmane.org/gmane.comp.lang.factor.general/6444 <pre>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 </pre> mr w 2013-05-12T06:19:11 http://comments.gmane.org/gmane.comp.lang.factor.general/6442 <pre>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 &lt;2% overhead. Download for free and get started troubleshooting in minutes. http://p.sf.net/sfu/appdyn_d2d_ap2 </pre> mr w 2013-05-04T06:35:58 http://comments.gmane.org/gmane.comp.lang.factor.general/6440 <pre>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 &amp; 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, &amp; 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 </pre> Leon Konings 2013-04-23T13:50:24 http://comments.gmane.org/gmane.comp.lang.factor.general/6435 <pre>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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> Loryn Jenkins 2013-04-22T14:17:59 http://comments.gmane.org/gmane.comp.lang.factor.general/6432 <pre>Factor folks - I'm missing something trying to properly set up the components of a sequence to be passed to run-pipeline. I intend the components to be: (1) a process launch descriptor, with stack effect ( -- desc ) ; (2) a quotation composed only of run-detached, stack effect ( desc -- process ) ; (3) a quotation to store the proc in a variable, stack effect ( process -- ); -these followed by quotations of words with stack effect ( -- ), all duly wrapped in a sequence { … }. The word description for run-pipeline says that run-pipeline: "Creates a pipe between each pipeline component, with the output of each component becoming the input of the next. The first component reads input from input-stream and the last component writes output to output-stream. Each component runs in its own thread, and the word returns when all components finish executing. Each component outputs a result value." My sundry attempts to meet these requirements typically result in a data stack underflow on execution, or an aberrant stack effect during compile. Can anyone sketch a proper set-up for generic requirements like mine, to successfully pass a component sequence to run-pipeline? Thanks for any suggestions, ~cw </pre> CW Alston 2013-04-22T11:30:54 http://comments.gmane.org/gmane.comp.lang.factor.general/6427 <pre>"You're smart too late and old too soon." - Mike Tyson I'm very pleased to announce the release of Factor 0.96! You can find download links on the Factor website: http://factorcode.org This release is brought to you with over 1,100 commits by the following individuals: Alex Vondrak, Benjamin Pollack, Daniel Nagel, Doug Coleman, John Benediktsson, Jon Harper, Michael T. Richter, and &lt; at &gt;PGGB. Aside from bug fixes and various library improvements, I want to highlight the following changes: * Major compiler improvements (thanks Alex Vondrak!): * Global Value Numbering (disabled currently by default) * Parallel-Copy Semantics * Performance improvements to hashtables, hash-sets, heaps, and bloom-filters. * Support for Retina Displays on OS X * Greatly improved table gadget performance * PDF streams (and related PDF documentation)! * Speed up math comparisons * Support resize-window (thanks Jon Harper!) * New logo and icons for Factor * Added editor support for Textadept, Sublime Text, Geany, BBEdit, and XCode. Some possible backwards compatibility issues: * Changed &lt;groups&gt;, &lt;clumps&gt;, and &lt;circular-clumps&gt; to use slices. * Removed &lt;slicing-groups&gt;, &lt;slicing-clumps&gt;, &lt;slicing-circular-clumps&gt;. * Renamed editors.notepadpp to editors.notepad++. For more details, please see the full announcement at: http://re-factor.blogspot.com/2013/04/factor-0-96-now-available.html ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> John Benediktsson 2013-04-21T04:44:36 http://comments.gmane.org/gmane.comp.lang.factor.general/6426 <pre>Hi, I'm interested in binding to a C++ library. I know about alien.cxx, but it seems incomplete - e.g. doesn't support visual studio - also it seems like a crazy idea to bind directly to the mangled C++ symbols for a bunch of different compilers, and also it is unmaintained. Can anyone tell me if there is a reason that library was discontinued? Otherwise I'm interested in finishing the library (if that turns out to be practical), or perhaps extending SWIG to support factor. Regards, Luke Worth ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter </pre> Luke Worth 2013-04-17T22:12:12 http://comments.gmane.org/gmane.comp.lang.factor.general/6412 <pre>Anyone know what the stack looks like during the execution of a sequence combinator? For example, the quot passed to map expects ... quot,a quotation with stack effect ( ... elt -- ... newelt ) Are there any guarantees on the "..." in "... elt"? Does "seq quot map" remain on the stack while quot is applied to each element? ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter </pre> mr w 2013-04-15T02:27:25 http://comments.gmane.org/gmane.comp.lang.factor.general/6409 <pre>Is there a version of filter-index that only puts the index on the stack, without the corresponding element? ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter </pre> mr w 2013-04-15T01:12:46 http://comments.gmane.org/gmane.comp.lang.factor.general/6399 <pre>Is there an "n-slices" word, that attempts to chop a sequence into n slices? Could also imagine a "slices-n" word, that attempts to chop a sequence into slices of length n. Should be easy to code with head-slice and rest-slice, but I'm not playing with a full deck of cards yet when it comes to Factor. ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter </pre> mr w 2013-04-14T11:37:29 http://comments.gmane.org/gmane.comp.lang.factor.general/6395 <pre>Hello list. Can someone clarify this for me ... ''Spawns a new thread for applying quot to every element of seq, blocking until all quotations complete.'' -- http://docs.factorcode.org/content/word-parallel-each%2Cconcurrency.combinators.html The comment seems to imply that parallel-each runs like the regular each, except in the background. Is this similar to running a command in unix with "&amp;"? Before reading the comment for parallel-each, I assumed that parallel-each would use a pool of threads to apply quot to sections of the sequence, concurrently. I think I am missing something. ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter </pre> mr w 2013-04-14T04:06:49 http://comments.gmane.org/gmane.comp.lang.factor.general/6360 <pre>It occurred to me that there must be a general process by which a programmer refactors code. Was wondering if it has ever been attempted to codify this process. Take this program for example ... http://re-factor.blogspot.com/2013/04/move.html : usage ( -- ) "Usage: move source ... target" print ; : move-to-dir ( args -- ) dup last file-info directory? [ unclip-last move-files-into ] [ drop usage ] if ; : move-to-file ( args -- ) dup last file-info directory? [ move-to-dir ] [ first2 move-file ] if ; : run-move ( -- ) command-line get dup length { { [ dup 2 &gt; ] [ drop move-to-dir ] } { [ dup 2 = ] [ drop move-to-file ] } [ 2drop usage ] } cond ; We could factor out ''last file-info directory?'' into a word ... : usage ( -- ) "Usage: move source ... target" print ; : target-is-directory? ( args -- ? ) last file-info directory? : move-to-dir ( args -- ) dup target-is-directory? [ unclip-last move-files-into ] [ drop usage ] if ; : move-to-file ( args -- ) dup target-is-directory? [ move-to-dir ] [ first2 move-file ] if ; : run-move ( -- ) command-line get dup length { { [ dup 2 &gt; ] [ drop move-to-dir ] } { [ dup 2 = ] [ drop move-to-file ] } [ 2drop usage ] } cond ; If refactoring of code may be obvious to a human, it might also be done by an algorithm. Or is this similar to something that already exists in the optimizing compiler? - Leonard ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> leonard 2013-04-10T03:18:40 http://comments.gmane.org/gmane.comp.lang.factor.general/6357 <pre>Stacks, objects, collections, continuations, higher-order functions ... Anyone else think that Factor would make an ideal language for teaching CS? ------------------------------------------------------------------------------ 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 &amp; visualization. Get a free account! http://www2.precog.com/precogplatform/slashdotnewsletter_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> Leonard P 2013-04-08T23:12:09 http://comments.gmane.org/gmane.comp.lang.factor.general/6356 <pre>Is there an Emacs syntax highlighter for Factor code? </pre> Andrew Pennebaker 2013-04-06T05:27:12 http://comments.gmane.org/gmane.comp.lang.factor.general/6344 <pre>Hi I'm attempting to adapt the code for cartesian-product into 2cartesian-product, in order to produce the cartesian product of 3 sequences. This is the deepest I've gotten into currying and composing, and I'm not quite sure I grok exactly how these words are working. If you could shine a light on a concept I'm missing, I'd appreciate it. I've pasted the code here: http://paste.factorcode.org/paste?id=2888 The output of my debugging session is here: https://www.evernote.com/pub/lorynjenkins/factorn-cartesian-product The debugging session was initialised with: 1 10 [a,b] [ ] map dup dup 2cartesian-product Loryn Jenkins ------------------------------------------------------------------------------ Own the Future-Intel&amp;reg; Level Up Game Demo Contest 2013 Rise to greatness in Intel's independent game demo contest. Compete for recognition, cash, and the chance to get your game on Steam. $5K grand prize plus 10 genre and skill prizes. Submit your demo by 6/6/13. http://p.sf.net/sfu/intel_levelupd2d_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> Loryn Jenkins 2013-04-01T11:38:00 http://comments.gmane.org/gmane.comp.lang.factor.general/6343 <pre>Some ideas reminiscent of philosophies of Factor ... http://www.youtube.com/watch?v=tc4ROCJYbm0 ------------------------------------------------------------------------------ Own the Future-Intel&amp;reg; Level Up Game Demo Contest 2013 Rise to greatness in Intel's independent game demo contest. Compete for recognition, cash, and the chance to get your game on Steam. $5K grand prize plus 10 genre and skill prizes. Submit your demo by 6/6/13. http://p.sf.net/sfu/intel_levelupd2d_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> Fox McCloud 2013-03-26T20:12:26 http://comments.gmane.org/gmane.comp.lang.factor.general/6341 <pre>Apologies. This version contains amended run data. Hi I just noticed that math.functions round can be sped up. Compare the version from math.functions vs the comparison version. : round ( x -- y ) dup sgn 2 / + truncate ; inline : round2 ( x -- y ) dup sgn 0.5 * + truncate ; inline Testing = warm up execution of each statement, followed by 3 executions of gc [ 10000 [ 42.3 round drop ] times ] time gc [ 10000 [ 42.3 round2 drop ] times ] time round results = { 0.004365148 0.004394427 0.004361589 } average = 0.0044 round2 results = { 0.001903133 0.001894752 0.001913334 } average = 0.0019 averaged results show 2.32 times speedup on Mac OS X 10.8.3 2 GHz Intel Core 2 Duo Loryn Jenkins ------------------------------------------------------------------------------ Own the Future-Intel&amp;reg; Level Up Game Demo Contest 2013 Rise to greatness in Intel's independent game demo contest. Compete for recognition, cash, and the chance to get your game on Steam. $5K grand prize plus 10 genre and skill prizes. Submit your demo by 6/6/13. http://p.sf.net/sfu/intel_levelupd2d_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> Loryn Jenkins 2013-03-26T18:37:33 http://comments.gmane.org/gmane.comp.lang.factor.general/6340 <pre>Hi I just noticed that math.functions round can be sped up. Compare the version from math.functions vs the comparison version. : round ( x -- y ) dup sgn 2 / + truncate ; inline : round2 ( x -- y ) dup sgn 0.5 * + truncate ; inline Testing = warm up execution of each statement, followed by 3 executions of gc [ 10000 [ 42.3 round drop ] times ] time gc [ 10000 [ 42.3 round2 drop ] times ] time round results = { 0.004365148 0.004394427 0.001917139 } average = 0.0036 round2 results = { 0.001903133 0.001894752 0.001913334 } average = 0.0019 averaged results show 1.89 times speedup on Mac OS X 10.8.3 2 GHz Intel Core 2 Duo Loryn Jenkins ------------------------------------------------------------------------------ Own the Future-Intel&amp;reg; Level Up Game Demo Contest 2013 Rise to greatness in Intel's independent game demo contest. Compete for recognition, cash, and the chance to get your game on Steam. $5K grand prize plus 10 genre and skill prizes. Submit your demo by 6/6/13. http://p.sf.net/sfu/intel_levelupd2d_______________________________________________ Factor-talk mailing list Factor-talk-5NWGOfrQmneRv+LV9MX5uipxlwaOVQ5f&lt; at &gt;public.gmane.org https://lists.sourceforge.net/lists/listinfo/factor-talk </pre> Loryn Jenkins 2013-03-26T18:28:46 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.factor.general