boostorg/utility
1
0
Fork 1
mirror of https://github.com/boostorg/utility.git synced 2026-04-29 10:13:25 +02:00
Code Issues Packages Projects Releases Wiki Activity

removed tabs

Browse Source 
[SVN r12707]
This commit is contained in:
Jeremy Siek
2002-02-04 20:29:35 +00:00
parent e27d0fcf2a
commit e6fc2555f3
8 changed files with 33 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tie_example.cpp
+3 -3
View File
@@ -41,9 +41,9 @@ main(int, char*[])
for (int k = 0; k < 2; ++k) {
boost::tie(i,inserted) = s.insert(new_vals[k]);
if (!inserted)
std::cout << *i << " was already in the set." << std::endl;
std::cout << *i << " was already in the set." << std::endl;
else
std::cout << *i << " successfully inserted." << std::endl;
std::cout << *i << " successfully inserted." << std::endl;
}
}
{
@@ -55,7 +55,7 @@ main(int, char*[])
boost::tie(i,end) = std::equal_range(vals, vals + 6, 4);
std::cout << "There were " << std::distance(i,end)
<< " occurrences of " << *i << "." << std::endl;
<< " occurrences of " << *i << "." << std::endl;
// Footnote: of course one would normally just use std::count()
// to get this information, but that would spoil the example :)
}