Re: match 1, replace 2
- To: mathgroup at smc.vnet.net
- Subject: [mg56222] Re: [mg56199] match 1, replace 2
- From: yehuda ben-shimol <bsyehuda at gmail.com>
- Date: Wed, 20 Apr 2005 05:29:52 -0400 (EDT)
- References: <200504190854.EAA02514@smc.vnet.net>
- Reply-to: yehuda ben-shimol <bsyehuda at gmail.com>
- Sender: owner-wri-mathgroup at wolfram.com
I would use functional programming rather then pattern matching (rules)
Define a function f as the following
f[l_List] := Flatten[{Map[{100 + #, -1} &, Most[l]], Last[l]}]
and then Map[] it over ls
Map[f,ls]
and get
{{101, -1, 102, -1, 3}, {104, -1, 5}, {106, -1, 107, -1, 108, -1, 9}}
as you needed
yehuda
On 4/19/05, Trevor Baca <trevorbaca at gmail.com> wrote:
> hi mathgroup,
>
> what rule takes
>
> ls = {{1, 2, 3}, {4, 5}, {6, 7, 8, 9}}
>
> to
>
> {{101, -1, 102, -1, 3}, {104, -1, 5}, {106, -1, 107, -1, 108, -1,
> 9}}
>
> ie, matches all integers but the last in each list and then replaces
> each matched integer n with the 2-element sequence Sequence[100 + n,
> -1]?
>
> trevor.
>
>
- References:
- match 1, replace 2
- From: "Trevor Baca" <trevorbaca@gmail.com>
- match 1, replace 2