473,327 Members | 1,997 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,327 software developers and data experts.

Stroustrup 5.9 exercise 12

problem: write a function that counts the number of occurences of a
pair of letters in a string. e.g the pair "ab" appears twice in
"xabaacbaxabb".

i thought i could use "count()" from standard library but that works on
a container and "std::string" is not a container, its a class. even if
i put the "std::string" into a container then it will act as one elemnt
only e.g ["xabaaacbaxabb"] and hence count will not work (i tried it).
so can you please give some idea in solving this problem?

Nov 9 '06 #1
8 2219
"arnuld" <ar*****@gmail.comwrites:
problem: write a function that counts the number of occurences of a
pair of letters in a string. e.g the pair "ab" appears twice in
"xabaacbaxabb".

i thought i could use "count()" from standard library but that works on
a container and "std::string" is not a container, its a class. even if
i put the "std::string" into a container then it will act as one elemnt
only e.g ["xabaaacbaxabb"] and hence count will not work (i tried it).
so can you please give some idea in solving this problem?
loop through each position in the string, taking this position + 1 as
a string, feed it into a map<string,intmymap[ab]=i++.
Nov 9 '06 #2
arnuld wrote:
problem: write a function that counts the number of occurences of a
pair of letters in a string. e.g the pair "ab" appears twice in
"xabaacbaxabb".

i thought i could use "count()" from standard library but that works on
a container and "std::string" is not a container, its a class. even if
i put the "std::string" into a container then it will act as one elemnt
only e.g ["xabaaacbaxabb"] and hence count will not work (i tried it).
so can you please give some idea in solving this problem?
You can use the find method of the string object.

#include <iostream>
#include <string>

using namespace std;

int
main () {
// The string
string str = "xabaacbaxabb";
// The null pos
string::size_type pos = string::npos;
// Count matches
int count = 0;

// Set pos to next match
// Search for it again on next pos
// Until stop matching
while ((pos = str.find("ab", pos+1)) != string::npos) {
// Increment your counter while matches
count++;
}
cout << count << endl;
return 0;
}
You can also put everything inside a for loop:

for (pos = string::npos, count = 0;
(pos = haystack.find(needle, pos+1)) != string::npos;
count++)
;

--renato

--
Reclaim your digital rights, eliminate DRM, learn more at
http://www.defectivebydesign.org/what_is_drm
Nov 9 '06 #3
Renato Golin wrote:
You can use the find method of the string object.

#include <iostream>
#include <string>

using namespace std;

int
main () {
// The string
string str = "xabaacbaxabb";
// The null pos
string::size_type pos = string::npos;
// Count matches
int count = 0;

// Set pos to next match
// Search for it again on next pos
// Until stop matching
while ((pos = str.find("ab", pos+1)) != string::npos) {
// Increment your counter while matches
count++;
}
cout << count << endl;
return 0;
}
hey, it works, thanks :-) but i did not understand what "string::npos"
does.
>
You can also put everything inside a for loop:

for (pos = string::npos, count = 0;
(pos = haystack.find(needle, pos+1)) != string::npos;
count++)
;
what exactly the "haystack" is ?

Nov 9 '06 #4
arnuld wrote:
hey, it works, thanks :-) but i did not understand what "string::npos"
does.
npos is the null-position or no-position and it's a value defined by the
string implementation as "no position within this string". Each
implementation can create whatever number it wants to (negative,
MAX_INT, etc) so, to do a portable code you should never compare it to
the number you have now as "end-of-string" but to npos.

As zero is the first position it cannot be used to check if the find is
successful or not such as in:

if (!string.find("foo"))

or

if ((pos = string.find("foo")) == 0)

In my implementation, string::npos is 4294967295 (or max unsigned int)
as it does not allow strings bigger than that (I suppose). You can check
yours by simply:

cout << string::npos << endl;

But you should never use that value to check if the position is valid or
not.

Note that you should set pos to npos at the beginning because, if
something fails with find you will not be locked in that loop.

what exactly the "haystack" is ?
Literally is horse's food (normally loads of them), but it's a common
term used in search algorithms because of the phrase "finding a needle
in a haystack".

In algorithms phraseology. 'haystack' is the text or collection of
things you have and 'needle' is what you want to find there.

cheers,
--renato

--
Reclaim your digital rights, eliminate DRM, learn more at
http://www.defectivebydesign.org/what_is_drm
Nov 9 '06 #5
arnuld <ar*****@gmail.comwrote:
i thought i could use "count()" from standard library but that works on
a container and "std::string" is not a container, its a class.
Actually, std::string is a container of chars, but with a different
interface than the standard "containers".

std::string is actually a typedef of std::basic_string<char>.

--
Marcus Kwok
Replace 'invalid' with 'net' to reply
Nov 9 '06 #6

Renato Golin wrote in message ...
>
In my implementation, string::npos is 4294967295 (or max unsigned int)
** as it does not allow strings bigger than that (I suppose)**. You can
check
>yours by simply:

cout << string::npos << endl;
std::string Aname( "hello" );
std::cout<<" string::npos ="<< std::string::npos << std::endl;
std::cout<<" string Aname.npos ="<< Aname.npos << std::endl;
std::cout<<" string Aname.max_size() ="<< Aname.max_size() << std::endl;
/* --- output --- (win32, MinGW(GCC)) YMMV
string::npos =4294967295
string Aname.npos =4294967295
string Aname.max_size() =1073741820 <<--------
*/

--
Bob R
POVrookie
Nov 9 '06 #7
BobR wrote:
string Aname.npos =4294967295
string Aname.max_size() =1073741820 <<--------
Good point bob,

I wonder why they limit to 1G instead of 4G-1...

--renato

--
Reclaim your digital rights, eliminate DRM, learn more at
http://www.defectivebydesign.org/what_is_drm
Nov 10 '06 #8

Renato Golin wrote in message
<45*********************@newsread.sanger.ac.uk>. ..
>BobR wrote:
> string Aname.npos =4294967295
string Aname.max_size() =1073741820 <<--------

Good point bob,

I wonder why they limit to 1G instead of 4G-1...
renato
My rule is: when the string gets to be 999meg, I switch to vector<stringto
break it up a little. <G>

When is the last time you really needed a string that big?

On an old 40 column machine, using an old 66 lines per page printer, that's
nearly 380,000 pages! PER string!!<GThat's a lot of trees!! So, by limiting
it to 1G, they were doing their part for conservation.
{ I gotta quit watching those old 'Three Stooges' movies! Nyuck nyuck nyuck.}

--
Bob R
POVrookie
Nov 11 '06 #9

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

26
by: Oplec | last post by:
Hi, I am learning standard C++ as a hobby. The C++ Programming Language : Special Edition has been the principal source for my information. I read the entirety of the book and concluded that I...
7
by: arnuld | last post by:
problem: define functions F(char), g(char&) & h(const char&). call them with arguments 'a', 49, 3300, c, uc & sc where c is a char, uc is unsigned char & sc is signed char. whihc calls are legal?...
0
by: arnuld | last post by:
Stroustrup has a table in section 4.9 of declarations and definitions. he asks to write a similar table but in opposite sense: char ch; // declaration with definition he asks to do the...
0
by: arnuld | last post by:
this programme runs without any trouble. it took 45 minutes of typing. i posted it here so that people can save their precious time: // Stroustrup special edition // chapter 4 exercise 2 //...
2
by: arnuld | last post by:
MAX and MIN values of CHAR could not be displayed. Why ? BTW, any advice on improvement ? (please remember i have covered chapter 4 only) ------------- PROGRAMME -------------- /*...
16
by: arnuld | last post by:
i did what i could do at Best to solve this exercise and this i what i have come up with: ----------- PROGRAMME -------------- /* Stroustrup 5.9, exercise 3 STATEMENT: Use typedef to define...
11
by: arnuld | last post by:
/* Stroustrup: 5.9 exercise 7 STATEMENTS: Define a table of the name sof months o fyear and the number of days in each month. write out that table. Do this twice: 1.) using ar array of char...
6
by: arnuld | last post by:
this one was much easier and works fine. as usual, i put code here for any further comments/views/advice: --------- PROGRAMME ------------ /* Stroustrup: 5.9 exercise 7 STATEMENTS: Define a...
14
by: arnuld | last post by:
there is no "compile-time error". after i enter input and hit ENTER i get a run-time error. here is the code: ---------- PROGRAMME -------------- /* Stroustrup, 5.9, exercise 11 STATEMENT:...
27
by: arnuld | last post by:
it works fine without any trouble. i want to have advice on improving the code from any angle like readability, maintenance etc: ---------- PROGRAMME ------------ /* Stroustrup, 5.9, exercise 11...
0
by: DolphinDB | last post by:
Tired of spending countless mintues downsampling your data? Look no further! In this article, you’ll learn how to efficiently downsample 6.48 billion high-frequency records to 61 million...
0
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
1
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
0
by: Vimpel783 | last post by:
Hello! Guys, I found this code on the Internet, but I need to modify it a little. It works well, the problem is this: Data is sent from only one cell, in this case B5, but it is necessary that data...
0
by: jfyes | last post by:
As a hardware engineer, after seeing that CEIWEI recently released a new tool for Modbus RTU Over TCP/UDP filtering and monitoring, I actively went to its official website to take a look. It turned...
1
by: PapaRatzi | last post by:
Hello, I am teaching myself MS Access forms design and Visual Basic. I've created a table to capture a list of Top 30 singles and forms to capture new entries. The final step is a form (unbound)...
1
by: CloudSolutions | last post by:
Introduction: For many beginners and individual users, requiring a credit card and email registration may pose a barrier when starting to use cloud servers. However, some cloud server providers now...
1
by: Defcon1945 | last post by:
I'm trying to learn Python using Pycharm but import shutil doesn't work
1
by: Shællîpôpï 09 | last post by:
If u are using a keypad phone, how do u turn on JavaScript, to access features like WhatsApp, Facebook, Instagram....

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.