MathGroup Archive 2005

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: removing sublist . Again and Different

  • To: mathgroup at smc.vnet.net
  • Subject: [mg56364] Re: [mg56305] removing sublist . Again and Different
  • From: Hui Fang <fangh73 at xmu.edu.cn>
  • Date: Fri, 22 Apr 2005 06:25:37 -0400 (EDT)
  • Organization: Xiamen University Photonics Center
  • References: <200504210936.FAA05089@smc.vnet.net>
  • Reply-to: fangh73 at xmu.edu.cn
  • Sender: owner-wri-mathgroup at wolfram.com

DeleteCases[{...,{1,2,3,4},...,{2,3},...}, {1,2,3,4}] will work. Is that 
what you want?

Hui Fang

giampi1960 wrote:

>hello i read borges2003xx at yahoo.it meassage :
>
>
>  
>
>>i'm a newbie. How implement the _faster functon_ which removes in a
>>list every element that are a subelement.
>>which means
>>f[x]:=  {..,{1,2,3,4},..,{2,3},..} removes {2,3}.
>>thanx a lot.
>>giorgio borghi
>>    
>>
>
>
>i ask your help for faster way to do the opposite
>f[x]:=  {..,{1,2,3,4},..,{2,3},..} removes {1,2,3,4}.
>
>best regards
>
>giampiero
>
>  
>


  • Prev by Date: Re: Sort problem
  • Next by Date: Re: Sort problem
  • Previous by thread: removing sublist . Again and Different
  • Next by thread: Re: removing sublist . Again and Different