Topic: algorithm match sequance


Author: Vishal Oza <vickoza@gmail.com>
Date: Sat, 7 Nov 2015 17:23:17 -0800 (PST)
Raw View
------=_Part_620_1624450708.1446945797147
Content-Type: multipart/alternative;
 boundary="----=_Part_621_1201450864.1446945797147"

------=_Part_621_1201450864.1446945797147
Content-Type: text/plain; charset=UTF-8

is there a sequence matching algorithm is the algorithm library?
It should take two sets of iterators and check if the second sequence is in
the first sequence and return where in the first sequence does the first
pattern define by the second sequence begin

--

---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.

------=_Part_621_1201450864.1446945797147
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">is there a sequence matching algorithm is the algorithm li=
brary?<div>It should take two sets of iterators and check if the second seq=
uence is in the first sequence and return where in the first sequence does =
the first pattern define by the second sequence begin=C2=A0</div></div>

<p></p>

-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />

------=_Part_621_1201450864.1446945797147--
------=_Part_620_1624450708.1446945797147--

.


Author: Patrice Roy <patricer@gmail.com>
Date: Sat, 7 Nov 2015 20:43:28 -0500
Raw View
--001a113ecc0a7254ca0523fd9aef
Content-Type: text/plain; charset=UTF-8

Would *http://en.cppreference.com/w/cpp/algorithm/search
<http://en.cppreference.com/w/cpp/algorithm/search> *be what you are
looking for?

2015-11-07 20:23 GMT-05:00 Vishal Oza <vickoza@gmail.com>:

> is there a sequence matching algorithm is the algorithm library?
> It should take two sets of iterators and check if the second sequence is
> in the first sequence and return where in the first sequence does the first
> pattern define by the second sequence begin
>
> --
>
> ---
> You received this message because you are subscribed to the Google Groups
> "ISO C++ Standard - Future Proposals" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to std-proposals+unsubscribe@isocpp.org.
> To post to this group, send email to std-proposals@isocpp.org.
> Visit this group at
> http://groups.google.com/a/isocpp.org/group/std-proposals/.
>

--

---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.

--001a113ecc0a7254ca0523fd9aef
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Would <b><a href=3D"http://en.cppreference.com/w/cpp/algor=
ithm/search">http://en.cppreference.com/w/cpp/algorithm/search</a> </b>be w=
hat you are looking for?<br></div><div class=3D"gmail_extra"><br><div class=
=3D"gmail_quote">2015-11-07 20:23 GMT-05:00 Vishal Oza <span dir=3D"ltr">&l=
t;<a href=3D"mailto:vickoza@gmail.com" target=3D"_blank">vickoza@gmail.com<=
/a>&gt;</span>:<br><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 =
..8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr">is there=
 a sequence matching algorithm is the algorithm library?<div>It should take=
 two sets of iterators and check if the second sequence is in the first seq=
uence and return where in the first sequence does the first pattern define =
by the second sequence begin=C2=A0</div></div><span class=3D"HOEnZb"><font =
color=3D"#888888">

<p></p>

-- <br>
<br>
--- <br>
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; group.<br>
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org" target=3D"_=
blank">std-proposals+unsubscribe@isocpp.org</a>.<br>
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org" target=3D"_blank">std-proposals@isocpp.org</a>.<br>
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/" target=3D"_blank">http://groups.google.com/a/isocpp.org/gro=
up/std-proposals/</a>.<br>
</font></span></blockquote></div><br></div>

<p></p>

-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />

--001a113ecc0a7254ca0523fd9aef--

.


Author: Vishal Oza <vickoza@gmail.com>
Date: Sat, 7 Nov 2015 20:18:10 -0800 (PST)
Raw View
------=_Part_4091_2007523156.1446956290587
Content-Type: multipart/alternative;
 boundary="----=_Part_4092_1226576353.1446956290587"

------=_Part_4092_1226576353.1446956290587
Content-Type: text/plain; charset=UTF-8

thank I did not find this find this at first

On Saturday, November 7, 2015 at 7:43:29 PM UTC-6, Patrice Roy wrote:
>
> Would *http://en.cppreference.com/w/cpp/algorithm/search
> <http://en.cppreference.com/w/cpp/algorithm/search> *be what you are
> looking for?
>
> 2015-11-07 20:23 GMT-05:00 Vishal Oza <vic...@gmail.com <javascript:>>:
>
>> is there a sequence matching algorithm is the algorithm library?
>> It should take two sets of iterators and check if the second sequence is
>> in the first sequence and return where in the first sequence does the first
>> pattern define by the second sequence begin
>>
>> --
>>
>> ---
>> You received this message because you are subscribed to the Google Groups
>> "ISO C++ Standard - Future Proposals" group.
>> To unsubscribe from this group and stop receiving emails from it, send an
>> email to std-proposal...@isocpp.org <javascript:>.
>> To post to this group, send email to std-pr...@isocpp.org <javascript:>.
>> Visit this group at
>> http://groups.google.com/a/isocpp.org/group/std-proposals/.
>>
>
>

--

---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.

------=_Part_4092_1226576353.1446956290587
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">thank I did not find this find this at first<br><br>On Sat=
urday, November 7, 2015 at 7:43:29 PM UTC-6, Patrice Roy wrote:<blockquote =
class=3D"gmail_quote" style=3D"margin: 0;margin-left: 0.8ex;border-left: 1p=
x #ccc solid;padding-left: 1ex;"><div dir=3D"ltr">Would <b><a href=3D"http:=
//en.cppreference.com/w/cpp/algorithm/search" target=3D"_blank" rel=3D"nofo=
llow" onmousedown=3D"this.href=3D&#39;http://www.google.com/url?q\75http%3A=
%2F%2Fen.cppreference.com%2Fw%2Fcpp%2Falgorithm%2Fsearch\46sa\75D\46sntz\07=
51\46usg\75AFQjCNGTRKhsT1xIDxvpPEkfQJurZgncdA&#39;;return true;" onclick=3D=
"this.href=3D&#39;http://www.google.com/url?q\75http%3A%2F%2Fen.cppreferenc=
e.com%2Fw%2Fcpp%2Falgorithm%2Fsearch\46sa\75D\46sntz\0751\46usg\75AFQjCNGTR=
KhsT1xIDxvpPEkfQJurZgncdA&#39;;return true;">http://en.cppreference.com/w/<=
wbr>cpp/algorithm/search</a> </b>be what you are looking for?<br></div><div=
><br><div class=3D"gmail_quote">2015-11-07 20:23 GMT-05:00 Vishal Oza <span=
 dir=3D"ltr">&lt;<a href=3D"javascript:" target=3D"_blank" gdf-obfuscated-m=
ailto=3D"TpjGp3gbFgAJ" rel=3D"nofollow" onmousedown=3D"this.href=3D&#39;jav=
ascript:&#39;;return true;" onclick=3D"this.href=3D&#39;javascript:&#39;;re=
turn true;">vic...@gmail.com</a>&gt;</span>:<br><blockquote class=3D"gmail_=
quote" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1=
ex"><div dir=3D"ltr">is there a sequence matching algorithm is the algorith=
m library?<div>It should take two sets of iterators and check if the second=
 sequence is in the first sequence and return where in the first sequence d=
oes the first pattern define by the second sequence begin=C2=A0</div></div>=
<span><font color=3D"#888888">

<p></p>

-- <br>
<br>
--- <br>
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; group.<br>
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"javascript:" target=3D"_blank" gdf-obfuscated-mailto=3D"=
TpjGp3gbFgAJ" rel=3D"nofollow" onmousedown=3D"this.href=3D&#39;javascript:&=
#39;;return true;" onclick=3D"this.href=3D&#39;javascript:&#39;;return true=
;">std-proposal...@<wbr>isocpp.org</a>.<br>
To post to this group, send email to <a href=3D"javascript:" target=3D"_bla=
nk" gdf-obfuscated-mailto=3D"TpjGp3gbFgAJ" rel=3D"nofollow" onmousedown=3D"=
this.href=3D&#39;javascript:&#39;;return true;" onclick=3D"this.href=3D&#39=
;javascript:&#39;;return true;">std-pr...@isocpp.org</a>.<br>
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/" target=3D"_blank" rel=3D"nofollow" onmousedown=3D"this.href=
=3D&#39;http://groups.google.com/a/isocpp.org/group/std-proposals/&#39;;ret=
urn true;" onclick=3D"this.href=3D&#39;http://groups.google.com/a/isocpp.or=
g/group/std-proposals/&#39;;return true;">http://groups.google.com/a/<wbr>i=
socpp.org/group/std-<wbr>proposals/</a>.<br>
</font></span></blockquote></div><br></div>
</blockquote></div>

<p></p>

-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />

------=_Part_4092_1226576353.1446956290587--
------=_Part_4091_2007523156.1446956290587--

.