Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2005

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

Search the Archive

the faster way to find repeated sublists

  • To: mathgroup at smc.vnet.net
  • Subject: [mg60923] the faster way to find repeated sublists
  • From: "giampiero" <giampiero196019 at yahoo.it>
  • Date: Tue, 4 Oct 2005 01:24:52 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

i'm newbie
with a stupid problem

a function for find repetead sublist in faster way

ex
f[{1,2,1,2,1,2},{1,2}]-> True cause {1,2} is repated three times
f[{1,2,3,1,2,3},{1,2,3}]-> True cause {1,2,3} is repeated two times
f[{1,2,1,2,3},{1,2}]->False cause after two {1,2} there is another
symbol.

True if the second list in containes many times exactly in first list
False otherwise.


bye everyone and sorry for my stupidity.

giampiero


  • Prev by Date: Re: BinCounts
  • Next by Date: Pure Function for String Selection
  • Previous by thread: Re: Re: String to list
  • Next by thread: Re: the faster way to find repeated sublists