/usr/include/mysql++/vallist.h is in libmysql++-dev 3.2.1+pristine-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 | /// \file vallist.h
/// \brief Declares templates for holding lists of values.
/***********************************************************************
Copyright (c) 1998 by Kevin Atkinson, (c) 1999, 2000 and 2001 by
MySQL AB, and (c) 2004, 2005 by Educational Technology Resources, Inc.
Others may also hold copyrights on code in this file. See the CREDITS
file in the top directory of the distribution for details.
This file is part of MySQL++.
MySQL++ is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
MySQL++ is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public
License along with MySQL++; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
USA
***********************************************************************/
#if !defined(MYSQLPP_VALLIST_H)
#define MYSQLPP_VALLIST_H
#include "manip.h"
#include <string>
#include <vector>
namespace mysqlpp {
/// \brief Holds two lists of items, typically used to construct a
/// SQL "equals clause".
///
/// The WHERE clause in a SQL SELECT statment is an example of an
/// equals clause.
///
/// Imagine an object of this type contains the lists (a, b) (c, d),
/// and that the object's delimiter and equals symbols are set to ", "
/// and " = " respectively. When you insert that object into a C++
/// stream, you would get "a = c, b = d".
///
/// This class is never instantiated by hand. The equal_list()
/// functions build instances of this structure template to do their
/// work. MySQL++'s SSQLS mechanism calls those functions when
/// building SQL queries; you can call them yourself to do similar work.
/// The "Harnessing SSQLS Internals" section of the user manual has
/// some examples of this.
///
/// \sa equal_list_b
template <class Seq1, class Seq2, class Manip>
struct equal_list_ba
{
/// \brief the list of objects on the left-hand side of the
/// equals sign
const Seq1* list1;
/// \brief the list of objects on the right-hand side of the
/// equals sign
const Seq2* list2;
/// \brief delimiter to use between each pair of elements
const char* delim;
/// \brief "equal" sign to use between each item in each equal
/// pair; doesn't have to actually be " = "
const char* equl;
/// \brief manipulator to use when inserting the equal_list into
/// a C++ stream
Manip manip;
/// \brief Create object
///
/// \param s1 list of objects on left-hand side of equal sign
/// \param s2 list of objects on right-hand side of equal sign
/// \param d what delimiter to use between each group in the list
/// when inserting the list into a C++ stream
/// \param e the "equals" sign between each pair of items in the
/// equal list; doesn't actually have to be " = "!
/// \param m manipulator to use when inserting the list into a
/// C++ stream
equal_list_ba(const Seq1& s1, const Seq2& s2, const char* d,
const char* e, Manip m) :
list1(&s1),
list2(&s2),
delim(d),
equl(e),
manip(m)
{
}
};
/// \brief Same as equal_list_ba, plus the option to have some elements
/// of the equals clause suppressed.
///
/// Imagine an object of this type contains the lists (a, b, c)
/// (d, e, f), that the object's 'fields' list is (true, false, true),
/// and that the object's delimiter and equals symbols are set to
/// " AND " and " = " respectively. When you insert that object into a
/// C++ stream, you would get "a = d AND c = f".
///
/// See equal_list_ba's documentation for more details.
template <class Seq1, class Seq2, class Manip>
struct equal_list_b
{
/// \brief the list of objects on the left-hand side of the
/// equals sign
const Seq1* list1;
/// \brief the list of objects on the right-hand side of the
/// equals sign
const Seq2* list2;
/// \brief for each true item in the list, the pair in that position
/// will be inserted into a C++ stream
const std::vector<bool> fields;
/// \brief delimiter to use between each pair of elements
const char* delim;
/// \brief "equal" sign to use between each item in each equal
/// pair; doesn't have to actually be " = "
const char* equl;
/// \brief manipulator to use when inserting the equal_list into
/// a C++ stream
Manip manip;
/// \brief Create object
///
/// \param s1 list of objects on left-hand side of equal sign
/// \param s2 list of objects on right-hand side of equal sign
/// \param f for each true item in the list, the pair of items
/// in that position will be inserted into a C++ stream
/// \param d what delimiter to use between each group in the list
/// when inserting the list into a C++ stream
/// \param e the "equals" sign between each pair of items in the
/// equal list; doesn't actually have to be " = "!
/// \param m manipulator to use when inserting the list into a
/// C++ stream
equal_list_b(const Seq1& s1, const Seq2& s2,
const std::vector<bool>& f, const char* d,
const char* e, Manip m) :
list1(&s1),
list2(&s2),
fields(f),
delim(d),
equl(e),
manip(m)
{
}
};
/// \brief Holds a list of items, typically used to construct a SQL
/// "value list".
///
/// The SQL INSERT statement has a VALUES clause; this class can
/// be used to construct the list of items for that clause.
///
/// Imagine an object of this type contains the list (a, b, c), and
/// that the object's delimiter symbol is set to ", ". When you
/// insert that object into a C++ stream, you would get "a, b, c".
///
/// This class is never instantiated by hand. The value_list()
/// functions build instances of this structure template to do their
/// work. MySQL++'s SSQLS mechanism calls those functions when
/// building SQL queries; you can call them yourself to do similar work.
/// The "Harnessing SSQLS Internals" section of the user manual has
/// some examples of this.
///
/// \sa value_list_b
template <class Seq, class Manip>
struct value_list_ba
{
/// \brief set of objects in the value list
const Seq* list;
/// \brief delimiter to use between each value in the list when
/// inserting it into a C++ stream
const char* delim;
/// \brief manipulator to use when inserting the list into a
/// C++ stream
Manip manip;
/// \brief Create object
///
/// \param s set of objects in the value list
/// \param d what delimiter to use between each value in the list
/// when inserting the list into a C++ stream
/// \param m manipulator to use when inserting the list into a
/// C++ stream
value_list_ba(const Seq& s, const char* d, Manip m) :
list(&s),
delim(d),
manip(m)
{
}
};
/// \brief Same as value_list_ba, plus the option to have some elements
/// of the list suppressed.
///
/// Imagine an object of this type contains the list (a, b, c), that
/// the object's 'fields' list is (true, false, true), and that the
/// object's delimiter is set to ":". When you insert that object
/// into a C++ stream, you would get "a:c".
///
/// See value_list_ba's documentation for more details.
template <class Seq, class Manip>
struct value_list_b
{
/// \brief set of objects in the value list
const Seq* list;
/// \brief delimiter to use between each value in the list when
/// inserting it into a C++ stream
const std::vector<bool> fields;
/// \brief delimiter to use between each value in the list when
/// inserting it into a C++ stream
const char* delim;
/// \brief manipulator to use when inserting the list into a C++
/// stream
Manip manip;
/// \brief Create object
///
/// \param s set of objects in the value list
/// \param f for each true item in the list, the list item
/// in that position will be inserted into a C++ stream
/// \param d what delimiter to use between each value in the list
/// when inserting the list into a C++ stream
/// \param m manipulator to use when inserting the list into a
/// C++ stream
value_list_b(const Seq& s, const std::vector<bool>& f,
const char* d, Manip m) :
list(&s),
fields(f),
delim(d),
manip(m)
{
}
};
/// \brief Inserts an equal_list_ba into an std::ostream.
///
/// Given two lists (a, b) and (c, d), a delimiter D, and an equals
/// symbol E, this operator will insert "aEcDbEd" into the stream.
///
/// See equal_list_ba's documentation for concrete examples.
///
/// \sa equal_list()
template <class Seq1, class Seq2, class Manip>
std::ostream& operator <<(std::ostream& o,
const equal_list_ba<Seq1, Seq2, Manip>& el)
{
typename Seq1::const_iterator i = el.list1->begin();
typename Seq2::const_iterator j = el.list2->begin();
while (1) {
o << *i << el.equl << el.manip << *j;
if ((++i == el.list1->end()) || (++j == el.list2->end())) {
break;
}
o << el.delim;
}
return o;
}
/// \brief Same as operator<< for equal_list_ba, plus the option to
/// suppress insertion of some list items in the stream.
///
/// See equal_list_b's documentation for examples of how this works.
template <class Seq1, class Seq2, class Manip>
std::ostream& operator <<(std::ostream& o,
const equal_list_b <Seq1, Seq2, Manip>& el)
{
typename Seq1::const_iterator i = el.list1->begin();
typename Seq2::const_iterator j = el.list2->begin();
int k = 0;
while (1) {
if (el.fields[k++]) {
o << *i << el.equl << el.manip << *j;
}
if ((++i == el.list1->end()) || (++j == el.list2->end())) {
break;
}
if (el.fields[k]) {
o << el.delim;
}
}
return o;
}
/// \brief Inserts a value_list_ba into an std::ostream.
///
/// Given a list (a, b) and a delimiter D, this operator will insert
/// "aDb" into the stream.
///
/// See value_list_ba's documentation for concrete examples.
///
/// \sa value_list()
template <class Seq, class Manip>
std::ostream& operator <<(std::ostream& o,
const value_list_ba<Seq, Manip>& cl)
{
typename Seq::const_iterator i = cl.list->begin();
while (1) {
o << cl.manip << *i;
if (++i == cl.list->end()) {
break;
}
o << cl.delim;
}
return o;
}
/// \brief Same as operator<< for value_list_ba, plus the option to
/// suppress insertion of some list items in the stream.
///
/// See value_list_b's documentation for examples of how this works.
template <class Seq, class Manip>
std::ostream& operator <<(std::ostream& o,
const value_list_b<Seq, Manip>& cl)
{
typename Seq::const_iterator i = cl.list->begin();
int k = 0;
while (1) {
if (cl.fields[k++]) {
o << cl.manip << *i;
}
if (++i == cl.list->end()) {
break;
}
if (cl.fields[k]) {
o << cl.delim;
}
}
return o;
}
/// \brief Create a vector of bool with the given arguments as values.
///
/// This function takes up to 13 bools, with the size parameter
/// controlling the actual number of parameters we pay attention to.
///
/// This function is used within the library to build the vector used
/// in calling the vector form of Row::equal_list(), Row::value_list(),
/// and Row::field_list(). See the "Harnessing SSQLS Internals" section
/// of the user manual to see that feature at work.
void create_vector(size_t size, std::vector<bool>& v, bool t0,
bool t1 = false, bool t2 = false, bool t3 = false,
bool t4 = false, bool t5 = false, bool t6 = false,
bool t7 = false, bool t8 = false, bool t9 = false,
bool ta = false, bool tb = false, bool tc = false);
/// \brief Create a vector of bool using a list of named fields.
///
/// This function is used with the ResUse and Result containers,
/// which have a field_num() member function that maps a field name
/// to its position number. So for each named field, we set the
/// bool in the vector at the corresponding position to true.
///
/// This function is used within the library to build the vector used
/// in calling the vector form of Row::equal_list(), Row::value_list(),
/// and Row::field_list(). See the "Harnessing SSQLS Internals" section
/// of the user manual to see that feature at work.
template <class Container>
void create_vector(const Container& c, std::vector<bool>& v,
std::string s0, std::string s1, std::string s2,
std::string s3, std::string s4, std::string s5,
std::string s6, std::string s7, std::string s8,
std::string s9, std::string sa, std::string sb,
std::string sc);
/// \brief Constructs a value_list_ba
///
/// This function returns a value list that uses the 'do_nothing'
/// manipulator. That is, the items are not quoted or escaped in any
/// way. See value_list(Seq, const char*, Manip) if you need to
/// specify a manipulator.
///
/// \param s an STL sequence of items in the value list
/// \param d delimiter operator<< should place between items
template <class Seq>
value_list_ba<Seq, do_nothing_type0>
value_list(const Seq& s, const char* d = ",")
{
return value_list_ba<Seq, do_nothing_type0>(s, d, do_nothing);
}
/// \brief Constructs a value_list_ba
///
/// \param s an STL sequence of items in the value list
/// \param d delimiter operator<< should place between items
/// \param m manipulator to use when inserting items into a stream
template <class Seq, class Manip>
value_list_ba<Seq, Manip>
value_list(const Seq& s, const char* d, Manip m)
{
return value_list_ba<Seq, Manip>(s, d, m);
}
/// \brief Constructs a value_list_b (sparse value list)
///
/// \param s an STL sequence of items in the value list
/// \param d delimiter operator<< should place between items
/// \param m manipulator to use when inserting items into a stream
/// \param vb for each item in this vector that is true, the
/// corresponding item in the value list is inserted into a stream;
/// the others are suppressed
template <class Seq, class Manip>
inline value_list_b<Seq, Manip>
value_list(const Seq& s, const char* d, Manip m,
const std::vector<bool>& vb)
{
return value_list_b<Seq, Manip>(s, vb, d, m);
}
/// \brief Constructs a value_list_b (sparse value list)
///
/// Same as value_list(Seq&, const char*, Manip, const vector<bool>&),
/// except that it takes the bools as arguments instead of wrapped up
/// in a vector object.
template <class Seq, class Manip>
value_list_b<Seq, Manip>
value_list(const Seq& s, const char* d, Manip m, bool t0,
bool t1 = false, bool t2 = false, bool t3 = false,
bool t4 = false, bool t5 = false, bool t6 = false,
bool t7 = false, bool t8 = false, bool t9 = false,
bool ta = false, bool tb = false, bool tc = false)
{
std::vector<bool> vb;
create_vector(s.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8, t9,
ta, tb, tc);
return value_list_b<Seq, Manip>(s, vb, d, m);
}
/// \brief Constructs a sparse value list
///
/// Same as value_list(Seq&, const char*, Manip, bool, bool...) but
/// without the Manip parameter. We use the do_nothing manipulator,
/// meaning that the value list items are neither escaped nor quoted
/// when being inserted into a stream.
template <class Seq>
value_list_b<Seq, do_nothing_type0>
value_list(const Seq& s, const char* d, bool t0,
bool t1 = false, bool t2 = false, bool t3 = false,
bool t4 = false, bool t5 = false, bool t6 = false,
bool t7 = false, bool t8 = false, bool t9 = false,
bool ta = false, bool tb = false, bool tc = false)
{
std::vector<bool> vb;
create_vector(s.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8, t9,
ta, tb, tc);
return value_list_b<Seq, do_nothing_type0>(s, vb, d, do_nothing);
}
/// \brief Constructs a sparse value list
///
/// Same as value_list(Seq&, const char*, Manip, bool, bool...) but
/// without the Manip or delimiter parameters. We use the do_nothing
/// manipulator, meaning that the value list items are neither escaped
/// nor quoted when being inserted into a stream. The delimiter is a
/// comma. This form is suitable for lists of simple data, such as
/// integers.
template <class Seq>
value_list_b<Seq, do_nothing_type0>
value_list(const Seq& s, bool t0,
bool t1 = false, bool t2 = false, bool t3 = false,
bool t4 = false, bool t5 = false, bool t6 = false,
bool t7 = false, bool t8 = false, bool t9 = false,
bool ta = false, bool tb = false, bool tc = false)
{
std::vector<bool> vb;
create_vector(s.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8, t9,
ta, tb, tc);
return value_list_b<Seq, do_nothing_type0>(s, vb, ",", do_nothing);
}
/// \brief Constructs an equal_list_ba
///
/// This function returns an equal list that uses the 'do_nothing'
/// manipulator. That is, the items are not quoted or escaped in any
/// way when inserted into a stream. See equal_list(Seq, Seq,
/// const char*, const char*, Manip) if you need a different
/// manipulator.
///
/// The idea is for both lists to be of equal length because
/// corresponding elements from each list are handled as pairs, but if
/// one list is shorter than the other, the generated list will have
/// that many elements.
///
/// \param s1 items on the left side of the equals sign when the
/// equal list is inserted into a stream
/// \param s2 items on the right side of the equals sign
/// \param d delimiter operator<< should place between pairs
/// \param e what operator<< should place between items in each pair;
/// by default, an equals sign, as that is the primary use for this
/// mechanism.
template <class Seq1, class Seq2>
equal_list_ba<Seq1, Seq2, do_nothing_type0>
equal_list(const Seq1& s1, const Seq2& s2, const char *d = ",",
const char *e = " = ")
{
return equal_list_ba<Seq1, Seq2, do_nothing_type0>(s1, s2, d,
e, do_nothing);
}
/// \brief Constructs an equal_list_ba
///
/// Same as equal_list(Seq&, Seq&, const char*, const char*) except that
/// it also lets you specify the manipulator. Use this version if the
/// data must be escaped or quoted when being inserted into a stream.
template <class Seq1, class Seq2, class Manip>
equal_list_ba<Seq1, Seq2, Manip>
equal_list(const Seq1& s1, const Seq2& s2, const char* d,
const char* e, Manip m)
{
return equal_list_ba<Seq1, Seq2, Manip>(s1, s2, d, e, m);
}
/// \brief Constructs a equal_list_b (sparse equal list)
///
/// Same as equal_list(Seq&, Seq&, const char*, const char*, Manip) except
/// that you can pass a vector of bools. For each true item in that
/// list, operator<< adds the corresponding item is put in the equal
/// list. This lets you pass in sequences when you don't want all of
/// the elements to be inserted into a stream.
template <class Seq1, class Seq2, class Manip>
equal_list_b<Seq1, Seq2, Manip>
equal_list(const Seq1& s1, const Seq2& s2, const char* d,
const char *e, Manip m, const std::vector<bool>& vb)
{
return equal_list_b<Seq1, Seq2, Manip>(s1, s2, vb, d, e, m);
}
/// \brief Constructs a equal_list_b (sparse equal list)
///
/// Same as equal_list(Seq&, Seq&, const char*, const char*, Manip,
/// vector<bool>&) except that it takes boolean parameters
/// instead of a list of bools.
template <class Seq1, class Seq2, class Manip>
equal_list_b<Seq1, Seq2, Manip>
equal_list(const Seq1& s1, const Seq2& s2, const char* d,
const char* e, Manip m, bool t0, bool t1 = false,
bool t2 = false, bool t3 = false, bool t4 = false,
bool t5 = false, bool t6 = false, bool t7 = false,
bool t8 = false, bool t9 = false, bool ta = false,
bool tb = false, bool tc = false)
{
std::vector<bool> vb;
create_vector(s1.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8,
t9, ta, tb, tc);
return equal_list_b<Seq1, Seq2, Manip>(s1, s2, vb, d, e, m);
}
/// \brief Constructs a equal_list_b (sparse equal list)
///
/// Same as equal_list(Seq&, Seq&, const char*, const char*, Manip,
/// bool, bool...) except that it doesn't take the Manip argument.
/// It uses the do_nothing manipulator instead, meaning that none of
/// the elements are escaped when being inserted into a stream.
template <class Seq1, class Seq2>
equal_list_b<Seq1, Seq2, do_nothing_type0>
equal_list(const Seq1& s1, const Seq2& s2, const char* d,
const char* e, bool t0, bool t1 = false, bool t2 = false,
bool t3 = false, bool t4 = false, bool t5 = false,
bool t6 = false, bool t7 = false, bool t8 = false,
bool t9 = false, bool ta = false, bool tb = false,
bool tc = false)
{
std::vector<bool> vb;
create_vector(s1.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8,
t9, ta, tb, tc);
return equal_list_b<Seq1, Seq2, do_nothing_type0>(s1, s2, vb,
d, e, do_nothing);
}
/// \brief Constructs a equal_list_b (sparse equal list)
///
/// Same as equal_list(Seq&, Seq&, const char*, const char*, bool,
/// bool...) except that it doesn't take the second const char*
/// argument. It uses " = " for the equals symbol.
template <class Seq1, class Seq2>
equal_list_b<Seq1, Seq2, do_nothing_type0>
equal_list(const Seq1& s1, const Seq2& s2, const char* d, bool t0,
bool t1 = false, bool t2 = false, bool t3 = false,
bool t4 = false, bool t5 = false, bool t6 = false,
bool t7 = false, bool t8 = false, bool t9 = false,
bool ta = false, bool tb = false, bool tc = false)
{
std::vector<bool> vb;
create_vector(s1.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8,
t9, ta, tb, tc);
return equal_list_b<Seq1, Seq2, do_nothing_type0>(s1, s2, vb,
d, " = ", do_nothing);
}
/// \brief Constructs a equal_list_b (sparse equal list)
///
/// Same as equal_list(Seq&, Seq&, const char*, bool, bool...) except
/// that it doesn't take the const char* argument. It uses a comma for
/// the delimiter. This form is useful for building simple equals
/// lists, where no manipulators are necessary, and the default
/// delimiter and equals symbol are suitable.
template <class Seq1, class Seq2>
equal_list_b<Seq1, Seq2, do_nothing_type0>
equal_list(const Seq1& s1, const Seq2& s2, bool t0, bool t1 = false,
bool t2 = false, bool t3 = false, bool t4 = false,
bool t5 = false, bool t6 = false, bool t7 = false,
bool t8 = false, bool t9 = false, bool ta = false,
bool tb = false, bool tc = false)
{
std::vector<bool> vb;
create_vector(s1.size(), vb, t0, t1, t2, t3, t4, t5, t6, t7, t8,
t9, ta, tb, tc);
return equal_list_b<Seq1, Seq2, do_nothing_type0>(s1, s2, vb,
",", " = ", do_nothing);
}
} // end namespace mysqlpp
#endif // !defined(MYSQLPP_VALLIST_H)
|