Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.forth > #31144

Re: DON'T

Show all headers | View raw

On Saturday, May 31, 2014 2:58:13 PM UTC-7, Rod Pemberton wrote:

> But, your DON'T is _not_ related in any way to Forth's DO ...
> 
> Or, what's wrong with a DON'T ... LOOP ?
> 
> I think hear some laughter, but I'm not joking ...
> 
> Perhaps, DON'T could define a range to skip in a LOOP.
> 
> E.g., modified "Starting Forth" example for DO ... LOOP:
> 
> 10 0 3 7 DON'T  I .  LOOP
> 
> 0 1 2 7 8 9
> 
> It might be implementable with a conditional +LOOP when I is 3 ... ?
> 
> I have no serious thoughts on the order of 3 7 is 3 7 or 7 3 or
> whether 3 or 7 are inclusive or exclusive.  Your choice.

In my novice package I have ordered associations. I have the words WITHIN and WITHOUT that copy an association into another association. WITHIN only copies the nodes that are within a given range, and WITHOUT only copies the nodes that are not within the given range. The nodes are copied into another association --- if it is empty, then it gets filled with everything that got copied, but if it already has nodes in it then the nodes copied get merged into it. 

Note that copying nodes relies heavily on my implementation of ALLOCATE etc., that provides ALLOCATION. To copy a node, it is necessary to know how big the node is. The association may contain nodes of various different data types (all in the same parent-child chain), and hence of various different sizes. My code uses ALLOCATION internally to determine how much data to copy --- if the nodes contain pointers to other structs however, then the pointers just get copied over as data --- my code is not smart enough to recognize pointers and recursively copy the sub-structs.

Back to comp.lang.forth | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

DON'T Jason Damisch <jasondamisch@yahoo.com> - 2014-05-31 10:49 -0700
  Re: DON'T visualforth@rocketmail.com - 2014-05-31 10:56 -0700
    Re: DON'T bruce.mcfarling@gmail.com - 2014-06-16 08:00 -0700
      Re: DON'T "Alex McDonald" <blog@rivadpm.com> - 2014-06-16 16:16 +0100
        Re: DON'T Mark Wills <markwills1970@gmail.com> - 2014-06-16 10:56 -0700
          Re: DON'T "Alex McDonald" <blog@rivadpm.com> - 2014-06-17 08:05 +0100
            Re: DON'T bruce.mcfarling@gmail.com - 2014-06-17 08:10 -0700
              Re: DON'T Mark Wills <markwills1970@gmail.com> - 2014-06-18 01:54 -0700
                Re: DON'T bruce.mcfarling@gmail.com - 2014-06-18 02:34 -0700
        Re: DON'T BruceMcF <agila61@netscape.net> - 2014-06-16 15:39 -0700
  Re: DON'T "Rod Pemberton" <dont_use_email@xnothavet.cqm> - 2014-05-31 17:58 -0400
    Re: DON'T Jason Damisch <jasondamisch@yahoo.com> - 2014-05-31 15:15 -0700
      Re: DON'T Mark Wills <markwills1970@gmail.com> - 2014-05-31 15:21 -0700
    Re: DON'T "Elizabeth D. Rather" <erather@forth.com> - 2014-05-31 17:35 -1000
      Re: DON'T "Rod Pemberton" <dont_use_email@xnothavet.cqm> - 2014-06-01 00:14 -0400
    Re: DON'T hughaguilar96@yahoo.com - 2014-06-01 19:14 -0700
  Re: DON'T Paul Rubin <no.email@nospam.invalid> - 2014-05-31 15:26 -0700
  Re: DON'T chitselb <chitselb@gmail.com> - 2014-06-02 06:02 -0700
    Re: DON'T Coos Haak <chforth@hccnet.nl> - 2014-06-03 01:13 +0200
      Re: DON'T Bernd Paysan <bernd.paysan@gmx.de> - 2014-06-03 01:23 +0200
        Re: DON'T chitselb <chitselb@gmail.com> - 2014-06-05 14:42 -0700
          Re: DON'T BruceMcF <agila61@netscape.net> - 2014-06-18 14:27 -0700

csiph-web