Re: List representation using element position

• To: mathgroup at smc.vnet.net
• Subject: [mg72512] Re: List representation using element position
• From: "Ray Koopman" <koopman at sfu.ca>
• Date: Wed, 3 Jan 2007 05:24:37 -0500 (EST)
• References: <enfgem\$ss1\$1@smc.vnet.net>

```Dr. Wolfgang Hintze wrote:
> Hello group,
> happy new year to all of you!
>
> This one was put up in a slightly different form by me in March 2006.
> It is now more general and it is lossless with respect to information:
>
> Given a list of integers which may repeat, e.g.
>
> lstIn = {2,3,4,4,2,1,1,5,4}
>
> provide a list of the different values and their respective positions in
> the original list. In the example,
>
> LstOut= {
> 	{1,{6,7}},
> 	{2,{2,5}},
> 	{3,{2}},
> 	{4,{3,4,9}},
> 	{5,{8}}
> 	}
>
> Who finds the shortest function doing this task in general?
>
> My solution appears 15 lines below
>
> Thanks.
>
> Best regards,
> Wolfgang
> 1
>
>
>
> 5
>
>
>
>
> 10
>
>
>
>
> fPos[lstIn_] := Module[{f = Flatten /@ (Position[lstIn, #1] & ) /@
> Union[lstIn]}, ({#1, f[[#1]]} & ) /@ Range[Length[f]]]
>
> In[15]:=
> fPos[lstIn]
>
> Out[15]=
> {{1, {6, 7}}, {2, {1, 5}}, {3, {2}}, {4, {3, 4, 9}}, {5, {8}}}

fPoz[lstIn_] := {#[[1,1]],Last/@#}& /@ Split[
Sort@MapIndexed[Flatten@{##}&,lstIn], #1[[1]]==#2[[1]] ]

```

• Prev by Date: Re: Combining surfaces
• Next by Date: Re: Re: programming problem about elements taken
• Previous by thread: Re: List representation using element position
• Next by thread: Re: List representation using element position