I found the following code fragment in the C++ Primer(Fourth Edition)
by Stanley Lippman in page 213.
string inBuf;
while (cin >inBuf && ! inBuf.empty( ) )
{
// do something
}
Here is the condition check ( ! inBuf.empty() ) needed ?
is it possible that the expression ( cin >inBuf ) is true but still
inBuf is empty ?
Kindly explain. 4 2398
Hmmmm... This seems like some very odd coding to me, however I would
expand it to this:
while (1)
{
cin >inBuf;
if (inBuf != null)
{
// do something
}
else break;
}
// end of program
Basically, the program gets input. If the input is not null it
continues to process. If it is null, it ends. Here might be an example
of usage:
while (cin >(int) integerValue && integerValue != null )
{
counter += inegerValue;
cout << counter << "\n";
}
cout << "\n\nThe total is: " << counter;
It is essentially a null terminated loop. _I think_ su**************@yahoo.com, India wrote:
I found the following code fragment in the C++ Primer(Fourth Edition)
by Stanley Lippman in page 213.
string inBuf;
while (cin >inBuf && ! inBuf.empty( ) )
{
// do something
}
Here is the condition check ( ! inBuf.empty() ) needed ?
is it possible that the expression ( cin >inBuf ) is true but still
inBuf is empty ?
Let's see. The part cin >inBuf evaluates to cin which then converts via
void* to bool. The value is !(cin.fail()). However, if the extraction
operator does not actually extract some operators, it will set the failbit
[see 21.3.7.9/2a] Thus, if cin>>inBuf converts to true, we know that the
failbit was not set and thus at least one character was extracted.
Hence, the loop above should be equivalent to:
string inBuf;
while ( cin >inBuf ) {
assert( ! inBuf.empty() ); // [see 21.3.7.9/2a]
// do something
}
Best
Kai-Uwe Bux
On Jun 19, 9:49 am, Kai-Uwe Bux <jkherci...@gmx.netwrote:
Let's see. The part cin >inBuf evaluates to cin which then converts via
void* to bool. The value is !(cin.fail()). However, if the extraction
operator does not actually extract some operators, it will set the failbit
[see 21.3.7.9/2a] Thus, if cin>>inBuf converts to true, we know that the
failbit was not set and thus at least one character was extracted.
Hence, the loop above should be equivalent to:
string inBuf;
while ( cin >inBuf ) {
assert( ! inBuf.empty() ); // [see 21.3.7.9/2a]
// do something
}
Best
Kai-Uwe Bux
My doubt still persists since I am a beginner. As you have mentioned
that at least one character would have been extracted if (cin >>
inBuf) were to be true, it means that inBuf is non-empty; isn't it ?
Then why do we require the checking
( ! inBuf.empty() ).
Kindly explain
Thanks
V.Subramanian su**************@yahoo.com, India wrote:
On Jun 19, 9:49 am, Kai-Uwe Bux <jkherci...@gmx.netwrote:
>Let's see. The part cin >inBuf evaluates to cin which then converts via void* to bool. The value is !(cin.fail()). However, if the extraction operator does not actually extract some operators, it will set the failbit [see 21.3.7.9/2a] Thus, if cin>>inBuf converts to true, we know that the failbit was not set and thus at least one character was extracted.
Hence, the loop above should be equivalent to:
string inBuf; while ( cin >inBuf ) { assert( ! inBuf.empty() ); // [see 21.3.7.9/2a] // do something }
Best
Kai-Uwe Bux
My doubt still persists since I am a beginner. As you have mentioned
that at least one character would have been extracted if (cin >>
inBuf) were to be true, it means that inBuf is non-empty; isn't it ?
Correct, inBuf is non-empty inside the loop. That is the content of the
assert.
Then why do we require the checking
( ! inBuf.empty() ).
We don't require anything. I just put the assert in as a comment and as a
reminder for readers who may not know about [21.3.7.9/2a]. You can take it
out without loss (well, maybe you loose some verbosity and explicitness in
the code). In fact, if you compile the program with NDEBUG defined, the
compiler will take out the assert for you.
Best
Kai-Uwe Bux This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Mohammed Mazid |
last post by:
Can anyone please help me on how to move to the next and previous
question?
Here is a snippet of my code:
Private Sub cmdNext_Click()
End Sub
Private Sub cmdPrevious_Click()
showrecord
|
by: Stevey |
last post by:
I have the following XML file...
<?xml version="1.0"?>
<animals>
<animal>
<name>Tiger</name>
<questions>
<question index="0">true</question>
<question index="1">true</question>
</questions>
|
by: nospam |
last post by:
Ok, 3rd or is it the 4th time I have asked this question on Partial Types,
so, since it seems to me that Partial Types is still in the design or
development stages at Microsoft, I am going to ask...
|
by: Ekqvist Marko |
last post by:
Hi,
I have one Access database table including questions and answers. Now
I need to give answer id automatically to questionID column. But I
don't know how it is best (fastest) to do?
table...
|
by: glenn |
last post by:
I am use to programming in php and the way session and post vars are past
from fields on one page through to the post page automatically where I can
get to their values easily to write to a...
|
by: Rider |
last post by:
Hi, simple(?) question about asp.net configuration..
I've installed ASP.NET 2.0 QuickStart Sample successfully. But, When I'm
first start application the follow message shown.
=========
Server...
|
by: Jeff |
last post by:
In the function below, can size ever be 0 (zero)?
char *clc_strdup(const char * CLC_RESTRICT s)
{
size_t size;
char *p;
clc_assert_not_null(clc_strdup, s);
size = strlen(s) + 1;
|
by: spibou |
last post by:
In the statement "a *= expression" is expression assumed to be
parenthesized ? For example if I write "a *= b+c" is this the same
as "a = a * (b+c)" or "a = a * b+c" ?
|
by: Allan Ebdrup |
last post by:
Hi,
I'm trying to render a Matrix question in my ASP.Net 2.0 page, A matrix
question is a question where you have several options that can all be rated
according to several possible ratings (from...
|
by: Zhang Weiwu |
last post by:
Hello!
I wrote this:
..required-question p:after {
content: "*";
}
Corresponding HTML:
<div class="required-question"><p>Question Text</p><input /></div>
<div...
|
by: BarryA |
last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers,...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...
|
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing,...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new...
| |