[Factor-talk] https certificate for factorcode.org

Hi. The certificate for https://factorcode.org/ has expired. I don't know who is able to renew it, maybe it's time to use Let's Encrypt if the hosting provider allows it. Sam -- Check out the vibrant tech community

Re: [Factor-talk] From Factor to Swift to ???

2014-06-05 11:27 GMT+02:00 Dominikus Herzberg dominikus.herzb...@gmail.com : There is one person working at Google capable to create a competitor to #Swift and a replacement for #Java Scala seems to fit those two goals. Why invent yet another new language? Sam

Re: [Factor-talk] n-slice

2013/4/14 mr w wzr...@gmail.com Could also imagine a slices-n word, that attempts to chop a sequence into slices of length n. How would that be different from sliced-groups? Is there an n-slices word, that attempts to chop a sequence into n slices? If you start with a sequence of length

Re: [Factor-talk] A word similar to Haskell's 'iterate'

2011/12/6 missingfaktor rahul.phulore@gmail.com Does Factor have a word similar to Haskell's 'iterate' function? You may be looking for lfrom-by in the lists.lazy vocabulary. Note that the documentation is wrong (I'll submit a patch), the quotation has effect ( a -- b ), not ( -- n ).

Re: [Factor-talk] conditional combinator proposal

2011/10/1 Slava Pestov sl...@factorcode.org Hi Michele, On Fri, Sep 30, 2011 at 2:53 PM, Michele Pes mp8...@rambler.ru wrote: To achieve this, I wrote this word: : when-drop ( obj question-quot: ( obj -- ? ) true-quot: ( obj -- ) -- ) -rot dupd call swapd [ call ] [ 2drop ] if ;

Re: [Factor-talk] Method overriding syntax in hierarchy

2011/7/24 Michele Pes mp8...@rambler.ru Hi factorers! I'm new to factor, but very interested. I have a tuple A, and a tuple B that derives from A (B A) If both have a method f and I have an instance of B, how can I call the method of the parent (A::f in c++ syntax) ? If you want to call

[Factor-talk] Pull request: math.primes:nprimes

My students asked for a nprimes word. Here it is. Sam The following changes since commit 4f8e8e6613be53786c9e72730b5577a9d2176247: Add math.primes:nprimes (2011-05-20 12:38:27 +0200) are available in the git repository at: g...@github.com:samueltardieu/factor.git for-slava

[Factor-talk] Strange behaviour of odd?

This behaviour has been noticed indirectly by John Benediktsson who told me that 3.5 next-prime was causing an out of memory error. On Linux/64 bits: ( scratchpad ) 3.5 1 bitand 1 number= No suitable arithmetic method left3.5 right 1.0 generic bitand Type :help for debugging help. (

Re: [Factor-talk] Wikipedia page flagged for notability and possible deletion

Anyway, the pression (thanks to Chris, Zed, reddit) from the crowd has been enough: http://en.wikipedia.org/wiki/User:Christopher_Monsanto -- The ultimate all-in-one performance toolkit: Intel(R) Parallel Studio XE:

[Factor-talk] factorcode.org is down

Web server does not answer. Sam -- Learn how Oracle Real Application Clusters (RAC) One Node allows customers to consolidate database storage, standardize their database environment, and, should the need arise, upgrade

Re: [Factor-talk] newbie stuff

2010/12/28 Marcin Krol mrk...@gmail.com 1. is there some way to make Listener forget the code it just compiled? When I do smth like prog run it always runs the last compiled version, even if I just changed the source code file underneath. You can use refresh-all to have Factor

Re: [Factor-talk] newbie stuff

2010/12/28 Marcin Krol mrk...@gmail.com Now, if someone could explain to me why silly benchmark stopped working, I'd be grateful. Can't you just benchmark.struct-arrays run from the listener? The benchmark is in extra/benchmark/struct-arrays/struct-arrays.factor in the Factor

[Factor-talk] Planet Factor

Slava, could you add the Factor section of my blog to planet Factor? Name: An avian carrier's blog - Factor posts URL: http://www.rfc1149.net/blog/tag/factor/ Feed: http://www.rfc1149.net/blog/tag/factor/feed/ Also, maybe some other blogs could be removed from the planet or a better URL

Re: [Factor-talk] Git patch

2010/12/5 Jim mack j...@less2do.com Growing circulars had a problem pushing once rotated, so here's my attempt. I had trouble updating the read only seq slot, and expect there's a better way than my cheat, but it's beyond me for now.. It includes the test proving the need. This is my

Re: [Factor-talk] erato off-by-one error.

2010/11/2 Jon Harper jon.harpe...@gmail.com I would accept Rupert's patch that makes sieve work with any integer 0 with no performance penalty, and change the documentation for sieve and marked-prime? to remove the restriction that the number should be odd. Samuel, what do you think ?

Re: [Factor-talk] erato off-by-one error.

2010/11/2 Jon Harper jon.harpe...@gmail.com Sure, here are the patches (Rupert's included) A pullable repository would make things easier to explore :) I've put them in mine ( http://git.rfc1149.net/factor.git/shortlog/refs/heads/jon to browse). Here is the pull request (generated using git

Re: [Factor-talk] ch-upper? recent meaning change

2010/10/9 Slava Pestov sl...@factorcode.org The word was added by mistake and has been removed. You can use the following words: ascii:letter? ascii:LETTER? unicode.categories:letter? unicode.categories:LETTER? Perfect, thanks!

[Factor-talk] Pull-request: documentation for assoc-refine

The following changes since commit ace41a6d61cbb1f57aefdb12248af07ed298993a: Fix bootstrap on mac by adding back the PF_INET constant (2010-10-09 16:53:54 -0700) are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): Add documentation

[Factor-talk] ch-upper? recent meaning change

In change 2ef2372c87d3657ac0964c5f4e1ddfd5b28cf029 from last Wednesday, ch-upper? and ch-lower? were moved from unicode.case to ascii. The definition of ch-upper? is: : ch-upper? ( ch -- ? ) dup chupper = ; but the chupper now used is the one from ascii instead of the one from unicode.data.

[Factor-talk] Pull request: fix two bugs in primes-between and primes-upto (math.primes)

The following changes since commit bd4fb9e6468c594c0111fceb1cc7c174254dc038: io.encodings.detect: detect empty files as utf8 rather than raise a sequence error (2010-06-10 17:32:56 -0700) are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1

Re: [Factor-talk] Factor educational tools

of disk (Linux software RAID 1) and only 1GB of RAM. PPS/ Note that I am not a stakeholder at this company :) -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Download Intel#174; Parallel Studio Eval Try

Re: [Factor-talk] Factor educational tools

2010/3/29 Samuel Tardieu s...@rfc1149.net Slava == Slava Pestov sl...@factorcode.org writes: Slava factorcode.org and concatenative.org, which are served by Slava Factor's http.server, run on linode.com. I'm not sure if it Slava qualifies as cheap (depending on the plan its $20 - $100 USD

[Factor-talk] Pull request: use sets

The following changes since commit 3ef79a67ac37cf929b5c45ac770cc9d11f53a9f8: Slava Pestov (1): alien.debugger: fix USING: form are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): Use sets extra/astar/astar.factor | 10

[Factor-talk] Pull request: Also test the derivation variant of astar

The following changes since commit b83f0d034990249dc53bc68e286dd8c978b25a75: Slava Pestov (1): tools.memory: fix unit test are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): Also test the derivation variant of astar extra

[Factor-talk] Pull request: more efficient astar implementation

The following changes since commit 6a6ab7c1a89c2529bc2b5416bc5b3ed7492465c6: Doug Coleman (1): Fix typedef typo in opencl are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (2): Project Euler : problem 265 Use a subclassed

Re: [Factor-talk] HTML parsing vocabulary

2010/3/8 Doug Coleman doug.cole...@gmail.com I had a better html parser but I reverted the code by accident... Incidentally, if you happen to revert some code that you had previously checked in, git reflog will allow you to get back any version for 90 days by default (git never deletes

[Factor-talk] Pull request: A* algorithm

The following changes since commit 3d3b6b610b3dd03f102fdd550c442a00639c4615: Joe Groff (1): Merge branch 'lexer-parsing-word-errors' are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): A* algorithm implementation extra/astar

Re: [Factor-talk] Factored Robot

2010/3/3 Jon Harper jon.harpe...@gmail.com I'm happy to show you these lines: Core bootstrap completed in 115 minutes and 42 seconds. Bootstrap completed in 115 minutes and 42 seconds. Bootstrapping is complete. My (very ancient) home machine seems blazingly fast to me when I read that :)

Re: [Factor-talk] Monotonic counters and Virtualbox on 64 bits Linux host

2010/3/3 Slava Pestov sl...@factorcode.org A similar issue occurs on Windows under VirtualBox. Doug and I tried a workaround similar to yours but it doesn't work too well if the Factor side of things doesn't poll the nano-counter often enough. Another solution would be to retry until the

[Factor-talk] Monotonic counters and Virtualbox on 64 bits Linux host

Jon and I have encountered a strange issue when using VirtualBox with 64 bits Linux hosts: the monotonic counter is not monotonic, with both 32 and 64 bits Linux guest systems. The attached program (compile with gcc -O2 -o t t.c -lrt) gives an error when executed onto the guest system with the

Re: [Factor-talk] printing a sequence to STDERR

2010/3/1 Terrence Brannon scheme...@gmail.com I thought this would work, but would appreciate some help: { and a bottle of rum yo ho ho } [ error-stream get stream-print ] each You may need to flush the stream to see its output. Try: { and a bottle of rum yo ho ho } [ error-stream get

Re: [Factor-talk] attempting to write a document spell-checker yields out of memory

2010/3/1 Terrence Brannon scheme...@gmail.com ! I get an out of memory error with the document below when I call it with she hit her hard spell : spell ( string -- seq ) split spell ; Looks like a plain old infinite recursion to me. Didn't you mean (spell) instead?

[Factor-talk] Adding a stack effect to a quotation

Jon and I were discussing earlier today of a way to use a dynamically built quotation with bi@ and other combinators. I suggested the word : add-stack-effect ( quot effect -- quot' ) [ call-effect ] 2curry ; inline so that we can call build-dynamic-quotation (( x -- y )) add-stack-effect bi@

Re: [Factor-talk] Adding a stack effect to a quotation

2010/2/26 Daniel Ehrenberg micro...@gmail.com Well, I think you could also do this: build-dynamic-quotation '[ _ call( x -- y ) ] bi@ Sure, this is equivalent.But we wanted to be able to tag several quotations with different stack effects, hence the separate word. However, you should

Re: [Factor-talk] Rosettacode and amb

) words select dup sentence-match? [ fail ] unless join ; : search. ( -- ) search . ; MAIN: search. Amongst other things, this eases testing (although one can argue that redirecting standard output into a string is damn easy in Factor :-). Sam -- Samuel Tardieu -- s...@rfc1149.net -- http

Re: [Factor-talk] Rosettacode and amb

Sam == Samuel Tardieu s...@rfc1149.net writes: Sam - no more macro: select recursively builds a candidate using Sam amb And as Jon noticed (in a private chat session), select is best defined as : select ( seq -- seq' ) [ amb-lazy ] map ; rather than using the constructive recursive

Re: [Factor-talk] Factor Versus Forth --- the book

Hugh == Hugh Aguilar hugoagui...@rosycrew.com writes: Hugh Forth only ships a relative handful of words that have Hugh been found to be widely useful. One of these is star-slash the Hugh scalar. It is called that because it is typically used for scaling Hugh integer arithmetic. You use continued

Re: [Factor-talk] Reorganize some code for simplicity

] } cleave ] make-png-image drop ; Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Come build with us! The BlackBerryreg; Developer Conference in SF, CA is the only developer event you need

Re: [Factor-talk] Filtering prime numbers

11 13 17 19 23 29 31 37 41 43 47 } Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Come build with us! The BlackBerryreg; Developer Conference in SF, CA is the only developer event you need

Re: [Factor-talk] reentrantvm win32 crashes

global vars. In particular Phil 'performing_compaction' had a random value when compiled with -O3 Phil which was causing the early crashes. Doesn't this appear using valgrind on Linux? Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net

[Factor-talk] Pull request: math.primes.factors:divisors

The following changes since commit 55ed9456a59fc97bcd55c609d9dab00109114501: Slava Pestov (1): Fix conflict are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): Add divisors to math.primes.factors basis/math/primes/factors

[Factor-talk] Pull request: better prime numbers packing

in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (2): Pack primes numbers by slices of 30 Add extra tests for math.primes basis/math/primes/erato/erato-docs.factor | 10 ++ basis/math/primes/erato/erato-tests.factor | 11 +- basis/math

[Factor-talk] Spurious dup in extra/io/serial/unix/linux/linux.factor

I also reindented the assoc. The following changes since commit 478e5cc95f5b22ca6b94cde742f3251c9bde481e: Slava Pestov (1): compiler.cfg.linear-scan: Debugging resolve pass are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1

Re: [Factor-talk] New here

clearer and simpler code. For this reason, I wouldn't recommend learning Forth first as an helper step. Jumping right into Factor is the best way to catch Factor idioms early. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net

[Factor-talk] Pull request: automatic vocabulary loading when deserializing

://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): Automatically load needed vocabularies when deserializing words basis/serialize/serialize.factor |4 ++-- 1 files changed, 2 insertions(+), 2 deletions

Re: [Factor-talk] Treating tabs as whitespaces in source code

Sam == Samuel Tardieu s...@rfc1149.net writes: Sam Right now, tabs are not considered whitespaces between tokens in Sam source code. This has two implications: Sam Sam - it is possible to define a word called a b (with a tab in its Sam name) ; Sam Sam - it is impossible to use tabs to indent

[Factor-talk] Treating tabs as whitespaces in source code

): sequences: change implementation of interleave are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (2): Documentation fix for PV{ Treat tabs as blank characters when tokenizing basis/persistent/vectors/vectors-docs.factor |2 +- core

[Factor-talk] Wrong see output

see doesn't properly qualify words that could come from several vocabularies. In this example, it should either output u:swap or kernel:2drop. IN: u : swap ( -- ) ; USING: kernel ; QUALIFIED: u IN: t : foo ( -- ) 1 2 u:swap 2drop ; \ foo see USING: kernel u ; IN: t : foo ( -- ) 1 2 swap 2drop

Re: [Factor-talk] Fry and { }

Sam == Samuel Tardieu s...@rfc1149.net writes: Sam It looks like _ is not substituted within { } in a fry expression: Sam Sam ( scratchpad ) [ '[ { _ } ] ] infer. Sam ( -- object) Sam Sam It makes it difficult to use a case inside a fry. Is it on purpose? Ping? Sam -- Samuel Tardieu

Re: [Factor-talk] Pull Request

Slava == Slava Pestov sl...@factorcode.org writes: Slava Good job, a fast JSON parser would be very useful to have. Indeed, it will speed up the couchdb vocabulary as well. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net

[Factor-talk] Pull request for the amb operator

The following changes since commit 902b5adc4dcfb9cde52518203179623b21dabbff: Samuel Tardieu (1): Implement the amb(iguous) operator to ease backtracking are available in the git repository at: git://git.rfc1149.net/factor.git for-slava

[Factor-talk] The amb operator: backtracking made easy

/amb (as soon as Slava pulls it). Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Register Now for Creativity and Technology (CaT), June 3rd, NYC. CaT is a gathering of tech-side developers brand

Re: [Factor-talk] The amb operator: backtracking made easy

Sam == Samuel Tardieu s...@rfc1149.net writes: Sam I have just implemented the amb operator, as commonly found in Sam Scheme. [...] Sam The amb, amb-fail and bag-of words are located in extra/amb Sam (as soon as Slava pulls it). As noted by Slava, the extra/backtrack module provides

[Factor-talk] Planet Factor not offering links?

It looks like the feed of Planet Factor doesn't contain links to original articles. For example, look at http://inf355.wordpress.com/ where I import feeds for Planet Factor and Planet Scheme: only the latter offers links to the articles. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http

[Factor-talk] Nice ARM device, could run Factor

For whoever wants to attempt an ARM port ressurection, look at http://plugcomputer.org/ It looks nice, can run Linux, and is advertised at $99. -- Register Now Save for Velocity, the Web Performance Operations

[Factor-talk] Executable images

-- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Register Now Save for Velocity, the Web Performance Operations Conference from O'Reilly Media. Velocity features a full day of expert-led, hands

[Factor-talk] Pull request

): Merge branch 'master' of git://factorcode.org/git/factor are available in the git repository at: git://git.rfc1149.net/factor for-slava Samuel Tardieu (1): Add q+ and q- to math.quaternions basis/math/quaternions/quaternions-docs.factor | 10 ++ basis/math/quaternions

[Factor-talk] FUEL gets confused by the : in HEX:

The stack effect computed by FUEL for 10 HEX: FF = is the one of =. I guess it gets confused by the : in HEX: and takes : FF as the declaration of the FF word. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net

[Factor-talk] Pull request: primes factoring optimization, and continued fractions

The following changes since commit 5aba91a0c57130e75628ec71510635f23780f1c5: Daniel Ehrenberg (1): Merge branch 'master' of git://factorcode.org/git/factor are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (2): When a factor has

Re: [Factor-talk] Semantic errors with specialized methods (GENERIC: and M:)

mail offline. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Open Source Business Conference (OSBC), March 24-25, 2009, San Francisco, CA -OSBC tackles the biggest issue in open source: Open

[Factor-talk] Pull request: math.text.french

The following changes since commit 6e9f0dbfdd8987741b56f4c26403e5852ec5a1c3: Slava Pestov (1): Update http.client docs for PUT request and stream post-data are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (2): Put 3digit-groups

Re: [Factor-talk] Locals Usage

let the code talk and wouldn't allow myself to criticize his (very useful IMO) experiments, even if I would prefer the Factor standard library to be more in a stack-oriented style. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net

[Factor-talk] Bogus example in client help

(scratchpad) \ client help [...] Examples www.apple.com http inet utf8 client [...] ( scratchpad ) www.apple.com http inet utf8 client Type check error Object: http Object type: string Expected type: fixnum -- This

Re: [Factor-talk] Bogus example in client help

Sam == Samuel Tardieu s...@rfc1149.net writes: Sam And with IPv6, even the host name is not automatically resolved: Another problem: the IPv6 address components (between colons) are stored in a byte array while they are 16 bits long. Fix is available from git://git.rfc1149.net/factor.git

Re: [Factor-talk] FUEL, what is it?

-- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- Check out the new SourceForge.net Marketplace. It is the best place to buy or sell services for just about anything Open Source. http://p.sf.net/sfu/Xq1LFB

Re: [Factor-talk] An alternative for foldable?

Sam == Samuel Tardieu s...@rfc1149.net writes: Sam What is the best way to initialize primes-under-million at Sam parsing time? One intermediate solution is to make it foldable despite its output being mutable. This is not worse semantically than what was done before when the list was hardcoded

Re: [Factor-talk] An alternative for foldable?

call it as a toplevel form and drop the result. Doug Fair enough. Pushed to the same place as well. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net

Re: [Factor-talk] math.primes reorganization

, it was a very pleasant reading! Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- ___ Factor-talk mailing list Factor-talk@lists.sourceforge.net https

[Factor-talk] An alternative for foldable?

-primes ( -- n ) 2 10 primes-between sum ; compute their content as compile time. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- ___ Factor-talk mailing

Re: [Factor-talk] An alternative for foldable?

time if the bounds are. Sam -- Samuel Tardieu -- s...@rfc1149.net -- http://www.rfc1149.net/ -- ___ Factor-talk mailing list Factor-talk@lists.sourceforge.net https

[Factor-talk] Pull request: sigma change

/git/factor are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (2): Allow sigma and friends to use the stack Project Euler - problem 57 core/sequences/sequences.factor |2 +- extra/project-euler/057/057.factor

[Factor-talk] Pull request: bit arrays were not properly set or cleared

The following changes since commit 321919d210182f30d0ca63fc4cd67c137118f0f4: Eduardo Cavazos (1): easy-help: Add 'List:' are available in the git repository at: git://git.rfc1149.net/factor.git for-slava Samuel Tardieu (1): Properly set bits in large bit arrays basis/bit

[Factor-talk] [PATCH, was: Re: cleave, 2cleave, and spread] Use more combinators

--- I replaced uses of keep by bi in those two files. I cannot tell whether I prefer the one or the other, as using bi with quotations returning more than one value on the stack may seem strange, but I'm getting slowly used to it. Feel free to git am if you wish, this message should be in the

Re: [Factor-talk] [PATCH, was: Re: cleave, 2cleave, and spread] Use more combinators

Slava == Slava Pestov [EMAIL PROTECTED] writes: Slava Using bi with quotations that take 1 value from the stack Slava is not idiomatic. Yeah, that's my feeling too. You can get a partial cleanup from git://www.rfc1149.net/factor.git for-slava Sam -- Samuel Tardieu -- [EMAIL PROTECTED

Re: [Factor-talk] fry

needs a '[ in place of the last [. -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2008. http://clk.atdmt.com

Re: [Factor-talk] iPhone

. Doesn't it mean that the Factor VM needs to be distributed through the Apple store? How would they prevent the execution of code coming from the image? Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net

[Factor-talk] Factor on Nokia N95?

Out of curiosity, has anyone attempted to port Factor to the Nokia N95 (or the S60 series)? Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - SF.Net email is sponsored by: Check out the new

[Factor-talk] Standalone applications in Factor

-lived bugs in GCC's Ada front-end at this time) Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - SF.Net email is sponsored by: Check out the new SourceForge.net Marketplace. It's the best place to buy

Re: [Factor-talk] unit tests

Phil == Phil Dawes [EMAIL PROTECTED] writes: Phil [ { 2 3 3 5 6 7 } ulong-array ] Phil [ { 5 3 2 6 7 3 } ulong-array natural-sort ] unit-test I forgot 1array in my previous answer: { 2 3 3 5 6 7 } ulong-array 1array [ { 5 3 2 6 7 3 } ulong-array natural-sort ] unit-test

Re: [Factor-talk] Efficient way of adding a word in front of a quotation

Slava == Slava Pestov [EMAIL PROTECTED] writes: Slava What are you coding? Nothing particular yet, just playing. Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - This SF.net email is sponsored

Re: [Factor-talk] RSS/XML error with Samuel Tardieu ’s atom feed

/blog/tag/factor/feed/atom/). Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - This SF.net email is sponsored by: Splunk Inc. Still grepping through log files to find problems? Stop. Now Search log

[Factor-talk] Question about vm/primitives.h

I think it *must* do the assignment at the right place) And even if the compiler has a valid reason to move the assignment around, wouldn't it be enough to make stack_chain-callstack_top volatile? Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net

[Factor-talk] Abusing curry?

I was in the need of a unique word which, given a sequence, builds a new sequence of the same kind with unique elements of the input sequence while keeping the same order (only subsequent duplicate elements must be ommited). I ended up with: : unique ( seq -- newseq ) [ dup length

Re: [Factor-talk] Factor Constants

Jeff == Jeff Ervin [EMAIL PROTECTED] writes: Jeff : data { { x 4 z } { 1 x z } { z x y } } ; Jeff is there any way to do this in Factor? In your particular example, you can do: : data [ x , 4 , z , 1 , x , z , z , x , y , ] { } make 3 group ; Sam -- Samuel Tardieu -- [EMAIL PROTECTED

Re: [Factor-talk] ICFP Contest

Dan == Daniel Ehrenberg [EMAIL PROTECTED] writes: Dan Anyone interested in joining the ICFP Contest with me and ghm33? Dan If so, email me. So, how is it going so far? Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net

Re: [Factor-talk] [ann] mercurial mirror

Adam == Adam Wendt [EMAIL PROTECTED] writes: Adam Hmm I must be missing something, how can i 'hg pull' from this? Adam complains about no repository found. hg clone http://mercurial.creo.hu/repos/factor-hg/ - Take

Re: [Factor-talk] Newbie questions, words and shuffling

) myTestInit add* myTestWord ; : main ( -- ) { Two Three Four } myTestDriver ; Sam -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's

Re: [Factor-talk] prune

would confuse it. -- Samuel Tardieu -- [EMAIL PROTECTED] -- http://www.rfc1149.net/ - Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions

Re: [Factor-talk] x86 register usage

Sam == Samuel Tardieu [EMAIL PROTECTED] writes: Sam I have a few questions concerning execute() in vm/cpu-x86.[hS] I also have a question regarding native_stack_pointer(). Would not the following version (in cpu-x86.h) be cleaner and more efficient? INLINE void *native_stack_pointer(void