diff --git a/cppref b/cppref index fb5673e..d817af8 100755 --- a/cppref +++ b/cppref @@ -15,10 +15,12 @@ my %BROWSER_OPTION_MAP = ( lynx => ['-stdin'], ); -my $doc_dir = "doc"; -eval { - $doc_dir = File::ShareDir::dist_dir('cppref'); -}; +my $doc_dir = $ENV{CPPREF_DOCROOT} || ''; +if (! $doc_dir) { + eval { + $doc_dir = File::ShareDir::dist_dir('cppref'); + }; +} my $name = shift @ARGV || 'start'; diff --git a/fetchall.pl b/fetchall.pl index ff9ee30..e9bfd48 100755 --- a/fetchall.pl +++ b/fetchall.pl @@ -12,24 +12,37 @@ my %fetched; while (my $fn = shift @queue) { - next if -e "$fn.html"; + next if -e rewrite_ctor_op($fn) .".html"; print STDERR scalar(@queue), " $fn\n"; system("mkdir -p " . dirname($fn) . " 2> /dev/null"); $fetched{$fn} = 1; my $html = get("$prefix$fn"); $html =~ s|( -
Translations of this page?:
+
Translations of this page?:
@@ -168,6 +168,6 @@

Early Contributors<

-
+
diff --git a/orig/about/faq.html b/orig/about/faq.html index cd8ff75..d543568 100644 --- a/orig/about/faq.html +++ b/orig/about/faq.html @@ -50,7 +50,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -304,6 +304,6 @@

What's

-
+
diff --git a/orig/about/start.html b/orig/about/start.html index caaaa07..6625bcc 100644 --- a/orig/about/start.html +++ b/orig/about/start.html @@ -50,7 +50,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

About this site

-
+
diff --git a/orig/alternative_operators.html b/orig/alternative_operators.html index e6260ff..03c731c 100644 --- a/orig/alternative_operators.html +++ b/orig/alternative_operators.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -155,6 +155,6 @@

Alternative Opera

-
+
diff --git a/orig/ascii.html b/orig/ascii.html index a70627f..fd5578c 100644 --- a/orig/ascii.html +++ b/orig/ascii.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -523,6 +523,6 @@

ASCII Chart

-
+
diff --git a/orig/c/all.html b/orig/c/all.html index 8fd2019..916bdc0 100644 --- a/orig/c/all.html +++ b/orig/c/all.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -551,6 +551,6 @@

All C Functions

-
+
diff --git a/orig/c/c_data_types.html b/orig/c/c_data_types.html index b5b90d6..25fcf09 100644 --- a/orig/c/c_data_types.html +++ b/orig/c/c_data_types.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -196,6 +196,6 @@
-
+
diff --git a/orig/c/date/asctime.html b/orig/c/date/asctime.html index 97414af..2dff6b5 100644 --- a/orig/c/date/asctime.html +++ b/orig/c/date/asctime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

asctime

-
+
diff --git a/orig/c/date/clock.html b/orig/c/date/clock.html index 3ccafee..08e9e97 100644 --- a/orig/c/date/clock.html +++ b/orig/c/date/clock.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

clock

-
+
diff --git a/orig/c/date/ctime.html b/orig/c/date/ctime.html index 8491f91..c01605f 100644 --- a/orig/c/date/ctime.html +++ b/orig/c/date/ctime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

ctime

-
+
diff --git a/orig/c/date/difftime.html b/orig/c/date/difftime.html index abae8e8..a94601c 100644 --- a/orig/c/date/difftime.html +++ b/orig/c/date/difftime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

difftime

-
+
diff --git a/orig/c/date/gmtime.html b/orig/c/date/gmtime.html index 08c8863..9a529f1 100644 --- a/orig/c/date/gmtime.html +++ b/orig/c/date/gmtime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

gmtime

-
+
diff --git a/orig/c/date/localtime.html b/orig/c/date/localtime.html index 36509aa..91835e2 100644 --- a/orig/c/date/localtime.html +++ b/orig/c/date/localtime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -140,6 +140,6 @@

localtime

-
+
diff --git a/orig/c/date/mktime.html b/orig/c/date/mktime.html index 5992871..bec792b 100644 --- a/orig/c/date/mktime.html +++ b/orig/c/date/mktime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

mktime

-
+
diff --git a/orig/c/date/setlocale.html b/orig/c/date/setlocale.html index 9d44729..975900b 100644 --- a/orig/c/date/setlocale.html +++ b/orig/c/date/setlocale.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -155,6 +155,6 @@

setlocale

-
+
diff --git a/orig/c/date/start.html b/orig/c/date/start.html index ed780ce..3602812 100644 --- a/orig/c/date/start.html +++ b/orig/c/date/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -143,6 +143,6 @@

Standard C Date &am

-
+
diff --git a/orig/c/date/strftime.html b/orig/c/date/strftime.html index fc65fb5..6b839d5 100644 --- a/orig/c/date/strftime.html +++ b/orig/c/date/strftime.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -206,6 +206,6 @@

strftime

-
+
diff --git a/orig/c/date/time.html b/orig/c/date/time.html index e447208..22964fe 100644 --- a/orig/c/date/time.html +++ b/orig/c/date/time.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

time

-
+
diff --git a/orig/c/io/clearerr.html b/orig/c/io/clearerr.html index 6cd493a..e8b6816 100644 --- a/orig/c/io/clearerr.html +++ b/orig/c/io/clearerr.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

clearerr

-
+
diff --git a/orig/c/io/fclose.html b/orig/c/io/fclose.html index 3a26ced..6d0b388 100644 --- a/orig/c/io/fclose.html +++ b/orig/c/io/fclose.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

fclose

-
+
diff --git a/orig/c/io/feof.html b/orig/c/io/feof.html index 6d9f57b..f1e5b5c 100644 --- a/orig/c/io/feof.html +++ b/orig/c/io/feof.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

feof

-
+
diff --git a/orig/c/io/ferror.html b/orig/c/io/ferror.html index 2f92e1a..7970dc2 100644 --- a/orig/c/io/ferror.html +++ b/orig/c/io/ferror.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

ferror

-
+
diff --git a/orig/c/io/fflush.html b/orig/c/io/fflush.html index e3bb91f..f01bb8c 100644 --- a/orig/c/io/fflush.html +++ b/orig/c/io/fflush.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -141,6 +141,6 @@

fflush

-
+
diff --git a/orig/c/io/fgetc.html b/orig/c/io/fgetc.html index 827b38a..c30243f 100644 --- a/orig/c/io/fgetc.html +++ b/orig/c/io/fgetc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

fgetc

-
+
diff --git a/orig/c/io/fgetpos.html b/orig/c/io/fgetpos.html index de5f66b..4f89547 100644 --- a/orig/c/io/fgetpos.html +++ b/orig/c/io/fgetpos.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

fgetpos

-
+
diff --git a/orig/c/io/fgets.html b/orig/c/io/fgets.html index 0e39ae8..5247342 100644 --- a/orig/c/io/fgets.html +++ b/orig/c/io/fgets.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

fgets

-
+
diff --git a/orig/c/io/fopen.html b/orig/c/io/fopen.html index 7e93d73..750a06b 100644 --- a/orig/c/io/fopen.html +++ b/orig/c/io/fopen.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -164,6 +164,6 @@

fopen

-
+
diff --git a/orig/c/io/fprintf.html b/orig/c/io/fprintf.html index cfdcfc5..2de511c 100644 --- a/orig/c/io/fprintf.html +++ b/orig/c/io/fprintf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

fprintf

-
+
diff --git a/orig/c/io/fpurge.html b/orig/c/io/fpurge.html index 0600bd8..b93badc 100644 --- a/orig/c/io/fpurge.html +++ b/orig/c/io/fpurge.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

fpurge

-
+
diff --git a/orig/c/io/fputc.html b/orig/c/io/fputc.html index 932e62d..14dfc07 100644 --- a/orig/c/io/fputc.html +++ b/orig/c/io/fputc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

fputc

-
+
diff --git a/orig/c/io/fputs.html b/orig/c/io/fputs.html index 425a0e7..e146006 100644 --- a/orig/c/io/fputs.html +++ b/orig/c/io/fputs.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

fputs

-
+
diff --git a/orig/c/io/fread.html b/orig/c/io/fread.html index 528525d..02e6d74 100644 --- a/orig/c/io/fread.html +++ b/orig/c/io/fread.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

fread

-
+
diff --git a/orig/c/io/freopen.html b/orig/c/io/freopen.html index f525d92..f0bb234 100644 --- a/orig/c/io/freopen.html +++ b/orig/c/io/freopen.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

freopen

-
+
diff --git a/orig/c/io/fscanf.html b/orig/c/io/fscanf.html index b03eb67..b21cba3 100644 --- a/orig/c/io/fscanf.html +++ b/orig/c/io/fscanf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

fscanf

-
+
diff --git a/orig/c/io/fseek.html b/orig/c/io/fseek.html index 06418fb..f9d69ee 100644 --- a/orig/c/io/fseek.html +++ b/orig/c/io/fseek.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -151,6 +151,6 @@

fseek

-
+
diff --git a/orig/c/io/fsetpos.html b/orig/c/io/fsetpos.html index 916c6cc..ea94f87 100644 --- a/orig/c/io/fsetpos.html +++ b/orig/c/io/fsetpos.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

fsetpos

-
+
diff --git a/orig/c/io/ftell.html b/orig/c/io/ftell.html index b975579..c129acd 100644 --- a/orig/c/io/ftell.html +++ b/orig/c/io/ftell.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

ftell

-
+
diff --git a/orig/c/io/fwrite.html b/orig/c/io/fwrite.html index ea4b1af..f9429cd 100644 --- a/orig/c/io/fwrite.html +++ b/orig/c/io/fwrite.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

fwrite

-
+
diff --git a/orig/c/io/getc.html b/orig/c/io/getc.html index 67427f2..1ed2ec7 100644 --- a/orig/c/io/getc.html +++ b/orig/c/io/getc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

getc

-
+
diff --git a/orig/c/io/getchar.html b/orig/c/io/getchar.html index a6371f5..ad40a2d 100644 --- a/orig/c/io/getchar.html +++ b/orig/c/io/getchar.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

getchar

-
+
diff --git a/orig/c/io/gets.html b/orig/c/io/gets.html index c6c0671..ca9240b 100644 --- a/orig/c/io/gets.html +++ b/orig/c/io/gets.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

gets

-
+
diff --git a/orig/c/io/perror.html b/orig/c/io/perror.html index 6ecdbae..f8fe5a0 100644 --- a/orig/c/io/perror.html +++ b/orig/c/io/perror.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

perror

-
+
diff --git a/orig/c/io/printf.html b/orig/c/io/printf.html index 1205c4e..8edd872 100644 --- a/orig/c/io/printf.html +++ b/orig/c/io/printf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -280,6 +280,6 @@

printf

-
+
diff --git a/orig/c/io/putc.html b/orig/c/io/putc.html index 5358c6f..a721dec 100644 --- a/orig/c/io/putc.html +++ b/orig/c/io/putc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -141,6 +141,6 @@

putc

-
+
diff --git a/orig/c/io/putchar.html b/orig/c/io/putchar.html index 0e5aba5..02c52e2 100644 --- a/orig/c/io/putchar.html +++ b/orig/c/io/putchar.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

putchar

-
+
diff --git a/orig/c/io/puts.html b/orig/c/io/puts.html index e4e057c..4e9d3ac 100644 --- a/orig/c/io/puts.html +++ b/orig/c/io/puts.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

puts

-
+
diff --git a/orig/c/io/remove.html b/orig/c/io/remove.html index 45c2f58..abe6051 100644 --- a/orig/c/io/remove.html +++ b/orig/c/io/remove.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

remove

-
+
diff --git a/orig/c/io/rename.html b/orig/c/io/rename.html index 724971e..9ff42d8 100644 --- a/orig/c/io/rename.html +++ b/orig/c/io/rename.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

rename

-
+
diff --git a/orig/c/io/rewind.html b/orig/c/io/rewind.html index aea4969..f225511 100644 --- a/orig/c/io/rewind.html +++ b/orig/c/io/rewind.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

rewind

-
+
diff --git a/orig/c/io/scanf.html b/orig/c/io/scanf.html index 55c5e98..bcf294a 100644 --- a/orig/c/io/scanf.html +++ b/orig/c/io/scanf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -208,6 +208,6 @@

scanf

-
+
diff --git a/orig/c/io/setbuf.html b/orig/c/io/setbuf.html index 1f67afd..d67510d 100644 --- a/orig/c/io/setbuf.html +++ b/orig/c/io/setbuf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

setbuf

-
+
diff --git a/orig/c/io/setvbuf.html b/orig/c/io/setvbuf.html index d70ce60..5ba01a9 100644 --- a/orig/c/io/setvbuf.html +++ b/orig/c/io/setvbuf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

setvbuf

-
+
diff --git a/orig/c/io/snprintf.html b/orig/c/io/snprintf.html index c90cde8..0efea51 100644 --- a/orig/c/io/snprintf.html +++ b/orig/c/io/snprintf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

snprintf

-
+
diff --git a/orig/c/io/sprintf.html b/orig/c/io/sprintf.html index c3f62b7..57ea7df 100644 --- a/orig/c/io/sprintf.html +++ b/orig/c/io/sprintf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -155,6 +155,6 @@

sprintf

-
+
diff --git a/orig/c/io/sscanf.html b/orig/c/io/sscanf.html index 0c72e7a..cba02ef 100644 --- a/orig/c/io/sscanf.html +++ b/orig/c/io/sscanf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

sscanf

-
+
diff --git a/orig/c/io/start.html b/orig/c/io/start.html index 38e266c..8ba2373 100644 --- a/orig/c/io/start.html +++ b/orig/c/io/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -242,6 +242,6 @@

Standard C I/O

-
+
diff --git a/orig/c/io/tmpfile.html b/orig/c/io/tmpfile.html index 5356070..825e0b9 100644 --- a/orig/c/io/tmpfile.html +++ b/orig/c/io/tmpfile.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

tmpfile

-
+
diff --git a/orig/c/io/tmpnam.html b/orig/c/io/tmpnam.html index 0a3c62b..07906e2 100644 --- a/orig/c/io/tmpnam.html +++ b/orig/c/io/tmpnam.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

tmpnam

-
+
diff --git a/orig/c/io/ungetc.html b/orig/c/io/ungetc.html index e875d99..76e2f65 100644 --- a/orig/c/io/ungetc.html +++ b/orig/c/io/ungetc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

ungetc

-
+
diff --git a/orig/c/io/vprintf_vfprintf_vsprintf.html b/orig/c/io/vprintf_vfprintf_vsprintf.html index b311010..4f1c734 100644 --- a/orig/c/io/vprintf_vfprintf_vsprintf.html +++ b/orig/c/io/vprintf_vfprintf_vsprintf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

v

-
+
diff --git a/orig/c/io/vscanf_vfscanf_vsscanf.html b/orig/c/io/vscanf_vfscanf_vsscanf.html index 6798f29..3fafe04 100644 --- a/orig/c/io/vscanf_vfscanf_vsscanf.html +++ b/orig/c/io/vscanf_vfscanf_vsscanf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

vscanf,

-
+
diff --git a/orig/c/math/abs.html b/orig/c/math/abs.html index 17d2a54..fb88961 100644 --- a/orig/c/math/abs.html +++ b/orig/c/math/abs.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -141,6 +141,6 @@

abs

-
+
diff --git a/orig/c/math/acos.html b/orig/c/math/acos.html index 7bb1fdd..2f04837 100644 --- a/orig/c/math/acos.html +++ b/orig/c/math/acos.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

acos

-
+
diff --git a/orig/c/math/asin.html b/orig/c/math/asin.html index 878c2e3..5cd9f43 100644 --- a/orig/c/math/asin.html +++ b/orig/c/math/asin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

asin

-
+
diff --git a/orig/c/math/atan.html b/orig/c/math/atan.html index fd2083c..cadf997 100644 --- a/orig/c/math/atan.html +++ b/orig/c/math/atan.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

atan

-
+
diff --git a/orig/c/math/atan2.html b/orig/c/math/atan2.html index 879c839..3fb1394 100644 --- a/orig/c/math/atan2.html +++ b/orig/c/math/atan2.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

atan2

-
+
diff --git a/orig/c/math/ceil.html b/orig/c/math/ceil.html index 402a1c0..bf240cd 100644 --- a/orig/c/math/ceil.html +++ b/orig/c/math/ceil.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

ceil

-
+
diff --git a/orig/c/math/cos.html b/orig/c/math/cos.html index 12b921a..25a311d 100644 --- a/orig/c/math/cos.html +++ b/orig/c/math/cos.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

cos

-
+
diff --git a/orig/c/math/cosh.html b/orig/c/math/cosh.html index c84be88..f4f42e9 100644 --- a/orig/c/math/cosh.html +++ b/orig/c/math/cosh.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

cosh

-
+
diff --git a/orig/c/math/div.html b/orig/c/math/div.html index 171901f..9e3d313 100644 --- a/orig/c/math/div.html +++ b/orig/c/math/div.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -142,6 +142,6 @@

div

-
+
diff --git a/orig/c/math/exp.html b/orig/c/math/exp.html index 3c2cf55..e1f8a09 100644 --- a/orig/c/math/exp.html +++ b/orig/c/math/exp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

exp

-
+
diff --git a/orig/c/math/fabs.html b/orig/c/math/fabs.html index 50e811c..32fd6cc 100644 --- a/orig/c/math/fabs.html +++ b/orig/c/math/fabs.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

fabs

-
+
diff --git a/orig/c/math/floor.html b/orig/c/math/floor.html index a0e59b2..853cb51 100644 --- a/orig/c/math/floor.html +++ b/orig/c/math/floor.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -140,6 +140,6 @@

floor

-
+
diff --git a/orig/c/math/fmod.html b/orig/c/math/fmod.html index 5b7b77d..20af8b7 100644 --- a/orig/c/math/fmod.html +++ b/orig/c/math/fmod.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

fmod

-
+
diff --git a/orig/c/math/frexp.html b/orig/c/math/frexp.html index 17b028e..585930f 100644 --- a/orig/c/math/frexp.html +++ b/orig/c/math/frexp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

frexp

-
+
diff --git a/orig/c/math/labs.html b/orig/c/math/labs.html index b37637c..8ba6cd1 100644 --- a/orig/c/math/labs.html +++ b/orig/c/math/labs.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

labs

-
+
diff --git a/orig/c/math/ldexp.html b/orig/c/math/ldexp.html index 72d76c6..df83cbb 100644 --- a/orig/c/math/ldexp.html +++ b/orig/c/math/ldexp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

ldexp

-
+
diff --git a/orig/c/math/ldiv.html b/orig/c/math/ldiv.html index 8c1468c..3024bb6 100644 --- a/orig/c/math/ldiv.html +++ b/orig/c/math/ldiv.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

ldiv

-
+
diff --git a/orig/c/math/log.html b/orig/c/math/log.html index 42eaf31..cfa77c2 100644 --- a/orig/c/math/log.html +++ b/orig/c/math/log.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

log

-
+
diff --git a/orig/c/math/log10.html b/orig/c/math/log10.html index fbdbc55..2921711 100644 --- a/orig/c/math/log10.html +++ b/orig/c/math/log10.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

log10

-
+
diff --git a/orig/c/math/modf.html b/orig/c/math/modf.html index 140b086..aa807fd 100644 --- a/orig/c/math/modf.html +++ b/orig/c/math/modf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

modf

-
+
diff --git a/orig/c/math/pow.html b/orig/c/math/pow.html index 179f2e9..bed1382 100644 --- a/orig/c/math/pow.html +++ b/orig/c/math/pow.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -143,6 +143,6 @@

pow

-
+
diff --git a/orig/c/math/sin.html b/orig/c/math/sin.html index fe765ff..b028299 100644 --- a/orig/c/math/sin.html +++ b/orig/c/math/sin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -164,6 +164,6 @@

sin

-
+
diff --git a/orig/c/math/sinh.html b/orig/c/math/sinh.html index 57b9440..4b183dd 100644 --- a/orig/c/math/sinh.html +++ b/orig/c/math/sinh.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

sinh

-
+
diff --git a/orig/c/math/sqrt.html b/orig/c/math/sqrt.html index 103fe5b..34c3e19 100644 --- a/orig/c/math/sqrt.html +++ b/orig/c/math/sqrt.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

sqrt

-
+
diff --git a/orig/c/math/start.html b/orig/c/math/start.html index c6e412d..5c1aca8 100644 --- a/orig/c/math/start.html +++ b/orig/c/math/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -201,6 +201,6 @@
Compiling with gcc<
-
+
diff --git a/orig/c/math/tan.html b/orig/c/math/tan.html index 1a2d0f0..4825a1b 100644 --- a/orig/c/math/tan.html +++ b/orig/c/math/tan.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

tan

-
+
diff --git a/orig/c/math/tanh.html b/orig/c/math/tanh.html index feba236..fbaaebb 100644 --- a/orig/c/math/tanh.html +++ b/orig/c/math/tanh.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

tanh

-
+
diff --git a/orig/c/mem/calloc.html b/orig/c/mem/calloc.html index 13afeb0..c3d15f8 100644 --- a/orig/c/mem/calloc.html +++ b/orig/c/mem/calloc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

calloc

-
+
diff --git a/orig/c/mem/free.html b/orig/c/mem/free.html index f3183b8..b00f95d 100644 --- a/orig/c/mem/free.html +++ b/orig/c/mem/free.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -135,6 +135,6 @@

free

-
+
diff --git a/orig/c/mem/malloc.html b/orig/c/mem/malloc.html index 021c783..8744fe4 100644 --- a/orig/c/mem/malloc.html +++ b/orig/c/mem/malloc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -145,6 +145,6 @@

malloc

-
+
diff --git a/orig/c/mem/realloc.html b/orig/c/mem/realloc.html index 3be0551..3caa8e7 100644 --- a/orig/c/mem/realloc.html +++ b/orig/c/mem/realloc.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

realloc

-
+
diff --git a/orig/c/mem/start.html b/orig/c/mem/start.html index fb0cb6a..2adae36 100644 --- a/orig/c/mem/start.html +++ b/orig/c/mem/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

Standard C Memory

-
+
diff --git a/orig/c/other/abort.html b/orig/c/other/abort.html index a0d7ea4..ec13699 100644 --- a/orig/c/other/abort.html +++ b/orig/c/other/abort.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

abort

-
+
diff --git a/orig/c/other/assert.html b/orig/c/other/assert.html index 695eec2..348bd43 100644 --- a/orig/c/other/assert.html +++ b/orig/c/other/assert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

assert

-
+
diff --git a/orig/c/other/atexit.html b/orig/c/other/atexit.html index 22169b0..e055495 100644 --- a/orig/c/other/atexit.html +++ b/orig/c/other/atexit.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

atexit

-
+
diff --git a/orig/c/other/bsearch.html b/orig/c/other/bsearch.html index b31d154..52f15a6 100644 --- a/orig/c/other/bsearch.html +++ b/orig/c/other/bsearch.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

bsearch

-
+
diff --git a/orig/c/other/exit.html b/orig/c/other/exit.html index 2904b8e..253c7dc 100644 --- a/orig/c/other/exit.html +++ b/orig/c/other/exit.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

exit

-
+
diff --git a/orig/c/other/getenv.html b/orig/c/other/getenv.html index 3f35b9d..fc532fc 100644 --- a/orig/c/other/getenv.html +++ b/orig/c/other/getenv.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

getenv

-
+
diff --git a/orig/c/other/longjmp.html b/orig/c/other/longjmp.html index 23469b3..86a5b86 100644 --- a/orig/c/other/longjmp.html +++ b/orig/c/other/longjmp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

longjmp

-
+
diff --git a/orig/c/other/putenv.html b/orig/c/other/putenv.html index f0aee36..5401eda 100644 --- a/orig/c/other/putenv.html +++ b/orig/c/other/putenv.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

putenv

-
+
diff --git a/orig/c/other/qsort.html b/orig/c/other/qsort.html index fc8a459..3b7e365 100644 --- a/orig/c/other/qsort.html +++ b/orig/c/other/qsort.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -163,6 +163,6 @@

qsort

-
+
diff --git a/orig/c/other/raise.html b/orig/c/other/raise.html index d9146ae..73a9dad 100644 --- a/orig/c/other/raise.html +++ b/orig/c/other/raise.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -153,6 +153,6 @@

raise

-
+
diff --git a/orig/c/other/rand.html b/orig/c/other/rand.html index 63c7967..cc1a22b 100644 --- a/orig/c/other/rand.html +++ b/orig/c/other/rand.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -141,6 +141,6 @@

rand

-
+
diff --git a/orig/c/other/setjmp.html b/orig/c/other/setjmp.html index 292375c..f1fd33c 100644 --- a/orig/c/other/setjmp.html +++ b/orig/c/other/setjmp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

setjmp

-
+
diff --git a/orig/c/other/signal.html b/orig/c/other/signal.html index 6895c53..9606af3 100644 --- a/orig/c/other/signal.html +++ b/orig/c/other/signal.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -212,6 +212,6 @@

signal

-
+
diff --git a/orig/c/other/srand.html b/orig/c/other/srand.html index 8a178c0..bc09ef0 100644 --- a/orig/c/other/srand.html +++ b/orig/c/other/srand.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

srand

-
+
diff --git a/orig/c/other/start.html b/orig/c/other/start.html index 0d5de3c..4a5626c 100644 --- a/orig/c/other/start.html +++ b/orig/c/other/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -161,6 +161,6 @@

Other S

-
+
diff --git a/orig/c/other/system.html b/orig/c/other/system.html index a39d771..74f8816 100644 --- a/orig/c/other/system.html +++ b/orig/c/other/system.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

system

-
+
diff --git a/orig/c/other/va_arg.html b/orig/c/other/va_arg.html index 7cb7cc4..4029e67 100644 --- a/orig/c/other/va_arg.html +++ b/orig/c/other/va_arg.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -210,6 +210,6 @@

va_arg

-
+
diff --git a/orig/c/start.html b/orig/c/start.html index e3fca74..da97149 100644 --- a/orig/c/start.html +++ b/orig/c/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -226,6 +226,6 @@

Standard C He

-
+
diff --git a/orig/c/string/atof.html b/orig/c/string/atof.html index 6077182..2625836 100644 --- a/orig/c/string/atof.html +++ b/orig/c/string/atof.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

atof

-
+
diff --git a/orig/c/string/atoi.html b/orig/c/string/atoi.html index 9c20975..59e9dfe 100644 --- a/orig/c/string/atoi.html +++ b/orig/c/string/atoi.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -145,6 +145,6 @@

atoi

-
+
diff --git a/orig/c/string/atol.html b/orig/c/string/atol.html index 88263dc..cb2c2b8 100644 --- a/orig/c/string/atol.html +++ b/orig/c/string/atol.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

atol

-
+
diff --git a/orig/c/string/c_algorithms_find_first_of.html b/orig/c/string/c_algorithms_find_first_of.html index 691c948..0afed2d 100644 --- a/orig/c/string/c_algorithms_find_first_of.html +++ b/orig/c/string/c_algorithms_find_first_of.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/c/string/isalnum.html b/orig/c/string/isalnum.html index c755f46..017f47a 100644 --- a/orig/c/string/isalnum.html +++ b/orig/c/string/isalnum.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

isalnum

-
+
diff --git a/orig/c/string/isalpha.html b/orig/c/string/isalpha.html index 021d862..fc8d1b2 100644 --- a/orig/c/string/isalpha.html +++ b/orig/c/string/isalpha.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

isalpha

-
+
diff --git a/orig/c/string/iscntrl.html b/orig/c/string/iscntrl.html index 8116559..0d92d1f 100644 --- a/orig/c/string/iscntrl.html +++ b/orig/c/string/iscntrl.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

iscntrl

-
+
diff --git a/orig/c/string/isdigit.html b/orig/c/string/isdigit.html index d080edf..5a66216 100644 --- a/orig/c/string/isdigit.html +++ b/orig/c/string/isdigit.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

isdigit

-
+
diff --git a/orig/c/string/isgraph.html b/orig/c/string/isgraph.html index 43d1ac5..d1ed858 100644 --- a/orig/c/string/isgraph.html +++ b/orig/c/string/isgraph.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

isgraph

-
+
diff --git a/orig/c/string/islower.html b/orig/c/string/islower.html index e1f0834..b9791bf 100644 --- a/orig/c/string/islower.html +++ b/orig/c/string/islower.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

islower

-
+
diff --git a/orig/c/string/isprint.html b/orig/c/string/isprint.html index 0ac4a27..e2c3dec 100644 --- a/orig/c/string/isprint.html +++ b/orig/c/string/isprint.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

isprint

-
+
diff --git a/orig/c/string/ispunct.html b/orig/c/string/ispunct.html index 642b885..16efc72 100644 --- a/orig/c/string/ispunct.html +++ b/orig/c/string/ispunct.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

ispunct

-
+
diff --git a/orig/c/string/isspace.html b/orig/c/string/isspace.html index b87c22f..ee83590 100644 --- a/orig/c/string/isspace.html +++ b/orig/c/string/isspace.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

isspace

-
+
diff --git a/orig/c/string/isupper.html b/orig/c/string/isupper.html index 329b77f..df8e60c 100644 --- a/orig/c/string/isupper.html +++ b/orig/c/string/isupper.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

isupper

-
+
diff --git a/orig/c/string/isxdigit.html b/orig/c/string/isxdigit.html index cc9782e..480076f 100644 --- a/orig/c/string/isxdigit.html +++ b/orig/c/string/isxdigit.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

isxdigit

-
+
diff --git a/orig/c/string/memchr.html b/orig/c/string/memchr.html index 98be72d..386df2c 100644 --- a/orig/c/string/memchr.html +++ b/orig/c/string/memchr.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

memchr

-
+
diff --git a/orig/c/string/memcmp.html b/orig/c/string/memcmp.html index 518ff2c..5f43bdd 100644 --- a/orig/c/string/memcmp.html +++ b/orig/c/string/memcmp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -141,6 +141,6 @@

memcmp

-
+
diff --git a/orig/c/string/memcpy.html b/orig/c/string/memcpy.html index bb1a4cf..612fa62 100644 --- a/orig/c/string/memcpy.html +++ b/orig/c/string/memcpy.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

memcpy

-
+
diff --git a/orig/c/string/memmove.html b/orig/c/string/memmove.html index 96b3a97..9d73c7d 100644 --- a/orig/c/string/memmove.html +++ b/orig/c/string/memmove.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

memmove

-
+
diff --git a/orig/c/string/memset.html b/orig/c/string/memset.html index 744c7e7..c437bc9 100644 --- a/orig/c/string/memset.html +++ b/orig/c/string/memset.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -158,6 +158,6 @@

memset

-
+
diff --git a/orig/c/string/start.html b/orig/c/string/start.html index 3b26075..b9683db 100644 --- a/orig/c/string/start.html +++ b/orig/c/string/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -236,6 +236,6 @@

+
diff --git a/orig/c/string/strcat.html b/orig/c/string/strcat.html index 527f76b..daeffe1 100644 --- a/orig/c/string/strcat.html +++ b/orig/c/string/strcat.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

strcat

-
+
diff --git a/orig/c/string/strchr.html b/orig/c/string/strchr.html index fa27cf7..3eec40c 100644 --- a/orig/c/string/strchr.html +++ b/orig/c/string/strchr.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strchr

-
+
diff --git a/orig/c/string/strcmp.html b/orig/c/string/strcmp.html index 8c58d8a..40b31e9 100644 --- a/orig/c/string/strcmp.html +++ b/orig/c/string/strcmp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -156,6 +156,6 @@

strcmp

-
+
diff --git a/orig/c/string/strcoll.html b/orig/c/string/strcoll.html index c574388..d9de12f 100644 --- a/orig/c/string/strcoll.html +++ b/orig/c/string/strcoll.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

strcoll

-
+
diff --git a/orig/c/string/strcpy.html b/orig/c/string/strcpy.html index 0ef7b38..afaee5d 100644 --- a/orig/c/string/strcpy.html +++ b/orig/c/string/strcpy.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

strcpy

-
+
diff --git a/orig/c/string/strcspn.html b/orig/c/string/strcspn.html index 2ca6012..f20288a 100644 --- a/orig/c/string/strcspn.html +++ b/orig/c/string/strcspn.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strcspn

-
+
diff --git a/orig/c/string/strerror.html b/orig/c/string/strerror.html index ed99b0d..21560f2 100644 --- a/orig/c/string/strerror.html +++ b/orig/c/string/strerror.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strerror

-
+
diff --git a/orig/c/string/strlcat.html b/orig/c/string/strlcat.html index 0f11f55..1f45fe3 100644 --- a/orig/c/string/strlcat.html +++ b/orig/c/string/strlcat.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -147,6 +147,6 @@

strlcat

-
+
diff --git a/orig/c/string/strlcpy.html b/orig/c/string/strlcpy.html index e2fe940..4425604 100644 --- a/orig/c/string/strlcpy.html +++ b/orig/c/string/strlcpy.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -206,6 +206,6 @@

strlcpy

-
+
diff --git a/orig/c/string/strlen.html b/orig/c/string/strlen.html index 138d54f..08bc1ec 100644 --- a/orig/c/string/strlen.html +++ b/orig/c/string/strlen.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strlen

-
+
diff --git a/orig/c/string/strncat.html b/orig/c/string/strncat.html index c5db739..da41848 100644 --- a/orig/c/string/strncat.html +++ b/orig/c/string/strncat.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

strncat

-
+
diff --git a/orig/c/string/strncmp.html b/orig/c/string/strncmp.html index bb41b9c..b14122e 100644 --- a/orig/c/string/strncmp.html +++ b/orig/c/string/strncmp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -147,6 +147,6 @@

strncmp

-
+
diff --git a/orig/c/string/strncpy.html b/orig/c/string/strncpy.html index 99bd738..46f62f7 100644 --- a/orig/c/string/strncpy.html +++ b/orig/c/string/strncpy.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -167,6 +167,6 @@

strncpy

-
+
diff --git a/orig/c/string/strpbrk.html b/orig/c/string/strpbrk.html index f663c84..caf714d 100644 --- a/orig/c/string/strpbrk.html +++ b/orig/c/string/strpbrk.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strpbrk

-
+
diff --git a/orig/c/string/strrchr.html b/orig/c/string/strrchr.html index ad68801..f93133e 100644 --- a/orig/c/string/strrchr.html +++ b/orig/c/string/strrchr.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strrchr

-
+
diff --git a/orig/c/string/strspn.html b/orig/c/string/strspn.html index bd0d661..2fda3b0 100644 --- a/orig/c/string/strspn.html +++ b/orig/c/string/strspn.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strspn

-
+
diff --git a/orig/c/string/strstr.html b/orig/c/string/strstr.html index d0640ac..390203b 100644 --- a/orig/c/string/strstr.html +++ b/orig/c/string/strstr.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

strstr

-
+
diff --git a/orig/c/string/strtod.html b/orig/c/string/strtod.html index d6be056..e9ef420 100644 --- a/orig/c/string/strtod.html +++ b/orig/c/string/strtod.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

strtod

-
+
diff --git a/orig/c/string/strtok.html b/orig/c/string/strtok.html index 57f8e20..9582d0e 100644 --- a/orig/c/string/strtok.html +++ b/orig/c/string/strtok.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

strtok

-
+
diff --git a/orig/c/string/strtol.html b/orig/c/string/strtol.html index 8bfdf4f..05b02ef 100644 --- a/orig/c/string/strtol.html +++ b/orig/c/string/strtol.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

strtol

-
+
diff --git a/orig/c/string/strtoul.html b/orig/c/string/strtoul.html index ccf1b2f..e43063a 100644 --- a/orig/c/string/strtoul.html +++ b/orig/c/string/strtoul.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

strtoul

-
+
diff --git a/orig/c/string/strxfrm.html b/orig/c/string/strxfrm.html index 7758838..58056a8 100644 --- a/orig/c/string/strxfrm.html +++ b/orig/c/string/strxfrm.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

strxfrm

-
+
diff --git a/orig/c/string/tolower.html b/orig/c/string/tolower.html index 735f8b1..1c18ad8 100644 --- a/orig/c/string/tolower.html +++ b/orig/c/string/tolower.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

tolower

-
+
diff --git a/orig/c/string/toupper.html b/orig/c/string/toupper.html index ca45859..551617f 100644 --- a/orig/c/string/toupper.html +++ b/orig/c/string/toupper.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

toupper

-
+
diff --git a/orig/complexity.html b/orig/complexity.html index 39060ea..74fb712 100644 --- a/orig/complexity.html +++ b/orig/complexity.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -178,6 +178,6 @@

Complexity Analysis -
+
diff --git a/orig/data_types.html b/orig/data_types.html index c5dd9d0..4e24072 100644 --- a/orig/data_types.html +++ b/orig/data_types.html @@ -51,7 +51,7 @@

-
Translations of this page?:
+
Translations of this page?:
@@ -465,6 +465,6 @@

Reading T

-
+
diff --git a/orig/destructor.html b/orig/destructor.html index 90ce147..ffecb0e 100644 --- a/orig/destructor.html +++ b/orig/destructor.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/escape_sequences.html b/orig/escape_sequences.html index b457d4c..3e4e458 100644 --- a/orig/escape_sequences.html +++ b/orig/escape_sequences.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -178,6 +178,6 @@

Constant

-
+
diff --git a/orig/exception/start.html b/orig/exception/start.html index b5a8e62..afdaee2 100644 --- a/orig/exception/start.html +++ b/orig/exception/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -193,6 +193,6 @@

Standard Exceptions -
+
diff --git a/orig/feed.php.html b/orig/feed.php.html index a1653f0..2a06285 100644 --- a/orig/feed.php.html +++ b/orig/feed.php.html @@ -11,29 +11,29 @@ http://www.cppreference.com/wiki/ - 2009-10-08T01:53:39-07:00 + 2009-10-09T02:30:22-07:00 - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + @@ -42,380 +42,301 @@ http://www.cppreference.com/wiki/ http://www.cppreference.com/wiki/lib/images/favicon.ico - + text/html - 2009-10-07T23:32:33-07:00 - cn:c:other:rand - created - http://www.cppreference.com/wiki/cn/c/other/rand?rev=1254983553&do=diff - 语法: + 2009-10-09T02:25:57-07:00 + iter_swap + http://www.cppreference.com/wiki/stl/algorithm/iter_swap?rev=1255080357&do=diff + iter_swap - #include <cstdlib> - int rand( void ); +Syntax: -函数rand()返回一个0到RAND_MAX的整形. 例子: + #include <algorithm> + void iter_swap( forward_iterator a, forward_iterator b ); - srand( time(NULL) ); - for( i = 0; i < 10; i++ ) - printf( "Random number #%d: %d\n", i, rand() ); +A call to iter_swap() exchanges the values of two elements exactly as a call to -注意: 不要用%去限制产生的数. 应该使用算法产生指定范围的数: - - - text/html - 2009-10-07T14:41:59-07:00 - Massimo Manghi - Deque operators - link rotto riparato - http://www.cppreference.com/wiki/it/stl/deque/deque_operators?rev=1254951719&do=diff - Deque operators - - -Sintassi: - - #include <deque> - TYPE& operator[]( size_type index ); - const TYPE& operator[]( size_type index ) const; - deque operator=(const deque& c2); - bool operator==(const deque& c1, const deque& c2); - bool operator!=(const deque& c1, const deque& c2); - bool operator<(const deque& c1, const deque& c2); - bool operator>(const deque& c1, const deque& c2); - bool operator<=(const deque& c1, const deque& c2); - bool operator>=(const deque& c1, const de… + swap( *a, *b ); + +would. + +Related Topics: swap, swap_ranges - + text/html - 2009-10-07T04:26:48-07:00 - Ruslan Sennov - abs - http://www.cppreference.com/wiki/ru/c/math/abs?rev=1254914808&do=diff - abs + 2009-10-09T02:23:02-07:00 + swap_ranges + http://www.cppreference.com/wiki/stl/algorithm/swap_ranges?rev=1255080182&do=diff + swap_ranges -Синтаксис: +Syntax: - #include <cstdlib> - int abs( int num ); + #include <algorithm> + forward_iterator2 swap_ranges( forward_iterator start1, forward_iterator end1, forward_iterator2 start2 ); +The swap_ranges() function exchanges the elements in the range [start1,end1) +with the range of the same size starting at start2. + + + text/html + 2009-10-09T02:19:08-07:00 + nth_element + http://www.cppreference.com/wiki/stl/algorithm/nth_element?rev=1255079948&do=diff + nth_element -Функция abs() возвращает значение модуля аргумента. Например: +Syntax: - int magic_number = 10; - cout << "Enter a guess: "; - cin >> x; - cout << "Your guess was " << abs( magic_number - x ) << " away from the magic number." << endl; + #include <algorithm> + void nth_element( random_iterator start, random_iterator nth, random_iterator end ); + void nth_element( random_iterator start, random_iterator nth, random_iterator end, StrictWeakOrdering cmp ); - + text/html - 2009-10-07T01:12:14-07:00 - Massimo Manghi - C++ Keywords - era sfuggita la traduzione di una voce - http://www.cppreference.com/wiki/it/keywords/start?rev=1254903134&do=diff - Questa e' la lista delle parole riservate in C++. Sono quelle che posso essere utilizzate nel linguaggio, ma i programmatori non possono ridefinire (o usare per l'overloading) queste parole. + 2009-10-09T02:17:19-07:00 + min_element + http://www.cppreference.com/wiki/stl/algorithm/min_element?rev=1255079839&do=diff + min_element + +Syntax: + + #include <algorithm> + forward_iterator min_element( forward_iterator start, forward_iterator end ); + forward_iterator min_element( forward_iterator start, forward_iterator end, BinPred p ); -KeywordDescriptionasminserisce codice assemblyautodichiara una variabile localebooldichiara una variabile booleanabreakinterrompe un loopcasedefinisce un blocco di codice nel costrutto switch catchgestisce eccezioni sollevate da throwchardichiara una variabile di tipo charclassdichiara una classeconstdichia… +The min_element() function returns an iterator to the smallest element in the +range [start,end). - + text/html - 2009-10-07T01:11:05-07:00 - Massimo Manghi - try - creata - http://www.cppreference.com/wiki/it/keywords/try?rev=1254903065&do=diff - try + 2009-10-09T02:16:41-07:00 + max_element + http://www.cppreference.com/wiki/stl/algorithm/max_element?rev=1255079801&do=diff + max_element +Syntax: -Il comando try definisce un blocco di codice che potrebbe generare eccezioni -in caso di errori. Alla pagina del comando throw c'è una descrizione più dettagliata -di come usare try + #include <algorithm> + forward_iterator max_element( forward_iterator start, forward_iterator end ); + forward_iterator max_element( forward_iterator start, forward_iterator end, BinPred p ); -Argomenti correlati: catch, throw +The max_element() function returns an iterator to the largest element in the +range [start,end). - + text/html - 2009-10-07T00:57:38-07:00 - Massimo Manghi - throw - creata - http://www.cppreference.com/wiki/it/keywords/throw?rev=1254902258&do=diff - throw - -Sintassi: - - try { - statement list; - } - catch( typeA arg ) { - statement list; - } - catch( typeB arg ){ - statement list; - } - ... - catch( typeN arg ) { - statement list; - } - -Il comando throw è parte del meccanismo del C++ per la gestione delle eccezioni. -Questo comando, unitamente a try e catch, costituisce il costrutto del C++ -per la gestione di errori segnalati tramite eccezioni. + 2009-10-09T02:14:39-07:00 + prev_permutation + http://www.cppreference.com/wiki/stl/algorithm/prev_permutation?rev=1255079679&do=diff + prev_permutation + +Syntax: + + #include <algorithm> + bool prev_permutation( bidirectional_iterator start, bidirectional_iterator end ); + bool prev_permutation( bidirectional_iterator start, bidirectional_iterator end, StrictWeakOrdering cmp ); - + text/html - 2009-10-07T00:46:59-07:00 - Massimo Manghi - catch - creata - http://www.cppreference.com/wiki/it/keywords/catch?rev=1254901619&do=diff - catch + 2009-10-09T02:13:55-07:00 + next_permutation + http://www.cppreference.com/wiki/stl/algorithm/next_permutation?rev=1255079635&do=diff + next_permutation -La parola catch definisce un handler di eccezioni generate dal comando throw. +Syntax: -Argomenti correlat: throw, try + #include <algorithm> + bool next_permutation( bidirectional_iterator start, bidirectional_iterator end ); + bool next_permutation( bidirectional_iterator start, bidirectional_iterator end, StrictWeakOrdering cmp ); - + text/html - 2009-10-06T11:45:52-07:00 - Szymon - Konstruktor Stosu - Poprawa zmiennej - http://www.cppreference.com/wiki/pl/stl/stack/stack_constructors?rev=1254854752&do=diff - Konstruktor Stosu - -Składnia: - - #include <stack> - stack(); - stack( const Container& con ); - -Stosy mają zarówno pusty konstruktor jak i konstruktor służący do wyszczególnienia typu. - -Przykładowy program: - - stack<int> stos; - int a; - cout << "Odliczanie nastapi od liczby: " - cin >> a; - for (int i =0; i<=a; i++) - stos.push(i); - while( !stos.empty() ) - { - cout << stos.top() << endl; - kolejka.pop(); - } - cout << "Bum!"; + 2009-10-09T02:12:27-07:00 + lexicographical_compare + http://www.cppreference.com/wiki/stl/algorithm/lexicographical_compare?rev=1255079547&do=diff + lexicographical_compare + +Syntax: + + #include <algorithm> + bool lexicographical_compare( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2 ); + bool lexicographical_compare( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, BinPred p ); - + text/html - 2009-10-06T08:58:58-07:00 - Szymon - Konstruktor Kolejek - utworzono - http://www.cppreference.com/wiki/pl/stl/queue/queue_constructors?rev=1254844738&do=diff - Konstruktor Kolejek - -Składnia: + 2009-10-09T02:10:29-07:00 + sort_heap + http://www.cppreference.com/wiki/stl/algorithm/sort_heap?rev=1255079429&do=diff + sort_heap - #include <queue> - queue(); - queue( const queue& other ); +Syntax: -Kolejki mają domyślny konstruktor jak również konstruktor kopiujący. + #include <algorithm> + void sort_heap( random_iterator start, random_iterator end ); + void sort_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp ); -Na przykład poniższy kod tworzy kolejkę stringów, następnie wczytuje pewne dane od użytkownika i je wypisuje: +The sort_heap() function turns the heap defined by [start,end) into a sorted +range. - + text/html - 2009-10-06T08:23:49-07:00 - Massimo Manghi - rbegin - corretta errata traduzione... - http://www.cppreference.com/wiki/it/stl/deque/rbegin?rev=1254842629&do=diff - rbegin - -Sintassi: + 2009-10-09T02:09:28-07:00 + make_heap + http://www.cppreference.com/wiki/stl/algorithm/make_heap?rev=1255079368&do=diff + make_heap - #include <deque> - reverse_iterator rbegin(); - const_reverse_iterator rbegin() const; - -La funzione rbegin() ritorna un reverse_iterator alla corrente fine della deque +Syntax: -rbegin() gira a tempo costante. + #include <algorithm> + void make_heap( random_iterator start, random_iterator end ); + void make_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp ); -Argomenti correlati: begin, end, rend +The make_heap() function turns the given range of elements [start,end) into a +heap. - + text/html - 2009-10-06T08:18:33-07:00 - Szymon - Tabela ASCII - utworzono - http://www.cppreference.com/wiki/pl/ascii?rev=1254842313&do=diff - Tabela ASCII + 2009-10-09T02:08:52-07:00 + pop_heap + http://www.cppreference.com/wiki/stl/algorithm/pop_heap?rev=1255079332&do=diff + pop_heap + +Syntax: + #include <algorithm> + void pop_heap( random_iterator start, random_iterator end ); + void pop_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp ); -W poniższej tabeli znajduje się 128 kodów ASCII w systemach: dziesiętnym, ósemkowym i szesnastkowym. -DziesiętnyÓsemkowySzenastkowyZnakOpis0000NUL1101SOHstart of header2202STXstart of text3303ETXend of text4404EOTend of transmission5505ENQenquiry6606ACKacknowledge7707BELbell81008BSbackspace91109HThorizontal tab10120ALFline feed11130BVTvertical tab12140CFFform feed13150DCRcarriage return14160ESOshift out15170FSIshift in162010DLEdata link escape172111DC1nie przypisany, ale zwykle XON… +The pop_heap() function removes the largest element (defined as the element at +the front of the heap) from the given heap. - + text/html - 2009-10-06T08:11:38-07:00 - Ruslan Sennov - isdigit - создано - http://www.cppreference.com/wiki/ru/c/string/isdigit?rev=1254841898&do=diff - isdigit - -Синтаксис: + 2009-10-09T02:08:01-07:00 + push_heap + http://www.cppreference.com/wiki/stl/algorithm/push_heap?rev=1255079281&do=diff + push_heap - #include <cctype> - int isdigit( int ch ); +Syntax: + #include <algorithm> + void push_heap( random_iterator start, random_iterator end ); + void push_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp ); -Функция isdigit() возвращяет ненулевое значение если её аргумент является цифрой. Иначе возвращает ноль. +The push_heap() function adds an element (defined as the last element before +end) to a heap (defined as the range of elements between [start,''end-1). - + text/html - 2009-10-06T02:38:27-07:00 - Massimo Manghi - class - http://www.cppreference.com/wiki/it/keywords/class?rev=1254821907&do=diff - class - -Sintassi: - - class class-name : inheritance-list { - private: - private-members-list; - protected: - protected-members-list; - public: - public-members-list; - } object-list; - -La parola riservata class permette di definire nuove classi. class-name -è il nome della classe che viene definita e la inheritance-list è una lista -opzionale di classi ereditate dalla nuova classe. - - - text/html - 2009-10-06T02:20:54-07:00 - Massimo Manghi - C++ Reference (Italiano) - http://www.cppreference.com/wiki/it/start?rev=1254820854&do=diff - C++ Reference (Italiano) - -Argomenti Generali + 2009-10-09T02:06:42-07:00 + set_symmetric_difference + http://www.cppreference.com/wiki/stl/algorithm/set_symmetric_difference?rev=1255079202&do=diff + set_symmetric_difference +Syntax: - * FAQ - * Comandi del preprocessore - * Precedenza degli operatori - * Sequenze di escape - * Tabella caratteri ASCII - * Tipi di dati - * Parole riservate - -Libreria Standard del C + #include <algorithm> + output_iterator set_symmetric_difference( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); + output_iterator set_symmetric_difference( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp ); + + + text/html + 2009-10-09T02:04:50-07:00 + set_difference + http://www.cppreference.com/wiki/stl/algorithm/set_difference?rev=1255079090&do=diff + set_difference +Syntax: - * Introduzione - * Input/Output in C - * Stringhe e Caratteri - * Funzioni Matematiche - * Data e Ora in C - * Allocazione della memoria - * Altre funzioni standard del C + #include <algorithm> + template< typename InIterA, typename InIterB, typename OutIter > + OutIter set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result ); + template< typename InIterA, typename InIterB, typename OutIter, typename StrictWeakOrdering > + OutIter set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp ); - + text/html - 2009-10-06T00:49:07-07:00 - switch - http://www.cppreference.com/wiki/it/keywords/switch?rev=1254815347&do=diff - switch + 2009-10-09T02:04:02-07:00 + set_intersection + http://www.cppreference.com/wiki/stl/algorithm/set_intersection?rev=1255079042&do=diff + set_intersection Syntax: - switch( expression ) { - case A: - statement list; - break; - case B: - statement list; - break; - ... - case N: - statement list; - break; - default: - statement list; - break; - } - -Il costrutto switch permette di confrontare expression con una serie di valori -ed eseguire il codice definito da un blocco case che ha come argomento la costante -che soddisfa la condizione di uguaglianza con expression. Questo costrutto si usa -spesso come alternativa … + #include <algorithm> + template< typename InIterA, typename InIterB, typename OutIter > + OutIter set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result ); + template< typename InIterA, typename InIterB, typename OutIter, typename StrictWeakOrdering > + OutIter set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp ); - + text/html - 2009-10-06T00:30:53-07:00 - Massimo Manghi - true - creata - http://www.cppreference.com/wiki/it/keywords/true?rev=1254814253&do=diff - true + 2009-10-09T02:03:03-07:00 + set_union + http://www.cppreference.com/wiki/stl/algorithm/set_union?rev=1255078983&do=diff + set_union +Syntax: -Parola riservata che rappresenta la costante booleana con valore “true”. - -Argomenti correlati: bool, false + #include <algorithm> + output_iterator set_union( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); + output_iterator set_union( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp ); - + text/html - 2009-10-06T00:29:58-07:00 - Massimo Manghi - false - creata - http://www.cppreference.com/wiki/it/keywords/false?rev=1254814198&do=diff - false + 2009-10-09T01:59:55-07:00 + stable_partition + http://www.cppreference.com/wiki/stl/algorithm/stable_partition?rev=1255078795&do=diff + stable_partition +Syntax: -Parola riservata che rappresenta una costante booleana con valore “false”. Di solito equivale al -valore intero 0. + #include <algorithm> + bidirectional_iterator stable_partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p ); -Argomenti correlati: bool, true +The stable_partition() function behaves similarily to partition(). The +difference between the two algorithms is that stable_partition() will preserve +the initial ordering of the elements in the two groups. - + text/html - 2009-10-06T00:19:37-07:00 - Massimo Manghi - default - creata - http://www.cppreference.com/wiki/it/keywords/default?rev=1254813577&do=diff - default + 2009-10-09T01:59:17-07:00 + partition + http://www.cppreference.com/wiki/stl/algorithm/partition?rev=1255078757&do=diff + partition +Syntax: -La parola default viene usata in una struttura switch per definire il blocco -di codice che verrà eseguito se tutte le stanze definite dai case non hanno trovato -un match + #include <algorithm> + bidirectional_iterator partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p ); -Related Topics: case, switch +The partition algorithm re-orders the elements in [start,end) such that the +elements for which the predicate p returns true come before the elements for +which p returns false. - + text/html - 2009-10-06T00:16:49-07:00 - Massimo Manghi - case - creata - http://www.cppreference.com/wiki/it/keywords/case?rev=1254813409&do=diff - case + 2009-10-09T01:56:40-07:00 + inplace_merge + http://www.cppreference.com/wiki/stl/algorithm/inplace_merge?rev=1255078600&do=diff + inplace_merge -La parola riservata case è usata per confrontare il valore di una variabile -con un certo valore all'interno di una struttura case +Syntax: -Argomenti correlati: default, switch + #include <algorithm> + void inplace_merge( bidirectional_iterator start, bidirectional_iterator middle, bidirectional_iterator end ); + void inplace_merge( bidirectional_iterator start, bidirectional_iterator middle, bidirectional_iterator end, StrictWeakOrdering cmp ); - + text/html - 2009-10-05T08:46:27-07:00 - Massimo Manghi - export - external links added - http://www.cppreference.com/wiki/it/keywords/export?rev=1254757587&do=diff - export - - -La parola riservata export è intesa a permettere la definizione dei template del C++ separatamente dalla -loro dichiarazione. Mentre questa parola è ufficialmente parte degli standard del C++ sollo alcuni compilatori -la supportano (ad esempio il compilatore Comeau C++) e non è supportata da -alcuni compilatori comuni tra gli sviluppatori, come il compilatore GCC e -Visual C++. + 2009-10-09T01:55:23-07:00 + merge + http://www.cppreference.com/wiki/stl/algorithm/merge?rev=1255078523&do=diff + merge + +Syntax: + + #include <algorithm> + output_iterator merge( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); + output_iterator merge( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp ); diff --git a/orig/io/bad.html b/orig/io/bad.html index 14ed6e0..e971140 100644 --- a/orig/io/bad.html +++ b/orig/io/bad.html @@ -51,7 +51,7 @@

-
Translations of this page?:
+
Translations of this page?:
@@ -145,6 +145,6 @@

bad

-
+
diff --git a/orig/io/c_strings_getline.html b/orig/io/c_strings_getline.html index 0a61662..f5bd078 100644 --- a/orig/io/c_strings_getline.html +++ b/orig/io/c_strings_getline.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/io/clear.html b/orig/io/clear.html index 6f54b4a..68570f3 100644 --- a/orig/io/clear.html +++ b/orig/io/clear.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -157,6 +157,6 @@

clear

-
+
diff --git a/orig/io/close.html b/orig/io/close.html index 418b16d..ce99a1e 100644 --- a/orig/io/close.html +++ b/orig/io/close.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

close

-
+
diff --git a/orig/io/constructors.html b/orig/io/constructors.html index fda6541..06ab7bc 100644 --- a/orig/io/constructors.html +++ b/orig/io/constructors.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,9 +73,9 @@

I/O Constructors

Syntax: 

    #include <fstream>
-    fstream( const char *filename, openmode mode );
-    ifstream( const char *filename, openmode mode );
-    ofstream( const char *filename, openmode mode );
+ fstream( const char *filename, ios_base::openmode mode ); + ifstream( const char *filename, ios_base::openmode mode ); + ofstream( const char *filename, ios_base::openmode mode );

The fstream, ifstream, and ofstream objects are used to do file I/O. The optional mode defines how the file is to be opened, according to the IO stream @@ -92,7 +92,7 @@

I/O Constructors

For example, the following code reads input data and appends the result to an output file. 

    ifstream fin( "/tmp/data.txt" );
-    ofstream fout( "/tmp/results.txt", ios::app );
+    ofstream fout( "/tmp/results.txt", ios_base::app );
     while( fin >> temp )
       fout << temp + 2 << endl;
     // Files are closed automatically when the variables fin and fout fall out of scope.
@@ -115,7 +115,7 @@

I/O Constructors

@@ -142,6 +142,6 @@

I/O Constructors

-
+
diff --git a/orig/io/eof.html b/orig/io/eof.html index 7a9892c..5caba60 100644 --- a/orig/io/eof.html +++ b/orig/io/eof.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -176,6 +176,6 @@

eof

-
+
diff --git a/orig/io/exceptions.html b/orig/io/exceptions.html index f687c7b..9948108 100644 --- a/orig/io/exceptions.html +++ b/orig/io/exceptions.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

exceptions

-
+
diff --git a/orig/io/fail.html b/orig/io/fail.html index 425113a..67152ca 100644 --- a/orig/io/fail.html +++ b/orig/io/fail.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -160,6 +160,6 @@

fail

-
+
diff --git a/orig/io/fill.html b/orig/io/fill.html index 200b26e..9f21664 100644 --- a/orig/io/fill.html +++ b/orig/io/fill.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

fill

-
+
diff --git a/orig/io/flags.html b/orig/io/flags.html index 2b096bb..77703a1 100644 --- a/orig/io/flags.html +++ b/orig/io/flags.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

flags

-
+
diff --git a/orig/io/flush.html b/orig/io/flush.html index d057ed0..66c4858 100644 --- a/orig/io/flush.html +++ b/orig/io/flush.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

flush

-
+
diff --git a/orig/io/gcount.html b/orig/io/gcount.html index 7af21ae..14573e2 100644 --- a/orig/io/gcount.html +++ b/orig/io/gcount.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

gcount

-
+
diff --git a/orig/io/get.html b/orig/io/get.html index 0e2c3d6..26938aa 100644 --- a/orig/io/get.html +++ b/orig/io/get.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -148,6 +148,6 @@

get

-
+
diff --git a/orig/io/getline.html b/orig/io/getline.html index 2253193..8f27a91 100644 --- a/orig/io/getline.html +++ b/orig/io/getline.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -157,6 +157,6 @@

getline

-
+
diff --git a/orig/io/good.html b/orig/io/good.html index adf8444..e3b5b62 100644 --- a/orig/io/good.html +++ b/orig/io/good.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -141,6 +141,6 @@

good

-
+
diff --git a/orig/io/ignore.html b/orig/io/ignore.html index ec79f1d..c00d79f 100644 --- a/orig/io/ignore.html +++ b/orig/io/ignore.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

ignore

-
+
diff --git a/orig/io/io_flags#mode_flags.html b/orig/io/io_flags#mode_flags.html index 666c261..228131b 100644 --- a/orig/io/io_flags#mode_flags.html +++ b/orig/io/io_flags#mode_flags.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -436,6 +436,6 @@

Mode flags

-
+
diff --git a/orig/io/io_flags.html b/orig/io/io_flags.html index 39d02ce..31cd4bc 100644 --- a/orig/io/io_flags.html +++ b/orig/io/io_flags.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -436,6 +436,6 @@

Mode flags

-
+
diff --git a/orig/io/open.html b/orig/io/open.html index 4f157c8..54a3d3e 100644 --- a/orig/io/open.html +++ b/orig/io/open.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -137,6 +137,6 @@

open

-
+
diff --git a/orig/io/peek.html b/orig/io/peek.html index 48fe508..48d7db2 100644 --- a/orig/io/peek.html +++ b/orig/io/peek.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

peek

-
+
diff --git a/orig/io/precision.html b/orig/io/precision.html index ab71de1..cb176e6 100644 --- a/orig/io/precision.html +++ b/orig/io/precision.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

precision

-
+
diff --git a/orig/io/put.html b/orig/io/put.html index 1723bcc..51d8b5d 100644 --- a/orig/io/put.html +++ b/orig/io/put.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

put

-
+
diff --git a/orig/io/putback.html b/orig/io/putback.html index a23e485..03b2338 100644 --- a/orig/io/putback.html +++ b/orig/io/putback.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

putback

-
+
diff --git a/orig/io/rdstate.html b/orig/io/rdstate.html index 9a1df11..061235b 100644 --- a/orig/io/rdstate.html +++ b/orig/io/rdstate.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

rdstate

-
+
diff --git a/orig/io/read.html b/orig/io/read.html index f8b0d9f..ca7b4e6 100644 --- a/orig/io/read.html +++ b/orig/io/read.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

read

-
+
diff --git a/orig/io/seekdir.html b/orig/io/seekdir.html index 8fc84c9..fed3c6a 100644 --- a/orig/io/seekdir.html +++ b/orig/io/seekdir.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

seekdir

-
+
diff --git a/orig/io/seekg.html b/orig/io/seekg.html index 0ed4317..602c9fa 100644 --- a/orig/io/seekg.html +++ b/orig/io/seekg.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

seekg

-
+
diff --git a/orig/io/seekp.html b/orig/io/seekp.html index 00bf0ea..be4ca31 100644 --- a/orig/io/seekp.html +++ b/orig/io/seekp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

seekp

-
+
diff --git a/orig/io/setf.html b/orig/io/setf.html index 4ee89bc..eb680a2 100644 --- a/orig/io/setf.html +++ b/orig/io/setf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

setf

-
+
diff --git a/orig/io/sstream/constructors.html b/orig/io/sstream/constructors.html index 52a5e0b..f060277 100644 --- a/orig/io/sstream/constructors.html +++ b/orig/io/sstream/constructors.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -172,6 +172,6 @@

String

-
+
diff --git a/orig/io/sstream/operators.html b/orig/io/sstream/operators.html index 6c31ef5..5b067bc 100644 --- a/orig/io/sstream/operators.html +++ b/orig/io/sstream/operators.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

String Stream

-
+
diff --git a/orig/io/sstream/rdbuf.html b/orig/io/sstream/rdbuf.html index a6e92d2..c387fdd 100644 --- a/orig/io/sstream/rdbuf.html +++ b/orig/io/sstream/rdbuf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

rdbuf

-
+
diff --git a/orig/io/sstream/start.html b/orig/io/sstream/start.html index ec7b27d..2c2c70b 100644 --- a/orig/io/sstream/start.html +++ b/orig/io/sstream/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -158,6 +158,6 @@

C++ String Streams

-
+
diff --git a/orig/io/sstream/str.html b/orig/io/sstream/str.html index b6c462d..6645d71 100644 --- a/orig/io/sstream/str.html +++ b/orig/io/sstream/str.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -163,6 +163,6 @@

str

-
+
diff --git a/orig/io/start.html b/orig/io/start.html index 502e210..4fb843b 100644 --- a/orig/io/start.html +++ b/orig/io/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -235,6 +235,6 @@

C++ I/O

-
+
diff --git a/orig/io/sync_with_stdio.html b/orig/io/sync_with_stdio.html index e2a48c0..83e90e5 100644 --- a/orig/io/sync_with_stdio.html +++ b/orig/io/sync_with_stdio.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

sync_with_stdio

-
+
diff --git a/orig/io/tellg.html b/orig/io/tellg.html index c52f663..a4b7624 100644 --- a/orig/io/tellg.html +++ b/orig/io/tellg.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

tellg

-
+
diff --git a/orig/io/tellp.html b/orig/io/tellp.html index bcfe47a..541ee19 100644 --- a/orig/io/tellp.html +++ b/orig/io/tellp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

tellp

-
+
diff --git a/orig/io/unsetf.html b/orig/io/unsetf.html index e91224d..c4ef588 100644 --- a/orig/io/unsetf.html +++ b/orig/io/unsetf.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

unsetf

-
+
diff --git a/orig/io/width.html b/orig/io/width.html index 4d4f541..b68de9e 100644 --- a/orig/io/width.html +++ b/orig/io/width.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

width

-
+
diff --git a/orig/io/write.html b/orig/io/write.html index beae9a2..697fb94 100644 --- a/orig/io/write.html +++ b/orig/io/write.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

write

-
+
diff --git a/orig/keywords/asm.html b/orig/keywords/asm.html index fcc3b11..11e04e1 100644 --- a/orig/keywords/asm.html +++ b/orig/keywords/asm.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

asm

-
+
diff --git a/orig/keywords/auto.html b/orig/keywords/auto.html index 13ed6e8..dca152c 100644 --- a/orig/keywords/auto.html +++ b/orig/keywords/auto.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

auto

-
+
diff --git a/orig/keywords/bool.html b/orig/keywords/bool.html index 113e944..04b1c43 100644 --- a/orig/keywords/bool.html +++ b/orig/keywords/bool.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

bool

-
+
diff --git a/orig/keywords/break.html b/orig/keywords/break.html index 8fb969d..26baa8f 100644 --- a/orig/keywords/break.html +++ b/orig/keywords/break.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

break

-
+
diff --git a/orig/keywords/case.html b/orig/keywords/case.html index 81bd73e..aff6043 100644 --- a/orig/keywords/case.html +++ b/orig/keywords/case.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -93,7 +93,7 @@

case

@@ -120,6 +120,6 @@

case

-
+
diff --git a/orig/keywords/casting_comparison.html b/orig/keywords/casting_comparison.html index 2ec3b37..3384268 100644 --- a/orig/keywords/casting_comparison.html +++ b/orig/keywords/casting_comparison.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -211,6 +211,6 @@

+
diff --git a/orig/keywords/catch.html b/orig/keywords/catch.html index 254eb76..96e1b9f 100644 --- a/orig/keywords/catch.html +++ b/orig/keywords/catch.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

catch

-
+
diff --git a/orig/keywords/char.html b/orig/keywords/char.html index b3e9294..4f45933 100644 --- a/orig/keywords/char.html +++ b/orig/keywords/char.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

char

-
+
diff --git a/orig/keywords/class.html b/orig/keywords/class.html index fc42c04..07f8ab0 100644 --- a/orig/keywords/class.html +++ b/orig/keywords/class.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -149,6 +149,6 @@

class

-
+
diff --git a/orig/keywords/const.html b/orig/keywords/const.html index 0c0193a..89c2700 100644 --- a/orig/keywords/const.html +++ b/orig/keywords/const.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -258,6 +258,6 @@

Methods

-
+
diff --git a/orig/keywords/const_cast.html b/orig/keywords/const_cast.html index fab7349..630d4d3 100644 --- a/orig/keywords/const_cast.html +++ b/orig/keywords/const_cast.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -137,6 +137,6 @@

const_cast

-
+
diff --git a/orig/keywords/continue.html b/orig/keywords/continue.html index f7de799..0ee8714 100644 --- a/orig/keywords/continue.html +++ b/orig/keywords/continue.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

continue

-
+
diff --git a/orig/keywords/default.html b/orig/keywords/default.html index 7f9867c..d945495 100644 --- a/orig/keywords/default.html +++ b/orig/keywords/default.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

default

-
+
diff --git a/orig/keywords/delete.html b/orig/keywords/delete.html index 56dc57c..13b9185 100644 --- a/orig/keywords/delete.html +++ b/orig/keywords/delete.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

delete

-
+
diff --git a/orig/keywords/dependent_name.html b/orig/keywords/dependent_name.html index 31ed23f..d0005ee 100644 --- a/orig/keywords/dependent_name.html +++ b/orig/keywords/dependent_name.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,6 +116,6 @@

Dependent Names

-
+
diff --git a/orig/keywords/do.html b/orig/keywords/do.html index 6c689c9..e7f425f 100644 --- a/orig/keywords/do.html +++ b/orig/keywords/do.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

do

-
+
diff --git a/orig/keywords/double.html b/orig/keywords/double.html index 6605444..aa7e8dc 100644 --- a/orig/keywords/double.html +++ b/orig/keywords/double.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

double

-
+
diff --git a/orig/keywords/dynamic_cast.html b/orig/keywords/dynamic_cast.html index f15d236..258277c 100644 --- a/orig/keywords/dynamic_cast.html +++ b/orig/keywords/dynamic_cast.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -151,6 +151,6 @@

dynamic_cast

-
+
diff --git a/orig/keywords/else.html b/orig/keywords/else.html index f311791..d3bcd23 100644 --- a/orig/keywords/else.html +++ b/orig/keywords/else.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

else

-
+
diff --git a/orig/keywords/enum.html b/orig/keywords/enum.html index 6dd660b..37c4004 100644 --- a/orig/keywords/enum.html +++ b/orig/keywords/enum.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -162,6 +162,6 @@

enum

-
+
diff --git a/orig/keywords/explicit.html b/orig/keywords/explicit.html index f387ff3..2e140ee 100644 --- a/orig/keywords/explicit.html +++ b/orig/keywords/explicit.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -137,6 +137,6 @@

explicit

-
+
diff --git a/orig/keywords/export.html b/orig/keywords/export.html index 364aeb5..a72e360 100644 --- a/orig/keywords/export.html +++ b/orig/keywords/export.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

export

-
+
diff --git a/orig/keywords/extern.html b/orig/keywords/extern.html index 5fdd2e4..36346f4 100644 --- a/orig/keywords/extern.html +++ b/orig/keywords/extern.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -137,6 +137,6 @@

extern

-
+
diff --git a/orig/keywords/false.html b/orig/keywords/false.html index 5b04f11..b8e9e20 100644 --- a/orig/keywords/false.html +++ b/orig/keywords/false.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

false

-
+
diff --git a/orig/keywords/float.html b/orig/keywords/float.html index 80967f5..e1ae8b9 100644 --- a/orig/keywords/float.html +++ b/orig/keywords/float.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

float

-
+
diff --git a/orig/keywords/for.html b/orig/keywords/for.html index fbb8cfc..21f9b81 100644 --- a/orig/keywords/for.html +++ b/orig/keywords/for.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -149,6 +149,6 @@

for

-
+
diff --git a/orig/keywords/friend.html b/orig/keywords/friend.html index 7ddaa0c..3992a07 100644 --- a/orig/keywords/friend.html +++ b/orig/keywords/friend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

friend

-
+
diff --git a/orig/keywords/goto.html b/orig/keywords/goto.html index c91f00e..83551d4 100644 --- a/orig/keywords/goto.html +++ b/orig/keywords/goto.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

goto

-
+
diff --git a/orig/keywords/if.html b/orig/keywords/if.html index 4318968..282cf05 100644 --- a/orig/keywords/if.html +++ b/orig/keywords/if.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

if

-
+
diff --git a/orig/keywords/inline.html b/orig/keywords/inline.html index f2ab413..fa0d4b7 100644 --- a/orig/keywords/inline.html +++ b/orig/keywords/inline.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

inline

-
+
diff --git a/orig/keywords/int.html b/orig/keywords/int.html index c68e3a1..2c16fb9 100644 --- a/orig/keywords/int.html +++ b/orig/keywords/int.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

int

-
+
diff --git a/orig/keywords/long.html b/orig/keywords/long.html index 6bb468b..d2bb2c2 100644 --- a/orig/keywords/long.html +++ b/orig/keywords/long.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

long

-
+
diff --git a/orig/keywords/mutable.html b/orig/keywords/mutable.html index a8fde92..c4f08ec 100644 --- a/orig/keywords/mutable.html +++ b/orig/keywords/mutable.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

mutable

-
+
diff --git a/orig/keywords/namespace.html b/orig/keywords/namespace.html index 1261683..5da6781 100644 --- a/orig/keywords/namespace.html +++ b/orig/keywords/namespace.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -181,6 +181,6 @@

namespace alias

-
+
diff --git a/orig/keywords/new.html b/orig/keywords/new.html index 7a9fe79..16efc68 100644 --- a/orig/keywords/new.html +++ b/orig/keywords/new.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -175,6 +175,6 @@

new

-
+
diff --git a/orig/keywords/operator.html b/orig/keywords/operator.html index f9e06ef..245d7c2 100644 --- a/orig/keywords/operator.html +++ b/orig/keywords/operator.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

operator

-
+
diff --git a/orig/keywords/private.html b/orig/keywords/private.html index 0fbf685..5958768 100644 --- a/orig/keywords/private.html +++ b/orig/keywords/private.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

private

-
+
diff --git a/orig/keywords/protected.html b/orig/keywords/protected.html index 536d622..1179aa9 100644 --- a/orig/keywords/protected.html +++ b/orig/keywords/protected.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

protected

-
+
diff --git a/orig/keywords/public.html b/orig/keywords/public.html index 3556f4e..ac84b06 100644 --- a/orig/keywords/public.html +++ b/orig/keywords/public.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

public

-
+
diff --git a/orig/keywords/register.html b/orig/keywords/register.html index 565bb08..2685e3c 100644 --- a/orig/keywords/register.html +++ b/orig/keywords/register.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

register

-
+
diff --git a/orig/keywords/reinterpret_cast.html b/orig/keywords/reinterpret_cast.html index 094e1ea..d5101db 100644 --- a/orig/keywords/reinterpret_cast.html +++ b/orig/keywords/reinterpret_cast.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

reinterpret_cast

-
+
diff --git a/orig/keywords/return.html b/orig/keywords/return.html index e1e51dd..5cbaac3 100644 --- a/orig/keywords/return.html +++ b/orig/keywords/return.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -123,6 +123,6 @@

return

-
+
diff --git a/orig/keywords/short.html b/orig/keywords/short.html index 4caabe5..0de89b0 100644 --- a/orig/keywords/short.html +++ b/orig/keywords/short.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

short

-
+
diff --git a/orig/keywords/signed.html b/orig/keywords/signed.html index 521284e..d7c6557 100644 --- a/orig/keywords/signed.html +++ b/orig/keywords/signed.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

signed

-
+
diff --git a/orig/keywords/sizeof.html b/orig/keywords/sizeof.html index 85155bf..5d2e5e4 100644 --- a/orig/keywords/sizeof.html +++ b/orig/keywords/sizeof.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -147,7 +147,7 @@

sizeof

@@ -174,6 +174,6 @@

sizeof

-
+
diff --git a/orig/keywords/start.html b/orig/keywords/start.html index cbd3bb5..609c36f 100644 --- a/orig/keywords/start.html +++ b/orig/keywords/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -345,6 +345,6 @@

C++ Keywords

-
+
diff --git a/orig/keywords/static.html b/orig/keywords/static.html index 11fe3b0..bc5f61c 100644 --- a/orig/keywords/static.html +++ b/orig/keywords/static.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -237,6 +237,6 @@

Internal linkage

-
+
diff --git a/orig/keywords/static_cast.html b/orig/keywords/static_cast.html index d2cf5dd..3cd8a69 100644 --- a/orig/keywords/static_cast.html +++ b/orig/keywords/static_cast.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

static_cast

-
+
diff --git a/orig/keywords/struct.html b/orig/keywords/struct.html index 4f1f179..b30968b 100644 --- a/orig/keywords/struct.html +++ b/orig/keywords/struct.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -149,6 +149,6 @@

struct

-
+
diff --git a/orig/keywords/switch.html b/orig/keywords/switch.html index 594f7ce..37405d3 100644 --- a/orig/keywords/switch.html +++ b/orig/keywords/switch.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -157,6 +157,6 @@

switch

-
+
diff --git a/orig/keywords/template.html b/orig/keywords/template.html index 836a68b..b962977 100644 --- a/orig/keywords/template.html +++ b/orig/keywords/template.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -239,6 +239,6 @@

-
+
diff --git a/orig/keywords/this.html b/orig/keywords/this.html index 82d40d4..f49b9be 100644 --- a/orig/keywords/this.html +++ b/orig/keywords/this.html @@ -51,7 +51,7 @@

-
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

this

-
+
diff --git a/orig/keywords/throw.html b/orig/keywords/throw.html index 455b955..2613e7a 100644 --- a/orig/keywords/throw.html +++ b/orig/keywords/throw.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -174,6 +174,6 @@

throw

-
+
diff --git a/orig/keywords/true.html b/orig/keywords/true.html index 0d6eeca..68bb93c 100644 --- a/orig/keywords/true.html +++ b/orig/keywords/true.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

true

-
+
diff --git a/orig/keywords/try.html b/orig/keywords/try.html index 62dd06c..d462c37 100644 --- a/orig/keywords/try.html +++ b/orig/keywords/try.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

try

-
+
diff --git a/orig/keywords/typedef.html b/orig/keywords/typedef.html index c2e4a9c..42f3364 100644 --- a/orig/keywords/typedef.html +++ b/orig/keywords/typedef.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -110,7 +110,7 @@

typedef

@@ -137,6 +137,6 @@

typedef

-
+
diff --git a/orig/keywords/typeid.html b/orig/keywords/typeid.html index 81c9bcf..f6cac4d 100644 --- a/orig/keywords/typeid.html +++ b/orig/keywords/typeid.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

typeid

-
+
diff --git a/orig/keywords/typename.html b/orig/keywords/typename.html index 08e7a7d..3b9b455 100644 --- a/orig/keywords/typename.html +++ b/orig/keywords/typename.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -148,6 +148,6 @@

-
+
diff --git a/orig/keywords/union.html b/orig/keywords/union.html index fdb4926..e828b25 100644 --- a/orig/keywords/union.html +++ b/orig/keywords/union.html @@ -51,7 +51,7 @@

-
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

union

-
+
diff --git a/orig/keywords/unsigned.html b/orig/keywords/unsigned.html index a91ea04..f118b1a 100644 --- a/orig/keywords/unsigned.html +++ b/orig/keywords/unsigned.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

unsigned

-
+
diff --git a/orig/keywords/using.html b/orig/keywords/using.html index d365402..f8726ce 100644 --- a/orig/keywords/using.html +++ b/orig/keywords/using.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

using

-
+
diff --git a/orig/keywords/virtual.html b/orig/keywords/virtual.html index b5f2a73..04549c3 100644 --- a/orig/keywords/virtual.html +++ b/orig/keywords/virtual.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -176,6 +176,6 @@

virtual

-
+
diff --git a/orig/keywords/void.html b/orig/keywords/void.html index db0cdb0..227682f 100644 --- a/orig/keywords/void.html +++ b/orig/keywords/void.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

void

-
+
diff --git a/orig/keywords/volatile.html b/orig/keywords/volatile.html index d0c99ef..cc005de 100644 --- a/orig/keywords/volatile.html +++ b/orig/keywords/volatile.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -119,6 +119,6 @@

volatile

-
+
diff --git a/orig/keywords/wchar_t.html b/orig/keywords/wchar_t.html index 164063c..c76a9f4 100644 --- a/orig/keywords/wchar_t.html +++ b/orig/keywords/wchar_t.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -96,7 +96,7 @@

wchar_t

@@ -123,6 +123,6 @@

wchar_t

-
+
diff --git a/orig/keywords/while.html b/orig/keywords/while.html index a392f67..076276e 100644 --- a/orig/keywords/while.html +++ b/orig/keywords/while.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

while

-
+
diff --git a/orig/limits/numeric_limits.html b/orig/limits/numeric_limits.html index 3e5a283..45c62bf 100644 --- a/orig/limits/numeric_limits.html +++ b/orig/limits/numeric_limits.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -225,6 +225,6 @@

numeric_limits

-
+
diff --git a/orig/limits/start.html b/orig/limits/start.html index b8a5c67..5f11be7 100644 --- a/orig/limits/start.html +++ b/orig/limits/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,6 +116,6 @@

The <limits&

-
+
diff --git a/orig/localization.html b/orig/localization.html index 7346378..902daec 100644 --- a/orig/localization.html +++ b/orig/localization.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

Tra

-
+
diff --git a/orig/operator_precedence.html b/orig/operator_precedence.html index 211e3ba..9bf7d9e 100644 --- a/orig/operator_precedence.html +++ b/orig/operator_precedence.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -514,6 +514,6 @@

Overloading

-
+
diff --git a/orig/preprocessor/define.html b/orig/preprocessor/define.html index 82fe42d..53ba3f4 100644 --- a/orig/preprocessor/define.html +++ b/orig/preprocessor/define.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -170,6 +170,6 @@

#define

-
+
diff --git a/orig/preprocessor/error.html b/orig/preprocessor/error.html index b90b4dd..3bd49fb 100644 --- a/orig/preprocessor/error.html +++ b/orig/preprocessor/error.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -123,6 +123,6 @@

#error

-
+
diff --git a/orig/preprocessor/include.html b/orig/preprocessor/include.html index e50acfe..1c74314 100644 --- a/orig/preprocessor/include.html +++ b/orig/preprocessor/include.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

#include

-
+
diff --git a/orig/preprocessor/line.html b/orig/preprocessor/line.html index eac4678..02ad687 100644 --- a/orig/preprocessor/line.html +++ b/orig/preprocessor/line.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

#line

-
+
diff --git a/orig/preprocessor/pragma.html b/orig/preprocessor/pragma.html index cbbd848..43df45f 100644 --- a/orig/preprocessor/pragma.html +++ b/orig/preprocessor/pragma.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -174,6 +174,6 @@

pack

-
+
diff --git a/orig/preprocessor/preprocessor_if.html b/orig/preprocessor/preprocessor_if.html index 313077a..67318b1 100644 --- a/orig/preprocessor/preprocessor_if.html +++ b/orig/preprocessor/preprocessor_if.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -159,6 +159,6 @@

Preproces

-
+
diff --git a/orig/preprocessor/preprocessor_vars.html b/orig/preprocessor/preprocessor_vars.html index 0840772..51142d0 100644 --- a/orig/preprocessor/preprocessor_vars.html +++ b/orig/preprocessor/preprocessor_vars.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -158,6 +158,6 @@

GCC-specific va

-
+
diff --git a/orig/preprocessor/sharp.html b/orig/preprocessor/sharp.html index 01804d3..cf657cb 100644 --- a/orig/preprocessor/sharp.html +++ b/orig/preprocessor/sharp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -164,6 +164,6 @@

# and ##

-
+
diff --git a/orig/preprocessor/start.html b/orig/preprocessor/start.html index 62fbbe7..b517fe8 100644 --- a/orig/preprocessor/start.html +++ b/orig/preprocessor/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

Preprocessor Comm

-
+
diff --git a/orig/preprocessor/undef.html b/orig/preprocessor/undef.html index 292b5bb..502c9c8 100644 --- a/orig/preprocessor/undef.html +++ b/orig/preprocessor/undef.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

#undef

-
+
diff --git a/orig/start.html b/orig/start.html index 9b76f35..480f7c5 100644 --- a/orig/start.html +++ b/orig/start.html @@ -50,7 +50,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -210,6 +210,6 @@

C++ Reference

-
+
diff --git a/orig/stl/algorithm/accumulate.html b/orig/stl/algorithm/accumulate.html index c245913..32d5307 100644 --- a/orig/stl/algorithm/accumulate.html +++ b/orig/stl/algorithm/accumulate.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

accumulate

Syntax: 

    #include <numeric>
-    TYPE accumulate( iterator start, iterator end, TYPE val );
-    TYPE accumulate( iterator start, iterator end, TYPE val, BinaryFunction f );
+ TYPE accumulate( input_iterator start, input_iterator end, TYPE val ); + TYPE accumulate( input_iterator start, input_iterator end, TYPE val, BinaryFunction f );

The accumulate function computes the sum of val and all of the elements in the range [start,end). @@ -113,7 +113,7 @@

accumulate

-
+
@@ -127,7 +127,7 @@

accumulate

@@ -154,6 +154,6 @@

accumulate

-
+
diff --git a/orig/stl/algorithm/adjacent_difference.html b/orig/stl/algorithm/adjacent_difference.html index 4cfae22..5a66f11 100644 --- a/orig/stl/algorithm/adjacent_difference.html +++ b/orig/stl/algorithm/adjacent_difference.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

adjacent_difference 
    #include <numeric>
-    iterator adjacent_difference( iterator start, iterator end, iterator result );
-    iterator adjacent_difference( iterator start, iterator end, iterator result, BinaryFunction f );
+ output_iterator adjacent_difference( input_iterator start, input_iterator end, output_iterator result ); + output_iterator adjacent_difference( input_iterator start, input_iterator end, output_iterator result, BinaryFunction f );

The adjacent_difference() function calculates the differences between adjacent @@ -94,7 +94,7 @@

adjacent_difference

-
+
@@ -108,7 +108,7 @@

adjacent_difference @@ -135,6 +135,6 @@

adjacent_difference -
+
diff --git a/orig/stl/algorithm/adjacent_find.html b/orig/stl/algorithm/adjacent_find.html index 2ea8cdd..eff779b 100644 --- a/orig/stl/algorithm/adjacent_find.html +++ b/orig/stl/algorithm/adjacent_find.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

adjacent_find

Syntax: 

    #include <algorithm>
-    iterator adjacent_find( iterator start, iterator end );
-    iterator adjacent_find( iterator start, iterator end, BinPred pr );
+ forward_iterator adjacent_find( forward_iterator start, forward_iterator end ); + forward_iterator adjacent_find( forward_iterator start, forward_iterator end, BinPred pr );

The adjacent_find() function searches between start and end for two consecutive @@ -112,7 +112,7 @@

adjacent_find

-
+
@@ -126,7 +126,7 @@

adjacent_find

@@ -153,6 +153,6 @@

adjacent_find

-
+
diff --git a/orig/stl/algorithm/binary_search.html b/orig/stl/algorithm/binary_search.html index efd3522..3e832bd 100644 --- a/orig/stl/algorithm/binary_search.html +++ b/orig/stl/algorithm/binary_search.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

binary_search

Syntax: 

    #include <algorithm>
-    bool binary_search( iterator start, iterator end, const TYPE& val );
-    bool binary_search( iterator start, iterator end, const TYPE& val, Comp f );
+ bool binary_search( forward_iterator start, forward_iterator end, const TYPE& val ); + bool binary_search( forward_iterator start, forward_iterator end, const TYPE& val, Comp f );

The binary_search() function searches from start to end for val. The elements between start and end that are searched should be in ascending order as defined @@ -139,7 +139,7 @@

binary_search

@@ -166,6 +166,6 @@

binary_search

-
+
diff --git a/orig/stl/algorithm/copy.html b/orig/stl/algorithm/copy.html index ff1a1ce..c895f22 100644 --- a/orig/stl/algorithm/copy.html +++ b/orig/stl/algorithm/copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

copy

Syntax: 

    #include <algorithm>
-    iterator copy( iterator start, iterator end, iterator dest );
+ output_iterator copy( input_iterator start, input_iterator end, output_iterator dest );

The copy() function copies the elements between start and end to dest. In other words, after copy() has run, @@ -125,7 +125,7 @@

copy

@@ -152,6 +152,6 @@

copy

-
+
diff --git a/orig/stl/algorithm/copy_backward.html b/orig/stl/algorithm/copy_backward.html index 8d7c46e..e365cce 100644 --- a/orig/stl/algorithm/copy_backward.html +++ b/orig/stl/algorithm/copy_backward.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

copy_backward

Syntax: 

    #include <algorithm>
-    iterator copy_backward( iterator start, iterator end, iterator dest );
+ bidirectional_iterator2 copy_backward( bidirectional_iterator start, bidirectional_iterator end, bidirectional_iterator2 dest );

copy_backward() is similar to copy, in that both functions copy @@ -114,7 +114,7 @@

copy_backward

-
+
@@ -128,7 +128,7 @@

copy_backward

@@ -155,6 +155,6 @@

copy_backward

-
+
diff --git a/orig/stl/algorithm/copy_n.html b/orig/stl/algorithm/copy_n.html index 2d222d9..b9fd017 100644 --- a/orig/stl/algorithm/copy_n.html +++ b/orig/stl/algorithm/copy_n.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,6 +116,6 @@

copy_n

-
+
diff --git a/orig/stl/algorithm/count.html b/orig/stl/algorithm/count.html index 145c2ba..3cad9e8 100644 --- a/orig/stl/algorithm/count.html +++ b/orig/stl/algorithm/count.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,8 @@

count

Syntax: 

    #include <algorithm>
-    size_t count( iterator start, iterator end, const TYPE& val );
+ typename iterator_traits<input_iterator>::difference_type + count( input_iterator start, input_iterator end, const TYPE& val );

The count() function returns the number of elements between start and end that match val. @@ -103,7 +104,7 @@

count

-
+
@@ -117,7 +118,7 @@

count

@@ -144,6 +145,6 @@

count

-
+
diff --git a/orig/stl/algorithm/count_if.html b/orig/stl/algorithm/count_if.html index bae7c00..42f7c45 100644 --- a/orig/stl/algorithm/count_if.html +++ b/orig/stl/algorithm/count_if.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,8 @@

count_if

Syntax: 

    #include <algorithm>
-    size_t count_if( iterator start, iterator end, UnaryPred p );
+ typename iterator_traits<input_iterator>::difference_type + count_if( input_iterator start, input_iterator end, UnaryPred p );

The count_if() function returns the number of elements between start and end for which the predicate p returns true. @@ -105,7 +106,7 @@

count_if

-
+
@@ -119,7 +120,7 @@

count_if

@@ -146,6 +147,6 @@

count_if

-
+
diff --git a/orig/stl/algorithm/equal.html b/orig/stl/algorithm/equal.html index a648840..4f70809 100644 --- a/orig/stl/algorithm/equal.html +++ b/orig/stl/algorithm/equal.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

equal

Syntax: 

    #include <algorithm>
-    bool equal( iterator start1, iterator end1, iterator start2 );
-    bool equal( iterator start1, iterator end1, iterator start2, BinPred p );
+ bool equal( input_iterator start1, input_iterator end1, input_iterator2 start2 ); + bool equal( input_iterator start1, input_iterator end1, input_iterator2 start2, BinPred p );

The equal() function returns true if the elements in two ranges are the same. The first range of elements are those between start1 and end1. The second range @@ -110,7 +110,7 @@

equal

-
+
@@ -124,7 +124,7 @@

equal

@@ -151,6 +151,6 @@

equal

-
+
diff --git a/orig/stl/algorithm/equal_range.html b/orig/stl/algorithm/equal_range.html index 5c088da..f66d5de 100644 --- a/orig/stl/algorithm/equal_range.html +++ b/orig/stl/algorithm/equal_range.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

equal_range

Syntax: 

    #include <algorithm>
-    pair<iterator,iterator> equal_range( iterator first, iterator last, const TYPE& val );
-    pair<iterator,iterator> equal_range( iterator first, iterator last, const TYPE& val, CompFn comp );
+ pair<forward_iterator,forward_iterator> equal_range( forward_iterator first, forward_iterator last, const TYPE& val ); + pair<forward_iterator,forward_iterator> equal_range( forward_iterator first, forward_iterator last, const TYPE& val, CompFn comp );

The equal_range() function returns the range of elements between first and last that are equal to val. This function assumes that the elements between first @@ -122,7 +122,7 @@

equal_range

-
+
@@ -136,7 +136,7 @@

equal_range

@@ -163,6 +163,6 @@

equal_range

-
+
diff --git a/orig/stl/algorithm/fill.html b/orig/stl/algorithm/fill.html index 626b12b..784b1f1 100644 --- a/orig/stl/algorithm/fill.html +++ b/orig/stl/algorithm/fill.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

fill

Syntax: 

    #include <algorithm>
-    void fill( iterator start, iterator end, const TYPE& val );
+ void fill( forward_iterator start, forward_iterator end, const TYPE& val );

The function fill() assigns val to all of the elements between start and end.

@@ -88,7 +88,7 @@

fill

}   cout << "Before, v1 is: "; - for( unsigned int i = 0; i < v1.size(); i++ ) { + for( vector<int>::size_type i = 0; i < v1.size(); i++ ) { cout << v1[i] << " "; } cout << endl; @@ -96,7 +96,7 @@

fill

fill( v1.begin(), v1.end(), -1 );   cout << "After, v1 is: "; - for( unsigned int i = 0; i < v1.size(); i++ ) { + for( vector<int>::size_type i = 0; i < v1.size(); i++ ) { cout << v1[i] << " "; } cout << endl; @@ -111,7 +111,7 @@

fill

-
+
@@ -125,7 +125,7 @@

fill

@@ -152,6 +152,6 @@

fill

-
+
diff --git a/orig/stl/algorithm/fill_n.html b/orig/stl/algorithm/fill_n.html index 4be3913..2849846 100644 --- a/orig/stl/algorithm/fill_n.html +++ b/orig/stl/algorithm/fill_n.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

fill_n

Syntax: 

    #include <algorithm>
-    iterator fill_n( iterator start, size_t n, const TYPE& val );
+ void fill_n( output_iterator start, SIZE n, const TYPE& val );

The fill_n() function is similar to fill. Instead of assigning val to a range of elements, however, fill_n() assigns val to the first n elements @@ -90,7 +90,7 @@

fill_n

}   cout << "Before, v1 is: "; - for( unsigned int i = 0; i < v1.size(); i++ ) { + for( vector<int>::size_type i = 0; i < v1.size(); i++ ) { cout << v1[i] << " "; } cout << endl; @@ -98,7 +98,7 @@

fill_n

fill_n( v1.begin(), v1.size()/2, -1 );   cout << "After, v1 is: "; - for( unsigned int i = 0; i < v1.size(); i++ ) { + for( vector<int>::size_type i = 0; i < v1.size(); i++ ) { cout << v1[i] << " "; } cout << endl; @@ -113,7 +113,7 @@

fill_n

-
+
@@ -127,7 +127,7 @@

fill_n

@@ -154,6 +154,6 @@

fill_n

-
+
diff --git a/orig/stl/algorithm/find.html b/orig/stl/algorithm/find.html index e74ed05..f2f7d49 100644 --- a/orig/stl/algorithm/find.html +++ b/orig/stl/algorithm/find.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

find

Syntax: 

    #include <algorithm>
-    iterator find( iterator start, iterator end, const TYPE& val );
+ input_iterator find( input_iterator start, input_iterator end, const TYPE& val );

The find() algorithm looks for an element matching val between start and end. If an element matching val is found, the return value is an iterator that @@ -125,7 +125,7 @@

find

-
+
@@ -139,7 +139,7 @@

find

@@ -166,6 +166,6 @@

find

-
+
diff --git a/orig/stl/algorithm/find_end.html b/orig/stl/algorithm/find_end.html index 57d6c0b..f744da3 100644 --- a/orig/stl/algorithm/find_end.html +++ b/orig/stl/algorithm/find_end.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

find_end

Syntax: 

    #include <algorithm>
-    iterator find_end( iterator start, iterator end, iterator seq_start, iterator seq_end );
-    iterator find_end( iterator start, iterator end, iterator seq_start, iterator seq_end, BinPred bp );
+ forward_iterator find_end( forward_iterator start, forward_iterator end, forward_iterator2 seq_start, forward_iterator2 seq_end ); + forward_iterator find_end( forward_iterator start, forward_iterator end, forward_iterator2 seq_start, forward_iterator2 seq_end, BinPred bp );

The find_end() function searches for the sequence of elements denoted by seq_start and seq_end. If such a sequence is found between start and end, an @@ -118,7 +118,7 @@

find_end

-
+
@@ -132,7 +132,7 @@

find_end

@@ -159,6 +159,6 @@

find_end

-
+
diff --git a/orig/stl/algorithm/find_first_of.html b/orig/stl/algorithm/find_first_of.html index f770f89..c6f3a4e 100644 --- a/orig/stl/algorithm/find_first_of.html +++ b/orig/stl/algorithm/find_first_of.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

find_first_of

Syntax: 

    #include <algorithm>
-    iterator find_first_of( iterator start, iterator end, iterator find_start, iterator find_end );
-    iterator find_first_of( iterator start, iterator end, iterator find_start, iterator find_end, BinPred bp );
+ forward_iterator find_first_of( forward_iterator start, forward_iterator end, forward_iterator2 find_start, forward_iterator2 find_end ); + forward_iterator find_first_of( forward_iterator start, forward_iterator end, forward_iterator2 find_start, forward_iterator2 find_end, BinPred bp );

The find_first_of() function searches for the first occurence of any element between find_start and find_end. The data that are searched are those between @@ -122,7 +122,7 @@

find_first_of

@@ -149,6 +149,6 @@

find_first_of

-
+
diff --git a/orig/stl/algorithm/find_if.html b/orig/stl/algorithm/find_if.html index 2d14387..82cd158 100644 --- a/orig/stl/algorithm/find_if.html +++ b/orig/stl/algorithm/find_if.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

find_if

Syntax: 

    #include <algorithm>
-    iterator find_if( iterator start, iterator end, UnPred up );
+ input_iterator find_if( input_iterator start, input_iterator end, UnPred up );

The find_if() function searches for the first element between start and end for which the unary predicate up returns true. @@ -104,7 +104,7 @@

find_if

-
+
@@ -118,7 +118,7 @@

find_if

@@ -145,6 +145,6 @@

find_if

-
+
diff --git a/orig/stl/algorithm/for_each.html b/orig/stl/algorithm/for_each.html index 3abe15f..b199939 100644 --- a/orig/stl/algorithm/for_each.html +++ b/orig/stl/algorithm/for_each.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

for_each

Syntax: 

    #include <algorithm>
-    UnaryFunction for_each( iterator start, iterator end, UnaryFunction f );
+ UnaryFunction for_each( input_iterator start, input_iterator end, UnaryFunction f );

The for_each() algorithm applies the function f to each of the elements between start and end. The return value of for_each() is f. @@ -114,7 +114,7 @@

for_each

Before, nums[] is: 3 4 2 9 15 267 After, nums[] is: 4 5 3 10 16 268
-
+
@@ -128,7 +128,7 @@

for_each

@@ -155,6 +155,6 @@

for_each

-
+
diff --git a/orig/stl/algorithm/generate.html b/orig/stl/algorithm/generate.html index c2e98e8..2957019 100644 --- a/orig/stl/algorithm/generate.html +++ b/orig/stl/algorithm/generate.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

generate

Syntax: 

    #include <algorithm>
-    void generate( iterator start, iterator end, Generator g );
+ void generate( forward_iterator start, forward_iterator end, Generator g );

The generate() function runs the Generator function object g a number of times, saving the result of each execution in the range [start,end). @@ -87,7 +87,7 @@

generate

// Depending on the compiler you may need to put &rand instead   cout << "v: "; - for (size_t i = 0; i < v.size(); ++i) + for (vector<int>::size_type i = 0; i < v.size(); ++i) cout << v[i] << ' '; cout << endl;

@@ -109,7 +109,7 @@

generate

@@ -136,6 +136,6 @@

generate

-
+
diff --git a/orig/stl/algorithm/generate_n.html b/orig/stl/algorithm/generate_n.html index 5570a95..ef43790 100644 --- a/orig/stl/algorithm/generate_n.html +++ b/orig/stl/algorithm/generate_n.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

generate_n

Syntax: 

    #include <algorithm>
-    iterator generate_n( iterator result, size_t num, Generator g );
+ void generate_n( output_iterator result, SIZE num, Generator g );

The generate_n() function runs the Generator function object g num times, saving the result of each execution in result, (result+1), etc. @@ -84,7 +84,7 @@

generate_n

-
+
@@ -98,7 +98,7 @@

generate_n

@@ -125,6 +125,6 @@

generate_n

-
+
diff --git a/orig/stl/algorithm/includes.html b/orig/stl/algorithm/includes.html index e542e6f..9f73f2d 100644 --- a/orig/stl/algorithm/includes.html +++ b/orig/stl/algorithm/includes.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

includes

-
+
diff --git a/orig/stl/algorithm/inner_product.html b/orig/stl/algorithm/inner_product.html index c8b7e10..40f17c3 100644 --- a/orig/stl/algorithm/inner_product.html +++ b/orig/stl/algorithm/inner_product.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

inner_product

Syntax: 

    #include <numeric>
-    TYPE inner_product( iterator start1, iterator end1, iterator start2, TYPE val );
-    TYPE inner_product( iterator start1, iterator end1, iterator start2, TYPE val, BinaryFunction f1, BinaryFunction f2 );
+ TYPE inner_product( input_iterator start1, input_iterator end1, input_iterator2 start2, TYPE val ); + TYPE inner_product( input_iterator start1, input_iterator end1, input_iterator2 start2, TYPE val, BinaryFunction f1, BinaryFunction2 f2 );

The inner_product function computes the inner product of [start1,end1) and a range of the same size starting at start2. @@ -171,7 +171,7 @@

inner_product

-
+
@@ -185,7 +185,7 @@

inner_product

@@ -212,6 +212,6 @@

inner_product

-
+
diff --git a/orig/stl/algorithm/inplace_merge.html b/orig/stl/algorithm/inplace_merge.html index dd97d3f..c7a0e1d 100644 --- a/orig/stl/algorithm/inplace_merge.html +++ b/orig/stl/algorithm/inplace_merge.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

inplace_merge

Syntax: 

    #include <algorithm>
-    inline void inplace_merge( iterator start, iterator middle, iterator end );
-    inline void inplace_merge( iterator start, iterator middle, iterator end, StrictWeakOrdering cmp );
+ void inplace_merge( bidirectional_iterator start, bidirectional_iterator middle, bidirectional_iterator end ); + void inplace_merge( bidirectional_iterator start, bidirectional_iterator middle, bidirectional_iterator end, StrictWeakOrdering cmp );

The inplace_merge() function is similar to the merge() function, but instead of creating a new sorted range of elements, inplace_merge() alters the existing @@ -86,7 +86,7 @@

inplace_merge

-
+
@@ -100,7 +100,7 @@

inplace_merge

@@ -127,6 +127,6 @@

inplace_merge

-
+
diff --git a/orig/stl/algorithm/is_heap.html b/orig/stl/algorithm/is_heap.html index 1023e57..cdf6df2 100644 --- a/orig/stl/algorithm/is_heap.html +++ b/orig/stl/algorithm/is_heap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

is_heap

-
+
diff --git a/orig/stl/algorithm/is_sorted.html b/orig/stl/algorithm/is_sorted.html index 6309b3d..df9e4e6 100644 --- a/orig/stl/algorithm/is_sorted.html +++ b/orig/stl/algorithm/is_sorted.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/algorithm/iter_swap.html b/orig/stl/algorithm/iter_swap.html index ab7baee..0c202db 100644 --- a/orig/stl/algorithm/iter_swap.html +++ b/orig/stl/algorithm/iter_swap.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

iter_swap

Syntax: 

    #include <algorithm>
-    inline void iter_swap( iterator a, iterator b );
+ void iter_swap( forward_iterator a, forward_iterator b );

A call to iter_swap() exchanges the values of two elements exactly as a call to

@@ -87,7 +87,7 @@

iter_swap

-
+
@@ -101,7 +101,7 @@

iter_swap

@@ -128,6 +128,6 @@

iter_swap

-
+
diff --git a/orig/stl/algorithm/lexicographical_compare.html b/orig/stl/algorithm/lexicographical_compare.html index fbe5102..5dbcc07 100644 --- a/orig/stl/algorithm/lexicographical_compare.html +++ b/orig/stl/algorithm/lexicographical_compare.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

lexicographic Syntax: 

    #include <algorithm>
-    bool lexicographical_compare( iterator start1, iterator end1, iterator start2, iterator end2 );
-    bool lexicographical_compare( iterator start1, iterator end1, iterator start2, iterator end2, BinPred p );
+ bool lexicographical_compare( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2 ); + bool lexicographical_compare( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, BinPred p );

The lexicographical_compare() function returns true if the range of elements [start1,end1) is lexicographically less than the range of elements @@ -95,7 +95,7 @@

lexicographic

-
+
@@ -109,7 +109,7 @@

lexicographic @@ -136,6 +136,6 @@

lexicographic -
+
diff --git a/orig/stl/algorithm/lexicographical_compare_3way.html b/orig/stl/algorithm/lexicographical_compare_3way.html index 98be21e..ef5e68b 100644 --- a/orig/stl/algorithm/lexicographical_compare_3way.html +++ b/orig/stl/algorithm/lexicographical_compare_3way.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,6 +116,6 @@

lex

-
+
diff --git a/orig/stl/algorithm/lower_bound.html b/orig/stl/algorithm/lower_bound.html index 64110f3..9e243d8 100644 --- a/orig/stl/algorithm/lower_bound.html +++ b/orig/stl/algorithm/lower_bound.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

lower_bound

Syntax: 

    #include <algorithm>
-    iterator lower_bound( iterator first, iterator last,  const TYPE& val );
-    iterator lower_bound( iterator first, iterator last, const TYPE& val, CompFn f );
+ forward_iterator lower_bound( forward_iterator first, forward_iterator last, const TYPE& val ); + forward_iterator lower_bound( forward_iterator first, forward_iterator last, const TYPE& val, CompFn f );

The lower_bound() function is a type of binary_search(). This function searches for the first place that val can be inserted into the ordered range defined by @@ -136,7 +136,7 @@

lower_bound

-
+
@@ -150,7 +150,7 @@

lower_bound

@@ -177,6 +177,6 @@

lower_bound

-
+
diff --git a/orig/stl/algorithm/make_heap.html b/orig/stl/algorithm/make_heap.html index 6324da5..7e1eb5c 100644 --- a/orig/stl/algorithm/make_heap.html +++ b/orig/stl/algorithm/make_heap.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

make_heap

Syntax: 

    #include <algorithm>
-    void make_heap( iterator start, iterator end );
-    void make_heap( iterator start, iterator end, StrictWeakOrdering cmp );
+ void make_heap( random_iterator start, random_iterator end ); + void make_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp );

The make_heap() function turns the given range of elements [start,end) into a heap. @@ -94,7 +94,7 @@

make_heap

-
+
@@ -108,7 +108,7 @@

make_heap

@@ -135,6 +135,6 @@

make_heap

-
+
diff --git a/orig/stl/algorithm/max.html b/orig/stl/algorithm/max.html index 5d7a73b..bc1116c 100644 --- a/orig/stl/algorithm/max.html +++ b/orig/stl/algorithm/max.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -144,6 +144,6 @@

max

-
+
diff --git a/orig/stl/algorithm/max_element.html b/orig/stl/algorithm/max_element.html index 86f11b9..274e342 100644 --- a/orig/stl/algorithm/max_element.html +++ b/orig/stl/algorithm/max_element.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

max_element

Syntax: 

  #include <algorithm>
-  iterator max_element( iterator start, iterator end );
-  iterator max_element( iterator start, iterator end, BinPred p );
+ forward_iterator max_element( forward_iterator start, forward_iterator end ); + forward_iterator max_element( forward_iterator start, forward_iterator end, BinPred p );

The max_element() function returns an iterator to the largest element in the range [start,end). @@ -108,7 +108,7 @@

max_element

-
+
@@ -122,7 +122,7 @@

max_element

@@ -149,6 +149,6 @@

max_element

-
+
diff --git a/orig/stl/algorithm/merge.html b/orig/stl/algorithm/merge.html index 1063ef1..a449b4a 100644 --- a/orig/stl/algorithm/merge.html +++ b/orig/stl/algorithm/merge.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

merge

Syntax: 

    #include <algorithm>
-    iterator merge( iterator start1, iterator end1, iterator start2, iterator end2, iterator result );
-    iterator merge( iterator start1, iterator end1, iterator start2, iterator end2, iterator result, StrictWeakOrdering cmp );
+ output_iterator merge( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); + output_iterator merge( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp );

The merge() function combines two sorted ranges [start1,end1) and [start2,end2) into a single sorted range, stored starting at result. The return value of this @@ -95,7 +95,7 @@

merge

-
+
@@ -109,7 +109,7 @@

merge

@@ -136,6 +136,6 @@

merge

-
+
diff --git a/orig/stl/algorithm/min.html b/orig/stl/algorithm/min.html index a59de02..30c0ace 100644 --- a/orig/stl/algorithm/min.html +++ b/orig/stl/algorithm/min.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

min

-
+
diff --git a/orig/stl/algorithm/min_element.html b/orig/stl/algorithm/min_element.html index 3194aab..dad0eaf 100644 --- a/orig/stl/algorithm/min_element.html +++ b/orig/stl/algorithm/min_element.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

min_element

Syntax: 

    #include <algorithm>
-    iterator min_element( iterator start, iterator end );
-    iterator min_element( iterator start, iterator end, BinPred p );
+ forward_iterator min_element( forward_iterator start, forward_iterator end ); + forward_iterator min_element( forward_iterator start, forward_iterator end, BinPred p );

The min_element() function returns an iterator to the smallest element in the range [start,end). @@ -90,7 +90,7 @@

min_element

-
+
@@ -104,7 +104,7 @@

min_element

@@ -131,6 +131,6 @@

min_element

-
+
diff --git a/orig/stl/algorithm/mismatch.html b/orig/stl/algorithm/mismatch.html index fe52197..d9d64ad 100644 --- a/orig/stl/algorithm/mismatch.html +++ b/orig/stl/algorithm/mismatch.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

mismatch

Syntax: 

    #include <algorithm>
-    pair <iterator1,iterator2> mismatch( iterator start1, iterator end1, iterator start2 );
-    pair <iterator1,iterator2> mismatch( iterator start1, iterator end1, iterator start2, BinPred p );
+ pair <input_iterator1,input_iterator2> mismatch( input_iterator1 start1, input_iterator1 end1, input_iterator2 start2 ); + pair <input_iterator1,input_iterator2> mismatch( input_iterator1 start1, input_iterator1 end1, input_iterator2 start2, BinPred p );

The mismatch() function compares the elements in the range defined by [start1,end1) to the elements in a range of the same size starting at start2. @@ -105,7 +105,7 @@

mismatch

-
+
@@ -119,7 +119,7 @@

mismatch

@@ -146,6 +146,6 @@

mismatch

-
+
diff --git a/orig/stl/algorithm/next_permutation.html b/orig/stl/algorithm/next_permutation.html index 8711bbd..eaf5226 100644 --- a/orig/stl/algorithm/next_permutation.html +++ b/orig/stl/algorithm/next_permutation.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

next_permutation

Syntax: 

    #include <algorithm>
-    bool next_permutation( iterator start, iterator end );
-    bool next_permutation( iterator start, iterator end, StrictWeakOrdering cmp );
+ bool next_permutation( bidirectional_iterator start, bidirectional_iterator end ); + bool next_permutation( bidirectional_iterator start, bidirectional_iterator end, StrictWeakOrdering cmp );

The next_permutation() function attempts to transform the given range of elements [start,end) into the next lexicographically greater permutation of @@ -91,7 +91,7 @@

next_permutation

-
+
@@ -105,7 +105,7 @@

next_permutation

@@ -132,6 +132,6 @@

next_permutation

-
+
diff --git a/orig/stl/algorithm/nth_element.html b/orig/stl/algorithm/nth_element.html index 92ce486..f67dfb6 100644 --- a/orig/stl/algorithm/nth_element.html +++ b/orig/stl/algorithm/nth_element.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

nth_element

Syntax: 

    #include <algorithm>
-    void nth_element( iterator start, iterator nth, iterator end );
-    void nth_element( iterator start, iterator nth, iterator end, StrictWeakOrdering cmp );
+ void nth_element( random_iterator start, random_iterator nth, random_iterator end ); + void nth_element( random_iterator start, random_iterator nth, random_iterator end, StrictWeakOrdering cmp );

The nth_element() function semi-sorts the range of elements defined by [start,end). It puts the element of the range to the nth position, that would be there, if the entire range @@ -92,7 +92,7 @@

nth_element

-
+
@@ -106,7 +106,7 @@

nth_element

@@ -133,6 +133,6 @@

nth_element

-
+
diff --git a/orig/stl/algorithm/partial_sort.html b/orig/stl/algorithm/partial_sort.html index 11d08b9..b575de3 100644 --- a/orig/stl/algorithm/partial_sort.html +++ b/orig/stl/algorithm/partial_sort.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

partial_sort

Syntax: 

    #include <algorithm>
-    void partial_sort( iterator start, iterator middle, iterator end );
-    void partial_sort( iterator start, iterator middle, iterator end, StrictWeakOrdering cmp );
+ void partial_sort( random_iterator start, random_iterator middle, random_iterator end ); + void partial_sort( random_iterator start, random_iterator middle, random_iterator end, StrictWeakOrdering cmp );

The partial_sort() function arranges the first N elements of the range [start,end) in ascending order. N is defined as the number of elements between @@ -91,7 +91,7 @@

partial_sort

-
+
@@ -105,7 +105,7 @@

partial_sort

@@ -132,6 +132,6 @@

partial_sort

-
+
diff --git a/orig/stl/algorithm/partial_sort_copy.html b/orig/stl/algorithm/partial_sort_copy.html index 3ef7f2a..c1fefd2 100644 --- a/orig/stl/algorithm/partial_sort_copy.html +++ b/orig/stl/algorithm/partial_sort_copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

partial_sort_copy

    #include <algorithm>
-    iterator partial_sort_copy( iterator start, iterator end, iterator result_start, iterator result_end );
-    iterator partial_sort_copy( iterator start, iterator end, iterator result_start, iterator result_end, StrictWeakOrdering cmp );
+ random_iterator partial_sort_copy( input_iterator start, input_iterator end, random_iterator result_start, random_iterator result_end ); + random_iterator partial_sort_copy( input_iterator start, input_iterator end, random_iterator result_start, random_iterator result_end, StrictWeakOrdering cmp );

The partial_sort_copy() algorithm behaves like partial_sort(), except that instead of partially sorting the range in-place, a copy of the range is created @@ -93,7 +93,7 @@

partial_sort_copy

-
+
@@ -107,7 +107,7 @@

partial_sort_copy

@@ -134,6 +134,6 @@

partial_sort_copy

-
+
diff --git a/orig/stl/algorithm/partial_sum.html b/orig/stl/algorithm/partial_sum.html index a237cbd..4d2e979 100644 --- a/orig/stl/algorithm/partial_sum.html +++ b/orig/stl/algorithm/partial_sum.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

partial_sum

Syntax: 

    #include <numeric>
-    iterator partial_sum( iterator start, iterator end, iterator result );
-    iterator partial_sum( iterator start, iterator end, iterator result, BinOp p );
+ output_iterator partial_sum( input_iterator start, input_iterator end, output_iterator result ); + output_iterator partial_sum( input_iterator start, input_iterator end, output_iterator result, BinOp p );

The partial_sum() function calculates the partial sum of a range defined by [start,end), storing the output at result. @@ -94,7 +94,7 @@

partial_sum

-
+
@@ -108,7 +108,7 @@

partial_sum

@@ -135,6 +135,6 @@

partial_sum

-
+
diff --git a/orig/stl/algorithm/partition.html b/orig/stl/algorithm/partition.html index ee6a239..db89aab 100644 --- a/orig/stl/algorithm/partition.html +++ b/orig/stl/algorithm/partition.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

partition

Syntax: 

    #include <algorithm>
-    iterator partition( iterator start, iterator end, Predicate p );
+ bidirectional_iterator partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p );

The partition algorithm re-orders the elements in [start,end) such that the elements for which the predicate p returns true come before the elements for @@ -95,7 +95,7 @@

partition

-
+
@@ -109,7 +109,7 @@

partition

@@ -136,6 +136,6 @@

partition

-
+
diff --git a/orig/stl/algorithm/pop_heap.html b/orig/stl/algorithm/pop_heap.html index 3e0c5cc..439b281 100644 --- a/orig/stl/algorithm/pop_heap.html +++ b/orig/stl/algorithm/pop_heap.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

pop_heap

Syntax: 

    #include <algorithm>
-    void pop_heap( iterator start, iterator end );
-    void pop_heap( iterator start, iterator end, StrictWeakOrdering cmp );
+ void pop_heap( random_iterator start, random_iterator end ); + void pop_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp );

The pop_heap() function removes the largest element (defined as the element at the front of the heap) from the given heap. @@ -94,7 +94,7 @@

pop_heap

-
+
@@ -108,7 +108,7 @@

pop_heap

@@ -135,6 +135,6 @@

pop_heap

-
+
diff --git a/orig/stl/algorithm/prev_permutation.html b/orig/stl/algorithm/prev_permutation.html index f934b46..017cd50 100644 --- a/orig/stl/algorithm/prev_permutation.html +++ b/orig/stl/algorithm/prev_permutation.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

prev_permutation

Syntax: 

    #include <algorithm>
-    bool prev_permutation( iterator start, iterator end );
-    bool prev_permutation( iterator start, iterator end, StrictWeakOrdering cmp );
+ bool prev_permutation( bidirectional_iterator start, bidirectional_iterator end ); + bool prev_permutation( bidirectional_iterator start, bidirectional_iterator end, StrictWeakOrdering cmp );

The prev_permutation() function attempts to transform the given range of elements [start,end) into the next lexicographically smaller permutation of @@ -91,7 +91,7 @@

prev_permutation

-
+
@@ -105,7 +105,7 @@

prev_permutation

@@ -132,6 +132,6 @@

prev_permutation

-
+
diff --git a/orig/stl/algorithm/push_heap.html b/orig/stl/algorithm/push_heap.html index 6ebb633..c06010e 100644 --- a/orig/stl/algorithm/push_heap.html +++ b/orig/stl/algorithm/push_heap.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

push_heap

Syntax: 

    #include <algorithm>
-    void push_heap( iterator start, iterator end );
-    void push_heap( iterator start, iterator end, StrictWeakOrdering cmp );
+ void push_heap( random_iterator start, random_iterator end ); + void push_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp );

The push_heap() function adds an element (defined as the last element before end) to a heap (defined as the range of elements between [start,''end-1). @@ -94,7 +94,7 @@

push_heap

-
+
@@ -108,7 +108,7 @@

push_heap

@@ -135,6 +135,6 @@

push_heap

-
+
diff --git a/orig/stl/algorithm/random_sample.html b/orig/stl/algorithm/random_sample.html index 10a6ea5..95c6bf7 100644 --- a/orig/stl/algorithm/random_sample.html +++ b/orig/stl/algorithm/random_sample.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,6 +116,6 @@

random_sample

-
+
diff --git a/orig/stl/algorithm/random_sample_n.html b/orig/stl/algorithm/random_sample_n.html index 3fba3bf..1251b51 100644 --- a/orig/stl/algorithm/random_sample_n.html +++ b/orig/stl/algorithm/random_sample_n.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,6 +116,6 @@

random_sample_n

-
+
diff --git a/orig/stl/algorithm/random_shuffle.html b/orig/stl/algorithm/random_shuffle.html index 63aab85..2ff9fde 100644 --- a/orig/stl/algorithm/random_shuffle.html +++ b/orig/stl/algorithm/random_shuffle.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

random_shuffle

Syntax: 

    #include <algorithm>
-    void random_shuffle( iterator start, iterator end );
-    void random_shuffle( iterator start, iterator end, RandomNumberGenerator& rnd );
+ void random_shuffle( random_iterator start, random_iterator end ); + void random_shuffle( random_iterator start, random_iterator end, RandomNumberGenerator& rnd );

The random_shuffle() function randomly re-orders the elements in the range [start,end). If a random number generator function object rnd is supplied, it @@ -90,7 +90,7 @@

random_shuffle

-
+
@@ -104,7 +104,7 @@

random_shuffle

@@ -131,6 +131,6 @@

random_shuffle

-
+
diff --git a/orig/stl/algorithm/remove.html b/orig/stl/algorithm/remove.html index 16428b5..44f6753 100644 --- a/orig/stl/algorithm/remove.html +++ b/orig/stl/algorithm/remove.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

remove

Syntax: 

    #include <algorithm>
-    iterator remove( iterator start, iterator end, const TYPE& val );
+ forward_iterator remove( forward_iterator start, forward_iterator end, const TYPE& val );

The remove algorithm removes all of the elements in the range [start,end) that are equal to val.

@@ -103,7 +103,7 @@

remove

-
+
@@ -117,7 +117,7 @@

remove

@@ -144,6 +144,6 @@

remove

-
+
diff --git a/orig/stl/algorithm/remove_copy.html b/orig/stl/algorithm/remove_copy.html index 682a376..064dcc3 100644 --- a/orig/stl/algorithm/remove_copy.html +++ b/orig/stl/algorithm/remove_copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

remove_copy

Syntax: 

    #include <algorithm>
-    iterator remove_copy( iterator start, iterator end, iterator result, const TYPE& val );
+ output_iterator remove_copy( input_iterator start, input_iterator end, output_iterator result, const TYPE& val );

The remove_copy() algorithm copies the range [start,end) to result but omits any elements that are equal to val. @@ -89,7 +89,7 @@

remove_copy

-
+
@@ -103,7 +103,7 @@

remove_copy

@@ -130,6 +130,6 @@

remove_copy

-
+
diff --git a/orig/stl/algorithm/remove_copy_if.html b/orig/stl/algorithm/remove_copy_if.html index e86e704..8161d4a 100644 --- a/orig/stl/algorithm/remove_copy_if.html +++ b/orig/stl/algorithm/remove_copy_if.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

remove_copy_if

Syntax: 

    #include <algorithm>
-    iterator remove_copy_if( iterator start, iterator end, iterator result, Predicate p );
+ output_iterator remove_copy_if( input_iterator start, input_iterator end, output_iterator result, Predicate p );

The remove_copy_if() function copies the range of elements [start,end) to result, omitting any elements for which the predicate function p returns true. @@ -89,7 +89,7 @@

remove_copy_if

-
+
@@ -103,7 +103,7 @@

remove_copy_if

@@ -130,6 +130,6 @@

remove_copy_if

-
+
diff --git a/orig/stl/algorithm/remove_if.html b/orig/stl/algorithm/remove_if.html index b2c6245..0026ed3 100644 --- a/orig/stl/algorithm/remove_if.html +++ b/orig/stl/algorithm/remove_if.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

remove_if

Syntax: 

    #include <algorithm>
-    iterator remove_if( iterator start, iterator end, Predicate p );
+ forward_iterator remove_if( forward_iterator start, forward_iterator end, Predicate p );

The remove_if() function removes all elements in the range [start,end) for which the predicate p returns true. @@ -113,7 +113,7 @@

remove_if

-
+
@@ -127,7 +127,7 @@

remove_if

@@ -154,6 +154,6 @@

remove_if

-
+
diff --git a/orig/stl/algorithm/replace.html b/orig/stl/algorithm/replace.html index 6acc804..7de7ff2 100644 --- a/orig/stl/algorithm/replace.html +++ b/orig/stl/algorithm/replace.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

replace

Syntax: 

    #include <algorithm>
-    void replace( iterator start, iterator end, const TYPE& old_value, const TYPE& new_value );
+ void replace( forward_iterator start, forward_iterator end, const TYPE& old_value, const TYPE& new_value );

The replace() function sets every element in the range [start,end) that is equal to old_value to have new_value instead. @@ -88,7 +88,7 @@

replace

-
+
@@ -102,7 +102,7 @@

replace

@@ -129,6 +129,6 @@

replace

-
+
diff --git a/orig/stl/algorithm/replace_copy.html b/orig/stl/algorithm/replace_copy.html index 882a96e..11624ad 100644 --- a/orig/stl/algorithm/replace_copy.html +++ b/orig/stl/algorithm/replace_copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

replace_copy

Syntax: 

    #include <algorithm>
-    iterator replace_copy( iterator start, iterator end, iterator result, const TYPE& old_value, const TYPE& new_value );
+ output_iterator replace_copy( input_iterator start, input_iterator end, output_iterator result, const TYPE& old_value, const TYPE& new_value );

The replace_copy() function copies the elements in the range [start,end) to the destination result. Any elements in the range that are equal to old_value are @@ -85,7 +85,7 @@

replace_copy

-
+
@@ -99,7 +99,7 @@

replace_copy

@@ -126,6 +126,6 @@

replace_copy

-
+
diff --git a/orig/stl/algorithm/replace_copy_if.html b/orig/stl/algorithm/replace_copy_if.html index 0853be3..62b0d0a 100644 --- a/orig/stl/algorithm/replace_copy_if.html +++ b/orig/stl/algorithm/replace_copy_if.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

replace_copy_if

Syntax: 

    #include <algorithm>
-    iterator replace_copy_if( iterator start, iterator end, iterator result, Predicate p, const TYPE& new_value );
+ output_iterator replace_copy_if( input_iterator start, input_iterator end, output_iterator result, Predicate p, const TYPE& new_value );

The replace_copy_if() function copies the elements in the range [start,end) to the destination result. Any elements for which the predicate p is true are @@ -85,7 +85,7 @@

replace_copy_if

-
+
@@ -99,7 +99,7 @@

replace_copy_if

@@ -126,6 +126,6 @@

replace_copy_if

-
+
diff --git a/orig/stl/algorithm/replace_if.html b/orig/stl/algorithm/replace_if.html index 6f08fef..d84bfd6 100644 --- a/orig/stl/algorithm/replace_if.html +++ b/orig/stl/algorithm/replace_if.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

replace_if

Syntax: 

    #include <algorithm>
-    void replace_if( iterator start, iterator end, Predicate p, const TYPE& new_value );
+ void replace_if( forward_iterator start, forward_iterator end, Predicate p, const TYPE& new_value );

The replace_if() function assigns every element in the range [start,end) for which the predicate function p returns true the value of new_value. @@ -88,7 +88,7 @@

replace_if

-
+
@@ -102,7 +102,7 @@

replace_if

@@ -129,6 +129,6 @@

replace_if

-
+
diff --git a/orig/stl/algorithm/reverse.html b/orig/stl/algorithm/reverse.html index 2975119..72f86a2 100644 --- a/orig/stl/algorithm/reverse.html +++ b/orig/stl/algorithm/reverse.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

reverse

Syntax: 

    #include <algorithm>
-    void reverse( iterator start, iterator end );
+ void reverse( bidirectional_iterator start, bidirectional_iterator end );

The reverse() algorithm reverses the order of elements in the range [start,end). @@ -84,7 +84,7 @@

reverse

-
+
@@ -98,7 +98,7 @@

reverse

@@ -125,6 +125,6 @@

reverse

-
+
diff --git a/orig/stl/algorithm/reverse_copy.html b/orig/stl/algorithm/reverse_copy.html index 4439c16..2dd4030 100644 --- a/orig/stl/algorithm/reverse_copy.html +++ b/orig/stl/algorithm/reverse_copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

reverse_copy

Syntax: 

    #include <algorithm>
-    iterator reverse_copy( iterator start, iterator end, iterator result );
+ output_iterator reverse_copy( bidirectional_iterator start, bidirectional_iterator end, output_iterator result );

The reverse_copy() algorithm copies the elements in the range [start,end) to result such that the elements in the new range are in reverse order. @@ -89,7 +89,7 @@

reverse_copy

-
+
@@ -103,7 +103,7 @@

reverse_copy

@@ -130,6 +130,6 @@

reverse_copy

-
+
diff --git a/orig/stl/algorithm/rotate.html b/orig/stl/algorithm/rotate.html index c1c89cc..7418f6f 100644 --- a/orig/stl/algorithm/rotate.html +++ b/orig/stl/algorithm/rotate.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,17 +73,13 @@

rotate

Syntax: 

    #include <algorithm>
-    inline iterator rotate( iterator start, iterator middle, iterator end );
+ void rotate( forward_iterator start, forward_iterator middle, forward_iterator end );

The rotate() algorithm moves the elements in the range [start,end) such that the middle element is now where start used to be, (middle+1) is now at (start+1), etc.

-

-The return value of rotate() is an iterator to start + (end-middle). -

-

rotate() runs in linear time.

@@ -93,7 +89,7 @@

rotate

-
+
@@ -107,7 +103,7 @@

rotate

@@ -134,6 +130,6 @@

rotate

-
+
diff --git a/orig/stl/algorithm/rotate_copy.html b/orig/stl/algorithm/rotate_copy.html index 5815a7d..77c103d 100644 --- a/orig/stl/algorithm/rotate_copy.html +++ b/orig/stl/algorithm/rotate_copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

rotate_copy

Syntax: 

    #include <algorithm>
-    iterator rotate_copy( iterator start, iterator middle, iterator end, iterator result );
+ output_iterator rotate_copy( forward_iterator start, forward_iterator middle, forward_iterator end, output_iterator result );

The rotate_copy() algorithm is similar to the rotate() algorithm, except that the range of elements is copied to result before being rotated. @@ -84,7 +84,7 @@

rotate_copy

-
+
@@ -98,7 +98,7 @@

rotate_copy

@@ -125,6 +125,6 @@

rotate_copy

-
+
diff --git a/orig/stl/algorithm/search.html b/orig/stl/algorithm/search.html index ff74a32..f25440e 100644 --- a/orig/stl/algorithm/search.html +++ b/orig/stl/algorithm/search.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

search

Syntax: 

    #include <algorithm>
-    iterator search( iterator start1, iterator end1, iterator start2, iterator end2 );
-    iterator search( iterator start1, iterator end1, iterator start2, iterator end2, BinPred p );
+ forward_iterator search( forward_iterator start1, forward_iterator end1, forward_iterator2 start2, forward_iterator2 end2 ); + forward_iterator search( forward_iterator start1, forward_iterator end1, forward_iterator2 start2, forward_iterator2 end2, BinPred p );

The search() algorithm looks for the elements [start2,end2) in the range [start1,end1). If the optional binary predicate p is provided, then it is used @@ -97,7 +97,7 @@

search

-
+
@@ -111,7 +111,7 @@

search

@@ -138,6 +138,6 @@

search

-
+
diff --git a/orig/stl/algorithm/search_n.html b/orig/stl/algorithm/search_n.html index 1134177..445cf86 100644 --- a/orig/stl/algorithm/search_n.html +++ b/orig/stl/algorithm/search_n.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

search_n

Syntax: 

    #include <algorithm>
-    iterator search_n( iterator start, iterator end, size_t num, const TYPE& val );
-    iterator search_n( iterator start, iterator end, size_t num, const TYPE& val, BinPred p );
+ forward_iterator search_n( forward_iterator start, forward_iterator end, SIZE num, const TYPE& val ); + forward_iterator search_n( forward_iterator start, forward_iterator end, SIZE num, const TYPE& val, BinPred p );

The search_n() function looks for num occurances of val in the range [start,end). @@ -99,7 +99,7 @@

search_n

-
+
@@ -113,7 +113,7 @@

search_n

@@ -140,6 +140,6 @@

search_n

-
+
diff --git a/orig/stl/algorithm/set_difference.html b/orig/stl/algorithm/set_difference.html index 4f86b81..aad1893 100644 --- a/orig/stl/algorithm/set_difference.html +++ b/orig/stl/algorithm/set_difference.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -74,9 +74,9 @@

set_difference

    #include <algorithm>
     template< typename InIterA, typename InIterB, typename OutIter >
-    iterator set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result );
+    OutIter set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result );
     template< typename InIterA, typename InIterB, typename OutIter, typename StrictWeakOrdering >
-    iterator set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp );
+ OutIter set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp );

The set_difference() algorithm computes the difference between two sets defined by [start1,end1) and [start2,end2) and stores the difference starting at @@ -102,7 +102,7 @@

set_difference

-
+
@@ -116,7 +116,7 @@

set_difference

@@ -143,6 +143,6 @@

set_difference

-
+
diff --git a/orig/stl/algorithm/set_intersection.html b/orig/stl/algorithm/set_intersection.html index 65dac0d..e6da976 100644 --- a/orig/stl/algorithm/set_intersection.html +++ b/orig/stl/algorithm/set_intersection.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -74,9 +74,9 @@

set_intersection

    #include <algorithm>
     template< typename InIterA, typename InIterB, typename OutIter >
-    iterator set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result );
+    OutIter set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result );
     template< typename InIterA, typename InIterB, typename OutIter, typename StrictWeakOrdering >
-    iterator set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp );
+ OutIter set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp );

The set_intersection() algorithm computes the intersection of the two sets defined by [start1,end1) and [start2,end2) and stores the intersection starting @@ -106,7 +106,7 @@

set_intersection

-
+
@@ -120,7 +120,7 @@

set_intersection

@@ -147,6 +147,6 @@

set_intersection

-
+
diff --git a/orig/stl/algorithm/set_symmetric_difference.html b/orig/stl/algorithm/set_symmetric_difference.html index 2d50dbf..9d93f8e 100644 --- a/orig/stl/algorithm/set_symmetric_difference.html +++ b/orig/stl/algorithm/set_symmetric_difference.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

set_symmetr Syntax: 

    #include <algorithm>
-    iterator set_symmetric_difference( iterator start1, iterator end1, iterator start2, iterator end2, iterator result );
-    iterator set_symmetric_difference( iterator start1, iterator end1, iterator start2, iterator end2, iterator result, StrictWeakOrdering cmp );
+ output_iterator set_symmetric_difference( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); + output_iterator set_symmetric_difference( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp );

The set_symmetric_difference() algorithm computes the symmetric difference of the two sets defined by [start1,end1) and [start2,end2) and stores the @@ -100,7 +100,7 @@

set_symmetr

-
+
@@ -114,7 +114,7 @@

set_symmetr @@ -141,6 +141,6 @@

set_symmetr -
+
diff --git a/orig/stl/algorithm/set_union.html b/orig/stl/algorithm/set_union.html index da03388..716b209 100644 --- a/orig/stl/algorithm/set_union.html +++ b/orig/stl/algorithm/set_union.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

set_union

Syntax: 

    #include <algorithm>
-    iterator set_union( iterator start1, iterator end1, iterator start2, iterator end2, iterator result );
-    iterator set_union( iterator start1, iterator end1, iterator start2, iterator end2, iterator result, StrictWeakOrdering cmp );
+ output_iterator set_union( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); + output_iterator set_union( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp );

The set_union() algorithm computes the sorted union of the two sorted ranges [start1,end1) and [start2,end2) and stores it starting at result. @@ -93,7 +93,7 @@

set_union

-
+
@@ -107,7 +107,7 @@

set_union

@@ -134,6 +134,6 @@

set_union

-
+
diff --git a/orig/stl/algorithm/sort.html b/orig/stl/algorithm/sort.html index a8764b4..82a9dee 100644 --- a/orig/stl/algorithm/sort.html +++ b/orig/stl/algorithm/sort.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -74,8 +74,8 @@

sort

Syntax: 

    #include <algorithm>
-    void sort( iterator start, iterator end );
-    void sort( iterator start, iterator end, StrictWeakOrdering cmp );
+ void sort( random_iterator start, random_iterator end ); + void sort( random_iterator start, random_iterator end, StrictWeakOrdering cmp );

The sort() algorithm sorts the elements in the range [start,end) into ascending order. If two elements are equal, there is no guarantee what order they will be @@ -198,7 +198,7 @@

sort

@@ -225,6 +225,6 @@

sort

-
+
diff --git a/orig/stl/algorithm/sort_heap.html b/orig/stl/algorithm/sort_heap.html index 6f2aba1..6ce7260 100644 --- a/orig/stl/algorithm/sort_heap.html +++ b/orig/stl/algorithm/sort_heap.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

sort_heap

Syntax: 

    #include <algorithm>
-    void sort_heap( iterator start, iterator end );
-    void sort_heap( iterator start, iterator end, StrictWeakOrdering cmp );
+ void sort_heap( random_iterator start, random_iterator end ); + void sort_heap( random_iterator start, random_iterator end, StrictWeakOrdering cmp );

The sort_heap() function turns the heap defined by [start,end) into a sorted range. @@ -90,7 +90,7 @@

sort_heap

-
+
@@ -104,7 +104,7 @@

sort_heap

@@ -131,6 +131,6 @@

sort_heap

-
+
diff --git a/orig/stl/algorithm/stable_partition.html b/orig/stl/algorithm/stable_partition.html index 54ef002..60a86f7 100644 --- a/orig/stl/algorithm/stable_partition.html +++ b/orig/stl/algorithm/stable_partition.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

stable_partition

Syntax: 

    #include <algorithm>
-    iterator stable_partition( iterator start, iterator end, Predicate p );
+ bidirectional_iterator stable_partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p );

The stable_partition() function behaves similarily to partition(). The difference between the two algorithms is that stable_partition() will preserve @@ -85,7 +85,7 @@

stable_partition

-
+
@@ -99,7 +99,7 @@

stable_partition

@@ -126,6 +126,6 @@

stable_partition

-
+
diff --git a/orig/stl/algorithm/stable_sort.html b/orig/stl/algorithm/stable_sort.html index 2d03e8f..aa6ea04 100644 --- a/orig/stl/algorithm/stable_sort.html +++ b/orig/stl/algorithm/stable_sort.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

stable_sort

Syntax: 

    #include <algorithm>
-    void stable_sort( iterator start, iterator end );
-    void stable_sort( iterator start, iterator end, StrictWeakOrdering cmp );
+ void stable_sort( random_iterator start, random_iterator end ); + void stable_sort( random_iterator start, random_iterator end, StrictWeakOrdering cmp );

The stable_sort() algorithm is like the sort() algorithm, in that it sorts a range of elements into ascending order. Unlike sort(), however, stable_sort() @@ -91,7 +91,7 @@

stable_sort

-
+
@@ -105,7 +105,7 @@

stable_sort

@@ -132,6 +132,6 @@

stable_sort

-
+
diff --git a/orig/stl/algorithm/start.html b/orig/stl/algorithm/start.html index 86dd34e..b179962 100644 --- a/orig/stl/algorithm/start.html +++ b/orig/stl/algorithm/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -331,6 +331,6 @@

C++ Algorithms

-
+
diff --git a/orig/stl/algorithm/swap.html b/orig/stl/algorithm/swap.html index 94cffd0..46f1bc3 100644 --- a/orig/stl/algorithm/swap.html +++ b/orig/stl/algorithm/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

swap

-
+
diff --git a/orig/stl/algorithm/swap_ranges.html b/orig/stl/algorithm/swap_ranges.html index bf59d34..1eb81cd 100644 --- a/orig/stl/algorithm/swap_ranges.html +++ b/orig/stl/algorithm/swap_ranges.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

swap_ranges

Syntax: 

    #include <algorithm>
-    iterator swap_ranges( iterator start1, iterator end1, iterator start2 );
+ forward_iterator2 swap_ranges( forward_iterator start1, forward_iterator end1, forward_iterator2 start2 );

The swap_ranges() function exchanges the elements in the range [start1,end1) with the range of the same size starting at start2. @@ -88,7 +88,7 @@

swap_ranges

-
+
@@ -102,7 +102,7 @@

swap_ranges

@@ -129,6 +129,6 @@

swap_ranges

-
+
diff --git a/orig/stl/algorithm/transform.html b/orig/stl/algorithm/transform.html index bd07b9c..a88d6b6 100644 --- a/orig/stl/algorithm/transform.html +++ b/orig/stl/algorithm/transform.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

transform

Syntax: 

    #include <algorithm>
-    iterator transform( iterator start, iterator end, iterator result, UnaryFunction f );
-    iterator transform( iterator start1, iterator end1, iterator start2, iterator result, BinaryFunction f );
+ output_iterator transform( input_iterator start, input_iterator end, output_iterator result, UnaryFunction f ); + output_iterator transform( input_iterator start1, input_iterator end1, input_iterator2 start2, output_iterator result, BinaryFunction f );

The transform() algorithm applies the function f to some range of elements, storing the result of each application of the function in result. @@ -122,7 +122,7 @@

transform

@@ -149,6 +149,6 @@

transform

-
+
diff --git a/orig/stl/algorithm/unique.html b/orig/stl/algorithm/unique.html index a8e8e92..a023f7a 100644 --- a/orig/stl/algorithm/unique.html +++ b/orig/stl/algorithm/unique.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

unique

Syntax: 

    #include <algorithm>
-    iterator unique( iterator start, iterator end );
-    iterator unique( iterator start, iterator end, BinPred p );
+ forward_iterator unique( forward_iterator start, forward_iterator end ); + forward_iterator unique( forward_iterator start, forward_iterator end, BinPred p );

The unique() algorithm removes all consecutive duplicate elements from the range [start,end). If the binary predicate p is given, then it is used to test @@ -94,7 +94,7 @@

unique

-
+
@@ -108,7 +108,7 @@

unique

@@ -135,6 +135,6 @@

unique

-
+
diff --git a/orig/stl/algorithm/unique_copy.html b/orig/stl/algorithm/unique_copy.html index cf7dd97..e2055fc 100644 --- a/orig/stl/algorithm/unique_copy.html +++ b/orig/stl/algorithm/unique_copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

unique_copy

Syntax: 

    #include <algorithm>
-    iterator unique_copy( iterator start, iterator end, iterator result );
-    iterator unique_copy( iterator start, iterator end, iterator result, BinPred p );
+ output_iterator unique_copy( input_iterator start, input_iterator end, output_iterator result ); + output_iterator unique_copy( input_iterator start, input_iterator end, output_iterator result, BinPred p );

The unique_copy() function copies the range [start,end) to result, removing all consecutive duplicate elements. If the binary predicate p is provided, then it @@ -94,7 +94,7 @@

unique_copy

-
+
@@ -108,7 +108,7 @@

unique_copy

@@ -135,6 +135,6 @@

unique_copy

-
+
diff --git a/orig/stl/algorithm/upper_bound.html b/orig/stl/algorithm/upper_bound.html index 2bba3d1..e64d248 100644 --- a/orig/stl/algorithm/upper_bound.html +++ b/orig/stl/algorithm/upper_bound.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,8 +73,8 @@

upper_bound

Syntax: 

    #include <algorithm>
-    iterator upper_bound( iterator start, iterator end, const TYPE& val );
-    iterator upper_bound( iterator start, iterator end, const TYPE& val, StrictWeakOrdering cmp );
+ forward_iterator upper_bound( forward_iterator start, forward_iterator end, const TYPE& val ); + forward_iterator upper_bound( forward_iterator start, forward_iterator end, const TYPE& val, StrictWeakOrdering cmp );

The upper_bound() algorithm searches the ordered range [start,end] for the last location that val could be inserted without disrupting the order of the range; or, @@ -111,7 +111,7 @@

upper_bound

@@ -138,6 +138,6 @@

upper_bound

-
+
diff --git a/orig/stl/bitset/any.html b/orig/stl/bitset/any.html index 8f70458..a6d300f 100644 --- a/orig/stl/bitset/any.html +++ b/orig/stl/bitset/any.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

any

-
+
diff --git a/orig/stl/bitset/bitset.html b/orig/stl/bitset/bitset.html new file mode 100644 index 0000000..3edfaf0 --- /dev/null +++ b/orig/stl/bitset/bitset.html @@ -0,0 +1,149 @@ + + + + + + Bitset Constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Bitset Constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Bitsets » Bitset Constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Bitset Constructors

+
+ +

+Syntax: +

+
    #include <bitset>
+    bitset();
+    bitset( unsigned long val );
+

+Bitsets can either be constructed with no arguments or with an unsigned long +number val that will be converted into binary and inserted into the bitset. +

+ +

+When creating bitsets, the number given in the place of the template determines +how long the bitset is. +

+ +

+For example, the following code creates two bitsets and displays them: +

+
 // create a bitset that is 8 bits long
+ bitset<8> bs;
+ // display that bitset
+ for( int i = (int) bs.size()-1; i >= 0; i-- ) {
+   cout << bs[i] << " ";
+ }
+ cout << endl;
+ // create a bitset out of a number
+ bitset<8> bs2( (long) 131 );
+ // display that bitset, too
+ for( int i = (int) bs2.size()-1; i >= 0; i-- ) {
+   cout << bs2[i] << " ";
+ }
+ cout << endl;
+
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/bitset/count.html b/orig/stl/bitset/count.html index 19cf968..a639444 100644 --- a/orig/stl/bitset/count.html +++ b/orig/stl/bitset/count.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

count

-
+
diff --git a/orig/stl/bitset/flip.html b/orig/stl/bitset/flip.html index ec81b37..a9dd961 100644 --- a/orig/stl/bitset/flip.html +++ b/orig/stl/bitset/flip.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

flip

-
+
diff --git a/orig/stl/bitset/none.html b/orig/stl/bitset/none.html index da72c45..0f99f5b 100644 --- a/orig/stl/bitset/none.html +++ b/orig/stl/bitset/none.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

none

-
+
diff --git a/orig/stl/bitset/operator.html b/orig/stl/bitset/operator.html new file mode 100644 index 0000000..e533c0d --- /dev/null +++ b/orig/stl/bitset/operator.html @@ -0,0 +1,180 @@ + + + + + + Bitset Operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Bitset Operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Bitsets » Bitset Operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Bitset Operators

+
+ +

+Syntax: +

+
    #include <bitset>
+    !=, ==, &=, ^=, |=, ~, <<=, >>=, [], =
+

+These operators all work with bitsets. They can be described as follows: + +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Operator Description
!= returns true if the two bitsets are not equal
== returns true if the two bitsets are equal
&= performs the AND operation on the two bitsets
^= performs the XOR operation on the two bitsets
|= performs the OR operation on the two bitsets
~ reverses the bitset (same as calling flip())
<<= shifts the bitset to the left
>>= shifts the bitset to the right
b[x] returns a reference to the xth bit in the bitset
= take an unsigned long and put the corresponding bits in the bitset
+ +

+ +For example, the following code creates a bitset and shifts it to the left 4 +places: +

+
   // create a bitset out of a number
+   bitset<8> bs2( (long) 131 );
+   // you can do bitset<8> bs2; bs2 = (long) 131;
+ 
+   cout << "bs2 is " << bs2 << endl;
+   // shift the bitset to the left by 4 digits
+   bs2 <<= 4;
+   cout << "now bs2 is " << bs2 << endl;
+

+When the above code is run, it displays: +

+
+ bs2 is 10000011
+ now bs2 is 00110000
+
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/bitset/reset.html b/orig/stl/bitset/reset.html index c2a13cf..8bd9549 100644 --- a/orig/stl/bitset/reset.html +++ b/orig/stl/bitset/reset.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

reset

-
+
diff --git a/orig/stl/bitset/set.html b/orig/stl/bitset/set.html index 5c468c3..db99b7c 100644 --- a/orig/stl/bitset/set.html +++ b/orig/stl/bitset/set.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -123,6 +123,6 @@

set

-
+
diff --git a/orig/stl/bitset/size.html b/orig/stl/bitset/size.html index 98638d8..1bbc243 100644 --- a/orig/stl/bitset/size.html +++ b/orig/stl/bitset/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

size

-
+
diff --git a/orig/stl/bitset/start.html b/orig/stl/bitset/start.html index 3bb94c6..e1d1e53 100644 --- a/orig/stl/bitset/start.html +++ b/orig/stl/bitset/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -83,10 +83,10 @@

C++ Bitsets

- + - + @@ -162,6 +162,6 @@

C++ Bitsets

-
+
diff --git a/orig/stl/bitset/test.html b/orig/stl/bitset/test.html index a473170..5faa3f5 100644 --- a/orig/stl/bitset/test.html +++ b/orig/stl/bitset/test.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

test

-
+
diff --git a/orig/stl/bitset/to_string.html b/orig/stl/bitset/to_string.html index 68c2f28..cc2759f 100644 --- a/orig/stl/bitset/to_string.html +++ b/orig/stl/bitset/to_string.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

to_string

-
+
diff --git a/orig/stl/bitset/to_ulong.html b/orig/stl/bitset/to_ulong.html index 26ab7e9..3179ea1 100644 --- a/orig/stl/bitset/to_ulong.html +++ b/orig/stl/bitset/to_ulong.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

to_ulong

-
+
diff --git a/orig/stl/deque/assign.html b/orig/stl/deque/assign.html index 46c84f2..2cf2b47 100644 --- a/orig/stl/deque/assign.html +++ b/orig/stl/deque/assign.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -166,6 +166,6 @@

assign

-
+
diff --git a/orig/stl/deque/at.html b/orig/stl/deque/at.html index eb47fb9..add18e7 100644 --- a/orig/stl/deque/at.html +++ b/orig/stl/deque/at.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -103,7 +103,7 @@

at

-Related Topics: [] operator +Related Topics: [] operator

@@ -148,6 +148,6 @@

at

-
+
diff --git a/orig/stl/deque/back.html b/orig/stl/deque/back.html index 6dc8744..b4a5bf6 100644 --- a/orig/stl/deque/back.html +++ b/orig/stl/deque/back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

back

-
+
diff --git a/orig/stl/deque/begin.html b/orig/stl/deque/begin.html index 37c32c5..5c3f2e1 100644 --- a/orig/stl/deque/begin.html +++ b/orig/stl/deque/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -145,6 +145,6 @@

begin

-
+
diff --git a/orig/stl/deque/clear.html b/orig/stl/deque/clear.html index fcba11e..8d764b4 100644 --- a/orig/stl/deque/clear.html +++ b/orig/stl/deque/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

clear

-
+
diff --git a/orig/stl/deque/deque.html b/orig/stl/deque/deque.html new file mode 100644 index 0000000..5b54799 --- /dev/null +++ b/orig/stl/deque/deque.html @@ -0,0 +1,195 @@ + + + + + + Deque constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Deque constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Double-ended Queues » Deque constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Deque constructors

+
+ +

+Syntax: +

+
    #include <deque>
+    deque();
+    deque( const deque& c );
+    deque( size_type num, const TYPE& val = TYPE() );
+    deque( input_iterator start, input_iterator end );
+

+The default deque constructor takes no arguments, creates a new instance of +that deque. +

+ +

+The second constructor is a default copy constructor that can be used to create +a new deque that is a copy of the given deque c. +

+ +

+The third constructor creates a deque with space for num objects. If val is +specified, each of those objects will be given that value. For example, the +following code creates a deque consisting of five copies of the integer 42: +

+
   deque<int> dq( 5, 42 );
+

+The last constructor creates a deque that is initialized to contain the +elements between start and end. For example: +

+
   // create a deque of random integers
+   cout << "original deque: ";
+   deque<int> dq;
+   for( int i = 0; i < 10; i++ ) {
+     int num = static_cast<int>(rand() % 10);
+     cout << num << " ";
+     dq.push_back( num );
+   }
+   cout << endl;
+ 
+   // find the first element of dq that is even
+   deque<int>::iterator iter1 = dq.begin();
+   while( iter1 != dq.end() && *iter1 % 2 != 0 ) ++iter1;
+ 
+   // find the last element of dq that is even
+   deque<int>::iterator iter2 = dq.end();
+   do {
+     --iter2;
+   } while( iter2 != dq.begin() && *iter2 % 2 != 0 );
+ 
+   cout << "first even number: " << *iter1 << ", last even number: " << *iter2 << endl;
+ 
+   cout << "new deque: ";
+   deque<int> dq2( iter1, iter2 );
+   for( size_t i = 0; i < dq2.size(); i++ ) {
+     cout << dq2[i] << " ";
+   }
+   cout << endl;
+

+When run, this code displays the following output: +

+
+   original deque: 1 9 7 9 2 7 2 1 9 8
+   first even number: 2, last even number: 8
+   new deque: 2 7 2 1 9
+

+In addition to containers and iterators, the STL also works with pointers and arrays. For example, the following code creates a deque using data from an array and pointer arithmetic: +

+
  // create a deque from an array of integers
+  const int ARR_SIZE = 4;
+  int vals[ARR_SIZE] = { 13, 26, 5, 979 };
+  deque<int> dq( vals, vals + sizeof(vals)/sizeof(int) );
+ 
+  cout << "dq is: ";
+  for( size_t i = 0; i < dq.size(); ++i ) cout << dq[i] << " ";
+  cout << '\n';
+

+All of these constructors run in linear time except the first, which runs in +constant time. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/deque/empty.html b/orig/stl/deque/empty.html index d86fb4a..66c2d1c 100644 --- a/orig/stl/deque/empty.html +++ b/orig/stl/deque/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

empty

-
+
diff --git a/orig/stl/deque/end.html b/orig/stl/deque/end.html index e25ebb7..7fd48ff 100644 --- a/orig/stl/deque/end.html +++ b/orig/stl/deque/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -152,6 +152,6 @@

end

-
+
diff --git a/orig/stl/deque/erase.html b/orig/stl/deque/erase.html index dbddf8e..669ab3c 100644 --- a/orig/stl/deque/erase.html +++ b/orig/stl/deque/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -197,6 +197,6 @@

erase

-
+
diff --git a/orig/stl/deque/front.html b/orig/stl/deque/front.html index 9417693..4cc4a26 100644 --- a/orig/stl/deque/front.html +++ b/orig/stl/deque/front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

front

-
+
diff --git a/orig/stl/deque/insert.html b/orig/stl/deque/insert.html index bf5e993..1cab00c 100644 --- a/orig/stl/deque/insert.html +++ b/orig/stl/deque/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -167,6 +167,6 @@

insert

-
+
diff --git a/orig/stl/deque/max_size.html b/orig/stl/deque/max_size.html index 1812029..f61d3c8 100644 --- a/orig/stl/deque/max_size.html +++ b/orig/stl/deque/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

max_size

-
+
diff --git a/orig/stl/deque/operator.html b/orig/stl/deque/operator.html new file mode 100644 index 0000000..7f31114 --- /dev/null +++ b/orig/stl/deque/operator.html @@ -0,0 +1,171 @@ + + + + + + Deque operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Deque operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Double-ended Queues » Deque operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Deque operators

+
+ +

+Syntax: +

+
    #include <deque>
+    TYPE& operator[]( size_type index );
+    const TYPE& operator[]( size_type index ) const;
+    deque operator=(const deque& c2);
+    bool operator==(const deque& c1, const deque& c2);
+    bool operator!=(const deque& c1, const deque& c2);
+    bool operator<(const deque& c1, const deque& c2);
+    bool operator>(const deque& c1, const deque& c2);
+    bool operator<=(const deque& c1, const deque& c2);
+    bool operator>=(const deque& c1, const deque& c2);
+

+All of the C++ containers can be compared and assigned with the standard +comparison operators: ==, !=, ⇐, >=, <, >, and =. Individual elements of a +deque can be examined with the [] operator. +

+ +

+Performing a comparison or assigning one deque to another takes linear time. +

+ +

+The [] operator runs in constant time. +

+ +

+Two deques are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one deque is equal to the the member in location i in the other deque.
    +
    3. +
+ +

+ +Comparisons among deques are done lexicographically. +

+ +

+For example, the following code uses the [] operator to access all of the +elements of a deque: +

+
   deque<int> dq( 5, 1 );
+   for( size_t i = 0; i < dq.size(); i++ ) {
+     cout << "Element " << i << " is " << dq[i] << '\n';
+   }
+

+Related Topics: at +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/deque/pop_back.html b/orig/stl/deque/pop_back.html index 53add56..8a7d80d 100644 --- a/orig/stl/deque/pop_back.html +++ b/orig/stl/deque/pop_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

pop_back

-
+
diff --git a/orig/stl/deque/pop_front.html b/orig/stl/deque/pop_front.html index 2406573..1380981 100644 --- a/orig/stl/deque/pop_front.html +++ b/orig/stl/deque/pop_front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

pop_front

-
+
diff --git a/orig/stl/deque/push_back.html b/orig/stl/deque/push_back.html index 7ddb8a6..d3fc4f8 100644 --- a/orig/stl/deque/push_back.html +++ b/orig/stl/deque/push_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

push_back

-
+
diff --git a/orig/stl/deque/push_front.html b/orig/stl/deque/push_front.html index 515a2c6..9f83a47 100644 --- a/orig/stl/deque/push_front.html +++ b/orig/stl/deque/push_front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -151,6 +151,6 @@

push_front

-
+
diff --git a/orig/stl/deque/rbegin.html b/orig/stl/deque/rbegin.html index 6902047..06407d8 100644 --- a/orig/stl/deque/rbegin.html +++ b/orig/stl/deque/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rbegin

-
+
diff --git a/orig/stl/deque/rend.html b/orig/stl/deque/rend.html index c05611c..a596a97 100644 --- a/orig/stl/deque/rend.html +++ b/orig/stl/deque/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/deque/resize.html b/orig/stl/deque/resize.html index 3c1bba2..8e560ba 100644 --- a/orig/stl/deque/resize.html +++ b/orig/stl/deque/resize.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

resize

-
+
diff --git a/orig/stl/deque/size.html b/orig/stl/deque/size.html index 53b0618..f12c718 100644 --- a/orig/stl/deque/size.html +++ b/orig/stl/deque/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

size

-
+
diff --git a/orig/stl/deque/start.html b/orig/stl/deque/start.html index dbf9b4b..1c3f8de 100644 --- a/orig/stl/deque/start.html +++ b/orig/stl/deque/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -80,10 +80,10 @@

C++ Double-ended

Constructorscreate new bitsetsConstructorscreate new bitsets
Operatorscompare and assign bitsetsOperatorscompare and assign bitsets
anytrue if any bits are set
- + - + @@ -199,6 +199,6 @@

Notes

-
+
diff --git a/orig/stl/deque/swap.html b/orig/stl/deque/swap.html index a651f68..046f76c 100644 --- a/orig/stl/deque/swap.html +++ b/orig/stl/deque/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -103,7 +103,7 @@

swap

d contains: 1 1 1 1 1

-Related Topics: insert, operator = +Related Topics: insert, operator =

@@ -148,6 +148,6 @@

swap

-
+
diff --git a/orig/stl/functional/bind1st.html b/orig/stl/functional/bind1st.html index 2078d5e..1669507 100644 --- a/orig/stl/functional/bind1st.html +++ b/orig/stl/functional/bind1st.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -142,6 +142,6 @@

bind1st

-
+
diff --git a/orig/stl/functional/bind2nd.html b/orig/stl/functional/bind2nd.html index 96d9501..aa49ad6 100644 --- a/orig/stl/functional/bind2nd.html +++ b/orig/stl/functional/bind2nd.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -145,6 +145,6 @@

bind2nd

-
+
diff --git a/orig/stl/functional/equal_to.html b/orig/stl/functional/equal_to.html index b7592d9..8880df0 100644 --- a/orig/stl/functional/equal_to.html +++ b/orig/stl/functional/equal_to.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/greater.html b/orig/stl/functional/greater.html index f47b759..b7e7eff 100644 --- a/orig/stl/functional/greater.html +++ b/orig/stl/functional/greater.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/greater_equal.html b/orig/stl/functional/greater_equal.html index aa76614..a4dbf11 100644 --- a/orig/stl/functional/greater_equal.html +++ b/orig/stl/functional/greater_equal.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/less.html b/orig/stl/functional/less.html index 93699f5..e2ebcdf 100644 --- a/orig/stl/functional/less.html +++ b/orig/stl/functional/less.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/less_equal.html b/orig/stl/functional/less_equal.html index 9b7f9b1..1d3a85d 100644 --- a/orig/stl/functional/less_equal.html +++ b/orig/stl/functional/less_equal.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/mem_fun.html b/orig/stl/functional/mem_fun.html index 2ba644e..23b50b3 100644 --- a/orig/stl/functional/mem_fun.html +++ b/orig/stl/functional/mem_fun.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/mem_fun_ref.html b/orig/stl/functional/mem_fun_ref.html index 50eb7ae..eccb7bc 100644 --- a/orig/stl/functional/mem_fun_ref.html +++ b/orig/stl/functional/mem_fun_ref.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/not1.html b/orig/stl/functional/not1.html index 0abd541..1107319 100644 --- a/orig/stl/functional/not1.html +++ b/orig/stl/functional/not1.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/not2.html b/orig/stl/functional/not2.html index ae1d267..be23932 100644 --- a/orig/stl/functional/not2.html +++ b/orig/stl/functional/not2.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/ptr_fun.html b/orig/stl/functional/ptr_fun.html index 05a04c9..1f0c9b6 100644 --- a/orig/stl/functional/ptr_fun.html +++ b/orig/stl/functional/ptr_fun.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/functional/start.html b/orig/stl/functional/start.html index 96b6371..5a0be65 100644 --- a/orig/stl/functional/start.html +++ b/orig/stl/functional/start.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -149,6 +149,6 @@

The <

-
+
diff --git a/orig/stl/iterators.html b/orig/stl/iterators.html index d26998a..a1e8f97 100644 --- a/orig/stl/iterators.html +++ b/orig/stl/iterators.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -182,6 +182,6 @@

C++ Iterators

-
+
diff --git a/orig/stl/list/assign.html b/orig/stl/list/assign.html index 751f954..6d7d6f6 100644 --- a/orig/stl/list/assign.html +++ b/orig/stl/list/assign.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -165,6 +165,6 @@

assign

-
+
diff --git a/orig/stl/list/back.html b/orig/stl/list/back.html index 9c8d639..085a70c 100644 --- a/orig/stl/list/back.html +++ b/orig/stl/list/back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -143,6 +143,6 @@

back

-
+
diff --git a/orig/stl/list/begin.html b/orig/stl/list/begin.html index 9630976..0860d56 100644 --- a/orig/stl/list/begin.html +++ b/orig/stl/list/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -142,6 +142,6 @@

begin

-
+
diff --git a/orig/stl/list/clear.html b/orig/stl/list/clear.html index 455dd9f..3e4f587 100644 --- a/orig/stl/list/clear.html +++ b/orig/stl/list/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

clear

-
+
diff --git a/orig/stl/list/empty.html b/orig/stl/list/empty.html index fd18546..d3154d7 100644 --- a/orig/stl/list/empty.html +++ b/orig/stl/list/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -135,6 +135,6 @@

empty

-
+
diff --git a/orig/stl/list/end.html b/orig/stl/list/end.html index b0913ae..0cb5b46 100644 --- a/orig/stl/list/end.html +++ b/orig/stl/list/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -151,6 +151,6 @@

end

-
+
diff --git a/orig/stl/list/erase.html b/orig/stl/list/erase.html index 5299323..d3ef942 100644 --- a/orig/stl/list/erase.html +++ b/orig/stl/list/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -195,6 +195,6 @@

erase

-
+
diff --git a/orig/stl/list/front.html b/orig/stl/list/front.html index 60b1204..0db4e54 100644 --- a/orig/stl/list/front.html +++ b/orig/stl/list/front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

front

-
+
diff --git a/orig/stl/list/insert.html b/orig/stl/list/insert.html index f7939d1..0130eed 100644 --- a/orig/stl/list/insert.html +++ b/orig/stl/list/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -160,6 +160,6 @@

insert

-
+
diff --git a/orig/stl/list/list.html b/orig/stl/list/list.html new file mode 100644 index 0000000..c4d89a3 --- /dev/null +++ b/orig/stl/list/list.html @@ -0,0 +1,208 @@ + + + + + + List constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[List constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Lists » List constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

List constructors

+
+ +

+Syntax: +

+
    #include <list>
+    list();
+    list( const list& c );
+    list( size_type num, const TYPE& val = TYPE() );
+    list( input_iterator start, input_iterator end );
+    ~list();
+

+The default list constructor takes no arguments, creates a new instance of that +list. +

+ +

+The second constructor is a default copy constructor that can be used to create +a new list that is a copy of the given list c. +

+ +

+The third constructor creates a list with space for num objects. If val is +specified, each of those objects will be given that value. For example, the +following code creates a list consisting of five copies of the integer 42: +

+
   list <int> l1( 5, 42 );
+

+The last constructor creates a list that is initialized to contain the elements +between start and end. For example: +

+
   // create a vector of random integers
+   cout << "original list: ";
+   list<int> l;
+   for( int i = 0; i < 20; i++ ) {
+     int num = (int) rand() % 10;
+     cout << num << " ";
+     l.push_back( num );
+   }
+   cout << endl;
+ 
+    // delete 5 & 7
+   list<int>::iterator iter1 = l.begin();
+   while( iter1 != l.end() ) {
+     list<int>::iterator thisone = iter1;
+     iter1++;
+     if ( *thisone == 5 || *thisone == 7 ) {
+        cout << "erase " << *thisone << endl;
+        l.erase( thisone );
+     }
+   }
+ 
+    // find the first element of l that is even
+   list<int>::iterator iter2 = l.begin();
+   while( iter2 != l.end() && *iter2 % 2 != 0 ) {
+     iter2++;
+   }
+ 
+   // find the last element of l that is even
+   list<int>::iterator iter3 = l.end();
+   do {
+     iter3--;
+   } while( iter3 != l.begin() && *iter3 % 2 != 0 );
+ 
+   cout << "first even number: " << *iter2 << ", last even number: " << *iter3 << endl;
+ 
+   cout << "new list: ";
+   list<int> l2( iter2, iter3 );
+   list<int>::iterator iter4 = l2.begin();
+   while( iter4 != l2.end() ) {
+     cout << *iter4 << " ";
+     iter4++;
+   }
+   cout << endl;
+

+When run, this code displays the following output: +

+
+  original list: 7 9 3 8 0 2 4 8 3 9 0 5 2 2 7 3 7 9 0 2
+  erase 7
+   erase 5
+   erase 7
+   erase 7
+   first even number: 8, last even number: 2
+   new list: 8 0 2 4 8 3 9 0 2 2 3 9 0
+

+All of these constructors run in linear time except the first, which runs in +constant time. +

+ +

+The default destructor calls the destructor for each object in the list with linear complexity. +

+ +
+ + +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/list/max_size.html b/orig/stl/list/max_size.html index 3171dd9..d4b8e54 100644 --- a/orig/stl/list/max_size.html +++ b/orig/stl/list/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -127,6 +127,6 @@

max_size

-
+
diff --git a/orig/stl/list/merge.html b/orig/stl/list/merge.html index e54db03..78067f1 100644 --- a/orig/stl/list/merge.html +++ b/orig/stl/list/merge.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -86,7 +86,7 @@

merge

-Related Topics: List operators, insert, splice +Related Topics: List operators, insert, splice

@@ -131,6 +131,6 @@

merge

-
+
diff --git a/orig/stl/list/operator.html b/orig/stl/list/operator.html new file mode 100644 index 0000000..5b3ca16 --- /dev/null +++ b/orig/stl/list/operator.html @@ -0,0 +1,153 @@ + + + + + + List operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[List operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Lists » List operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

List operators

+
+ +

+Syntax: +

+
    #include <list>
+    list operator=(const list& c2);
+    bool operator==(const list& c1, const list& c2);
+    bool operator!=(const list& c1, const list& c2);
+    bool operator<(const list& c1, const list& c2);
+    bool operator>(const list& c1, const list& c2);
+    bool operator<=(const list& c1, const list& c2);
+    bool operator>=(const list& c1, const list& c2);
+

+All of the C++ containers can be compared and assigned with the standard +comparison operators: ==, !=, <=, >=, <, >, and =. Performing a comparison or +assigning one list to another takes linear time. +

+ +

+Two lists are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one list is equal to the the member in location i in the other list.
    +
    3. +
+ +

+ +Comparisons among lists are done lexicographically. +

+ +

+Related Topics: merge, unique +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/list/pop_back.html b/orig/stl/list/pop_back.html index d42fe16..f5d9602 100644 --- a/orig/stl/list/pop_back.html +++ b/orig/stl/list/pop_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

pop_back

-
+
diff --git a/orig/stl/list/pop_front.html b/orig/stl/list/pop_front.html index 975bfa6..75589ec 100644 --- a/orig/stl/list/pop_front.html +++ b/orig/stl/list/pop_front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

pop_front

-
+
diff --git a/orig/stl/list/push_back.html b/orig/stl/list/push_back.html index bfa1559..15746d8 100644 --- a/orig/stl/list/push_back.html +++ b/orig/stl/list/push_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

push_back

-
+
diff --git a/orig/stl/list/push_front.html b/orig/stl/list/push_front.html index 83fb4b9..904865f 100644 --- a/orig/stl/list/push_front.html +++ b/orig/stl/list/push_front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

push_front

-
+
diff --git a/orig/stl/list/rbegin.html b/orig/stl/list/rbegin.html index 5c119a4..6261bbb 100644 --- a/orig/stl/list/rbegin.html +++ b/orig/stl/list/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rbegin

-
+
diff --git a/orig/stl/list/remove.html b/orig/stl/list/remove.html index 5ed0256..32a627f 100644 --- a/orig/stl/list/remove.html +++ b/orig/stl/list/remove.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -135,6 +135,6 @@

remove

-
+
diff --git a/orig/stl/list/remove_if.html b/orig/stl/list/remove_if.html index c9355a9..1db223a 100644 --- a/orig/stl/list/remove_if.html +++ b/orig/stl/list/remove_if.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

remove_if

-
+
diff --git a/orig/stl/list/rend.html b/orig/stl/list/rend.html index a8c5b7c..cf58aef 100644 --- a/orig/stl/list/rend.html +++ b/orig/stl/list/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/list/resize.html b/orig/stl/list/resize.html index c9a375f..925ad3d 100644 --- a/orig/stl/list/resize.html +++ b/orig/stl/list/resize.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

resize

-
+
diff --git a/orig/stl/list/reverse.html b/orig/stl/list/reverse.html index bacad3d..de30b91 100644 --- a/orig/stl/list/reverse.html +++ b/orig/stl/list/reverse.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

reverse

-
+
diff --git a/orig/stl/list/size.html b/orig/stl/list/size.html index 6a47046..0ec2648 100644 --- a/orig/stl/list/size.html +++ b/orig/stl/list/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

size

-
+
diff --git a/orig/stl/list/sort.html b/orig/stl/list/sort.html index 94e17df..6eab0ec 100644 --- a/orig/stl/list/sort.html +++ b/orig/stl/list/sort.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -175,6 +175,6 @@

sort

-
+
diff --git a/orig/stl/list/splice.html b/orig/stl/list/splice.html index 440f5ba..fe1f639 100644 --- a/orig/stl/list/splice.html +++ b/orig/stl/list/splice.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -131,6 +131,6 @@

splice

-
+
diff --git a/orig/stl/list/start.html b/orig/stl/list/start.html index 11dca4f..09a8910 100644 --- a/orig/stl/list/start.html +++ b/orig/stl/list/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -78,10 +78,10 @@

C++ Lists

Constructorscreate deques and initialize them with some dataConstructorscreate deques and initialize them with some data
Operatorscompare, assign, and access elements of a dequeOperatorscompare, assign, and access elements of a deque
assignassign elements to a deque
- + - + @@ -205,6 +205,6 @@

C++ Lists

-
+
diff --git a/orig/stl/list/swap.html b/orig/stl/list/swap.html index 770bdeb..d4fadaa 100644 --- a/orig/stl/list/swap.html +++ b/orig/stl/list/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

swap

-
+
diff --git a/orig/stl/list/unique.html b/orig/stl/list/unique.html index 2d728e2..e1a2c91 100644 --- a/orig/stl/list/unique.html +++ b/orig/stl/list/unique.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -95,7 +95,7 @@

unique

-Related Topics: List operators, remove, remove_if +Related Topics: List operators, remove, remove_if

@@ -140,6 +140,6 @@

unique

-
+
diff --git a/orig/stl/map/begin.html b/orig/stl/map/begin.html index 4e3406d..73c4ab6 100644 --- a/orig/stl/map/begin.html +++ b/orig/stl/map/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -157,6 +157,6 @@

begin

-
+
diff --git a/orig/stl/map/clear.html b/orig/stl/map/clear.html index 83e2663..7d82913 100644 --- a/orig/stl/map/clear.html +++ b/orig/stl/map/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

clear

-
+
diff --git a/orig/stl/map/count.html b/orig/stl/map/count.html index ac39848..8de562e 100644 --- a/orig/stl/map/count.html +++ b/orig/stl/map/count.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

count

-
+
diff --git a/orig/stl/map/empty.html b/orig/stl/map/empty.html index d179514..79e1c96 100644 --- a/orig/stl/map/empty.html +++ b/orig/stl/map/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -157,6 +157,6 @@

empty

-
+
diff --git a/orig/stl/map/end.html b/orig/stl/map/end.html index c28a7d0..4d470cb 100644 --- a/orig/stl/map/end.html +++ b/orig/stl/map/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

end

-
+
diff --git a/orig/stl/map/equal_range.html b/orig/stl/map/equal_range.html index 39322b7..1e50c29 100644 --- a/orig/stl/map/equal_range.html +++ b/orig/stl/map/equal_range.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

equal_range

-
+
diff --git a/orig/stl/map/erase.html b/orig/stl/map/erase.html index eb7f39c..95d18f3 100644 --- a/orig/stl/map/erase.html +++ b/orig/stl/map/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -161,6 +161,6 @@

erase

-
+
diff --git a/orig/stl/map/find.html b/orig/stl/map/find.html index 250f258..ab1bc26 100644 --- a/orig/stl/map/find.html +++ b/orig/stl/map/find.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -148,6 +148,6 @@

find

-
+
diff --git a/orig/stl/map/insert.html b/orig/stl/map/insert.html index 0d7d0a3..ee048f0 100644 --- a/orig/stl/map/insert.html +++ b/orig/stl/map/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -116,7 +116,7 @@

insert

-Related Topics: [] operator +Related Topics: [] operator

@@ -161,6 +161,6 @@

insert

-
+
diff --git a/orig/stl/map/key_comp.html b/orig/stl/map/key_comp.html index dbd81c1..75dc457 100644 --- a/orig/stl/map/key_comp.html +++ b/orig/stl/map/key_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

key_comp

-
+
diff --git a/orig/stl/map/lower_bound.html b/orig/stl/map/lower_bound.html index 871343e..c1f4d7c 100644 --- a/orig/stl/map/lower_bound.html +++ b/orig/stl/map/lower_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

lower_bound

-
+
diff --git a/orig/stl/map/map.html b/orig/stl/map/map.html new file mode 100644 index 0000000..9c5974e --- /dev/null +++ b/orig/stl/map/map.html @@ -0,0 +1,166 @@ + + + + + + Map Constructors & Destructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Map Constructors & Destructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Maps » Map Constructors & Destructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Map Constructors & Destructors

+
+ +

+Syntax: +

+
    #include <map>
+    map();
+    map( const map& m );
+    map( iterator start, iterator end );
+    map( iterator start, iterator end, const key_compare& cmp );
+    map( const key_compare& cmp );
+    ~map();
+

+The default constructor takes no arguments, creates a new instance of that map, +and runs in constant time. The default copy constructor runs in linear time and +can be used to create a new map that is a copy of the given map m. +

+ +

+You can also create a map that will contain a copy of the elements between +start and end, or specify a comparison function cmp. +

+ +

+The default destructor is called when the map should be destroyed. +

+ +

+For example, the following code creates a map that associates a string with an +integer: +

+
    struct strCmp {
+      bool operator()( const char* s1, const char* s2 ) const {
+        return strcmp( s1, s2 ) < 0;
+      }
+    };
+ 
+    ...
+ 
+    map<const char*, int, strCmp> ages;
+    ages["Homer"] = 38;
+    ages["Marge"] = 37;
+    ages["Lisa"] = 8;
+    ages["Maggie"] = 1;
+    ages["Bart"] = 11;
+ 
+    cout << "Bart is " << ages["Bart"] << " years old" << endl;
+

+ +Related Topics: Map operators +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/map/map_typedefs.html b/orig/stl/map/map_typedefs.html index 3619ff6..c87340f 100644 --- a/orig/stl/map/map_typedefs.html +++ b/orig/stl/map/map_typedefs.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -120,6 +120,6 @@

Map typedefs

-
+
diff --git a/orig/stl/map/max_size.html b/orig/stl/map/max_size.html index e8887cd..972d9f5 100644 --- a/orig/stl/map/max_size.html +++ b/orig/stl/map/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

max_size

-
+
diff --git a/orig/stl/map/operator.html b/orig/stl/map/operator.html new file mode 100644 index 0000000..b08f216 --- /dev/null +++ b/orig/stl/map/operator.html @@ -0,0 +1,193 @@ + + + + + + Map operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Map operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Maps » Map operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Map operators

+
+ +

+Syntax: +

+
    #include <map>
+    TYPE& operator[]( const key_type& key );
+    map operator=(const map& c2);
+    bool operator==(const map& c1, const map& c2);
+    bool operator!=(const map& c1, const map& c2);
+    bool operator<(const map& c1, const map& c2);
+    bool operator>(const map& c1, const map& c2);
+    bool operator<=(const map& c1, const map& c2);
+    bool operator>=(const map& c1, const map& c2);
+

+Maps can be compared and assigned with the standard comparison operators: ==, +!=, <=, >=, <, >, and =. Individual elements of a map can be examined with the +[] operator. +

+ +

+Performing a comparison or assigning one map to another takes linear time. +

+ +

+Two maps are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one map is equal to the the member in location i in the other map.
    +
    3. +
+ +

+ +Comparisons among maps are done lexicographically. +

+ +

+For example, the following code defines a map between strings and integers and +loads values into the map using the [] operator: +

+
    struct strCmp {
+      bool operator()( const char* s1, const char* s2 ) const {
+        return strcmp( s1, s2 ) < 0;
+      }
+    };
+ 
+    map<const char*, int, strCmp> ages;
+    ages["Homer"] = 38;
+    ages["Marge"] = 37;
+    ages["Lisa"] = 8;
+    ages["Maggie"] = 1;
+    ages["Bart"] = 11;
+ 
+    cout << "Bart is " << ages["Bart"] << " years old" << endl;
+ 
+    cout << "In alphabetical order: " << endl;
+    for( map<const char*, int, strCmp>::iterator iter = ages.begin(); iter != ages.end(); ++iter ) {
+      cout << (*iter).first << " is " << (*iter).second << " years old" << endl;
+    }
+

+When run, the above code displays this output: +

+
+    Bart is 11 years old
+    In alphabetical order:
+    Bart is 11 years old
+    Homer is 38 years old
+    Lisa is 8 years old
+    Maggie is 1 years old
+    Marge is 37 years old
+

+ +Related Topics: insert, Map Constructors & Destructors +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/map/rbegin.html b/orig/stl/map/rbegin.html index da05f3c..e67bee1 100644 --- a/orig/stl/map/rbegin.html +++ b/orig/stl/map/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

rbegin

-
+
diff --git a/orig/stl/map/rend.html b/orig/stl/map/rend.html index 83c6cf9..c0f5d5d 100644 --- a/orig/stl/map/rend.html +++ b/orig/stl/map/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/map/size.html b/orig/stl/map/size.html index cbb80c3..bcb09d1 100644 --- a/orig/stl/map/size.html +++ b/orig/stl/map/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

size

-
+
diff --git a/orig/stl/map/start.html b/orig/stl/map/start.html index d4ce7d8..10e31c3 100644 --- a/orig/stl/map/start.html +++ b/orig/stl/map/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -79,10 +79,10 @@

C++ Maps

Constructorscreate lists and initialize them with some dataConstructorscreate lists and initialize them with some data
Operatorsassign and compare listsOperatorsassign and compare lists
assignassign elements to a list
- + - + @@ -185,6 +185,6 @@

C++ Maps

-
+
diff --git a/orig/stl/map/swap.html b/orig/stl/map/swap.html index 64b62a2..9882e52 100644 --- a/orig/stl/map/swap.html +++ b/orig/stl/map/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

swap

-
+
diff --git a/orig/stl/map/upper_bound.html b/orig/stl/map/upper_bound.html index 6edc349..04152ff 100644 --- a/orig/stl/map/upper_bound.html +++ b/orig/stl/map/upper_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

upper_bound

-
+
diff --git a/orig/stl/map/value_comp.html b/orig/stl/map/value_comp.html index 0827706..d2ced75 100644 --- a/orig/stl/map/value_comp.html +++ b/orig/stl/map/value_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

value_comp

-
+
diff --git a/orig/stl/memory/auto_ptr.html b/orig/stl/memory/auto_ptr.html index 37d62fc..aaa5a1c 100644 --- a/orig/stl/memory/auto_ptr.html +++ b/orig/stl/memory/auto_ptr.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -166,6 +166,6 @@

auto_ptr

-
+
diff --git a/orig/stl/memory/start.html b/orig/stl/memory/start.html index 3c06618..1e639d4 100644 --- a/orig/stl/memory/start.html +++ b/orig/stl/memory/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

STL Memory Utilitie

-
+
diff --git a/orig/stl/multimap/begin.html b/orig/stl/multimap/begin.html index 7bd2047..afb2b7a 100644 --- a/orig/stl/multimap/begin.html +++ b/orig/stl/multimap/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

begin

-
+
diff --git a/orig/stl/multimap/clear.html b/orig/stl/multimap/clear.html index 8b95ac2..8876509 100644 --- a/orig/stl/multimap/clear.html +++ b/orig/stl/multimap/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

clear

-
+
diff --git a/orig/stl/multimap/count.html b/orig/stl/multimap/count.html index e503a2e..eeebe22 100644 --- a/orig/stl/multimap/count.html +++ b/orig/stl/multimap/count.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

count

-
+
diff --git a/orig/stl/multimap/empty.html b/orig/stl/multimap/empty.html index ba89ccb..bd06c06 100644 --- a/orig/stl/multimap/empty.html +++ b/orig/stl/multimap/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

empty

-
+
diff --git a/orig/stl/multimap/end.html b/orig/stl/multimap/end.html index a3ced95..65ab965 100644 --- a/orig/stl/multimap/end.html +++ b/orig/stl/multimap/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

end

-
+
diff --git a/orig/stl/multimap/equal_range.html b/orig/stl/multimap/equal_range.html index a1ff71b..5ec048e 100644 --- a/orig/stl/multimap/equal_range.html +++ b/orig/stl/multimap/equal_range.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

equal_range

-
+
diff --git a/orig/stl/multimap/erase.html b/orig/stl/multimap/erase.html index 3246074..115c67c 100644 --- a/orig/stl/multimap/erase.html +++ b/orig/stl/multimap/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -123,6 +123,6 @@

erase

-
+
diff --git a/orig/stl/multimap/find.html b/orig/stl/multimap/find.html index e954043..6ff95b9 100644 --- a/orig/stl/multimap/find.html +++ b/orig/stl/multimap/find.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

find

-
+
diff --git a/orig/stl/multimap/insert.html b/orig/stl/multimap/insert.html index bdfbe75..986c55b 100644 --- a/orig/stl/multimap/insert.html +++ b/orig/stl/multimap/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -164,6 +164,6 @@

insert

-
+
diff --git a/orig/stl/multimap/key_comp.html b/orig/stl/multimap/key_comp.html index 224ffed..0f38ccf 100644 --- a/orig/stl/multimap/key_comp.html +++ b/orig/stl/multimap/key_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

key_comp

-
+
diff --git a/orig/stl/multimap/lower_bound.html b/orig/stl/multimap/lower_bound.html index 5345dcb..04319b9 100644 --- a/orig/stl/multimap/lower_bound.html +++ b/orig/stl/multimap/lower_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

lower_bound

-
+
diff --git a/orig/stl/multimap/max_size.html b/orig/stl/multimap/max_size.html index 83ca6ab..a3561a9 100644 --- a/orig/stl/multimap/max_size.html +++ b/orig/stl/multimap/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

max_size

-
+
diff --git a/orig/stl/multimap/multimap.html b/orig/stl/multimap/multimap.html new file mode 100644 index 0000000..284f1d1 --- /dev/null +++ b/orig/stl/multimap/multimap.html @@ -0,0 +1,191 @@ + + + + + + Multimap constructors & destructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Multimap constructors & destructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Multimaps » Multimap constructors & destructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Multimap constructors & destructors

+
+ +

+Syntax: +

+
    #include <map>
+    multimap();
+    multimap( const multimap& c );
+    multimap( iterator begin, iterator end,
+              const key_compare& cmp = Compare(), const allocator& alloc = Allocator() );
+    ~multimap();
+

+Multimaps have several constructors: + +

+
    +
  • The default constructor takes no arguments, creates a new instance of that multimap, and runs in constant time.
    +
    • +
  • The default copy constructor runs in linear time and can be used to create a new multimap that is a copy of the given multimap c.
    +
    • +
  • Multimaps can also be created from a range of elements defined by begin and end. When using this constructor, an optional comparison function cmp and allocator alloc can also be provided.
    +
    • +
+ +

+ +The default destructor is called when the multimap should be destroyed. +

+ +

+The template definition of multimaps requires that both a key type and value +type be supplied. For example, you can instantiate a multimap that maps strings +to integers with this statement: +

+
    multimap<string,int> m;
+

+You can also supply a comparison function and an allocator in the template: +

+
    multimap<string,int,myComp,myAlloc> m;
+

+For example, the following code uses a multimap to associate a series of +employee names with numerical IDs: +

+
    multimap<string,int> m;
+ 
+    int employeeID = 0;
+    m.insert( pair<string,int>("Bob Smith",employeeID++) );
+    m.insert( pair<string,int>("Bob Thompson",employeeID++) );
+    m.insert( pair<string,int>("Bob Smithey",employeeID++) );
+    m.insert( pair<string,int>("Bob Smith",employeeID++) );
+ 
+    cout << "Number of employees named 'Bob Smith': " << m.count("Bob Smith") << endl;
+    cout << "Number of employees named 'Bob Thompson': " << m.count("Bob Thompson") << endl;
+    cout << "Number of employees named 'Bob Smithey': " << m.count("Bob Smithey") << endl;
+ 
+    cout << "Employee list: " << endl;
+    for( multimap<string, int>::iterator iter = m.begin(); iter != m.end(); ++iter ) {
+      cout << " Name: " << iter->first << ", ID #" << iter->second << endl;
+    }
+

+When run, the above code produces the following output. Note that the employee +list is displayed in alphabetical order, because multimaps are sorted +associative containers: +

+
    Number of employees named 'Bob Smith': 2
+    Number of employees named 'Bob Thompson': 1
+    Number of employees named 'Bob Smithey': 1
+    Employee list:
+     Name: Bob Smith, ID #0
+     Name: Bob Smith, ID #3
+     Name: Bob Smithey, ID #2
+     Name: Bob Thompson, ID #1
+

+ +Related Topics: count, insert +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/multimap/operator.html b/orig/stl/multimap/operator.html new file mode 100644 index 0000000..d911dc5 --- /dev/null +++ b/orig/stl/multimap/operator.html @@ -0,0 +1,153 @@ + + + + + + Multimap operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Multimap operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Multimaps » Multimap operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Multimap operators

+
+ +

+Syntax: +

+
    #include <map>
+    multimap operator=(const multimap& c2);
+    bool operator==(const multimap& c1, const multimap& c2);
+    bool operator!=(const multimap& c1, const multimap& c2);
+    bool operator<(const multimap& c1, const multimap& c2);
+    bool operator>(const multimap& c1, const multimap& c2);
+    bool operator<=(const multimap& c1, const multimap& c2);
+    bool operator>=(const multimap& c1, const multimap& c2);
+

+All of the C++ containers can be compared and assigned with the standard +comparison operators: ==, !=, ⇐, >=, <, >, and =. Performing a comparison or +assigning one multimap to another takes linear time. +

+ +

+Two multimaps are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one multimap is equal to the the member in location i in the other multimap.
    +
    3. +
+ +

+ +Comparisons among multimaps are done lexicographically. +

+ +

+Related Topics: Multimap constructors & destructors +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/multimap/rbegin.html b/orig/stl/multimap/rbegin.html index 53f7135..f3937c0 100644 --- a/orig/stl/multimap/rbegin.html +++ b/orig/stl/multimap/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rbegin

-
+
diff --git a/orig/stl/multimap/rend.html b/orig/stl/multimap/rend.html index 665b452..e3d0775 100644 --- a/orig/stl/multimap/rend.html +++ b/orig/stl/multimap/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/multimap/size.html b/orig/stl/multimap/size.html index 57e3bc5..7614965 100644 --- a/orig/stl/multimap/size.html +++ b/orig/stl/multimap/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

size

-
+
diff --git a/orig/stl/multimap/start.html b/orig/stl/multimap/start.html index 2d6c9e6..decde5c 100644 --- a/orig/stl/multimap/start.html +++ b/orig/stl/multimap/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -78,10 +78,10 @@

C++ Multimaps

Map Constructors & Destructorsdefault methods to allocate, copy, and deallocate mapsMap Constructors & Destructorsdefault methods to allocate, copy, and deallocate maps
Map operatorsassign, compare, and access elements of a mapMap operatorsassign, compare, and access elements of a map
Map typedefstypedefs of a map
- + - + @@ -181,6 +181,6 @@

C++ Multimaps

-
+
diff --git a/orig/stl/multimap/swap.html b/orig/stl/multimap/swap.html index 8e76950..e0709e3 100644 --- a/orig/stl/multimap/swap.html +++ b/orig/stl/multimap/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

swap

-
+
diff --git a/orig/stl/multimap/upper_bound.html b/orig/stl/multimap/upper_bound.html index f7a354f..dce26a2 100644 --- a/orig/stl/multimap/upper_bound.html +++ b/orig/stl/multimap/upper_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

upper_bound

-
+
diff --git a/orig/stl/multimap/value_comp.html b/orig/stl/multimap/value_comp.html index 06a1882..dfd93d8 100644 --- a/orig/stl/multimap/value_comp.html +++ b/orig/stl/multimap/value_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

value_comp

-
+
diff --git a/orig/stl/multiset/begin.html b/orig/stl/multiset/begin.html index 319bea9..764d2fe 100644 --- a/orig/stl/multiset/begin.html +++ b/orig/stl/multiset/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -149,6 +149,6 @@

begin

-
+
diff --git a/orig/stl/multiset/capacity.html b/orig/stl/multiset/capacity.html index 2bf1b22..117edca 100644 --- a/orig/stl/multiset/capacity.html +++ b/orig/stl/multiset/capacity.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/stl/multiset/clear.html b/orig/stl/multiset/clear.html index 8e2c62a..1109f5c 100644 --- a/orig/stl/multiset/clear.html +++ b/orig/stl/multiset/clear.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -142,6 +142,6 @@

clear

-
+
diff --git a/orig/stl/multiset/count.html b/orig/stl/multiset/count.html index c4c1d36..428606e 100644 --- a/orig/stl/multiset/count.html +++ b/orig/stl/multiset/count.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

count

-
+
diff --git a/orig/stl/multiset/empty.html b/orig/stl/multiset/empty.html index 8d4af94..32e1ba7 100644 --- a/orig/stl/multiset/empty.html +++ b/orig/stl/multiset/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

empty

-
+
diff --git a/orig/stl/multiset/end.html b/orig/stl/multiset/end.html index f28fc71..0a3f664 100644 --- a/orig/stl/multiset/end.html +++ b/orig/stl/multiset/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -158,6 +158,6 @@

end

-
+
diff --git a/orig/stl/multiset/equal_range.html b/orig/stl/multiset/equal_range.html index e0563e3..8607912 100644 --- a/orig/stl/multiset/equal_range.html +++ b/orig/stl/multiset/equal_range.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -122,6 +122,6 @@

equal_range

-
+
diff --git a/orig/stl/multiset/erase.html b/orig/stl/multiset/erase.html index 965011c..90ee3b1 100644 --- a/orig/stl/multiset/erase.html +++ b/orig/stl/multiset/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -162,6 +162,6 @@

erase

-
+
diff --git a/orig/stl/multiset/find.html b/orig/stl/multiset/find.html index f538dda..72f1b0a 100644 --- a/orig/stl/multiset/find.html +++ b/orig/stl/multiset/find.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -162,6 +162,6 @@

find

-
+
diff --git a/orig/stl/multiset/insert.html b/orig/stl/multiset/insert.html index afce5c0..e525a8b 100644 --- a/orig/stl/multiset/insert.html +++ b/orig/stl/multiset/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -154,6 +154,6 @@

insert

-
+
diff --git a/orig/stl/multiset/key_comp.html b/orig/stl/multiset/key_comp.html index eb1ba62..4329361 100644 --- a/orig/stl/multiset/key_comp.html +++ b/orig/stl/multiset/key_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

key_comp

-
+
diff --git a/orig/stl/multiset/lower_bound.html b/orig/stl/multiset/lower_bound.html index f09f76b..bbfde51 100644 --- a/orig/stl/multiset/lower_bound.html +++ b/orig/stl/multiset/lower_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

lower_bound

-
+
diff --git a/orig/stl/multiset/max_size.html b/orig/stl/multiset/max_size.html index 781e710..6eaddf5 100644 --- a/orig/stl/multiset/max_size.html +++ b/orig/stl/multiset/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

max_size

-
+
diff --git a/orig/stl/multiset/multiset.html b/orig/stl/multiset/multiset.html new file mode 100644 index 0000000..392d422 --- /dev/null +++ b/orig/stl/multiset/multiset.html @@ -0,0 +1,138 @@ + + + + + + Multiset Constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Multiset Constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Multisets » Multiset Constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Multiset Constructors

+
+ +

+Syntax: +

+
    #include <set>
+    multiset();
+    multiset( const multiset& c );
+    ~multiset();
+

+Every multiset has a default constructor, copy constructor, and destructor. +

+ +

+The default constructor takes no arguments, creates a new instance of that +multiset, and runs in constant time. The default copy constructor runs in +linear time and can be used to create a new multiset that is a copy of the +given multiset c. +

+ +

+The default destructor is called when the multiset should be destroyed. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/multiset/operator.html b/orig/stl/multiset/operator.html new file mode 100644 index 0000000..903f657 --- /dev/null +++ b/orig/stl/multiset/operator.html @@ -0,0 +1,149 @@ + + + + + + Multiset Operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Multiset Operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Multisets » Multiset Operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Multiset Operators

+
+ +

+Syntax: +

+
    #include <set>
+    multiset operator=(const multiset& c2);
+    bool operator==(const multiset& c1, const multiset& c2);
+    bool operator!=(const multiset& c1, const multiset& c2);
+    bool operator<(const multiset& c1, const multiset& c2);
+    bool operator>(const multiset& c1, const multiset& c2);
+    bool operator<=(const multiset& c1, const multiset& c2);
+    bool operator>=(const multiset& c1, const multiset& c2);
+

+All of the C++ containers can be compared and assigned with the standard +comparison operators: ==, !=, ⇐, >=, <, >, and =. Performing a comparison or +assigning one multiset to another takes linear time. +

+ +

+Two multisets are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one multiset is equal to the the member in location i in the other multiset.
    +
    3. +
+ +

+ +Comparisons among multisets are done lexicographically. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/multiset/rbegin.html b/orig/stl/multiset/rbegin.html index 94fd95b..61b741a 100644 --- a/orig/stl/multiset/rbegin.html +++ b/orig/stl/multiset/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rbegin

-
+
diff --git a/orig/stl/multiset/rend.html b/orig/stl/multiset/rend.html index 062cbf2..18b2359 100644 --- a/orig/stl/multiset/rend.html +++ b/orig/stl/multiset/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/multiset/size.html b/orig/stl/multiset/size.html index 3f246d7..779c03b 100644 --- a/orig/stl/multiset/size.html +++ b/orig/stl/multiset/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

size

-
+
diff --git a/orig/stl/multiset/start.html b/orig/stl/multiset/start.html index 72f3284..d5611c9 100644 --- a/orig/stl/multiset/start.html +++ b/orig/stl/multiset/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -77,10 +77,10 @@

C++ Multisets

Constructorsdefault methods to allocate, copy, and deallocate multimapsConstructorsdefault methods to allocate, copy, and deallocate multimaps
Operatorsassign and compare multimapsOperatorsassign and compare multimaps
beginreturns an iterator to the beginning of the multimap
- + - + @@ -180,6 +180,6 @@

C++ Multisets

-
+
diff --git a/orig/stl/multiset/swap.html b/orig/stl/multiset/swap.html index 45bf846..96ffd0e 100644 --- a/orig/stl/multiset/swap.html +++ b/orig/stl/multiset/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

swap

-
+
diff --git a/orig/stl/multiset/upper_bound.html b/orig/stl/multiset/upper_bound.html index 4b5d98c..9b30b07 100644 --- a/orig/stl/multiset/upper_bound.html +++ b/orig/stl/multiset/upper_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

upper_bound

-
+
diff --git a/orig/stl/multiset/value_comp.html b/orig/stl/multiset/value_comp.html index 1f34ead..2aa5e69 100644 --- a/orig/stl/multiset/value_comp.html +++ b/orig/stl/multiset/value_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

value_comp

-
+
diff --git a/orig/stl/priority_queue/empty.html b/orig/stl/priority_queue/empty.html index e41c5d7..4244618 100644 --- a/orig/stl/priority_queue/empty.html +++ b/orig/stl/priority_queue/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

empty

-
+
diff --git a/orig/stl/priority_queue/pop.html b/orig/stl/priority_queue/pop.html index e4482ff..2c4676e 100644 --- a/orig/stl/priority_queue/pop.html +++ b/orig/stl/priority_queue/pop.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

pop

-
+
diff --git a/orig/stl/priority_queue/pqueue_constructors.html b/orig/stl/priority_queue/pqueue_constructors.html index 7bcf5d8..444dcba 100644 --- a/orig/stl/priority_queue/pqueue_constructors.html +++ b/orig/stl/priority_queue/pqueue_constructors.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

Prior

-
+
diff --git a/orig/stl/priority_queue/push.html b/orig/stl/priority_queue/push.html index fc55277..37cf532 100644 --- a/orig/stl/priority_queue/push.html +++ b/orig/stl/priority_queue/push.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

push

-
+
diff --git a/orig/stl/priority_queue/size.html b/orig/stl/priority_queue/size.html index 29f9ee7..e2648c1 100644 --- a/orig/stl/priority_queue/size.html +++ b/orig/stl/priority_queue/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

size

-
+
diff --git a/orig/stl/priority_queue/start.html b/orig/stl/priority_queue/start.html index 27c9546..3d41414 100644 --- a/orig/stl/priority_queue/start.html +++ b/orig/stl/priority_queue/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

C++ Priority Queues -
+
diff --git a/orig/stl/priority_queue/top.html b/orig/stl/priority_queue/top.html index aaf2ebe..bcefc4f 100644 --- a/orig/stl/priority_queue/top.html +++ b/orig/stl/priority_queue/top.html @@ -51,7 +51,7 @@

-
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

top

-
+
diff --git a/orig/stl/queue/back.html b/orig/stl/queue/back.html index 8498890..d823d67 100644 --- a/orig/stl/queue/back.html +++ b/orig/stl/queue/back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -140,6 +140,6 @@

back

-
+
diff --git a/orig/stl/queue/empty.html b/orig/stl/queue/empty.html index 5d995f7..13a8400 100644 --- a/orig/stl/queue/empty.html +++ b/orig/stl/queue/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

empty

-
+
diff --git a/orig/stl/queue/front.html b/orig/stl/queue/front.html index b448684..e7283f5 100644 --- a/orig/stl/queue/front.html +++ b/orig/stl/queue/front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

front

-
+
diff --git a/orig/stl/queue/pop.html b/orig/stl/queue/pop.html index ca0f431..655dacf 100644 --- a/orig/stl/queue/pop.html +++ b/orig/stl/queue/pop.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

pop

-
+
diff --git a/orig/stl/queue/push.html b/orig/stl/queue/push.html index 577ab07..9dd7ed3 100644 --- a/orig/stl/queue/push.html +++ b/orig/stl/queue/push.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

push

-
+
diff --git a/orig/stl/queue/queue.html b/orig/stl/queue/queue.html new file mode 100644 index 0000000..9912a4e --- /dev/null +++ b/orig/stl/queue/queue.html @@ -0,0 +1,157 @@ + + + + + + Queue constructor [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Queue constructor]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Queues » Queue constructor
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Queue constructor

+
+ +

+Syntax: +

+
    #include <queue>
+    queue();
+    queue( const queue& other );
+

+Queues have a default constructor as well as a copy constructor that will +create a new queue out of the container other. +

+ +

+For example, the following code creates a queue of strings, populates it with +input from the user, and then displays it back to the user: +

+
    queue<string> waiting_line;
+    while( waiting_line.size() < 5 ) {
+      cout << "Welcome to the line, please enter your name: ";
+      string s;
+      getline( cin, s );
+      waiting_line.push(s);
+    }
+ 
+    while( !waiting_line.empty() ) {
+      cout << "Now serving: " << waiting_line.front() << endl;
+      waiting_line.pop();
+    }
+

+When run, the above code might produce this output: +

+
+Welcome to the line, please enter your name: Bart
+Welcome to the line, please enter your name: Milhouse
+Welcome to the line, please enter your name: Ralph
+Welcome to the line, please enter your name: Lisa
+Welcome to the line, please enter your name: Lunchlady Doris
+Now serving: Bart
+Now serving: Milhouse
+Now serving: Ralph
+Now serving: Lisa
+Now serving: Lunchlady Doris
+
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/queue/size.html b/orig/stl/queue/size.html index e625aa0..b22a6aa 100644 --- a/orig/stl/queue/size.html +++ b/orig/stl/queue/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

size

-
+
diff --git a/orig/stl/queue/start.html b/orig/stl/queue/start.html index 10c2d15..cf8bc66 100644 --- a/orig/stl/queue/start.html +++ b/orig/stl/queue/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -77,7 +77,7 @@

C++ Queues

Multiset Constructorsdefault methods to allocate, copy, and deallocate multisetsMultiset Constructorsdefault methods to allocate, copy, and deallocate multisets
Multiset Operatorsassign and compare multisetsMultiset Operatorsassign and compare multisets
beginreturns an iterator to the beginning of the multiset
- + @@ -141,6 +141,6 @@

C++ Queues

-
+
diff --git a/orig/stl/set/begin.html b/orig/stl/set/begin.html index ed1715a..3f5a5d5 100644 --- a/orig/stl/set/begin.html +++ b/orig/stl/set/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -142,6 +142,6 @@

begin

-
+
diff --git a/orig/stl/set/clear.html b/orig/stl/set/clear.html index 123a432..373a942 100644 --- a/orig/stl/set/clear.html +++ b/orig/stl/set/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -143,6 +143,6 @@

clear

-
+
diff --git a/orig/stl/set/count.html b/orig/stl/set/count.html index df63007..662a7af 100644 --- a/orig/stl/set/count.html +++ b/orig/stl/set/count.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -134,6 +134,6 @@

count

-
+
diff --git a/orig/stl/set/empty.html b/orig/stl/set/empty.html index a0aefdd..08d6b3a 100644 --- a/orig/stl/set/empty.html +++ b/orig/stl/set/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -137,6 +137,6 @@

empty

-
+
diff --git a/orig/stl/set/end.html b/orig/stl/set/end.html index 31a423b..fdcc01f 100644 --- a/orig/stl/set/end.html +++ b/orig/stl/set/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -143,6 +143,6 @@

end

-
+
diff --git a/orig/stl/set/equal_range.html b/orig/stl/set/equal_range.html index 365435f..f9eba26 100644 --- a/orig/stl/set/equal_range.html +++ b/orig/stl/set/equal_range.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -149,6 +149,6 @@

equal_range

-
+
diff --git a/orig/stl/set/erase.html b/orig/stl/set/erase.html index c2e620d..be0dd2a 100644 --- a/orig/stl/set/erase.html +++ b/orig/stl/set/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -178,6 +178,6 @@

erase

-
+
diff --git a/orig/stl/set/find.html b/orig/stl/set/find.html index 30eb60b..7c351ed 100644 --- a/orig/stl/set/find.html +++ b/orig/stl/set/find.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

find

-
+
diff --git a/orig/stl/set/insert.html b/orig/stl/set/insert.html index 1379132..d13db15 100644 --- a/orig/stl/set/insert.html +++ b/orig/stl/set/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -156,6 +156,6 @@

insert

-
+
diff --git a/orig/stl/set/key_comp.html b/orig/stl/set/key_comp.html index df9d7d3..b9a9011 100644 --- a/orig/stl/set/key_comp.html +++ b/orig/stl/set/key_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

key_comp

-
+
diff --git a/orig/stl/set/lower_bound.html b/orig/stl/set/lower_bound.html index 98f4256..a58ca22 100644 --- a/orig/stl/set/lower_bound.html +++ b/orig/stl/set/lower_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

lower_bound

-
+
diff --git a/orig/stl/set/max_size.html b/orig/stl/set/max_size.html index ce27be4..f24f108 100644 --- a/orig/stl/set/max_size.html +++ b/orig/stl/set/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

max_size

-
+
diff --git a/orig/stl/set/operator.html b/orig/stl/set/operator.html new file mode 100644 index 0000000..4267af5 --- /dev/null +++ b/orig/stl/set/operator.html @@ -0,0 +1,149 @@ + + + + + + Set operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Set operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Sets » Set operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Set operators

+
+ +

+Syntax: +

+
    #include <set>
+    set operator=(const set& c2);
+    bool operator==(const set& c1, const set& c2);
+    bool operator!=(const set& c1, const set& c2);
+    bool operator<(const set& c1, const set& c2);
+    bool operator>(const set& c1, const set& c2);
+    bool operator<=(const set& c1, const set& c2);
+    bool operator>=(const set& c1, const set& c2);
+

+All of the C++ containers can be compared and assigned with the standard +comparison operators: ==, !=, <=, >=, <, >, and =. Performing a comparison or +assigning one set to another takes linear time. +

+ +

+Two sets are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one set is equal to the the member in location i in the other set.
    +
    3. +
+ +

+ +Comparisons among sets are done lexicographically. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/set/rbegin.html b/orig/stl/set/rbegin.html index 49ff508..8b99548 100644 --- a/orig/stl/set/rbegin.html +++ b/orig/stl/set/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

rbegin

-
+
diff --git a/orig/stl/set/rend.html b/orig/stl/set/rend.html index 52d6548..4ae4af6 100644 --- a/orig/stl/set/rend.html +++ b/orig/stl/set/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/set/set.html b/orig/stl/set/set.html new file mode 100644 index 0000000..bce0642 --- /dev/null +++ b/orig/stl/set/set.html @@ -0,0 +1,158 @@ + + + + + + Set constructors & destructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Set constructors & destructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Sets » Set constructors & destructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Set constructors & destructors

+
+ +

+Syntax: +

+
    #include <set>
+    set();
+    set( const set& c );
+    ~set();
+

+Every set has a default constructor, copy constructor, and destructor. +

+ +

+The default constructor takes no arguments, creates a new instance of that set, +and runs in constant time. The default copy constructor runs in linear time and +can be used to create a new set that is a copy of the given set c. +

+ +

+The default destructor is called when the set should be destroyed. +

+ +

+For example, the following code creates and displays a set of integers: +

+
  const int max_nums = 10;
+  int nums[max_nums] = {3,1,4,1,5,9,2,6,5,8};
+ 
+  set<int> digits;
+  for( int i = 0; i < max_nums; ++i ) digits.insert(nums[i]);
+ 
+  cout << "Unique digits are: ";
+  for( set<int>::const_iterator iter = digits.begin();
+       iter != digits.end();
+       ++iter ) {
+    cout << *iter << ' ';
+  }
+  cout << '\n';
+

+When run, this code displays: +

+
+Unique digits are: 1 2 3 4 5 6 8 9
+
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/set/size.html b/orig/stl/set/size.html index af214e9..6b3e4e4 100644 --- a/orig/stl/set/size.html +++ b/orig/stl/set/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -136,6 +136,6 @@

size

-
+
diff --git a/orig/stl/set/start.html b/orig/stl/set/start.html index 9f0d398..74a3103 100644 --- a/orig/stl/set/start.html +++ b/orig/stl/set/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -77,10 +77,10 @@

C++ Sets

Constructorsconstruct a new queueConstructorsconstruct a new queue
backreturns a reference to last element of a queue
- + - + @@ -180,6 +180,6 @@

C++ Sets

-
+
diff --git a/orig/stl/set/swap.html b/orig/stl/set/swap.html index caefc92..5c4ad3b 100644 --- a/orig/stl/set/swap.html +++ b/orig/stl/set/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -121,6 +121,6 @@

swap

-
+
diff --git a/orig/stl/set/upper_bound.html b/orig/stl/set/upper_bound.html index 3c7eb45..476cfb7 100644 --- a/orig/stl/set/upper_bound.html +++ b/orig/stl/set/upper_bound.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

upper_bound

-
+
diff --git a/orig/stl/set/value_comp.html b/orig/stl/set/value_comp.html index f2a51e0..3e9eb52 100644 --- a/orig/stl/set/value_comp.html +++ b/orig/stl/set/value_comp.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -125,6 +125,6 @@

value_comp

-
+
diff --git a/orig/stl/stack/empty.html b/orig/stl/stack/empty.html index 37c8a65..0570c9e 100644 --- a/orig/stl/stack/empty.html +++ b/orig/stl/stack/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

empty

-
+
diff --git a/orig/stl/stack/pop.html b/orig/stl/stack/pop.html index fe624f9..2588f87 100644 --- a/orig/stl/stack/pop.html +++ b/orig/stl/stack/pop.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

pop

-
+
diff --git a/orig/stl/stack/push.html b/orig/stl/stack/push.html index 57fd43e..b436371 100644 --- a/orig/stl/stack/push.html +++ b/orig/stl/stack/push.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

push

-
+
diff --git a/orig/stl/stack/size.html b/orig/stl/stack/size.html index 30d0101..41c1766 100644 --- a/orig/stl/stack/size.html +++ b/orig/stl/stack/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -124,6 +124,6 @@

size

-
+
diff --git a/orig/stl/stack/stack.html b/orig/stl/stack/stack.html new file mode 100644 index 0000000..f3c7a09 --- /dev/null +++ b/orig/stl/stack/stack.html @@ -0,0 +1,127 @@ + + + + + + Stack constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Stack constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Stacks » Stack constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Stack constructors

+
+ +

+Syntax: +

+
    #include <stack>
+    stack();
+    stack( const Container& con );
+

+Stacks have an empty constructor and a constructor that can be used to specify +a container type. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/stack/start.html b/orig/stl/stack/start.html index 98da6b4..ee93b6e 100644 --- a/orig/stl/stack/start.html +++ b/orig/stl/stack/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -78,7 +78,7 @@

C++ Stacks

Constructorsdefault methods to allocate, copy, and deallocate setsConstructorsdefault methods to allocate, copy, and deallocate sets
Operatorsassign and compare setsOperatorsassign and compare sets
beginreturns an iterator to the beginning of the set
- + @@ -139,6 +139,6 @@

C++ Stacks

-
+
diff --git a/orig/stl/stack/top.html b/orig/stl/stack/top.html index 22b5be3..78fcf4c 100644 --- a/orig/stl/stack/top.html +++ b/orig/stl/stack/top.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -133,6 +133,6 @@

top

-
+
diff --git a/orig/stl/start.html b/orig/stl/start.html index 2d4ea89..68b4d00 100644 --- a/orig/stl/start.html +++ b/orig/stl/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -257,6 +257,6 @@

Utility

-
+
diff --git a/orig/stl/utility/make_pair.html b/orig/stl/utility/make_pair.html index 6130233..ff39a0b 100644 --- a/orig/stl/utility/make_pair.html +++ b/orig/stl/utility/make_pair.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -140,6 +140,6 @@

make_pair

-
+
diff --git a/orig/stl/utility/pair.html b/orig/stl/utility/pair.html index bcc3676..c2391ee 100644 --- a/orig/stl/utility/pair.html +++ b/orig/stl/utility/pair.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

pair

-
+
diff --git a/orig/stl/utility/start.html b/orig/stl/utility/start.html index 206b75f..bdb0c50 100644 --- a/orig/stl/utility/start.html +++ b/orig/stl/utility/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

The <utili

-
+
diff --git a/orig/stl/vector/assign.html b/orig/stl/vector/assign.html index d1f504b..f33e974 100644 --- a/orig/stl/vector/assign.html +++ b/orig/stl/vector/assign.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -90,7 +90,7 @@

assign

   vector<int> v;
    v.assign( 10, 42 );
-   for( int i = 0; i < v.size(); i++ ) {
+   for( vector<int>::size_type i = 0; i < v.size(); i++ ) {
      cout << v[i] << " ";
    }
    cout << endl;
@@ -113,7 +113,7 @@

assign

vector<int> v2; v2.assign( v1.begin(), v1.end() );   - for( int i = 0; i < v2.size(); i++ ) { + for( vector<int>::size_type i = 0; i < v2.size(); i++ ) { cout << v2[i] << " "; } cout << endl; @@ -123,11 +123,11 @@

assign

 0 1 2 3 4 5 6 7 8 9

-Related Topics: insert, push_back, [] operator +Related Topics: insert, push_back, [] operator

-
+
@@ -141,7 +141,7 @@

assign

@@ -168,6 +168,6 @@

assign

-
+
diff --git a/orig/stl/vector/at.html b/orig/stl/vector/at.html index 356d555..b7ba5c6 100644 --- a/orig/stl/vector/at.html +++ b/orig/stl/vector/at.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -77,7 +77,7 @@

at

const TYPE& at( size_type loc ) const;

The at() function returns a reference to the element in the vector at -index loc. The at() function is safer than the [] +index loc. The at() function is safer than the [] operator, because it won't let you reference items outside the bounds of the vector.

@@ -104,7 +104,7 @@

at

-Related Topics: [] operator +Related Topics: [] operator

@@ -149,6 +149,6 @@

at

-
+
diff --git a/orig/stl/vector/back.html b/orig/stl/vector/back.html index 83dd458..286a9a4 100644 --- a/orig/stl/vector/back.html +++ b/orig/stl/vector/back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -140,6 +140,6 @@

back

-
+
diff --git a/orig/stl/vector/begin.html b/orig/stl/vector/begin.html index ac96d17..f220c92 100644 --- a/orig/stl/vector/begin.html +++ b/orig/stl/vector/begin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -108,7 +108,7 @@

begin

so fine

-Related Topics: [] operator, at, end, rbegin, rend +Related Topics: [] operator, at, end, rbegin, rend

@@ -153,6 +153,6 @@

begin

-
+
diff --git a/orig/stl/vector/capacity.html b/orig/stl/vector/capacity.html index 7ac2c09..b6ccceb 100644 --- a/orig/stl/vector/capacity.html +++ b/orig/stl/vector/capacity.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -160,6 +160,6 @@

capacity

-
+
diff --git a/orig/stl/vector/clear.html b/orig/stl/vector/clear.html index 3b4eb2f..b7ea61a 100644 --- a/orig/stl/vector/clear.html +++ b/orig/stl/vector/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -145,6 +145,6 @@

clear

-
+
diff --git a/orig/stl/vector/empty.html b/orig/stl/vector/empty.html index 17d4a84..7eca132 100644 --- a/orig/stl/vector/empty.html +++ b/orig/stl/vector/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -139,6 +139,6 @@

empty

-
+
diff --git a/orig/stl/vector/end.html b/orig/stl/vector/end.html index 39ab90f..0240547 100644 --- a/orig/stl/vector/end.html +++ b/orig/stl/vector/end.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -166,6 +166,6 @@

end

-
+
diff --git a/orig/stl/vector/erase.html b/orig/stl/vector/erase.html index 1083325..f3603c4 100644 --- a/orig/stl/vector/erase.html +++ b/orig/stl/vector/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -235,6 +235,6 @@

erase

-
+
diff --git a/orig/stl/vector/front.html b/orig/stl/vector/front.html index d2cdb84..8538666 100644 --- a/orig/stl/vector/front.html +++ b/orig/stl/vector/front.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -148,6 +148,6 @@

front

-
+
diff --git a/orig/stl/vector/insert.html b/orig/stl/vector/insert.html index 06a162a..74be6d8 100644 --- a/orig/stl/vector/insert.html +++ b/orig/stl/vector/insert.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -204,6 +204,6 @@

insert

-
+
diff --git a/orig/stl/vector/max_size.html b/orig/stl/vector/max_size.html index 5b59dc7..edf1b1d 100644 --- a/orig/stl/vector/max_size.html +++ b/orig/stl/vector/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

max_size

-
+
diff --git a/orig/stl/vector/operator.html b/orig/stl/vector/operator.html new file mode 100644 index 0000000..c114767 --- /dev/null +++ b/orig/stl/vector/operator.html @@ -0,0 +1,171 @@ + + + + + + Vector operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Vector operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Vectors » Vector operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Vector operators

+
+ +

+Syntax: +

+
    #include <vector>
+    TYPE& operator[]( size_type index );
+    const TYPE& operator[]( size_type index ) const;
+    vector operator=(const vector& c2);
+    bool operator==(const vector& c1, const vector& c2);
+    bool operator!=(const vector& c1, const vector& c2);
+    bool operator<(const vector& c1, const vector& c2);
+    bool operator>(const vector& c1, const vector& c2);
+    bool operator<=(const vector& c1, const vector& c2);
+    bool operator>=(const vector& c1, const vector& c2);
+

+All of the C++ containers can be compared and assigned with the standard +comparison operators: ==, !=, <=, >=, <, >, and =. Individual elements of a +vector can be examined with the [] operator. +

+ +

+Performing a comparison or assigning one vector to another takes linear time. +

+ +

+The [] operator runs in constant time. +

+ +

+Two vectors are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one vector is equal to the the member in location i in the other vector.
    +
    3. +
+ +

+ +Comparisons among vectors are done lexicographically. +

+ +

+For example, the following code uses the [] operator to access all of the +elements of a vector: +

+
   vector<int> v( 5, 1 );
+   for( int i = 0; i < v.size(); i++ ) {
+     cout << "Element " << i << " is " << v[i] << endl;
+   }
+

+Related Topics: at +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/stl/vector/pop_back.html b/orig/stl/vector/pop_back.html index 5ead3c7..eb969c2 100644 --- a/orig/stl/vector/pop_back.html +++ b/orig/stl/vector/pop_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

pop_back

-
+
diff --git a/orig/stl/vector/push_back.html b/orig/stl/vector/push_back.html index f13dd06..853c951 100644 --- a/orig/stl/vector/push_back.html +++ b/orig/stl/vector/push_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -137,6 +137,6 @@

push_back

-
+
diff --git a/orig/stl/vector/rbegin.html b/orig/stl/vector/rbegin.html index 8ed9846..2e58740 100644 --- a/orig/stl/vector/rbegin.html +++ b/orig/stl/vector/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rbegin

-
+
diff --git a/orig/stl/vector/rend.html b/orig/stl/vector/rend.html index 969d1dc..5a8016c 100644 --- a/orig/stl/vector/rend.html +++ b/orig/stl/vector/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -130,6 +130,6 @@

rend

-
+
diff --git a/orig/stl/vector/reserve.html b/orig/stl/vector/reserve.html index 67ee149..31bec59 100644 --- a/orig/stl/vector/reserve.html +++ b/orig/stl/vector/reserve.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

reserve

-
+
diff --git a/orig/stl/vector/resize.html b/orig/stl/vector/resize.html index 87db8d1..1670490 100644 --- a/orig/stl/vector/resize.html +++ b/orig/stl/vector/resize.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

resize

Syntax: 

    #include <vector>
-    void resize( size_type num, const TYPE& val = TYPE() );
+ void resize( size_type num, TYPE val = TYPE() );

The function resize() changes the size of the vector to num. If val is specified then any newly-created elements will be initialized to have a value @@ -91,11 +91,11 @@

resize

-Related Topics: Vector constructors, capacity, size +Related Topics: Vector constructors, capacity, size

-
+
@@ -109,7 +109,7 @@

resize

@@ -136,6 +136,6 @@

resize

-
+
diff --git a/orig/stl/vector/size.html b/orig/stl/vector/size.html index 248ff7e..b44dbb4 100644 --- a/orig/stl/vector/size.html +++ b/orig/stl/vector/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -132,6 +132,6 @@

size

-
+
diff --git a/orig/stl/vector/start.html b/orig/stl/vector/start.html index fa2df8f..451107f 100644 --- a/orig/stl/vector/start.html +++ b/orig/stl/vector/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -82,10 +82,10 @@

C++ Vectors

Constructorsconstruct a new stackConstructorsconstruct a new stack
emptytrue if the stack has no elements
- + - + @@ -201,6 +201,6 @@

Notes:

-
+
diff --git a/orig/stl/vector/swap.html b/orig/stl/vector/swap.html index c070b6a..9483cc3 100644 --- a/orig/stl/vector/swap.html +++ b/orig/stl/vector/swap.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -100,7 +100,7 @@

swap

The first element in v1 is And I'm in v2! The first element in v2 is I'm in v1!

-Related Topics: = operator +Related Topics: = operator

@@ -145,6 +145,6 @@

swap

-
+
diff --git a/orig/stl/vector/vector.html b/orig/stl/vector/vector.html new file mode 100644 index 0000000..9c2c452 --- /dev/null +++ b/orig/stl/vector/vector.html @@ -0,0 +1,205 @@ + + + + + + Vector constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[Vector constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Standard Template Library » C++ Vectors » Vector constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

Vector constructors

+
+ +

+Syntax: +

+
    #include <vector>
+    using namespace std;
+    vector();
+    vector( const vector& c );
+    vector( size_type num, const TYPE& val = TYPE() );
+    template< typename input_iterator >
+    vector( input_iterator start, input_iterator end );
+    ~vector();
+

+The default vector constructor takes no arguments, creates a new instance of +that vector. +

+ +

+The second constructor is a default copy constructor that can be used to create +a new vector that is a copy of the given vector c. +

+ +

+The third constructor creates a vector with num objects. If val is specified, +each of those objects will be given that value, otherwise, those objects are +given TYPE's default constructor's value. For example, the following code +creates a vector consisting of five copies of the integer 42: +

+
   vector<int> v1( 5, 42 );
+

+The last constructor creates a vector that is initialized to contain the +elements between start and end. For example: +

+
   // create a vector of random integers
+   cout << "original vector: ";
+   vector<int> v;
+   for( int i = 0; i < 10; ++i ) {
+     int num = (int) rand() % 10;
+     cout << num << " ";
+     v.push_back( num );
+   }
+   cout << endl;
+ 
+   // find the first element of v that is even
+   vector<int>::iterator iter1 = v.begin();
+   while( iter1 != v.end() && *iter1 % 2 != 0 ) {
+     ++iter1;
+   }
+ 
+   // find the last element of v that is even
+   vector<int>::iterator iter2 = v.end();
+   do {
+     --iter2;
+   } while( iter2 != v.begin() && *iter2 % 2 != 0 );
+ 
+   // only proceed if we find both numbers
+   if( iter1 != v.end() && iter2 != v.begin() ) {
+     cout << "first even number: " << *iter1 << ", last even number: " << *iter2 << endl;
+ 
+     cout << "new vector: ";
+     vector<int> v2( iter1, iter2 );
+     for( int i = 0; i < v2.size(); ++i ) {
+       cout << v2[i] << " ";
+     }
+     cout << endl;
+   }
+

+When run, this code displays the following output: +

+
+   original vector: 1 9 7 9 2 7 2 1 9 8
+   first even number: 2, last even number: 8
+   new vector: 2 7 2 1 9
+

+The last constructor provides for a way to initialize an STL vector from an old style array. +Example: +

+
    float fp_values[] = { 0.1, 0.2 , 0.3, 0.4};      // somewhere an array is created
+...
+    vector<float> fp_vector(fp_values,fp_values+4); // elements in the array are copied into fp_vector
+

+ +All of these constructors run in linear time except the first, which runs in +constant time. +

+ +

+The default destructor is called for each element when the vector is destroyed. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/string/append.html b/orig/string/append.html index 7559ff0..14233e1 100644 --- a/orig/string/append.html +++ b/orig/string/append.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -163,6 +163,6 @@

append

-
+
diff --git a/orig/string/assign.html b/orig/string/assign.html index 0add163..ea91428 100644 --- a/orig/string/assign.html +++ b/orig/string/assign.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -78,7 +78,7 @@

assign

string& assign( const char* str ); string& assign( const char* str, size_type num ); string& assign( const string& str, size_type index, size_type len ); - string& assign( size_type num, const char& ch ); + string& assign( size_type num, char ch );

The default assign method gives the current string the values from start to end, or gives it num copies of ch.

@@ -113,7 +113,7 @@

assign

-Related Topics: [] operator +Related Topics: [] operator

@@ -131,7 +131,7 @@

assign

@@ -158,6 +158,6 @@

assign

-
+
diff --git a/orig/string/at.html b/orig/string/at.html index c55dd29..756d46a 100644 --- a/orig/string/at.html +++ b/orig/string/at.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -103,7 +103,7 @@

at

-Related Topics: [] operator +Related Topics: [] operator

@@ -148,6 +148,6 @@

at

-
+
diff --git a/orig/string/begin.html b/orig/string/begin.html index cd1a442..3cd70c2 100644 --- a/orig/string/begin.html +++ b/orig/string/begin.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -90,7 +90,7 @@

begin

// Display the list list<char>::iterator theIterator; for( theIterator = charList.begin(); theIterator != charList.end(); - theIterator++ ) { + ++theIterator ) { cout << *theIterator; }

@@ -98,7 +98,7 @@

begin

-
+
@@ -112,7 +112,7 @@

begin

@@ -139,6 +139,6 @@

begin

-
+
diff --git a/orig/string/c_lists_erase.html b/orig/string/c_lists_erase.html index 2d9bfb6..907d885 100644 --- a/orig/string/c_lists_erase.html +++ b/orig/string/c_lists_erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/string/c_lists_splice.html b/orig/string/c_lists_splice.html index 1d58ba6..6382c4f 100644 --- a/orig/string/c_lists_splice.html +++ b/orig/string/c_lists_splice.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/string/c_multimaps_multimap_constructors_destructors.html b/orig/string/c_multimaps_multimap_constructors_destructors.html index cd2163b..626b7c7 100644 --- a/orig/string/c_multimaps_multimap_constructors_destructors.html +++ b/orig/string/c_multimaps_multimap_constructors_destructors.html @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
diff --git a/orig/string/c_str.html b/orig/string/c_str.html index c6b6a25..37697c6 100644 --- a/orig/string/c_str.html +++ b/orig/string/c_str.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@
-
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

c_str

Syntax: 

    #include <string>
-    const char* c_str();
+ const char* c_str() const;

The function c_str() returns a const pointer to a regular C string, identical to the current string. The returned string is null-terminated. @@ -86,11 +86,11 @@

c_str

-Related Topics: String operators, data +Related Topics: String operators, data

-
+
@@ -104,7 +104,7 @@

c_str

@@ -131,6 +131,6 @@

c_str

-
+
diff --git a/orig/string/capacity.html b/orig/string/capacity.html index 07b5a39..9e798d1 100644 --- a/orig/string/capacity.html +++ b/orig/string/capacity.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -152,6 +152,6 @@

capacity

-
+
diff --git a/orig/string/clear.html b/orig/string/clear.html index 28900de..2794f2b 100644 --- a/orig/string/clear.html +++ b/orig/string/clear.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

clear

-
+
diff --git a/orig/string/compare.html b/orig/string/compare.html index fc5570a..7e110de 100644 --- a/orig/string/compare.html +++ b/orig/string/compare.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,11 +73,11 @@

compare

Syntax: 

    #include <string>
-    int compare( const string& str );
-    int compare( const char* str );
-    int compare( size_type index, size_type length, const string& str );
-    int compare( size_type index, size_type length, const string& str, size_type index2, size_type length2 );
-    int compare( size_type index, size_type length, const char* str, size_type length2 = npos );
+ int compare( const string& str ) const; + int compare( const char* str ) const; + int compare( size_type index, size_type length, const string& str ) const; + int compare( size_type index, size_type length, const string& str, size_type index2, size_type length2 ) const; + int compare( size_type index, size_type length, const char* str, size_type length2 = npos ) const;

The compare() function either compares str to the current string in a variety of ways, returning @@ -151,7 +151,7 @@

compare

-Related Topics: String operators +Related Topics: String operators

@@ -169,7 +169,7 @@

compare

@@ -196,6 +196,6 @@

compare

-
+
diff --git a/orig/string/copy.html b/orig/string/copy.html index 7b01b23..6c2bc17 100644 --- a/orig/string/copy.html +++ b/orig/string/copy.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

copy

Syntax: 

    #include <string>
-    size_type copy( char* str, size_type num, size_type index = 0 );
+ size_type copy( char* str, size_type num, size_type index = 0 ) const;

The copy() function copies num characters of the current string (starting at @@ -105,7 +105,7 @@

copy

-
+
@@ -119,7 +119,7 @@

copy

@@ -146,6 +146,6 @@

copy

-
+
diff --git a/orig/string/data.html b/orig/string/data.html index 0ecb4f2..74c0613 100644 --- a/orig/string/data.html +++ b/orig/string/data.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

data

Syntax: 

    #include <string>
-    const char *data();
+ const char *data() const;

The function data() returns a pointer to the first character in the current @@ -101,12 +101,12 @@

data

return 0; }

-Related Topics: String operators, c_str +Related Topics: String operators, c_str

-
+
@@ -120,7 +120,7 @@

data

@@ -147,6 +147,6 @@

data

-
+
diff --git a/orig/string/empty.html b/orig/string/empty.html index a62cc94..4c6b439 100644 --- a/orig/string/empty.html +++ b/orig/string/empty.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -140,6 +140,6 @@

empty

-
+
diff --git a/orig/string/end.html b/orig/string/end.html index 7c41936..b61b50f 100644 --- a/orig/string/end.html +++ b/orig/string/end.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -86,7 +86,7 @@

end

   vector<int> v1( 5, 789 );
    vector<int>::iterator it;
-   for( it = v1.begin(); it != v1.end(); it++ ) {
+   for( it = v1.begin(); it != v1.end(); ++it ) {
      cout << *it << endl;
    }

@@ -104,7 +104,7 @@

end

-
+
@@ -118,7 +118,7 @@

end

@@ -145,6 +145,6 @@

end

-
+
diff --git a/orig/string/erase.html b/orig/string/erase.html index 1675840..eac948f 100644 --- a/orig/string/erase.html +++ b/orig/string/erase.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -161,6 +161,6 @@

erase

-
+
diff --git a/orig/string/find.html b/orig/string/find.html index fdb73c1..bea3d7d 100644 --- a/orig/string/find.html +++ b/orig/string/find.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -146,6 +146,6 @@

find

-
+
diff --git a/orig/string/find_first_not_of.html b/orig/string/find_first_not_of.html index 8fe669e..fabf260 100644 --- a/orig/string/find_first_not_of.html +++ b/orig/string/find_first_not_of.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,10 +73,10 @@

find_first_not_of

    #include <string>
-    size_type find_first_not_of( const string& str, size_type index = 0 );
-    size_type find_first_not_of( const char* str, size_type index = 0 );
-    size_type find_first_not_of( const char* str, size_type index, size_type num );
-    size_type find_first_not_of( char ch, size_type index = 0 );
+ size_type find_first_not_of( const string& str, size_type index = 0 ) const; + size_type find_first_not_of( const char* str, size_type index = 0 ) const; + size_type find_first_not_of( const char* str, size_type index, size_type num ) const; + size_type find_first_not_of( char ch, size_type index = 0 ) const;

The find_first_not_of() function either: @@ -110,7 +110,7 @@

find_first_not_of

-
+
@@ -124,7 +124,7 @@

find_first_not_of

@@ -151,6 +151,6 @@

find_first_not_of

-
+
diff --git a/orig/string/find_first_of.html b/orig/string/find_first_of.html index f46c097..83f6ddc 100644 --- a/orig/string/find_first_of.html +++ b/orig/string/find_first_of.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,10 +73,10 @@

find_first_of

Syntax: 

    #include <string>
-    size_type find_first_of( const string &str, size_type index = 0 );
-    size_type find_first_of( const char* str, size_type index = 0 );
-    size_type find_first_of( const char* str, size_type index, size_type num );
-    size_type find_first_of( char ch, size_type index = 0 );
+ size_type find_first_of( const string &str, size_type index = 0 ) const; + size_type find_first_of( const char* str, size_type index = 0 ) const; + size_type find_first_of( const char* str, size_type index, size_type num ) const; + size_type find_first_of( char ch, size_type index = 0 ) const;

The find_first_of function either: @@ -95,7 +95,7 @@

find_first_of

For example, the following code uses find_first_of to replace all the vowels in a string with asterisks: 

  string str = "In this house, we obey the laws of thermodynamics!";
-  size_type found = str.find_first_of("aeiouAEIOU");
+  string::size_type found = str.find_first_of("aeiouAEIOU");
  
   while( found != string::npos ) {
     str[found] = '*';
@@ -108,7 +108,7 @@ 
find_first_of
-
+
@@ -122,7 +122,7 @@

find_first_of

@@ -149,6 +149,6 @@

find_first_of

-
+
diff --git a/orig/string/find_last_not_of.html b/orig/string/find_last_not_of.html index 3ad57ba..284dba4 100644 --- a/orig/string/find_last_not_of.html +++ b/orig/string/find_last_not_of.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,10 +73,10 @@

find_last_not_of

Syntax: 

    #include <string>
-    size_type find_last_not_of( const string& str, size_type index = npos );
-    size_type find_last_not_of( const char* str, size_type index = npos );
-    size_type find_last_not_of( const char* str, size_type index, size_type num );
-    size_type find_last_not_of( char ch, size_type index = npos );
+ size_type find_last_not_of( const string& str, size_type index = npos ) const; + size_type find_last_not_of( const char* str, size_type index = npos ) const; + size_type find_last_not_of( const char* str, size_type index, size_type num ) const; + size_type find_last_not_of( char ch, size_type index = npos ) const;

The find_last_not_of() function either: @@ -112,7 +112,7 @@

find_last_not_of

-
+
@@ -126,7 +126,7 @@

find_last_not_of

@@ -153,6 +153,6 @@

find_last_not_of

-
+
diff --git a/orig/string/find_last_of.html b/orig/string/find_last_of.html index 61d51d8..1f4fcc9 100644 --- a/orig/string/find_last_of.html +++ b/orig/string/find_last_of.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,10 +73,10 @@

find_last_of

Syntax: 

    #include <string>
-    size_type find_last_of( const string& str, size_type index = npos );
-    size_type find_last_of( const char* str, size_type index = npos );
-    size_type find_last_of( const char* str, size_type index, size_type num );
-    size_type find_last_of( char ch, size_type index = npos );
+ size_type find_last_of( const string& str, size_type index = npos ) const; + size_type find_last_of( const char* str, size_type index = npos ) const; + size_type find_last_of( const char* str, size_type index, size_type num ) const; + size_type find_last_of( char ch, size_type index = npos ) const;

The find_last_of() function either: @@ -96,7 +96,7 @@

find_last_of

-
+
@@ -110,7 +110,7 @@

find_last_of

@@ -137,6 +137,6 @@

find_last_of

-
+
diff --git a/orig/string/getline.html b/orig/string/getline.html index a330a5f..b2448f3 100644 --- a/orig/string/getline.html +++ b/orig/string/getline.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -180,6 +180,6 @@

getline

-
+
diff --git a/orig/string/insert.html b/orig/string/insert.html index ebff76a..a4c52ab 100644 --- a/orig/string/insert.html +++ b/orig/string/insert.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,13 +73,13 @@

insert

Syntax: 

    #include <string>
-    iterator insert( iterator i, const char& ch );
+    iterator insert( iterator i, char ch );
     string& insert( size_type index, const string& str );
     string& insert( size_type index, const char* str );
     string& insert( size_type index1, const string& str, size_type index2, size_type num );
     string& insert( size_type index, const char* str, size_type num );
     string& insert( size_type index, size_type num, char ch );
-    void insert( iterator i, size_type num, const char& ch );
+    void insert( iterator i, size_type num, char ch );
     void insert( iterator i, input_iterator start, input_iterator end );

The very multi-purpose insert() function either: @@ -107,7 +107,7 @@

insert

-
+
@@ -121,7 +121,7 @@

insert

@@ -148,6 +148,6 @@

insert

-
+
diff --git a/orig/string/length.html b/orig/string/length.html index 66972eb..9fe69e5 100644 --- a/orig/string/length.html +++ b/orig/string/length.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -126,6 +126,6 @@

length

-
+
diff --git a/orig/string/max_size.html b/orig/string/max_size.html index 413cdbf..8b1d014 100644 --- a/orig/string/max_size.html +++ b/orig/string/max_size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -129,6 +129,6 @@

max_size

-
+
diff --git a/orig/string/operator.html b/orig/string/operator.html new file mode 100644 index 0000000..19096ea --- /dev/null +++ b/orig/string/operator.html @@ -0,0 +1,195 @@ + + + + + + String operators [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[String operators]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Strings » String operators
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

String operators

+
+ +

+Syntax: +

+
    #include <string>
+    bool operator==(const string& c1, const string& c2);
+    bool operator!=(const string& c1, const string& c2);
+    bool operator<(const string& c1, const string& c2);
+    bool operator>(const string& c1, const string& c2);
+    bool operator<=(const string& c1, const string& c2);
+    bool operator>=(const string& c1, const string& c2);
+    string operator+(const string& s1, const string& s2 );
+    string operator+(const char* s, const string& s2 );
+    string operator+( char c, const string& s2 );
+    string operator+( const string& s1, const char* s );
+    string operator+( const string& s1, char c );
+    string& operator+=(const string& append);
+    string& operator+=(const char* append);
+    string& operator+=(const char  append);
+    ostream& operator<<( ostream& os, const string& s );
+    istream& operator>>( istream& is, string& s );
+    string& operator=( const string& s );
+    string& operator=( const char* s );
+    string& operator=( char ch );
+    char& operator[]( size_type index );
+    const char& operator[]( size_type index ) const;
+

+C++ strings can be compared and assigned with the standard comparison +operators: ==, !=, <=, >=, <, >, and =. Performing a comparison or assigning +one string to another takes linear time. +

+ +

+Two strings are equal if: + +

+
    +
  1. Their size is the same, and
    +
    2. +
  2. Each member in location i in one string is equal to the the member in location i in the other string.
    +
    3. +
+ +

+ +Comparisons among strings are done lexicographically. +

+ +

+In addition to the normal container operators, strings can also be concatenated +with the + operator and fed to the C++ I/O stream classes with the << and >> +operators. +

+ +

+For example, the following code concatenates two strings and displays the +result: +

+
   string s1 = "Now is the time...";
+   string s2 = "for all good men...";
+   string s3 = s1 + s2;
+   cout << "s3 is " << s3 << endl;
+

+ +Futhermore, strings can be assigned values that are other strings, character +arrays, or even single characters. The following code is perfectly valid: +

+
   char ch = 'N';
+   string s;
+   s = ch;
+

+ +Individual characters of a string can be examined with the [] operator, which +runs in constant time. +

+ +

+Related Topics: c_str, compare, data +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/string/push_back.html b/orig/string/push_back.html index fb9f980..eca5d8b 100644 --- a/orig/string/push_back.html +++ b/orig/string/push_back.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -138,6 +138,6 @@

push_back

-
+
diff --git a/orig/string/rbegin.html b/orig/string/rbegin.html index fc7d383..36ae1b5 100644 --- a/orig/string/rbegin.html +++ b/orig/string/rbegin.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

rbegin

-
+
diff --git a/orig/string/rend.html b/orig/string/rend.html index cf1c930..95a94dd 100644 --- a/orig/string/rend.html +++ b/orig/string/rend.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

rend

-
+
diff --git a/orig/string/replace.html b/orig/string/replace.html index ebc17a8..c2bd6f1 100644 --- a/orig/string/replace.html +++ b/orig/string/replace.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -82,7 +82,8 @@

replace

string& replace( iterator start, iterator end, const string& str ); string& replace( iterator start, iterator end, const char* str ); string& replace( iterator start, iterator end, const char* str, size_type num ); - string& replace( iterator start, iterator end, size_type num, char ch ); + string& replace( iterator start, iterator end, size_type num, char ch ); + string& replace( iterator start, iterator end, input_iterator start2, input_iterator end2 );

The function replace() either: @@ -123,7 +124,7 @@

replace

-
+
@@ -137,7 +138,7 @@

replace

@@ -164,6 +165,6 @@

replace

-
+
diff --git a/orig/string/reserve.html b/orig/string/reserve.html index e52d8d0..79b1caf 100644 --- a/orig/string/reserve.html +++ b/orig/string/reserve.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,10 +73,11 @@

reserve

Syntax: 

    #include <string>
-    void reserve( size_type size );
+ void reserve( size_type size = 0 );

The reserve() function sets the capacity of the string to at least size. +A call of reserve() without an argument is a nonbinding shrink-to-fit request. reserve() runs in linear time.

@@ -85,7 +86,7 @@

reserve

-
+
@@ -99,7 +100,7 @@

reserve

@@ -126,6 +127,6 @@

reserve

-
+
diff --git a/orig/string/resize.html b/orig/string/resize.html index b8fc51d..d4a9ae4 100644 --- a/orig/string/resize.html +++ b/orig/string/resize.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

resize

Syntax: 

    #include <string>
-    void resize( size_type size, const TYPE& val = TYPE() );
+ void resize( size_type size, char val = char() );

The function resize() changes the size of the string to size. If val is @@ -87,7 +87,7 @@

resize

-
+
@@ -101,7 +101,7 @@

resize

@@ -128,6 +128,6 @@

resize

-
+
diff --git a/orig/string/rfind.html b/orig/string/rfind.html index 1cb78af..abda6cc 100644 --- a/orig/string/rfind.html +++ b/orig/string/rfind.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,10 +73,10 @@

rfind

Syntax: 

    #include <string>
-    size_type rfind( const string& str, size_type index );
-    size_type rfind( const char* str, size_type index );
-    size_type rfind( const char* str, size_type index, size_type num );
-    size_type rfind( char ch, size_type index );
+ size_type rfind( const string& str, size_type index ) const; + size_type rfind( const char* str, size_type index ) const; + size_type rfind( const char* str, size_type index, size_type num ) const; + size_type rfind( char ch, size_type index ) const;

The rfind() function either: @@ -110,7 +110,7 @@

rfind

-
+
@@ -124,7 +124,7 @@

rfind

@@ -151,6 +151,6 @@

rfind

-
+
diff --git a/orig/string/size.html b/orig/string/size.html index 707ea70..7744613 100644 --- a/orig/string/size.html +++ b/orig/string/size.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -128,6 +128,6 @@

size

-
+
diff --git a/orig/string/start.html b/orig/string/start.html index cba5d49..47e81a5 100644 --- a/orig/string/start.html +++ b/orig/string/start.html @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -93,10 +93,10 @@

C++ Strings

Constructorscreate vectors and initialize them with some dataConstructorscreate vectors and initialize them with some data
Operatorscompare, assign, and access elements of a vectorOperatorscompare, assign, and access elements of a vector
assignassign elements to a vector
- + - + @@ -238,6 +238,6 @@

C++ Strings

-
+
diff --git a/orig/string/string.html b/orig/string/string.html new file mode 100644 index 0000000..8fbd824 --- /dev/null +++ b/orig/string/string.html @@ -0,0 +1,171 @@ + + + + + + String constructors [C++ Reference] + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+ [[String constructors]] +
+ + +
+
+ + + +
+ You are here: C++ Reference » C++ Strings » String constructors
+ +
+ +
Translations of this page?:
+ + +
+ + + + + + + +

String constructors

+
+ +

+Syntax: +

+
    #include <string>
+    string();
+    string( const string& s );
+    string( size_type length, char ch );
+    string( const char* str );
+    string( const char* str, size_type length );
+    string( const string& str, size_type index, size_type length );
+    string( input_iterator start, input_iterator end );
+    ~string();
+

+ +The string constructors create a new string containing: + +

+
    +
  • nothing; an empty string,
    +
    • +
  • a copy of the given string s,
    +
    • +
  • length copies of ch,
    +
    • +
  • a duplicate of str (optionally up to length characters long),
    +
    • +
  • a substring of str starting at index and length characters long
    +
    • +
  • a string of characters denoted by the start and end iterators
    +
    • +
+ +

+ +For example, +

+
     string str1( 5, 'c' );
+     string str2( "Now is the time..." );
+     string str3( str2, 11, 4 );
+     cout << str1 << endl;
+     cout << str2 << endl;
+     cout << str3 << endl;
+

+ +displays +

+
     ccccc
+     Now is the time...
+     time
+

+ +The string constructors usually run in linear time, except the empty +constructor, which runs in constant time. +

+ +
+
+ +
+ +
 
+ + +
+ +
+
+
+ +
+ + +
+
+ Edit this page • + Old revisions
+
+ • + • + • + • + Index • + Recent changes • + RSS • + cc • +
  +
+
+
+ +
+ +
+ +
+ + diff --git a/orig/string/substr.html b/orig/string/substr.html index b23954c..d937056 100644 --- a/orig/string/substr.html +++ b/orig/string/substr.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

substr

Syntax: 

    #include <string>
-    string string::substr(size_type index, size_type length = npos);
+ string substr( size_type index, size_type length = npos ) const;

The substr() method returns a substring of the current string, starting at index, and length characters long.

@@ -104,7 +104,7 @@

substr

-
+
@@ -118,7 +118,7 @@

substr

@@ -145,6 +145,6 @@

substr

-
+
diff --git a/orig/string/swap.html b/orig/string/swap.html index 49e9bf8..8ee3bc3 100644 --- a/orig/string/swap.html +++ b/orig/string/swap.html @@ -9,8 +9,8 @@ - - + + @@ -51,7 +51,7 @@ -
Translations of this page?:
+
Translations of this page?:
@@ -73,7 +73,7 @@

swap

Syntax: 

    #include <string>
-    void swap( container& from );
+ void swap( string& from );

The swap() function exchanges the elements of the current string with those of @@ -97,7 +97,7 @@

swap

-
+
@@ -111,7 +111,7 @@

swap

@@ -138,6 +138,6 @@

swap

-
+
Constructorscreate strings from arrays of characters and other stringsConstructorscreate strings from arrays of characters and other strings
Operatorsconcatenate strings, assign strings, use strings for I/O, compare stringsOperatorsconcatenate strings, assign strings, use strings for I/O, compare strings
appendappend characters and strings onto a string