Commit Graph

46 Commits (dff051696eb3ecda883a12e3f056257cf50406e8)

Author SHA1 Message Date
John Benediktsson 1d38dce342 Revert "Temporary patch for dlists equality testing"
This reverts commit dbc6c37a37423a1672825b667bf5ca4844d5fc88.
2014-04-27 15:24:26 -07:00
Jon Harper 99c853e3c8 Temporary patch for dlists equality testing
Until https://github.com/slavapestov/factor/issues/1027 is resolved
2014-04-27 15:24:25 -07:00
John Benediktsson fb63772e9d dlists: make push-sorted inline 2013-09-18 18:22:58 -07:00
John Benediktsson d8f258d47e dlists: adding push-before and push-sorted. 2013-09-18 18:17:45 -07:00
John Benediktsson 4e72d80256 Using "same?" in more places. 2012-07-21 10:22:44 -07:00
John Benediktsson 5f77fe82f0 dlists: fix tests using list. 2012-07-13 19:10:55 -07:00
John Benediktsson 6f20c2fa61 dlists: simpler equality. 2012-07-13 17:29:20 -07:00
John Benediktsson fd61f71956 dlists: fix equality when custom dlist-link nodes are used. 2012-07-13 16:56:28 -07:00
John Benediktsson 20046a08a7 dlists: fix stack effect names. 2012-07-13 16:21:29 -07:00
John Benediktsson 40db157be2 dlists: rename "dlist>seq" to "dlist>sequence". 2012-07-13 15:53:38 -07:00
John Benediktsson 9f56eb6981 dlists: rename "seq>dlist" to ">dlist". 2012-07-13 15:15:14 -07:00
Doug Coleman 3507b9bad7 classes:
- Allow methods to dispatch off union{ } and intersection{ } classes.
- Add not{ } anonymous-complement syntax.
- Define class-name for anonymous-union/intersection/complement and maybes, and clean up pprint.
- Change maybe: foo to maybe{ foo }
- Call sort-classes when making anonymous-union/anonymous-intersection classes so that they are canonicalized.
2012-05-03 19:45:30 -07:00
Doug Coleman 17cc8ad1f3 dlists: use maybe: dlist-link. 2011-11-22 19:38:46 -08:00
Doug Coleman 9ae3b50a53 dlists: make a dlist-link tuple so you can "be the node" by subclassing it. this allows you go put a type on the obj>> slot. ensure that dlist nodes are returned with prev/next pointers set to f so they can be reused. dlist-filter used to work destructively on the dlist, make a new dlist instead because the combinator relied on using prev/next of deleted nodes. 2011-11-15 16:33:16 -08:00
John Benediktsson 786bba8a63 deques: adding ?peek-front and ?peek-back. 2011-11-08 13:20:56 -08:00
Doug Coleman 86c35999f9 dlists: fix compile error 2011-11-02 21:57:31 -07:00
Doug Coleman e6bde7c6aa Tweak the dlist equal? word. 2011-11-02 19:53:40 -07:00
Doug Coleman e57b8e5e4a Implement equal? on dlists. Fixes #338. 2011-11-02 19:30:54 -07:00
Doug Coleman 3f4f8c678d Add a seq>dlist word and make a dlist literal DL{
Implement prettyprint on dlists.
2011-10-29 01:05:37 -07:00
Doug Coleman 51c033a1f6 Fix all failures in the linux64 build email 2011-10-24 19:33:09 -07:00
Doug Coleman a2804ebf54 find-dlist-node was returning duplicated information -- node/f tells you enough, no need for another boolean return value 2011-10-17 18:58:14 -07:00
John Benediktsson 1987deb359 Fix M: stack effects. 2011-10-13 16:41:17 -07:00
Slava Pestov 627295f094 Language change: tuple slot setter words with stack effect ( value object -- ) are now named FOO<< instead of (>>FOO) 2010-05-06 17:21:02 -04:00
Slava Pestov 1b4b1a180c Some minor pointless optimizations 2010-04-01 20:09:14 -04:00
Joe Groff 191ac353fd generalize stack effects so we can bootstrap with the stricter stack effect checking 2010-03-08 23:38:10 -08:00
Slava Pestov 220dd88a2c Update documentation for new help lint check 2010-02-19 12:31:52 +13:00
Doug Coleman 8c1d202b4c Rename accumulator to collector, pusher to selector 2010-01-22 15:00:53 -06:00
Slava Pestov 0612bc6177 Factor source files should not be executable 2009-11-21 17:50:43 -06:00
Keith Lazuka 405e5d015b docs: change $subsection to $subsections 2009-10-02 12:15:48 -04:00
Joe Groff cbb1f1c60b docs for dlist-filter 2009-05-09 20:15:03 -05:00
Joe Groff 8cbcb87152 don't mess with the orphaned nodes when pop-front-ing or pop-back-ing a dlist. add a dlist-filter word that drops off all nodes that don't satisfy a predicate 2009-05-09 14:33:17 -05:00
Doug Coleman 3c408342ef renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail 2009-01-29 22:19:07 -06:00
Slava Pestov 7851aac222 Replace some usages of prepose with fry 2009-01-25 23:04:35 -06:00
Slava Pestov 3e25d14e54 Code cleanup: refactoring usages of rot and -rot to use newer idioms instead 2008-11-30 17:47:29 -06:00
Slava Pestov 5299f104e9 [ drop t ] pusher == [ ] accumulator 2008-11-30 04:51:17 -06:00
Doug Coleman 09a431f0b3 dlist>seq now preserves f entries as reported by leifkb 2008-11-29 20:15:04 -06:00
Doug Coleman 4b6126f92a remove >r r> from various vocabs 2008-11-29 13:29:19 -06:00
Slava Pestov 134dacdb6b Fix help lint 2008-11-16 07:04:51 -06:00
Slava Pestov 4f77607c13 Fix tests, and clear-deque on dlists 2008-11-16 06:57:53 -06:00
Slava Pestov 9c84ad8944 Unrolled lists 2008-11-16 05:59:14 -06:00
Slava Pestov 7fc13ef03c dlists no longer have a length slot; tweak dlist code so that types infer better 2008-11-16 05:53:25 -06:00
Slava Pestov f1a1a4c1cb Cloning a dlist did not clone its nodes, and so was useless 2008-11-11 10:56:58 -06:00
Slava Pestov c19f2257f4 Fix permission bits 2008-10-02 08:34:49 -05:00
Daniel Ehrenberg 1c13a6a4b9 Deque name change 2008-08-19 21:06:20 +02:00
Slava Pestov 279aeddeb3 Various fixes 2008-07-30 04:12:17 -05:00
Slava Pestov d66f887736 Create basis vocab root 2008-07-28 22:03:13 -05:00