diff options
Diffstat (limited to 'rep/usr/include')
103 files changed, 0 insertions, 54713 deletions
diff --git a/rep/usr/include/apt-pkg/acquire.h.gcov.html b/rep/usr/include/apt-pkg/acquire.h.gcov.html deleted file mode 100644 index e55d6ed..0000000 --- a/rep/usr/include/apt-pkg/acquire.h.gcov.html +++ /dev/null @@ -1,835 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/acquire.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - acquire.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">5</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: acquire.h,v 1.29.2.1 2003/12/24 23:09:17 mdz Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : Acquire - File Acquiration -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : This module contians the Acquire system. It is responsible for bringing -<span class="lineNum"> 9 </span> : files into the local pathname space. It deals with URIs for files and -<span class="lineNum"> 10 </span> : URI handlers responsible for downloading or finding the URIs. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : Each file to download is represented by an Acquire::Item class subclassed -<span class="lineNum"> 13 </span> : into a specialization. The Item class can add itself to several URI -<span class="lineNum"> 14 </span> : acquire queues each prioritized by the download scheduler. When the -<span class="lineNum"> 15 </span> : system is run the proper URI handlers are spawned and the the acquire -<span class="lineNum"> 16 </span> : queues are fed into the handlers by the schedular until the queues are -<span class="lineNum"> 17 </span> : empty. This allows for an Item to be downloaded from an alternate source -<span class="lineNum"> 18 </span> : if the first try turns out to fail. It also alows concurrent downloading -<span class="lineNum"> 19 </span> : of multiple items from multiple sources as well as dynamic balancing -<span class="lineNum"> 20 </span> : of load between the sources. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : Schedualing of downloads is done on a first ask first get basis. This -<span class="lineNum"> 23 </span> : preserves the order of the download as much as possible. And means the -<span class="lineNum"> 24 </span> : fastest source will tend to process the largest number of files. -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : Internal methods and queues for performing gzip decompression, -<span class="lineNum"> 27 </span> : md5sum hashing and file copying are provided to allow items to apply -<span class="lineNum"> 28 </span> : a number of transformations to the data files they are working with. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : ##################################################################### */ -<span class="lineNum"> 31 </span> : /*}}}*/ -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /** \defgroup acquire Acquire system -<span class="lineNum"> 34 </span> : * -<span class="lineNum"> 35 </span> : * \brief The Acquire system is responsible for retrieving files from -<span class="lineNum"> 36 </span> : * local or remote URIs and postprocessing them (for instance, -<span class="lineNum"> 37 </span> : * verifying their authenticity). The core class in this system is -<span class="lineNum"> 38 </span> : * pkgAcquire, which is responsible for managing the download queues -<span class="lineNum"> 39 </span> : * during the download. There is at least one download queue for -<span class="lineNum"> 40 </span> : * each supported protocol; protocols such as http may provide one -<span class="lineNum"> 41 </span> : * queue per host. -<span class="lineNum"> 42 </span> : * -<span class="lineNum"> 43 </span> : * Each file to download is represented by a subclass of -<span class="lineNum"> 44 </span> : * pkgAcquire::Item. The files add themselves to the download -<span class="lineNum"> 45 </span> : * queue(s) by providing their URI information to -<span class="lineNum"> 46 </span> : * pkgAcquire::Item::QueueURI, which calls pkgAcquire::Enqueue. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Once the system is set up, the Run method will spawn subprocesses -<span class="lineNum"> 49 </span> : * to handle the enqueued URIs; the scheduler will then take items -<span class="lineNum"> 50 </span> : * from the queues and feed them into the handlers until the queues -<span class="lineNum"> 51 </span> : * are empty. -<span class="lineNum"> 52 </span> : * -<span class="lineNum"> 53 </span> : * \todo Acquire supports inserting an object into several queues at -<span class="lineNum"> 54 </span> : * once, but it is not clear what its behavior in this case is, and -<span class="lineNum"> 55 </span> : * no subclass of pkgAcquire::Item seems to actually use this -<span class="lineNum"> 56 </span> : * capability. -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : /** \addtogroup acquire -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * @{ -<span class="lineNum"> 62 </span> : * -<span class="lineNum"> 63 </span> : * \file acquire.h -<span class="lineNum"> 64 </span> : */ -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : #ifndef PKGLIB_ACQUIRE_H -<span class="lineNum"> 67 </span> : #define PKGLIB_ACQUIRE_H -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : #include <vector> -<span class="lineNum"> 70 </span> : #include <string> -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : using std::vector; -<span class="lineNum"> 73 </span> : using std::string; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : #include <sys/time.h> -<span class="lineNum"> 77 </span> : #include <unistd.h> -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : class pkgAcquireStatus; -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : /** \brief The core download scheduler. -<span class="lineNum"> 82 </span> : * -<span class="lineNum"> 83 </span> : * This class represents an ongoing download. It manages the lists -<span class="lineNum"> 84 </span> : * of active and pending downloads and handles setting up and tearing -<span class="lineNum"> 85 </span> : * down download-related structures. -<span class="lineNum"> 86 </span> : * -<span class="lineNum"> 87 </span> : * \todo Why all the protected data items and methods? -<span class="lineNum"> 88 </span> : */ -<span class="lineNum"> 89 </span> : class pkgAcquire -<span class="lineNum"> 90 </span> : { -<span class="lineNum"> 91 </span> : public: -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : class Item; -<span class="lineNum"> 94 </span> : class Queue; -<span class="lineNum"> 95 </span> : class Worker; -<span class="lineNum"> 96 </span> : struct MethodConfig; -<span class="lineNum"> 97 </span> : struct ItemDesc; -<span class="lineNum"> 98 </span> : friend class Item; -<span class="lineNum"> 99 </span> : friend class Queue; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : typedef vector<Item *>::iterator ItemIterator; -<span class="lineNum"> 102 </span> : typedef vector<Item *>::const_iterator ItemCIterator; -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : protected: -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : /** \brief A list of items to download. -<span class="lineNum"> 107 </span> : * -<span class="lineNum"> 108 </span> : * This is built monotonically as items are created and only -<span class="lineNum"> 109 </span> : * emptied when the download shuts down. -<span class="lineNum"> 110 </span> : */ -<span class="lineNum"> 111 </span> : vector<Item *> Items; -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : /** \brief The head of the list of active queues. -<span class="lineNum"> 114 </span> : * -<span class="lineNum"> 115 </span> : * \todo why a hand-managed list of queues instead of std::list or -<span class="lineNum"> 116 </span> : * std::set? -<span class="lineNum"> 117 </span> : */ -<span class="lineNum"> 118 </span> : Queue *Queues; -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : /** \brief The head of the list of active workers. -<span class="lineNum"> 121 </span> : * -<span class="lineNum"> 122 </span> : * \todo why a hand-managed list of workers instead of std::list -<span class="lineNum"> 123 </span> : * or std::set? -<span class="lineNum"> 124 </span> : */ -<span class="lineNum"> 125 </span> : Worker *Workers; -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : /** \brief The head of the list of acquire method configurations. -<span class="lineNum"> 128 </span> : * -<span class="lineNum"> 129 </span> : * Each protocol (http, ftp, gzip, etc) via which files can be -<span class="lineNum"> 130 </span> : * fetched can have a representation in this list. The -<span class="lineNum"> 131 </span> : * configuration data is filled in by parsing the 100 Capabilities -<span class="lineNum"> 132 </span> : * string output by a method on startup (see -<span class="lineNum"> 133 </span> : * pkgAcqMethod::pkgAcqMethod and pkgAcquire::GetConfig). -<span class="lineNum"> 134 </span> : * -<span class="lineNum"> 135 </span> : * \todo why a hand-managed config dictionary instead of std::map? -<span class="lineNum"> 136 </span> : */ -<span class="lineNum"> 137 </span> : MethodConfig *Configs; -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : /** \brief The progress indicator for this download. */ -<span class="lineNum"> 140 </span> : pkgAcquireStatus *Log; -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : /** \brief The total size of the files which are to be fetched. -<span class="lineNum"> 143 </span> : * -<span class="lineNum"> 144 </span> : * This is not necessarily the total number of bytes to download -<span class="lineNum"> 145 </span> : * when, e.g., download resumption and list updates via patches -<span class="lineNum"> 146 </span> : * are taken into account. -<span class="lineNum"> 147 </span> : */ -<span class="lineNum"> 148 </span> : unsigned long ToFetch; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : // Configurable parameters for the scheduler -<span class="lineNum"> 151 </span> : -<span class="lineNum"> 152 </span> : /** \brief Represents the queuing strategy for remote URIs. */ -<span class="lineNum"> 153 </span> : enum QueueStrategy { -<span class="lineNum"> 154 </span> : /** \brief Generate one queue for each protocol/host combination; downloads from -<span class="lineNum"> 155 </span> : * multiple hosts can proceed in parallel. -<span class="lineNum"> 156 </span> : */ -<span class="lineNum"> 157 </span> : QueueHost, -<span class="lineNum"> 158 </span> : /** \brief Generate a single queue for each protocol; serialize -<span class="lineNum"> 159 </span> : * downloads from multiple hosts. -<span class="lineNum"> 160 </span> : */ -<span class="lineNum"> 161 </span> : QueueAccess} QueueMode; -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : /** \brief If \b true, debugging information will be dumped to std::clog. */ -<span class="lineNum"> 164 </span> : bool Debug; -<span class="lineNum"> 165 </span> : /** \brief If \b true, a download is currently in progress. */ -<span class="lineNum"> 166 </span> : bool Running; -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : /** \brief Add the given item to the list of items. */ -<span class="lineNum"> 169 </span> : void Add(Item *Item); -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : /** \brief Remove the given item from the list of items. */ -<span class="lineNum"> 172 </span> : void Remove(Item *Item); -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : /** \brief Add the given worker to the list of workers. */ -<span class="lineNum"> 175 </span> : void Add(Worker *Work); -<span class="lineNum"> 176 </span> : -<span class="lineNum"> 177 </span> : /** \brief Remove the given worker from the list of workers. */ -<span class="lineNum"> 178 </span> : void Remove(Worker *Work); -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : /** \brief Insert the given fetch request into the appropriate queue. -<span class="lineNum"> 181 </span> : * -<span class="lineNum"> 182 </span> : * \param Item The URI to download and the item to download it -<span class="lineNum"> 183 </span> : * for. Copied by value into the queue; no reference to Item is -<span class="lineNum"> 184 </span> : * retained. -<span class="lineNum"> 185 </span> : */ -<span class="lineNum"> 186 </span> : void Enqueue(ItemDesc &Item); -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /** \brief Remove all fetch requests for this item from all queues. */ -<span class="lineNum"> 189 </span> : void Dequeue(Item *Item); -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : /** \brief Determine the fetch method and queue of a URI. -<span class="lineNum"> 192 </span> : * -<span class="lineNum"> 193 </span> : * \param URI The URI to fetch. -<span class="lineNum"> 194 </span> : * -<span class="lineNum"> 195 </span> : * \param[out] Config A location in which to place the method via -<span class="lineNum"> 196 </span> : * which the URI is to be fetched. -<span class="lineNum"> 197 </span> : * -<span class="lineNum"> 198 </span> : * \return the string-name of the queue in which a fetch request -<span class="lineNum"> 199 </span> : * for the given URI should be placed. -<span class="lineNum"> 200 </span> : */ -<span class="lineNum"> 201 </span> : string QueueName(string URI,MethodConfig const *&Config); -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : /** \brief Build up the set of file descriptors upon which select() should -<span class="lineNum"> 204 </span> : * block. -<span class="lineNum"> 205 </span> : * -<span class="lineNum"> 206 </span> : * The default implementation inserts the file descriptors -<span class="lineNum"> 207 </span> : * corresponding to active downloads. -<span class="lineNum"> 208 </span> : * -<span class="lineNum"> 209 </span> : * \param[out] Fd The largest file descriptor in the generated sets. -<span class="lineNum"> 210 </span> : * -<span class="lineNum"> 211 </span> : * \param[out] RSet The set of file descriptors that should be -<span class="lineNum"> 212 </span> : * watched for input. -<span class="lineNum"> 213 </span> : * -<span class="lineNum"> 214 </span> : * \param[out] WSet The set of file descriptors that should be -<span class="lineNum"> 215 </span> : * watched for output. -<span class="lineNum"> 216 </span> : */ -<span class="lineNum"> 217 </span> : virtual void SetFds(int &Fd,fd_set *RSet,fd_set *WSet); -<span class="lineNum"> 218 </span> : -<span class="lineNum"> 219 </span> : /** Handle input from and output to file descriptors which select() -<span class="lineNum"> 220 </span> : * has determined are ready. The default implementation -<span class="lineNum"> 221 </span> : * dispatches to all active downloads. -<span class="lineNum"> 222 </span> : * -<span class="lineNum"> 223 </span> : * \param RSet The set of file descriptors that are ready for -<span class="lineNum"> 224 </span> : * input. -<span class="lineNum"> 225 </span> : * -<span class="lineNum"> 226 </span> : * \param WSet The set of file descriptors that are ready for -<span class="lineNum"> 227 </span> : * output. -<span class="lineNum"> 228 </span> : */ -<span class="lineNum"> 229 </span> : virtual void RunFds(fd_set *RSet,fd_set *WSet); -<span class="lineNum"> 230 </span> : -<span class="lineNum"> 231 </span> : /** \brief Check for idle queues with ready-to-fetch items. -<span class="lineNum"> 232 </span> : * -<span class="lineNum"> 233 </span> : * Called by pkgAcquire::Queue::Done each time an item is dequeued -<span class="lineNum"> 234 </span> : * but remains on some queues; i.e., another queue should start -<span class="lineNum"> 235 </span> : * fetching it. -<span class="lineNum"> 236 </span> : */ -<span class="lineNum"> 237 </span> : void Bump(); -<span class="lineNum"> 238 </span> : -<span class="lineNum"> 239 </span> : public: -<span class="lineNum"> 240 </span> : -<span class="lineNum"> 241 </span> : /** \brief Retrieve information about a fetch method by name. -<span class="lineNum"> 242 </span> : * -<span class="lineNum"> 243 </span> : * \param Access The name of the method to look up. -<span class="lineNum"> 244 </span> : * -<span class="lineNum"> 245 </span> : * \return the method whose name is Access, or \b NULL if no such method exists. -<span class="lineNum"> 246 </span> : */ -<span class="lineNum"> 247 </span> : MethodConfig *GetConfig(string Access); -<span class="lineNum"> 248 </span> : -<span class="lineNum"> 249 </span> : /** \brief Provides information on how a download terminated. */ -<span class="lineNum"> 250 </span> : enum RunResult { -<span class="lineNum"> 251 </span> : /** \brief All files were fetched successfully. */ -<span class="lineNum"> 252 </span> : Continue, -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : /** \brief Some files failed to download. */ -<span class="lineNum"> 255 </span> : Failed, -<span class="lineNum"> 256 </span> : -<span class="lineNum"> 257 </span> : /** \brief The download was cancelled by the user (i.e., #Log's -<span class="lineNum"> 258 </span> : * pkgAcquireStatus::Pulse() method returned \b false). -<span class="lineNum"> 259 </span> : */ -<span class="lineNum"> 260 </span> : Cancelled}; -<span class="lineNum"> 261 </span> : -<span class="lineNum"> 262 </span> : /** \brief Download all the items that have been Add()ed to this -<span class="lineNum"> 263 </span> : * download process. -<span class="lineNum"> 264 </span> : * -<span class="lineNum"> 265 </span> : * This method will block until the download completes, invoking -<span class="lineNum"> 266 </span> : * methods on #Log to report on the progress of the download. -<span class="lineNum"> 267 </span> : * -<span class="lineNum"> 268 </span> : * \param PulseInterval The method pkgAcquireStatus::Pulse will be -<span class="lineNum"> 269 </span> : * invoked on #Log at intervals of PulseInterval milliseconds. -<span class="lineNum"> 270 </span> : * -<span class="lineNum"> 271 </span> : * \return the result of the download. -<span class="lineNum"> 272 </span> : */ -<span class="lineNum"> 273 </span> : RunResult Run(int PulseInterval=500000); -<span class="lineNum"> 274 </span> : -<span class="lineNum"> 275 </span> : /** \brief Remove all items from this download process, terminate -<span class="lineNum"> 276 </span> : * all download workers, and empty all queues. -<span class="lineNum"> 277 </span> : */ -<span class="lineNum"> 278 </span> : void Shutdown(); -<span class="lineNum"> 279 </span> : -<span class="lineNum"> 280 </span> : /** \brief Get the first #Worker object. -<span class="lineNum"> 281 </span> : * -<span class="lineNum"> 282 </span> : * \return the first active worker in this download process. -<span class="lineNum"> 283 </span> : */ -<span class="lineNum"> 284 </span> : inline Worker *WorkersBegin() {return Workers;}; -<span class="lineNum"> 285 </span> : -<span class="lineNum"> 286 </span> : /** \brief Advance to the next #Worker object. -<span class="lineNum"> 287 </span> : * -<span class="lineNum"> 288 </span> : * \return the worker immediately following I, or \b NULL if none -<span class="lineNum"> 289 </span> : * exists. -<span class="lineNum"> 290 </span> : */ -<span class="lineNum"> 291 </span> : Worker *WorkerStep(Worker *I); -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : /** \brief Get the head of the list of items. */ -<span class="lineNum"> 294 </span> : inline ItemIterator ItemsBegin() {return Items.begin();}; -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : /** \brief Get the end iterator of the list of items. */ -<span class="lineNum"> 297 </span> : inline ItemIterator ItemsEnd() {return Items.end();}; -<span class="lineNum"> 298 </span> : -<span class="lineNum"> 299 </span> : // Iterate over queued Item URIs -<span class="lineNum"> 300 </span> : class UriIterator; -<span class="lineNum"> 301 </span> : /** \brief Get the head of the list of enqueued item URIs. -<span class="lineNum"> 302 </span> : * -<span class="lineNum"> 303 </span> : * This iterator will step over every element of every active -<span class="lineNum"> 304 </span> : * queue. -<span class="lineNum"> 305 </span> : */ -<span class="lineNum"> 306 </span> : UriIterator UriBegin(); -<span class="lineNum"> 307 </span> : /** \brief Get the end iterator of the list of enqueued item URIs. */ -<span class="lineNum"> 308 </span> : UriIterator UriEnd(); -<span class="lineNum"> 309 </span> : -<span class="lineNum"> 310 </span> : /** Deletes each entry in the given directory that is not being -<span class="lineNum"> 311 </span> : * downloaded by this object. For instance, when downloading new -<span class="lineNum"> 312 </span> : * list files, calling Clean() will delete the old ones. -<span class="lineNum"> 313 </span> : * -<span class="lineNum"> 314 </span> : * \param Dir The directory to be cleaned out. -<span class="lineNum"> 315 </span> : * -<span class="lineNum"> 316 </span> : * \return \b true if the directory exists and is readable. -<span class="lineNum"> 317 </span> : */ -<span class="lineNum"> 318 </span> : bool Clean(string Dir); -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : /** \return the total size in bytes of all the items included in -<span class="lineNum"> 321 </span> : * this download. -<span class="lineNum"> 322 </span> : */ -<span class="lineNum"> 323 </span> : double TotalNeeded(); -<span class="lineNum"> 324 </span> : -<span class="lineNum"> 325 </span> : /** \return the size in bytes of all non-local items included in -<span class="lineNum"> 326 </span> : * this download. -<span class="lineNum"> 327 </span> : */ -<span class="lineNum"> 328 </span> : double FetchNeeded(); -<span class="lineNum"> 329 </span> : -<span class="lineNum"> 330 </span> : /** \return the amount of data to be fetched that is already -<span class="lineNum"> 331 </span> : * present on the filesystem. -<span class="lineNum"> 332 </span> : */ -<span class="lineNum"> 333 </span> : double PartialPresent(); -<span class="lineNum"> 334 </span> : -<span class="lineNum"> 335 </span> : /** \brief Construct a new pkgAcquire. -<span class="lineNum"> 336 </span> : * -<span class="lineNum"> 337 </span> : * \param Log The progress indicator associated with this -<span class="lineNum"> 338 </span> : * download, or \b NULL for none. This object is not owned by the -<span class="lineNum"> 339 </span> : * download process and will not be deleted when the pkgAcquire -<span class="lineNum"> 340 </span> : * object is destroyed. Naturally, it should live for at least as -<span class="lineNum"> 341 </span> : * long as the pkgAcquire object does. -<span class="lineNum"> 342 </span> : */ -<span class="lineNum"> 343 </span> : pkgAcquire(pkgAcquireStatus *Log = 0); -<span class="lineNum"> 344 </span> : -<span class="lineNum"> 345 </span> : /** \brief Destroy this pkgAcquire object. -<span class="lineNum"> 346 </span> : * -<span class="lineNum"> 347 </span> : * Destroys all queue, method, and item objects associated with -<span class="lineNum"> 348 </span> : * this download. -<span class="lineNum"> 349 </span> : */ -<span class="lineNum"> 350 </span> : virtual ~pkgAcquire(); -<span class="lineNum"> 351 </span> : }; -<span class="lineNum"> 352 </span> : -<span class="lineNum"> 353 </span> : /** \brief Represents a single download source from which an item -<span class="lineNum"> 354 </span> : * should be downloaded. -<span class="lineNum"> 355 </span> : * -<span class="lineNum"> 356 </span> : * An item may have several assocated ItemDescs over its lifetime. -<span class="lineNum"> 357 </span> : */ -<span class="lineNum"> 358 </span> : struct pkgAcquire::ItemDesc -<span class="lineNum"> 359 </span> : { -<span class="lineNum"> 360 </span> : /** \brief The URI from which to download this item. */ -<span class="lineNum"> 361 </span> : string URI; -<span class="lineNum"> 362 </span> : /** brief A description of this item. */ -<span class="lineNum"> 363 </span> : string Description; -<span class="lineNum"> 364 </span> : /** brief A shorter description of this item. */ -<span class="lineNum"> 365 </span> : string ShortDesc; -<span class="lineNum"> 366 </span> : /** brief The underlying item which is to be downloaded. */ -<span class="lineNum"> 367 </span> : Item *Owner; -<span class="lineNum"> 368 </span> : }; -<span class="lineNum"> 369 </span> : -<span class="lineNum"> 370 </span> : /** \brief A single download queue in a pkgAcquire object. -<span class="lineNum"> 371 </span> : * -<span class="lineNum"> 372 </span> : * \todo Why so many protected values? -<span class="lineNum"> 373 </span> : */ -<span class="lineNum"> 374 </span> : class pkgAcquire::Queue -<span class="lineNum"> 375 </span> : { -<span class="lineNum"> 376 </span> : friend class pkgAcquire; -<span class="lineNum"> 377 </span> : friend class pkgAcquire::UriIterator; -<span class="lineNum"> 378 </span> : friend class pkgAcquire::Worker; -<span class="lineNum"> 379 </span> : -<span class="lineNum"> 380 </span> : /** \brief The next queue in the pkgAcquire object's list of queues. */ -<span class="lineNum"> 381 </span> : Queue *Next; -<span class="lineNum"> 382 </span> : -<span class="lineNum"> 383 </span> : protected: -<span class="lineNum"> 384 </span> : -<span class="lineNum"> 385 </span> : /** \brief A single item placed in this queue. */ -<span class="lineNum"> 386 </span> : struct QItem : pkgAcquire::ItemDesc -<span class="lineNum"> 387 </span> : { -<span class="lineNum"> 388 </span> : /** \brief The next item in the queue. */ -<span class="lineNum"> 389 </span> : QItem *Next; -<span class="lineNum"> 390 </span> : /** \brief The worker associated with this item, if any. */ -<span class="lineNum"> 391 </span> : pkgAcquire::Worker *Worker; -<span class="lineNum"> 392 </span> : -<span class="lineNum"> 393 </span> : /** \brief Assign the ItemDesc portion of this QItem from -<span class="lineNum"> 394 </span> : * another ItemDesc -<span class="lineNum"> 395 </span> : */ -<span class="lineNum"> 396 </span> : void operator =(pkgAcquire::ItemDesc const &I) -<span class="lineNum"> 397 </span> : { -<span class="lineNum"> 398 </span> : URI = I.URI; -<span class="lineNum"> 399 </span> : Description = I.Description; -<span class="lineNum"> 400 </span> : ShortDesc = I.ShortDesc; -<span class="lineNum"> 401 </span> : Owner = I.Owner; -<span class="lineNum"> 402 </span> : }; -<span class="lineNum"> 403 </span> : }; -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : /** \brief The name of this queue. */ -<span class="lineNum"> 406 </span> : string Name; -<span class="lineNum"> 407 </span> : -<span class="lineNum"> 408 </span> : /** \brief The head of the list of items contained in this queue. -<span class="lineNum"> 409 </span> : * -<span class="lineNum"> 410 </span> : * \todo why a by-hand list instead of an STL structure? -<span class="lineNum"> 411 </span> : */ -<span class="lineNum"> 412 </span> : QItem *Items; -<span class="lineNum"> 413 </span> : -<span class="lineNum"> 414 </span> : /** \brief The head of the list of workers associated with this queue. -<span class="lineNum"> 415 </span> : * -<span class="lineNum"> 416 </span> : * \todo This is plural because support exists in Queue for -<span class="lineNum"> 417 </span> : * multiple workers. However, it does not appear that there is -<span class="lineNum"> 418 </span> : * any way to actually associate more than one worker with a -<span class="lineNum"> 419 </span> : * queue. -<span class="lineNum"> 420 </span> : * -<span class="lineNum"> 421 </span> : * \todo Why not just use a std::set? -<span class="lineNum"> 422 </span> : */ -<span class="lineNum"> 423 </span> : pkgAcquire::Worker *Workers; -<span class="lineNum"> 424 </span> : -<span class="lineNum"> 425 </span> : /** \brief the download scheduler with which this queue is associated. */ -<span class="lineNum"> 426 </span> : pkgAcquire *Owner; -<span class="lineNum"> 427 </span> : -<span class="lineNum"> 428 </span> : /** \brief The number of entries in this queue that are currently -<span class="lineNum"> 429 </span> : * being downloaded. -<span class="lineNum"> 430 </span> : */ -<span class="lineNum"> 431 </span> : signed long PipeDepth; -<span class="lineNum"> 432 </span> : -<span class="lineNum"> 433 </span> : /** \brief The maximum number of entries that this queue will -<span class="lineNum"> 434 </span> : * attempt to download at once. -<span class="lineNum"> 435 </span> : */ -<span class="lineNum"> 436 </span> : unsigned long MaxPipeDepth; -<span class="lineNum"> 437 </span> : -<span class="lineNum"> 438 </span> : public: -<span class="lineNum"> 439 </span> : -<span class="lineNum"> 440 </span> : /** \brief Insert the given fetch request into this queue. -<span class="lineNum"> 441 </span> : * -<span class="lineNum"> 442 </span> : * \return \b true if the queuing was successful. May return -<span class="lineNum"> 443 </span> : * \b false if the Item is already in the queue -<span class="lineNum"> 444 </span> : */ -<span class="lineNum"> 445 </span> : bool Enqueue(ItemDesc &Item); -<span class="lineNum"> 446 </span> : -<span class="lineNum"> 447 </span> : /** \brief Remove all fetch requests for the given item from this queue. -<span class="lineNum"> 448 </span> : * -<span class="lineNum"> 449 </span> : * \return \b true if at least one request was removed from the queue. -<span class="lineNum"> 450 </span> : */ -<span class="lineNum"> 451 </span> : bool Dequeue(Item *Owner); -<span class="lineNum"> 452 </span> : -<span class="lineNum"> 453 </span> : /** \brief Locate an item in this queue. -<span class="lineNum"> 454 </span> : * -<span class="lineNum"> 455 </span> : * \param URI A URI to match against. -<span class="lineNum"> 456 </span> : * \param Owner A pkgAcquire::Worker to match against. -<span class="lineNum"> 457 </span> : * -<span class="lineNum"> 458 </span> : * \return the first item in the queue whose URI is #URI and that -<span class="lineNum"> 459 </span> : * is being downloaded by #Owner. -<span class="lineNum"> 460 </span> : */ -<span class="lineNum"> 461 </span> : QItem *FindItem(string URI,pkgAcquire::Worker *Owner); -<span class="lineNum"> 462 </span> : -<span class="lineNum"> 463 </span> : /** Presumably this should start downloading an item? -<span class="lineNum"> 464 </span> : * -<span class="lineNum"> 465 </span> : * \todo Unimplemented. Implement it or remove? -<span class="lineNum"> 466 </span> : */ -<span class="lineNum"> 467 </span> : bool ItemStart(QItem *Itm,unsigned long Size); -<span class="lineNum"> 468 </span> : -<span class="lineNum"> 469 </span> : /** \brief Remove the given item from this queue and set its state -<span class="lineNum"> 470 </span> : * to pkgAcquire::Item::StatDone. -<span class="lineNum"> 471 </span> : * -<span class="lineNum"> 472 </span> : * If this is the only queue containing the item, the item is also -<span class="lineNum"> 473 </span> : * removed from the main queue by calling pkgAcquire::Dequeue. -<span class="lineNum"> 474 </span> : * -<span class="lineNum"> 475 </span> : * \param Itm The item to remove. -<span class="lineNum"> 476 </span> : * -<span class="lineNum"> 477 </span> : * \return \b true if no errors are encountered. -<span class="lineNum"> 478 </span> : */ -<span class="lineNum"> 479 </span> : bool ItemDone(QItem *Itm); -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : /** \brief Start the worker process associated with this queue. -<span class="lineNum"> 482 </span> : * -<span class="lineNum"> 483 </span> : * If a worker process is already associated with this queue, -<span class="lineNum"> 484 </span> : * this is equivalent to calling Cycle(). -<span class="lineNum"> 485 </span> : * -<span class="lineNum"> 486 </span> : * \return \b true if the startup was successful. -<span class="lineNum"> 487 </span> : */ -<span class="lineNum"> 488 </span> : bool Startup(); -<span class="lineNum"> 489 </span> : -<span class="lineNum"> 490 </span> : /** \brief Shut down the worker process associated with this queue. -<span class="lineNum"> 491 </span> : * -<span class="lineNum"> 492 </span> : * \param Final If \b true, then the process is stopped unconditionally. -<span class="lineNum"> 493 </span> : * Otherwise, it is only stopped if it does not need cleanup -<span class="lineNum"> 494 </span> : * as indicated by the pkgAcqMethod::NeedsCleanup member of -<span class="lineNum"> 495 </span> : * its configuration. -<span class="lineNum"> 496 </span> : * -<span class="lineNum"> 497 </span> : * \return \b true. -<span class="lineNum"> 498 </span> : */ -<span class="lineNum"> 499 </span> : bool Shutdown(bool Final); -<span class="lineNum"> 500 </span> : -<span class="lineNum"> 501 </span> : /** \brief Send idle items to the worker process. -<span class="lineNum"> 502 </span> : * -<span class="lineNum"> 503 </span> : * Fills up the pipeline by inserting idle items into the worker's queue. -<span class="lineNum"> 504 </span> : */ -<span class="lineNum"> 505 </span> : bool Cycle(); -<span class="lineNum"> 506 </span> : -<span class="lineNum"> 507 </span> : /** \brief Check for items that could be enqueued. -<span class="lineNum"> 508 </span> : * -<span class="lineNum"> 509 </span> : * Call this after an item placed in multiple queues has gone from -<span class="lineNum"> 510 </span> : * the pkgAcquire::Item::StatFetching state to the -<span class="lineNum"> 511 </span> : * pkgAcquire::Item::StatIdle state, to possibly refill an empty queue. -<span class="lineNum"> 512 </span> : * This is an alias for Cycle(). -<span class="lineNum"> 513 </span> : * -<span class="lineNum"> 514 </span> : * \todo Why both this and Cycle()? Are they expected to be -<span class="lineNum"> 515 </span> : * different someday? -<span class="lineNum"> 516 </span> : */ -<span class="lineNum"> 517 </span> : void Bump(); -<span class="lineNum"> 518 </span> : -<span class="lineNum"> 519 </span> : /** \brief Create a new Queue. -<span class="lineNum"> 520 </span> : * -<span class="lineNum"> 521 </span> : * \param Name The name of the new queue. -<span class="lineNum"> 522 </span> : * \param Owner The download process that owns the new queue. -<span class="lineNum"> 523 </span> : */ -<span class="lineNum"> 524 </span> : Queue(string Name,pkgAcquire *Owner); -<span class="lineNum"> 525 </span> : -<span class="lineNum"> 526 </span> : /** Shut down all the worker processes associated with this queue -<span class="lineNum"> 527 </span> : * and empty the queue. -<span class="lineNum"> 528 </span> : */ -<span class="lineNum"> 529 </span> : ~Queue(); -<span class="lineNum"> 530 </span> : }; -<span class="lineNum"> 531 </span> : -<span class="lineNum"> 532 </span> : /** \brief Iterates over all the URIs being fetched by a pkgAcquire object. */ -<span class="lineNum"> 533 </span> : class pkgAcquire::UriIterator -<span class="lineNum"> 534 </span> : { -<span class="lineNum"> 535 </span> : /** The next queue to iterate over. */ -<span class="lineNum"> 536 </span> : pkgAcquire::Queue *CurQ; -<span class="lineNum"> 537 </span> : /** The item that we currently point at. */ -<span class="lineNum"> 538 </span> : pkgAcquire::Queue::QItem *CurItem; -<span class="lineNum"> 539 </span> : -<span class="lineNum"> 540 </span> : public: -<span class="lineNum"> 541 </span> : -<span class="lineNum"> 542 </span> : inline void operator ++() {operator ++();}; -<span class="lineNum"> 543 </span> : -<span class="lineNum"> 544 </span> : void operator ++(int) -<span class="lineNum"> 545 </span> : { -<span class="lineNum"> 546 </span> : CurItem = CurItem->Next; -<span class="lineNum"> 547 </span> : while (CurItem == 0 && CurQ != 0) -<span class="lineNum"> 548 </span> : { -<span class="lineNum"> 549 </span> : CurItem = CurQ->Items; -<span class="lineNum"> 550 </span> : CurQ = CurQ->Next; -<span class="lineNum"> 551 </span> : } -<span class="lineNum"> 552 </span> : }; -<span class="lineNum"> 553 </span> : -<span class="lineNum"> 554 </span> : inline pkgAcquire::ItemDesc const *operator ->() const {return CurItem;}; -<span class="lineNum"> 555 </span> : inline bool operator !=(UriIterator const &rhs) const {return rhs.CurQ != CurQ || rhs.CurItem != CurItem;}; -<span class="lineNum"> 556 </span> : inline bool operator ==(UriIterator const &rhs) const {return rhs.CurQ == CurQ && rhs.CurItem == CurItem;}; -<span class="lineNum"> 557 </span> : -<span class="lineNum"> 558 </span> : /** \brief Create a new UriIterator. -<span class="lineNum"> 559 </span> : * -<span class="lineNum"> 560 </span> : * \param Q The queue over which this UriIterator should iterate. -<span class="lineNum"> 561 </span> : */ -<span class="lineNum"> 562 </span> : UriIterator(pkgAcquire::Queue *Q) : CurQ(Q), CurItem(0) -<span class="lineNum"> 563 </span> : { -<span class="lineNum"> 564 </span> : while (CurItem == 0 && CurQ != 0) -<span class="lineNum"> 565 </span> : { -<span class="lineNum"> 566 </span> : CurItem = CurQ->Items; -<span class="lineNum"> 567 </span> : CurQ = CurQ->Next; -<span class="lineNum"> 568 </span> : } -<span class="lineNum"> 569 </span> : } -<span class="lineNum"> 570 </span> : }; -<span class="lineNum"> 571 </span> : -<span class="lineNum"> 572 </span> : /** \brief Information about the properties of a single acquire method. */ -<span class="lineNum"> 573 </span> : struct pkgAcquire::MethodConfig -<span class="lineNum"> 574 </span> : { -<span class="lineNum"> 575 </span> : /** \brief The next link on the acquire method list. -<span class="lineNum"> 576 </span> : * -<span class="lineNum"> 577 </span> : * \todo Why not an STL container? -<span class="lineNum"> 578 </span> : */ -<span class="lineNum"> 579 </span> : MethodConfig *Next; -<span class="lineNum"> 580 </span> : -<span class="lineNum"> 581 </span> : /** \brief The name of this acquire method (e.g., http). */ -<span class="lineNum"> 582 </span> : string Access; -<span class="lineNum"> 583 </span> : -<span class="lineNum"> 584 </span> : /** \brief The implementation version of this acquire method. */ -<span class="lineNum"> 585 </span> : string Version; -<span class="lineNum"> 586 </span> : -<span class="lineNum"> 587 </span> : /** \brief If \b true, only one download queue should be created for this -<span class="lineNum"> 588 </span> : * method. -<span class="lineNum"> 589 </span> : */ -<span class="lineNum"> 590 </span> : bool SingleInstance; -<span class="lineNum"> 591 </span> : -<span class="lineNum"> 592 </span> : /** \brief If \b true, this method supports pipelined downloading. */ -<span class="lineNum"> 593 </span> : bool Pipeline; -<span class="lineNum"> 594 </span> : -<span class="lineNum"> 595 </span> : /** \brief If \b true, the worker process should send the entire -<span class="lineNum"> 596 </span> : * APT configuration tree to the fetch subprocess when it starts -<span class="lineNum"> 597 </span> : * up. -<span class="lineNum"> 598 </span> : */ -<span class="lineNum"> 599 </span> : bool SendConfig; -<span class="lineNum"> 600 </span> : -<span class="lineNum"> 601 </span> : /** \brief If \b true, this fetch method does not require network access; -<span class="lineNum"> 602 </span> : * all files are to be acquired from the local disk. -<span class="lineNum"> 603 </span> : */ -<span class="lineNum"> 604 </span> : bool LocalOnly; -<span class="lineNum"> 605 </span> : -<span class="lineNum"> 606 </span> : /** \brief If \b true, the subprocess has to carry out some cleanup -<span class="lineNum"> 607 </span> : * actions before shutting down. -<span class="lineNum"> 608 </span> : * -<span class="lineNum"> 609 </span> : * For instance, the cdrom method needs to unmount the CD after it -<span class="lineNum"> 610 </span> : * finishes. -<span class="lineNum"> 611 </span> : */ -<span class="lineNum"> 612 </span> : bool NeedsCleanup; -<span class="lineNum"> 613 </span> : -<span class="lineNum"> 614 </span> : /** \brief If \b true, this fetch method acquires files from removable media. */ -<span class="lineNum"> 615 </span> : bool Removable; -<span class="lineNum"> 616 </span> : -<span class="lineNum"> 617 </span> : /** \brief Set up the default method parameters. -<span class="lineNum"> 618 </span> : * -<span class="lineNum"> 619 </span> : * All fields are initialized to NULL, "", or \b false as -<span class="lineNum"> 620 </span> : * appropriate. -<span class="lineNum"> 621 </span> : */ -<span class="lineNum"> 622 </span> : MethodConfig(); -<span class="lineNum"> 623 </span> : }; -<span class="lineNum"> 624 </span> : -<span class="lineNum"> 625 </span> : /** \brief A monitor object for downloads controlled by the pkgAcquire class. -<span class="lineNum"> 626 </span> : * -<span class="lineNum"> 627 </span> : * \todo Why protected members? -<span class="lineNum"> 628 </span> : * -<span class="lineNum"> 629 </span> : * \todo Should the double members be uint64_t? -<span class="lineNum"> 630 </span> : */ -<span class="lineNum"> 631 </span> : class pkgAcquireStatus -<span class="lineNum"> 632 </span> : { -<span class="lineNum"> 633 </span> : protected: -<span class="lineNum"> 634 </span> : -<span class="lineNum"> 635 </span> : /** \brief The last time at which this monitor object was updated. */ -<span class="lineNum"> 636 </span> : struct timeval Time; -<span class="lineNum"> 637 </span> : -<span class="lineNum"> 638 </span> : /** \brief The time at which the download started. */ -<span class="lineNum"> 639 </span> : struct timeval StartTime; -<span class="lineNum"> 640 </span> : -<span class="lineNum"> 641 </span> : /** \brief The number of bytes fetched as of the previous call to -<span class="lineNum"> 642 </span> : * pkgAcquireStatus::Pulse, including local items. -<span class="lineNum"> 643 </span> : */ -<span class="lineNum"> 644 </span> : double LastBytes; -<span class="lineNum"> 645 </span> : -<span class="lineNum"> 646 </span> : /** \brief The current rate of download as of the most recent call -<span class="lineNum"> 647 </span> : * to pkgAcquireStatus::Pulse, in bytes per second. -<span class="lineNum"> 648 </span> : */ -<span class="lineNum"> 649 </span> : double CurrentCPS; -<span class="lineNum"> 650 </span> : -<span class="lineNum"> 651 </span> : /** \brief The number of bytes fetched as of the most recent call -<span class="lineNum"> 652 </span> : * to pkgAcquireStatus::Pulse, including local items. -<span class="lineNum"> 653 </span> : */ -<span class="lineNum"> 654 </span> : double CurrentBytes; -<span class="lineNum"> 655 </span> : -<span class="lineNum"> 656 </span> : /** \brief The total number of bytes that need to be fetched. -<span class="lineNum"> 657 </span> : * -<span class="lineNum"> 658 </span> : * \warning This member is inaccurate, as new items might be -<span class="lineNum"> 659 </span> : * enqueued while the download is in progress! -<span class="lineNum"> 660 </span> : */ -<span class="lineNum"> 661 </span> : double TotalBytes; -<span class="lineNum"> 662 </span> : -<span class="lineNum"> 663 </span> : /** \brief The total number of bytes accounted for by items that -<span class="lineNum"> 664 </span> : * were successfully fetched. -<span class="lineNum"> 665 </span> : */ -<span class="lineNum"> 666 </span> : double FetchedBytes; -<span class="lineNum"> 667 </span> : -<span class="lineNum"> 668 </span> : /** \brief The amount of time that has elapsed since the download -<span class="lineNum"> 669 </span> : * started. -<span class="lineNum"> 670 </span> : */ -<span class="lineNum"> 671 </span> : unsigned long ElapsedTime; -<span class="lineNum"> 672 </span> : -<span class="lineNum"> 673 </span> : /** \brief The total number of items that need to be fetched. -<span class="lineNum"> 674 </span> : * -<span class="lineNum"> 675 </span> : * \warning This member is inaccurate, as new items might be -<span class="lineNum"> 676 </span> : * enqueued while the download is in progress! -<span class="lineNum"> 677 </span> : */ -<span class="lineNum"> 678 </span> : unsigned long TotalItems; -<span class="lineNum"> 679 </span> : -<span class="lineNum"> 680 </span> : /** \brief The number of items that have been successfully downloaded. */ -<span class="lineNum"> 681 </span> : unsigned long CurrentItems; -<span class="lineNum"> 682 </span> : -<span class="lineNum"> 683 </span> : public: -<span class="lineNum"> 684 </span> : -<span class="lineNum"> 685 </span> : /** \brief If \b true, the download scheduler should call Pulse() -<span class="lineNum"> 686 </span> : * at the next available opportunity. -<span class="lineNum"> 687 </span> : */ -<span class="lineNum"> 688 </span> : bool Update; -<span class="lineNum"> 689 </span> : -<span class="lineNum"> 690 </span> : /** \brief If \b true, extra Pulse() invocations will be performed. -<span class="lineNum"> 691 </span> : * -<span class="lineNum"> 692 </span> : * With this option set, Pulse() will be called every time that a -<span class="lineNum"> 693 </span> : * download item starts downloading, finishes downloading, or -<span class="lineNum"> 694 </span> : * terminates with an error. -<span class="lineNum"> 695 </span> : */ -<span class="lineNum"> 696 </span> : bool MorePulses; -<span class="lineNum"> 697 </span> : -<span class="lineNum"> 698 </span> : /** \brief Invoked when a local or remote file has been completely fetched. -<span class="lineNum"> 699 </span> : * -<span class="lineNum"> 700 </span> : * \param Size The size of the file fetched. -<span class="lineNum"> 701 </span> : * -<span class="lineNum"> 702 </span> : * \param ResumePoint How much of the file was already fetched. -<span class="lineNum"> 703 </span> : */ -<span class="lineNum"> 704 </span> : virtual void Fetched(unsigned long Size,unsigned long ResumePoint); -<span class="lineNum"> 705 </span> : -<span class="lineNum"> 706 </span> : /** \brief Invoked when the user should be prompted to change the -<span class="lineNum"> 707 </span> : * inserted removable media. -<span class="lineNum"> 708 </span> : * -<span class="lineNum"> 709 </span> : * This method should not return until the user has confirmed to -<span class="lineNum"> 710 </span> : * the user interface that the media change is complete. -<span class="lineNum"> 711 </span> : * -<span class="lineNum"> 712 </span> : * \param Media The name of the media type that should be changed. -<span class="lineNum"> 713 </span> : * -<span class="lineNum"> 714 </span> : * \param Drive The identifying name of the drive whose media -<span class="lineNum"> 715 </span> : * should be changed. -<span class="lineNum"> 716 </span> : * -<span class="lineNum"> 717 </span> : * \return \b true if the user confirms the media change, \b -<span class="lineNum"> 718 </span> : * false if it is cancelled. -<span class="lineNum"> 719 </span> : * -<span class="lineNum"> 720 </span> : * \todo This is a horrible blocking monster; it should be CPSed -<span class="lineNum"> 721 </span> : * with prejudice. -<span class="lineNum"> 722 </span> : */ -<span class="lineNum"> 723 </span> : virtual bool MediaChange(string Media,string Drive) = 0; -<span class="lineNum"> 724 </span> : -<span class="lineNum"> 725 </span> : /** \brief Invoked when an item is confirmed to be up-to-date. -<span class="lineNum"> 726 </span> : -<span class="lineNum"> 727 </span> : * For instance, when an HTTP download is informed that the file on -<span class="lineNum"> 728 </span> : * the server was not modified. -<span class="lineNum"> 729 </span> : */ -<span class="lineNum"> 730 </span><span class="lineNoCov"> 0 : virtual void IMSHit(pkgAcquire::ItemDesc &/*Itm*/) {};</span> -<span class="lineNum"> 731 </span> : -<span class="lineNum"> 732 </span> : /** \brief Invoked when some of an item's data is fetched. */ -<span class="lineNum"> 733 </span><span class="lineNoCov"> 0 : virtual void Fetch(pkgAcquire::ItemDesc &/*Itm*/) {};</span> -<span class="lineNum"> 734 </span> : -<span class="lineNum"> 735 </span> : /** \brief Invoked when an item is successfully and completely fetched. */ -<span class="lineNum"> 736 </span><span class="lineNoCov"> 0 : virtual void Done(pkgAcquire::ItemDesc &/*Itm*/) {};</span> -<span class="lineNum"> 737 </span> : -<span class="lineNum"> 738 </span> : /** \brief Invoked when the process of fetching an item encounters -<span class="lineNum"> 739 </span> : * a fatal error. -<span class="lineNum"> 740 </span> : */ -<span class="lineNum"> 741 </span><span class="lineNoCov"> 0 : virtual void Fail(pkgAcquire::ItemDesc &/*Itm*/) {};</span> -<span class="lineNum"> 742 </span> : -<span class="lineNum"> 743 </span> : /** \brief Periodically invoked while the Acquire process is underway. -<span class="lineNum"> 744 </span> : * -<span class="lineNum"> 745 </span> : * Subclasses should first call pkgAcquireStatus::Pulse(), then -<span class="lineNum"> 746 </span> : * update their status output. The download process is blocked -<span class="lineNum"> 747 </span> : * while Pulse() is being called. -<span class="lineNum"> 748 </span> : * -<span class="lineNum"> 749 </span> : * \return \b false if the user asked to cancel the whole Acquire process. -<span class="lineNum"> 750 </span> : * -<span class="lineNum"> 751 </span> : * \see pkgAcquire::Run -<span class="lineNum"> 752 </span> : */ -<span class="lineNum"> 753 </span> : virtual bool Pulse(pkgAcquire *Owner); -<span class="lineNum"> 754 </span> : -<span class="lineNum"> 755 </span> : /** \brief Invoked when the Acquire process starts running. */ -<span class="lineNum"> 756 </span> : virtual void Start(); -<span class="lineNum"> 757 </span> : -<span class="lineNum"> 758 </span> : /** \brief Invoked when the Acquire process stops running. */ -<span class="lineNum"> 759 </span> : virtual void Stop(); -<span class="lineNum"> 760 </span> : -<span class="lineNum"> 761 </span> : /** \brief Initialize all counters to 0 and the time to the current time. */ -<span class="lineNum"> 762 </span> : pkgAcquireStatus(); -<span class="lineNum"> 763 </span><span class="lineNoCov"> 0 : virtual ~pkgAcquireStatus() {};</span> -<span class="lineNum"> 764 </span> : }; -<span class="lineNum"> 765 </span> : -<span class="lineNum"> 766 </span> : /** @} */ -<span class="lineNum"> 767 </span> : -<span class="lineNum"> 768 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/algorithms.h.gcov.html b/rep/usr/include/apt-pkg/algorithms.h.gcov.html deleted file mode 100644 index c11132e..0000000 --- a/rep/usr/include/apt-pkg/algorithms.h.gcov.html +++ /dev/null @@ -1,204 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/algorithms.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - algorithms.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">66.7 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: algorithms.h,v 1.10 2001/05/22 04:17:41 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : Algorithms - A set of misc algorithms -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : This simulate class displays what the ordering code has done and -<span class="lineNum"> 9 </span> : analyses it with a fresh new dependency cache. In this way we can -<span class="lineNum"> 10 </span> : see all of the effects of an upgrade run. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : pkgDistUpgrade computes an upgrade that causes as many packages as -<span class="lineNum"> 13 </span> : possible to move to the newest verison. -<span class="lineNum"> 14 </span> : -<span class="lineNum"> 15 </span> : pkgApplyStatus sets the target state based on the content of the status -<span class="lineNum"> 16 </span> : field in the status file. It is important to get proper crash recovery. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : pkgFixBroken corrects a broken system so that it is in a sane state. -<span class="lineNum"> 19 </span> : -<span class="lineNum"> 20 </span> : pkgAllUpgrade attempts to upgade as many packages as possible but -<span class="lineNum"> 21 </span> : without installing new packages. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : The problem resolver class contains a number of complex algorithms -<span class="lineNum"> 24 </span> : to try to best-guess an upgrade state. It solves the problem of -<span class="lineNum"> 25 </span> : maximizing the number of install state packages while having no broken -<span class="lineNum"> 26 </span> : packages. -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : ##################################################################### */ -<span class="lineNum"> 29 </span> : /*}}}*/ -<span class="lineNum"> 30 </span> : #ifndef PKGLIB_ALGORITHMS_H -<span class="lineNum"> 31 </span> : #define PKGLIB_ALGORITHMS_H -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : #include <apt-pkg/packagemanager.h> -<span class="lineNum"> 35 </span> : #include <apt-pkg/depcache.h> -<span class="lineNum"> 36 </span> : #include <apt-pkg/acquire.h> -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #include <iostream> -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : using std::ostream; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : class pkgSimulate : public pkgPackageManager -<span class="lineNum"> 43 </span> : { -<span class="lineNum"> 44 </span> : protected: -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : class Policy : public pkgDepCache::Policy -<span class="lineNum"> 47 </span> : { -<span class="lineNum"> 48 </span> : pkgDepCache *Cache; -<span class="lineNum"> 49 </span> : public: -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : virtual VerIterator GetCandidateVer(PkgIterator Pkg) -<span class="lineNum"> 52 </span> : { -<span class="lineNum"> 53 </span> : return (*Cache)[Pkg].CandidateVerIter(*Cache); -<span class="lineNum"> 54 </span> : } -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : Policy(pkgDepCache *Cache) : Cache(Cache) {}; -<span class="lineNum"> 57 </span> : }; -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : unsigned char *Flags; -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : Policy iPolicy; -<span class="lineNum"> 62 </span> : pkgDepCache Sim; -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : // The Actuall installation implementation -<span class="lineNum"> 65 </span> : virtual bool Install(PkgIterator Pkg,string File); -<span class="lineNum"> 66 </span> : virtual bool Configure(PkgIterator Pkg); -<span class="lineNum"> 67 </span> : virtual bool Remove(PkgIterator Pkg,bool Purge); -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : private: -<span class="lineNum"> 70 </span> : void ShortBreaks(); -<span class="lineNum"> 71 </span> : void Describe(PkgIterator iPkg,ostream &out,bool Current,bool Candidate); -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : public: -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : pkgSimulate(pkgDepCache *Cache); -<span class="lineNum"> 76 </span> : }; -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : class pkgProblemResolver -<span class="lineNum"> 79 </span> : { -<span class="lineNum"> 80 </span> : pkgDepCache &Cache; -<span class="lineNum"> 81 </span> : typedef pkgCache::PkgIterator PkgIterator; -<span class="lineNum"> 82 </span> : typedef pkgCache::VerIterator VerIterator; -<span class="lineNum"> 83 </span> : typedef pkgCache::DepIterator DepIterator; -<span class="lineNum"> 84 </span> : typedef pkgCache::PrvIterator PrvIterator; -<span class="lineNum"> 85 </span> : typedef pkgCache::Version Version; -<span class="lineNum"> 86 </span> : typedef pkgCache::Package Package; -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : enum Flags {Protected = (1 << 0), PreInstalled = (1 << 1), -<span class="lineNum"> 89 </span> : Upgradable = (1 << 2), ReInstateTried = (1 << 3), -<span class="lineNum"> 90 </span> : ToRemove = (1 << 4)}; -<span class="lineNum"> 91 </span> : signed short *Scores; -<span class="lineNum"> 92 </span> : unsigned char *Flags; -<span class="lineNum"> 93 </span> : bool Debug; -<span class="lineNum"> 94 </span> : -<span class="lineNum"> 95 </span> : // Sort stuff -<span class="lineNum"> 96 </span> : static pkgProblemResolver *This; -<span class="lineNum"> 97 </span> : static int ScoreSort(const void *a,const void *b); -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : struct PackageKill -<span class="lineNum"> 100 </span> : { -<span class="lineNum"> 101 </span> : PkgIterator Pkg; -<span class="lineNum"> 102 </span> : DepIterator Dep; -<span class="lineNum"> 103 </span> : }; -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : void MakeScores(); -<span class="lineNum"> 106 </span> : bool DoUpgrade(pkgCache::PkgIterator Pkg); -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : public: -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span><span class="lineCov"> 4 : inline void Protect(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= Protected;};</span> -<span class="lineNum"> 111 </span><span class="lineNoCov"> 0 : inline void Remove(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] |= ToRemove;};</span> -<span class="lineNum"> 112 </span><span class="lineCov"> 4 : inline void Clear(pkgCache::PkgIterator Pkg) {Flags[Pkg->ID] &= ~(Protected | ToRemove);};</span> -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : // Try to intelligently resolve problems by installing and removing packages -<span class="lineNum"> 115 </span> : bool Resolve(bool BrokenFix = false); -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : // Try to resolve problems only by using keep -<span class="lineNum"> 118 </span> : bool ResolveByKeep(); -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : // Install all protected packages -<span class="lineNum"> 121 </span> : void InstallProtect(); -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : pkgProblemResolver(pkgDepCache *Cache); -<span class="lineNum"> 124 </span> : ~pkgProblemResolver(); -<span class="lineNum"> 125 </span> : }; -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : bool pkgDistUpgrade(pkgDepCache &Cache); -<span class="lineNum"> 128 </span> : bool pkgApplyStatus(pkgDepCache &Cache); -<span class="lineNum"> 129 </span> : bool pkgFixBroken(pkgDepCache &Cache); -<span class="lineNum"> 130 </span> : bool pkgAllUpgrade(pkgDepCache &Cache); -<span class="lineNum"> 131 </span> : bool pkgMinimizeUpgrade(pkgDepCache &Cache); -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : void pkgPrioSortList(pkgCache &Cache,pkgCache::Version **List); -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : bool ListUpdate(pkgAcquireStatus &progress, pkgSourceList &List, int PulseInterval=0); -<span class="lineNum"> 136 </span> : -<span class="lineNum"> 137 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/cachefile.h.gcov.html b/rep/usr/include/apt-pkg/cachefile.h.gcov.html deleted file mode 100644 index 8b9c073..0000000 --- a/rep/usr/include/apt-pkg/cachefile.h.gcov.html +++ /dev/null @@ -1,123 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/cachefile.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - cachefile.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: cachefile.h,v 1.5 2002/04/27 04:28:04 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : CacheFile - Simple wrapper class for opening, generating and whatnot -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : This class implements a simple 2 line mechanism to open various sorts -<span class="lineNum"> 9 </span> : of caches. It can operate as root, as not root, show progress and so on, -<span class="lineNum"> 10 </span> : it transparently handles everything necessary. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : This means it can rebuild caches from the source list and instantiates -<span class="lineNum"> 13 </span> : and prepares the standard policy mechanism. -<span class="lineNum"> 14 </span> : -<span class="lineNum"> 15 </span> : ##################################################################### */ -<span class="lineNum"> 16 </span> : /*}}}*/ -<span class="lineNum"> 17 </span> : #ifndef PKGLIB_CACHEFILE_H -<span class="lineNum"> 18 </span> : #define PKGLIB_CACHEFILE_H -<span class="lineNum"> 19 </span> : -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #include <apt-pkg/depcache.h> -<span class="lineNum"> 22 </span> : #include <apt-pkg/acquire.h> -<span class="lineNum"> 23 </span> : #include <apt-pkg/sourcelist.h> -<span class="lineNum"> 24 </span> : -<span class="lineNum"> 25 </span> : class pkgPolicy; -<span class="lineNum"> 26 </span> : class pkgCacheFile -<span class="lineNum"> 27 </span> : { -<span class="lineNum"> 28 </span> : protected: -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : MMap *Map; -<span class="lineNum"> 31 </span> : pkgCache *Cache; -<span class="lineNum"> 32 </span> : pkgDepCache *DCache; -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : public: -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : pkgPolicy *Policy; -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : // We look pretty much exactly like a pointer to a dep cache -<span class="lineNum"> 39 </span> : inline operator pkgCache &() {return *Cache;}; -<span class="lineNum"> 40 </span> : inline operator pkgCache *() {return Cache;}; -<span class="lineNum"> 41 </span> : inline operator pkgDepCache &() {return *DCache;}; -<span class="lineNum"> 42 </span> : inline operator pkgDepCache *() {return DCache;}; -<span class="lineNum"> 43 </span> : inline pkgDepCache *operator ->() {return DCache;}; -<span class="lineNum"> 44 </span> : inline pkgDepCache &operator *() {return *DCache;}; -<span class="lineNum"> 45 </span><span class="lineCov"> 1 : inline pkgDepCache::StateCache &operator [](pkgCache::PkgIterator const &I) {return (*DCache)[I];};</span> -<span class="lineNum"> 46 </span> : inline unsigned char &operator [](pkgCache::DepIterator const &I) {return (*DCache)[I];}; -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : bool BuildCaches(OpProgress &Progress,bool WithLock = true); -<span class="lineNum"> 49 </span> : bool Open(OpProgress &Progress,bool WithLock = true); -<span class="lineNum"> 50 </span> : void Close(); -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : pkgCacheFile(); -<span class="lineNum"> 53 </span> : ~pkgCacheFile(); -<span class="lineNum"> 54 </span> : }; -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/cacheiterators.h.gcov.html b/rep/usr/include/apt-pkg/cacheiterators.h.gcov.html deleted file mode 100644 index ac4c9b8..0000000 --- a/rep/usr/include/apt-pkg/cacheiterators.h.gcov.html +++ /dev/null @@ -1,503 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/cacheiterators.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - cacheiterators.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">51</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">92.2 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">47</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: cacheiterators.h,v 1.18.2.1 2004/05/08 22:44:27 mdz Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : Cache Iterators - Iterators for navigating the cache structure -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : The iterators all provides ++,==,!=,->,* and end for their type. -<span class="lineNum"> 9 </span> : The end function can be used to tell if the list has been fully -<span class="lineNum"> 10 </span> : traversed. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : Unlike STL iterators these contain helper functions to access the data -<span class="lineNum"> 13 </span> : that is being iterated over. This is because the data structures can't -<span class="lineNum"> 14 </span> : be formed in a manner that is intuitive to use and also mmapable. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : For each variable in the target structure that would need a translation -<span class="lineNum"> 17 </span> : to be accessed correctly a translating function of the same name is -<span class="lineNum"> 18 </span> : present in the iterator. If applicable the translating function will -<span class="lineNum"> 19 </span> : return an iterator. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : The DepIterator can iterate over two lists, a list of 'version depends' -<span class="lineNum"> 22 </span> : or a list of 'package reverse depends'. The type is determined by the -<span class="lineNum"> 23 </span> : structure passed to the constructor, which should be the structure -<span class="lineNum"> 24 </span> : that has the depends pointer as a member. The provide iterator has the -<span class="lineNum"> 25 </span> : same system. -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : This header is not user includable, please use apt-pkg/pkgcache.h -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : ##################################################################### */ -<span class="lineNum"> 30 </span> : /*}}}*/ -<span class="lineNum"> 31 </span> : #ifndef PKGLIB_CACHEITERATORS_H -<span class="lineNum"> 32 </span> : #define PKGLIB_CACHEITERATORS_H -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : // Package Iterator -<span class="lineNum"> 36 </span> : class pkgCache::PkgIterator -<span class="lineNum"> 37 </span> : { -<span class="lineNum"> 38 </span> : friend class pkgCache; -<span class="lineNum"> 39 </span> : Package *Pkg; -<span class="lineNum"> 40 </span> : pkgCache *Owner; -<span class="lineNum"> 41 </span> : long HashIndex; -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : protected: -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : // This constructor is the 'begin' constructor, never use it. -<span class="lineNum"> 46 </span><span class="lineCov"> 19 : inline PkgIterator(pkgCache &Owner) : Owner(&Owner), HashIndex(-1)</span> -<span class="lineNum"> 47 </span> : { -<span class="lineNum"> 48 </span><span class="lineCov"> 19 : Pkg = Owner.PkgP;</span> -<span class="lineNum"> 49 </span><span class="lineCov"> 19 : operator ++(0);</span> -<span class="lineNum"> 50 </span><span class="lineCov"> 19 : };</span> -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : public: -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : enum OkState {NeedsNothing,NeedsUnpack,NeedsConfigure}; -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : // Iteration -<span class="lineNum"> 57 </span> : void operator ++(int); -<span class="lineNum"> 58 </span><span class="lineCov"> 52878 : inline void operator ++() {operator ++(0);};</span> -<span class="lineNum"> 59 </span><span class="lineCov"> 89241 : inline bool end() const {return Owner == 0 || Pkg == Owner->PkgP?true:false;};</span> -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : // Comparison -<span class="lineNum"> 62 </span><span class="lineNoCov"> 0 : inline bool operator ==(const PkgIterator &B) const {return Pkg == B.Pkg;};</span> -<span class="lineNum"> 63 </span><span class="lineNoCov"> 0 : inline bool operator !=(const PkgIterator &B) const {return Pkg != B.Pkg;};</span> -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : // Accessors -<span class="lineNum"> 66 </span><span class="lineCov"> 67369 : inline Package *operator ->() {return Pkg;};</span> -<span class="lineNum"> 67 </span><span class="lineCov"> 3787 : inline Package const *operator ->() const {return Pkg;};</span> -<span class="lineNum"> 68 </span> : inline Package const &operator *() const {return *Pkg;}; -<span class="lineNum"> 69 </span> : inline operator Package *() {return Pkg == Owner->PkgP?0:Pkg;}; -<span class="lineNum"> 70 </span> : inline operator Package const *() const {return Pkg == Owner->PkgP?0:Pkg;}; -<span class="lineNum"> 71 </span> : inline pkgCache *Cache() {return Owner;}; -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span><span class="lineCov"> 18343 : inline const char *Name() const {return Pkg->Name == 0?0:Owner->StrP + Pkg->Name;};</span> -<span class="lineNum"> 74 </span> : inline const char *Section() const {return Pkg->Section == 0?0:Owner->StrP + Pkg->Section;}; -<span class="lineNum"> 75 </span> : inline bool Purge() const {return Pkg->CurrentState == pkgCache::State::Purge || -<span class="lineNum"> 76 </span> : (Pkg->CurrentVer == 0 && Pkg->CurrentState == pkgCache::State::NotInstalled);}; -<span class="lineNum"> 77 </span> : inline VerIterator VersionList() const; -<span class="lineNum"> 78 </span> : inline VerIterator CurrentVer() const; -<span class="lineNum"> 79 </span> : inline DepIterator RevDependsList() const; -<span class="lineNum"> 80 </span> : inline PrvIterator ProvidesList() const; -<span class="lineNum"> 81 </span> : inline unsigned long Index() const {return Pkg - Owner->PkgP;}; -<span class="lineNum"> 82 </span> : OkState State() const; -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : // Constructors -<span class="lineNum"> 85 </span><span class="lineCov"> 5424 : inline PkgIterator(pkgCache &Owner,Package *Trg) : Pkg(Trg), Owner(&Owner),</span> -<span class="lineNum"> 86 </span><span class="lineCov"> 5424 : HashIndex(0) </span> -<span class="lineNum"> 87 </span> : { -<span class="lineNum"> 88 </span><span class="lineCov"> 5424 : if (Pkg == 0)</span> -<span class="lineNum"> 89 </span><span class="lineNoCov"> 0 : Pkg = Owner.PkgP;</span> -<span class="lineNum"> 90 </span><span class="lineCov"> 5424 : };</span> -<span class="lineNum"> 91 </span><span class="lineCov"> 29 : inline PkgIterator() : Pkg(0), Owner(0), HashIndex(0) {};</span> -<span class="lineNum"> 92 </span> : }; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : // Version Iterator -<span class="lineNum"> 95 </span> : class pkgCache::VerIterator -<span class="lineNum"> 96 </span> : { -<span class="lineNum"> 97 </span> : Version *Ver; -<span class="lineNum"> 98 </span> : pkgCache *Owner; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : void _dummy(); -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : public: -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : // Iteration -<span class="lineNum"> 105 </span><span class="lineCov"> 15767 : void operator ++(int) {if (Ver != Owner->VerP) Ver = Owner->VerP + Ver->NextVer;};</span> -<span class="lineNum"> 106 </span><span class="lineCov"> 1808 : inline void operator ++() {operator ++(0);};</span> -<span class="lineNum"> 107 </span><span class="lineCov"> 58053 : inline bool end() const {return Owner == NULL || (Ver == Owner->VerP?true:false);};</span> -<span class="lineNum"> 108 </span><span class="lineCov"> 11172 : inline void operator =(const VerIterator &B) {Ver = B.Ver; Owner = B.Owner;};</span> -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : // Comparison -<span class="lineNum"> 111 </span> : inline bool operator ==(const VerIterator &B) const {return Ver == B.Ver;}; -<span class="lineNum"> 112 </span><span class="lineCov"> 1433 : inline bool operator !=(const VerIterator &B) const {return Ver != B.Ver;};</span> -<span class="lineNum"> 113 </span> : int CompareVer(const VerIterator &B) const; -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : // Accessors -<span class="lineNum"> 116 </span> : inline Version *operator ->() {return Ver;}; -<span class="lineNum"> 117 </span> : inline Version const *operator ->() const {return Ver;}; -<span class="lineNum"> 118 </span> : inline Version &operator *() {return *Ver;}; -<span class="lineNum"> 119 </span> : inline Version const &operator *() const {return *Ver;}; -<span class="lineNum"> 120 </span> : inline operator Version *() {return Ver == Owner->VerP?0:Ver;}; -<span class="lineNum"> 121 </span> : inline operator Version const *() const {return Ver == Owner->VerP?0:Ver;}; -<span class="lineNum"> 122 </span> : inline pkgCache *Cache() {return Owner;}; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span><span class="lineCov"> 1830 : inline const char *VerStr() const {return Ver->VerStr == 0?0:Owner->StrP + Ver->VerStr;};</span> -<span class="lineNum"> 125 </span> : inline const char *Section() const {return Ver->Section == 0?0:Owner->StrP + Ver->Section;}; -<span class="lineNum"> 126 </span> : inline const char *Arch() const {return Ver->Arch == 0?0:Owner->StrP + Ver->Arch;}; -<span class="lineNum"> 127 </span><span class="lineCov"> 5424 : inline PkgIterator ParentPkg() const {return PkgIterator(*Owner,Owner->PkgP + Ver->ParentPkg);};</span> -<span class="lineNum"> 128 </span> : inline DescIterator DescriptionList() const; -<span class="lineNum"> 129 </span> : DescIterator TranslatedDescription() const; -<span class="lineNum"> 130 </span> : inline DepIterator DependsList() const; -<span class="lineNum"> 131 </span> : inline PrvIterator ProvidesList() const; -<span class="lineNum"> 132 </span> : inline VerFileIterator FileList() const; -<span class="lineNum"> 133 </span> : inline unsigned long Index() const {return Ver - Owner->VerP;}; -<span class="lineNum"> 134 </span> : bool Downloadable() const; -<span class="lineNum"> 135 </span> : inline const char *PriorityType() {return Owner->Priority(Ver->Priority);}; -<span class="lineNum"> 136 </span> : string RelStr(); -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : bool Automatic() const; -<span class="lineNum"> 139 </span> : VerFileIterator NewestFile() const; -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span><span class="lineCov"> 15 : inline VerIterator() : Ver(0), Owner(0) {}; </span> -<span class="lineNum"> 142 </span><span class="lineCov"> 21130 : inline VerIterator(pkgCache &Owner,Version *Trg = 0) : Ver(Trg), </span> -<span class="lineNum"> 143 </span><span class="lineCov"> 21130 : Owner(&Owner) </span> -<span class="lineNum"> 144 </span> : { -<span class="lineNum"> 145 </span><span class="lineCov"> 21130 : if (Ver == 0)</span> -<span class="lineNum"> 146 </span><span class="lineNoCov"> 0 : Ver = Owner.VerP;</span> -<span class="lineNum"> 147 </span><span class="lineCov"> 21130 : };</span> -<span class="lineNum"> 148 </span> : }; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : // Description Iterator -<span class="lineNum"> 151 </span> : class pkgCache::DescIterator -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : Description *Desc; -<span class="lineNum"> 154 </span> : pkgCache *Owner; -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : void _dummy(); -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : public: -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : // Iteration -<span class="lineNum"> 161 </span> : void operator ++(int) {if (Desc != Owner->DescP) Desc = Owner->DescP + Desc->NextDesc;}; -<span class="lineNum"> 162 </span> : inline void operator ++() {operator ++(0);}; -<span class="lineNum"> 163 </span> : inline bool end() const {return Desc == Owner->DescP?true:false;}; -<span class="lineNum"> 164 </span> : inline void operator =(const DescIterator &B) {Desc = B.Desc; Owner = B.Owner;}; -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : // Comparison -<span class="lineNum"> 167 </span> : inline bool operator ==(const DescIterator &B) const {return Desc == B.Desc;}; -<span class="lineNum"> 168 </span> : inline bool operator !=(const DescIterator &B) const {return Desc != B.Desc;}; -<span class="lineNum"> 169 </span> : int CompareDesc(const DescIterator &B) const; -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : // Accessors -<span class="lineNum"> 172 </span> : inline Description *operator ->() {return Desc;}; -<span class="lineNum"> 173 </span> : inline Description const *operator ->() const {return Desc;}; -<span class="lineNum"> 174 </span> : inline Description &operator *() {return *Desc;}; -<span class="lineNum"> 175 </span> : inline Description const &operator *() const {return *Desc;}; -<span class="lineNum"> 176 </span> : inline operator Description *() {return Desc == Owner->DescP?0:Desc;}; -<span class="lineNum"> 177 </span> : inline operator Description const *() const {return Desc == Owner->DescP?0:Desc;}; -<span class="lineNum"> 178 </span> : inline pkgCache *Cache() {return Owner;}; -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : inline const char *LanguageCode() const {return Owner->StrP + Desc->language_code;}; -<span class="lineNum"> 181 </span> : inline const char *md5() const {return Owner->StrP + Desc->md5sum;}; -<span class="lineNum"> 182 </span> : inline DescFileIterator FileList() const; -<span class="lineNum"> 183 </span> : inline unsigned long Index() const {return Desc - Owner->DescP;}; -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : inline DescIterator() : Desc(0), Owner(0) {}; -<span class="lineNum"> 186 </span> : inline DescIterator(pkgCache &Owner,Description *Trg = 0) : Desc(Trg), -<span class="lineNum"> 187 </span> : Owner(&Owner) -<span class="lineNum"> 188 </span> : { -<span class="lineNum"> 189 </span> : if (Desc == 0) -<span class="lineNum"> 190 </span> : Desc = Owner.DescP; -<span class="lineNum"> 191 </span> : }; -<span class="lineNum"> 192 </span> : }; -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : // Dependency iterator -<span class="lineNum"> 195 </span> : class pkgCache::DepIterator -<span class="lineNum"> 196 </span> : { -<span class="lineNum"> 197 </span> : Dependency *Dep; -<span class="lineNum"> 198 </span> : enum {DepVer, DepRev} Type; -<span class="lineNum"> 199 </span> : pkgCache *Owner; -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : void _dummy(); -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : public: -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span> : // Iteration -<span class="lineNum"> 206 </span> : void operator ++(int) {if (Dep != Owner->DepP) Dep = Owner->DepP + -<span class="lineNum"> 207 </span> : (Type == DepVer?Dep->NextDepends:Dep->NextRevDepends);}; -<span class="lineNum"> 208 </span> : inline void operator ++() {operator ++(0);}; -<span class="lineNum"> 209 </span> : inline bool end() const {return Owner == 0 || Dep == Owner->DepP?true:false;}; -<span class="lineNum"> 210 </span> : -<span class="lineNum"> 211 </span> : // Comparison -<span class="lineNum"> 212 </span> : inline bool operator ==(const DepIterator &B) const {return Dep == B.Dep;}; -<span class="lineNum"> 213 </span> : inline bool operator !=(const DepIterator &B) const {return Dep != B.Dep;}; -<span class="lineNum"> 214 </span> : -<span class="lineNum"> 215 </span> : // Accessors -<span class="lineNum"> 216 </span> : inline Dependency *operator ->() {return Dep;}; -<span class="lineNum"> 217 </span> : inline Dependency const *operator ->() const {return Dep;}; -<span class="lineNum"> 218 </span> : inline Dependency &operator *() {return *Dep;}; -<span class="lineNum"> 219 </span> : inline Dependency const &operator *() const {return *Dep;}; -<span class="lineNum"> 220 </span> : inline operator Dependency *() {return Dep == Owner->DepP?0:Dep;}; -<span class="lineNum"> 221 </span> : inline operator Dependency const *() const {return Dep == Owner->DepP?0:Dep;}; -<span class="lineNum"> 222 </span> : inline pkgCache *Cache() {return Owner;}; -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : inline const char *TargetVer() const {return Dep->Version == 0?0:Owner->StrP + Dep->Version;}; -<span class="lineNum"> 225 </span> : inline PkgIterator TargetPkg() {return PkgIterator(*Owner,Owner->PkgP + Dep->Package);}; -<span class="lineNum"> 226 </span> : inline PkgIterator SmartTargetPkg() {PkgIterator R(*Owner,0);SmartTargetPkg(R);return R;}; -<span class="lineNum"> 227 </span> : inline VerIterator ParentVer() {return VerIterator(*Owner,Owner->VerP + Dep->ParentVer);}; -<span class="lineNum"> 228 </span> : inline PkgIterator ParentPkg() {return PkgIterator(*Owner,Owner->PkgP + Owner->VerP[Dep->ParentVer].ParentPkg);}; -<span class="lineNum"> 229 </span> : inline bool Reverse() {return Type == DepRev;}; -<span class="lineNum"> 230 </span> : inline unsigned long Index() const {return Dep - Owner->DepP;}; -<span class="lineNum"> 231 </span> : bool IsCritical(); -<span class="lineNum"> 232 </span> : void GlobOr(DepIterator &Start,DepIterator &End); -<span class="lineNum"> 233 </span> : Version **AllTargets(); -<span class="lineNum"> 234 </span> : bool SmartTargetPkg(PkgIterator &Result); -<span class="lineNum"> 235 </span> : inline const char *CompType() {return Owner->CompType(Dep->CompareOp);}; -<span class="lineNum"> 236 </span> : inline const char *DepType() {return Owner->DepType(Dep->Type);}; -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : inline DepIterator(pkgCache &Owner,Dependency *Trg,Version * = 0) : -<span class="lineNum"> 239 </span> : Dep(Trg), Type(DepVer), Owner(&Owner) -<span class="lineNum"> 240 </span> : { -<span class="lineNum"> 241 </span> : if (Dep == 0) -<span class="lineNum"> 242 </span> : Dep = Owner.DepP; -<span class="lineNum"> 243 </span> : }; -<span class="lineNum"> 244 </span> : inline DepIterator(pkgCache &Owner,Dependency *Trg,Package *) : -<span class="lineNum"> 245 </span> : Dep(Trg), Type(DepRev), Owner(&Owner) -<span class="lineNum"> 246 </span> : { -<span class="lineNum"> 247 </span> : if (Dep == 0) -<span class="lineNum"> 248 </span> : Dep = Owner.DepP; -<span class="lineNum"> 249 </span> : }; -<span class="lineNum"> 250 </span> : inline DepIterator() : Dep(0), Type(DepVer), Owner(0) {}; -<span class="lineNum"> 251 </span> : }; -<span class="lineNum"> 252 </span> : -<span class="lineNum"> 253 </span> : // Provides iterator -<span class="lineNum"> 254 </span> : class pkgCache::PrvIterator -<span class="lineNum"> 255 </span> : { -<span class="lineNum"> 256 </span> : Provides *Prv; -<span class="lineNum"> 257 </span> : enum {PrvVer, PrvPkg} Type; -<span class="lineNum"> 258 </span> : pkgCache *Owner; -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : void _dummy(); -<span class="lineNum"> 261 </span> : -<span class="lineNum"> 262 </span> : public: -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : // Iteration -<span class="lineNum"> 265 </span> : void operator ++(int) {if (Prv != Owner->ProvideP) Prv = Owner->ProvideP + -<span class="lineNum"> 266 </span> : (Type == PrvVer?Prv->NextPkgProv:Prv->NextProvides);}; -<span class="lineNum"> 267 </span> : inline void operator ++() {operator ++(0);}; -<span class="lineNum"> 268 </span> : inline bool end() const {return Owner == 0 || Prv == Owner->ProvideP?true:false;}; -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span> : // Comparison -<span class="lineNum"> 271 </span> : inline bool operator ==(const PrvIterator &B) const {return Prv == B.Prv;}; -<span class="lineNum"> 272 </span> : inline bool operator !=(const PrvIterator &B) const {return Prv != B.Prv;}; -<span class="lineNum"> 273 </span> : -<span class="lineNum"> 274 </span> : // Accessors -<span class="lineNum"> 275 </span> : inline Provides *operator ->() {return Prv;}; -<span class="lineNum"> 276 </span> : inline Provides const *operator ->() const {return Prv;}; -<span class="lineNum"> 277 </span> : inline Provides &operator *() {return *Prv;}; -<span class="lineNum"> 278 </span> : inline Provides const &operator *() const {return *Prv;}; -<span class="lineNum"> 279 </span> : inline operator Provides *() {return Prv == Owner->ProvideP?0:Prv;}; -<span class="lineNum"> 280 </span> : inline operator Provides const *() const {return Prv == Owner->ProvideP?0:Prv;}; -<span class="lineNum"> 281 </span> : inline pkgCache *Cache() {return Owner;}; -<span class="lineNum"> 282 </span> : -<span class="lineNum"> 283 </span> : inline const char *Name() const {return Owner->StrP + Owner->PkgP[Prv->ParentPkg].Name;}; -<span class="lineNum"> 284 </span> : inline const char *ProvideVersion() const {return Prv->ProvideVersion == 0?0:Owner->StrP + Prv->ProvideVersion;}; -<span class="lineNum"> 285 </span> : inline PkgIterator ParentPkg() {return PkgIterator(*Owner,Owner->PkgP + Prv->ParentPkg);}; -<span class="lineNum"> 286 </span> : inline VerIterator OwnerVer() {return VerIterator(*Owner,Owner->VerP + Prv->Version);}; -<span class="lineNum"> 287 </span> : inline PkgIterator OwnerPkg() {return PkgIterator(*Owner,Owner->PkgP + Owner->VerP[Prv->Version].ParentPkg);}; -<span class="lineNum"> 288 </span> : inline unsigned long Index() const {return Prv - Owner->ProvideP;}; -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : inline PrvIterator() : Prv(0), Type(PrvVer), Owner(0) {}; -<span class="lineNum"> 291 </span> : -<span class="lineNum"> 292 </span> : inline PrvIterator(pkgCache &Owner,Provides *Trg,Version *) : -<span class="lineNum"> 293 </span> : Prv(Trg), Type(PrvVer), Owner(&Owner) -<span class="lineNum"> 294 </span> : { -<span class="lineNum"> 295 </span> : if (Prv == 0) -<span class="lineNum"> 296 </span> : Prv = Owner.ProvideP; -<span class="lineNum"> 297 </span> : }; -<span class="lineNum"> 298 </span> : inline PrvIterator(pkgCache &Owner,Provides *Trg,Package *) : -<span class="lineNum"> 299 </span> : Prv(Trg), Type(PrvPkg), Owner(&Owner) -<span class="lineNum"> 300 </span> : { -<span class="lineNum"> 301 </span> : if (Prv == 0) -<span class="lineNum"> 302 </span> : Prv = Owner.ProvideP; -<span class="lineNum"> 303 </span> : }; -<span class="lineNum"> 304 </span> : }; -<span class="lineNum"> 305 </span> : -<span class="lineNum"> 306 </span> : // Package file -<span class="lineNum"> 307 </span> : class pkgCache::PkgFileIterator -<span class="lineNum"> 308 </span> : { -<span class="lineNum"> 309 </span> : pkgCache *Owner; -<span class="lineNum"> 310 </span> : PackageFile *File; -<span class="lineNum"> 311 </span> : -<span class="lineNum"> 312 </span> : public: -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : // Iteration -<span class="lineNum"> 315 </span> : void operator ++(int) {if (File!= Owner->PkgFileP) File = Owner->PkgFileP + File->NextFile;}; -<span class="lineNum"> 316 </span> : inline void operator ++() {operator ++(0);}; -<span class="lineNum"> 317 </span> : inline bool end() const {return File == Owner->PkgFileP?true:false;}; -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : // Comparison -<span class="lineNum"> 320 </span> : inline bool operator ==(const PkgFileIterator &B) const {return File == B.File;}; -<span class="lineNum"> 321 </span> : inline bool operator !=(const PkgFileIterator &B) const {return File != B.File;}; -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : // Accessors -<span class="lineNum"> 324 </span><span class="lineCov"> 26403 : inline PackageFile *operator ->() {return File;};</span> -<span class="lineNum"> 325 </span> : inline PackageFile const *operator ->() const {return File;}; -<span class="lineNum"> 326 </span> : inline PackageFile const &operator *() const {return *File;}; -<span class="lineNum"> 327 </span><span class="lineCov"> 5202 : inline operator PackageFile *() {return File == Owner->PkgFileP?0:File;};</span> -<span class="lineNum"> 328 </span> : inline operator PackageFile const *() const {return File == Owner->PkgFileP?0:File;}; -<span class="lineNum"> 329 </span><span class="lineCov"> 5216 : inline pkgCache *Cache() {return Owner;};</span> -<span class="lineNum"> 330 </span> : -<span class="lineNum"> 331 </span><span class="lineCov"> 26 : inline const char *FileName() const {return File->FileName == 0?0:Owner->StrP + File->FileName;};</span> -<span class="lineNum"> 332 </span> : inline const char *Archive() const {return File->Archive == 0?0:Owner->StrP + File->Archive;}; -<span class="lineNum"> 333 </span> : inline const char *Component() const {return File->Component == 0?0:Owner->StrP + File->Component;}; -<span class="lineNum"> 334 </span> : inline const char *Version() const {return File->Version == 0?0:Owner->StrP + File->Version;}; -<span class="lineNum"> 335 </span> : inline const char *Origin() const {return File->Origin == 0?0:Owner->StrP + File->Origin;}; -<span class="lineNum"> 336 </span> : inline const char *Label() const {return File->Label == 0?0:Owner->StrP + File->Label;}; -<span class="lineNum"> 337 </span> : inline const char *Site() const {return File->Site == 0?0:Owner->StrP + File->Site;}; -<span class="lineNum"> 338 </span> : inline const char *Architecture() const {return File->Architecture == 0?0:Owner->StrP + File->Architecture;}; -<span class="lineNum"> 339 </span> : inline const char *IndexType() const {return File->IndexType == 0?0:Owner->StrP + File->IndexType;}; -<span class="lineNum"> 340 </span> : -<span class="lineNum"> 341 </span> : inline unsigned long Index() const {return File - Owner->PkgFileP;}; -<span class="lineNum"> 342 </span> : -<span class="lineNum"> 343 </span> : bool IsOk(); -<span class="lineNum"> 344 </span> : string RelStr(); -<span class="lineNum"> 345 </span> : -<span class="lineNum"> 346 </span> : // Constructors -<span class="lineNum"> 347 </span><span class="lineCov"> 15 : inline PkgFileIterator() : Owner(0), File(0) {};</span> -<span class="lineNum"> 348 </span> : inline PkgFileIterator(pkgCache &Owner) : Owner(&Owner), File(Owner.PkgFileP) {}; -<span class="lineNum"> 349 </span><span class="lineCov"> 26429 : inline PkgFileIterator(pkgCache &Owner,PackageFile *Trg) : Owner(&Owner), File(Trg) {};</span> -<span class="lineNum"> 350 </span> : }; -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : // Version File -<span class="lineNum"> 353 </span> : class pkgCache::VerFileIterator -<span class="lineNum"> 354 </span> : { -<span class="lineNum"> 355 </span> : pkgCache *Owner; -<span class="lineNum"> 356 </span> : VerFile *FileP; -<span class="lineNum"> 357 </span> : -<span class="lineNum"> 358 </span> : public: -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : // Iteration -<span class="lineNum"> 361 </span><span class="lineCov"> 22055 : void operator ++(int) {if (FileP != Owner->VerFileP) FileP = Owner->VerFileP + FileP->NextFile;};</span> -<span class="lineNum"> 362 </span><span class="lineCov"> 11714 : inline void operator ++() {operator ++(0);};</span> -<span class="lineNum"> 363 </span><span class="lineCov"> 90338 : inline bool end() const {return FileP == Owner->VerFileP?true:false;};</span> -<span class="lineNum"> 364 </span> : -<span class="lineNum"> 365 </span> : // Comparison -<span class="lineNum"> 366 </span> : inline bool operator ==(const VerFileIterator &B) const {return FileP == B.FileP;}; -<span class="lineNum"> 367 </span> : inline bool operator !=(const VerFileIterator &B) const {return FileP != B.FileP;}; -<span class="lineNum"> 368 </span> : -<span class="lineNum"> 369 </span> : // Accessors -<span class="lineNum"> 370 </span><span class="lineCov"> 10056 : inline VerFile *operator ->() {return FileP;};</span> -<span class="lineNum"> 371 </span> : inline VerFile const *operator ->() const {return FileP;}; -<span class="lineNum"> 372 </span> : inline VerFile const &operator *() const {return *FileP;}; -<span class="lineNum"> 373 </span><span class="lineCov"> 4341 : inline operator VerFile *() {return FileP == Owner->VerFileP?0:FileP;};</span> -<span class="lineNum"> 374 </span> : inline operator VerFile const *() const {return FileP == Owner->VerFileP?0:FileP;}; -<span class="lineNum"> 375 </span><span class="lineCov"> 1311 : inline pkgCache *Cache() {return Owner;};</span> -<span class="lineNum"> 376 </span> : -<span class="lineNum"> 377 </span><span class="lineCov"> 26406 : inline PkgFileIterator File() const {return PkgFileIterator(*Owner,FileP->File + Owner->PkgFileP);};</span> -<span class="lineNum"> 378 </span> : inline unsigned long Index() const {return FileP - Owner->VerFileP;}; -<span class="lineNum"> 379 </span> : -<span class="lineNum"> 380 </span><span class="lineCov"> 7 : inline VerFileIterator() : Owner(0), FileP(0) {};</span> -<span class="lineNum"> 381 </span><span class="lineCov"> 27354 : inline VerFileIterator(pkgCache &Owner,VerFile *Trg) : Owner(&Owner), FileP(Trg) {};</span> -<span class="lineNum"> 382 </span> : }; -<span class="lineNum"> 383 </span> : -<span class="lineNum"> 384 </span> : // Description File -<span class="lineNum"> 385 </span> : class pkgCache::DescFileIterator -<span class="lineNum"> 386 </span> : { -<span class="lineNum"> 387 </span> : pkgCache *Owner; -<span class="lineNum"> 388 </span> : DescFile *FileP; -<span class="lineNum"> 389 </span> : -<span class="lineNum"> 390 </span> : public: -<span class="lineNum"> 391 </span> : -<span class="lineNum"> 392 </span> : // Iteration -<span class="lineNum"> 393 </span> : void operator ++(int) {if (FileP != Owner->DescFileP) FileP = Owner->DescFileP + FileP->NextFile;}; -<span class="lineNum"> 394 </span> : inline void operator ++() {operator ++(0);}; -<span class="lineNum"> 395 </span> : inline bool end() const {return FileP == Owner->DescFileP?true:false;}; -<span class="lineNum"> 396 </span> : -<span class="lineNum"> 397 </span> : // Comparison -<span class="lineNum"> 398 </span> : inline bool operator ==(const DescFileIterator &B) const {return FileP == B.FileP;}; -<span class="lineNum"> 399 </span> : inline bool operator !=(const DescFileIterator &B) const {return FileP != B.FileP;}; -<span class="lineNum"> 400 </span> : -<span class="lineNum"> 401 </span> : // Accessors -<span class="lineNum"> 402 </span> : inline DescFile *operator ->() {return FileP;}; -<span class="lineNum"> 403 </span> : inline DescFile const *operator ->() const {return FileP;}; -<span class="lineNum"> 404 </span> : inline DescFile const &operator *() const {return *FileP;}; -<span class="lineNum"> 405 </span> : inline operator DescFile *() {return FileP == Owner->DescFileP?0:FileP;}; -<span class="lineNum"> 406 </span> : inline operator DescFile const *() const {return FileP == Owner->DescFileP?0:FileP;}; -<span class="lineNum"> 407 </span> : inline pkgCache *Cache() {return Owner;}; -<span class="lineNum"> 408 </span> : -<span class="lineNum"> 409 </span> : inline PkgFileIterator File() const {return PkgFileIterator(*Owner,FileP->File + Owner->PkgFileP);}; -<span class="lineNum"> 410 </span> : inline unsigned long Index() const {return FileP - Owner->DescFileP;}; -<span class="lineNum"> 411 </span> : -<span class="lineNum"> 412 </span> : inline DescFileIterator() : Owner(0), FileP(0) {}; -<span class="lineNum"> 413 </span> : inline DescFileIterator(pkgCache &Owner,DescFile *Trg) : Owner(&Owner), FileP(Trg) {}; -<span class="lineNum"> 414 </span> : }; -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : // Inlined Begin functions cant be in the class because of order problems -<span class="lineNum"> 417 </span><span class="lineCov"> 19696 : inline pkgCache::VerIterator pkgCache::PkgIterator::VersionList() const</span> -<span class="lineNum"> 418 </span><span class="lineCov"> 19696 : {return VerIterator(*Owner,Owner->VerP + Pkg->VersionList);};</span> -<span class="lineNum"> 419 </span><span class="lineCov"> 2 : inline pkgCache::VerIterator pkgCache::PkgIterator::CurrentVer() const</span> -<span class="lineNum"> 420 </span><span class="lineCov"> 2 : {return VerIterator(*Owner,Owner->VerP + Pkg->CurrentVer);};</span> -<span class="lineNum"> 421 </span> : inline pkgCache::DepIterator pkgCache::PkgIterator::RevDependsList() const -<span class="lineNum"> 422 </span> : {return DepIterator(*Owner,Owner->DepP + Pkg->RevDepends,Pkg);}; -<span class="lineNum"> 423 </span> : inline pkgCache::PrvIterator pkgCache::PkgIterator::ProvidesList() const -<span class="lineNum"> 424 </span> : {return PrvIterator(*Owner,Owner->ProvideP + Pkg->ProvidesList,Pkg);}; -<span class="lineNum"> 425 </span> : inline pkgCache::DescIterator pkgCache::VerIterator::DescriptionList() const -<span class="lineNum"> 426 </span> : {return DescIterator(*Owner,Owner->DescP + Ver->DescriptionList);}; -<span class="lineNum"> 427 </span> : inline pkgCache::PrvIterator pkgCache::VerIterator::ProvidesList() const -<span class="lineNum"> 428 </span> : {return PrvIterator(*Owner,Owner->ProvideP + Ver->ProvidesList,Ver);}; -<span class="lineNum"> 429 </span> : inline pkgCache::DepIterator pkgCache::VerIterator::DependsList() const -<span class="lineNum"> 430 </span> : {return DepIterator(*Owner,Owner->DepP + Ver->DependsList,Ver);}; -<span class="lineNum"> 431 </span><span class="lineCov"> 26484 : inline pkgCache::VerFileIterator pkgCache::VerIterator::FileList() const</span> -<span class="lineNum"> 432 </span><span class="lineCov"> 26484 : {return VerFileIterator(*Owner,Owner->VerFileP + Ver->FileList);};</span> -<span class="lineNum"> 433 </span> : inline pkgCache::DescFileIterator pkgCache::DescIterator::FileList() const -<span class="lineNum"> 434 </span> : {return DescFileIterator(*Owner,Owner->DescFileP + Desc->FileList);}; -<span class="lineNum"> 435 </span> : -<span class="lineNum"> 436 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/depcache.h.gcov.html b/rep/usr/include/apt-pkg/depcache.h.gcov.html deleted file mode 100644 index f982f27..0000000 --- a/rep/usr/include/apt-pkg/depcache.h.gcov.html +++ /dev/null @@ -1,492 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/depcache.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - depcache.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">6</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">6</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: c++; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: depcache.h,v 1.14 2001/02/20 07:03:17 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : DepCache - Dependency Extension data for the cache -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : This class stores the cache data and a set of extension structures for -<span class="lineNum"> 9 </span> : monitoring the current state of all the packages. It also generates and -<span class="lineNum"> 10 </span> : caches the 'install' state of many things. This refers to the state of the -<span class="lineNum"> 11 </span> : package after an install has been run. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : The StateCache::State field can be -1,0,1,2 which is <,=,>,no current. -<span class="lineNum"> 14 </span> : StateCache::Mode is which of the 3 fields is active. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : This structure is important to support the readonly status of the cache -<span class="lineNum"> 17 </span> : file. When the data is saved the cache will be refereshed from our -<span class="lineNum"> 18 </span> : internal rep and written to disk. Then the actual persistant data -<span class="lineNum"> 19 </span> : files will be put on the disk. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : Each dependency is compared against 3 target versions to produce to -<span class="lineNum"> 22 </span> : 3 dependency results. -<span class="lineNum"> 23 </span> : Now - Compared using the Currently install version -<span class="lineNum"> 24 </span> : Install - Compared using the install version (final state) -<span class="lineNum"> 25 </span> : CVer - (Candidate Verion) Compared using the Candidate Version -<span class="lineNum"> 26 </span> : The candidate and now results are used to decide wheather a package -<span class="lineNum"> 27 </span> : should be automatically installed or if it should be left alone. -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : Remember, the Candidate Version is selected based on the distribution -<span class="lineNum"> 30 </span> : settings for the Package. The Install Version is selected based on the -<span class="lineNum"> 31 </span> : state (Delete, Keep, Install) field and can be either the Current Version -<span class="lineNum"> 32 </span> : or the Candidate version. -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : The Candidate version is what is shown the 'Install Version' field. -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : ##################################################################### */ -<span class="lineNum"> 37 </span> : /*}}}*/ -<span class="lineNum"> 38 </span> : #ifndef PKGLIB_DEPCACHE_H -<span class="lineNum"> 39 </span> : #define PKGLIB_DEPCACHE_H -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #include <apt-pkg/pkgcache.h> -<span class="lineNum"> 43 </span> : #include <apt-pkg/progress.h> -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #include <regex.h> -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : #include <vector> -<span class="lineNum"> 48 </span> : #include <memory> -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : class pkgDepCache : protected pkgCache::Namespace -<span class="lineNum"> 51 </span> : { -<span class="lineNum"> 52 </span> : public: -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : /** \brief An arbitrary predicate on packages. */ -<span class="lineNum"> 55 </span> : class InRootSetFunc -<span class="lineNum"> 56 </span> : { -<span class="lineNum"> 57 </span> : public: -<span class="lineNum"> 58 </span> : virtual bool InRootSet(const pkgCache::PkgIterator &pkg) {return false;}; -<span class="lineNum"> 59 </span> : virtual ~InRootSetFunc() {}; -<span class="lineNum"> 60 </span> : }; -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : private: -<span class="lineNum"> 63 </span> : /** \brief Mark a single package and all its unmarked important -<span class="lineNum"> 64 </span> : * dependencies during mark-and-sweep. -<span class="lineNum"> 65 </span> : * -<span class="lineNum"> 66 </span> : * Recursively invokes itself to mark all dependencies of the -<span class="lineNum"> 67 </span> : * package. -<span class="lineNum"> 68 </span> : * -<span class="lineNum"> 69 </span> : * \param pkg The package to mark. -<span class="lineNum"> 70 </span> : * -<span class="lineNum"> 71 </span> : * \param ver The version of the package that is to be marked. -<span class="lineNum"> 72 </span> : * -<span class="lineNum"> 73 </span> : * \param follow_recommends If \b true, recommendations of the -<span class="lineNum"> 74 </span> : * package will be recursively marked. -<span class="lineNum"> 75 </span> : * -<span class="lineNum"> 76 </span> : * \param follow_suggests If \b true, suggestions of the package -<span class="lineNum"> 77 </span> : * will be recursively marked. -<span class="lineNum"> 78 </span> : */ -<span class="lineNum"> 79 </span> : void MarkPackage(const pkgCache::PkgIterator &pkg, -<span class="lineNum"> 80 </span> : const pkgCache::VerIterator &ver, -<span class="lineNum"> 81 </span> : bool follow_recommends, -<span class="lineNum"> 82 </span> : bool follow_suggests); -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : /** \brief Update the Marked field of all packages. -<span class="lineNum"> 85 </span> : * -<span class="lineNum"> 86 </span> : * Each package's StateCache::Marked field will be set to \b true -<span class="lineNum"> 87 </span> : * if and only if it can be reached from the root set. By -<span class="lineNum"> 88 </span> : * default, the root set consists of the set of manually installed -<span class="lineNum"> 89 </span> : * or essential packages, but it can be extended using the -<span class="lineNum"> 90 </span> : * parameter #rootFunc. -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * \param rootFunc A callback that can be used to add extra -<span class="lineNum"> 93 </span> : * packages to the root set. -<span class="lineNum"> 94 </span> : * -<span class="lineNum"> 95 </span> : * \return \b false if an error occurred. -<span class="lineNum"> 96 </span> : */ -<span class="lineNum"> 97 </span> : bool MarkRequired(InRootSetFunc &rootFunc); -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : /** \brief Set the StateCache::Garbage flag on all packages that -<span class="lineNum"> 100 </span> : * should be removed. -<span class="lineNum"> 101 </span> : * -<span class="lineNum"> 102 </span> : * Packages that were not marked by the last call to #MarkRequired -<span class="lineNum"> 103 </span> : * are tested to see whether they are actually garbage. If so, -<span class="lineNum"> 104 </span> : * they are marked as such. -<span class="lineNum"> 105 </span> : * -<span class="lineNum"> 106 </span> : * \return \b false if an error occurred. -<span class="lineNum"> 107 </span> : */ -<span class="lineNum"> 108 </span> : bool Sweep(); -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : public: -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : // These flags are used in DepState -<span class="lineNum"> 113 </span> : enum DepFlags {DepNow = (1 << 0),DepInstall = (1 << 1),DepCVer = (1 << 2), -<span class="lineNum"> 114 </span> : DepGNow = (1 << 3),DepGInstall = (1 << 4),DepGCVer = (1 << 5)}; -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : // These flags are used in StateCache::DepState -<span class="lineNum"> 117 </span> : enum DepStateFlags {DepNowPolicy = (1 << 0), DepNowMin = (1 << 1), -<span class="lineNum"> 118 </span> : DepInstPolicy = (1 << 2), DepInstMin = (1 << 3), -<span class="lineNum"> 119 </span> : DepCandPolicy = (1 << 4), DepCandMin = (1 << 5)}; -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : // These flags are used in StateCache::iFlags -<span class="lineNum"> 122 </span> : enum InternalFlags {AutoKept = (1 << 0), Purge = (1 << 1), ReInstall = (1 << 2)}; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : enum VersionTypes {NowVersion, InstallVersion, CandidateVersion}; -<span class="lineNum"> 125 </span> : enum ModeList {ModeDelete = 0, ModeKeep = 1, ModeInstall = 2}; -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : /** \brief Represents an active action group. -<span class="lineNum"> 128 </span> : * -<span class="lineNum"> 129 </span> : * An action group is a group of actions that are currently being -<span class="lineNum"> 130 </span> : * performed. While an active group is active, certain routine -<span class="lineNum"> 131 </span> : * clean-up actions that would normally be performed after every -<span class="lineNum"> 132 </span> : * cache operation are delayed until the action group is -<span class="lineNum"> 133 </span> : * completed. This is necessary primarily to avoid inefficiencies -<span class="lineNum"> 134 </span> : * when modifying a large number of packages at once. -<span class="lineNum"> 135 </span> : * -<span class="lineNum"> 136 </span> : * This class represents an active action group. Creating an -<span class="lineNum"> 137 </span> : * instance will create an action group; destroying one will -<span class="lineNum"> 138 </span> : * destroy the corresponding action group. -<span class="lineNum"> 139 </span> : * -<span class="lineNum"> 140 </span> : * The following operations are suppressed by this class: -<span class="lineNum"> 141 </span> : * -<span class="lineNum"> 142 </span> : * - Keeping the Marked and Garbage flags up to date. -<span class="lineNum"> 143 </span> : * -<span class="lineNum"> 144 </span> : * \note This can be used in the future to easily accumulate -<span class="lineNum"> 145 </span> : * atomic actions for undo or to display "what apt did anyway"; -<span class="lineNum"> 146 </span> : * e.g., change the counter of how many action groups are active -<span class="lineNum"> 147 </span> : * to a std::set of pointers to them and use those to store -<span class="lineNum"> 148 </span> : * information about what happened in a group in the group. -<span class="lineNum"> 149 </span> : */ -<span class="lineNum"> 150 </span> : class ActionGroup -<span class="lineNum"> 151 </span> : { -<span class="lineNum"> 152 </span> : pkgDepCache &cache; -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : bool released; -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : /** Action groups are noncopyable. */ -<span class="lineNum"> 157 </span> : ActionGroup(const ActionGroup &other); -<span class="lineNum"> 158 </span> : public: -<span class="lineNum"> 159 </span> : /** \brief Create a new ActionGroup. -<span class="lineNum"> 160 </span> : * -<span class="lineNum"> 161 </span> : * \param cache The cache that this ActionGroup should -<span class="lineNum"> 162 </span> : * manipulate. -<span class="lineNum"> 163 </span> : * -<span class="lineNum"> 164 </span> : * As long as this object exists, no automatic cleanup -<span class="lineNum"> 165 </span> : * operations will be undertaken. -<span class="lineNum"> 166 </span> : */ -<span class="lineNum"> 167 </span> : ActionGroup(pkgDepCache &cache); -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : /** \brief Clean up the action group before it is destroyed. -<span class="lineNum"> 170 </span> : * -<span class="lineNum"> 171 </span> : * If it is destroyed later, no second cleanup wil be run. -<span class="lineNum"> 172 </span> : */ -<span class="lineNum"> 173 </span> : void release(); -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : /** \brief Destroy the action group. -<span class="lineNum"> 176 </span> : * -<span class="lineNum"> 177 </span> : * If this is the last action group, the automatic cache -<span class="lineNum"> 178 </span> : * cleanup operations will be undertaken. -<span class="lineNum"> 179 </span> : */ -<span class="lineNum"> 180 </span> : ~ActionGroup(); -<span class="lineNum"> 181 </span> : }; -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : /** \brief Returns \b true for packages matching a regular -<span class="lineNum"> 184 </span> : * expression in APT::NeverAutoRemove. -<span class="lineNum"> 185 </span> : */ -<span class="lineNum"> 186 </span> : class DefaultRootSetFunc : public InRootSetFunc -<span class="lineNum"> 187 </span> : { -<span class="lineNum"> 188 </span> : std::vector<regex_t *> rootSetRegexp; -<span class="lineNum"> 189 </span> : bool constructedSuccessfully; -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : public: -<span class="lineNum"> 192 </span> : DefaultRootSetFunc(); -<span class="lineNum"> 193 </span> : ~DefaultRootSetFunc(); -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : /** \return \b true if the class initialized successfully, \b -<span class="lineNum"> 196 </span> : * false otherwise. Used to avoid throwing an exception, since -<span class="lineNum"> 197 </span> : * APT classes generally don't. -<span class="lineNum"> 198 </span> : */ -<span class="lineNum"> 199 </span> : bool wasConstructedSuccessfully() const { return constructedSuccessfully; } -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : bool InRootSet(const pkgCache::PkgIterator &pkg); -<span class="lineNum"> 202 </span> : }; -<span class="lineNum"> 203 </span> : -<span class="lineNum"> 204 </span> : struct StateCache -<span class="lineNum"> 205 </span> : { -<span class="lineNum"> 206 </span> : // Epoch stripped text versions of the two version fields -<span class="lineNum"> 207 </span> : const char *CandVersion; -<span class="lineNum"> 208 </span> : const char *CurVersion; -<span class="lineNum"> 209 </span> : -<span class="lineNum"> 210 </span> : // Pointer to the candidate install version. -<span class="lineNum"> 211 </span> : Version *CandidateVer; -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : // Pointer to the install version. -<span class="lineNum"> 214 </span> : Version *InstallVer; -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : // Copy of Package::Flags -<span class="lineNum"> 217 </span> : unsigned short Flags; -<span class="lineNum"> 218 </span> : unsigned short iFlags; // Internal flags -<span class="lineNum"> 219 </span> : -<span class="lineNum"> 220 </span> : /** \brief \b true if this package can be reached from the root set. */ -<span class="lineNum"> 221 </span> : bool Marked; -<span class="lineNum"> 222 </span> : -<span class="lineNum"> 223 </span> : /** \brief \b true if this package is unused and should be removed. -<span class="lineNum"> 224 </span> : * -<span class="lineNum"> 225 </span> : * This differs from !#Marked, because it is possible that some -<span class="lineNum"> 226 </span> : * unreachable packages will be protected from becoming -<span class="lineNum"> 227 </span> : * garbage. -<span class="lineNum"> 228 </span> : */ -<span class="lineNum"> 229 </span> : bool Garbage; -<span class="lineNum"> 230 </span> : -<span class="lineNum"> 231 </span> : // Various tree indicators -<span class="lineNum"> 232 </span> : signed char Status; // -1,0,1,2 -<span class="lineNum"> 233 </span> : unsigned char Mode; // ModeList -<span class="lineNum"> 234 </span> : unsigned char DepState; // DepState Flags -<span class="lineNum"> 235 </span> : -<span class="lineNum"> 236 </span> : // Update of candidate version -<span class="lineNum"> 237 </span> : const char *StripEpoch(const char *Ver); -<span class="lineNum"> 238 </span> : void Update(PkgIterator Pkg,pkgCache &Cache); -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : // Various test members for the current status of the package -<span class="lineNum"> 241 </span> : inline bool NewInstall() const {return Status == 2 && Mode == ModeInstall;}; -<span class="lineNum"> 242 </span><span class="lineCov"> 3785 : inline bool Delete() const {return Mode == ModeDelete;};</span> -<span class="lineNum"> 243 </span><span class="lineCov"> 3785 : inline bool Keep() const {return Mode == ModeKeep;};</span> -<span class="lineNum"> 244 </span> : inline bool Upgrade() const {return Status > 0 && Mode == ModeInstall;}; -<span class="lineNum"> 245 </span> : inline bool Upgradable() const {return Status >= 1;}; -<span class="lineNum"> 246 </span> : inline bool Downgrade() const {return Status < 0 && Mode == ModeInstall;}; -<span class="lineNum"> 247 </span> : inline bool Held() const {return Status != 0 && Keep();}; -<span class="lineNum"> 248 </span><span class="lineCov"> 3785 : inline bool NowBroken() const {return (DepState & DepNowMin) != DepNowMin;};</span> -<span class="lineNum"> 249 </span> : inline bool NowPolicyBroken() const {return (DepState & DepNowPolicy) != DepNowPolicy;}; -<span class="lineNum"> 250 </span><span class="lineCov"> 3785 : inline bool InstBroken() const {return (DepState & DepInstMin) != DepInstMin;};</span> -<span class="lineNum"> 251 </span> : inline bool InstPolicyBroken() const {return (DepState & DepInstPolicy) != DepInstPolicy;}; -<span class="lineNum"> 252 </span><span class="lineCov"> 3785 : inline bool Install() const {return Mode == ModeInstall;};</span> -<span class="lineNum"> 253 </span> : inline VerIterator InstVerIter(pkgCache &Cache) -<span class="lineNum"> 254 </span> : {return VerIterator(Cache,InstallVer);}; -<span class="lineNum"> 255 </span> : inline VerIterator CandidateVerIter(pkgCache &Cache) -<span class="lineNum"> 256 </span> : {return VerIterator(Cache,CandidateVer);}; -<span class="lineNum"> 257 </span> : }; -<span class="lineNum"> 258 </span> : -<span class="lineNum"> 259 </span> : // Helper functions -<span class="lineNum"> 260 </span> : void BuildGroupOrs(VerIterator const &V); -<span class="lineNum"> 261 </span> : void UpdateVerState(PkgIterator Pkg); -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : // User Policy control -<span class="lineNum"> 264 </span> : class Policy -<span class="lineNum"> 265 </span> : { -<span class="lineNum"> 266 </span> : public: -<span class="lineNum"> 267 </span> : -<span class="lineNum"> 268 </span> : virtual VerIterator GetCandidateVer(PkgIterator Pkg); -<span class="lineNum"> 269 </span> : virtual bool IsImportantDep(DepIterator Dep); -<span class="lineNum"> 270 </span> : -<span class="lineNum"> 271 </span> : virtual ~Policy() {}; -<span class="lineNum"> 272 </span> : }; -<span class="lineNum"> 273 </span> : -<span class="lineNum"> 274 </span> : private: -<span class="lineNum"> 275 </span> : /** The number of open "action groups"; certain post-action -<span class="lineNum"> 276 </span> : * operations are suppressed if this number is > 0. -<span class="lineNum"> 277 </span> : */ -<span class="lineNum"> 278 </span> : int group_level; -<span class="lineNum"> 279 </span> : -<span class="lineNum"> 280 </span> : friend class ActionGroup; -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span> : protected: -<span class="lineNum"> 283 </span> : -<span class="lineNum"> 284 </span> : // State information -<span class="lineNum"> 285 </span> : pkgCache *Cache; -<span class="lineNum"> 286 </span> : StateCache *PkgState; -<span class="lineNum"> 287 </span> : unsigned char *DepState; -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : double iUsrSize; -<span class="lineNum"> 290 </span> : double iDownloadSize; -<span class="lineNum"> 291 </span> : unsigned long iInstCount; -<span class="lineNum"> 292 </span> : unsigned long iDelCount; -<span class="lineNum"> 293 </span> : unsigned long iKeepCount; -<span class="lineNum"> 294 </span> : unsigned long iBrokenCount; -<span class="lineNum"> 295 </span> : unsigned long iPolicyBrokenCount; -<span class="lineNum"> 296 </span> : unsigned long iBadCount; -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : Policy *delLocalPolicy; // For memory clean up.. -<span class="lineNum"> 299 </span> : Policy *LocalPolicy; -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span> : // Check for a matching provides -<span class="lineNum"> 302 </span> : bool CheckDep(DepIterator Dep,int Type,PkgIterator &Res); -<span class="lineNum"> 303 </span> : inline bool CheckDep(DepIterator Dep,int Type) -<span class="lineNum"> 304 </span> : { -<span class="lineNum"> 305 </span> : PkgIterator Res(*this,0); -<span class="lineNum"> 306 </span> : return CheckDep(Dep,Type,Res); -<span class="lineNum"> 307 </span> : } -<span class="lineNum"> 308 </span> : -<span class="lineNum"> 309 </span> : // Computes state information for deps and versions (w/o storing) -<span class="lineNum"> 310 </span> : unsigned char DependencyState(DepIterator &D); -<span class="lineNum"> 311 </span> : unsigned char VersionState(DepIterator D,unsigned char Check, -<span class="lineNum"> 312 </span> : unsigned char SetMin, -<span class="lineNum"> 313 </span> : unsigned char SetPolicy); -<span class="lineNum"> 314 </span> : -<span class="lineNum"> 315 </span> : // Recalculates various portions of the cache, call after changing something -<span class="lineNum"> 316 </span> : void Update(DepIterator Dep); // Mostly internal -<span class="lineNum"> 317 </span> : void Update(PkgIterator const &P); -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : // Count manipulators -<span class="lineNum"> 320 </span> : void AddSizes(const PkgIterator &Pkg,signed long Mult = 1); -<span class="lineNum"> 321 </span> : inline void RemoveSizes(const PkgIterator &Pkg) {AddSizes(Pkg,-1);}; -<span class="lineNum"> 322 </span> : void AddStates(const PkgIterator &Pkg,int Add = 1); -<span class="lineNum"> 323 </span> : inline void RemoveStates(const PkgIterator &Pkg) {AddStates(Pkg,-1);}; -<span class="lineNum"> 324 </span> : -<span class="lineNum"> 325 </span> : public: -<span class="lineNum"> 326 </span> : -<span class="lineNum"> 327 </span> : // Legacy.. We look like a pkgCache -<span class="lineNum"> 328 </span> : inline operator pkgCache &() {return *Cache;}; -<span class="lineNum"> 329 </span> : inline Header &Head() {return *Cache->HeaderP;}; -<span class="lineNum"> 330 </span> : inline PkgIterator PkgBegin() {return Cache->PkgBegin();}; -<span class="lineNum"> 331 </span> : inline PkgIterator FindPkg(string const &Name) {return Cache->FindPkg(Name);}; -<span class="lineNum"> 332 </span> : -<span class="lineNum"> 333 </span> : inline pkgCache &GetCache() {return *Cache;}; -<span class="lineNum"> 334 </span> : inline pkgVersioningSystem &VS() {return *Cache->VS;}; -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : // Policy implementation -<span class="lineNum"> 337 </span> : inline VerIterator GetCandidateVer(PkgIterator Pkg) {return LocalPolicy->GetCandidateVer(Pkg);}; -<span class="lineNum"> 338 </span> : inline bool IsImportantDep(DepIterator Dep) {return LocalPolicy->IsImportantDep(Dep);}; -<span class="lineNum"> 339 </span> : inline Policy &GetPolicy() {return *LocalPolicy;}; -<span class="lineNum"> 340 </span> : -<span class="lineNum"> 341 </span> : // Accessors -<span class="lineNum"> 342 </span><span class="lineCov"> 3787 : inline StateCache &operator [](PkgIterator const &I) {return PkgState[I->ID];};</span> -<span class="lineNum"> 343 </span> : inline unsigned char &operator [](DepIterator const &I) {return DepState[I->ID];}; -<span class="lineNum"> 344 </span> : -<span class="lineNum"> 345 </span> : /** \return A function identifying packages in the root set other -<span class="lineNum"> 346 </span> : * than manually installed packages and essential packages, or \b -<span class="lineNum"> 347 </span> : * NULL if an error occurs. -<span class="lineNum"> 348 </span> : * -<span class="lineNum"> 349 </span> : * \todo Is this the best place for this function? Perhaps the -<span class="lineNum"> 350 </span> : * settings for mark-and-sweep should be stored in a single -<span class="lineNum"> 351 </span> : * external class? -<span class="lineNum"> 352 </span> : */ -<span class="lineNum"> 353 </span> : virtual InRootSetFunc *GetRootSetFunc(); -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : /** \return \b true if the garbage collector should follow recommendations. -<span class="lineNum"> 356 </span> : */ -<span class="lineNum"> 357 </span> : virtual bool MarkFollowsRecommends(); -<span class="lineNum"> 358 </span> : -<span class="lineNum"> 359 </span> : /** \return \b true if the garbage collector should follow suggestions. -<span class="lineNum"> 360 </span> : */ -<span class="lineNum"> 361 </span> : virtual bool MarkFollowsSuggests(); -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : /** \brief Update the Marked and Garbage fields of all packages. -<span class="lineNum"> 364 </span> : * -<span class="lineNum"> 365 </span> : * This routine is implicitly invoked after all state manipulators -<span class="lineNum"> 366 </span> : * and when an ActionGroup is destroyed. It invokes #MarkRequired -<span class="lineNum"> 367 </span> : * and #Sweep to do its dirty work. -<span class="lineNum"> 368 </span> : * -<span class="lineNum"> 369 </span> : * \param rootFunc A predicate that returns \b true for packages -<span class="lineNum"> 370 </span> : * that should be added to the root set. -<span class="lineNum"> 371 </span> : */ -<span class="lineNum"> 372 </span> : bool MarkAndSweep(InRootSetFunc &rootFunc) -<span class="lineNum"> 373 </span> : { -<span class="lineNum"> 374 </span> : return MarkRequired(rootFunc) && Sweep(); -<span class="lineNum"> 375 </span> : } -<span class="lineNum"> 376 </span> : -<span class="lineNum"> 377 </span> : bool MarkAndSweep() -<span class="lineNum"> 378 </span> : { -<span class="lineNum"> 379 </span> : std::auto_ptr<InRootSetFunc> f(GetRootSetFunc()); -<span class="lineNum"> 380 </span> : if(f.get() != NULL) -<span class="lineNum"> 381 </span> : return MarkAndSweep(*f.get()); -<span class="lineNum"> 382 </span> : else -<span class="lineNum"> 383 </span> : return false; -<span class="lineNum"> 384 </span> : } -<span class="lineNum"> 385 </span> : -<span class="lineNum"> 386 </span> : /** \name State Manipulators -<span class="lineNum"> 387 </span> : */ -<span class="lineNum"> 388 </span> : // @{ -<span class="lineNum"> 389 </span> : void MarkKeep(PkgIterator const &Pkg, bool Soft = false, -<span class="lineNum"> 390 </span> : bool FromUser = true); -<span class="lineNum"> 391 </span> : void MarkDelete(PkgIterator const &Pkg,bool Purge = false); -<span class="lineNum"> 392 </span> : void MarkInstall(PkgIterator const &Pkg,bool AutoInst = true, -<span class="lineNum"> 393 </span> : unsigned long Depth = 0, bool FromUser = true, -<span class="lineNum"> 394 </span> : bool ForceImportantDeps = false); -<span class="lineNum"> 395 </span> : void SetReInstall(PkgIterator const &Pkg,bool To); -<span class="lineNum"> 396 </span> : void SetCandidateVersion(VerIterator TargetVer); -<span class="lineNum"> 397 </span> : -<span class="lineNum"> 398 </span> : /** Set the "is automatically installed" flag of Pkg. */ -<span class="lineNum"> 399 </span> : void MarkAuto(const PkgIterator &Pkg, bool Auto); -<span class="lineNum"> 400 </span> : // @} -<span class="lineNum"> 401 </span> : -<span class="lineNum"> 402 </span> : // This is for debuging -<span class="lineNum"> 403 </span> : void Update(OpProgress *Prog = 0); -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : // read persistent states -<span class="lineNum"> 406 </span> : bool readStateFile(OpProgress *prog); -<span class="lineNum"> 407 </span> : bool writeStateFile(OpProgress *prog, bool InstalledOnly=false); -<span class="lineNum"> 408 </span> : -<span class="lineNum"> 409 </span> : // Size queries -<span class="lineNum"> 410 </span> : inline double UsrSize() {return iUsrSize;}; -<span class="lineNum"> 411 </span> : inline double DebSize() {return iDownloadSize;}; -<span class="lineNum"> 412 </span> : inline unsigned long DelCount() {return iDelCount;}; -<span class="lineNum"> 413 </span> : inline unsigned long KeepCount() {return iKeepCount;}; -<span class="lineNum"> 414 </span> : inline unsigned long InstCount() {return iInstCount;}; -<span class="lineNum"> 415 </span> : inline unsigned long BrokenCount() {return iBrokenCount;}; -<span class="lineNum"> 416 </span> : inline unsigned long PolicyBrokenCount() {return iPolicyBrokenCount;}; -<span class="lineNum"> 417 </span> : inline unsigned long BadCount() {return iBadCount;}; -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : bool Init(OpProgress *Prog); -<span class="lineNum"> 420 </span> : -<span class="lineNum"> 421 </span> : pkgDepCache(pkgCache *Cache,Policy *Plcy = 0); -<span class="lineNum"> 422 </span> : virtual ~pkgDepCache(); -<span class="lineNum"> 423 </span> : }; -<span class="lineNum"> 424 </span> : -<span class="lineNum"> 425 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/error.h.gcov.html b/rep/usr/include/apt-pkg/error.h.gcov.html deleted file mode 100644 index b4b55f3..0000000 --- a/rep/usr/include/apt-pkg/error.h.gcov.html +++ /dev/null @@ -1,168 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/error.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - error.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">50.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: error.h,v 1.8 2001/05/07 05:06:52 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : Global Erorr Class - Global error mechanism -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : This class has a single global instance. When a function needs to -<span class="lineNum"> 9 </span> : generate an error condition, such as a read error, it calls a member -<span class="lineNum"> 10 </span> : in this class to add the error to a stack of errors. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : By using a stack the problem with a scheme like errno is removed and -<span class="lineNum"> 13 </span> : it allows a very detailed account of what went wrong to be transmitted -<span class="lineNum"> 14 </span> : to the UI for display. (Errno has problems because each function sets -<span class="lineNum"> 15 </span> : errno to 0 if it didn't have an error thus eraseing erno in the process -<span class="lineNum"> 16 </span> : of cleanup) -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : Several predefined error generators are provided to handle common -<span class="lineNum"> 19 </span> : things like errno. The general idea is that all methods return a bool. -<span class="lineNum"> 20 </span> : If the bool is true then things are OK, if it is false then things -<span class="lineNum"> 21 </span> : should start being undone and the stack should unwind under program -<span class="lineNum"> 22 </span> : control. -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : A Warning should not force the return of false. Things did not fail, but -<span class="lineNum"> 25 </span> : they might have had unexpected problems. Errors are stored in a FIFO -<span class="lineNum"> 26 </span> : so Pop will return the first item.. -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : I have some thoughts about extending this into a more general UI<-> -<span class="lineNum"> 29 </span> : Engine interface, ie allowing the Engine to say 'The disk is full' in -<span class="lineNum"> 30 </span> : a dialog that says 'Panic' and 'Retry'.. The error generator functions -<span class="lineNum"> 31 </span> : like errno, Warning and Error return false always so this is normal: -<span class="lineNum"> 32 </span> : if (open(..)) -<span class="lineNum"> 33 </span> : return _error->Errno(..); -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : This source is placed in the Public Domain, do with it what you will -<span class="lineNum"> 36 </span> : It was originally written by Jason Gunthorpe. -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : ##################################################################### */ -<span class="lineNum"> 39 </span> : /*}}}*/ -<span class="lineNum"> 40 </span> : #ifndef PKGLIB_ERROR_H -<span class="lineNum"> 41 </span> : #define PKGLIB_ERROR_H -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #ifdef __GNUG__ -<span class="lineNum"> 46 </span> : // Methods have a hidden this parameter that is visible to this attribute -<span class="lineNum"> 47 </span> : #define APT_MFORMAT1 __attribute__ ((format (printf, 2, 3))) -<span class="lineNum"> 48 </span> : #define APT_MFORMAT2 __attribute__ ((format (printf, 3, 4))) -<span class="lineNum"> 49 </span> : #else -<span class="lineNum"> 50 </span> : #define APT_MFORMAT1 -<span class="lineNum"> 51 </span> : #define APT_MFORMAT2 -<span class="lineNum"> 52 </span> : #endif -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : #include <string> -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : using std::string; -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : class GlobalError -<span class="lineNum"> 59 </span> : { -<span class="lineNum"> 60 </span> : struct Item -<span class="lineNum"> 61 </span> : { -<span class="lineNum"> 62 </span> : string Text; -<span class="lineNum"> 63 </span> : bool Error; -<span class="lineNum"> 64 </span> : Item *Next; -<span class="lineNum"> 65 </span> : }; -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : Item *List; -<span class="lineNum"> 68 </span> : bool PendingFlag; -<span class="lineNum"> 69 </span> : void Insert(Item *I); -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : public: -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : // Call to generate an error from a library call. -<span class="lineNum"> 74 </span> : bool Errno(const char *Function,const char *Description,...) APT_MFORMAT2; -<span class="lineNum"> 75 </span> : bool WarningE(const char *Function,const char *Description,...) APT_MFORMAT2; -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : /* A warning should be considered less severe than an error, and may be -<span class="lineNum"> 78 </span> : ignored by the client. */ -<span class="lineNum"> 79 </span> : bool Error(const char *Description,...) APT_MFORMAT1; -<span class="lineNum"> 80 </span> : bool Warning(const char *Description,...) APT_MFORMAT1; -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : // Simple accessors -<span class="lineNum"> 83 </span><span class="lineCov"> 3 : inline bool PendingError() {return PendingFlag;};</span> -<span class="lineNum"> 84 </span><span class="lineNoCov"> 0 : inline bool empty() {return List == 0;};</span> -<span class="lineNum"> 85 </span> : bool PopMessage(string &Text); -<span class="lineNum"> 86 </span> : void Discard(); -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : // Usefull routine to dump to cerr -<span class="lineNum"> 89 </span> : void DumpErrors(); -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : GlobalError(); -<span class="lineNum"> 92 </span> : }; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : // The 'extra-ansi' syntax is used to help with collisions. -<span class="lineNum"> 95 </span> : GlobalError *_GetErrorObj(); -<span class="lineNum"> 96 </span> : #define _error _GetErrorObj() -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : #undef APT_MFORMAT1 -<span class="lineNum"> 99 </span> : #undef APT_MFORMAT2 -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/fileutl.h.gcov.html b/rep/usr/include/apt-pkg/fileutl.h.gcov.html deleted file mode 100644 index 9726c50..0000000 --- a/rep/usr/include/apt-pkg/fileutl.h.gcov.html +++ /dev/null @@ -1,165 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/fileutl.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - fileutl.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">6</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">6</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: fileutl.h,v 1.26 2001/05/07 05:06:52 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : File Utilities -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : CopyFile - Buffered copy of a single file -<span class="lineNum"> 9 </span> : GetLock - dpkg compatible lock file manipulation (fcntl) -<span class="lineNum"> 10 </span> : FileExists - Returns true if the file exists -<span class="lineNum"> 11 </span> : SafeGetCWD - Returns the CWD in a string with overrun protection -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : The file class is a handy abstraction for various functions+classes -<span class="lineNum"> 14 </span> : that need to accept filenames. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : This source is placed in the Public Domain, do with it what you will -<span class="lineNum"> 17 </span> : It was originally written by Jason Gunthorpe. -<span class="lineNum"> 18 </span> : -<span class="lineNum"> 19 </span> : ##################################################################### */ -<span class="lineNum"> 20 </span> : /*}}}*/ -<span class="lineNum"> 21 </span> : #ifndef PKGLIB_FILEUTL_H -<span class="lineNum"> 22 </span> : #define PKGLIB_FILEUTL_H -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : -<span class="lineNum"> 25 </span> : #include <string> -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : using std::string; -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : class FileFd -<span class="lineNum"> 30 </span> : { -<span class="lineNum"> 31 </span> : protected: -<span class="lineNum"> 32 </span> : int iFd; -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : enum LocalFlags {AutoClose = (1<<0),Fail = (1<<1),DelOnFail = (1<<2), -<span class="lineNum"> 35 </span> : HitEof = (1<<3)}; -<span class="lineNum"> 36 </span> : unsigned long Flags; -<span class="lineNum"> 37 </span> : string FileName; -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : public: -<span class="lineNum"> 40 </span> : enum OpenMode {ReadOnly,WriteEmpty,WriteExists,WriteAny,WriteTemp}; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : inline bool Read(void *To,unsigned long Size,bool AllowEof) -<span class="lineNum"> 43 </span> : { -<span class="lineNum"> 44 </span> : unsigned long Jnk; -<span class="lineNum"> 45 </span> : if (AllowEof) -<span class="lineNum"> 46 </span> : return Read(To,Size,&Jnk); -<span class="lineNum"> 47 </span> : return Read(To,Size); -<span class="lineNum"> 48 </span> : } -<span class="lineNum"> 49 </span> : bool Read(void *To,unsigned long Size,unsigned long *Actual = 0); -<span class="lineNum"> 50 </span> : bool Write(const void *From,unsigned long Size); -<span class="lineNum"> 51 </span> : bool Seek(unsigned long To); -<span class="lineNum"> 52 </span> : bool Skip(unsigned long To); -<span class="lineNum"> 53 </span> : bool Truncate(unsigned long To); -<span class="lineNum"> 54 </span> : unsigned long Tell(); -<span class="lineNum"> 55 </span> : unsigned long Size(); -<span class="lineNum"> 56 </span> : bool Open(string FileName,OpenMode Mode,unsigned long Perms = 0666); -<span class="lineNum"> 57 </span> : bool Close(); -<span class="lineNum"> 58 </span> : bool Sync(); -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : // Simple manipulators -<span class="lineNum"> 61 </span> : inline int Fd() {return iFd;}; -<span class="lineNum"> 62 </span> : inline void Fd(int fd) {iFd = fd;}; -<span class="lineNum"> 63 </span><span class="lineCov"> 32 : inline bool IsOpen() {return iFd >= 0;};</span> -<span class="lineNum"> 64 </span> : inline bool Failed() {return (Flags & Fail) == Fail;}; -<span class="lineNum"> 65 </span> : inline void EraseOnFailure() {Flags |= DelOnFail;}; -<span class="lineNum"> 66 </span> : inline void OpFail() {Flags |= Fail;}; -<span class="lineNum"> 67 </span> : inline bool Eof() {return (Flags & HitEof) == HitEof;}; -<span class="lineNum"> 68 </span> : inline string &Name() {return FileName;}; -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span><span class="lineCov"> 53 : FileFd(string FileName,OpenMode Mode,unsigned long Perms = 0666) : iFd(-1), </span> -<span class="lineNum"> 71 </span><span class="lineCov"> 53 : Flags(0) </span> -<span class="lineNum"> 72 </span> : { -<span class="lineNum"> 73 </span><span class="lineCov"> 53 : Open(FileName,Mode,Perms);</span> -<span class="lineNum"> 74 </span><span class="lineCov"> 53 : };</span> -<span class="lineNum"> 75 </span><span class="lineCov"> 15 : FileFd(int Fd = -1) : iFd(Fd), Flags(AutoClose) {};</span> -<span class="lineNum"> 76 </span> : FileFd(int Fd,bool) : iFd(Fd), Flags(0) {}; -<span class="lineNum"> 77 </span> : virtual ~FileFd(); -<span class="lineNum"> 78 </span> : }; -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : bool RunScripts(const char *Cnf); -<span class="lineNum"> 81 </span> : bool CopyFile(FileFd &From,FileFd &To); -<span class="lineNum"> 82 </span> : int GetLock(string File,bool Errors = true); -<span class="lineNum"> 83 </span> : bool FileExists(string File); -<span class="lineNum"> 84 </span> : string SafeGetCWD(); -<span class="lineNum"> 85 </span> : void SetCloseExec(int Fd,bool Close); -<span class="lineNum"> 86 </span> : void SetNonBlock(int Fd,bool Block); -<span class="lineNum"> 87 </span> : bool WaitFd(int Fd,bool write = false,unsigned long timeout = 0); -<span class="lineNum"> 88 </span> : pid_t ExecFork(); -<span class="lineNum"> 89 </span> : bool ExecWait(pid_t Pid,const char *Name,bool Reap = false); -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : // File string manipulators -<span class="lineNum"> 92 </span> : string flNotDir(string File); -<span class="lineNum"> 93 </span> : string flNotFile(string File); -<span class="lineNum"> 94 </span> : string flNoLink(string File); -<span class="lineNum"> 95 </span> : string flExtension(string File); -<span class="lineNum"> 96 </span> : string flCombine(string Dir,string File); -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/index.html b/rep/usr/include/apt-pkg/index.html deleted file mode 100644 index 659d250..0000000 --- a/rep/usr/include/apt-pkg/index.html +++ /dev/null @@ -1,164 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - /usr/include/apt-pkg</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">80</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">86.2 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">69</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="acquire.h.gcov.html">acquire.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 5 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="algorithms.h.gcov.html">algorithms.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=67 height=10 alt="66.7%"><img src="../../../snow.png" width=33 height=10 alt="66.7%"></td></tr></table> - </td> - <td class="coverPerHi">66.7 %</td> - <td class="coverNumHi">2 / 3 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="cachefile.h.gcov.html">cachefile.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="cacheiterators.h.gcov.html">cacheiterators.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=92 height=10 alt="92.2%"><img src="../../../snow.png" width=8 height=10 alt="92.2%"></td></tr></table> - </td> - <td class="coverPerHi">92.2 %</td> - <td class="coverNumHi">47 / 51 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="depcache.h.gcov.html">depcache.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">6 / 6 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="error.h.gcov.html">error.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table> - </td> - <td class="coverPerHi">50.0 %</td> - <td class="coverNumHi">1 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="fileutl.h.gcov.html">fileutl.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">6 / 6 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="pkgcache.h.gcov.html">pkgcache.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">2 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="progress.h.gcov.html">progress.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">3 / 3 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="version.h.gcov.html">version.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/pkgcache.h.gcov.html b/rep/usr/include/apt-pkg/pkgcache.h.gcov.html deleted file mode 100644 index aeda4f5..0000000 --- a/rep/usr/include/apt-pkg/pkgcache.h.gcov.html +++ /dev/null @@ -1,422 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/pkgcache.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - pkgcache.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: pkgcache.h,v 1.25 2001/07/01 22:28:24 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : Cache - Structure definitions for the cache file -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : Please see doc/apt-pkg/cache.sgml for a more detailed description of -<span class="lineNum"> 9 </span> : this format. Also be sure to keep that file up-to-date!! -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : Clients should always use the CacheIterators classes for access to the -<span class="lineNum"> 12 </span> : cache. They provide a simple STL-like method for traversing the links -<span class="lineNum"> 13 </span> : of the datastructure. -<span class="lineNum"> 14 </span> : -<span class="lineNum"> 15 </span> : See pkgcachegen.h for information about generating cache structures. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : ##################################################################### */ -<span class="lineNum"> 18 </span> : /*}}}*/ -<span class="lineNum"> 19 </span> : #ifndef PKGLIB_PKGCACHE_H -<span class="lineNum"> 20 </span> : #define PKGLIB_PKGCACHE_H -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : #include <string> -<span class="lineNum"> 24 </span> : #include <time.h> -<span class="lineNum"> 25 </span> : #include <apt-pkg/mmap.h> -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : using std::string; -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : class pkgVersioningSystem; -<span class="lineNum"> 30 </span> : class pkgCache -<span class="lineNum"> 31 </span> : { -<span class="lineNum"> 32 </span> : public: -<span class="lineNum"> 33 </span> : // Cache element predeclarations -<span class="lineNum"> 34 </span> : struct Header; -<span class="lineNum"> 35 </span> : struct Package; -<span class="lineNum"> 36 </span> : struct PackageFile; -<span class="lineNum"> 37 </span> : struct Version; -<span class="lineNum"> 38 </span> : struct Description; -<span class="lineNum"> 39 </span> : struct Provides; -<span class="lineNum"> 40 </span> : struct Dependency; -<span class="lineNum"> 41 </span> : struct StringItem; -<span class="lineNum"> 42 </span> : struct VerFile; -<span class="lineNum"> 43 </span> : struct DescFile; -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : // Iterators -<span class="lineNum"> 46 </span> : class PkgIterator; -<span class="lineNum"> 47 </span> : class VerIterator; -<span class="lineNum"> 48 </span> : class DescIterator; -<span class="lineNum"> 49 </span> : class DepIterator; -<span class="lineNum"> 50 </span> : class PrvIterator; -<span class="lineNum"> 51 </span> : class PkgFileIterator; -<span class="lineNum"> 52 </span> : class VerFileIterator; -<span class="lineNum"> 53 </span> : class DescFileIterator; -<span class="lineNum"> 54 </span> : friend class PkgIterator; -<span class="lineNum"> 55 </span> : friend class VerIterator; -<span class="lineNum"> 56 </span> : friend class DescInterator; -<span class="lineNum"> 57 </span> : friend class DepIterator; -<span class="lineNum"> 58 </span> : friend class PrvIterator; -<span class="lineNum"> 59 </span> : friend class PkgFileIterator; -<span class="lineNum"> 60 </span> : friend class VerFileIterator; -<span class="lineNum"> 61 </span> : friend class DescFileIterator; -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : class Namespace; -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : // These are all the constants used in the cache structures -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : // WARNING - if you change these lists you must also edit -<span class="lineNum"> 68 </span> : // the stringification in pkgcache.cc and also consider whether -<span class="lineNum"> 69 </span> : // the cache file will become incompatible. -<span class="lineNum"> 70 </span> : struct Dep -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span> : enum DepType {Depends=1,PreDepends=2,Suggests=3,Recommends=4, -<span class="lineNum"> 73 </span> : Conflicts=5,Replaces=6,Obsoletes=7,DpkgBreaks=8}; -<span class="lineNum"> 74 </span> : enum DepCompareOp {Or=0x10,NoOp=0,LessEq=0x1,GreaterEq=0x2,Less=0x3, -<span class="lineNum"> 75 </span> : Greater=0x4,Equals=0x5,NotEquals=0x6}; -<span class="lineNum"> 76 </span> : }; -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : struct State -<span class="lineNum"> 79 </span> : { -<span class="lineNum"> 80 </span> : enum VerPriority {Important=1,Required=2,Standard=3,Optional=4,Extra=5}; -<span class="lineNum"> 81 </span> : enum PkgSelectedState {Unknown=0,Install=1,Hold=2,DeInstall=3,Purge=4}; -<span class="lineNum"> 82 </span> : enum PkgInstState {Ok=0,ReInstReq=1,HoldInst=2,HoldReInstReq=3}; -<span class="lineNum"> 83 </span> : enum PkgCurrentState {NotInstalled=0,UnPacked=1,HalfConfigured=2, -<span class="lineNum"> 84 </span> : HalfInstalled=4,ConfigFiles=5,Installed=6, -<span class="lineNum"> 85 </span> : TriggersAwaited=7,TriggersPending=8}; -<span class="lineNum"> 86 </span> : }; -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : struct Flag -<span class="lineNum"> 89 </span> : { -<span class="lineNum"> 90 </span> : enum PkgFlags {Auto=(1<<0),Essential=(1<<3),Important=(1<<4)}; -<span class="lineNum"> 91 </span> : enum PkgFFlags {NotSource=(1<<0),NotAutomatic=(1<<1)}; -<span class="lineNum"> 92 </span> : }; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : protected: -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : // Memory mapped cache file -<span class="lineNum"> 97 </span> : string CacheFile; -<span class="lineNum"> 98 </span> : MMap &Map; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : unsigned long sHash(const string &S) const; -<span class="lineNum"> 101 </span> : unsigned long sHash(const char *S) const; -<span class="lineNum"> 102 </span> : -<span class="lineNum"> 103 </span> : public: -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : // Pointers to the arrays of items -<span class="lineNum"> 106 </span> : Header *HeaderP; -<span class="lineNum"> 107 </span> : Package *PkgP; -<span class="lineNum"> 108 </span> : VerFile *VerFileP; -<span class="lineNum"> 109 </span> : DescFile *DescFileP; -<span class="lineNum"> 110 </span> : PackageFile *PkgFileP; -<span class="lineNum"> 111 </span> : Version *VerP; -<span class="lineNum"> 112 </span> : Description *DescP; -<span class="lineNum"> 113 </span> : Provides *ProvideP; -<span class="lineNum"> 114 </span> : Dependency *DepP; -<span class="lineNum"> 115 </span> : StringItem *StringItemP; -<span class="lineNum"> 116 </span> : char *StrP; -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : virtual bool ReMap(); -<span class="lineNum"> 119 </span> : inline bool Sync() {return Map.Sync();}; -<span class="lineNum"> 120 </span> : inline MMap &GetMap() {return Map;}; -<span class="lineNum"> 121 </span> : inline void *DataEnd() {return ((unsigned char *)Map.Data()) + Map.Size();}; -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : // String hashing function (512 range) -<span class="lineNum"> 124 </span> : inline unsigned long Hash(const string &S) const {return sHash(S);}; -<span class="lineNum"> 125 </span> : inline unsigned long Hash(const char *S) const {return sHash(S);}; -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : // Usefull transformation things -<span class="lineNum"> 128 </span> : const char *Priority(unsigned char Priority); -<span class="lineNum"> 129 </span> : -<span class="lineNum"> 130 </span> : // Accessors -<span class="lineNum"> 131 </span> : PkgIterator FindPkg(const string &Name); -<span class="lineNum"> 132 </span> : Header &Head() {return *HeaderP;}; -<span class="lineNum"> 133 </span> : inline PkgIterator PkgBegin(); -<span class="lineNum"> 134 </span> : inline PkgIterator PkgEnd(); -<span class="lineNum"> 135 </span> : inline PkgFileIterator FileBegin(); -<span class="lineNum"> 136 </span> : inline PkgFileIterator FileEnd(); -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : // Make me a function -<span class="lineNum"> 139 </span> : pkgVersioningSystem *VS; -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : // Converters -<span class="lineNum"> 142 </span> : static const char *CompTypeDeb(unsigned char Comp); -<span class="lineNum"> 143 </span> : static const char *CompType(unsigned char Comp); -<span class="lineNum"> 144 </span> : static const char *DepType(unsigned char Dep); -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : pkgCache(MMap *Map,bool DoMap = true); -<span class="lineNum"> 147 </span> : virtual ~pkgCache() {}; -<span class="lineNum"> 148 </span> : }; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : // Header structure -<span class="lineNum"> 151 </span> : struct pkgCache::Header -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : // Signature information -<span class="lineNum"> 154 </span> : unsigned long Signature; -<span class="lineNum"> 155 </span> : short MajorVersion; -<span class="lineNum"> 156 </span> : short MinorVersion; -<span class="lineNum"> 157 </span> : bool Dirty; -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : // Size of structure values -<span class="lineNum"> 160 </span> : unsigned short HeaderSz; -<span class="lineNum"> 161 </span> : unsigned short PackageSz; -<span class="lineNum"> 162 </span> : unsigned short PackageFileSz; -<span class="lineNum"> 163 </span> : unsigned short VersionSz; -<span class="lineNum"> 164 </span> : unsigned short DescriptionSz; -<span class="lineNum"> 165 </span> : unsigned short DependencySz; -<span class="lineNum"> 166 </span> : unsigned short ProvidesSz; -<span class="lineNum"> 167 </span> : unsigned short VerFileSz; -<span class="lineNum"> 168 </span> : unsigned short DescFileSz; -<span class="lineNum"> 169 </span> : -<span class="lineNum"> 170 </span> : // Structure counts -<span class="lineNum"> 171 </span> : unsigned long PackageCount; -<span class="lineNum"> 172 </span> : unsigned long VersionCount; -<span class="lineNum"> 173 </span> : unsigned long DescriptionCount; -<span class="lineNum"> 174 </span> : unsigned long DependsCount; -<span class="lineNum"> 175 </span> : unsigned long PackageFileCount; -<span class="lineNum"> 176 </span> : unsigned long VerFileCount; -<span class="lineNum"> 177 </span> : unsigned long DescFileCount; -<span class="lineNum"> 178 </span> : unsigned long ProvidesCount; -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : // Offsets -<span class="lineNum"> 181 </span> : map_ptrloc FileList; // struct PackageFile -<span class="lineNum"> 182 </span> : map_ptrloc StringList; // struct StringItem -<span class="lineNum"> 183 </span> : map_ptrloc VerSysName; // StringTable -<span class="lineNum"> 184 </span> : map_ptrloc Architecture; // StringTable -<span class="lineNum"> 185 </span> : unsigned long MaxVerFileSize; -<span class="lineNum"> 186 </span> : unsigned long MaxDescFileSize; -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /* Allocation pools, there should be one of these for each structure -<span class="lineNum"> 189 </span> : excluding the header */ -<span class="lineNum"> 190 </span> : DynamicMMap::Pool Pools[8]; -<span class="lineNum"> 191 </span> : -<span class="lineNum"> 192 </span> : // Rapid package name lookup -<span class="lineNum"> 193 </span> : map_ptrloc HashTable[2*1048]; -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : bool CheckSizes(Header &Against) const; -<span class="lineNum"> 196 </span> : Header(); -<span class="lineNum"> 197 </span> : }; -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : struct pkgCache::Package -<span class="lineNum"> 200 </span> : { -<span class="lineNum"> 201 </span> : // Pointers -<span class="lineNum"> 202 </span> : map_ptrloc Name; // Stringtable -<span class="lineNum"> 203 </span> : map_ptrloc VersionList; // Version -<span class="lineNum"> 204 </span> : map_ptrloc CurrentVer; // Version -<span class="lineNum"> 205 </span> : map_ptrloc Section; // StringTable (StringItem) -<span class="lineNum"> 206 </span> : -<span class="lineNum"> 207 </span> : // Linked list -<span class="lineNum"> 208 </span> : map_ptrloc NextPackage; // Package -<span class="lineNum"> 209 </span> : map_ptrloc RevDepends; // Dependency -<span class="lineNum"> 210 </span> : map_ptrloc ProvidesList; // Provides -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : // Install/Remove/Purge etc -<span class="lineNum"> 213 </span> : unsigned char SelectedState; // What -<span class="lineNum"> 214 </span> : unsigned char InstState; // Flags -<span class="lineNum"> 215 </span> : unsigned char CurrentState; // State -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : unsigned short ID; -<span class="lineNum"> 218 </span> : unsigned long Flags; -<span class="lineNum"> 219 </span> : }; -<span class="lineNum"> 220 </span> : -<span class="lineNum"> 221 </span> : struct pkgCache::PackageFile -<span class="lineNum"> 222 </span> : { -<span class="lineNum"> 223 </span> : // Names -<span class="lineNum"> 224 </span> : map_ptrloc FileName; // Stringtable -<span class="lineNum"> 225 </span> : map_ptrloc Archive; // Stringtable -<span class="lineNum"> 226 </span> : map_ptrloc Component; // Stringtable -<span class="lineNum"> 227 </span> : map_ptrloc Version; // Stringtable -<span class="lineNum"> 228 </span> : map_ptrloc Origin; // Stringtable -<span class="lineNum"> 229 </span> : map_ptrloc Label; // Stringtable -<span class="lineNum"> 230 </span> : map_ptrloc Architecture; // Stringtable -<span class="lineNum"> 231 </span> : map_ptrloc Site; // Stringtable -<span class="lineNum"> 232 </span> : map_ptrloc IndexType; // Stringtable -<span class="lineNum"> 233 </span> : unsigned long Size; -<span class="lineNum"> 234 </span> : unsigned long Flags; -<span class="lineNum"> 235 </span> : -<span class="lineNum"> 236 </span> : // Linked list -<span class="lineNum"> 237 </span> : map_ptrloc NextFile; // PackageFile -<span class="lineNum"> 238 </span> : unsigned short ID; -<span class="lineNum"> 239 </span> : time_t mtime; // Modification time for the file -<span class="lineNum"> 240 </span> : }; -<span class="lineNum"> 241 </span> : -<span class="lineNum"> 242 </span> : struct pkgCache::VerFile -<span class="lineNum"> 243 </span> : { -<span class="lineNum"> 244 </span> : map_ptrloc File; // PackageFile -<span class="lineNum"> 245 </span> : map_ptrloc NextFile; // PkgVerFile -<span class="lineNum"> 246 </span> : map_ptrloc Offset; // File offset -<span class="lineNum"> 247 </span> : unsigned short Size; -<span class="lineNum"> 248 </span> : }; -<span class="lineNum"> 249 </span> : -<span class="lineNum"> 250 </span> : struct pkgCache::DescFile -<span class="lineNum"> 251 </span> : { -<span class="lineNum"> 252 </span> : map_ptrloc File; // PackageFile -<span class="lineNum"> 253 </span> : map_ptrloc NextFile; // PkgVerFile -<span class="lineNum"> 254 </span> : map_ptrloc Offset; // File offset -<span class="lineNum"> 255 </span> : unsigned short Size; -<span class="lineNum"> 256 </span> : }; -<span class="lineNum"> 257 </span> : -<span class="lineNum"> 258 </span> : struct pkgCache::Version -<span class="lineNum"> 259 </span> : { -<span class="lineNum"> 260 </span> : map_ptrloc VerStr; // Stringtable -<span class="lineNum"> 261 </span> : map_ptrloc Section; // StringTable (StringItem) -<span class="lineNum"> 262 </span> : map_ptrloc Arch; // StringTable -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : // Lists -<span class="lineNum"> 265 </span> : map_ptrloc FileList; // VerFile -<span class="lineNum"> 266 </span> : map_ptrloc NextVer; // Version -<span class="lineNum"> 267 </span> : map_ptrloc DescriptionList; // Description -<span class="lineNum"> 268 </span> : map_ptrloc DependsList; // Dependency -<span class="lineNum"> 269 </span> : map_ptrloc ParentPkg; // Package -<span class="lineNum"> 270 </span> : map_ptrloc ProvidesList; // Provides -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : map_ptrloc Size; // These are the .deb size -<span class="lineNum"> 273 </span> : map_ptrloc InstalledSize; -<span class="lineNum"> 274 </span> : unsigned short Hash; -<span class="lineNum"> 275 </span> : unsigned short ID; -<span class="lineNum"> 276 </span> : unsigned char Priority; -<span class="lineNum"> 277 </span> : }; -<span class="lineNum"> 278 </span> : -<span class="lineNum"> 279 </span> : struct pkgCache::Description -<span class="lineNum"> 280 </span> : { -<span class="lineNum"> 281 </span> : // Language Code store the description translation language code. If -<span class="lineNum"> 282 </span> : // the value has a 0 lenght then this is readed using the Package -<span class="lineNum"> 283 </span> : // file else the Translation-CODE are used. -<span class="lineNum"> 284 </span> : map_ptrloc language_code; // StringTable -<span class="lineNum"> 285 </span> : map_ptrloc md5sum; // StringTable -<span class="lineNum"> 286 </span> : -<span class="lineNum"> 287 </span> : // Linked list -<span class="lineNum"> 288 </span> : map_ptrloc FileList; // DescFile -<span class="lineNum"> 289 </span> : map_ptrloc NextDesc; // Description -<span class="lineNum"> 290 </span> : map_ptrloc ParentPkg; // Package -<span class="lineNum"> 291 </span> : -<span class="lineNum"> 292 </span> : unsigned short ID; -<span class="lineNum"> 293 </span> : }; -<span class="lineNum"> 294 </span> : -<span class="lineNum"> 295 </span> : struct pkgCache::Dependency -<span class="lineNum"> 296 </span> : { -<span class="lineNum"> 297 </span> : map_ptrloc Version; // Stringtable -<span class="lineNum"> 298 </span> : map_ptrloc Package; // Package -<span class="lineNum"> 299 </span> : map_ptrloc NextDepends; // Dependency -<span class="lineNum"> 300 </span> : map_ptrloc NextRevDepends; // Dependency -<span class="lineNum"> 301 </span> : map_ptrloc ParentVer; // Version -<span class="lineNum"> 302 </span> : -<span class="lineNum"> 303 </span> : // Specific types of depends -<span class="lineNum"> 304 </span> : map_ptrloc ID; -<span class="lineNum"> 305 </span> : unsigned char Type; -<span class="lineNum"> 306 </span> : unsigned char CompareOp; -<span class="lineNum"> 307 </span> : }; -<span class="lineNum"> 308 </span> : -<span class="lineNum"> 309 </span> : struct pkgCache::Provides -<span class="lineNum"> 310 </span> : { -<span class="lineNum"> 311 </span> : map_ptrloc ParentPkg; // Pacakge -<span class="lineNum"> 312 </span> : map_ptrloc Version; // Version -<span class="lineNum"> 313 </span> : map_ptrloc ProvideVersion; // Stringtable -<span class="lineNum"> 314 </span> : map_ptrloc NextProvides; // Provides -<span class="lineNum"> 315 </span> : map_ptrloc NextPkgProv; // Provides -<span class="lineNum"> 316 </span> : }; -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : struct pkgCache::StringItem -<span class="lineNum"> 319 </span> : { -<span class="lineNum"> 320 </span> : map_ptrloc String; // Stringtable -<span class="lineNum"> 321 </span> : map_ptrloc NextItem; // StringItem -<span class="lineNum"> 322 </span> : }; -<span class="lineNum"> 323 </span> : -<span class="lineNum"> 324 </span> : #include <apt-pkg/cacheiterators.h> -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span><span class="lineCov"> 19 : inline pkgCache::PkgIterator pkgCache::PkgBegin() </span> -<span class="lineNum"> 327 </span><span class="lineCov"> 19 : {return PkgIterator(*this);};</span> -<span class="lineNum"> 328 </span> : inline pkgCache::PkgIterator pkgCache::PkgEnd() -<span class="lineNum"> 329 </span> : {return PkgIterator(*this,PkgP);}; -<span class="lineNum"> 330 </span> : inline pkgCache::PkgFileIterator pkgCache::FileBegin() -<span class="lineNum"> 331 </span> : {return PkgFileIterator(*this,PkgFileP + HeaderP->FileList);}; -<span class="lineNum"> 332 </span> : inline pkgCache::PkgFileIterator pkgCache::FileEnd() -<span class="lineNum"> 333 </span> : {return PkgFileIterator(*this,PkgFileP);}; -<span class="lineNum"> 334 </span> : -<span class="lineNum"> 335 </span> : // Oh I wish for Real Name Space Support -<span class="lineNum"> 336 </span> : class pkgCache::Namespace -<span class="lineNum"> 337 </span> : { -<span class="lineNum"> 338 </span> : public: -<span class="lineNum"> 339 </span> : -<span class="lineNum"> 340 </span> : typedef pkgCache::PkgIterator PkgIterator; -<span class="lineNum"> 341 </span> : typedef pkgCache::VerIterator VerIterator; -<span class="lineNum"> 342 </span> : typedef pkgCache::DescIterator DescIterator; -<span class="lineNum"> 343 </span> : typedef pkgCache::DepIterator DepIterator; -<span class="lineNum"> 344 </span> : typedef pkgCache::PrvIterator PrvIterator; -<span class="lineNum"> 345 </span> : typedef pkgCache::PkgFileIterator PkgFileIterator; -<span class="lineNum"> 346 </span> : typedef pkgCache::VerFileIterator VerFileIterator; -<span class="lineNum"> 347 </span> : typedef pkgCache::Version Version; -<span class="lineNum"> 348 </span> : typedef pkgCache::Description Description; -<span class="lineNum"> 349 </span> : typedef pkgCache::Package Package; -<span class="lineNum"> 350 </span> : typedef pkgCache::Header Header; -<span class="lineNum"> 351 </span> : typedef pkgCache::Dep Dep; -<span class="lineNum"> 352 </span> : typedef pkgCache::Flag Flag; -<span class="lineNum"> 353 </span> : }; -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/progress.h.gcov.html b/rep/usr/include/apt-pkg/progress.h.gcov.html deleted file mode 100644 index 6dce14e..0000000 --- a/rep/usr/include/apt-pkg/progress.h.gcov.html +++ /dev/null @@ -1,156 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/progress.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - progress.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: progress.h,v 1.6 2001/05/07 05:06:52 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : OpProgress - Operation Progress -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : This class allows lengthy operations to communicate their progress -<span class="lineNum"> 9 </span> : to the GUI. The progress model is simple and is not designed to handle -<span class="lineNum"> 10 </span> : the complex case of the multi-activity aquire class. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : The model is based on the concept of an overall operation consisting -<span class="lineNum"> 13 </span> : of a series of small sub operations. Each sub operation has it's own -<span class="lineNum"> 14 </span> : completion status and the overall operation has it's completion status. -<span class="lineNum"> 15 </span> : The units of the two are not mixed and are completely independent. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : The UI is expected to subclass this to provide the visuals to the user. -<span class="lineNum"> 18 </span> : -<span class="lineNum"> 19 </span> : ##################################################################### */ -<span class="lineNum"> 20 </span> : /*}}}*/ -<span class="lineNum"> 21 </span> : #ifndef PKGLIB_PROGRESS_H -<span class="lineNum"> 22 </span> : #define PKGLIB_PROGRESS_H -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : -<span class="lineNum"> 25 </span> : #include <string> -<span class="lineNum"> 26 </span> : #include <sys/time.h> -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : using std::string; -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : class Configuration; -<span class="lineNum"> 31 </span> : class OpProgress -<span class="lineNum"> 32 </span> : { -<span class="lineNum"> 33 </span> : unsigned long Current; -<span class="lineNum"> 34 </span> : unsigned long Total; -<span class="lineNum"> 35 </span> : unsigned long Size; -<span class="lineNum"> 36 </span> : unsigned long SubTotal; -<span class="lineNum"> 37 </span> : float LastPercent; -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : // Change reduction code -<span class="lineNum"> 40 </span> : struct timeval LastTime; -<span class="lineNum"> 41 </span> : string LastOp; -<span class="lineNum"> 42 </span> : string LastSubOp; -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : protected: -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : string Op; -<span class="lineNum"> 47 </span> : string SubOp; -<span class="lineNum"> 48 </span> : float Percent; -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : bool MajorChange; -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : bool CheckChange(float Interval = 0.7); -<span class="lineNum"> 53 </span><span class="lineCov"> 24433 : virtual void Update() {};</span> -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : public: -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : void Progress(unsigned long Current); -<span class="lineNum"> 58 </span> : void SubProgress(unsigned long SubTotal); -<span class="lineNum"> 59 </span> : void SubProgress(unsigned long SubTotal,const string &Op); -<span class="lineNum"> 60 </span> : void OverallProgress(unsigned long Current,unsigned long Total, -<span class="lineNum"> 61 </span> : unsigned long Size,const string &Op); -<span class="lineNum"> 62 </span><span class="lineCov"> 62 : virtual void Done() {};</span> -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : OpProgress(); -<span class="lineNum"> 65 </span><span class="lineCov"> 29 : virtual ~OpProgress() {};</span> -<span class="lineNum"> 66 </span> : }; -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : class OpTextProgress : public OpProgress -<span class="lineNum"> 69 </span> : { -<span class="lineNum"> 70 </span> : protected: -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : string OldOp; -<span class="lineNum"> 73 </span> : bool NoUpdate; -<span class="lineNum"> 74 </span> : bool NoDisplay; -<span class="lineNum"> 75 </span> : unsigned long LastLen; -<span class="lineNum"> 76 </span> : virtual void Update(); -<span class="lineNum"> 77 </span> : void Write(const char *S); -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : public: -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : virtual void Done(); -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : OpTextProgress(bool NoUpdate = false) : NoUpdate(NoUpdate), -<span class="lineNum"> 84 </span> : NoDisplay(false), LastLen(0) {}; -<span class="lineNum"> 85 </span> : OpTextProgress(Configuration &Config); -<span class="lineNum"> 86 </span> : virtual ~OpTextProgress() {Done();}; -<span class="lineNum"> 87 </span> : }; -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/apt-pkg/version.h.gcov.html b/rep/usr/include/apt-pkg/version.h.gcov.html deleted file mode 100644 index 6bcff73..0000000 --- a/rep/usr/include/apt-pkg/version.h.gcov.html +++ /dev/null @@ -1,131 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/apt-pkg/version.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/apt-pkg</a> - version.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- mode: cpp; mode: fold -*- -<span class="lineNum"> 2 </span> : // Description /*{{{*/ -<span class="lineNum"> 3 </span> : // $Id: version.h,v 1.8 2001/05/27 05:55:27 jgg Exp $ -<span class="lineNum"> 4 </span> : /* ###################################################################### -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : Version - Versioning system.. -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : The versioning system represents how versions are compared, represented -<span class="lineNum"> 9 </span> : and how dependencies are evaluated. As a general rule versioning -<span class="lineNum"> 10 </span> : systems are not compatible unless specifically allowed by the -<span class="lineNum"> 11 </span> : TestCompatibility query. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : The versions are stored in a global list of versions, but that is just -<span class="lineNum"> 14 </span> : so that they can be queried when someone does 'apt-get -v'. -<span class="lineNum"> 15 </span> : pkgSystem provides the proper means to access the VS for the active -<span class="lineNum"> 16 </span> : system. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : ##################################################################### */ -<span class="lineNum"> 19 </span> : /*}}}*/ -<span class="lineNum"> 20 </span> : #ifndef PKGLIB_VERSION_H -<span class="lineNum"> 21 </span> : #define PKGLIB_VERSION_H -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <apt-pkg/strutl.h> -<span class="lineNum"> 25 </span> : #include <string> -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : using std::string; -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : class pkgVersioningSystem -<span class="lineNum"> 30 </span> : { -<span class="lineNum"> 31 </span> : public: -<span class="lineNum"> 32 </span> : // Global list of VS's -<span class="lineNum"> 33 </span> : static pkgVersioningSystem **GlobalList; -<span class="lineNum"> 34 </span> : static unsigned long GlobalListLen; -<span class="lineNum"> 35 </span> : static pkgVersioningSystem *GetVS(const char *Label); -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : const char *Label; -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : // Compare versions.. -<span class="lineNum"> 40 </span> : virtual int DoCmpVersion(const char *A,const char *Aend, -<span class="lineNum"> 41 </span> : const char *B,const char *Bend) = 0; -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : virtual bool CheckDep(const char *PkgVer,int Op,const char *DepVer) = 0; -<span class="lineNum"> 44 </span> : virtual int DoCmpReleaseVer(const char *A,const char *Aend, -<span class="lineNum"> 45 </span> : const char *B,const char *Bend) = 0; -<span class="lineNum"> 46 </span> : virtual string UpstreamVersion(const char *A) = 0; -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : // See if the given VS is compatible with this one.. -<span class="lineNum"> 49 </span> : virtual bool TestCompatibility(pkgVersioningSystem const &Against) -<span class="lineNum"> 50 </span> : {return this == &Against;}; -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : // Shortcuts -<span class="lineNum"> 53 </span><span class="lineCov"> 14 : APT_MKSTRCMP(CmpVersion,DoCmpVersion);</span> -<span class="lineNum"> 54 </span> : APT_MKSTRCMP(CmpReleaseVer,DoCmpReleaseVer); -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : pkgVersioningSystem(); -<span class="lineNum"> 57 </span> : virtual ~pkgVersioningSystem() {}; -<span class="lineNum"> 58 </span> : }; -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : #ifdef APT_COMPATIBILITY -<span class="lineNum"> 61 </span> : #include <apt-pkg/debversion.h> -<span class="lineNum"> 62 </span> : #endif -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/backward/auto_ptr.h.gcov.html b/rep/usr/include/c++/4.3/backward/auto_ptr.h.gcov.html deleted file mode 100644 index 4afaec9..0000000 --- a/rep/usr/include/c++/4.3/backward/auto_ptr.h.gcov.html +++ /dev/null @@ -1,364 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/backward/auto_ptr.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/backward</a> - auto_ptr.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">15</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">15</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // auto_ptr implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2007, 2008 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 7 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 8 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 9 </span> : // any later version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : // GNU General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 17 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 18 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 19 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 22 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 23 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 24 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 25 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 26 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 27 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** @file backward/auto_ptr.h -<span class="lineNum"> 31 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 32 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : #ifndef _STL_AUTO_PTR_H -<span class="lineNum"> 36 </span> : #define _STL_AUTO_PTR_H 1 -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #include <bits/c++config.h> -<span class="lineNum"> 39 </span> : #include <debug/debug.h> -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : /** -<span class="lineNum"> 44 </span> : * A wrapper class to provide auto_ptr with reference semantics. -<span class="lineNum"> 45 </span> : * For example, an auto_ptr can be assigned (or constructed from) -<span class="lineNum"> 46 </span> : * the result of a function which returns an auto_ptr by value. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * All the auto_ptr_ref stuff should happen behind the scenes. -<span class="lineNum"> 49 </span> : */ -<span class="lineNum"> 50 </span> : template<typename _Tp1> -<span class="lineNum"> 51 </span> : struct auto_ptr_ref -<span class="lineNum"> 52 </span> : { -<span class="lineNum"> 53 </span> : _Tp1* _M_ptr; -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : explicit -<span class="lineNum"> 56 </span><span class="lineCov"> 666 : auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }</span> -<span class="lineNum"> 57 </span> : } _GLIBCXX_DEPRECATED_ATTR; -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : /** -<span class="lineNum"> 61 </span> : * @brief A simple smart pointer providing strict ownership semantics. -<span class="lineNum"> 62 </span> : * -<span class="lineNum"> 63 </span> : * The Standard says: -<span class="lineNum"> 64 </span> : * <pre> -<span class="lineNum"> 65 </span> : * An @c auto_ptr owns the object it holds a pointer to. Copying -<span class="lineNum"> 66 </span> : * an @c auto_ptr copies the pointer and transfers ownership to the -<span class="lineNum"> 67 </span> : * destination. If more than one @c auto_ptr owns the same object -<span class="lineNum"> 68 </span> : * at the same time the behavior of the program is undefined. -<span class="lineNum"> 69 </span> : * -<span class="lineNum"> 70 </span> : * The uses of @c auto_ptr include providing temporary -<span class="lineNum"> 71 </span> : * exception-safety for dynamically allocated memory, passing -<span class="lineNum"> 72 </span> : * ownership of dynamically allocated memory to a function, and -<span class="lineNum"> 73 </span> : * returning dynamically allocated memory from a function. @c -<span class="lineNum"> 74 </span> : * auto_ptr does not meet the CopyConstructible and Assignable -<span class="lineNum"> 75 </span> : * requirements for Standard Library <a -<span class="lineNum"> 76 </span> : * href="tables.html#65">container</a> elements and thus -<span class="lineNum"> 77 </span> : * instantiating a Standard Library container with an @c auto_ptr -<span class="lineNum"> 78 </span> : * results in undefined behavior. -<span class="lineNum"> 79 </span> : * </pre> -<span class="lineNum"> 80 </span> : * Quoted from [20.4.5]/3. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * Good examples of what can and cannot be done with auto_ptr can -<span class="lineNum"> 83 </span> : * be found in the libstdc++ testsuite. -<span class="lineNum"> 84 </span> : * -<span class="lineNum"> 85 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 86 </span> : * 127. auto_ptr<> conversion issues -<span class="lineNum"> 87 </span> : * These resolutions have all been incorporated. -<span class="lineNum"> 88 </span> : */ -<span class="lineNum"> 89 </span> : template<typename _Tp> -<span class="lineNum"> 90 </span> : class auto_ptr -<span class="lineNum"> 91 </span> : { -<span class="lineNum"> 92 </span> : private: -<span class="lineNum"> 93 </span> : _Tp* _M_ptr; -<span class="lineNum"> 94 </span> : -<span class="lineNum"> 95 </span> : public: -<span class="lineNum"> 96 </span> : /// The pointed-to type. -<span class="lineNum"> 97 </span> : typedef _Tp element_type; -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : /** -<span class="lineNum"> 100 </span> : * @brief An %auto_ptr is usually constructed from a raw pointer. -<span class="lineNum"> 101 </span> : * @param p A pointer (defaults to NULL). -<span class="lineNum"> 102 </span> : * -<span class="lineNum"> 103 </span> : * This object now @e owns the object pointed to by @a p. -<span class="lineNum"> 104 </span> : */ -<span class="lineNum"> 105 </span> : explicit -<span class="lineNum"> 106 </span><span class="lineCov"> 666 : auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }</span> -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : /** -<span class="lineNum"> 109 </span> : * @brief An %auto_ptr can be constructed from another %auto_ptr. -<span class="lineNum"> 110 </span> : * @param a Another %auto_ptr of the same type. -<span class="lineNum"> 111 </span> : * -<span class="lineNum"> 112 </span> : * This object now @e owns the object previously owned by @a a, -<span class="lineNum"> 113 </span> : * which has given up ownership. -<span class="lineNum"> 114 </span> : */ -<span class="lineNum"> 115 </span><span class="lineCov"> 590 : auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }</span> -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : /** -<span class="lineNum"> 118 </span> : * @brief An %auto_ptr can be constructed from another %auto_ptr. -<span class="lineNum"> 119 </span> : * @param a Another %auto_ptr of a different but related type. -<span class="lineNum"> 120 </span> : * -<span class="lineNum"> 121 </span> : * A pointer-to-Tp1 must be convertible to a -<span class="lineNum"> 122 </span> : * pointer-to-Tp/element_type. -<span class="lineNum"> 123 </span> : * -<span class="lineNum"> 124 </span> : * This object now @e owns the object previously owned by @a a, -<span class="lineNum"> 125 </span> : * which has given up ownership. -<span class="lineNum"> 126 </span> : */ -<span class="lineNum"> 127 </span> : template<typename _Tp1> -<span class="lineNum"> 128 </span> : auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { } -<span class="lineNum"> 129 </span> : -<span class="lineNum"> 130 </span> : /** -<span class="lineNum"> 131 </span> : * @brief %auto_ptr assignment operator. -<span class="lineNum"> 132 </span> : * @param a Another %auto_ptr of the same type. -<span class="lineNum"> 133 </span> : * -<span class="lineNum"> 134 </span> : * This object now @e owns the object previously owned by @a a, -<span class="lineNum"> 135 </span> : * which has given up ownership. The object that this one @e -<span class="lineNum"> 136 </span> : * used to own and track has been deleted. -<span class="lineNum"> 137 </span> : */ -<span class="lineNum"> 138 </span> : auto_ptr& -<span class="lineNum"> 139 </span> : operator=(auto_ptr& __a) throw() -<span class="lineNum"> 140 </span> : { -<span class="lineNum"> 141 </span> : reset(__a.release()); -<span class="lineNum"> 142 </span> : return *this; -<span class="lineNum"> 143 </span> : } -<span class="lineNum"> 144 </span> : -<span class="lineNum"> 145 </span> : /** -<span class="lineNum"> 146 </span> : * @brief %auto_ptr assignment operator. -<span class="lineNum"> 147 </span> : * @param a Another %auto_ptr of a different but related type. -<span class="lineNum"> 148 </span> : * -<span class="lineNum"> 149 </span> : * A pointer-to-Tp1 must be convertible to a pointer-to-Tp/element_type. -<span class="lineNum"> 150 </span> : * -<span class="lineNum"> 151 </span> : * This object now @e owns the object previously owned by @a a, -<span class="lineNum"> 152 </span> : * which has given up ownership. The object that this one @e -<span class="lineNum"> 153 </span> : * used to own and track has been deleted. -<span class="lineNum"> 154 </span> : */ -<span class="lineNum"> 155 </span> : template<typename _Tp1> -<span class="lineNum"> 156 </span> : auto_ptr& -<span class="lineNum"> 157 </span> : operator=(auto_ptr<_Tp1>& __a) throw() -<span class="lineNum"> 158 </span> : { -<span class="lineNum"> 159 </span> : reset(__a.release()); -<span class="lineNum"> 160 </span> : return *this; -<span class="lineNum"> 161 </span> : } -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : /** -<span class="lineNum"> 164 </span> : * When the %auto_ptr goes out of scope, the object it owns is -<span class="lineNum"> 165 </span> : * deleted. If it no longer owns anything (i.e., @c get() is -<span class="lineNum"> 166 </span> : * @c NULL), then this has no effect. -<span class="lineNum"> 167 </span> : * -<span class="lineNum"> 168 </span> : * The C++ standard says there is supposed to be an empty throw -<span class="lineNum"> 169 </span> : * specification here, but omitting it is standard conforming. Its -<span class="lineNum"> 170 </span> : * presence can be detected only if _Tp::~_Tp() throws, but this is -<span class="lineNum"> 171 </span> : * prohibited. [17.4.3.6]/2 -<span class="lineNum"> 172 </span> : */ -<span class="lineNum"> 173 </span><span class="lineCov"> 1922 : ~auto_ptr() { delete _M_ptr; }</span> -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : /** -<span class="lineNum"> 176 </span> : * @brief Smart pointer dereferencing. -<span class="lineNum"> 177 </span> : * -<span class="lineNum"> 178 </span> : * If this %auto_ptr no longer owns anything, then this -<span class="lineNum"> 179 </span> : * operation will crash. (For a smart pointer, "no longer owns -<span class="lineNum"> 180 </span> : * anything" is the same as being a null pointer, and you know -<span class="lineNum"> 181 </span> : * what happens when you dereference one of those...) -<span class="lineNum"> 182 </span> : */ -<span class="lineNum"> 183 </span> : element_type& -<span class="lineNum"> 184 </span> : operator*() const throw() -<span class="lineNum"> 185 </span> : { -<span class="lineNum"> 186 </span> : _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); -<span class="lineNum"> 187 </span> : return *_M_ptr; -<span class="lineNum"> 188 </span> : } -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : /** -<span class="lineNum"> 191 </span> : * @brief Smart pointer dereferencing. -<span class="lineNum"> 192 </span> : * -<span class="lineNum"> 193 </span> : * This returns the pointer itself, which the language then will -<span class="lineNum"> 194 </span> : * automatically cause to be dereferenced. -<span class="lineNum"> 195 </span> : */ -<span class="lineNum"> 196 </span> : element_type* -<span class="lineNum"> 197 </span><span class="lineCov"> 590 : operator->() const throw() </span> -<span class="lineNum"> 198 </span> : { -<span class="lineNum"> 199 </span> : _GLIBCXX_DEBUG_ASSERT(_M_ptr != 0); -<span class="lineNum"> 200 </span><span class="lineCov"> 590 : return _M_ptr; </span> -<span class="lineNum"> 201 </span> : } -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : /** -<span class="lineNum"> 204 </span> : * @brief Bypassing the smart pointer. -<span class="lineNum"> 205 </span> : * @return The raw pointer being managed. -<span class="lineNum"> 206 </span> : * -<span class="lineNum"> 207 </span> : * You can get a copy of the pointer that this object owns, for -<span class="lineNum"> 208 </span> : * situations such as passing to a function which only accepts -<span class="lineNum"> 209 </span> : * a raw pointer. -<span class="lineNum"> 210 </span> : * -<span class="lineNum"> 211 </span> : * @note This %auto_ptr still owns the memory. -<span class="lineNum"> 212 </span> : */ -<span class="lineNum"> 213 </span> : element_type* -<span class="lineNum"> 214 </span><span class="lineCov"> 1256 : get() const throw() { return _M_ptr; }</span> -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : /** -<span class="lineNum"> 217 </span> : * @brief Bypassing the smart pointer. -<span class="lineNum"> 218 </span> : * @return The raw pointer being managed. -<span class="lineNum"> 219 </span> : * -<span class="lineNum"> 220 </span> : * You can get a copy of the pointer that this object owns, for -<span class="lineNum"> 221 </span> : * situations such as passing to a function which only accepts -<span class="lineNum"> 222 </span> : * a raw pointer. -<span class="lineNum"> 223 </span> : * -<span class="lineNum"> 224 </span> : * @note This %auto_ptr no longer owns the memory. When this object -<span class="lineNum"> 225 </span> : * goes out of scope, nothing will happen. -<span class="lineNum"> 226 </span> : */ -<span class="lineNum"> 227 </span> : element_type* -<span class="lineNum"> 228 </span><span class="lineCov"> 1256 : release() throw()</span> -<span class="lineNum"> 229 </span> : { -<span class="lineNum"> 230 </span><span class="lineCov"> 1256 : element_type* __tmp = _M_ptr;</span> -<span class="lineNum"> 231 </span><span class="lineCov"> 1256 : _M_ptr = 0;</span> -<span class="lineNum"> 232 </span><span class="lineCov"> 1256 : return __tmp;</span> -<span class="lineNum"> 233 </span> : } -<span class="lineNum"> 234 </span> : -<span class="lineNum"> 235 </span> : /** -<span class="lineNum"> 236 </span> : * @brief Forcibly deletes the managed object. -<span class="lineNum"> 237 </span> : * @param p A pointer (defaults to NULL). -<span class="lineNum"> 238 </span> : * -<span class="lineNum"> 239 </span> : * This object now @e owns the object pointed to by @a p. The -<span class="lineNum"> 240 </span> : * previous object has been deleted. -<span class="lineNum"> 241 </span> : */ -<span class="lineNum"> 242 </span> : void -<span class="lineNum"> 243 </span> : reset(element_type* __p = 0) throw() -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : if (__p != _M_ptr) -<span class="lineNum"> 246 </span> : { -<span class="lineNum"> 247 </span> : delete _M_ptr; -<span class="lineNum"> 248 </span> : _M_ptr = __p; -<span class="lineNum"> 249 </span> : } -<span class="lineNum"> 250 </span> : } -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : /** -<span class="lineNum"> 253 </span> : * @brief Automatic conversions -<span class="lineNum"> 254 </span> : * -<span class="lineNum"> 255 </span> : * These operations convert an %auto_ptr into and from an auto_ptr_ref -<span class="lineNum"> 256 </span> : * automatically as needed. This allows constructs such as -<span class="lineNum"> 257 </span> : * @code -<span class="lineNum"> 258 </span> : * auto_ptr<Derived> func_returning_auto_ptr(.....); -<span class="lineNum"> 259 </span> : * ... -<span class="lineNum"> 260 </span> : * auto_ptr<Base> ptr = func_returning_auto_ptr(.....); -<span class="lineNum"> 261 </span> : * @endcode -<span class="lineNum"> 262 </span> : */ -<span class="lineNum"> 263 </span><span class="lineCov"> 666 : auto_ptr(auto_ptr_ref<element_type> __ref) throw()</span> -<span class="lineNum"> 264 </span><span class="lineCov"> 666 : : _M_ptr(__ref._M_ptr) { }</span> -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : auto_ptr& -<span class="lineNum"> 267 </span> : operator=(auto_ptr_ref<element_type> __ref) throw() -<span class="lineNum"> 268 </span> : { -<span class="lineNum"> 269 </span> : if (__ref._M_ptr != this->get()) -<span class="lineNum"> 270 </span> : { -<span class="lineNum"> 271 </span> : delete _M_ptr; -<span class="lineNum"> 272 </span> : _M_ptr = __ref._M_ptr; -<span class="lineNum"> 273 </span> : } -<span class="lineNum"> 274 </span> : return *this; -<span class="lineNum"> 275 </span> : } -<span class="lineNum"> 276 </span> : -<span class="lineNum"> 277 </span> : template<typename _Tp1> -<span class="lineNum"> 278 </span><span class="lineCov"> 666 : operator auto_ptr_ref<_Tp1>() throw()</span> -<span class="lineNum"> 279 </span><span class="lineCov"> 666 : { return auto_ptr_ref<_Tp1>(this->release()); }</span> -<span class="lineNum"> 280 </span> : -<span class="lineNum"> 281 </span> : template<typename _Tp1> -<span class="lineNum"> 282 </span> : operator auto_ptr<_Tp1>() throw() -<span class="lineNum"> 283 </span> : { return auto_ptr<_Tp1>(this->release()); } -<span class="lineNum"> 284 </span> : } _GLIBCXX_DEPRECATED_ATTR; -<span class="lineNum"> 285 </span> : -<span class="lineNum"> 286 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 287 </span> : // 541. shared_ptr template assignment and void -<span class="lineNum"> 288 </span> : template<> -<span class="lineNum"> 289 </span> : class auto_ptr<void> -<span class="lineNum"> 290 </span> : { -<span class="lineNum"> 291 </span> : public: -<span class="lineNum"> 292 </span> : typedef void element_type; -<span class="lineNum"> 293 </span> : } _GLIBCXX_DEPRECATED_ATTR; -<span class="lineNum"> 294 </span> : -<span class="lineNum"> 295 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 296 </span> : -<span class="lineNum"> 297 </span> : #endif /* _STL_AUTO_PTR_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/backward/binders.h.gcov.html b/rep/usr/include/c++/4.3/backward/binders.h.gcov.html deleted file mode 100644 index 861e1d9..0000000 --- a/rep/usr/include/c++/4.3/backward/binders.h.gcov.html +++ /dev/null @@ -1,238 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/backward/binders.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/backward</a> - binders.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">7</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">7</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Functor implementations -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1998 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file backward/binders.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _GLIBCXX_BINDERS_H -<span class="lineNum"> 63 </span> : #define _GLIBCXX_BINDERS_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : // 20.3.6 binders -<span class="lineNum"> 68 </span> : /** @defgroup s20_3_6_binder Binder Classes -<span class="lineNum"> 69 </span> : * Binders turn functions/functors with two arguments into functors with -<span class="lineNum"> 70 </span> : * a single argument, storing an argument to be applied later. For -<span class="lineNum"> 71 </span> : * example, a variable @c B of type @c binder1st is constructed from a -<span class="lineNum"> 72 </span> : * functor @c f and an argument @c x. Later, B's @c operator() is called -<span class="lineNum"> 73 </span> : * with a single argument @c y. The return value is the value of @c f(x,y). -<span class="lineNum"> 74 </span> : * @c B can be "called" with various arguments (y1, y2, ...) and will in -<span class="lineNum"> 75 </span> : * turn call @c f(x,y1), @c f(x,y2), ... -<span class="lineNum"> 76 </span> : * -<span class="lineNum"> 77 </span> : * The function @c bind1st is provided to save some typing. It takes the -<span class="lineNum"> 78 </span> : * function and an argument as parameters, and returns an instance of -<span class="lineNum"> 79 </span> : * @c binder1st. -<span class="lineNum"> 80 </span> : * -<span class="lineNum"> 81 </span> : * The type @c binder2nd and its creator function @c bind2nd do the same -<span class="lineNum"> 82 </span> : * thing, but the stored argument is passed as the second parameter instead -<span class="lineNum"> 83 </span> : * of the first, e.g., @c bind2nd(std::minus<float>,1.3) will create a -<span class="lineNum"> 84 </span> : * functor whose @c operator() accepts a floating-point number, subtracts -<span class="lineNum"> 85 </span> : * 1.3 from it, and returns the result. (If @c bind1st had been used, -<span class="lineNum"> 86 </span> : * the functor would perform "1.3 - x" instead. -<span class="lineNum"> 87 </span> : * -<span class="lineNum"> 88 </span> : * Creator-wrapper functions like @c bind1st are intended to be used in -<span class="lineNum"> 89 </span> : * calling algorithms. Their return values will be temporary objects. -<span class="lineNum"> 90 </span> : * (The goal is to not require you to type names like -<span class="lineNum"> 91 </span> : * @c std::binder1st<std::plus<int>> for declaring a variable to hold the -<span class="lineNum"> 92 </span> : * return value from @c bind1st(std::plus<int>,5). -<span class="lineNum"> 93 </span> : * -<span class="lineNum"> 94 </span> : * These become more useful when combined with the composition functions. -<span class="lineNum"> 95 </span> : * -<span class="lineNum"> 96 </span> : * @{ -<span class="lineNum"> 97 </span> : */ -<span class="lineNum"> 98 </span> : /// One of the @link s20_3_6_binder binder functors@endlink. -<span class="lineNum"> 99 </span> : template<typename _Operation> -<span class="lineNum"> 100 </span> : class binder1st -<span class="lineNum"> 101 </span> : : public unary_function<typename _Operation::second_argument_type, -<span class="lineNum"> 102 </span> : typename _Operation::result_type> -<span class="lineNum"> 103 </span><span class="lineCov"> 16 : {</span> -<span class="lineNum"> 104 </span> : protected: -<span class="lineNum"> 105 </span> : _Operation op; -<span class="lineNum"> 106 </span> : typename _Operation::first_argument_type value; -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : public: -<span class="lineNum"> 109 </span> : binder1st(const _Operation& __x, -<span class="lineNum"> 110 </span><span class="lineCov"> 19 : const typename _Operation::first_argument_type& __y)</span> -<span class="lineNum"> 111 </span><span class="lineCov"> 19 : : op(__x), value(__y) { }</span> -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : typename _Operation::result_type -<span class="lineNum"> 114 </span><span class="lineCov"> 70 : operator()(const typename _Operation::second_argument_type& __x) const</span> -<span class="lineNum"> 115 </span><span class="lineCov"> 70 : { return op(value, __x); }</span> -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 118 </span> : // 109. Missing binders for non-const sequence elements -<span class="lineNum"> 119 </span> : typename _Operation::result_type -<span class="lineNum"> 120 </span> : operator()(typename _Operation::second_argument_type& __x) const -<span class="lineNum"> 121 </span> : { return op(value, __x); } -<span class="lineNum"> 122 </span> : } _GLIBCXX_DEPRECATED_ATTR; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : /// One of the @link s20_3_6_binder binder functors@endlink. -<span class="lineNum"> 125 </span> : template<typename _Operation, typename _Tp> -<span class="lineNum"> 126 </span> : inline binder1st<_Operation> -<span class="lineNum"> 127 </span><span class="lineCov"> 19 : bind1st(const _Operation& __fn, const _Tp& __x)</span> -<span class="lineNum"> 128 </span> : { -<span class="lineNum"> 129 </span> : typedef typename _Operation::first_argument_type _Arg1_type; -<span class="lineNum"> 130 </span><span class="lineCov"> 19 : return binder1st<_Operation>(__fn, _Arg1_type(__x));</span> -<span class="lineNum"> 131 </span> : } -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : /// One of the @link s20_3_6_binder binder functors@endlink. -<span class="lineNum"> 134 </span> : template<typename _Operation> -<span class="lineNum"> 135 </span> : class binder2nd -<span class="lineNum"> 136 </span> : : public unary_function<typename _Operation::first_argument_type, -<span class="lineNum"> 137 </span> : typename _Operation::result_type> -<span class="lineNum"> 138 </span> : { -<span class="lineNum"> 139 </span> : protected: -<span class="lineNum"> 140 </span> : _Operation op; -<span class="lineNum"> 141 </span> : typename _Operation::second_argument_type value; -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : public: -<span class="lineNum"> 144 </span> : binder2nd(const _Operation& __x, -<span class="lineNum"> 145 </span> : const typename _Operation::second_argument_type& __y) -<span class="lineNum"> 146 </span> : : op(__x), value(__y) { } -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : typename _Operation::result_type -<span class="lineNum"> 149 </span> : operator()(const typename _Operation::first_argument_type& __x) const -<span class="lineNum"> 150 </span> : { return op(__x, value); } -<span class="lineNum"> 151 </span> : -<span class="lineNum"> 152 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 153 </span> : // 109. Missing binders for non-const sequence elements -<span class="lineNum"> 154 </span> : typename _Operation::result_type -<span class="lineNum"> 155 </span> : operator()(typename _Operation::first_argument_type& __x) const -<span class="lineNum"> 156 </span> : { return op(__x, value); } -<span class="lineNum"> 157 </span> : } _GLIBCXX_DEPRECATED_ATTR; -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : /// One of the @link s20_3_6_binder binder functors@endlink. -<span class="lineNum"> 160 </span> : template<typename _Operation, typename _Tp> -<span class="lineNum"> 161 </span> : inline binder2nd<_Operation> -<span class="lineNum"> 162 </span> : bind2nd(const _Operation& __fn, const _Tp& __x) -<span class="lineNum"> 163 </span> : { -<span class="lineNum"> 164 </span> : typedef typename _Operation::second_argument_type _Arg2_type; -<span class="lineNum"> 165 </span> : return binder2nd<_Operation>(__fn, _Arg2_type(__x)); -<span class="lineNum"> 166 </span> : } -<span class="lineNum"> 167 </span> : /** @} */ -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : #endif /* _GLIBCXX_BINDERS_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/backward/index.html b/rep/usr/include/c++/4.3/backward/index.html deleted file mode 100644 index 3ef4b52..0000000 --- a/rep/usr/include/c++/4.3/backward/index.html +++ /dev/null @@ -1,92 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/backward</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/c++/4.3/backward</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">22</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">22</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="auto_ptr.h.gcov.html">auto_ptr.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">15 / 15 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="binders.h.gcov.html">binders.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">7 / 7 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/allocator.h.gcov.html b/rep/usr/include/c++/4.3/bits/allocator.h.gcov.html deleted file mode 100644 index 6f76dc6..0000000 --- a/rep/usr/include/c++/4.3/bits/allocator.h.gcov.html +++ /dev/null @@ -1,245 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/allocator.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - allocator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">7</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">71.4 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">5</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Allocators -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * Copyright (c) 1996-1997 -<span class="lineNum"> 33 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 34 </span> : * -<span class="lineNum"> 35 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 36 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 37 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 38 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 39 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 40 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 41 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 42 </span> : */ -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : /** @file allocator.h -<span class="lineNum"> 45 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 46 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 47 </span> : */ -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : #ifndef _ALLOCATOR_H -<span class="lineNum"> 50 </span> : #define _ALLOCATOR_H 1 -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : // Define the base class to std::allocator. -<span class="lineNum"> 53 </span> : #include <bits/c++allocator.h> -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : template<typename _Tp> -<span class="lineNum"> 58 </span> : class allocator; -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : /// allocator<void> specialization. -<span class="lineNum"> 61 </span> : template<> -<span class="lineNum"> 62 </span> : class allocator<void> -<span class="lineNum"> 63 </span> : { -<span class="lineNum"> 64 </span> : public: -<span class="lineNum"> 65 </span> : typedef size_t size_type; -<span class="lineNum"> 66 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 67 </span> : typedef void* pointer; -<span class="lineNum"> 68 </span> : typedef const void* const_pointer; -<span class="lineNum"> 69 </span> : typedef void value_type; -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : template<typename _Tp1> -<span class="lineNum"> 72 </span> : struct rebind -<span class="lineNum"> 73 </span> : { typedef allocator<_Tp1> other; }; -<span class="lineNum"> 74 </span> : }; -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : /** -<span class="lineNum"> 77 </span> : * @brief The "standard" allocator, as per [20.4]. -<span class="lineNum"> 78 </span> : * -<span class="lineNum"> 79 </span> : * Further details: -<span class="lineNum"> 80 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt04ch11.html -<span class="lineNum"> 81 </span> : */ -<span class="lineNum"> 82 </span> : template<typename _Tp> -<span class="lineNum"> 83 </span> : class allocator: public __glibcxx_base_allocator<_Tp> -<span class="lineNum"> 84 </span> : { -<span class="lineNum"> 85 </span> : public: -<span class="lineNum"> 86 </span> : typedef size_t size_type; -<span class="lineNum"> 87 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 88 </span> : typedef _Tp* pointer; -<span class="lineNum"> 89 </span> : typedef const _Tp* const_pointer; -<span class="lineNum"> 90 </span> : typedef _Tp& reference; -<span class="lineNum"> 91 </span> : typedef const _Tp& const_reference; -<span class="lineNum"> 92 </span> : typedef _Tp value_type; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : template<typename _Tp1> -<span class="lineNum"> 95 </span> : struct rebind -<span class="lineNum"> 96 </span> : { typedef allocator<_Tp1> other; }; -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span><span class="lineCov"> 285441 : allocator() throw() { }</span> -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span><span class="lineCov"> 934618 : allocator(const allocator& __a) throw()</span> -<span class="lineNum"> 101 </span><span class="lineCov"> 934618 : : __glibcxx_base_allocator<_Tp>(__a) { }</span> -<span class="lineNum"> 102 </span> : -<span class="lineNum"> 103 </span> : template<typename _Tp1> -<span class="lineNum"> 104 </span><span class="lineCov"> 11289504 : allocator(const allocator<_Tp1>&) throw() { }</span> -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span><span class="lineCov"> 12615289 : ~allocator() throw() { }</span> -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : // Inherit everything else. -<span class="lineNum"> 109 </span> : }; -<span class="lineNum"> 110 </span> : -<span class="lineNum"> 111 </span> : template<typename _T1, typename _T2> -<span class="lineNum"> 112 </span> : inline bool -<span class="lineNum"> 113 </span> : operator==(const allocator<_T1>&, const allocator<_T2>&) -<span class="lineNum"> 114 </span> : { return true; } -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : template<typename _Tp> -<span class="lineNum"> 117 </span> : inline bool -<span class="lineNum"> 118 </span><span class="lineNoCov"> 0 : operator==(const allocator<_Tp>&, const allocator<_Tp>&)</span> -<span class="lineNum"> 119 </span><span class="lineNoCov"> 0 : { return true; }</span> -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : template<typename _T1, typename _T2> -<span class="lineNum"> 122 </span> : inline bool -<span class="lineNum"> 123 </span> : operator!=(const allocator<_T1>&, const allocator<_T2>&) -<span class="lineNum"> 124 </span> : { return false; } -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : template<typename _Tp> -<span class="lineNum"> 127 </span> : inline bool -<span class="lineNum"> 128 </span> : operator!=(const allocator<_Tp>&, const allocator<_Tp>&) -<span class="lineNum"> 129 </span> : { return false; } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : // Inhibit implicit instantiations for required instantiations, -<span class="lineNum"> 132 </span> : // which are defined via explicit instantiations elsewhere. -<span class="lineNum"> 133 </span> : // NB: This syntax is a GNU extension. -<span class="lineNum"> 134 </span> : #if _GLIBCXX_EXTERN_TEMPLATE -<span class="lineNum"> 135 </span> : extern template class allocator<char>; -<span class="lineNum"> 136 </span> : extern template class allocator<wchar_t>; -<span class="lineNum"> 137 </span> : #endif -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : // Undefine. -<span class="lineNum"> 140 </span> : #undef __glibcxx_base_allocator -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : // To implement Option 3 of DR 431. -<span class="lineNum"> 143 </span> : template<typename _Alloc, bool = __is_empty(_Alloc)> -<span class="lineNum"> 144 </span> : struct __alloc_swap -<span class="lineNum"> 145 </span> : { static void _S_do_it(_Alloc&, _Alloc&) { } }; -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : template<typename _Alloc> -<span class="lineNum"> 148 </span> : struct __alloc_swap<_Alloc, false> -<span class="lineNum"> 149 </span> : { -<span class="lineNum"> 150 </span> : static void -<span class="lineNum"> 151 </span> : _S_do_it(_Alloc& __one, _Alloc& __two) -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : // Precondition: swappable allocators. -<span class="lineNum"> 154 </span> : if (__one != __two) -<span class="lineNum"> 155 </span> : swap(__one, __two); -<span class="lineNum"> 156 </span> : } -<span class="lineNum"> 157 </span> : }; -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : // Optimize for stateless allocators. -<span class="lineNum"> 160 </span> : template<typename _Alloc, bool = __is_empty(_Alloc)> -<span class="lineNum"> 161 </span> : struct __alloc_neq -<span class="lineNum"> 162 </span> : { -<span class="lineNum"> 163 </span> : static bool -<span class="lineNum"> 164 </span> : _S_do_it(const _Alloc&, const _Alloc&) -<span class="lineNum"> 165 </span> : { return false; } -<span class="lineNum"> 166 </span> : }; -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : template<typename _Alloc> -<span class="lineNum"> 169 </span> : struct __alloc_neq<_Alloc, false> -<span class="lineNum"> 170 </span> : { -<span class="lineNum"> 171 </span> : static bool -<span class="lineNum"> 172 </span> : _S_do_it(const _Alloc& __one, const _Alloc& __two) -<span class="lineNum"> 173 </span> : { return __one != __two; } -<span class="lineNum"> 174 </span> : }; -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/basic_ios.h.gcov.html b/rep/usr/include/c++/4.3/bits/basic_ios.h.gcov.html deleted file mode 100644 index a436d4e..0000000 --- a/rep/usr/include/c++/4.3/bits/basic_ios.h.gcov.html +++ /dev/null @@ -1,545 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/basic_ios.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - basic_ios.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">35</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Iostreams base classes -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file basic_ios.h -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : #ifndef _BASIC_IOS_H -<span class="lineNum"> 38 </span> : #define _BASIC_IOS_H 1 -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #pragma GCC system_header -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #include <bits/localefwd.h> -<span class="lineNum"> 43 </span> : #include <bits/locale_classes.h> -<span class="lineNum"> 44 </span> : #include <bits/locale_facets.h> -<span class="lineNum"> 45 </span> : #include <bits/streambuf_iterator.h> -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : template<typename _Facet> -<span class="lineNum"> 50 </span> : inline const _Facet& -<span class="lineNum"> 51 </span><span class="lineNoCov"> 0 : __check_facet(const _Facet* __f)</span> -<span class="lineNum"> 52 </span> : { -<span class="lineNum"> 53 </span><span class="lineNoCov"> 0 : if (!__f)</span> -<span class="lineNum"> 54 </span><span class="lineNoCov"> 0 : __throw_bad_cast();</span> -<span class="lineNum"> 55 </span><span class="lineNoCov"> 0 : return *__f;</span> -<span class="lineNum"> 56 </span> : } -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : // 27.4.5 Template class basic_ios -<span class="lineNum"> 59 </span> : /** -<span class="lineNum"> 60 </span> : * @brief Virtual base class for all stream classes. -<span class="lineNum"> 61 </span> : * -<span class="lineNum"> 62 </span> : * Most of the member functions called dispatched on stream objects -<span class="lineNum"> 63 </span> : * (e.g., @c std::cout.foo(bar);) are consolidated in this class. -<span class="lineNum"> 64 </span> : */ -<span class="lineNum"> 65 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 66 </span> : class basic_ios : public ios_base -<span class="lineNum"> 67 </span> : { -<span class="lineNum"> 68 </span> : public: -<span class="lineNum"> 69 </span> : //@{ -<span class="lineNum"> 70 </span> : /** -<span class="lineNum"> 71 </span> : * These are standard types. They permit a standardized way of -<span class="lineNum"> 72 </span> : * referring to names of (or names dependant on) the template -<span class="lineNum"> 73 </span> : * parameters, which are specific to the implementation. -<span class="lineNum"> 74 </span> : */ -<span class="lineNum"> 75 </span> : typedef _CharT char_type; -<span class="lineNum"> 76 </span> : typedef typename _Traits::int_type int_type; -<span class="lineNum"> 77 </span> : typedef typename _Traits::pos_type pos_type; -<span class="lineNum"> 78 </span> : typedef typename _Traits::off_type off_type; -<span class="lineNum"> 79 </span> : typedef _Traits traits_type; -<span class="lineNum"> 80 </span> : //@} -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : //@{ -<span class="lineNum"> 83 </span> : /** -<span class="lineNum"> 84 </span> : * These are non-standard types. -<span class="lineNum"> 85 </span> : */ -<span class="lineNum"> 86 </span> : typedef ctype<_CharT> __ctype_type; -<span class="lineNum"> 87 </span> : typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > -<span class="lineNum"> 88 </span> : __num_put_type; -<span class="lineNum"> 89 </span> : typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > -<span class="lineNum"> 90 </span> : __num_get_type; -<span class="lineNum"> 91 </span> : //@} -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : // Data members: -<span class="lineNum"> 94 </span> : protected: -<span class="lineNum"> 95 </span> : basic_ostream<_CharT, _Traits>* _M_tie; -<span class="lineNum"> 96 </span> : mutable char_type _M_fill; -<span class="lineNum"> 97 </span> : mutable bool _M_fill_init; -<span class="lineNum"> 98 </span> : basic_streambuf<_CharT, _Traits>* _M_streambuf; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : // Cached use_facet<ctype>, which is based on the current locale info. -<span class="lineNum"> 101 </span> : const __ctype_type* _M_ctype; -<span class="lineNum"> 102 </span> : // For ostream. -<span class="lineNum"> 103 </span> : const __num_put_type* _M_num_put; -<span class="lineNum"> 104 </span> : // For istream. -<span class="lineNum"> 105 </span> : const __num_get_type* _M_num_get; -<span class="lineNum"> 106 </span> : -<span class="lineNum"> 107 </span> : public: -<span class="lineNum"> 108 </span> : //@{ -<span class="lineNum"> 109 </span> : /** -<span class="lineNum"> 110 </span> : * @brief The quick-and-easy status check. -<span class="lineNum"> 111 </span> : * -<span class="lineNum"> 112 </span> : * This allows you to write constructs such as -<span class="lineNum"> 113 </span> : * "if (!a_stream) ..." and "while (a_stream) ..." -<span class="lineNum"> 114 </span> : */ -<span class="lineNum"> 115 </span><span class="lineNoCov"> 0 : operator void*() const</span> -<span class="lineNum"> 116 </span><span class="lineNoCov"> 0 : { return this->fail() ? 0 : const_cast<basic_ios*>(this); }</span> -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : bool -<span class="lineNum"> 119 </span><span class="lineNoCov"> 0 : operator!() const</span> -<span class="lineNum"> 120 </span><span class="lineNoCov"> 0 : { return this->fail(); }</span> -<span class="lineNum"> 121 </span> : //@} -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : /** -<span class="lineNum"> 124 </span> : * @brief Returns the error state of the stream buffer. -<span class="lineNum"> 125 </span> : * @return A bit pattern (well, isn't everything?) -<span class="lineNum"> 126 </span> : * -<span class="lineNum"> 127 </span> : * See std::ios_base::iostate for the possible bit values. Most -<span class="lineNum"> 128 </span> : * users will call one of the interpreting wrappers, e.g., good(). -<span class="lineNum"> 129 </span> : */ -<span class="lineNum"> 130 </span> : iostate -<span class="lineNum"> 131 </span><span class="lineNoCov"> 0 : rdstate() const</span> -<span class="lineNum"> 132 </span><span class="lineNoCov"> 0 : { return _M_streambuf_state; }</span> -<span class="lineNum"> 133 </span> : -<span class="lineNum"> 134 </span> : /** -<span class="lineNum"> 135 </span> : * @brief [Re]sets the error state. -<span class="lineNum"> 136 </span> : * @param state The new state flag(s) to set. -<span class="lineNum"> 137 </span> : * -<span class="lineNum"> 138 </span> : * See std::ios_base::iostate for the possible bit values. Most -<span class="lineNum"> 139 </span> : * users will not need to pass an argument. -<span class="lineNum"> 140 </span> : */ -<span class="lineNum"> 141 </span> : void -<span class="lineNum"> 142 </span> : clear(iostate __state = goodbit); -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : /** -<span class="lineNum"> 145 </span> : * @brief Sets additional flags in the error state. -<span class="lineNum"> 146 </span> : * @param state The additional state flag(s) to set. -<span class="lineNum"> 147 </span> : * -<span class="lineNum"> 148 </span> : * See std::ios_base::iostate for the possible bit values. -<span class="lineNum"> 149 </span> : */ -<span class="lineNum"> 150 </span> : void -<span class="lineNum"> 151 </span><span class="lineNoCov"> 0 : setstate(iostate __state)</span> -<span class="lineNum"> 152 </span><span class="lineNoCov"> 0 : { this->clear(this->rdstate() | __state); }</span> -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : // Flip the internal state on for the proper state bits, then re -<span class="lineNum"> 155 </span> : // throws the propagated exception if bit also set in -<span class="lineNum"> 156 </span> : // exceptions(). -<span class="lineNum"> 157 </span> : void -<span class="lineNum"> 158 </span> : _M_setstate(iostate __state) -<span class="lineNum"> 159 </span> : { -<span class="lineNum"> 160 </span> : // 27.6.1.2.1 Common requirements. -<span class="lineNum"> 161 </span> : // Turn this on without causing an ios::failure to be thrown. -<span class="lineNum"> 162 </span> : _M_streambuf_state |= __state; -<span class="lineNum"> 163 </span> : if (this->exceptions() & __state) -<span class="lineNum"> 164 </span> : __throw_exception_again; -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /** -<span class="lineNum"> 168 </span> : * @brief Fast error checking. -<span class="lineNum"> 169 </span> : * @return True if no error flags are set. -<span class="lineNum"> 170 </span> : * -<span class="lineNum"> 171 </span> : * A wrapper around rdstate. -<span class="lineNum"> 172 </span> : */ -<span class="lineNum"> 173 </span> : bool -<span class="lineNum"> 174 </span><span class="lineNoCov"> 0 : good() const</span> -<span class="lineNum"> 175 </span><span class="lineNoCov"> 0 : { return this->rdstate() == 0; }</span> -<span class="lineNum"> 176 </span> : -<span class="lineNum"> 177 </span> : /** -<span class="lineNum"> 178 </span> : * @brief Fast error checking. -<span class="lineNum"> 179 </span> : * @return True if the eofbit is set. -<span class="lineNum"> 180 </span> : * -<span class="lineNum"> 181 </span> : * Note that other iostate flags may also be set. -<span class="lineNum"> 182 </span> : */ -<span class="lineNum"> 183 </span> : bool -<span class="lineNum"> 184 </span><span class="lineNoCov"> 0 : eof() const</span> -<span class="lineNum"> 185 </span><span class="lineNoCov"> 0 : { return (this->rdstate() & eofbit) != 0; }</span> -<span class="lineNum"> 186 </span> : -<span class="lineNum"> 187 </span> : /** -<span class="lineNum"> 188 </span> : * @brief Fast error checking. -<span class="lineNum"> 189 </span> : * @return True if either the badbit or the failbit is set. -<span class="lineNum"> 190 </span> : * -<span class="lineNum"> 191 </span> : * Checking the badbit in fail() is historical practice. -<span class="lineNum"> 192 </span> : * Note that other iostate flags may also be set. -<span class="lineNum"> 193 </span> : */ -<span class="lineNum"> 194 </span> : bool -<span class="lineNum"> 195 </span><span class="lineNoCov"> 0 : fail() const</span> -<span class="lineNum"> 196 </span><span class="lineNoCov"> 0 : { return (this->rdstate() & (badbit | failbit)) != 0; }</span> -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : /** -<span class="lineNum"> 199 </span> : * @brief Fast error checking. -<span class="lineNum"> 200 </span> : * @return True if the badbit is set. -<span class="lineNum"> 201 </span> : * -<span class="lineNum"> 202 </span> : * Note that other iostate flags may also be set. -<span class="lineNum"> 203 </span> : */ -<span class="lineNum"> 204 </span> : bool -<span class="lineNum"> 205 </span> : bad() const -<span class="lineNum"> 206 </span> : { return (this->rdstate() & badbit) != 0; } -<span class="lineNum"> 207 </span> : -<span class="lineNum"> 208 </span> : /** -<span class="lineNum"> 209 </span> : * @brief Throwing exceptions on errors. -<span class="lineNum"> 210 </span> : * @return The current exceptions mask. -<span class="lineNum"> 211 </span> : * -<span class="lineNum"> 212 </span> : * This changes nothing in the stream. See the one-argument version -<span class="lineNum"> 213 </span> : * of exceptions(iostate) for the meaning of the return value. -<span class="lineNum"> 214 </span> : */ -<span class="lineNum"> 215 </span> : iostate -<span class="lineNum"> 216 </span> : exceptions() const -<span class="lineNum"> 217 </span> : { return _M_exception; } -<span class="lineNum"> 218 </span> : -<span class="lineNum"> 219 </span> : /** -<span class="lineNum"> 220 </span> : * @brief Throwing exceptions on errors. -<span class="lineNum"> 221 </span> : * @param except The new exceptions mask. -<span class="lineNum"> 222 </span> : * -<span class="lineNum"> 223 </span> : * By default, error flags are set silently. You can set an -<span class="lineNum"> 224 </span> : * exceptions mask for each stream; if a bit in the mask becomes set -<span class="lineNum"> 225 </span> : * in the error flags, then an exception of type -<span class="lineNum"> 226 </span> : * std::ios_base::failure is thrown. -<span class="lineNum"> 227 </span> : * -<span class="lineNum"> 228 </span> : * If the error flag is already set when the exceptions mask is -<span class="lineNum"> 229 </span> : * added, the exception is immediately thrown. Try running the -<span class="lineNum"> 230 </span> : * following under GCC 3.1 or later: -<span class="lineNum"> 231 </span> : * @code -<span class="lineNum"> 232 </span> : * #include <iostream> -<span class="lineNum"> 233 </span> : * #include <fstream> -<span class="lineNum"> 234 </span> : * #include <exception> -<span class="lineNum"> 235 </span> : * -<span class="lineNum"> 236 </span> : * int main() -<span class="lineNum"> 237 </span> : * { -<span class="lineNum"> 238 </span> : * std::set_terminate (__gnu_cxx::__verbose_terminate_handler); -<span class="lineNum"> 239 </span> : * -<span class="lineNum"> 240 </span> : * std::ifstream f ("/etc/motd"); -<span class="lineNum"> 241 </span> : * -<span class="lineNum"> 242 </span> : * std::cerr << "Setting badbit\n"; -<span class="lineNum"> 243 </span> : * f.setstate (std::ios_base::badbit); -<span class="lineNum"> 244 </span> : * -<span class="lineNum"> 245 </span> : * std::cerr << "Setting exception mask\n"; -<span class="lineNum"> 246 </span> : * f.exceptions (std::ios_base::badbit); -<span class="lineNum"> 247 </span> : * } -<span class="lineNum"> 248 </span> : * @endcode -<span class="lineNum"> 249 </span> : */ -<span class="lineNum"> 250 </span> : void -<span class="lineNum"> 251 </span> : exceptions(iostate __except) -<span class="lineNum"> 252 </span> : { -<span class="lineNum"> 253 </span> : _M_exception = __except; -<span class="lineNum"> 254 </span> : this->clear(_M_streambuf_state); -<span class="lineNum"> 255 </span> : } -<span class="lineNum"> 256 </span> : -<span class="lineNum"> 257 </span> : // Constructor/destructor: -<span class="lineNum"> 258 </span> : /** -<span class="lineNum"> 259 </span> : * @brief Constructor performs initialization. -<span class="lineNum"> 260 </span> : * -<span class="lineNum"> 261 </span> : * The parameter is passed by derived streams. -<span class="lineNum"> 262 </span> : */ -<span class="lineNum"> 263 </span> : explicit -<span class="lineNum"> 264 </span> : basic_ios(basic_streambuf<_CharT, _Traits>* __sb) -<span class="lineNum"> 265 </span> : : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0), -<span class="lineNum"> 266 </span> : _M_ctype(0), _M_num_put(0), _M_num_get(0) -<span class="lineNum"> 267 </span> : { this->init(__sb); } -<span class="lineNum"> 268 </span> : -<span class="lineNum"> 269 </span> : /** -<span class="lineNum"> 270 </span> : * @brief Empty. -<span class="lineNum"> 271 </span> : * -<span class="lineNum"> 272 </span> : * The destructor does nothing. More specifically, it does not -<span class="lineNum"> 273 </span> : * destroy the streambuf held by rdbuf(). -<span class="lineNum"> 274 </span> : */ -<span class="lineNum"> 275 </span> : virtual -<span class="lineNum"> 276 </span><span class="lineNoCov"> 0 : ~basic_ios() { }</span> -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : // Members: -<span class="lineNum"> 279 </span> : /** -<span class="lineNum"> 280 </span> : * @brief Fetches the current @e tied stream. -<span class="lineNum"> 281 </span> : * @return A pointer to the tied stream, or NULL if the stream is -<span class="lineNum"> 282 </span> : * not tied. -<span class="lineNum"> 283 </span> : * -<span class="lineNum"> 284 </span> : * A stream may be @e tied (or synchronized) to a second output -<span class="lineNum"> 285 </span> : * stream. When this stream performs any I/O, the tied stream is -<span class="lineNum"> 286 </span> : * first flushed. For example, @c std::cin is tied to @c std::cout. -<span class="lineNum"> 287 </span> : */ -<span class="lineNum"> 288 </span> : basic_ostream<_CharT, _Traits>* -<span class="lineNum"> 289 </span> : tie() const -<span class="lineNum"> 290 </span> : { return _M_tie; } -<span class="lineNum"> 291 </span> : -<span class="lineNum"> 292 </span> : /** -<span class="lineNum"> 293 </span> : * @brief Ties this stream to an output stream. -<span class="lineNum"> 294 </span> : * @param tiestr The output stream. -<span class="lineNum"> 295 </span> : * @return The previously tied output stream, or NULL if the stream -<span class="lineNum"> 296 </span> : * was not tied. -<span class="lineNum"> 297 </span> : * -<span class="lineNum"> 298 </span> : * This sets up a new tie; see tie() for more. -<span class="lineNum"> 299 </span> : */ -<span class="lineNum"> 300 </span> : basic_ostream<_CharT, _Traits>* -<span class="lineNum"> 301 </span> : tie(basic_ostream<_CharT, _Traits>* __tiestr) -<span class="lineNum"> 302 </span> : { -<span class="lineNum"> 303 </span> : basic_ostream<_CharT, _Traits>* __old = _M_tie; -<span class="lineNum"> 304 </span> : _M_tie = __tiestr; -<span class="lineNum"> 305 </span> : return __old; -<span class="lineNum"> 306 </span> : } -<span class="lineNum"> 307 </span> : -<span class="lineNum"> 308 </span> : /** -<span class="lineNum"> 309 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 310 </span> : * @return The current stream buffer. -<span class="lineNum"> 311 </span> : * -<span class="lineNum"> 312 </span> : * This does not change the state of the stream. -<span class="lineNum"> 313 </span> : */ -<span class="lineNum"> 314 </span> : basic_streambuf<_CharT, _Traits>* -<span class="lineNum"> 315 </span><span class="lineNoCov"> 0 : rdbuf() const</span> -<span class="lineNum"> 316 </span><span class="lineNoCov"> 0 : { return _M_streambuf; }</span> -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : /** -<span class="lineNum"> 319 </span> : * @brief Changing the underlying buffer. -<span class="lineNum"> 320 </span> : * @param sb The new stream buffer. -<span class="lineNum"> 321 </span> : * @return The previous stream buffer. -<span class="lineNum"> 322 </span> : * -<span class="lineNum"> 323 </span> : * Associates a new buffer with the current stream, and clears the -<span class="lineNum"> 324 </span> : * error state. -<span class="lineNum"> 325 </span> : * -<span class="lineNum"> 326 </span> : * Due to historical accidents which the LWG refuses to correct, the -<span class="lineNum"> 327 </span> : * I/O library suffers from a design error: this function is hidden -<span class="lineNum"> 328 </span> : * in derived classes by overrides of the zero-argument @c rdbuf(), -<span class="lineNum"> 329 </span> : * which is non-virtual for hysterical raisins. As a result, you -<span class="lineNum"> 330 </span> : * must use explicit qualifications to access this function via any -<span class="lineNum"> 331 </span> : * derived class. For example: -<span class="lineNum"> 332 </span> : * -<span class="lineNum"> 333 </span> : * @code -<span class="lineNum"> 334 </span> : * std::fstream foo; // or some other derived type -<span class="lineNum"> 335 </span> : * std::streambuf* p = .....; -<span class="lineNum"> 336 </span> : * -<span class="lineNum"> 337 </span> : * foo.ios::rdbuf(p); // ios == basic_ios<char> -<span class="lineNum"> 338 </span> : * @endcode -<span class="lineNum"> 339 </span> : */ -<span class="lineNum"> 340 </span> : basic_streambuf<_CharT, _Traits>* -<span class="lineNum"> 341 </span> : rdbuf(basic_streambuf<_CharT, _Traits>* __sb); -<span class="lineNum"> 342 </span> : -<span class="lineNum"> 343 </span> : /** -<span class="lineNum"> 344 </span> : * @brief Copies fields of __rhs into this. -<span class="lineNum"> 345 </span> : * @param __rhs The source values for the copies. -<span class="lineNum"> 346 </span> : * @return Reference to this object. -<span class="lineNum"> 347 </span> : * -<span class="lineNum"> 348 </span> : * All fields of __rhs are copied into this object except that rdbuf() -<span class="lineNum"> 349 </span> : * and rdstate() remain unchanged. All values in the pword and iword -<span class="lineNum"> 350 </span> : * arrays are copied. Before copying, each callback is invoked with -<span class="lineNum"> 351 </span> : * erase_event. After copying, each (new) callback is invoked with -<span class="lineNum"> 352 </span> : * copyfmt_event. The final step is to copy exceptions(). -<span class="lineNum"> 353 </span> : */ -<span class="lineNum"> 354 </span> : basic_ios& -<span class="lineNum"> 355 </span> : copyfmt(const basic_ios& __rhs); -<span class="lineNum"> 356 </span> : -<span class="lineNum"> 357 </span> : /** -<span class="lineNum"> 358 </span> : * @brief Retrieves the "empty" character. -<span class="lineNum"> 359 </span> : * @return The current fill character. -<span class="lineNum"> 360 </span> : * -<span class="lineNum"> 361 </span> : * It defaults to a space (' ') in the current locale. -<span class="lineNum"> 362 </span> : */ -<span class="lineNum"> 363 </span> : char_type -<span class="lineNum"> 364 </span><span class="lineNoCov"> 0 : fill() const</span> -<span class="lineNum"> 365 </span> : { -<span class="lineNum"> 366 </span><span class="lineNoCov"> 0 : if (!_M_fill_init)</span> -<span class="lineNum"> 367 </span> : { -<span class="lineNum"> 368 </span><span class="lineNoCov"> 0 : _M_fill = this->widen(' ');</span> -<span class="lineNum"> 369 </span><span class="lineNoCov"> 0 : _M_fill_init = true;</span> -<span class="lineNum"> 370 </span> : } -<span class="lineNum"> 371 </span><span class="lineNoCov"> 0 : return _M_fill;</span> -<span class="lineNum"> 372 </span> : } -<span class="lineNum"> 373 </span> : -<span class="lineNum"> 374 </span> : /** -<span class="lineNum"> 375 </span> : * @brief Sets a new "empty" character. -<span class="lineNum"> 376 </span> : * @param ch The new character. -<span class="lineNum"> 377 </span> : * @return The previous fill character. -<span class="lineNum"> 378 </span> : * -<span class="lineNum"> 379 </span> : * The fill character is used to fill out space when P+ characters -<span class="lineNum"> 380 </span> : * have been requested (e.g., via setw), Q characters are actually -<span class="lineNum"> 381 </span> : * used, and Q<P. It defaults to a space (' ') in the current locale. -<span class="lineNum"> 382 </span> : */ -<span class="lineNum"> 383 </span> : char_type -<span class="lineNum"> 384 </span><span class="lineNoCov"> 0 : fill(char_type __ch)</span> -<span class="lineNum"> 385 </span> : { -<span class="lineNum"> 386 </span><span class="lineNoCov"> 0 : char_type __old = this->fill();</span> -<span class="lineNum"> 387 </span><span class="lineNoCov"> 0 : _M_fill = __ch;</span> -<span class="lineNum"> 388 </span><span class="lineNoCov"> 0 : return __old;</span> -<span class="lineNum"> 389 </span> : } -<span class="lineNum"> 390 </span> : -<span class="lineNum"> 391 </span> : // Locales: -<span class="lineNum"> 392 </span> : /** -<span class="lineNum"> 393 </span> : * @brief Moves to a new locale. -<span class="lineNum"> 394 </span> : * @param loc The new locale. -<span class="lineNum"> 395 </span> : * @return The previous locale. -<span class="lineNum"> 396 </span> : * -<span class="lineNum"> 397 </span> : * Calls @c ios_base::imbue(loc), and if a stream buffer is associated -<span class="lineNum"> 398 </span> : * with this stream, calls that buffer's @c pubimbue(loc). -<span class="lineNum"> 399 </span> : * -<span class="lineNum"> 400 </span> : * Additional l10n notes are at -<span class="lineNum"> 401 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html -<span class="lineNum"> 402 </span> : */ -<span class="lineNum"> 403 </span> : locale -<span class="lineNum"> 404 </span> : imbue(const locale& __loc); -<span class="lineNum"> 405 </span> : -<span class="lineNum"> 406 </span> : /** -<span class="lineNum"> 407 </span> : * @brief Squeezes characters. -<span class="lineNum"> 408 </span> : * @param c The character to narrow. -<span class="lineNum"> 409 </span> : * @param dfault The character to narrow. -<span class="lineNum"> 410 </span> : * @return The narrowed character. -<span class="lineNum"> 411 </span> : * -<span class="lineNum"> 412 </span> : * Maps a character of @c char_type to a character of @c char, -<span class="lineNum"> 413 </span> : * if possible. -<span class="lineNum"> 414 </span> : * -<span class="lineNum"> 415 </span> : * Returns the result of -<span class="lineNum"> 416 </span> : * @code -<span class="lineNum"> 417 </span> : * std::use_facet<ctype<char_type> >(getloc()).narrow(c,dfault) -<span class="lineNum"> 418 </span> : * @endcode -<span class="lineNum"> 419 </span> : * -<span class="lineNum"> 420 </span> : * Additional l10n notes are at -<span class="lineNum"> 421 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html -<span class="lineNum"> 422 </span> : */ -<span class="lineNum"> 423 </span> : char -<span class="lineNum"> 424 </span> : narrow(char_type __c, char __dfault) const -<span class="lineNum"> 425 </span> : { return __check_facet(_M_ctype).narrow(__c, __dfault); } -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span> : /** -<span class="lineNum"> 428 </span> : * @brief Widens characters. -<span class="lineNum"> 429 </span> : * @param c The character to widen. -<span class="lineNum"> 430 </span> : * @return The widened character. -<span class="lineNum"> 431 </span> : * -<span class="lineNum"> 432 </span> : * Maps a character of @c char to a character of @c char_type. -<span class="lineNum"> 433 </span> : * -<span class="lineNum"> 434 </span> : * Returns the result of -<span class="lineNum"> 435 </span> : * @code -<span class="lineNum"> 436 </span> : * std::use_facet<ctype<char_type> >(getloc()).widen(c) -<span class="lineNum"> 437 </span> : * @endcode -<span class="lineNum"> 438 </span> : * -<span class="lineNum"> 439 </span> : * Additional l10n notes are at -<span class="lineNum"> 440 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/22_locale/howto.html -<span class="lineNum"> 441 </span> : */ -<span class="lineNum"> 442 </span> : char_type -<span class="lineNum"> 443 </span><span class="lineNoCov"> 0 : widen(char __c) const</span> -<span class="lineNum"> 444 </span><span class="lineNoCov"> 0 : { return __check_facet(_M_ctype).widen(__c); }</span> -<span class="lineNum"> 445 </span> : -<span class="lineNum"> 446 </span> : protected: -<span class="lineNum"> 447 </span> : // 27.4.5.1 basic_ios constructors -<span class="lineNum"> 448 </span> : /** -<span class="lineNum"> 449 </span> : * @brief Empty. -<span class="lineNum"> 450 </span> : * -<span class="lineNum"> 451 </span> : * The default constructor does nothing and is not normally -<span class="lineNum"> 452 </span> : * accessible to users. -<span class="lineNum"> 453 </span> : */ -<span class="lineNum"> 454 </span><span class="lineNoCov"> 0 : basic_ios()</span> -<span class="lineNum"> 455 </span> : : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), -<span class="lineNum"> 456 </span><span class="lineNoCov"> 0 : _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0)</span> -<span class="lineNum"> 457 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 458 </span> : -<span class="lineNum"> 459 </span> : /** -<span class="lineNum"> 460 </span> : * @brief All setup is performed here. -<span class="lineNum"> 461 </span> : * -<span class="lineNum"> 462 </span> : * This is called from the public constructor. It is not virtual and -<span class="lineNum"> 463 </span> : * cannot be redefined. -<span class="lineNum"> 464 </span> : */ -<span class="lineNum"> 465 </span> : void -<span class="lineNum"> 466 </span> : init(basic_streambuf<_CharT, _Traits>* __sb); -<span class="lineNum"> 467 </span> : -<span class="lineNum"> 468 </span> : void -<span class="lineNum"> 469 </span> : _M_cache_locale(const locale& __loc); -<span class="lineNum"> 470 </span> : }; -<span class="lineNum"> 471 </span> : -<span class="lineNum"> 472 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 473 </span> : -<span class="lineNum"> 474 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 475 </span> : #include <bits/basic_ios.tcc> -<span class="lineNum"> 476 </span> : #endif -<span class="lineNum"> 477 </span> : -<span class="lineNum"> 478 </span> : #endif /* _BASIC_IOS_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/basic_string.h.gcov.html b/rep/usr/include/c++/4.3/bits/basic_string.h.gcov.html deleted file mode 100644 index 909cd58..0000000 --- a/rep/usr/include/c++/4.3/bits/basic_string.h.gcov.html +++ /dev/null @@ -1,2545 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/basic_string.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - basic_string.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">178</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">17.4 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">31</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Components for manipulating sequences of characters -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file basic_string.h -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : // ISO C++ 14882: 21 Strings library -<span class="lineNum"> 39 </span> : // -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #ifndef _BASIC_STRING_H -<span class="lineNum"> 42 </span> : #define _BASIC_STRING_H 1 -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #pragma GCC system_header -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : #include <ext/atomicity.h> -<span class="lineNum"> 47 </span> : #include <debug/debug.h> -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : /** -<span class="lineNum"> 52 </span> : * @class basic_string basic_string.h <string> -<span class="lineNum"> 53 </span> : * @brief Managing sequences of characters and character-like objects. -<span class="lineNum"> 54 </span> : * -<span class="lineNum"> 55 </span> : * @ingroup Containers -<span class="lineNum"> 56 </span> : * @ingroup Sequences -<span class="lineNum"> 57 </span> : * -<span class="lineNum"> 58 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a -<span class="lineNum"> 59 </span> : * <a href="tables.html#66">reversible container</a>, and a -<span class="lineNum"> 60 </span> : * <a href="tables.html#67">sequence</a>. Of the -<span class="lineNum"> 61 </span> : * <a href="tables.html#68">optional sequence requirements</a>, only -<span class="lineNum"> 62 </span> : * @c push_back, @c at, and array access are supported. -<span class="lineNum"> 63 </span> : * -<span class="lineNum"> 64 </span> : * @doctodo -<span class="lineNum"> 65 </span> : * -<span class="lineNum"> 66 </span> : * -<span class="lineNum"> 67 </span> : * Documentation? What's that? -<span class="lineNum"> 68 </span> : * Nathan Myers <ncm@cantrip.org>. -<span class="lineNum"> 69 </span> : * -<span class="lineNum"> 70 </span> : * A string looks like this: -<span class="lineNum"> 71 </span> : * -<span class="lineNum"> 72 </span> : * @code -<span class="lineNum"> 73 </span> : * [_Rep] -<span class="lineNum"> 74 </span> : * _M_length -<span class="lineNum"> 75 </span> : * [basic_string<char_type>] _M_capacity -<span class="lineNum"> 76 </span> : * _M_dataplus _M_refcount -<span class="lineNum"> 77 </span> : * _M_p ----------------> unnamed array of char_type -<span class="lineNum"> 78 </span> : * @endcode -<span class="lineNum"> 79 </span> : * -<span class="lineNum"> 80 </span> : * Where the _M_p points to the first character in the string, and -<span class="lineNum"> 81 </span> : * you cast it to a pointer-to-_Rep and subtract 1 to get a -<span class="lineNum"> 82 </span> : * pointer to the header. -<span class="lineNum"> 83 </span> : * -<span class="lineNum"> 84 </span> : * This approach has the enormous advantage that a string object -<span class="lineNum"> 85 </span> : * requires only one allocation. All the ugliness is confined -<span class="lineNum"> 86 </span> : * within a single pair of inline functions, which each compile to -<span class="lineNum"> 87 </span> : * a single "add" instruction: _Rep::_M_data(), and -<span class="lineNum"> 88 </span> : * string::_M_rep(); and the allocation function which gets a -<span class="lineNum"> 89 </span> : * block of raw bytes and with room enough and constructs a _Rep -<span class="lineNum"> 90 </span> : * object at the front. -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * The reason you want _M_data pointing to the character array and -<span class="lineNum"> 93 </span> : * not the _Rep is so that the debugger can see the string -<span class="lineNum"> 94 </span> : * contents. (Probably we should add a non-inline member to get -<span class="lineNum"> 95 </span> : * the _Rep for the debugger to use, so users can check the actual -<span class="lineNum"> 96 </span> : * string length.) -<span class="lineNum"> 97 </span> : * -<span class="lineNum"> 98 </span> : * Note that the _Rep object is a POD so that you can have a -<span class="lineNum"> 99 </span> : * static "empty string" _Rep object already "constructed" before -<span class="lineNum"> 100 </span> : * static constructors have run. The reference-count encoding is -<span class="lineNum"> 101 </span> : * chosen so that a 0 indicates one reference, so you never try to -<span class="lineNum"> 102 </span> : * destroy the empty-string _Rep object. -<span class="lineNum"> 103 </span> : * -<span class="lineNum"> 104 </span> : * All but the last paragraph is considered pretty conventional -<span class="lineNum"> 105 </span> : * for a C++ string implementation. -<span class="lineNum"> 106 </span> : */ -<span class="lineNum"> 107 </span> : // 21.3 Template class basic_string -<span class="lineNum"> 108 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 109 </span> : class basic_string -<span class="lineNum"> 110 </span> : { -<span class="lineNum"> 111 </span> : typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type; -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : // Types: -<span class="lineNum"> 114 </span> : public: -<span class="lineNum"> 115 </span> : typedef _Traits traits_type; -<span class="lineNum"> 116 </span> : typedef typename _Traits::char_type value_type; -<span class="lineNum"> 117 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 118 </span> : typedef typename _CharT_alloc_type::size_type size_type; -<span class="lineNum"> 119 </span> : typedef typename _CharT_alloc_type::difference_type difference_type; -<span class="lineNum"> 120 </span> : typedef typename _CharT_alloc_type::reference reference; -<span class="lineNum"> 121 </span> : typedef typename _CharT_alloc_type::const_reference const_reference; -<span class="lineNum"> 122 </span> : typedef typename _CharT_alloc_type::pointer pointer; -<span class="lineNum"> 123 </span> : typedef typename _CharT_alloc_type::const_pointer const_pointer; -<span class="lineNum"> 124 </span> : typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator; -<span class="lineNum"> 125 </span> : typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string> -<span class="lineNum"> 126 </span> : const_iterator; -<span class="lineNum"> 127 </span> : typedef std::reverse_iterator<const_iterator> const_reverse_iterator; -<span class="lineNum"> 128 </span> : typedef std::reverse_iterator<iterator> reverse_iterator; -<span class="lineNum"> 129 </span> : -<span class="lineNum"> 130 </span> : private: -<span class="lineNum"> 131 </span> : // _Rep: string representation -<span class="lineNum"> 132 </span> : // Invariants: -<span class="lineNum"> 133 </span> : // 1. String really contains _M_length + 1 characters: due to 21.3.4 -<span class="lineNum"> 134 </span> : // must be kept null-terminated. -<span class="lineNum"> 135 </span> : // 2. _M_capacity >= _M_length -<span class="lineNum"> 136 </span> : // Allocated memory is always (_M_capacity + 1) * sizeof(_CharT). -<span class="lineNum"> 137 </span> : // 3. _M_refcount has three states: -<span class="lineNum"> 138 </span> : // -1: leaked, one reference, no ref-copies allowed, non-const. -<span class="lineNum"> 139 </span> : // 0: one reference, non-const. -<span class="lineNum"> 140 </span> : // n>0: n + 1 references, operations require a lock, const. -<span class="lineNum"> 141 </span> : // 4. All fields==0 is an empty string, given the extra storage -<span class="lineNum"> 142 </span> : // beyond-the-end for a null terminator; thus, the shared -<span class="lineNum"> 143 </span> : // empty string representation needs no constructor. -<span class="lineNum"> 144 </span> : -<span class="lineNum"> 145 </span> : struct _Rep_base -<span class="lineNum"> 146 </span> : { -<span class="lineNum"> 147 </span> : size_type _M_length; -<span class="lineNum"> 148 </span> : size_type _M_capacity; -<span class="lineNum"> 149 </span> : _Atomic_word _M_refcount; -<span class="lineNum"> 150 </span> : }; -<span class="lineNum"> 151 </span> : -<span class="lineNum"> 152 </span> : struct _Rep : _Rep_base -<span class="lineNum"> 153 </span> : { -<span class="lineNum"> 154 </span> : // Types: -<span class="lineNum"> 155 </span> : typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc; -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : // (Public) Data members: -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : // The maximum number of individual char_type elements of an -<span class="lineNum"> 160 </span> : // individual string is determined by _S_max_size. This is the -<span class="lineNum"> 161 </span> : // value that will be returned by max_size(). (Whereas npos -<span class="lineNum"> 162 </span> : // is the maximum number of bytes the allocator can allocate.) -<span class="lineNum"> 163 </span> : // If one was to divvy up the theoretical largest size string, -<span class="lineNum"> 164 </span> : // with a terminating character and m _CharT elements, it'd -<span class="lineNum"> 165 </span> : // look like this: -<span class="lineNum"> 166 </span> : // npos = sizeof(_Rep) + (m * sizeof(_CharT)) + sizeof(_CharT) -<span class="lineNum"> 167 </span> : // Solving for m: -<span class="lineNum"> 168 </span> : // m = ((npos - sizeof(_Rep))/sizeof(CharT)) - 1 -<span class="lineNum"> 169 </span> : // In addition, this implementation quarters this amount. -<span class="lineNum"> 170 </span> : static const size_type _S_max_size; -<span class="lineNum"> 171 </span> : static const _CharT _S_terminal; -<span class="lineNum"> 172 </span> : -<span class="lineNum"> 173 </span> : // The following storage is init'd to 0 by the linker, resulting -<span class="lineNum"> 174 </span> : // (carefully) in an empty string with one reference. -<span class="lineNum"> 175 </span> : static size_type _S_empty_rep_storage[]; -<span class="lineNum"> 176 </span> : -<span class="lineNum"> 177 </span> : static _Rep& -<span class="lineNum"> 178 </span><span class="lineNoCov"> 0 : _S_empty_rep()</span> -<span class="lineNum"> 179 </span> : { -<span class="lineNum"> 180 </span> : // NB: Mild hack to avoid strict-aliasing warnings. Note that -<span class="lineNum"> 181 </span> : // _S_empty_rep_storage is never modified and the punning should -<span class="lineNum"> 182 </span> : // be reasonably safe in this case. -<span class="lineNum"> 183 </span><span class="lineNoCov"> 0 : void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage);</span> -<span class="lineNum"> 184 </span><span class="lineNoCov"> 0 : return *reinterpret_cast<_Rep*>(__p);</span> -<span class="lineNum"> 185 </span> : } -<span class="lineNum"> 186 </span> : -<span class="lineNum"> 187 </span> : bool -<span class="lineNum"> 188 </span><span class="lineNoCov"> 0 : _M_is_leaked() const</span> -<span class="lineNum"> 189 </span><span class="lineNoCov"> 0 : { return this->_M_refcount < 0; }</span> -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : bool -<span class="lineNum"> 192 </span><span class="lineNoCov"> 0 : _M_is_shared() const</span> -<span class="lineNum"> 193 </span><span class="lineNoCov"> 0 : { return this->_M_refcount > 0; }</span> -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : void -<span class="lineNum"> 196 </span><span class="lineNoCov"> 0 : _M_set_leaked()</span> -<span class="lineNum"> 197 </span><span class="lineNoCov"> 0 : { this->_M_refcount = -1; }</span> -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : void -<span class="lineNum"> 200 </span><span class="lineNoCov"> 0 : _M_set_sharable()</span> -<span class="lineNum"> 201 </span><span class="lineNoCov"> 0 : { this->_M_refcount = 0; }</span> -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : void -<span class="lineNum"> 204 </span><span class="lineNoCov"> 0 : _M_set_length_and_sharable(size_type __n)</span> -<span class="lineNum"> 205 </span> : { -<span class="lineNum"> 206 </span><span class="lineNoCov"> 0 : this->_M_set_sharable(); // One reference.</span> -<span class="lineNum"> 207 </span><span class="lineNoCov"> 0 : this->_M_length = __n;</span> -<span class="lineNum"> 208 </span><span class="lineNoCov"> 0 : traits_type::assign(this->_M_refdata()[__n], _S_terminal);</span> -<span class="lineNum"> 209 </span> : // grrr. (per 21.3.4) -<span class="lineNum"> 210 </span> : // You cannot leave those LWG people alone for a second. -<span class="lineNum"> 211 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : _CharT* -<span class="lineNum"> 214 </span><span class="lineNoCov"> 0 : _M_refdata() throw()</span> -<span class="lineNum"> 215 </span><span class="lineNoCov"> 0 : { return reinterpret_cast<_CharT*>(this + 1); }</span> -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : _CharT* -<span class="lineNum"> 218 </span> : _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2) -<span class="lineNum"> 219 </span> : { -<span class="lineNum"> 220 </span> : return (!_M_is_leaked() && __alloc1 == __alloc2) -<span class="lineNum"> 221 </span> : ? _M_refcopy() : _M_clone(__alloc1); -<span class="lineNum"> 222 </span> : } -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : // Create & Destroy -<span class="lineNum"> 225 </span> : static _Rep* -<span class="lineNum"> 226 </span> : _S_create(size_type, size_type, const _Alloc&); -<span class="lineNum"> 227 </span> : -<span class="lineNum"> 228 </span> : void -<span class="lineNum"> 229 </span><span class="lineNoCov"> 0 : _M_dispose(const _Alloc& __a)</span> -<span class="lineNum"> 230 </span> : { -<span class="lineNum"> 231 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 232 </span><span class="lineNoCov"> 0 : if (__builtin_expect(this != &_S_empty_rep(), false))</span> -<span class="lineNum"> 233 </span> : #endif -<span class="lineNum"> 234 </span><span class="lineNoCov"> 0 : if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount,</span> -<span class="lineNum"> 235 </span> : -1) <= 0) -<span class="lineNum"> 236 </span><span class="lineNoCov"> 0 : _M_destroy(__a);</span> -<span class="lineNum"> 237 </span><span class="lineNoCov"> 0 : } // XXX MT</span> -<span class="lineNum"> 238 </span> : -<span class="lineNum"> 239 </span> : void -<span class="lineNum"> 240 </span> : _M_destroy(const _Alloc&) throw(); -<span class="lineNum"> 241 </span> : -<span class="lineNum"> 242 </span> : _CharT* -<span class="lineNum"> 243 </span> : _M_refcopy() throw() -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 246 </span> : if (__builtin_expect(this != &_S_empty_rep(), false)) -<span class="lineNum"> 247 </span> : #endif -<span class="lineNum"> 248 </span> : __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1); -<span class="lineNum"> 249 </span> : return _M_refdata(); -<span class="lineNum"> 250 </span> : } // XXX MT -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : _CharT* -<span class="lineNum"> 253 </span> : _M_clone(const _Alloc&, size_type __res = 0); -<span class="lineNum"> 254 </span> : }; -<span class="lineNum"> 255 </span> : -<span class="lineNum"> 256 </span> : // Use empty-base optimization: http://www.cantrip.org/emptyopt.html -<span class="lineNum"> 257 </span> : struct _Alloc_hider : _Alloc -<span class="lineNum"> 258 </span><span class="lineNoCov"> 0 : {</span> -<span class="lineNum"> 259 </span><span class="lineNoCov"> 0 : _Alloc_hider(_CharT* __dat, const _Alloc& __a)</span> -<span class="lineNum"> 260 </span><span class="lineNoCov"> 0 : : _Alloc(__a), _M_p(__dat) { }</span> -<span class="lineNum"> 261 </span> : -<span class="lineNum"> 262 </span> : _CharT* _M_p; // The actual data. -<span class="lineNum"> 263 </span> : }; -<span class="lineNum"> 264 </span> : -<span class="lineNum"> 265 </span> : public: -<span class="lineNum"> 266 </span> : // Data Members (public): -<span class="lineNum"> 267 </span> : // NB: This is an unsigned type, and thus represents the maximum -<span class="lineNum"> 268 </span> : // size that the allocator can hold. -<span class="lineNum"> 269 </span> : /// Value returned by various member functions when they fail. -<span class="lineNum"> 270 </span> : static const size_type npos = static_cast<size_type>(-1); -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : private: -<span class="lineNum"> 273 </span> : // Data Members (private): -<span class="lineNum"> 274 </span> : mutable _Alloc_hider _M_dataplus; -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : _CharT* -<span class="lineNum"> 277 </span><span class="lineNoCov"> 0 : _M_data() const</span> -<span class="lineNum"> 278 </span><span class="lineNoCov"> 0 : { return _M_dataplus._M_p; }</span> -<span class="lineNum"> 279 </span> : -<span class="lineNum"> 280 </span> : _CharT* -<span class="lineNum"> 281 </span> : _M_data(_CharT* __p) -<span class="lineNum"> 282 </span> : { return (_M_dataplus._M_p = __p); } -<span class="lineNum"> 283 </span> : -<span class="lineNum"> 284 </span> : _Rep* -<span class="lineNum"> 285 </span><span class="lineNoCov"> 0 : _M_rep() const</span> -<span class="lineNum"> 286 </span><span class="lineNoCov"> 0 : { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); }</span> -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : // For the internal use we have functions similar to `begin'/`end' -<span class="lineNum"> 289 </span> : // but they do not call _M_leak. -<span class="lineNum"> 290 </span> : iterator -<span class="lineNum"> 291 </span><span class="lineNoCov"> 0 : _M_ibegin() const</span> -<span class="lineNum"> 292 </span><span class="lineNoCov"> 0 : { return iterator(_M_data()); }</span> -<span class="lineNum"> 293 </span> : -<span class="lineNum"> 294 </span> : iterator -<span class="lineNum"> 295 </span> : _M_iend() const -<span class="lineNum"> 296 </span> : { return iterator(_M_data() + this->size()); } -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : void -<span class="lineNum"> 299 </span><span class="lineNoCov"> 0 : _M_leak() // for use in begin() & non-const op[]</span> -<span class="lineNum"> 300 </span> : { -<span class="lineNum"> 301 </span><span class="lineNoCov"> 0 : if (!_M_rep()->_M_is_leaked())</span> -<span class="lineNum"> 302 </span><span class="lineNoCov"> 0 : _M_leak_hard();</span> -<span class="lineNum"> 303 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : size_type -<span class="lineNum"> 306 </span><span class="lineNoCov"> 0 : _M_check(size_type __pos, const char* __s) const</span> -<span class="lineNum"> 307 </span> : { -<span class="lineNum"> 308 </span><span class="lineNoCov"> 0 : if (__pos > this->size())</span> -<span class="lineNum"> 309 </span><span class="lineNoCov"> 0 : __throw_out_of_range(__N(__s));</span> -<span class="lineNum"> 310 </span><span class="lineNoCov"> 0 : return __pos;</span> -<span class="lineNum"> 311 </span> : } -<span class="lineNum"> 312 </span> : -<span class="lineNum"> 313 </span> : void -<span class="lineNum"> 314 </span> : _M_check_length(size_type __n1, size_type __n2, const char* __s) const -<span class="lineNum"> 315 </span> : { -<span class="lineNum"> 316 </span> : if (this->max_size() - (this->size() - __n1) < __n2) -<span class="lineNum"> 317 </span> : __throw_length_error(__N(__s)); -<span class="lineNum"> 318 </span> : } -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : // NB: _M_limit doesn't check for a bad __pos value. -<span class="lineNum"> 321 </span> : size_type -<span class="lineNum"> 322 </span> : _M_limit(size_type __pos, size_type __off) const -<span class="lineNum"> 323 </span> : { -<span class="lineNum"> 324 </span> : const bool __testoff = __off < this->size() - __pos; -<span class="lineNum"> 325 </span> : return __testoff ? __off : this->size() - __pos; -<span class="lineNum"> 326 </span> : } -<span class="lineNum"> 327 </span> : -<span class="lineNum"> 328 </span> : // True if _Rep and source do not overlap. -<span class="lineNum"> 329 </span> : bool -<span class="lineNum"> 330 </span> : _M_disjunct(const _CharT* __s) const -<span class="lineNum"> 331 </span> : { -<span class="lineNum"> 332 </span> : return (less<const _CharT*>()(__s, _M_data()) -<span class="lineNum"> 333 </span> : || less<const _CharT*>()(_M_data() + this->size(), __s)); -<span class="lineNum"> 334 </span> : } -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : // When __n = 1 way faster than the general multichar -<span class="lineNum"> 337 </span> : // traits_type::copy/move/assign. -<span class="lineNum"> 338 </span> : static void -<span class="lineNum"> 339 </span><span class="lineNoCov"> 0 : _M_copy(_CharT* __d, const _CharT* __s, size_type __n)</span> -<span class="lineNum"> 340 </span> : { -<span class="lineNum"> 341 </span><span class="lineNoCov"> 0 : if (__n == 1)</span> -<span class="lineNum"> 342 </span><span class="lineNoCov"> 0 : traits_type::assign(*__d, *__s);</span> -<span class="lineNum"> 343 </span> : else -<span class="lineNum"> 344 </span><span class="lineNoCov"> 0 : traits_type::copy(__d, __s, __n);</span> -<span class="lineNum"> 345 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 346 </span> : -<span class="lineNum"> 347 </span> : static void -<span class="lineNum"> 348 </span> : _M_move(_CharT* __d, const _CharT* __s, size_type __n) -<span class="lineNum"> 349 </span> : { -<span class="lineNum"> 350 </span> : if (__n == 1) -<span class="lineNum"> 351 </span> : traits_type::assign(*__d, *__s); -<span class="lineNum"> 352 </span> : else -<span class="lineNum"> 353 </span> : traits_type::move(__d, __s, __n); -<span class="lineNum"> 354 </span> : } -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : static void -<span class="lineNum"> 357 </span> : _M_assign(_CharT* __d, size_type __n, _CharT __c) -<span class="lineNum"> 358 </span> : { -<span class="lineNum"> 359 </span> : if (__n == 1) -<span class="lineNum"> 360 </span> : traits_type::assign(*__d, __c); -<span class="lineNum"> 361 </span> : else -<span class="lineNum"> 362 </span> : traits_type::assign(__d, __n, __c); -<span class="lineNum"> 363 </span> : } -<span class="lineNum"> 364 </span> : -<span class="lineNum"> 365 </span> : // _S_copy_chars is a separate template to permit specialization -<span class="lineNum"> 366 </span> : // to optimize for the common case of pointers as iterators. -<span class="lineNum"> 367 </span> : template<class _Iterator> -<span class="lineNum"> 368 </span> : static void -<span class="lineNum"> 369 </span><span class="lineCov"> 1012 : _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)</span> -<span class="lineNum"> 370 </span> : { -<span class="lineNum"> 371 </span><span class="lineCov"> 11988 : for (; __k1 != __k2; ++__k1, ++__p)</span> -<span class="lineNum"> 372 </span><span class="lineCov"> 10976 : traits_type::assign(*__p, *__k1); // These types are off.</span> -<span class="lineNum"> 373 </span><span class="lineCov"> 1012 : }</span> -<span class="lineNum"> 374 </span> : -<span class="lineNum"> 375 </span> : static void -<span class="lineNum"> 376 </span><span class="lineNoCov"> 0 : _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)</span> -<span class="lineNum"> 377 </span><span class="lineNoCov"> 0 : { _S_copy_chars(__p, __k1.base(), __k2.base()); }</span> -<span class="lineNum"> 378 </span> : -<span class="lineNum"> 379 </span> : static void -<span class="lineNum"> 380 </span> : _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2) -<span class="lineNum"> 381 </span> : { _S_copy_chars(__p, __k1.base(), __k2.base()); } -<span class="lineNum"> 382 </span> : -<span class="lineNum"> 383 </span> : static void -<span class="lineNum"> 384 </span><span class="lineNoCov"> 0 : _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)</span> -<span class="lineNum"> 385 </span><span class="lineNoCov"> 0 : { _M_copy(__p, __k1, __k2 - __k1); }</span> -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span> : static void -<span class="lineNum"> 388 </span> : _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) -<span class="lineNum"> 389 </span> : { _M_copy(__p, __k1, __k2 - __k1); } -<span class="lineNum"> 390 </span> : -<span class="lineNum"> 391 </span> : static int -<span class="lineNum"> 392 </span><span class="lineNoCov"> 0 : _S_compare(size_type __n1, size_type __n2)</span> -<span class="lineNum"> 393 </span> : { -<span class="lineNum"> 394 </span><span class="lineNoCov"> 0 : const difference_type __d = difference_type(__n1 - __n2);</span> -<span class="lineNum"> 395 </span> : -<span class="lineNum"> 396 </span> : if (__d > __gnu_cxx::__numeric_traits<int>::__max) -<span class="lineNum"> 397 </span> : return __gnu_cxx::__numeric_traits<int>::__max; -<span class="lineNum"> 398 </span> : else if (__d < __gnu_cxx::__numeric_traits<int>::__min) -<span class="lineNum"> 399 </span> : return __gnu_cxx::__numeric_traits<int>::__min; -<span class="lineNum"> 400 </span> : else -<span class="lineNum"> 401 </span><span class="lineNoCov"> 0 : return int(__d);</span> -<span class="lineNum"> 402 </span> : } -<span class="lineNum"> 403 </span> : -<span class="lineNum"> 404 </span> : void -<span class="lineNum"> 405 </span> : _M_mutate(size_type __pos, size_type __len1, size_type __len2); -<span class="lineNum"> 406 </span> : -<span class="lineNum"> 407 </span> : void -<span class="lineNum"> 408 </span> : _M_leak_hard(); -<span class="lineNum"> 409 </span> : -<span class="lineNum"> 410 </span> : static _Rep& -<span class="lineNum"> 411 </span><span class="lineNoCov"> 0 : _S_empty_rep()</span> -<span class="lineNum"> 412 </span><span class="lineNoCov"> 0 : { return _Rep::_S_empty_rep(); }</span> -<span class="lineNum"> 413 </span> : -<span class="lineNum"> 414 </span> : public: -<span class="lineNum"> 415 </span> : // Construct/copy/destroy: -<span class="lineNum"> 416 </span> : // NB: We overload ctors in some cases instead of using default -<span class="lineNum"> 417 </span> : // arguments, per 17.4.4.4 para. 2 item 2. -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : /** -<span class="lineNum"> 420 </span> : * @brief Default constructor creates an empty string. -<span class="lineNum"> 421 </span> : */ -<span class="lineNum"> 422 </span> : inline -<span class="lineNum"> 423 </span> : basic_string(); -<span class="lineNum"> 424 </span> : -<span class="lineNum"> 425 </span> : /** -<span class="lineNum"> 426 </span> : * @brief Construct an empty string using allocator @a a. -<span class="lineNum"> 427 </span> : */ -<span class="lineNum"> 428 </span> : explicit -<span class="lineNum"> 429 </span> : basic_string(const _Alloc& __a); -<span class="lineNum"> 430 </span> : -<span class="lineNum"> 431 </span> : // NB: per LWG issue 42, semantics different from IS: -<span class="lineNum"> 432 </span> : /** -<span class="lineNum"> 433 </span> : * @brief Construct string with copy of value of @a str. -<span class="lineNum"> 434 </span> : * @param str Source string. -<span class="lineNum"> 435 </span> : */ -<span class="lineNum"> 436 </span> : basic_string(const basic_string& __str); -<span class="lineNum"> 437 </span> : /** -<span class="lineNum"> 438 </span> : * @brief Construct string as copy of a substring. -<span class="lineNum"> 439 </span> : * @param str Source string. -<span class="lineNum"> 440 </span> : * @param pos Index of first character to copy from. -<span class="lineNum"> 441 </span> : * @param n Number of characters to copy (default remainder). -<span class="lineNum"> 442 </span> : */ -<span class="lineNum"> 443 </span> : basic_string(const basic_string& __str, size_type __pos, -<span class="lineNum"> 444 </span> : size_type __n = npos); -<span class="lineNum"> 445 </span> : /** -<span class="lineNum"> 446 </span> : * @brief Construct string as copy of a substring. -<span class="lineNum"> 447 </span> : * @param str Source string. -<span class="lineNum"> 448 </span> : * @param pos Index of first character to copy from. -<span class="lineNum"> 449 </span> : * @param n Number of characters to copy. -<span class="lineNum"> 450 </span> : * @param a Allocator to use. -<span class="lineNum"> 451 </span> : */ -<span class="lineNum"> 452 </span> : basic_string(const basic_string& __str, size_type __pos, -<span class="lineNum"> 453 </span> : size_type __n, const _Alloc& __a); -<span class="lineNum"> 454 </span> : -<span class="lineNum"> 455 </span> : /** -<span class="lineNum"> 456 </span> : * @brief Construct string initialized by a character array. -<span class="lineNum"> 457 </span> : * @param s Source character array. -<span class="lineNum"> 458 </span> : * @param n Number of characters to copy. -<span class="lineNum"> 459 </span> : * @param a Allocator to use (default is default allocator). -<span class="lineNum"> 460 </span> : * -<span class="lineNum"> 461 </span> : * NB: @a s must have at least @a n characters, '\0' has no special -<span class="lineNum"> 462 </span> : * meaning. -<span class="lineNum"> 463 </span> : */ -<span class="lineNum"> 464 </span> : basic_string(const _CharT* __s, size_type __n, -<span class="lineNum"> 465 </span> : const _Alloc& __a = _Alloc()); -<span class="lineNum"> 466 </span> : /** -<span class="lineNum"> 467 </span> : * @brief Construct string as copy of a C string. -<span class="lineNum"> 468 </span> : * @param s Source C string. -<span class="lineNum"> 469 </span> : * @param a Allocator to use (default is default allocator). -<span class="lineNum"> 470 </span> : */ -<span class="lineNum"> 471 </span> : basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); -<span class="lineNum"> 472 </span> : /** -<span class="lineNum"> 473 </span> : * @brief Construct string as multiple characters. -<span class="lineNum"> 474 </span> : * @param n Number of characters. -<span class="lineNum"> 475 </span> : * @param c Character to use. -<span class="lineNum"> 476 </span> : * @param a Allocator to use (default is default allocator). -<span class="lineNum"> 477 </span> : */ -<span class="lineNum"> 478 </span> : basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()); -<span class="lineNum"> 479 </span> : -<span class="lineNum"> 480 </span> : /** -<span class="lineNum"> 481 </span> : * @brief Construct string as copy of a range. -<span class="lineNum"> 482 </span> : * @param beg Start of range. -<span class="lineNum"> 483 </span> : * @param end End of range. -<span class="lineNum"> 484 </span> : * @param a Allocator to use (default is default allocator). -<span class="lineNum"> 485 </span> : */ -<span class="lineNum"> 486 </span> : template<class _InputIterator> -<span class="lineNum"> 487 </span> : basic_string(_InputIterator __beg, _InputIterator __end, -<span class="lineNum"> 488 </span> : const _Alloc& __a = _Alloc()); -<span class="lineNum"> 489 </span> : -<span class="lineNum"> 490 </span> : /** -<span class="lineNum"> 491 </span> : * @brief Destroy the string instance. -<span class="lineNum"> 492 </span> : */ -<span class="lineNum"> 493 </span><span class="lineNoCov"> 0 : ~basic_string()</span> -<span class="lineNum"> 494 </span><span class="lineNoCov"> 0 : { _M_rep()->_M_dispose(this->get_allocator()); }</span> -<span class="lineNum"> 495 </span> : -<span class="lineNum"> 496 </span> : /** -<span class="lineNum"> 497 </span> : * @brief Assign the value of @a str to this string. -<span class="lineNum"> 498 </span> : * @param str Source string. -<span class="lineNum"> 499 </span> : */ -<span class="lineNum"> 500 </span> : basic_string& -<span class="lineNum"> 501 </span><span class="lineNoCov"> 0 : operator=(const basic_string& __str) </span> -<span class="lineNum"> 502 </span><span class="lineNoCov"> 0 : { return this->assign(__str); }</span> -<span class="lineNum"> 503 </span> : -<span class="lineNum"> 504 </span> : /** -<span class="lineNum"> 505 </span> : * @brief Copy contents of @a s into this string. -<span class="lineNum"> 506 </span> : * @param s Source null-terminated string. -<span class="lineNum"> 507 </span> : */ -<span class="lineNum"> 508 </span> : basic_string& -<span class="lineNum"> 509 </span><span class="lineNoCov"> 0 : operator=(const _CharT* __s) </span> -<span class="lineNum"> 510 </span><span class="lineNoCov"> 0 : { return this->assign(__s); }</span> -<span class="lineNum"> 511 </span> : -<span class="lineNum"> 512 </span> : /** -<span class="lineNum"> 513 </span> : * @brief Set value to string of length 1. -<span class="lineNum"> 514 </span> : * @param c Source character. -<span class="lineNum"> 515 </span> : * -<span class="lineNum"> 516 </span> : * Assigning to a character makes this string length 1 and -<span class="lineNum"> 517 </span> : * (*this)[0] == @a c. -<span class="lineNum"> 518 </span> : */ -<span class="lineNum"> 519 </span> : basic_string& -<span class="lineNum"> 520 </span> : operator=(_CharT __c) -<span class="lineNum"> 521 </span> : { -<span class="lineNum"> 522 </span> : this->assign(1, __c); -<span class="lineNum"> 523 </span> : return *this; -<span class="lineNum"> 524 </span> : } -<span class="lineNum"> 525 </span> : -<span class="lineNum"> 526 </span> : // Iterators: -<span class="lineNum"> 527 </span> : /** -<span class="lineNum"> 528 </span> : * Returns a read/write iterator that points to the first character in -<span class="lineNum"> 529 </span> : * the %string. Unshares the string. -<span class="lineNum"> 530 </span> : */ -<span class="lineNum"> 531 </span> : iterator -<span class="lineNum"> 532 </span><span class="lineNoCov"> 0 : begin()</span> -<span class="lineNum"> 533 </span> : { -<span class="lineNum"> 534 </span><span class="lineNoCov"> 0 : _M_leak();</span> -<span class="lineNum"> 535 </span><span class="lineNoCov"> 0 : return iterator(_M_data());</span> -<span class="lineNum"> 536 </span> : } -<span class="lineNum"> 537 </span> : -<span class="lineNum"> 538 </span> : /** -<span class="lineNum"> 539 </span> : * Returns a read-only (constant) iterator that points to the first -<span class="lineNum"> 540 </span> : * character in the %string. -<span class="lineNum"> 541 </span> : */ -<span class="lineNum"> 542 </span> : const_iterator -<span class="lineNum"> 543 </span><span class="lineNoCov"> 0 : begin() const</span> -<span class="lineNum"> 544 </span><span class="lineNoCov"> 0 : { return const_iterator(_M_data()); }</span> -<span class="lineNum"> 545 </span> : -<span class="lineNum"> 546 </span> : /** -<span class="lineNum"> 547 </span> : * Returns a read/write iterator that points one past the last -<span class="lineNum"> 548 </span> : * character in the %string. Unshares the string. -<span class="lineNum"> 549 </span> : */ -<span class="lineNum"> 550 </span> : iterator -<span class="lineNum"> 551 </span><span class="lineNoCov"> 0 : end()</span> -<span class="lineNum"> 552 </span> : { -<span class="lineNum"> 553 </span><span class="lineNoCov"> 0 : _M_leak();</span> -<span class="lineNum"> 554 </span><span class="lineNoCov"> 0 : return iterator(_M_data() + this->size());</span> -<span class="lineNum"> 555 </span> : } -<span class="lineNum"> 556 </span> : -<span class="lineNum"> 557 </span> : /** -<span class="lineNum"> 558 </span> : * Returns a read-only (constant) iterator that points one past the -<span class="lineNum"> 559 </span> : * last character in the %string. -<span class="lineNum"> 560 </span> : */ -<span class="lineNum"> 561 </span> : const_iterator -<span class="lineNum"> 562 </span><span class="lineNoCov"> 0 : end() const</span> -<span class="lineNum"> 563 </span><span class="lineNoCov"> 0 : { return const_iterator(_M_data() + this->size()); }</span> -<span class="lineNum"> 564 </span> : -<span class="lineNum"> 565 </span> : /** -<span class="lineNum"> 566 </span> : * Returns a read/write reverse iterator that points to the last -<span class="lineNum"> 567 </span> : * character in the %string. Iteration is done in reverse element -<span class="lineNum"> 568 </span> : * order. Unshares the string. -<span class="lineNum"> 569 </span> : */ -<span class="lineNum"> 570 </span> : reverse_iterator -<span class="lineNum"> 571 </span> : rbegin() -<span class="lineNum"> 572 </span> : { return reverse_iterator(this->end()); } -<span class="lineNum"> 573 </span> : -<span class="lineNum"> 574 </span> : /** -<span class="lineNum"> 575 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 576 </span> : * to the last character in the %string. Iteration is done in -<span class="lineNum"> 577 </span> : * reverse element order. -<span class="lineNum"> 578 </span> : */ -<span class="lineNum"> 579 </span> : const_reverse_iterator -<span class="lineNum"> 580 </span> : rbegin() const -<span class="lineNum"> 581 </span> : { return const_reverse_iterator(this->end()); } -<span class="lineNum"> 582 </span> : -<span class="lineNum"> 583 </span> : /** -<span class="lineNum"> 584 </span> : * Returns a read/write reverse iterator that points to one before the -<span class="lineNum"> 585 </span> : * first character in the %string. Iteration is done in reverse -<span class="lineNum"> 586 </span> : * element order. Unshares the string. -<span class="lineNum"> 587 </span> : */ -<span class="lineNum"> 588 </span> : reverse_iterator -<span class="lineNum"> 589 </span> : rend() -<span class="lineNum"> 590 </span> : { return reverse_iterator(this->begin()); } -<span class="lineNum"> 591 </span> : -<span class="lineNum"> 592 </span> : /** -<span class="lineNum"> 593 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 594 </span> : * to one before the first character in the %string. Iteration -<span class="lineNum"> 595 </span> : * is done in reverse element order. -<span class="lineNum"> 596 </span> : */ -<span class="lineNum"> 597 </span> : const_reverse_iterator -<span class="lineNum"> 598 </span> : rend() const -<span class="lineNum"> 599 </span> : { return const_reverse_iterator(this->begin()); } -<span class="lineNum"> 600 </span> : -<span class="lineNum"> 601 </span> : public: -<span class="lineNum"> 602 </span> : // Capacity: -<span class="lineNum"> 603 </span> : /// Returns the number of characters in the string, not including any -<span class="lineNum"> 604 </span> : /// null-termination. -<span class="lineNum"> 605 </span> : size_type -<span class="lineNum"> 606 </span><span class="lineNoCov"> 0 : size() const</span> -<span class="lineNum"> 607 </span><span class="lineNoCov"> 0 : { return _M_rep()->_M_length; }</span> -<span class="lineNum"> 608 </span> : -<span class="lineNum"> 609 </span> : /// Returns the number of characters in the string, not including any -<span class="lineNum"> 610 </span> : /// null-termination. -<span class="lineNum"> 611 </span> : size_type -<span class="lineNum"> 612 </span><span class="lineNoCov"> 0 : length() const</span> -<span class="lineNum"> 613 </span><span class="lineNoCov"> 0 : { return _M_rep()->_M_length; }</span> -<span class="lineNum"> 614 </span> : -<span class="lineNum"> 615 </span> : /// Returns the size() of the largest possible %string. -<span class="lineNum"> 616 </span> : size_type -<span class="lineNum"> 617 </span> : max_size() const -<span class="lineNum"> 618 </span> : { return _Rep::_S_max_size; } -<span class="lineNum"> 619 </span> : -<span class="lineNum"> 620 </span> : /** -<span class="lineNum"> 621 </span> : * @brief Resizes the %string to the specified number of characters. -<span class="lineNum"> 622 </span> : * @param n Number of characters the %string should contain. -<span class="lineNum"> 623 </span> : * @param c Character to fill any new elements. -<span class="lineNum"> 624 </span> : * -<span class="lineNum"> 625 </span> : * This function will %resize the %string to the specified -<span class="lineNum"> 626 </span> : * number of characters. If the number is smaller than the -<span class="lineNum"> 627 </span> : * %string's current size the %string is truncated, otherwise -<span class="lineNum"> 628 </span> : * the %string is extended and new elements are set to @a c. -<span class="lineNum"> 629 </span> : */ -<span class="lineNum"> 630 </span> : void -<span class="lineNum"> 631 </span> : resize(size_type __n, _CharT __c); -<span class="lineNum"> 632 </span> : -<span class="lineNum"> 633 </span> : /** -<span class="lineNum"> 634 </span> : * @brief Resizes the %string to the specified number of characters. -<span class="lineNum"> 635 </span> : * @param n Number of characters the %string should contain. -<span class="lineNum"> 636 </span> : * -<span class="lineNum"> 637 </span> : * This function will resize the %string to the specified length. If -<span class="lineNum"> 638 </span> : * the new size is smaller than the %string's current size the %string -<span class="lineNum"> 639 </span> : * is truncated, otherwise the %string is extended and new characters -<span class="lineNum"> 640 </span> : * are default-constructed. For basic types such as char, this means -<span class="lineNum"> 641 </span> : * setting them to 0. -<span class="lineNum"> 642 </span> : */ -<span class="lineNum"> 643 </span> : void -<span class="lineNum"> 644 </span><span class="lineNoCov"> 0 : resize(size_type __n)</span> -<span class="lineNum"> 645 </span><span class="lineNoCov"> 0 : { this->resize(__n, _CharT()); }</span> -<span class="lineNum"> 646 </span> : -<span class="lineNum"> 647 </span> : /** -<span class="lineNum"> 648 </span> : * Returns the total number of characters that the %string can hold -<span class="lineNum"> 649 </span> : * before needing to allocate more memory. -<span class="lineNum"> 650 </span> : */ -<span class="lineNum"> 651 </span> : size_type -<span class="lineNum"> 652 </span><span class="lineNoCov"> 0 : capacity() const</span> -<span class="lineNum"> 653 </span><span class="lineNoCov"> 0 : { return _M_rep()->_M_capacity; }</span> -<span class="lineNum"> 654 </span> : -<span class="lineNum"> 655 </span> : /** -<span class="lineNum"> 656 </span> : * @brief Attempt to preallocate enough memory for specified number of -<span class="lineNum"> 657 </span> : * characters. -<span class="lineNum"> 658 </span> : * @param res_arg Number of characters required. -<span class="lineNum"> 659 </span> : * @throw std::length_error If @a res_arg exceeds @c max_size(). -<span class="lineNum"> 660 </span> : * -<span class="lineNum"> 661 </span> : * This function attempts to reserve enough memory for the -<span class="lineNum"> 662 </span> : * %string to hold the specified number of characters. If the -<span class="lineNum"> 663 </span> : * number requested is more than max_size(), length_error is -<span class="lineNum"> 664 </span> : * thrown. -<span class="lineNum"> 665 </span> : * -<span class="lineNum"> 666 </span> : * The advantage of this function is that if optimal code is a -<span class="lineNum"> 667 </span> : * necessity and the user can determine the string length that will be -<span class="lineNum"> 668 </span> : * required, the user can reserve the memory in %advance, and thus -<span class="lineNum"> 669 </span> : * prevent a possible reallocation of memory and copying of %string -<span class="lineNum"> 670 </span> : * data. -<span class="lineNum"> 671 </span> : */ -<span class="lineNum"> 672 </span> : void -<span class="lineNum"> 673 </span> : reserve(size_type __res_arg = 0); -<span class="lineNum"> 674 </span> : -<span class="lineNum"> 675 </span> : /** -<span class="lineNum"> 676 </span> : * Erases the string, making it empty. -<span class="lineNum"> 677 </span> : */ -<span class="lineNum"> 678 </span> : void -<span class="lineNum"> 679 </span><span class="lineNoCov"> 0 : clear()</span> -<span class="lineNum"> 680 </span><span class="lineNoCov"> 0 : { _M_mutate(0, this->size(), 0); }</span> -<span class="lineNum"> 681 </span> : -<span class="lineNum"> 682 </span> : /** -<span class="lineNum"> 683 </span> : * Returns true if the %string is empty. Equivalent to *this == "". -<span class="lineNum"> 684 </span> : */ -<span class="lineNum"> 685 </span> : bool -<span class="lineNum"> 686 </span><span class="lineNoCov"> 0 : empty() const</span> -<span class="lineNum"> 687 </span><span class="lineNoCov"> 0 : { return this->size() == 0; }</span> -<span class="lineNum"> 688 </span> : -<span class="lineNum"> 689 </span> : // Element access: -<span class="lineNum"> 690 </span> : /** -<span class="lineNum"> 691 </span> : * @brief Subscript access to the data contained in the %string. -<span class="lineNum"> 692 </span> : * @param pos The index of the character to access. -<span class="lineNum"> 693 </span> : * @return Read-only (constant) reference to the character. -<span class="lineNum"> 694 </span> : * -<span class="lineNum"> 695 </span> : * This operator allows for easy, array-style, data access. -<span class="lineNum"> 696 </span> : * Note that data access with this operator is unchecked and -<span class="lineNum"> 697 </span> : * out_of_range lookups are not defined. (For checked lookups -<span class="lineNum"> 698 </span> : * see at().) -<span class="lineNum"> 699 </span> : */ -<span class="lineNum"> 700 </span> : const_reference -<span class="lineNum"> 701 </span><span class="lineNoCov"> 0 : operator[] (size_type __pos) const</span> -<span class="lineNum"> 702 </span> : { -<span class="lineNum"> 703 </span> : _GLIBCXX_DEBUG_ASSERT(__pos <= size()); -<span class="lineNum"> 704 </span><span class="lineNoCov"> 0 : return _M_data()[__pos];</span> -<span class="lineNum"> 705 </span> : } -<span class="lineNum"> 706 </span> : -<span class="lineNum"> 707 </span> : /** -<span class="lineNum"> 708 </span> : * @brief Subscript access to the data contained in the %string. -<span class="lineNum"> 709 </span> : * @param pos The index of the character to access. -<span class="lineNum"> 710 </span> : * @return Read/write reference to the character. -<span class="lineNum"> 711 </span> : * -<span class="lineNum"> 712 </span> : * This operator allows for easy, array-style, data access. -<span class="lineNum"> 713 </span> : * Note that data access with this operator is unchecked and -<span class="lineNum"> 714 </span> : * out_of_range lookups are not defined. (For checked lookups -<span class="lineNum"> 715 </span> : * see at().) Unshares the string. -<span class="lineNum"> 716 </span> : */ -<span class="lineNum"> 717 </span> : reference -<span class="lineNum"> 718 </span><span class="lineNoCov"> 0 : operator[](size_type __pos)</span> -<span class="lineNum"> 719 </span> : { -<span class="lineNum"> 720 </span> : // allow pos == size() as v3 extension: -<span class="lineNum"> 721 </span> : _GLIBCXX_DEBUG_ASSERT(__pos <= size()); -<span class="lineNum"> 722 </span> : // but be strict in pedantic mode: -<span class="lineNum"> 723 </span> : _GLIBCXX_DEBUG_PEDASSERT(__pos < size()); -<span class="lineNum"> 724 </span><span class="lineNoCov"> 0 : _M_leak();</span> -<span class="lineNum"> 725 </span><span class="lineNoCov"> 0 : return _M_data()[__pos];</span> -<span class="lineNum"> 726 </span> : } -<span class="lineNum"> 727 </span> : -<span class="lineNum"> 728 </span> : /** -<span class="lineNum"> 729 </span> : * @brief Provides access to the data contained in the %string. -<span class="lineNum"> 730 </span> : * @param n The index of the character to access. -<span class="lineNum"> 731 </span> : * @return Read-only (const) reference to the character. -<span class="lineNum"> 732 </span> : * @throw std::out_of_range If @a n is an invalid index. -<span class="lineNum"> 733 </span> : * -<span class="lineNum"> 734 </span> : * This function provides for safer data access. The parameter is -<span class="lineNum"> 735 </span> : * first checked that it is in the range of the string. The function -<span class="lineNum"> 736 </span> : * throws out_of_range if the check fails. -<span class="lineNum"> 737 </span> : */ -<span class="lineNum"> 738 </span> : const_reference -<span class="lineNum"> 739 </span> : at(size_type __n) const -<span class="lineNum"> 740 </span> : { -<span class="lineNum"> 741 </span> : if (__n >= this->size()) -<span class="lineNum"> 742 </span> : __throw_out_of_range(__N("basic_string::at")); -<span class="lineNum"> 743 </span> : return _M_data()[__n]; -<span class="lineNum"> 744 </span> : } -<span class="lineNum"> 745 </span> : -<span class="lineNum"> 746 </span> : /** -<span class="lineNum"> 747 </span> : * @brief Provides access to the data contained in the %string. -<span class="lineNum"> 748 </span> : * @param n The index of the character to access. -<span class="lineNum"> 749 </span> : * @return Read/write reference to the character. -<span class="lineNum"> 750 </span> : * @throw std::out_of_range If @a n is an invalid index. -<span class="lineNum"> 751 </span> : * -<span class="lineNum"> 752 </span> : * This function provides for safer data access. The parameter is -<span class="lineNum"> 753 </span> : * first checked that it is in the range of the string. The function -<span class="lineNum"> 754 </span> : * throws out_of_range if the check fails. Success results in -<span class="lineNum"> 755 </span> : * unsharing the string. -<span class="lineNum"> 756 </span> : */ -<span class="lineNum"> 757 </span> : reference -<span class="lineNum"> 758 </span> : at(size_type __n) -<span class="lineNum"> 759 </span> : { -<span class="lineNum"> 760 </span> : if (__n >= size()) -<span class="lineNum"> 761 </span> : __throw_out_of_range(__N("basic_string::at")); -<span class="lineNum"> 762 </span> : _M_leak(); -<span class="lineNum"> 763 </span> : return _M_data()[__n]; -<span class="lineNum"> 764 </span> : } -<span class="lineNum"> 765 </span> : -<span class="lineNum"> 766 </span> : // Modifiers: -<span class="lineNum"> 767 </span> : /** -<span class="lineNum"> 768 </span> : * @brief Append a string to this string. -<span class="lineNum"> 769 </span> : * @param str The string to append. -<span class="lineNum"> 770 </span> : * @return Reference to this string. -<span class="lineNum"> 771 </span> : */ -<span class="lineNum"> 772 </span> : basic_string& -<span class="lineNum"> 773 </span><span class="lineNoCov"> 0 : operator+=(const basic_string& __str)</span> -<span class="lineNum"> 774 </span><span class="lineNoCov"> 0 : { return this->append(__str); }</span> -<span class="lineNum"> 775 </span> : -<span class="lineNum"> 776 </span> : /** -<span class="lineNum"> 777 </span> : * @brief Append a C string. -<span class="lineNum"> 778 </span> : * @param s The C string to append. -<span class="lineNum"> 779 </span> : * @return Reference to this string. -<span class="lineNum"> 780 </span> : */ -<span class="lineNum"> 781 </span> : basic_string& -<span class="lineNum"> 782 </span><span class="lineNoCov"> 0 : operator+=(const _CharT* __s)</span> -<span class="lineNum"> 783 </span><span class="lineNoCov"> 0 : { return this->append(__s); }</span> -<span class="lineNum"> 784 </span> : -<span class="lineNum"> 785 </span> : /** -<span class="lineNum"> 786 </span> : * @brief Append a character. -<span class="lineNum"> 787 </span> : * @param c The character to append. -<span class="lineNum"> 788 </span> : * @return Reference to this string. -<span class="lineNum"> 789 </span> : */ -<span class="lineNum"> 790 </span> : basic_string& -<span class="lineNum"> 791 </span><span class="lineNoCov"> 0 : operator+=(_CharT __c)</span> -<span class="lineNum"> 792 </span> : { -<span class="lineNum"> 793 </span><span class="lineNoCov"> 0 : this->push_back(__c);</span> -<span class="lineNum"> 794 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 795 </span> : } -<span class="lineNum"> 796 </span> : -<span class="lineNum"> 797 </span> : /** -<span class="lineNum"> 798 </span> : * @brief Append a string to this string. -<span class="lineNum"> 799 </span> : * @param str The string to append. -<span class="lineNum"> 800 </span> : * @return Reference to this string. -<span class="lineNum"> 801 </span> : */ -<span class="lineNum"> 802 </span> : basic_string& -<span class="lineNum"> 803 </span> : append(const basic_string& __str); -<span class="lineNum"> 804 </span> : -<span class="lineNum"> 805 </span> : /** -<span class="lineNum"> 806 </span> : * @brief Append a substring. -<span class="lineNum"> 807 </span> : * @param str The string to append. -<span class="lineNum"> 808 </span> : * @param pos Index of the first character of str to append. -<span class="lineNum"> 809 </span> : * @param n The number of characters to append. -<span class="lineNum"> 810 </span> : * @return Reference to this string. -<span class="lineNum"> 811 </span> : * @throw std::out_of_range if @a pos is not a valid index. -<span class="lineNum"> 812 </span> : * -<span class="lineNum"> 813 </span> : * This function appends @a n characters from @a str starting at @a pos -<span class="lineNum"> 814 </span> : * to this string. If @a n is is larger than the number of available -<span class="lineNum"> 815 </span> : * characters in @a str, the remainder of @a str is appended. -<span class="lineNum"> 816 </span> : */ -<span class="lineNum"> 817 </span> : basic_string& -<span class="lineNum"> 818 </span> : append(const basic_string& __str, size_type __pos, size_type __n); -<span class="lineNum"> 819 </span> : -<span class="lineNum"> 820 </span> : /** -<span class="lineNum"> 821 </span> : * @brief Append a C substring. -<span class="lineNum"> 822 </span> : * @param s The C string to append. -<span class="lineNum"> 823 </span> : * @param n The number of characters to append. -<span class="lineNum"> 824 </span> : * @return Reference to this string. -<span class="lineNum"> 825 </span> : */ -<span class="lineNum"> 826 </span> : basic_string& -<span class="lineNum"> 827 </span> : append(const _CharT* __s, size_type __n); -<span class="lineNum"> 828 </span> : -<span class="lineNum"> 829 </span> : /** -<span class="lineNum"> 830 </span> : * @brief Append a C string. -<span class="lineNum"> 831 </span> : * @param s The C string to append. -<span class="lineNum"> 832 </span> : * @return Reference to this string. -<span class="lineNum"> 833 </span> : */ -<span class="lineNum"> 834 </span> : basic_string& -<span class="lineNum"> 835 </span><span class="lineNoCov"> 0 : append(const _CharT* __s)</span> -<span class="lineNum"> 836 </span> : { -<span class="lineNum"> 837 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 838 </span><span class="lineNoCov"> 0 : return this->append(__s, traits_type::length(__s));</span> -<span class="lineNum"> 839 </span> : } -<span class="lineNum"> 840 </span> : -<span class="lineNum"> 841 </span> : /** -<span class="lineNum"> 842 </span> : * @brief Append multiple characters. -<span class="lineNum"> 843 </span> : * @param n The number of characters to append. -<span class="lineNum"> 844 </span> : * @param c The character to use. -<span class="lineNum"> 845 </span> : * @return Reference to this string. -<span class="lineNum"> 846 </span> : * -<span class="lineNum"> 847 </span> : * Appends n copies of c to this string. -<span class="lineNum"> 848 </span> : */ -<span class="lineNum"> 849 </span> : basic_string& -<span class="lineNum"> 850 </span> : append(size_type __n, _CharT __c); -<span class="lineNum"> 851 </span> : -<span class="lineNum"> 852 </span> : /** -<span class="lineNum"> 853 </span> : * @brief Append a range of characters. -<span class="lineNum"> 854 </span> : * @param first Iterator referencing the first character to append. -<span class="lineNum"> 855 </span> : * @param last Iterator marking the end of the range. -<span class="lineNum"> 856 </span> : * @return Reference to this string. -<span class="lineNum"> 857 </span> : * -<span class="lineNum"> 858 </span> : * Appends characters in the range [first,last) to this string. -<span class="lineNum"> 859 </span> : */ -<span class="lineNum"> 860 </span> : template<class _InputIterator> -<span class="lineNum"> 861 </span> : basic_string& -<span class="lineNum"> 862 </span> : append(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 863 </span> : { return this->replace(_M_iend(), _M_iend(), __first, __last); } -<span class="lineNum"> 864 </span> : -<span class="lineNum"> 865 </span> : /** -<span class="lineNum"> 866 </span> : * @brief Append a single character. -<span class="lineNum"> 867 </span> : * @param c Character to append. -<span class="lineNum"> 868 </span> : */ -<span class="lineNum"> 869 </span> : void -<span class="lineNum"> 870 </span><span class="lineNoCov"> 0 : push_back(_CharT __c)</span> -<span class="lineNum"> 871 </span> : { -<span class="lineNum"> 872 </span><span class="lineNoCov"> 0 : const size_type __len = 1 + this->size();</span> -<span class="lineNum"> 873 </span><span class="lineNoCov"> 0 : if (__len > this->capacity() || _M_rep()->_M_is_shared())</span> -<span class="lineNum"> 874 </span><span class="lineNoCov"> 0 : this->reserve(__len);</span> -<span class="lineNum"> 875 </span><span class="lineNoCov"> 0 : traits_type::assign(_M_data()[this->size()], __c);</span> -<span class="lineNum"> 876 </span><span class="lineNoCov"> 0 : _M_rep()->_M_set_length_and_sharable(__len);</span> -<span class="lineNum"> 877 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 878 </span> : -<span class="lineNum"> 879 </span> : /** -<span class="lineNum"> 880 </span> : * @brief Set value to contents of another string. -<span class="lineNum"> 881 </span> : * @param str Source string to use. -<span class="lineNum"> 882 </span> : * @return Reference to this string. -<span class="lineNum"> 883 </span> : */ -<span class="lineNum"> 884 </span> : basic_string& -<span class="lineNum"> 885 </span> : assign(const basic_string& __str); -<span class="lineNum"> 886 </span> : -<span class="lineNum"> 887 </span> : /** -<span class="lineNum"> 888 </span> : * @brief Set value to a substring of a string. -<span class="lineNum"> 889 </span> : * @param str The string to use. -<span class="lineNum"> 890 </span> : * @param pos Index of the first character of str. -<span class="lineNum"> 891 </span> : * @param n Number of characters to use. -<span class="lineNum"> 892 </span> : * @return Reference to this string. -<span class="lineNum"> 893 </span> : * @throw std::out_of_range if @a pos is not a valid index. -<span class="lineNum"> 894 </span> : * -<span class="lineNum"> 895 </span> : * This function sets this string to the substring of @a str consisting -<span class="lineNum"> 896 </span> : * of @a n characters at @a pos. If @a n is is larger than the number -<span class="lineNum"> 897 </span> : * of available characters in @a str, the remainder of @a str is used. -<span class="lineNum"> 898 </span> : */ -<span class="lineNum"> 899 </span> : basic_string& -<span class="lineNum"> 900 </span> : assign(const basic_string& __str, size_type __pos, size_type __n) -<span class="lineNum"> 901 </span> : { return this->assign(__str._M_data() -<span class="lineNum"> 902 </span> : + __str._M_check(__pos, "basic_string::assign"), -<span class="lineNum"> 903 </span> : __str._M_limit(__pos, __n)); } -<span class="lineNum"> 904 </span> : -<span class="lineNum"> 905 </span> : /** -<span class="lineNum"> 906 </span> : * @brief Set value to a C substring. -<span class="lineNum"> 907 </span> : * @param s The C string to use. -<span class="lineNum"> 908 </span> : * @param n Number of characters to use. -<span class="lineNum"> 909 </span> : * @return Reference to this string. -<span class="lineNum"> 910 </span> : * -<span class="lineNum"> 911 </span> : * This function sets the value of this string to the first @a n -<span class="lineNum"> 912 </span> : * characters of @a s. If @a n is is larger than the number of -<span class="lineNum"> 913 </span> : * available characters in @a s, the remainder of @a s is used. -<span class="lineNum"> 914 </span> : */ -<span class="lineNum"> 915 </span> : basic_string& -<span class="lineNum"> 916 </span> : assign(const _CharT* __s, size_type __n); -<span class="lineNum"> 917 </span> : -<span class="lineNum"> 918 </span> : /** -<span class="lineNum"> 919 </span> : * @brief Set value to contents of a C string. -<span class="lineNum"> 920 </span> : * @param s The C string to use. -<span class="lineNum"> 921 </span> : * @return Reference to this string. -<span class="lineNum"> 922 </span> : * -<span class="lineNum"> 923 </span> : * This function sets the value of this string to the value of @a s. -<span class="lineNum"> 924 </span> : * The data is copied, so there is no dependence on @a s once the -<span class="lineNum"> 925 </span> : * function returns. -<span class="lineNum"> 926 </span> : */ -<span class="lineNum"> 927 </span> : basic_string& -<span class="lineNum"> 928 </span><span class="lineNoCov"> 0 : assign(const _CharT* __s)</span> -<span class="lineNum"> 929 </span> : { -<span class="lineNum"> 930 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 931 </span><span class="lineNoCov"> 0 : return this->assign(__s, traits_type::length(__s));</span> -<span class="lineNum"> 932 </span> : } -<span class="lineNum"> 933 </span> : -<span class="lineNum"> 934 </span> : /** -<span class="lineNum"> 935 </span> : * @brief Set value to multiple characters. -<span class="lineNum"> 936 </span> : * @param n Length of the resulting string. -<span class="lineNum"> 937 </span> : * @param c The character to use. -<span class="lineNum"> 938 </span> : * @return Reference to this string. -<span class="lineNum"> 939 </span> : * -<span class="lineNum"> 940 </span> : * This function sets the value of this string to @a n copies of -<span class="lineNum"> 941 </span> : * character @a c. -<span class="lineNum"> 942 </span> : */ -<span class="lineNum"> 943 </span> : basic_string& -<span class="lineNum"> 944 </span> : assign(size_type __n, _CharT __c) -<span class="lineNum"> 945 </span> : { return _M_replace_aux(size_type(0), this->size(), __n, __c); } -<span class="lineNum"> 946 </span> : -<span class="lineNum"> 947 </span> : /** -<span class="lineNum"> 948 </span> : * @brief Set value to a range of characters. -<span class="lineNum"> 949 </span> : * @param first Iterator referencing the first character to append. -<span class="lineNum"> 950 </span> : * @param last Iterator marking the end of the range. -<span class="lineNum"> 951 </span> : * @return Reference to this string. -<span class="lineNum"> 952 </span> : * -<span class="lineNum"> 953 </span> : * Sets value of string to characters in the range [first,last). -<span class="lineNum"> 954 </span> : */ -<span class="lineNum"> 955 </span> : template<class _InputIterator> -<span class="lineNum"> 956 </span> : basic_string& -<span class="lineNum"> 957 </span> : assign(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 958 </span> : { return this->replace(_M_ibegin(), _M_iend(), __first, __last); } -<span class="lineNum"> 959 </span> : -<span class="lineNum"> 960 </span> : /** -<span class="lineNum"> 961 </span> : * @brief Insert multiple characters. -<span class="lineNum"> 962 </span> : * @param p Iterator referencing location in string to insert at. -<span class="lineNum"> 963 </span> : * @param n Number of characters to insert -<span class="lineNum"> 964 </span> : * @param c The character to insert. -<span class="lineNum"> 965 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 966 </span> : * -<span class="lineNum"> 967 </span> : * Inserts @a n copies of character @a c starting at the position -<span class="lineNum"> 968 </span> : * referenced by iterator @a p. If adding characters causes the length -<span class="lineNum"> 969 </span> : * to exceed max_size(), length_error is thrown. The value of the -<span class="lineNum"> 970 </span> : * string doesn't change if an error is thrown. -<span class="lineNum"> 971 </span> : */ -<span class="lineNum"> 972 </span> : void -<span class="lineNum"> 973 </span> : insert(iterator __p, size_type __n, _CharT __c) -<span class="lineNum"> 974 </span> : { this->replace(__p, __p, __n, __c); } -<span class="lineNum"> 975 </span> : -<span class="lineNum"> 976 </span> : /** -<span class="lineNum"> 977 </span> : * @brief Insert a range of characters. -<span class="lineNum"> 978 </span> : * @param p Iterator referencing location in string to insert at. -<span class="lineNum"> 979 </span> : * @param beg Start of range. -<span class="lineNum"> 980 </span> : * @param end End of range. -<span class="lineNum"> 981 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 982 </span> : * -<span class="lineNum"> 983 </span> : * Inserts characters in range [beg,end). If adding characters causes -<span class="lineNum"> 984 </span> : * the length to exceed max_size(), length_error is thrown. The value -<span class="lineNum"> 985 </span> : * of the string doesn't change if an error is thrown. -<span class="lineNum"> 986 </span> : */ -<span class="lineNum"> 987 </span> : template<class _InputIterator> -<span class="lineNum"> 988 </span> : void -<span class="lineNum"> 989 </span> : insert(iterator __p, _InputIterator __beg, _InputIterator __end) -<span class="lineNum"> 990 </span> : { this->replace(__p, __p, __beg, __end); } -<span class="lineNum"> 991 </span> : -<span class="lineNum"> 992 </span> : /** -<span class="lineNum"> 993 </span> : * @brief Insert value of a string. -<span class="lineNum"> 994 </span> : * @param pos1 Iterator referencing location in string to insert at. -<span class="lineNum"> 995 </span> : * @param str The string to insert. -<span class="lineNum"> 996 </span> : * @return Reference to this string. -<span class="lineNum"> 997 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 998 </span> : * -<span class="lineNum"> 999 </span> : * Inserts value of @a str starting at @a pos1. If adding characters -<span class="lineNum"> 1000 </span> : * causes the length to exceed max_size(), length_error is thrown. The -<span class="lineNum"> 1001 </span> : * value of the string doesn't change if an error is thrown. -<span class="lineNum"> 1002 </span> : */ -<span class="lineNum"> 1003 </span> : basic_string& -<span class="lineNum"> 1004 </span> : insert(size_type __pos1, const basic_string& __str) -<span class="lineNum"> 1005 </span> : { return this->insert(__pos1, __str, size_type(0), __str.size()); } -<span class="lineNum"> 1006 </span> : -<span class="lineNum"> 1007 </span> : /** -<span class="lineNum"> 1008 </span> : * @brief Insert a substring. -<span class="lineNum"> 1009 </span> : * @param pos1 Iterator referencing location in string to insert at. -<span class="lineNum"> 1010 </span> : * @param str The string to insert. -<span class="lineNum"> 1011 </span> : * @param pos2 Start of characters in str to insert. -<span class="lineNum"> 1012 </span> : * @param n Number of characters to insert. -<span class="lineNum"> 1013 </span> : * @return Reference to this string. -<span class="lineNum"> 1014 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1015 </span> : * @throw std::out_of_range If @a pos1 > size() or -<span class="lineNum"> 1016 </span> : * @a pos2 > @a str.size(). -<span class="lineNum"> 1017 </span> : * -<span class="lineNum"> 1018 </span> : * Starting at @a pos1, insert @a n character of @a str beginning with -<span class="lineNum"> 1019 </span> : * @a pos2. If adding characters causes the length to exceed -<span class="lineNum"> 1020 </span> : * max_size(), length_error is thrown. If @a pos1 is beyond the end of -<span class="lineNum"> 1021 </span> : * this string or @a pos2 is beyond the end of @a str, out_of_range is -<span class="lineNum"> 1022 </span> : * thrown. The value of the string doesn't change if an error is -<span class="lineNum"> 1023 </span> : * thrown. -<span class="lineNum"> 1024 </span> : */ -<span class="lineNum"> 1025 </span> : basic_string& -<span class="lineNum"> 1026 </span> : insert(size_type __pos1, const basic_string& __str, -<span class="lineNum"> 1027 </span> : size_type __pos2, size_type __n) -<span class="lineNum"> 1028 </span> : { return this->insert(__pos1, __str._M_data() -<span class="lineNum"> 1029 </span> : + __str._M_check(__pos2, "basic_string::insert"), -<span class="lineNum"> 1030 </span> : __str._M_limit(__pos2, __n)); } -<span class="lineNum"> 1031 </span> : -<span class="lineNum"> 1032 </span> : /** -<span class="lineNum"> 1033 </span> : * @brief Insert a C substring. -<span class="lineNum"> 1034 </span> : * @param pos Iterator referencing location in string to insert at. -<span class="lineNum"> 1035 </span> : * @param s The C string to insert. -<span class="lineNum"> 1036 </span> : * @param n The number of characters to insert. -<span class="lineNum"> 1037 </span> : * @return Reference to this string. -<span class="lineNum"> 1038 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1039 </span> : * @throw std::out_of_range If @a pos is beyond the end of this -<span class="lineNum"> 1040 </span> : * string. -<span class="lineNum"> 1041 </span> : * -<span class="lineNum"> 1042 </span> : * Inserts the first @a n characters of @a s starting at @a pos. If -<span class="lineNum"> 1043 </span> : * adding characters causes the length to exceed max_size(), -<span class="lineNum"> 1044 </span> : * length_error is thrown. If @a pos is beyond end(), out_of_range is -<span class="lineNum"> 1045 </span> : * thrown. The value of the string doesn't change if an error is -<span class="lineNum"> 1046 </span> : * thrown. -<span class="lineNum"> 1047 </span> : */ -<span class="lineNum"> 1048 </span> : basic_string& -<span class="lineNum"> 1049 </span> : insert(size_type __pos, const _CharT* __s, size_type __n); -<span class="lineNum"> 1050 </span> : -<span class="lineNum"> 1051 </span> : /** -<span class="lineNum"> 1052 </span> : * @brief Insert a C string. -<span class="lineNum"> 1053 </span> : * @param pos Iterator referencing location in string to insert at. -<span class="lineNum"> 1054 </span> : * @param s The C string to insert. -<span class="lineNum"> 1055 </span> : * @return Reference to this string. -<span class="lineNum"> 1056 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1057 </span> : * @throw std::out_of_range If @a pos is beyond the end of this -<span class="lineNum"> 1058 </span> : * string. -<span class="lineNum"> 1059 </span> : * -<span class="lineNum"> 1060 </span> : * Inserts the first @a n characters of @a s starting at @a pos. If -<span class="lineNum"> 1061 </span> : * adding characters causes the length to exceed max_size(), -<span class="lineNum"> 1062 </span> : * length_error is thrown. If @a pos is beyond end(), out_of_range is -<span class="lineNum"> 1063 </span> : * thrown. The value of the string doesn't change if an error is -<span class="lineNum"> 1064 </span> : * thrown. -<span class="lineNum"> 1065 </span> : */ -<span class="lineNum"> 1066 </span> : basic_string& -<span class="lineNum"> 1067 </span> : insert(size_type __pos, const _CharT* __s) -<span class="lineNum"> 1068 </span> : { -<span class="lineNum"> 1069 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1070 </span> : return this->insert(__pos, __s, traits_type::length(__s)); -<span class="lineNum"> 1071 </span> : } -<span class="lineNum"> 1072 </span> : -<span class="lineNum"> 1073 </span> : /** -<span class="lineNum"> 1074 </span> : * @brief Insert multiple characters. -<span class="lineNum"> 1075 </span> : * @param pos Index in string to insert at. -<span class="lineNum"> 1076 </span> : * @param n Number of characters to insert -<span class="lineNum"> 1077 </span> : * @param c The character to insert. -<span class="lineNum"> 1078 </span> : * @return Reference to this string. -<span class="lineNum"> 1079 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1080 </span> : * @throw std::out_of_range If @a pos is beyond the end of this -<span class="lineNum"> 1081 </span> : * string. -<span class="lineNum"> 1082 </span> : * -<span class="lineNum"> 1083 </span> : * Inserts @a n copies of character @a c starting at index @a pos. If -<span class="lineNum"> 1084 </span> : * adding characters causes the length to exceed max_size(), -<span class="lineNum"> 1085 </span> : * length_error is thrown. If @a pos > length(), out_of_range is -<span class="lineNum"> 1086 </span> : * thrown. The value of the string doesn't change if an error is -<span class="lineNum"> 1087 </span> : * thrown. -<span class="lineNum"> 1088 </span> : */ -<span class="lineNum"> 1089 </span> : basic_string& -<span class="lineNum"> 1090 </span> : insert(size_type __pos, size_type __n, _CharT __c) -<span class="lineNum"> 1091 </span> : { return _M_replace_aux(_M_check(__pos, "basic_string::insert"), -<span class="lineNum"> 1092 </span> : size_type(0), __n, __c); } -<span class="lineNum"> 1093 </span> : -<span class="lineNum"> 1094 </span> : /** -<span class="lineNum"> 1095 </span> : * @brief Insert one character. -<span class="lineNum"> 1096 </span> : * @param p Iterator referencing position in string to insert at. -<span class="lineNum"> 1097 </span> : * @param c The character to insert. -<span class="lineNum"> 1098 </span> : * @return Iterator referencing newly inserted char. -<span class="lineNum"> 1099 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1100 </span> : * -<span class="lineNum"> 1101 </span> : * Inserts character @a c at position referenced by @a p. If adding -<span class="lineNum"> 1102 </span> : * character causes the length to exceed max_size(), length_error is -<span class="lineNum"> 1103 </span> : * thrown. If @a p is beyond end of string, out_of_range is thrown. -<span class="lineNum"> 1104 </span> : * The value of the string doesn't change if an error is thrown. -<span class="lineNum"> 1105 </span> : */ -<span class="lineNum"> 1106 </span> : iterator -<span class="lineNum"> 1107 </span> : insert(iterator __p, _CharT __c) -<span class="lineNum"> 1108 </span> : { -<span class="lineNum"> 1109 </span> : _GLIBCXX_DEBUG_PEDASSERT(__p >= _M_ibegin() && __p <= _M_iend()); -<span class="lineNum"> 1110 </span> : const size_type __pos = __p - _M_ibegin(); -<span class="lineNum"> 1111 </span> : _M_replace_aux(__pos, size_type(0), size_type(1), __c); -<span class="lineNum"> 1112 </span> : _M_rep()->_M_set_leaked(); -<span class="lineNum"> 1113 </span> : return iterator(_M_data() + __pos); -<span class="lineNum"> 1114 </span> : } -<span class="lineNum"> 1115 </span> : -<span class="lineNum"> 1116 </span> : /** -<span class="lineNum"> 1117 </span> : * @brief Remove characters. -<span class="lineNum"> 1118 </span> : * @param pos Index of first character to remove (default 0). -<span class="lineNum"> 1119 </span> : * @param n Number of characters to remove (default remainder). -<span class="lineNum"> 1120 </span> : * @return Reference to this string. -<span class="lineNum"> 1121 </span> : * @throw std::out_of_range If @a pos is beyond the end of this -<span class="lineNum"> 1122 </span> : * string. -<span class="lineNum"> 1123 </span> : * -<span class="lineNum"> 1124 </span> : * Removes @a n characters from this string starting at @a pos. The -<span class="lineNum"> 1125 </span> : * length of the string is reduced by @a n. If there are < @a n -<span class="lineNum"> 1126 </span> : * characters to remove, the remainder of the string is truncated. If -<span class="lineNum"> 1127 </span> : * @a p is beyond end of string, out_of_range is thrown. The value of -<span class="lineNum"> 1128 </span> : * the string doesn't change if an error is thrown. -<span class="lineNum"> 1129 </span> : */ -<span class="lineNum"> 1130 </span> : basic_string& -<span class="lineNum"> 1131 </span> : erase(size_type __pos = 0, size_type __n = npos) -<span class="lineNum"> 1132 </span> : { -<span class="lineNum"> 1133 </span> : _M_mutate(_M_check(__pos, "basic_string::erase"), -<span class="lineNum"> 1134 </span> : _M_limit(__pos, __n), size_type(0)); -<span class="lineNum"> 1135 </span> : return *this; -<span class="lineNum"> 1136 </span> : } -<span class="lineNum"> 1137 </span> : -<span class="lineNum"> 1138 </span> : /** -<span class="lineNum"> 1139 </span> : * @brief Remove one character. -<span class="lineNum"> 1140 </span> : * @param position Iterator referencing the character to remove. -<span class="lineNum"> 1141 </span> : * @return iterator referencing same location after removal. -<span class="lineNum"> 1142 </span> : * -<span class="lineNum"> 1143 </span> : * Removes the character at @a position from this string. The value -<span class="lineNum"> 1144 </span> : * of the string doesn't change if an error is thrown. -<span class="lineNum"> 1145 </span> : */ -<span class="lineNum"> 1146 </span> : iterator -<span class="lineNum"> 1147 </span><span class="lineNoCov"> 0 : erase(iterator __position)</span> -<span class="lineNum"> 1148 </span> : { -<span class="lineNum"> 1149 </span> : _GLIBCXX_DEBUG_PEDASSERT(__position >= _M_ibegin() -<span class="lineNum"> 1150 </span> : && __position < _M_iend()); -<span class="lineNum"> 1151 </span><span class="lineNoCov"> 0 : const size_type __pos = __position - _M_ibegin();</span> -<span class="lineNum"> 1152 </span><span class="lineNoCov"> 0 : _M_mutate(__pos, size_type(1), size_type(0));</span> -<span class="lineNum"> 1153 </span><span class="lineNoCov"> 0 : _M_rep()->_M_set_leaked();</span> -<span class="lineNum"> 1154 </span><span class="lineNoCov"> 0 : return iterator(_M_data() + __pos);</span> -<span class="lineNum"> 1155 </span> : } -<span class="lineNum"> 1156 </span> : -<span class="lineNum"> 1157 </span> : /** -<span class="lineNum"> 1158 </span> : * @brief Remove a range of characters. -<span class="lineNum"> 1159 </span> : * @param first Iterator referencing the first character to remove. -<span class="lineNum"> 1160 </span> : * @param last Iterator referencing the end of the range. -<span class="lineNum"> 1161 </span> : * @return Iterator referencing location of first after removal. -<span class="lineNum"> 1162 </span> : * -<span class="lineNum"> 1163 </span> : * Removes the characters in the range [first,last) from this string. -<span class="lineNum"> 1164 </span> : * The value of the string doesn't change if an error is thrown. -<span class="lineNum"> 1165 </span> : */ -<span class="lineNum"> 1166 </span> : iterator -<span class="lineNum"> 1167 </span> : erase(iterator __first, iterator __last) -<span class="lineNum"> 1168 </span> : { -<span class="lineNum"> 1169 </span> : _GLIBCXX_DEBUG_PEDASSERT(__first >= _M_ibegin() && __first <= __last -<span class="lineNum"> 1170 </span> : && __last <= _M_iend()); -<span class="lineNum"> 1171 </span> : const size_type __pos = __first - _M_ibegin(); -<span class="lineNum"> 1172 </span> : _M_mutate(__pos, __last - __first, size_type(0)); -<span class="lineNum"> 1173 </span> : _M_rep()->_M_set_leaked(); -<span class="lineNum"> 1174 </span> : return iterator(_M_data() + __pos); -<span class="lineNum"> 1175 </span> : } -<span class="lineNum"> 1176 </span> : -<span class="lineNum"> 1177 </span> : /** -<span class="lineNum"> 1178 </span> : * @brief Replace characters with value from another string. -<span class="lineNum"> 1179 </span> : * @param pos Index of first character to replace. -<span class="lineNum"> 1180 </span> : * @param n Number of characters to be replaced. -<span class="lineNum"> 1181 </span> : * @param str String to insert. -<span class="lineNum"> 1182 </span> : * @return Reference to this string. -<span class="lineNum"> 1183 </span> : * @throw std::out_of_range If @a pos is beyond the end of this -<span class="lineNum"> 1184 </span> : * string. -<span class="lineNum"> 1185 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1186 </span> : * -<span class="lineNum"> 1187 </span> : * Removes the characters in the range [pos,pos+n) from this string. -<span class="lineNum"> 1188 </span> : * In place, the value of @a str is inserted. If @a pos is beyond end -<span class="lineNum"> 1189 </span> : * of string, out_of_range is thrown. If the length of the result -<span class="lineNum"> 1190 </span> : * exceeds max_size(), length_error is thrown. The value of the string -<span class="lineNum"> 1191 </span> : * doesn't change if an error is thrown. -<span class="lineNum"> 1192 </span> : */ -<span class="lineNum"> 1193 </span> : basic_string& -<span class="lineNum"> 1194 </span> : replace(size_type __pos, size_type __n, const basic_string& __str) -<span class="lineNum"> 1195 </span> : { return this->replace(__pos, __n, __str._M_data(), __str.size()); } -<span class="lineNum"> 1196 </span> : -<span class="lineNum"> 1197 </span> : /** -<span class="lineNum"> 1198 </span> : * @brief Replace characters with value from another string. -<span class="lineNum"> 1199 </span> : * @param pos1 Index of first character to replace. -<span class="lineNum"> 1200 </span> : * @param n1 Number of characters to be replaced. -<span class="lineNum"> 1201 </span> : * @param str String to insert. -<span class="lineNum"> 1202 </span> : * @param pos2 Index of first character of str to use. -<span class="lineNum"> 1203 </span> : * @param n2 Number of characters from str to use. -<span class="lineNum"> 1204 </span> : * @return Reference to this string. -<span class="lineNum"> 1205 </span> : * @throw std::out_of_range If @a pos1 > size() or @a pos2 > -<span class="lineNum"> 1206 </span> : * str.size(). -<span class="lineNum"> 1207 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1208 </span> : * -<span class="lineNum"> 1209 </span> : * Removes the characters in the range [pos1,pos1 + n) from this -<span class="lineNum"> 1210 </span> : * string. In place, the value of @a str is inserted. If @a pos is -<span class="lineNum"> 1211 </span> : * beyond end of string, out_of_range is thrown. If the length of the -<span class="lineNum"> 1212 </span> : * result exceeds max_size(), length_error is thrown. The value of the -<span class="lineNum"> 1213 </span> : * string doesn't change if an error is thrown. -<span class="lineNum"> 1214 </span> : */ -<span class="lineNum"> 1215 </span> : basic_string& -<span class="lineNum"> 1216 </span> : replace(size_type __pos1, size_type __n1, const basic_string& __str, -<span class="lineNum"> 1217 </span> : size_type __pos2, size_type __n2) -<span class="lineNum"> 1218 </span> : { return this->replace(__pos1, __n1, __str._M_data() -<span class="lineNum"> 1219 </span> : + __str._M_check(__pos2, "basic_string::replace"), -<span class="lineNum"> 1220 </span> : __str._M_limit(__pos2, __n2)); } -<span class="lineNum"> 1221 </span> : -<span class="lineNum"> 1222 </span> : /** -<span class="lineNum"> 1223 </span> : * @brief Replace characters with value of a C substring. -<span class="lineNum"> 1224 </span> : * @param pos Index of first character to replace. -<span class="lineNum"> 1225 </span> : * @param n1 Number of characters to be replaced. -<span class="lineNum"> 1226 </span> : * @param s C string to insert. -<span class="lineNum"> 1227 </span> : * @param n2 Number of characters from @a s to use. -<span class="lineNum"> 1228 </span> : * @return Reference to this string. -<span class="lineNum"> 1229 </span> : * @throw std::out_of_range If @a pos1 > size(). -<span class="lineNum"> 1230 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1231 </span> : * -<span class="lineNum"> 1232 </span> : * Removes the characters in the range [pos,pos + n1) from this string. -<span class="lineNum"> 1233 </span> : * In place, the first @a n2 characters of @a s are inserted, or all -<span class="lineNum"> 1234 </span> : * of @a s if @a n2 is too large. If @a pos is beyond end of string, -<span class="lineNum"> 1235 </span> : * out_of_range is thrown. If the length of result exceeds max_size(), -<span class="lineNum"> 1236 </span> : * length_error is thrown. The value of the string doesn't change if -<span class="lineNum"> 1237 </span> : * an error is thrown. -<span class="lineNum"> 1238 </span> : */ -<span class="lineNum"> 1239 </span> : basic_string& -<span class="lineNum"> 1240 </span> : replace(size_type __pos, size_type __n1, const _CharT* __s, -<span class="lineNum"> 1241 </span> : size_type __n2); -<span class="lineNum"> 1242 </span> : -<span class="lineNum"> 1243 </span> : /** -<span class="lineNum"> 1244 </span> : * @brief Replace characters with value of a C string. -<span class="lineNum"> 1245 </span> : * @param pos Index of first character to replace. -<span class="lineNum"> 1246 </span> : * @param n1 Number of characters to be replaced. -<span class="lineNum"> 1247 </span> : * @param s C string to insert. -<span class="lineNum"> 1248 </span> : * @return Reference to this string. -<span class="lineNum"> 1249 </span> : * @throw std::out_of_range If @a pos > size(). -<span class="lineNum"> 1250 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1251 </span> : * -<span class="lineNum"> 1252 </span> : * Removes the characters in the range [pos,pos + n1) from this string. -<span class="lineNum"> 1253 </span> : * In place, the first @a n characters of @a s are inserted. If @a -<span class="lineNum"> 1254 </span> : * pos is beyond end of string, out_of_range is thrown. If the length -<span class="lineNum"> 1255 </span> : * of result exceeds max_size(), length_error is thrown. The value of -<span class="lineNum"> 1256 </span> : * the string doesn't change if an error is thrown. -<span class="lineNum"> 1257 </span> : */ -<span class="lineNum"> 1258 </span> : basic_string& -<span class="lineNum"> 1259 </span> : replace(size_type __pos, size_type __n1, const _CharT* __s) -<span class="lineNum"> 1260 </span> : { -<span class="lineNum"> 1261 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1262 </span> : return this->replace(__pos, __n1, __s, traits_type::length(__s)); -<span class="lineNum"> 1263 </span> : } -<span class="lineNum"> 1264 </span> : -<span class="lineNum"> 1265 </span> : /** -<span class="lineNum"> 1266 </span> : * @brief Replace characters with multiple characters. -<span class="lineNum"> 1267 </span> : * @param pos Index of first character to replace. -<span class="lineNum"> 1268 </span> : * @param n1 Number of characters to be replaced. -<span class="lineNum"> 1269 </span> : * @param n2 Number of characters to insert. -<span class="lineNum"> 1270 </span> : * @param c Character to insert. -<span class="lineNum"> 1271 </span> : * @return Reference to this string. -<span class="lineNum"> 1272 </span> : * @throw std::out_of_range If @a pos > size(). -<span class="lineNum"> 1273 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1274 </span> : * -<span class="lineNum"> 1275 </span> : * Removes the characters in the range [pos,pos + n1) from this string. -<span class="lineNum"> 1276 </span> : * In place, @a n2 copies of @a c are inserted. If @a pos is beyond -<span class="lineNum"> 1277 </span> : * end of string, out_of_range is thrown. If the length of result -<span class="lineNum"> 1278 </span> : * exceeds max_size(), length_error is thrown. The value of the string -<span class="lineNum"> 1279 </span> : * doesn't change if an error is thrown. -<span class="lineNum"> 1280 </span> : */ -<span class="lineNum"> 1281 </span> : basic_string& -<span class="lineNum"> 1282 </span> : replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) -<span class="lineNum"> 1283 </span> : { return _M_replace_aux(_M_check(__pos, "basic_string::replace"), -<span class="lineNum"> 1284 </span> : _M_limit(__pos, __n1), __n2, __c); } -<span class="lineNum"> 1285 </span> : -<span class="lineNum"> 1286 </span> : /** -<span class="lineNum"> 1287 </span> : * @brief Replace range of characters with string. -<span class="lineNum"> 1288 </span> : * @param i1 Iterator referencing start of range to replace. -<span class="lineNum"> 1289 </span> : * @param i2 Iterator referencing end of range to replace. -<span class="lineNum"> 1290 </span> : * @param str String value to insert. -<span class="lineNum"> 1291 </span> : * @return Reference to this string. -<span class="lineNum"> 1292 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1293 </span> : * -<span class="lineNum"> 1294 </span> : * Removes the characters in the range [i1,i2). In place, the value of -<span class="lineNum"> 1295 </span> : * @a str is inserted. If the length of result exceeds max_size(), -<span class="lineNum"> 1296 </span> : * length_error is thrown. The value of the string doesn't change if -<span class="lineNum"> 1297 </span> : * an error is thrown. -<span class="lineNum"> 1298 </span> : */ -<span class="lineNum"> 1299 </span> : basic_string& -<span class="lineNum"> 1300 </span> : replace(iterator __i1, iterator __i2, const basic_string& __str) -<span class="lineNum"> 1301 </span> : { return this->replace(__i1, __i2, __str._M_data(), __str.size()); } -<span class="lineNum"> 1302 </span> : -<span class="lineNum"> 1303 </span> : /** -<span class="lineNum"> 1304 </span> : * @brief Replace range of characters with C substring. -<span class="lineNum"> 1305 </span> : * @param i1 Iterator referencing start of range to replace. -<span class="lineNum"> 1306 </span> : * @param i2 Iterator referencing end of range to replace. -<span class="lineNum"> 1307 </span> : * @param s C string value to insert. -<span class="lineNum"> 1308 </span> : * @param n Number of characters from s to insert. -<span class="lineNum"> 1309 </span> : * @return Reference to this string. -<span class="lineNum"> 1310 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1311 </span> : * -<span class="lineNum"> 1312 </span> : * Removes the characters in the range [i1,i2). In place, the first @a -<span class="lineNum"> 1313 </span> : * n characters of @a s are inserted. If the length of result exceeds -<span class="lineNum"> 1314 </span> : * max_size(), length_error is thrown. The value of the string doesn't -<span class="lineNum"> 1315 </span> : * change if an error is thrown. -<span class="lineNum"> 1316 </span> : */ -<span class="lineNum"> 1317 </span> : basic_string& -<span class="lineNum"> 1318 </span> : replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) -<span class="lineNum"> 1319 </span> : { -<span class="lineNum"> 1320 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1321 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1322 </span> : return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n); -<span class="lineNum"> 1323 </span> : } -<span class="lineNum"> 1324 </span> : -<span class="lineNum"> 1325 </span> : /** -<span class="lineNum"> 1326 </span> : * @brief Replace range of characters with C string. -<span class="lineNum"> 1327 </span> : * @param i1 Iterator referencing start of range to replace. -<span class="lineNum"> 1328 </span> : * @param i2 Iterator referencing end of range to replace. -<span class="lineNum"> 1329 </span> : * @param s C string value to insert. -<span class="lineNum"> 1330 </span> : * @return Reference to this string. -<span class="lineNum"> 1331 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1332 </span> : * -<span class="lineNum"> 1333 </span> : * Removes the characters in the range [i1,i2). In place, the -<span class="lineNum"> 1334 </span> : * characters of @a s are inserted. If the length of result exceeds -<span class="lineNum"> 1335 </span> : * max_size(), length_error is thrown. The value of the string doesn't -<span class="lineNum"> 1336 </span> : * change if an error is thrown. -<span class="lineNum"> 1337 </span> : */ -<span class="lineNum"> 1338 </span> : basic_string& -<span class="lineNum"> 1339 </span> : replace(iterator __i1, iterator __i2, const _CharT* __s) -<span class="lineNum"> 1340 </span> : { -<span class="lineNum"> 1341 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1342 </span> : return this->replace(__i1, __i2, __s, traits_type::length(__s)); -<span class="lineNum"> 1343 </span> : } -<span class="lineNum"> 1344 </span> : -<span class="lineNum"> 1345 </span> : /** -<span class="lineNum"> 1346 </span> : * @brief Replace range of characters with multiple characters -<span class="lineNum"> 1347 </span> : * @param i1 Iterator referencing start of range to replace. -<span class="lineNum"> 1348 </span> : * @param i2 Iterator referencing end of range to replace. -<span class="lineNum"> 1349 </span> : * @param n Number of characters to insert. -<span class="lineNum"> 1350 </span> : * @param c Character to insert. -<span class="lineNum"> 1351 </span> : * @return Reference to this string. -<span class="lineNum"> 1352 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1353 </span> : * -<span class="lineNum"> 1354 </span> : * Removes the characters in the range [i1,i2). In place, @a n copies -<span class="lineNum"> 1355 </span> : * of @a c are inserted. If the length of result exceeds max_size(), -<span class="lineNum"> 1356 </span> : * length_error is thrown. The value of the string doesn't change if -<span class="lineNum"> 1357 </span> : * an error is thrown. -<span class="lineNum"> 1358 </span> : */ -<span class="lineNum"> 1359 </span> : basic_string& -<span class="lineNum"> 1360 </span> : replace(iterator __i1, iterator __i2, size_type __n, _CharT __c) -<span class="lineNum"> 1361 </span> : { -<span class="lineNum"> 1362 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1363 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1364 </span> : return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c); -<span class="lineNum"> 1365 </span> : } -<span class="lineNum"> 1366 </span> : -<span class="lineNum"> 1367 </span> : /** -<span class="lineNum"> 1368 </span> : * @brief Replace range of characters with range. -<span class="lineNum"> 1369 </span> : * @param i1 Iterator referencing start of range to replace. -<span class="lineNum"> 1370 </span> : * @param i2 Iterator referencing end of range to replace. -<span class="lineNum"> 1371 </span> : * @param k1 Iterator referencing start of range to insert. -<span class="lineNum"> 1372 </span> : * @param k2 Iterator referencing end of range to insert. -<span class="lineNum"> 1373 </span> : * @return Reference to this string. -<span class="lineNum"> 1374 </span> : * @throw std::length_error If new length exceeds @c max_size(). -<span class="lineNum"> 1375 </span> : * -<span class="lineNum"> 1376 </span> : * Removes the characters in the range [i1,i2). In place, characters -<span class="lineNum"> 1377 </span> : * in the range [k1,k2) are inserted. If the length of result exceeds -<span class="lineNum"> 1378 </span> : * max_size(), length_error is thrown. The value of the string doesn't -<span class="lineNum"> 1379 </span> : * change if an error is thrown. -<span class="lineNum"> 1380 </span> : */ -<span class="lineNum"> 1381 </span> : template<class _InputIterator> -<span class="lineNum"> 1382 </span> : basic_string& -<span class="lineNum"> 1383 </span> : replace(iterator __i1, iterator __i2, -<span class="lineNum"> 1384 </span> : _InputIterator __k1, _InputIterator __k2) -<span class="lineNum"> 1385 </span> : { -<span class="lineNum"> 1386 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1387 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1388 </span> : __glibcxx_requires_valid_range(__k1, __k2); -<span class="lineNum"> 1389 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 1390 </span> : return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral()); -<span class="lineNum"> 1391 </span> : } -<span class="lineNum"> 1392 </span> : -<span class="lineNum"> 1393 </span> : // Specializations for the common case of pointer and iterator: -<span class="lineNum"> 1394 </span> : // useful to avoid the overhead of temporary buffering in _M_replace. -<span class="lineNum"> 1395 </span> : basic_string& -<span class="lineNum"> 1396 </span> : replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) -<span class="lineNum"> 1397 </span> : { -<span class="lineNum"> 1398 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1399 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1400 </span> : __glibcxx_requires_valid_range(__k1, __k2); -<span class="lineNum"> 1401 </span> : return this->replace(__i1 - _M_ibegin(), __i2 - __i1, -<span class="lineNum"> 1402 </span> : __k1, __k2 - __k1); -<span class="lineNum"> 1403 </span> : } -<span class="lineNum"> 1404 </span> : -<span class="lineNum"> 1405 </span> : basic_string& -<span class="lineNum"> 1406 </span> : replace(iterator __i1, iterator __i2, -<span class="lineNum"> 1407 </span> : const _CharT* __k1, const _CharT* __k2) -<span class="lineNum"> 1408 </span> : { -<span class="lineNum"> 1409 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1410 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1411 </span> : __glibcxx_requires_valid_range(__k1, __k2); -<span class="lineNum"> 1412 </span> : return this->replace(__i1 - _M_ibegin(), __i2 - __i1, -<span class="lineNum"> 1413 </span> : __k1, __k2 - __k1); -<span class="lineNum"> 1414 </span> : } -<span class="lineNum"> 1415 </span> : -<span class="lineNum"> 1416 </span> : basic_string& -<span class="lineNum"> 1417 </span> : replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2) -<span class="lineNum"> 1418 </span> : { -<span class="lineNum"> 1419 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1420 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1421 </span> : __glibcxx_requires_valid_range(__k1, __k2); -<span class="lineNum"> 1422 </span> : return this->replace(__i1 - _M_ibegin(), __i2 - __i1, -<span class="lineNum"> 1423 </span> : __k1.base(), __k2 - __k1); -<span class="lineNum"> 1424 </span> : } -<span class="lineNum"> 1425 </span> : -<span class="lineNum"> 1426 </span> : basic_string& -<span class="lineNum"> 1427 </span> : replace(iterator __i1, iterator __i2, -<span class="lineNum"> 1428 </span> : const_iterator __k1, const_iterator __k2) -<span class="lineNum"> 1429 </span> : { -<span class="lineNum"> 1430 </span> : _GLIBCXX_DEBUG_PEDASSERT(_M_ibegin() <= __i1 && __i1 <= __i2 -<span class="lineNum"> 1431 </span> : && __i2 <= _M_iend()); -<span class="lineNum"> 1432 </span> : __glibcxx_requires_valid_range(__k1, __k2); -<span class="lineNum"> 1433 </span> : return this->replace(__i1 - _M_ibegin(), __i2 - __i1, -<span class="lineNum"> 1434 </span> : __k1.base(), __k2 - __k1); -<span class="lineNum"> 1435 </span> : } -<span class="lineNum"> 1436 </span> : -<span class="lineNum"> 1437 </span> : private: -<span class="lineNum"> 1438 </span> : template<class _Integer> -<span class="lineNum"> 1439 </span> : basic_string& -<span class="lineNum"> 1440 </span> : _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n, -<span class="lineNum"> 1441 </span> : _Integer __val, __true_type) -<span class="lineNum"> 1442 </span> : { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); } -<span class="lineNum"> 1443 </span> : -<span class="lineNum"> 1444 </span> : template<class _InputIterator> -<span class="lineNum"> 1445 </span> : basic_string& -<span class="lineNum"> 1446 </span> : _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, -<span class="lineNum"> 1447 </span> : _InputIterator __k2, __false_type); -<span class="lineNum"> 1448 </span> : -<span class="lineNum"> 1449 </span> : basic_string& -<span class="lineNum"> 1450 </span> : _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, -<span class="lineNum"> 1451 </span> : _CharT __c); -<span class="lineNum"> 1452 </span> : -<span class="lineNum"> 1453 </span> : basic_string& -<span class="lineNum"> 1454 </span> : _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, -<span class="lineNum"> 1455 </span> : size_type __n2); -<span class="lineNum"> 1456 </span> : -<span class="lineNum"> 1457 </span> : // _S_construct_aux is used to implement the 21.3.1 para 15 which -<span class="lineNum"> 1458 </span> : // requires special behaviour if _InIter is an integral type -<span class="lineNum"> 1459 </span> : template<class _InIterator> -<span class="lineNum"> 1460 </span> : static _CharT* -<span class="lineNum"> 1461 </span> : _S_construct_aux(_InIterator __beg, _InIterator __end, -<span class="lineNum"> 1462 </span><span class="lineCov"> 1287 : const _Alloc& __a, __false_type)</span> -<span class="lineNum"> 1463 </span> : { -<span class="lineNum"> 1464 </span> : typedef typename iterator_traits<_InIterator>::iterator_category _Tag; -<span class="lineNum"> 1465 </span><span class="lineCov"> 1287 : return _S_construct(__beg, __end, __a, _Tag());</span> -<span class="lineNum"> 1466 </span> : } -<span class="lineNum"> 1467 </span> : -<span class="lineNum"> 1468 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1469 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1470 </span> : template<class _Integer> -<span class="lineNum"> 1471 </span> : static _CharT* -<span class="lineNum"> 1472 </span> : _S_construct_aux(_Integer __beg, _Integer __end, -<span class="lineNum"> 1473 </span> : const _Alloc& __a, __true_type) -<span class="lineNum"> 1474 </span> : { return _S_construct(static_cast<size_type>(__beg), __end, __a); } -<span class="lineNum"> 1475 </span> : -<span class="lineNum"> 1476 </span> : template<class _InIterator> -<span class="lineNum"> 1477 </span> : static _CharT* -<span class="lineNum"> 1478 </span><span class="lineCov"> 1287 : _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a)</span> -<span class="lineNum"> 1479 </span> : { -<span class="lineNum"> 1480 </span> : typedef typename std::__is_integer<_InIterator>::__type _Integral; -<span class="lineNum"> 1481 </span><span class="lineCov"> 1287 : return _S_construct_aux(__beg, __end, __a, _Integral());</span> -<span class="lineNum"> 1482 </span> : } -<span class="lineNum"> 1483 </span> : -<span class="lineNum"> 1484 </span> : // For Input Iterators, used in istreambuf_iterators, etc. -<span class="lineNum"> 1485 </span> : template<class _InIterator> -<span class="lineNum"> 1486 </span> : static _CharT* -<span class="lineNum"> 1487 </span> : _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, -<span class="lineNum"> 1488 </span> : input_iterator_tag); -<span class="lineNum"> 1489 </span> : -<span class="lineNum"> 1490 </span> : // For forward_iterators up to random_access_iterators, used for -<span class="lineNum"> 1491 </span> : // string::iterator, _CharT*, etc. -<span class="lineNum"> 1492 </span> : template<class _FwdIterator> -<span class="lineNum"> 1493 </span> : static _CharT* -<span class="lineNum"> 1494 </span> : _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, -<span class="lineNum"> 1495 </span> : forward_iterator_tag); -<span class="lineNum"> 1496 </span> : -<span class="lineNum"> 1497 </span> : static _CharT* -<span class="lineNum"> 1498 </span> : _S_construct(size_type __req, _CharT __c, const _Alloc& __a); -<span class="lineNum"> 1499 </span> : -<span class="lineNum"> 1500 </span> : public: -<span class="lineNum"> 1501 </span> : -<span class="lineNum"> 1502 </span> : /** -<span class="lineNum"> 1503 </span> : * @brief Copy substring into C string. -<span class="lineNum"> 1504 </span> : * @param s C string to copy value into. -<span class="lineNum"> 1505 </span> : * @param n Number of characters to copy. -<span class="lineNum"> 1506 </span> : * @param pos Index of first character to copy. -<span class="lineNum"> 1507 </span> : * @return Number of characters actually copied -<span class="lineNum"> 1508 </span> : * @throw std::out_of_range If pos > size(). -<span class="lineNum"> 1509 </span> : * -<span class="lineNum"> 1510 </span> : * Copies up to @a n characters starting at @a pos into the C string @a -<span class="lineNum"> 1511 </span> : * s. If @a pos is greater than size(), out_of_range is thrown. -<span class="lineNum"> 1512 </span> : */ -<span class="lineNum"> 1513 </span> : size_type -<span class="lineNum"> 1514 </span> : copy(_CharT* __s, size_type __n, size_type __pos = 0) const; -<span class="lineNum"> 1515 </span> : -<span class="lineNum"> 1516 </span> : /** -<span class="lineNum"> 1517 </span> : * @brief Swap contents with another string. -<span class="lineNum"> 1518 </span> : * @param s String to swap with. -<span class="lineNum"> 1519 </span> : * -<span class="lineNum"> 1520 </span> : * Exchanges the contents of this string with that of @a s in constant -<span class="lineNum"> 1521 </span> : * time. -<span class="lineNum"> 1522 </span> : */ -<span class="lineNum"> 1523 </span> : void -<span class="lineNum"> 1524 </span> : swap(basic_string& __s); -<span class="lineNum"> 1525 </span> : -<span class="lineNum"> 1526 </span> : // String operations: -<span class="lineNum"> 1527 </span> : /** -<span class="lineNum"> 1528 </span> : * @brief Return const pointer to null-terminated contents. -<span class="lineNum"> 1529 </span> : * -<span class="lineNum"> 1530 </span> : * This is a handle to internal data. Do not modify or dire things may -<span class="lineNum"> 1531 </span> : * happen. -<span class="lineNum"> 1532 </span> : */ -<span class="lineNum"> 1533 </span> : const _CharT* -<span class="lineNum"> 1534 </span><span class="lineNoCov"> 0 : c_str() const</span> -<span class="lineNum"> 1535 </span><span class="lineNoCov"> 0 : { return _M_data(); }</span> -<span class="lineNum"> 1536 </span> : -<span class="lineNum"> 1537 </span> : /** -<span class="lineNum"> 1538 </span> : * @brief Return const pointer to contents. -<span class="lineNum"> 1539 </span> : * -<span class="lineNum"> 1540 </span> : * This is a handle to internal data. Do not modify or dire things may -<span class="lineNum"> 1541 </span> : * happen. -<span class="lineNum"> 1542 </span> : */ -<span class="lineNum"> 1543 </span> : const _CharT* -<span class="lineNum"> 1544 </span><span class="lineNoCov"> 0 : data() const</span> -<span class="lineNum"> 1545 </span><span class="lineNoCov"> 0 : { return _M_data(); }</span> -<span class="lineNum"> 1546 </span> : -<span class="lineNum"> 1547 </span> : /** -<span class="lineNum"> 1548 </span> : * @brief Return copy of allocator used to construct this string. -<span class="lineNum"> 1549 </span> : */ -<span class="lineNum"> 1550 </span> : allocator_type -<span class="lineNum"> 1551 </span><span class="lineNoCov"> 0 : get_allocator() const</span> -<span class="lineNum"> 1552 </span><span class="lineNoCov"> 0 : { return _M_dataplus; }</span> -<span class="lineNum"> 1553 </span> : -<span class="lineNum"> 1554 </span> : /** -<span class="lineNum"> 1555 </span> : * @brief Find position of a C substring. -<span class="lineNum"> 1556 </span> : * @param s C string to locate. -<span class="lineNum"> 1557 </span> : * @param pos Index of character to search from. -<span class="lineNum"> 1558 </span> : * @param n Number of characters from @a s to search for. -<span class="lineNum"> 1559 </span> : * @return Index of start of first occurrence. -<span class="lineNum"> 1560 </span> : * -<span class="lineNum"> 1561 </span> : * Starting from @a pos, searches forward for the first @a n characters -<span class="lineNum"> 1562 </span> : * in @a s within this string. If found, returns the index where it -<span class="lineNum"> 1563 </span> : * begins. If not found, returns npos. -<span class="lineNum"> 1564 </span> : */ -<span class="lineNum"> 1565 </span> : size_type -<span class="lineNum"> 1566 </span> : find(const _CharT* __s, size_type __pos, size_type __n) const; -<span class="lineNum"> 1567 </span> : -<span class="lineNum"> 1568 </span> : /** -<span class="lineNum"> 1569 </span> : * @brief Find position of a string. -<span class="lineNum"> 1570 </span> : * @param str String to locate. -<span class="lineNum"> 1571 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1572 </span> : * @return Index of start of first occurrence. -<span class="lineNum"> 1573 </span> : * -<span class="lineNum"> 1574 </span> : * Starting from @a pos, searches forward for value of @a str within -<span class="lineNum"> 1575 </span> : * this string. If found, returns the index where it begins. If not -<span class="lineNum"> 1576 </span> : * found, returns npos. -<span class="lineNum"> 1577 </span> : */ -<span class="lineNum"> 1578 </span> : size_type -<span class="lineNum"> 1579 </span><span class="lineNoCov"> 0 : find(const basic_string& __str, size_type __pos = 0) const</span> -<span class="lineNum"> 1580 </span><span class="lineNoCov"> 0 : { return this->find(__str.data(), __pos, __str.size()); }</span> -<span class="lineNum"> 1581 </span> : -<span class="lineNum"> 1582 </span> : /** -<span class="lineNum"> 1583 </span> : * @brief Find position of a C string. -<span class="lineNum"> 1584 </span> : * @param s C string to locate. -<span class="lineNum"> 1585 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1586 </span> : * @return Index of start of first occurrence. -<span class="lineNum"> 1587 </span> : * -<span class="lineNum"> 1588 </span> : * Starting from @a pos, searches forward for the value of @a s within -<span class="lineNum"> 1589 </span> : * this string. If found, returns the index where it begins. If not -<span class="lineNum"> 1590 </span> : * found, returns npos. -<span class="lineNum"> 1591 </span> : */ -<span class="lineNum"> 1592 </span> : size_type -<span class="lineNum"> 1593 </span><span class="lineNoCov"> 0 : find(const _CharT* __s, size_type __pos = 0) const</span> -<span class="lineNum"> 1594 </span> : { -<span class="lineNum"> 1595 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1596 </span><span class="lineNoCov"> 0 : return this->find(__s, __pos, traits_type::length(__s));</span> -<span class="lineNum"> 1597 </span> : } -<span class="lineNum"> 1598 </span> : -<span class="lineNum"> 1599 </span> : /** -<span class="lineNum"> 1600 </span> : * @brief Find position of a character. -<span class="lineNum"> 1601 </span> : * @param c Character to locate. -<span class="lineNum"> 1602 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1603 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1604 </span> : * -<span class="lineNum"> 1605 </span> : * Starting from @a pos, searches forward for @a c within this string. -<span class="lineNum"> 1606 </span> : * If found, returns the index where it was found. If not found, -<span class="lineNum"> 1607 </span> : * returns npos. -<span class="lineNum"> 1608 </span> : */ -<span class="lineNum"> 1609 </span> : size_type -<span class="lineNum"> 1610 </span> : find(_CharT __c, size_type __pos = 0) const; -<span class="lineNum"> 1611 </span> : -<span class="lineNum"> 1612 </span> : /** -<span class="lineNum"> 1613 </span> : * @brief Find last position of a string. -<span class="lineNum"> 1614 </span> : * @param str String to locate. -<span class="lineNum"> 1615 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1616 </span> : * @return Index of start of last occurrence. -<span class="lineNum"> 1617 </span> : * -<span class="lineNum"> 1618 </span> : * Starting from @a pos, searches backward for value of @a str within -<span class="lineNum"> 1619 </span> : * this string. If found, returns the index where it begins. If not -<span class="lineNum"> 1620 </span> : * found, returns npos. -<span class="lineNum"> 1621 </span> : */ -<span class="lineNum"> 1622 </span> : size_type -<span class="lineNum"> 1623 </span> : rfind(const basic_string& __str, size_type __pos = npos) const -<span class="lineNum"> 1624 </span> : { return this->rfind(__str.data(), __pos, __str.size()); } -<span class="lineNum"> 1625 </span> : -<span class="lineNum"> 1626 </span> : /** -<span class="lineNum"> 1627 </span> : * @brief Find last position of a C substring. -<span class="lineNum"> 1628 </span> : * @param s C string to locate. -<span class="lineNum"> 1629 </span> : * @param pos Index of character to search back from. -<span class="lineNum"> 1630 </span> : * @param n Number of characters from s to search for. -<span class="lineNum"> 1631 </span> : * @return Index of start of last occurrence. -<span class="lineNum"> 1632 </span> : * -<span class="lineNum"> 1633 </span> : * Starting from @a pos, searches backward for the first @a n -<span class="lineNum"> 1634 </span> : * characters in @a s within this string. If found, returns the index -<span class="lineNum"> 1635 </span> : * where it begins. If not found, returns npos. -<span class="lineNum"> 1636 </span> : */ -<span class="lineNum"> 1637 </span> : size_type -<span class="lineNum"> 1638 </span> : rfind(const _CharT* __s, size_type __pos, size_type __n) const; -<span class="lineNum"> 1639 </span> : -<span class="lineNum"> 1640 </span> : /** -<span class="lineNum"> 1641 </span> : * @brief Find last position of a C string. -<span class="lineNum"> 1642 </span> : * @param s C string to locate. -<span class="lineNum"> 1643 </span> : * @param pos Index of character to start search at (default end). -<span class="lineNum"> 1644 </span> : * @return Index of start of last occurrence. -<span class="lineNum"> 1645 </span> : * -<span class="lineNum"> 1646 </span> : * Starting from @a pos, searches backward for the value of @a s within -<span class="lineNum"> 1647 </span> : * this string. If found, returns the index where it begins. If not -<span class="lineNum"> 1648 </span> : * found, returns npos. -<span class="lineNum"> 1649 </span> : */ -<span class="lineNum"> 1650 </span> : size_type -<span class="lineNum"> 1651 </span><span class="lineNoCov"> 0 : rfind(const _CharT* __s, size_type __pos = npos) const</span> -<span class="lineNum"> 1652 </span> : { -<span class="lineNum"> 1653 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1654 </span><span class="lineNoCov"> 0 : return this->rfind(__s, __pos, traits_type::length(__s));</span> -<span class="lineNum"> 1655 </span> : } -<span class="lineNum"> 1656 </span> : -<span class="lineNum"> 1657 </span> : /** -<span class="lineNum"> 1658 </span> : * @brief Find last position of a character. -<span class="lineNum"> 1659 </span> : * @param c Character to locate. -<span class="lineNum"> 1660 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1661 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1662 </span> : * -<span class="lineNum"> 1663 </span> : * Starting from @a pos, searches backward for @a c within this string. -<span class="lineNum"> 1664 </span> : * If found, returns the index where it was found. If not found, -<span class="lineNum"> 1665 </span> : * returns npos. -<span class="lineNum"> 1666 </span> : */ -<span class="lineNum"> 1667 </span> : size_type -<span class="lineNum"> 1668 </span> : rfind(_CharT __c, size_type __pos = npos) const; -<span class="lineNum"> 1669 </span> : -<span class="lineNum"> 1670 </span> : /** -<span class="lineNum"> 1671 </span> : * @brief Find position of a character of string. -<span class="lineNum"> 1672 </span> : * @param str String containing characters to locate. -<span class="lineNum"> 1673 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1674 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1675 </span> : * -<span class="lineNum"> 1676 </span> : * Starting from @a pos, searches forward for one of the characters of -<span class="lineNum"> 1677 </span> : * @a str within this string. If found, returns the index where it was -<span class="lineNum"> 1678 </span> : * found. If not found, returns npos. -<span class="lineNum"> 1679 </span> : */ -<span class="lineNum"> 1680 </span> : size_type -<span class="lineNum"> 1681 </span> : find_first_of(const basic_string& __str, size_type __pos = 0) const -<span class="lineNum"> 1682 </span> : { return this->find_first_of(__str.data(), __pos, __str.size()); } -<span class="lineNum"> 1683 </span> : -<span class="lineNum"> 1684 </span> : /** -<span class="lineNum"> 1685 </span> : * @brief Find position of a character of C substring. -<span class="lineNum"> 1686 </span> : * @param s String containing characters to locate. -<span class="lineNum"> 1687 </span> : * @param pos Index of character to search from. -<span class="lineNum"> 1688 </span> : * @param n Number of characters from s to search for. -<span class="lineNum"> 1689 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1690 </span> : * -<span class="lineNum"> 1691 </span> : * Starting from @a pos, searches forward for one of the first @a n -<span class="lineNum"> 1692 </span> : * characters of @a s within this string. If found, returns the index -<span class="lineNum"> 1693 </span> : * where it was found. If not found, returns npos. -<span class="lineNum"> 1694 </span> : */ -<span class="lineNum"> 1695 </span> : size_type -<span class="lineNum"> 1696 </span> : find_first_of(const _CharT* __s, size_type __pos, size_type __n) const; -<span class="lineNum"> 1697 </span> : -<span class="lineNum"> 1698 </span> : /** -<span class="lineNum"> 1699 </span> : * @brief Find position of a character of C string. -<span class="lineNum"> 1700 </span> : * @param s String containing characters to locate. -<span class="lineNum"> 1701 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1702 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1703 </span> : * -<span class="lineNum"> 1704 </span> : * Starting from @a pos, searches forward for one of the characters of -<span class="lineNum"> 1705 </span> : * @a s within this string. If found, returns the index where it was -<span class="lineNum"> 1706 </span> : * found. If not found, returns npos. -<span class="lineNum"> 1707 </span> : */ -<span class="lineNum"> 1708 </span> : size_type -<span class="lineNum"> 1709 </span> : find_first_of(const _CharT* __s, size_type __pos = 0) const -<span class="lineNum"> 1710 </span> : { -<span class="lineNum"> 1711 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1712 </span> : return this->find_first_of(__s, __pos, traits_type::length(__s)); -<span class="lineNum"> 1713 </span> : } -<span class="lineNum"> 1714 </span> : -<span class="lineNum"> 1715 </span> : /** -<span class="lineNum"> 1716 </span> : * @brief Find position of a character. -<span class="lineNum"> 1717 </span> : * @param c Character to locate. -<span class="lineNum"> 1718 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1719 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1720 </span> : * -<span class="lineNum"> 1721 </span> : * Starting from @a pos, searches forward for the character @a c within -<span class="lineNum"> 1722 </span> : * this string. If found, returns the index where it was found. If -<span class="lineNum"> 1723 </span> : * not found, returns npos. -<span class="lineNum"> 1724 </span> : * -<span class="lineNum"> 1725 </span> : * Note: equivalent to find(c, pos). -<span class="lineNum"> 1726 </span> : */ -<span class="lineNum"> 1727 </span> : size_type -<span class="lineNum"> 1728 </span> : find_first_of(_CharT __c, size_type __pos = 0) const -<span class="lineNum"> 1729 </span> : { return this->find(__c, __pos); } -<span class="lineNum"> 1730 </span> : -<span class="lineNum"> 1731 </span> : /** -<span class="lineNum"> 1732 </span> : * @brief Find last position of a character of string. -<span class="lineNum"> 1733 </span> : * @param str String containing characters to locate. -<span class="lineNum"> 1734 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1735 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1736 </span> : * -<span class="lineNum"> 1737 </span> : * Starting from @a pos, searches backward for one of the characters of -<span class="lineNum"> 1738 </span> : * @a str within this string. If found, returns the index where it was -<span class="lineNum"> 1739 </span> : * found. If not found, returns npos. -<span class="lineNum"> 1740 </span> : */ -<span class="lineNum"> 1741 </span> : size_type -<span class="lineNum"> 1742 </span> : find_last_of(const basic_string& __str, size_type __pos = npos) const -<span class="lineNum"> 1743 </span> : { return this->find_last_of(__str.data(), __pos, __str.size()); } -<span class="lineNum"> 1744 </span> : -<span class="lineNum"> 1745 </span> : /** -<span class="lineNum"> 1746 </span> : * @brief Find last position of a character of C substring. -<span class="lineNum"> 1747 </span> : * @param s C string containing characters to locate. -<span class="lineNum"> 1748 </span> : * @param pos Index of character to search back from. -<span class="lineNum"> 1749 </span> : * @param n Number of characters from s to search for. -<span class="lineNum"> 1750 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1751 </span> : * -<span class="lineNum"> 1752 </span> : * Starting from @a pos, searches backward for one of the first @a n -<span class="lineNum"> 1753 </span> : * characters of @a s within this string. If found, returns the index -<span class="lineNum"> 1754 </span> : * where it was found. If not found, returns npos. -<span class="lineNum"> 1755 </span> : */ -<span class="lineNum"> 1756 </span> : size_type -<span class="lineNum"> 1757 </span> : find_last_of(const _CharT* __s, size_type __pos, size_type __n) const; -<span class="lineNum"> 1758 </span> : -<span class="lineNum"> 1759 </span> : /** -<span class="lineNum"> 1760 </span> : * @brief Find last position of a character of C string. -<span class="lineNum"> 1761 </span> : * @param s C string containing characters to locate. -<span class="lineNum"> 1762 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1763 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1764 </span> : * -<span class="lineNum"> 1765 </span> : * Starting from @a pos, searches backward for one of the characters of -<span class="lineNum"> 1766 </span> : * @a s within this string. If found, returns the index where it was -<span class="lineNum"> 1767 </span> : * found. If not found, returns npos. -<span class="lineNum"> 1768 </span> : */ -<span class="lineNum"> 1769 </span> : size_type -<span class="lineNum"> 1770 </span> : find_last_of(const _CharT* __s, size_type __pos = npos) const -<span class="lineNum"> 1771 </span> : { -<span class="lineNum"> 1772 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1773 </span> : return this->find_last_of(__s, __pos, traits_type::length(__s)); -<span class="lineNum"> 1774 </span> : } -<span class="lineNum"> 1775 </span> : -<span class="lineNum"> 1776 </span> : /** -<span class="lineNum"> 1777 </span> : * @brief Find last position of a character. -<span class="lineNum"> 1778 </span> : * @param c Character to locate. -<span class="lineNum"> 1779 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1780 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1781 </span> : * -<span class="lineNum"> 1782 </span> : * Starting from @a pos, searches backward for @a c within this string. -<span class="lineNum"> 1783 </span> : * If found, returns the index where it was found. If not found, -<span class="lineNum"> 1784 </span> : * returns npos. -<span class="lineNum"> 1785 </span> : * -<span class="lineNum"> 1786 </span> : * Note: equivalent to rfind(c, pos). -<span class="lineNum"> 1787 </span> : */ -<span class="lineNum"> 1788 </span> : size_type -<span class="lineNum"> 1789 </span> : find_last_of(_CharT __c, size_type __pos = npos) const -<span class="lineNum"> 1790 </span> : { return this->rfind(__c, __pos); } -<span class="lineNum"> 1791 </span> : -<span class="lineNum"> 1792 </span> : /** -<span class="lineNum"> 1793 </span> : * @brief Find position of a character not in string. -<span class="lineNum"> 1794 </span> : * @param str String containing characters to avoid. -<span class="lineNum"> 1795 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1796 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1797 </span> : * -<span class="lineNum"> 1798 </span> : * Starting from @a pos, searches forward for a character not contained -<span class="lineNum"> 1799 </span> : * in @a str within this string. If found, returns the index where it -<span class="lineNum"> 1800 </span> : * was found. If not found, returns npos. -<span class="lineNum"> 1801 </span> : */ -<span class="lineNum"> 1802 </span> : size_type -<span class="lineNum"> 1803 </span> : find_first_not_of(const basic_string& __str, size_type __pos = 0) const -<span class="lineNum"> 1804 </span> : { return this->find_first_not_of(__str.data(), __pos, __str.size()); } -<span class="lineNum"> 1805 </span> : -<span class="lineNum"> 1806 </span> : /** -<span class="lineNum"> 1807 </span> : * @brief Find position of a character not in C substring. -<span class="lineNum"> 1808 </span> : * @param s C string containing characters to avoid. -<span class="lineNum"> 1809 </span> : * @param pos Index of character to search from. -<span class="lineNum"> 1810 </span> : * @param n Number of characters from s to consider. -<span class="lineNum"> 1811 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1812 </span> : * -<span class="lineNum"> 1813 </span> : * Starting from @a pos, searches forward for a character not contained -<span class="lineNum"> 1814 </span> : * in the first @a n characters of @a s within this string. If found, -<span class="lineNum"> 1815 </span> : * returns the index where it was found. If not found, returns npos. -<span class="lineNum"> 1816 </span> : */ -<span class="lineNum"> 1817 </span> : size_type -<span class="lineNum"> 1818 </span> : find_first_not_of(const _CharT* __s, size_type __pos, -<span class="lineNum"> 1819 </span> : size_type __n) const; -<span class="lineNum"> 1820 </span> : -<span class="lineNum"> 1821 </span> : /** -<span class="lineNum"> 1822 </span> : * @brief Find position of a character not in C string. -<span class="lineNum"> 1823 </span> : * @param s C string containing characters to avoid. -<span class="lineNum"> 1824 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1825 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1826 </span> : * -<span class="lineNum"> 1827 </span> : * Starting from @a pos, searches forward for a character not contained -<span class="lineNum"> 1828 </span> : * in @a s within this string. If found, returns the index where it -<span class="lineNum"> 1829 </span> : * was found. If not found, returns npos. -<span class="lineNum"> 1830 </span> : */ -<span class="lineNum"> 1831 </span> : size_type -<span class="lineNum"> 1832 </span> : find_first_not_of(const _CharT* __s, size_type __pos = 0) const -<span class="lineNum"> 1833 </span> : { -<span class="lineNum"> 1834 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1835 </span> : return this->find_first_not_of(__s, __pos, traits_type::length(__s)); -<span class="lineNum"> 1836 </span> : } -<span class="lineNum"> 1837 </span> : -<span class="lineNum"> 1838 </span> : /** -<span class="lineNum"> 1839 </span> : * @brief Find position of a different character. -<span class="lineNum"> 1840 </span> : * @param c Character to avoid. -<span class="lineNum"> 1841 </span> : * @param pos Index of character to search from (default 0). -<span class="lineNum"> 1842 </span> : * @return Index of first occurrence. -<span class="lineNum"> 1843 </span> : * -<span class="lineNum"> 1844 </span> : * Starting from @a pos, searches forward for a character other than @a c -<span class="lineNum"> 1845 </span> : * within this string. If found, returns the index where it was found. -<span class="lineNum"> 1846 </span> : * If not found, returns npos. -<span class="lineNum"> 1847 </span> : */ -<span class="lineNum"> 1848 </span> : size_type -<span class="lineNum"> 1849 </span> : find_first_not_of(_CharT __c, size_type __pos = 0) const; -<span class="lineNum"> 1850 </span> : -<span class="lineNum"> 1851 </span> : /** -<span class="lineNum"> 1852 </span> : * @brief Find last position of a character not in string. -<span class="lineNum"> 1853 </span> : * @param str String containing characters to avoid. -<span class="lineNum"> 1854 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1855 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1856 </span> : * -<span class="lineNum"> 1857 </span> : * Starting from @a pos, searches backward for a character not -<span class="lineNum"> 1858 </span> : * contained in @a str within this string. If found, returns the index -<span class="lineNum"> 1859 </span> : * where it was found. If not found, returns npos. -<span class="lineNum"> 1860 </span> : */ -<span class="lineNum"> 1861 </span> : size_type -<span class="lineNum"> 1862 </span> : find_last_not_of(const basic_string& __str, size_type __pos = npos) const -<span class="lineNum"> 1863 </span> : { return this->find_last_not_of(__str.data(), __pos, __str.size()); } -<span class="lineNum"> 1864 </span> : -<span class="lineNum"> 1865 </span> : /** -<span class="lineNum"> 1866 </span> : * @brief Find last position of a character not in C substring. -<span class="lineNum"> 1867 </span> : * @param s C string containing characters to avoid. -<span class="lineNum"> 1868 </span> : * @param pos Index of character to search back from. -<span class="lineNum"> 1869 </span> : * @param n Number of characters from s to consider. -<span class="lineNum"> 1870 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1871 </span> : * -<span class="lineNum"> 1872 </span> : * Starting from @a pos, searches backward for a character not -<span class="lineNum"> 1873 </span> : * contained in the first @a n characters of @a s within this string. -<span class="lineNum"> 1874 </span> : * If found, returns the index where it was found. If not found, -<span class="lineNum"> 1875 </span> : * returns npos. -<span class="lineNum"> 1876 </span> : */ -<span class="lineNum"> 1877 </span> : size_type -<span class="lineNum"> 1878 </span> : find_last_not_of(const _CharT* __s, size_type __pos, -<span class="lineNum"> 1879 </span> : size_type __n) const; -<span class="lineNum"> 1880 </span> : /** -<span class="lineNum"> 1881 </span> : * @brief Find last position of a character not in C string. -<span class="lineNum"> 1882 </span> : * @param s C string containing characters to avoid. -<span class="lineNum"> 1883 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1884 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1885 </span> : * -<span class="lineNum"> 1886 </span> : * Starting from @a pos, searches backward for a character not -<span class="lineNum"> 1887 </span> : * contained in @a s within this string. If found, returns the index -<span class="lineNum"> 1888 </span> : * where it was found. If not found, returns npos. -<span class="lineNum"> 1889 </span> : */ -<span class="lineNum"> 1890 </span> : size_type -<span class="lineNum"> 1891 </span><span class="lineNoCov"> 0 : find_last_not_of(const _CharT* __s, size_type __pos = npos) const</span> -<span class="lineNum"> 1892 </span> : { -<span class="lineNum"> 1893 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 1894 </span><span class="lineNoCov"> 0 : return this->find_last_not_of(__s, __pos, traits_type::length(__s));</span> -<span class="lineNum"> 1895 </span> : } -<span class="lineNum"> 1896 </span> : -<span class="lineNum"> 1897 </span> : /** -<span class="lineNum"> 1898 </span> : * @brief Find last position of a different character. -<span class="lineNum"> 1899 </span> : * @param c Character to avoid. -<span class="lineNum"> 1900 </span> : * @param pos Index of character to search back from (default end). -<span class="lineNum"> 1901 </span> : * @return Index of last occurrence. -<span class="lineNum"> 1902 </span> : * -<span class="lineNum"> 1903 </span> : * Starting from @a pos, searches backward for a character other than -<span class="lineNum"> 1904 </span> : * @a c within this string. If found, returns the index where it was -<span class="lineNum"> 1905 </span> : * found. If not found, returns npos. -<span class="lineNum"> 1906 </span> : */ -<span class="lineNum"> 1907 </span> : size_type -<span class="lineNum"> 1908 </span> : find_last_not_of(_CharT __c, size_type __pos = npos) const; -<span class="lineNum"> 1909 </span> : -<span class="lineNum"> 1910 </span> : /** -<span class="lineNum"> 1911 </span> : * @brief Get a substring. -<span class="lineNum"> 1912 </span> : * @param pos Index of first character (default 0). -<span class="lineNum"> 1913 </span> : * @param n Number of characters in substring (default remainder). -<span class="lineNum"> 1914 </span> : * @return The new string. -<span class="lineNum"> 1915 </span> : * @throw std::out_of_range If pos > size(). -<span class="lineNum"> 1916 </span> : * -<span class="lineNum"> 1917 </span> : * Construct and return a new string using the @a n characters starting -<span class="lineNum"> 1918 </span> : * at @a pos. If the string is too short, use the remainder of the -<span class="lineNum"> 1919 </span> : * characters. If @a pos is beyond the end of the string, out_of_range -<span class="lineNum"> 1920 </span> : * is thrown. -<span class="lineNum"> 1921 </span> : */ -<span class="lineNum"> 1922 </span> : basic_string -<span class="lineNum"> 1923 </span><span class="lineNoCov"> 0 : substr(size_type __pos = 0, size_type __n = npos) const</span> -<span class="lineNum"> 1924 </span> : { return basic_string(*this, -<span class="lineNum"> 1925 </span><span class="lineNoCov"> 0 : _M_check(__pos, "basic_string::substr"), __n); }</span> -<span class="lineNum"> 1926 </span> : -<span class="lineNum"> 1927 </span> : /** -<span class="lineNum"> 1928 </span> : * @brief Compare to a string. -<span class="lineNum"> 1929 </span> : * @param str String to compare against. -<span class="lineNum"> 1930 </span> : * @return Integer < 0, 0, or > 0. -<span class="lineNum"> 1931 </span> : * -<span class="lineNum"> 1932 </span> : * Returns an integer < 0 if this string is ordered before @a str, 0 if -<span class="lineNum"> 1933 </span> : * their values are equivalent, or > 0 if this string is ordered after -<span class="lineNum"> 1934 </span> : * @a str. Determines the effective length rlen of the strings to -<span class="lineNum"> 1935 </span> : * compare as the smallest of size() and str.size(). The function -<span class="lineNum"> 1936 </span> : * then compares the two strings by calling traits::compare(data(), -<span class="lineNum"> 1937 </span> : * str.data(),rlen). If the result of the comparison is nonzero returns -<span class="lineNum"> 1938 </span> : * it, otherwise the shorter one is ordered first. -<span class="lineNum"> 1939 </span> : */ -<span class="lineNum"> 1940 </span> : int -<span class="lineNum"> 1941 </span><span class="lineNoCov"> 0 : compare(const basic_string& __str) const</span> -<span class="lineNum"> 1942 </span> : { -<span class="lineNum"> 1943 </span><span class="lineNoCov"> 0 : const size_type __size = this->size();</span> -<span class="lineNum"> 1944 </span><span class="lineNoCov"> 0 : const size_type __osize = __str.size();</span> -<span class="lineNum"> 1945 </span><span class="lineNoCov"> 0 : const size_type __len = std::min(__size, __osize);</span> -<span class="lineNum"> 1946 </span> : -<span class="lineNum"> 1947 </span><span class="lineNoCov"> 0 : int __r = traits_type::compare(_M_data(), __str.data(), __len);</span> -<span class="lineNum"> 1948 </span><span class="lineNoCov"> 0 : if (!__r)</span> -<span class="lineNum"> 1949 </span><span class="lineNoCov"> 0 : __r = _S_compare(__size, __osize);</span> -<span class="lineNum"> 1950 </span><span class="lineNoCov"> 0 : return __r;</span> -<span class="lineNum"> 1951 </span> : } -<span class="lineNum"> 1952 </span> : -<span class="lineNum"> 1953 </span> : /** -<span class="lineNum"> 1954 </span> : * @brief Compare substring to a string. -<span class="lineNum"> 1955 </span> : * @param pos Index of first character of substring. -<span class="lineNum"> 1956 </span> : * @param n Number of characters in substring. -<span class="lineNum"> 1957 </span> : * @param str String to compare against. -<span class="lineNum"> 1958 </span> : * @return Integer < 0, 0, or > 0. -<span class="lineNum"> 1959 </span> : * -<span class="lineNum"> 1960 </span> : * Form the substring of this string from the @a n characters starting -<span class="lineNum"> 1961 </span> : * at @a pos. Returns an integer < 0 if the substring is ordered -<span class="lineNum"> 1962 </span> : * before @a str, 0 if their values are equivalent, or > 0 if the -<span class="lineNum"> 1963 </span> : * substring is ordered after @a str. Determines the effective length -<span class="lineNum"> 1964 </span> : * rlen of the strings to compare as the smallest of the length of the -<span class="lineNum"> 1965 </span> : * substring and @a str.size(). The function then compares the two -<span class="lineNum"> 1966 </span> : * strings by calling traits::compare(substring.data(),str.data(),rlen). -<span class="lineNum"> 1967 </span> : * If the result of the comparison is nonzero returns it, otherwise the -<span class="lineNum"> 1968 </span> : * shorter one is ordered first. -<span class="lineNum"> 1969 </span> : */ -<span class="lineNum"> 1970 </span> : int -<span class="lineNum"> 1971 </span> : compare(size_type __pos, size_type __n, const basic_string& __str) const; -<span class="lineNum"> 1972 </span> : -<span class="lineNum"> 1973 </span> : /** -<span class="lineNum"> 1974 </span> : * @brief Compare substring to a substring. -<span class="lineNum"> 1975 </span> : * @param pos1 Index of first character of substring. -<span class="lineNum"> 1976 </span> : * @param n1 Number of characters in substring. -<span class="lineNum"> 1977 </span> : * @param str String to compare against. -<span class="lineNum"> 1978 </span> : * @param pos2 Index of first character of substring of str. -<span class="lineNum"> 1979 </span> : * @param n2 Number of characters in substring of str. -<span class="lineNum"> 1980 </span> : * @return Integer < 0, 0, or > 0. -<span class="lineNum"> 1981 </span> : * -<span class="lineNum"> 1982 </span> : * Form the substring of this string from the @a n1 characters starting -<span class="lineNum"> 1983 </span> : * at @a pos1. Form the substring of @a str from the @a n2 characters -<span class="lineNum"> 1984 </span> : * starting at @a pos2. Returns an integer < 0 if this substring is -<span class="lineNum"> 1985 </span> : * ordered before the substring of @a str, 0 if their values are -<span class="lineNum"> 1986 </span> : * equivalent, or > 0 if this substring is ordered after the substring -<span class="lineNum"> 1987 </span> : * of @a str. Determines the effective length rlen of the strings -<span class="lineNum"> 1988 </span> : * to compare as the smallest of the lengths of the substrings. The -<span class="lineNum"> 1989 </span> : * function then compares the two strings by calling -<span class="lineNum"> 1990 </span> : * traits::compare(substring.data(),str.substr(pos2,n2).data(),rlen). -<span class="lineNum"> 1991 </span> : * If the result of the comparison is nonzero returns it, otherwise the -<span class="lineNum"> 1992 </span> : * shorter one is ordered first. -<span class="lineNum"> 1993 </span> : */ -<span class="lineNum"> 1994 </span> : int -<span class="lineNum"> 1995 </span> : compare(size_type __pos1, size_type __n1, const basic_string& __str, -<span class="lineNum"> 1996 </span> : size_type __pos2, size_type __n2) const; -<span class="lineNum"> 1997 </span> : -<span class="lineNum"> 1998 </span> : /** -<span class="lineNum"> 1999 </span> : * @brief Compare to a C string. -<span class="lineNum"> 2000 </span> : * @param s C string to compare against. -<span class="lineNum"> 2001 </span> : * @return Integer < 0, 0, or > 0. -<span class="lineNum"> 2002 </span> : * -<span class="lineNum"> 2003 </span> : * Returns an integer < 0 if this string is ordered before @a s, 0 if -<span class="lineNum"> 2004 </span> : * their values are equivalent, or > 0 if this string is ordered after -<span class="lineNum"> 2005 </span> : * @a s. Determines the effective length rlen of the strings to -<span class="lineNum"> 2006 </span> : * compare as the smallest of size() and the length of a string -<span class="lineNum"> 2007 </span> : * constructed from @a s. The function then compares the two strings -<span class="lineNum"> 2008 </span> : * by calling traits::compare(data(),s,rlen). If the result of the -<span class="lineNum"> 2009 </span> : * comparison is nonzero returns it, otherwise the shorter one is -<span class="lineNum"> 2010 </span> : * ordered first. -<span class="lineNum"> 2011 </span> : */ -<span class="lineNum"> 2012 </span> : int -<span class="lineNum"> 2013 </span> : compare(const _CharT* __s) const; -<span class="lineNum"> 2014 </span> : -<span class="lineNum"> 2015 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 2016 </span> : // 5 String::compare specification questionable -<span class="lineNum"> 2017 </span> : /** -<span class="lineNum"> 2018 </span> : * @brief Compare substring to a C string. -<span class="lineNum"> 2019 </span> : * @param pos Index of first character of substring. -<span class="lineNum"> 2020 </span> : * @param n1 Number of characters in substring. -<span class="lineNum"> 2021 </span> : * @param s C string to compare against. -<span class="lineNum"> 2022 </span> : * @return Integer < 0, 0, or > 0. -<span class="lineNum"> 2023 </span> : * -<span class="lineNum"> 2024 </span> : * Form the substring of this string from the @a n1 characters starting -<span class="lineNum"> 2025 </span> : * at @a pos. Returns an integer < 0 if the substring is ordered -<span class="lineNum"> 2026 </span> : * before @a s, 0 if their values are equivalent, or > 0 if the -<span class="lineNum"> 2027 </span> : * substring is ordered after @a s. Determines the effective length -<span class="lineNum"> 2028 </span> : * rlen of the strings to compare as the smallest of the length of the -<span class="lineNum"> 2029 </span> : * substring and the length of a string constructed from @a s. The -<span class="lineNum"> 2030 </span> : * function then compares the two string by calling -<span class="lineNum"> 2031 </span> : * traits::compare(substring.data(),s,rlen). If the result of the -<span class="lineNum"> 2032 </span> : * comparison is nonzero returns it, otherwise the shorter one is -<span class="lineNum"> 2033 </span> : * ordered first. -<span class="lineNum"> 2034 </span> : */ -<span class="lineNum"> 2035 </span> : int -<span class="lineNum"> 2036 </span> : compare(size_type __pos, size_type __n1, const _CharT* __s) const; -<span class="lineNum"> 2037 </span> : -<span class="lineNum"> 2038 </span> : /** -<span class="lineNum"> 2039 </span> : * @brief Compare substring against a character array. -<span class="lineNum"> 2040 </span> : * @param pos1 Index of first character of substring. -<span class="lineNum"> 2041 </span> : * @param n1 Number of characters in substring. -<span class="lineNum"> 2042 </span> : * @param s character array to compare against. -<span class="lineNum"> 2043 </span> : * @param n2 Number of characters of s. -<span class="lineNum"> 2044 </span> : * @return Integer < 0, 0, or > 0. -<span class="lineNum"> 2045 </span> : * -<span class="lineNum"> 2046 </span> : * Form the substring of this string from the @a n1 characters starting -<span class="lineNum"> 2047 </span> : * at @a pos1. Form a string from the first @a n2 characters of @a s. -<span class="lineNum"> 2048 </span> : * Returns an integer < 0 if this substring is ordered before the string -<span class="lineNum"> 2049 </span> : * from @a s, 0 if their values are equivalent, or > 0 if this substring -<span class="lineNum"> 2050 </span> : * is ordered after the string from @a s. Determines the effective -<span class="lineNum"> 2051 </span> : * length rlen of the strings to compare as the smallest of the length -<span class="lineNum"> 2052 </span> : * of the substring and @a n2. The function then compares the two -<span class="lineNum"> 2053 </span> : * strings by calling traits::compare(substring.data(),s,rlen). If the -<span class="lineNum"> 2054 </span> : * result of the comparison is nonzero returns it, otherwise the shorter -<span class="lineNum"> 2055 </span> : * one is ordered first. -<span class="lineNum"> 2056 </span> : * -<span class="lineNum"> 2057 </span> : * NB: s must have at least n2 characters, '\0' has no special -<span class="lineNum"> 2058 </span> : * meaning. -<span class="lineNum"> 2059 </span> : */ -<span class="lineNum"> 2060 </span> : int -<span class="lineNum"> 2061 </span> : compare(size_type __pos, size_type __n1, const _CharT* __s, -<span class="lineNum"> 2062 </span> : size_type __n2) const; -<span class="lineNum"> 2063 </span> : }; -<span class="lineNum"> 2064 </span> : -<span class="lineNum"> 2065 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2066 </span> : inline basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 2067 </span><span class="lineNoCov"> 0 : basic_string()</span> -<span class="lineNum"> 2068 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 2069 </span><span class="lineNoCov"> 0 : : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { }</span> -<span class="lineNum"> 2070 </span> : #else -<span class="lineNum"> 2071 </span> : : _M_dataplus(_S_construct(size_type(), _CharT(), _Alloc()), _Alloc()) { } -<span class="lineNum"> 2072 </span> : #endif -<span class="lineNum"> 2073 </span> : -<span class="lineNum"> 2074 </span> : // operator+ -<span class="lineNum"> 2075 </span> : /** -<span class="lineNum"> 2076 </span> : * @brief Concatenate two strings. -<span class="lineNum"> 2077 </span> : * @param lhs First string. -<span class="lineNum"> 2078 </span> : * @param rhs Last string. -<span class="lineNum"> 2079 </span> : * @return New string with value of @a lhs followed by @a rhs. -<span class="lineNum"> 2080 </span> : */ -<span class="lineNum"> 2081 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2082 </span> : basic_string<_CharT, _Traits, _Alloc> -<span class="lineNum"> 2083 </span> : operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2084 </span><span class="lineCov"> 715370 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2085 </span> : { -<span class="lineNum"> 2086 </span><span class="lineCov"> 715370 : basic_string<_CharT, _Traits, _Alloc> __str(__lhs);</span> -<span class="lineNum"> 2087 </span><span class="lineCov"> 715370 : __str.append(__rhs);</span> -<span class="lineNum"> 2088 </span><span class="lineNoCov"> 0 : return __str;</span> -<span class="lineNum"> 2089 </span> : } -<span class="lineNum"> 2090 </span> : -<span class="lineNum"> 2091 </span> : /** -<span class="lineNum"> 2092 </span> : * @brief Concatenate C string and string. -<span class="lineNum"> 2093 </span> : * @param lhs First string. -<span class="lineNum"> 2094 </span> : * @param rhs Last string. -<span class="lineNum"> 2095 </span> : * @return New string with value of @a lhs followed by @a rhs. -<span class="lineNum"> 2096 </span> : */ -<span class="lineNum"> 2097 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2098 </span> : basic_string<_CharT,_Traits,_Alloc> -<span class="lineNum"> 2099 </span> : operator+(const _CharT* __lhs, -<span class="lineNum"> 2100 </span> : const basic_string<_CharT,_Traits,_Alloc>& __rhs); -<span class="lineNum"> 2101 </span> : -<span class="lineNum"> 2102 </span> : /** -<span class="lineNum"> 2103 </span> : * @brief Concatenate character and string. -<span class="lineNum"> 2104 </span> : * @param lhs First string. -<span class="lineNum"> 2105 </span> : * @param rhs Last string. -<span class="lineNum"> 2106 </span> : * @return New string with @a lhs followed by @a rhs. -<span class="lineNum"> 2107 </span> : */ -<span class="lineNum"> 2108 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2109 </span> : basic_string<_CharT,_Traits,_Alloc> -<span class="lineNum"> 2110 </span> : operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); -<span class="lineNum"> 2111 </span> : -<span class="lineNum"> 2112 </span> : /** -<span class="lineNum"> 2113 </span> : * @brief Concatenate string and C string. -<span class="lineNum"> 2114 </span> : * @param lhs First string. -<span class="lineNum"> 2115 </span> : * @param rhs Last string. -<span class="lineNum"> 2116 </span> : * @return New string with @a lhs followed by @a rhs. -<span class="lineNum"> 2117 </span> : */ -<span class="lineNum"> 2118 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2119 </span> : inline basic_string<_CharT, _Traits, _Alloc> -<span class="lineNum"> 2120 </span> : operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2121 </span><span class="lineCov"> 5962 : const _CharT* __rhs)</span> -<span class="lineNum"> 2122 </span> : { -<span class="lineNum"> 2123 </span><span class="lineCov"> 5962 : basic_string<_CharT, _Traits, _Alloc> __str(__lhs);</span> -<span class="lineNum"> 2124 </span><span class="lineCov"> 5962 : __str.append(__rhs);</span> -<span class="lineNum"> 2125 </span><span class="lineNoCov"> 0 : return __str;</span> -<span class="lineNum"> 2126 </span> : } -<span class="lineNum"> 2127 </span> : -<span class="lineNum"> 2128 </span> : /** -<span class="lineNum"> 2129 </span> : * @brief Concatenate string and character. -<span class="lineNum"> 2130 </span> : * @param lhs First string. -<span class="lineNum"> 2131 </span> : * @param rhs Last string. -<span class="lineNum"> 2132 </span> : * @return New string with @a lhs followed by @a rhs. -<span class="lineNum"> 2133 </span> : */ -<span class="lineNum"> 2134 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2135 </span> : inline basic_string<_CharT, _Traits, _Alloc> -<span class="lineNum"> 2136 </span><span class="lineCov"> 140 : operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs)</span> -<span class="lineNum"> 2137 </span> : { -<span class="lineNum"> 2138 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 2139 </span> : typedef typename __string_type::size_type __size_type; -<span class="lineNum"> 2140 </span><span class="lineCov"> 140 : __string_type __str(__lhs);</span> -<span class="lineNum"> 2141 </span><span class="lineCov"> 140 : __str.append(__size_type(1), __rhs);</span> -<span class="lineNum"> 2142 </span><span class="lineNoCov"> 0 : return __str;</span> -<span class="lineNum"> 2143 </span> : } -<span class="lineNum"> 2144 </span> : -<span class="lineNum"> 2145 </span> : // operator == -<span class="lineNum"> 2146 </span> : /** -<span class="lineNum"> 2147 </span> : * @brief Test equivalence of two strings. -<span class="lineNum"> 2148 </span> : * @param lhs First string. -<span class="lineNum"> 2149 </span> : * @param rhs Second string. -<span class="lineNum"> 2150 </span> : * @return True if @a lhs.compare(@a rhs) == 0. False otherwise. -<span class="lineNum"> 2151 </span> : */ -<span class="lineNum"> 2152 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2153 </span> : inline bool -<span class="lineNum"> 2154 </span> : operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2155 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2156 </span> : { return __lhs.compare(__rhs) == 0; } -<span class="lineNum"> 2157 </span> : -<span class="lineNum"> 2158 </span> : template<typename _CharT> -<span class="lineNum"> 2159 </span> : inline -<span class="lineNum"> 2160 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type -<span class="lineNum"> 2161 </span> : operator==(const basic_string<_CharT>& __lhs, -<span class="lineNum"> 2162 </span><span class="lineCov"> 134945 : const basic_string<_CharT>& __rhs)</span> -<span class="lineNum"> 2163 </span> : { return (__lhs.size() == __rhs.size() -<span class="lineNum"> 2164 </span> : && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(), -<span class="lineNum"> 2165 </span><span class="lineCov"> 134945 : __lhs.size())); }</span> -<span class="lineNum"> 2166 </span> : -<span class="lineNum"> 2167 </span> : /** -<span class="lineNum"> 2168 </span> : * @brief Test equivalence of C string and string. -<span class="lineNum"> 2169 </span> : * @param lhs C string. -<span class="lineNum"> 2170 </span> : * @param rhs String. -<span class="lineNum"> 2171 </span> : * @return True if @a rhs.compare(@a lhs) == 0. False otherwise. -<span class="lineNum"> 2172 </span> : */ -<span class="lineNum"> 2173 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2174 </span> : inline bool -<span class="lineNum"> 2175 </span> : operator==(const _CharT* __lhs, -<span class="lineNum"> 2176 </span><span class="lineNoCov"> 0 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2177 </span><span class="lineNoCov"> 0 : { return __rhs.compare(__lhs) == 0; }</span> -<span class="lineNum"> 2178 </span> : -<span class="lineNum"> 2179 </span> : /** -<span class="lineNum"> 2180 </span> : * @brief Test equivalence of string and C string. -<span class="lineNum"> 2181 </span> : * @param lhs String. -<span class="lineNum"> 2182 </span> : * @param rhs C string. -<span class="lineNum"> 2183 </span> : * @return True if @a lhs.compare(@a rhs) == 0. False otherwise. -<span class="lineNum"> 2184 </span> : */ -<span class="lineNum"> 2185 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2186 </span> : inline bool -<span class="lineNum"> 2187 </span> : operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2188 </span><span class="lineCov"> 156952 : const _CharT* __rhs)</span> -<span class="lineNum"> 2189 </span><span class="lineCov"> 156952 : { return __lhs.compare(__rhs) == 0; }</span> -<span class="lineNum"> 2190 </span> : -<span class="lineNum"> 2191 </span> : // operator != -<span class="lineNum"> 2192 </span> : /** -<span class="lineNum"> 2193 </span> : * @brief Test difference of two strings. -<span class="lineNum"> 2194 </span> : * @param lhs First string. -<span class="lineNum"> 2195 </span> : * @param rhs Second string. -<span class="lineNum"> 2196 </span> : * @return True if @a lhs.compare(@a rhs) != 0. False otherwise. -<span class="lineNum"> 2197 </span> : */ -<span class="lineNum"> 2198 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2199 </span> : inline bool -<span class="lineNum"> 2200 </span> : operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2201 </span><span class="lineCov"> 84867 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2202 </span><span class="lineCov"> 84867 : { return !(__lhs == __rhs); }</span> -<span class="lineNum"> 2203 </span> : -<span class="lineNum"> 2204 </span> : /** -<span class="lineNum"> 2205 </span> : * @brief Test difference of C string and string. -<span class="lineNum"> 2206 </span> : * @param lhs C string. -<span class="lineNum"> 2207 </span> : * @param rhs String. -<span class="lineNum"> 2208 </span> : * @return True if @a rhs.compare(@a lhs) != 0. False otherwise. -<span class="lineNum"> 2209 </span> : */ -<span class="lineNum"> 2210 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2211 </span> : inline bool -<span class="lineNum"> 2212 </span> : operator!=(const _CharT* __lhs, -<span class="lineNum"> 2213 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2214 </span> : { return !(__lhs == __rhs); } -<span class="lineNum"> 2215 </span> : -<span class="lineNum"> 2216 </span> : /** -<span class="lineNum"> 2217 </span> : * @brief Test difference of string and C string. -<span class="lineNum"> 2218 </span> : * @param lhs String. -<span class="lineNum"> 2219 </span> : * @param rhs C string. -<span class="lineNum"> 2220 </span> : * @return True if @a lhs.compare(@a rhs) != 0. False otherwise. -<span class="lineNum"> 2221 </span> : */ -<span class="lineNum"> 2222 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2223 </span> : inline bool -<span class="lineNum"> 2224 </span> : operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2225 </span><span class="lineCov"> 74475 : const _CharT* __rhs)</span> -<span class="lineNum"> 2226 </span><span class="lineCov"> 74475 : { return !(__lhs == __rhs); }</span> -<span class="lineNum"> 2227 </span> : -<span class="lineNum"> 2228 </span> : // operator < -<span class="lineNum"> 2229 </span> : /** -<span class="lineNum"> 2230 </span> : * @brief Test if string precedes string. -<span class="lineNum"> 2231 </span> : * @param lhs First string. -<span class="lineNum"> 2232 </span> : * @param rhs Second string. -<span class="lineNum"> 2233 </span> : * @return True if @a lhs precedes @a rhs. False otherwise. -<span class="lineNum"> 2234 </span> : */ -<span class="lineNum"> 2235 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2236 </span> : inline bool -<span class="lineNum"> 2237 </span> : operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2238 </span><span class="lineCov"> 4885154 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2239 </span><span class="lineCov"> 4885154 : { return __lhs.compare(__rhs) < 0; }</span> -<span class="lineNum"> 2240 </span> : -<span class="lineNum"> 2241 </span> : /** -<span class="lineNum"> 2242 </span> : * @brief Test if string precedes C string. -<span class="lineNum"> 2243 </span> : * @param lhs String. -<span class="lineNum"> 2244 </span> : * @param rhs C string. -<span class="lineNum"> 2245 </span> : * @return True if @a lhs precedes @a rhs. False otherwise. -<span class="lineNum"> 2246 </span> : */ -<span class="lineNum"> 2247 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2248 </span> : inline bool -<span class="lineNum"> 2249 </span> : operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2250 </span> : const _CharT* __rhs) -<span class="lineNum"> 2251 </span> : { return __lhs.compare(__rhs) < 0; } -<span class="lineNum"> 2252 </span> : -<span class="lineNum"> 2253 </span> : /** -<span class="lineNum"> 2254 </span> : * @brief Test if C string precedes string. -<span class="lineNum"> 2255 </span> : * @param lhs C string. -<span class="lineNum"> 2256 </span> : * @param rhs String. -<span class="lineNum"> 2257 </span> : * @return True if @a lhs precedes @a rhs. False otherwise. -<span class="lineNum"> 2258 </span> : */ -<span class="lineNum"> 2259 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2260 </span> : inline bool -<span class="lineNum"> 2261 </span> : operator<(const _CharT* __lhs, -<span class="lineNum"> 2262 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2263 </span> : { return __rhs.compare(__lhs) > 0; } -<span class="lineNum"> 2264 </span> : -<span class="lineNum"> 2265 </span> : // operator > -<span class="lineNum"> 2266 </span> : /** -<span class="lineNum"> 2267 </span> : * @brief Test if string follows string. -<span class="lineNum"> 2268 </span> : * @param lhs First string. -<span class="lineNum"> 2269 </span> : * @param rhs Second string. -<span class="lineNum"> 2270 </span> : * @return True if @a lhs follows @a rhs. False otherwise. -<span class="lineNum"> 2271 </span> : */ -<span class="lineNum"> 2272 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2273 </span> : inline bool -<span class="lineNum"> 2274 </span> : operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2275 </span><span class="lineCov"> 1024110 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2276 </span><span class="lineCov"> 1024110 : { return __lhs.compare(__rhs) > 0; }</span> -<span class="lineNum"> 2277 </span> : -<span class="lineNum"> 2278 </span> : /** -<span class="lineNum"> 2279 </span> : * @brief Test if string follows C string. -<span class="lineNum"> 2280 </span> : * @param lhs String. -<span class="lineNum"> 2281 </span> : * @param rhs C string. -<span class="lineNum"> 2282 </span> : * @return True if @a lhs follows @a rhs. False otherwise. -<span class="lineNum"> 2283 </span> : */ -<span class="lineNum"> 2284 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2285 </span> : inline bool -<span class="lineNum"> 2286 </span> : operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2287 </span> : const _CharT* __rhs) -<span class="lineNum"> 2288 </span> : { return __lhs.compare(__rhs) > 0; } -<span class="lineNum"> 2289 </span> : -<span class="lineNum"> 2290 </span> : /** -<span class="lineNum"> 2291 </span> : * @brief Test if C string follows string. -<span class="lineNum"> 2292 </span> : * @param lhs C string. -<span class="lineNum"> 2293 </span> : * @param rhs String. -<span class="lineNum"> 2294 </span> : * @return True if @a lhs follows @a rhs. False otherwise. -<span class="lineNum"> 2295 </span> : */ -<span class="lineNum"> 2296 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2297 </span> : inline bool -<span class="lineNum"> 2298 </span> : operator>(const _CharT* __lhs, -<span class="lineNum"> 2299 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2300 </span> : { return __rhs.compare(__lhs) < 0; } -<span class="lineNum"> 2301 </span> : -<span class="lineNum"> 2302 </span> : // operator <= -<span class="lineNum"> 2303 </span> : /** -<span class="lineNum"> 2304 </span> : * @brief Test if string doesn't follow string. -<span class="lineNum"> 2305 </span> : * @param lhs First string. -<span class="lineNum"> 2306 </span> : * @param rhs Second string. -<span class="lineNum"> 2307 </span> : * @return True if @a lhs doesn't follow @a rhs. False otherwise. -<span class="lineNum"> 2308 </span> : */ -<span class="lineNum"> 2309 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2310 </span> : inline bool -<span class="lineNum"> 2311 </span> : operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2312 </span><span class="lineCov"> 58 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2313 </span><span class="lineCov"> 58 : { return __lhs.compare(__rhs) <= 0; }</span> -<span class="lineNum"> 2314 </span> : -<span class="lineNum"> 2315 </span> : /** -<span class="lineNum"> 2316 </span> : * @brief Test if string doesn't follow C string. -<span class="lineNum"> 2317 </span> : * @param lhs String. -<span class="lineNum"> 2318 </span> : * @param rhs C string. -<span class="lineNum"> 2319 </span> : * @return True if @a lhs doesn't follow @a rhs. False otherwise. -<span class="lineNum"> 2320 </span> : */ -<span class="lineNum"> 2321 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2322 </span> : inline bool -<span class="lineNum"> 2323 </span> : operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2324 </span> : const _CharT* __rhs) -<span class="lineNum"> 2325 </span> : { return __lhs.compare(__rhs) <= 0; } -<span class="lineNum"> 2326 </span> : -<span class="lineNum"> 2327 </span> : /** -<span class="lineNum"> 2328 </span> : * @brief Test if C string doesn't follow string. -<span class="lineNum"> 2329 </span> : * @param lhs C string. -<span class="lineNum"> 2330 </span> : * @param rhs String. -<span class="lineNum"> 2331 </span> : * @return True if @a lhs doesn't follow @a rhs. False otherwise. -<span class="lineNum"> 2332 </span> : */ -<span class="lineNum"> 2333 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2334 </span> : inline bool -<span class="lineNum"> 2335 </span> : operator<=(const _CharT* __lhs, -<span class="lineNum"> 2336 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2337 </span> : { return __rhs.compare(__lhs) >= 0; } -<span class="lineNum"> 2338 </span> : -<span class="lineNum"> 2339 </span> : // operator >= -<span class="lineNum"> 2340 </span> : /** -<span class="lineNum"> 2341 </span> : * @brief Test if string doesn't precede string. -<span class="lineNum"> 2342 </span> : * @param lhs First string. -<span class="lineNum"> 2343 </span> : * @param rhs Second string. -<span class="lineNum"> 2344 </span> : * @return True if @a lhs doesn't precede @a rhs. False otherwise. -<span class="lineNum"> 2345 </span> : */ -<span class="lineNum"> 2346 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2347 </span> : inline bool -<span class="lineNum"> 2348 </span> : operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2349 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2350 </span> : { return __lhs.compare(__rhs) >= 0; } -<span class="lineNum"> 2351 </span> : -<span class="lineNum"> 2352 </span> : /** -<span class="lineNum"> 2353 </span> : * @brief Test if string doesn't precede C string. -<span class="lineNum"> 2354 </span> : * @param lhs String. -<span class="lineNum"> 2355 </span> : * @param rhs C string. -<span class="lineNum"> 2356 </span> : * @return True if @a lhs doesn't precede @a rhs. False otherwise. -<span class="lineNum"> 2357 </span> : */ -<span class="lineNum"> 2358 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2359 </span> : inline bool -<span class="lineNum"> 2360 </span> : operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2361 </span> : const _CharT* __rhs) -<span class="lineNum"> 2362 </span> : { return __lhs.compare(__rhs) >= 0; } -<span class="lineNum"> 2363 </span> : -<span class="lineNum"> 2364 </span> : /** -<span class="lineNum"> 2365 </span> : * @brief Test if C string doesn't precede string. -<span class="lineNum"> 2366 </span> : * @param lhs C string. -<span class="lineNum"> 2367 </span> : * @param rhs String. -<span class="lineNum"> 2368 </span> : * @return True if @a lhs doesn't precede @a rhs. False otherwise. -<span class="lineNum"> 2369 </span> : */ -<span class="lineNum"> 2370 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2371 </span> : inline bool -<span class="lineNum"> 2372 </span> : operator>=(const _CharT* __lhs, -<span class="lineNum"> 2373 </span> : const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 2374 </span> : { return __rhs.compare(__lhs) <= 0; } -<span class="lineNum"> 2375 </span> : -<span class="lineNum"> 2376 </span> : /** -<span class="lineNum"> 2377 </span> : * @brief Swap contents of two strings. -<span class="lineNum"> 2378 </span> : * @param lhs First string. -<span class="lineNum"> 2379 </span> : * @param rhs Second string. -<span class="lineNum"> 2380 </span> : * -<span class="lineNum"> 2381 </span> : * Exchanges the contents of @a lhs and @a rhs in constant time. -<span class="lineNum"> 2382 </span> : */ -<span class="lineNum"> 2383 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2384 </span> : inline void -<span class="lineNum"> 2385 </span> : swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, -<span class="lineNum"> 2386 </span><span class="lineNoCov"> 0 : basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 2387 </span><span class="lineNoCov"> 0 : { __lhs.swap(__rhs); }</span> -<span class="lineNum"> 2388 </span> : -<span class="lineNum"> 2389 </span> : /** -<span class="lineNum"> 2390 </span> : * @brief Read stream into a string. -<span class="lineNum"> 2391 </span> : * @param is Input stream. -<span class="lineNum"> 2392 </span> : * @param str Buffer to store into. -<span class="lineNum"> 2393 </span> : * @return Reference to the input stream. -<span class="lineNum"> 2394 </span> : * -<span class="lineNum"> 2395 </span> : * Stores characters from @a is into @a str until whitespace is found, the -<span class="lineNum"> 2396 </span> : * end of the stream is encountered, or str.max_size() is reached. If -<span class="lineNum"> 2397 </span> : * is.width() is non-zero, that is the limit on the number of characters -<span class="lineNum"> 2398 </span> : * stored into @a str. Any previous contents of @a str are erased. -<span class="lineNum"> 2399 </span> : */ -<span class="lineNum"> 2400 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2401 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 2402 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, -<span class="lineNum"> 2403 </span> : basic_string<_CharT, _Traits, _Alloc>& __str); -<span class="lineNum"> 2404 </span> : -<span class="lineNum"> 2405 </span> : template<> -<span class="lineNum"> 2406 </span> : basic_istream<char>& -<span class="lineNum"> 2407 </span> : operator>>(basic_istream<char>& __is, basic_string<char>& __str); -<span class="lineNum"> 2408 </span> : -<span class="lineNum"> 2409 </span> : /** -<span class="lineNum"> 2410 </span> : * @brief Write string to a stream. -<span class="lineNum"> 2411 </span> : * @param os Output stream. -<span class="lineNum"> 2412 </span> : * @param str String to write out. -<span class="lineNum"> 2413 </span> : * @return Reference to the output stream. -<span class="lineNum"> 2414 </span> : * -<span class="lineNum"> 2415 </span> : * Output characters of @a str into os following the same rules as for -<span class="lineNum"> 2416 </span> : * writing a C string. -<span class="lineNum"> 2417 </span> : */ -<span class="lineNum"> 2418 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2419 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 2420 </span> : operator<<(basic_ostream<_CharT, _Traits>& __os, -<span class="lineNum"> 2421 </span><span class="lineNoCov"> 0 : const basic_string<_CharT, _Traits, _Alloc>& __str)</span> -<span class="lineNum"> 2422 </span> : { -<span class="lineNum"> 2423 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 2424 </span> : // 586. string inserter not a formatted function -<span class="lineNum"> 2425 </span><span class="lineNoCov"> 0 : return __ostream_insert(__os, __str.data(), __str.size());</span> -<span class="lineNum"> 2426 </span> : } -<span class="lineNum"> 2427 </span> : -<span class="lineNum"> 2428 </span> : /** -<span class="lineNum"> 2429 </span> : * @brief Read a line from stream into a string. -<span class="lineNum"> 2430 </span> : * @param is Input stream. -<span class="lineNum"> 2431 </span> : * @param str Buffer to store into. -<span class="lineNum"> 2432 </span> : * @param delim Character marking end of line. -<span class="lineNum"> 2433 </span> : * @return Reference to the input stream. -<span class="lineNum"> 2434 </span> : * -<span class="lineNum"> 2435 </span> : * Stores characters from @a is into @a str until @a delim is found, the -<span class="lineNum"> 2436 </span> : * end of the stream is encountered, or str.max_size() is reached. If -<span class="lineNum"> 2437 </span> : * is.width() is non-zero, that is the limit on the number of characters -<span class="lineNum"> 2438 </span> : * stored into @a str. Any previous contents of @a str are erased. If @a -<span class="lineNum"> 2439 </span> : * delim was encountered, it is extracted but not stored into @a str. -<span class="lineNum"> 2440 </span> : */ -<span class="lineNum"> 2441 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2442 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 2443 </span> : getline(basic_istream<_CharT, _Traits>& __is, -<span class="lineNum"> 2444 </span> : basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim); -<span class="lineNum"> 2445 </span> : -<span class="lineNum"> 2446 </span> : /** -<span class="lineNum"> 2447 </span> : * @brief Read a line from stream into a string. -<span class="lineNum"> 2448 </span> : * @param is Input stream. -<span class="lineNum"> 2449 </span> : * @param str Buffer to store into. -<span class="lineNum"> 2450 </span> : * @return Reference to the input stream. -<span class="lineNum"> 2451 </span> : * -<span class="lineNum"> 2452 </span> : * Stores characters from is into @a str until '\n' is found, the end of -<span class="lineNum"> 2453 </span> : * the stream is encountered, or str.max_size() is reached. If is.width() -<span class="lineNum"> 2454 </span> : * is non-zero, that is the limit on the number of characters stored into -<span class="lineNum"> 2455 </span> : * @a str. Any previous contents of @a str are erased. If end of line was -<span class="lineNum"> 2456 </span> : * encountered, it is extracted but not stored into @a str. -<span class="lineNum"> 2457 </span> : */ -<span class="lineNum"> 2458 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 2459 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 2460 </span> : getline(basic_istream<_CharT, _Traits>& __is, -<span class="lineNum"> 2461 </span><span class="lineNoCov"> 0 : basic_string<_CharT, _Traits, _Alloc>& __str)</span> -<span class="lineNum"> 2462 </span><span class="lineNoCov"> 0 : { return getline(__is, __str, __is.widen('\n')); }</span> -<span class="lineNum"> 2463 </span> : -<span class="lineNum"> 2464 </span> : template<> -<span class="lineNum"> 2465 </span> : basic_istream<char>& -<span class="lineNum"> 2466 </span> : getline(basic_istream<char>& __in, basic_string<char>& __str, -<span class="lineNum"> 2467 </span> : char __delim); -<span class="lineNum"> 2468 </span> : -<span class="lineNum"> 2469 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 2470 </span> : template<> -<span class="lineNum"> 2471 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 2472 </span> : getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str, -<span class="lineNum"> 2473 </span> : wchar_t __delim); -<span class="lineNum"> 2474 </span> : #endif -<span class="lineNum"> 2475 </span> : -<span class="lineNum"> 2476 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 2477 </span> : -<span class="lineNum"> 2478 </span> : #endif /* _BASIC_STRING_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/basic_string.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/basic_string.tcc.gcov.html deleted file mode 100644 index 169e3e7..0000000 --- a/rep/usr/include/c++/4.3/bits/basic_string.tcc.gcov.html +++ /dev/null @@ -1,1208 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/basic_string.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - basic_string.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">23</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">73.9 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">17</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Components for manipulating sequences of characters -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file basic_string.tcc -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : // ISO C++ 14882: 21 Strings library -<span class="lineNum"> 39 </span> : // -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : // Written by Jason Merrill based upon the specification by Takanori Adachi -<span class="lineNum"> 42 </span> : // in ANSI X3J16/94-0013R2. Rewritten by Nathan Myers to ISO-14882. -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #ifndef _BASIC_STRING_TCC -<span class="lineNum"> 45 </span> : #define _BASIC_STRING_TCC 1 -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : #pragma GCC system_header -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : #include <cxxabi-forced.h> -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 54 </span> : const typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 55 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 56 </span> : _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4; -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 59 </span> : const _CharT -<span class="lineNum"> 60 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 61 </span> : _Rep::_S_terminal = _CharT(); -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 64 </span> : const typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 65 </span> : basic_string<_CharT, _Traits, _Alloc>::npos; -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : // Linker sets _S_empty_rep_storage to all 0s (one reference, empty string) -<span class="lineNum"> 68 </span> : // at static init time (before static ctors are run). -<span class="lineNum"> 69 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 70 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 71 </span> : basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[ -<span class="lineNum"> 72 </span> : (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) / -<span class="lineNum"> 73 </span> : sizeof(size_type)]; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : // NB: This is the special case for Input Iterators, used in -<span class="lineNum"> 76 </span> : // istreambuf_iterators, etc. -<span class="lineNum"> 77 </span> : // Input Iterators have a cost structure very different from -<span class="lineNum"> 78 </span> : // pointers, calling for a different coding style. -<span class="lineNum"> 79 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 80 </span> : template<typename _InIterator> -<span class="lineNum"> 81 </span> : _CharT* -<span class="lineNum"> 82 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 83 </span> : _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, -<span class="lineNum"> 84 </span> : input_iterator_tag) -<span class="lineNum"> 85 </span> : { -<span class="lineNum"> 86 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 87 </span> : if (__beg == __end && __a == _Alloc()) -<span class="lineNum"> 88 </span> : return _S_empty_rep()._M_refdata(); -<span class="lineNum"> 89 </span> : #endif -<span class="lineNum"> 90 </span> : // Avoid reallocation for common case. -<span class="lineNum"> 91 </span> : _CharT __buf[128]; -<span class="lineNum"> 92 </span> : size_type __len = 0; -<span class="lineNum"> 93 </span> : while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT)) -<span class="lineNum"> 94 </span> : { -<span class="lineNum"> 95 </span> : __buf[__len++] = *__beg; -<span class="lineNum"> 96 </span> : ++__beg; -<span class="lineNum"> 97 </span> : } -<span class="lineNum"> 98 </span> : _Rep* __r = _Rep::_S_create(__len, size_type(0), __a); -<span class="lineNum"> 99 </span> : _M_copy(__r->_M_refdata(), __buf, __len); -<span class="lineNum"> 100 </span> : try -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span> : while (__beg != __end) -<span class="lineNum"> 103 </span> : { -<span class="lineNum"> 104 </span> : if (__len == __r->_M_capacity) -<span class="lineNum"> 105 </span> : { -<span class="lineNum"> 106 </span> : // Allocate more space. -<span class="lineNum"> 107 </span> : _Rep* __another = _Rep::_S_create(__len + 1, __len, __a); -<span class="lineNum"> 108 </span> : _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len); -<span class="lineNum"> 109 </span> : __r->_M_destroy(__a); -<span class="lineNum"> 110 </span> : __r = __another; -<span class="lineNum"> 111 </span> : } -<span class="lineNum"> 112 </span> : __r->_M_refdata()[__len++] = *__beg; -<span class="lineNum"> 113 </span> : ++__beg; -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span> : } -<span class="lineNum"> 116 </span> : catch(...) -<span class="lineNum"> 117 </span> : { -<span class="lineNum"> 118 </span> : __r->_M_destroy(__a); -<span class="lineNum"> 119 </span> : __throw_exception_again; -<span class="lineNum"> 120 </span> : } -<span class="lineNum"> 121 </span> : __r->_M_set_length_and_sharable(__len); -<span class="lineNum"> 122 </span> : return __r->_M_refdata(); -<span class="lineNum"> 123 </span> : } -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 126 </span> : template <typename _InIterator> -<span class="lineNum"> 127 </span> : _CharT* -<span class="lineNum"> 128 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 129 </span> : _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, -<span class="lineNum"> 130 </span><span class="lineCov"> 1287 : forward_iterator_tag)</span> -<span class="lineNum"> 131 </span> : { -<span class="lineNum"> 132 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 133 </span><span class="lineCov"> 1287 : if (__beg == __end && __a == _Alloc())</span> -<span class="lineNum"> 134 </span><span class="lineNoCov"> 0 : return _S_empty_rep()._M_refdata();</span> -<span class="lineNum"> 135 </span> : #endif -<span class="lineNum"> 136 </span> : // NB: Not required, but considered best practice. -<span class="lineNum"> 137 </span><span class="lineCov"> 1287 : if (__builtin_expect(__gnu_cxx::__is_null_pointer(__beg)</span> -<span class="lineNum"> 138 </span> : && __beg != __end, 0)) -<span class="lineNum"> 139 </span><span class="lineNoCov"> 0 : __throw_logic_error(__N("basic_string::_S_construct NULL not valid"));</span> -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : const size_type __dnew = static_cast<size_type>(std::distance(__beg, -<span class="lineNum"> 142 </span><span class="lineCov"> 1287 : __end));</span> -<span class="lineNum"> 143 </span> : // Check for out_of_range and length_error exceptions. -<span class="lineNum"> 144 </span><span class="lineCov"> 1287 : _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a);</span> -<span class="lineNum"> 145 </span> : try -<span class="lineNum"> 146 </span><span class="lineCov"> 1287 : { _S_copy_chars(__r->_M_refdata(), __beg, __end); }</span> -<span class="lineNum"> 147 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 148 </span> : { -<span class="lineNum"> 149 </span><span class="lineNoCov"> 0 : __r->_M_destroy(__a);</span> -<span class="lineNum"> 150 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 151 </span> : } -<span class="lineNum"> 152 </span><span class="lineCov"> 1287 : __r->_M_set_length_and_sharable(__dnew);</span> -<span class="lineNum"> 153 </span><span class="lineCov"> 1287 : return __r->_M_refdata();</span> -<span class="lineNum"> 154 </span> : } -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 157 </span> : _CharT* -<span class="lineNum"> 158 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 159 </span> : _S_construct(size_type __n, _CharT __c, const _Alloc& __a) -<span class="lineNum"> 160 </span> : { -<span class="lineNum"> 161 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 162 </span> : if (__n == 0 && __a == _Alloc()) -<span class="lineNum"> 163 </span> : return _S_empty_rep()._M_refdata(); -<span class="lineNum"> 164 </span> : #endif -<span class="lineNum"> 165 </span> : // Check for out_of_range and length_error exceptions. -<span class="lineNum"> 166 </span> : _Rep* __r = _Rep::_S_create(__n, size_type(0), __a); -<span class="lineNum"> 167 </span> : if (__n) -<span class="lineNum"> 168 </span> : _M_assign(__r->_M_refdata(), __n, __c); -<span class="lineNum"> 169 </span> : -<span class="lineNum"> 170 </span> : __r->_M_set_length_and_sharable(__n); -<span class="lineNum"> 171 </span> : return __r->_M_refdata(); -<span class="lineNum"> 172 </span> : } -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 175 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 176 </span> : basic_string(const basic_string& __str) -<span class="lineNum"> 177 </span> : : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()), -<span class="lineNum"> 178 </span> : __str.get_allocator()), -<span class="lineNum"> 179 </span> : __str.get_allocator()) -<span class="lineNum"> 180 </span> : { } -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 183 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 184 </span> : basic_string(const _Alloc& __a) -<span class="lineNum"> 185 </span> : : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a) -<span class="lineNum"> 186 </span> : { } -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 189 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 190 </span> : basic_string(const basic_string& __str, size_type __pos, size_type __n) -<span class="lineNum"> 191 </span> : : _M_dataplus(_S_construct(__str._M_data() -<span class="lineNum"> 192 </span> : + __str._M_check(__pos, -<span class="lineNum"> 193 </span> : "basic_string::basic_string"), -<span class="lineNum"> 194 </span> : __str._M_data() + __str._M_limit(__pos, __n) -<span class="lineNum"> 195 </span> : + __pos, _Alloc()), _Alloc()) -<span class="lineNum"> 196 </span> : { } -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 199 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 200 </span> : basic_string(const basic_string& __str, size_type __pos, -<span class="lineNum"> 201 </span> : size_type __n, const _Alloc& __a) -<span class="lineNum"> 202 </span> : : _M_dataplus(_S_construct(__str._M_data() -<span class="lineNum"> 203 </span> : + __str._M_check(__pos, -<span class="lineNum"> 204 </span> : "basic_string::basic_string"), -<span class="lineNum"> 205 </span> : __str._M_data() + __str._M_limit(__pos, __n) -<span class="lineNum"> 206 </span> : + __pos, __a), __a) -<span class="lineNum"> 207 </span> : { } -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : // TBD: DPG annotate -<span class="lineNum"> 210 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 211 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 212 </span> : basic_string(const _CharT* __s, size_type __n, const _Alloc& __a) -<span class="lineNum"> 213 </span> : : _M_dataplus(_S_construct(__s, __s + __n, __a), __a) -<span class="lineNum"> 214 </span> : { } -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : // TBD: DPG annotate -<span class="lineNum"> 217 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 218 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 219 </span> : basic_string(const _CharT* __s, const _Alloc& __a) -<span class="lineNum"> 220 </span> : : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) : -<span class="lineNum"> 221 </span> : __s + npos, __a), __a) -<span class="lineNum"> 222 </span> : { } -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 225 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 226 </span> : basic_string(size_type __n, _CharT __c, const _Alloc& __a) -<span class="lineNum"> 227 </span> : : _M_dataplus(_S_construct(__n, __c, __a), __a) -<span class="lineNum"> 228 </span> : { } -<span class="lineNum"> 229 </span> : -<span class="lineNum"> 230 </span> : // TBD: DPG annotate -<span class="lineNum"> 231 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 232 </span> : template<typename _InputIterator> -<span class="lineNum"> 233 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 234 </span><span class="lineCov"> 1287 : basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a)</span> -<span class="lineNum"> 235 </span><span class="lineCov"> 1287 : : _M_dataplus(_S_construct(__beg, __end, __a), __a)</span> -<span class="lineNum"> 236 </span><span class="lineCov"> 1287 : { }</span> -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 239 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 240 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 241 </span> : assign(const basic_string& __str) -<span class="lineNum"> 242 </span> : { -<span class="lineNum"> 243 </span> : if (_M_rep() != __str._M_rep()) -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : // XXX MT -<span class="lineNum"> 246 </span> : const allocator_type __a = this->get_allocator(); -<span class="lineNum"> 247 </span> : _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator()); -<span class="lineNum"> 248 </span> : _M_rep()->_M_dispose(__a); -<span class="lineNum"> 249 </span> : _M_data(__tmp); -<span class="lineNum"> 250 </span> : } -<span class="lineNum"> 251 </span> : return *this; -<span class="lineNum"> 252 </span> : } -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 255 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 256 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 257 </span> : assign(const _CharT* __s, size_type __n) -<span class="lineNum"> 258 </span> : { -<span class="lineNum"> 259 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 260 </span> : _M_check_length(this->size(), __n, "basic_string::assign"); -<span class="lineNum"> 261 </span> : if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) -<span class="lineNum"> 262 </span> : return _M_replace_safe(size_type(0), this->size(), __s, __n); -<span class="lineNum"> 263 </span> : else -<span class="lineNum"> 264 </span> : { -<span class="lineNum"> 265 </span> : // Work in-place. -<span class="lineNum"> 266 </span> : const size_type __pos = __s - _M_data(); -<span class="lineNum"> 267 </span> : if (__pos >= __n) -<span class="lineNum"> 268 </span> : _M_copy(_M_data(), __s, __n); -<span class="lineNum"> 269 </span> : else if (__pos) -<span class="lineNum"> 270 </span> : _M_move(_M_data(), __s, __n); -<span class="lineNum"> 271 </span> : _M_rep()->_M_set_length_and_sharable(__n); -<span class="lineNum"> 272 </span> : return *this; -<span class="lineNum"> 273 </span> : } -<span class="lineNum"> 274 </span> : } -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 277 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 278 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 279 </span> : append(size_type __n, _CharT __c) -<span class="lineNum"> 280 </span> : { -<span class="lineNum"> 281 </span> : if (__n) -<span class="lineNum"> 282 </span> : { -<span class="lineNum"> 283 </span> : _M_check_length(size_type(0), __n, "basic_string::append"); -<span class="lineNum"> 284 </span> : const size_type __len = __n + this->size(); -<span class="lineNum"> 285 </span> : if (__len > this->capacity() || _M_rep()->_M_is_shared()) -<span class="lineNum"> 286 </span> : this->reserve(__len); -<span class="lineNum"> 287 </span> : _M_assign(_M_data() + this->size(), __n, __c); -<span class="lineNum"> 288 </span> : _M_rep()->_M_set_length_and_sharable(__len); -<span class="lineNum"> 289 </span> : } -<span class="lineNum"> 290 </span> : return *this; -<span class="lineNum"> 291 </span> : } -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 294 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 295 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 296 </span> : append(const _CharT* __s, size_type __n) -<span class="lineNum"> 297 </span> : { -<span class="lineNum"> 298 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 299 </span> : if (__n) -<span class="lineNum"> 300 </span> : { -<span class="lineNum"> 301 </span> : _M_check_length(size_type(0), __n, "basic_string::append"); -<span class="lineNum"> 302 </span> : const size_type __len = __n + this->size(); -<span class="lineNum"> 303 </span> : if (__len > this->capacity() || _M_rep()->_M_is_shared()) -<span class="lineNum"> 304 </span> : { -<span class="lineNum"> 305 </span> : if (_M_disjunct(__s)) -<span class="lineNum"> 306 </span> : this->reserve(__len); -<span class="lineNum"> 307 </span> : else -<span class="lineNum"> 308 </span> : { -<span class="lineNum"> 309 </span> : const size_type __off = __s - _M_data(); -<span class="lineNum"> 310 </span> : this->reserve(__len); -<span class="lineNum"> 311 </span> : __s = _M_data() + __off; -<span class="lineNum"> 312 </span> : } -<span class="lineNum"> 313 </span> : } -<span class="lineNum"> 314 </span> : _M_copy(_M_data() + this->size(), __s, __n); -<span class="lineNum"> 315 </span> : _M_rep()->_M_set_length_and_sharable(__len); -<span class="lineNum"> 316 </span> : } -<span class="lineNum"> 317 </span> : return *this; -<span class="lineNum"> 318 </span> : } -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 321 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 322 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 323 </span> : append(const basic_string& __str) -<span class="lineNum"> 324 </span> : { -<span class="lineNum"> 325 </span> : const size_type __size = __str.size(); -<span class="lineNum"> 326 </span> : if (__size) -<span class="lineNum"> 327 </span> : { -<span class="lineNum"> 328 </span> : const size_type __len = __size + this->size(); -<span class="lineNum"> 329 </span> : if (__len > this->capacity() || _M_rep()->_M_is_shared()) -<span class="lineNum"> 330 </span> : this->reserve(__len); -<span class="lineNum"> 331 </span> : _M_copy(_M_data() + this->size(), __str._M_data(), __size); -<span class="lineNum"> 332 </span> : _M_rep()->_M_set_length_and_sharable(__len); -<span class="lineNum"> 333 </span> : } -<span class="lineNum"> 334 </span> : return *this; -<span class="lineNum"> 335 </span> : } -<span class="lineNum"> 336 </span> : -<span class="lineNum"> 337 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 338 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 339 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 340 </span> : append(const basic_string& __str, size_type __pos, size_type __n) -<span class="lineNum"> 341 </span> : { -<span class="lineNum"> 342 </span> : __str._M_check(__pos, "basic_string::append"); -<span class="lineNum"> 343 </span> : __n = __str._M_limit(__pos, __n); -<span class="lineNum"> 344 </span> : if (__n) -<span class="lineNum"> 345 </span> : { -<span class="lineNum"> 346 </span> : const size_type __len = __n + this->size(); -<span class="lineNum"> 347 </span> : if (__len > this->capacity() || _M_rep()->_M_is_shared()) -<span class="lineNum"> 348 </span> : this->reserve(__len); -<span class="lineNum"> 349 </span> : _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n); -<span class="lineNum"> 350 </span> : _M_rep()->_M_set_length_and_sharable(__len); -<span class="lineNum"> 351 </span> : } -<span class="lineNum"> 352 </span> : return *this; -<span class="lineNum"> 353 </span> : } -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 356 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 357 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 358 </span> : insert(size_type __pos, const _CharT* __s, size_type __n) -<span class="lineNum"> 359 </span> : { -<span class="lineNum"> 360 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 361 </span> : _M_check(__pos, "basic_string::insert"); -<span class="lineNum"> 362 </span> : _M_check_length(size_type(0), __n, "basic_string::insert"); -<span class="lineNum"> 363 </span> : if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) -<span class="lineNum"> 364 </span> : return _M_replace_safe(__pos, size_type(0), __s, __n); -<span class="lineNum"> 365 </span> : else -<span class="lineNum"> 366 </span> : { -<span class="lineNum"> 367 </span> : // Work in-place. -<span class="lineNum"> 368 </span> : const size_type __off = __s - _M_data(); -<span class="lineNum"> 369 </span> : _M_mutate(__pos, 0, __n); -<span class="lineNum"> 370 </span> : __s = _M_data() + __off; -<span class="lineNum"> 371 </span> : _CharT* __p = _M_data() + __pos; -<span class="lineNum"> 372 </span> : if (__s + __n <= __p) -<span class="lineNum"> 373 </span> : _M_copy(__p, __s, __n); -<span class="lineNum"> 374 </span> : else if (__s >= __p) -<span class="lineNum"> 375 </span> : _M_copy(__p, __s + __n, __n); -<span class="lineNum"> 376 </span> : else -<span class="lineNum"> 377 </span> : { -<span class="lineNum"> 378 </span> : const size_type __nleft = __p - __s; -<span class="lineNum"> 379 </span> : _M_copy(__p, __s, __nleft); -<span class="lineNum"> 380 </span> : _M_copy(__p + __nleft, __p + __n, __n - __nleft); -<span class="lineNum"> 381 </span> : } -<span class="lineNum"> 382 </span> : return *this; -<span class="lineNum"> 383 </span> : } -<span class="lineNum"> 384 </span> : } -<span class="lineNum"> 385 </span> : -<span class="lineNum"> 386 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 387 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 388 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 389 </span> : replace(size_type __pos, size_type __n1, const _CharT* __s, -<span class="lineNum"> 390 </span> : size_type __n2) -<span class="lineNum"> 391 </span> : { -<span class="lineNum"> 392 </span> : __glibcxx_requires_string_len(__s, __n2); -<span class="lineNum"> 393 </span> : _M_check(__pos, "basic_string::replace"); -<span class="lineNum"> 394 </span> : __n1 = _M_limit(__pos, __n1); -<span class="lineNum"> 395 </span> : _M_check_length(__n1, __n2, "basic_string::replace"); -<span class="lineNum"> 396 </span> : bool __left; -<span class="lineNum"> 397 </span> : if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) -<span class="lineNum"> 398 </span> : return _M_replace_safe(__pos, __n1, __s, __n2); -<span class="lineNum"> 399 </span> : else if ((__left = __s + __n2 <= _M_data() + __pos) -<span class="lineNum"> 400 </span> : || _M_data() + __pos + __n1 <= __s) -<span class="lineNum"> 401 </span> : { -<span class="lineNum"> 402 </span> : // Work in-place: non-overlapping case. -<span class="lineNum"> 403 </span> : size_type __off = __s - _M_data(); -<span class="lineNum"> 404 </span> : __left ? __off : (__off += __n2 - __n1); -<span class="lineNum"> 405 </span> : _M_mutate(__pos, __n1, __n2); -<span class="lineNum"> 406 </span> : _M_copy(_M_data() + __pos, _M_data() + __off, __n2); -<span class="lineNum"> 407 </span> : return *this; -<span class="lineNum"> 408 </span> : } -<span class="lineNum"> 409 </span> : else -<span class="lineNum"> 410 </span> : { -<span class="lineNum"> 411 </span> : // Todo: overlapping case. -<span class="lineNum"> 412 </span> : const basic_string __tmp(__s, __n2); -<span class="lineNum"> 413 </span> : return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2); -<span class="lineNum"> 414 </span> : } -<span class="lineNum"> 415 </span> : } -<span class="lineNum"> 416 </span> : -<span class="lineNum"> 417 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 418 </span> : void -<span class="lineNum"> 419 </span> : basic_string<_CharT, _Traits, _Alloc>::_Rep:: -<span class="lineNum"> 420 </span> : _M_destroy(const _Alloc& __a) throw () -<span class="lineNum"> 421 </span> : { -<span class="lineNum"> 422 </span> : const size_type __size = sizeof(_Rep_base) + -<span class="lineNum"> 423 </span> : (this->_M_capacity + 1) * sizeof(_CharT); -<span class="lineNum"> 424 </span> : _Raw_bytes_alloc(__a).deallocate(reinterpret_cast<char*>(this), __size); -<span class="lineNum"> 425 </span> : } -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 428 </span> : void -<span class="lineNum"> 429 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 430 </span> : _M_leak_hard() -<span class="lineNum"> 431 </span> : { -<span class="lineNum"> 432 </span> : #ifndef _GLIBCXX_FULLY_DYNAMIC_STRING -<span class="lineNum"> 433 </span> : if (_M_rep() == &_S_empty_rep()) -<span class="lineNum"> 434 </span> : return; -<span class="lineNum"> 435 </span> : #endif -<span class="lineNum"> 436 </span> : if (_M_rep()->_M_is_shared()) -<span class="lineNum"> 437 </span> : _M_mutate(0, 0, 0); -<span class="lineNum"> 438 </span> : _M_rep()->_M_set_leaked(); -<span class="lineNum"> 439 </span> : } -<span class="lineNum"> 440 </span> : -<span class="lineNum"> 441 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 442 </span> : void -<span class="lineNum"> 443 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 444 </span> : _M_mutate(size_type __pos, size_type __len1, size_type __len2) -<span class="lineNum"> 445 </span> : { -<span class="lineNum"> 446 </span> : const size_type __old_size = this->size(); -<span class="lineNum"> 447 </span> : const size_type __new_size = __old_size + __len2 - __len1; -<span class="lineNum"> 448 </span> : const size_type __how_much = __old_size - __pos - __len1; -<span class="lineNum"> 449 </span> : -<span class="lineNum"> 450 </span> : if (__new_size > this->capacity() || _M_rep()->_M_is_shared()) -<span class="lineNum"> 451 </span> : { -<span class="lineNum"> 452 </span> : // Must reallocate. -<span class="lineNum"> 453 </span> : const allocator_type __a = get_allocator(); -<span class="lineNum"> 454 </span> : _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a); -<span class="lineNum"> 455 </span> : -<span class="lineNum"> 456 </span> : if (__pos) -<span class="lineNum"> 457 </span> : _M_copy(__r->_M_refdata(), _M_data(), __pos); -<span class="lineNum"> 458 </span> : if (__how_much) -<span class="lineNum"> 459 </span> : _M_copy(__r->_M_refdata() + __pos + __len2, -<span class="lineNum"> 460 </span> : _M_data() + __pos + __len1, __how_much); -<span class="lineNum"> 461 </span> : -<span class="lineNum"> 462 </span> : _M_rep()->_M_dispose(__a); -<span class="lineNum"> 463 </span> : _M_data(__r->_M_refdata()); -<span class="lineNum"> 464 </span> : } -<span class="lineNum"> 465 </span> : else if (__how_much && __len1 != __len2) -<span class="lineNum"> 466 </span> : { -<span class="lineNum"> 467 </span> : // Work in-place. -<span class="lineNum"> 468 </span> : _M_move(_M_data() + __pos + __len2, -<span class="lineNum"> 469 </span> : _M_data() + __pos + __len1, __how_much); -<span class="lineNum"> 470 </span> : } -<span class="lineNum"> 471 </span> : _M_rep()->_M_set_length_and_sharable(__new_size); -<span class="lineNum"> 472 </span> : } -<span class="lineNum"> 473 </span> : -<span class="lineNum"> 474 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 475 </span> : void -<span class="lineNum"> 476 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 477 </span> : reserve(size_type __res) -<span class="lineNum"> 478 </span> : { -<span class="lineNum"> 479 </span> : if (__res != this->capacity() || _M_rep()->_M_is_shared()) -<span class="lineNum"> 480 </span> : { -<span class="lineNum"> 481 </span> : // Make sure we don't shrink below the current size -<span class="lineNum"> 482 </span> : if (__res < this->size()) -<span class="lineNum"> 483 </span> : __res = this->size(); -<span class="lineNum"> 484 </span> : const allocator_type __a = get_allocator(); -<span class="lineNum"> 485 </span> : _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size()); -<span class="lineNum"> 486 </span> : _M_rep()->_M_dispose(__a); -<span class="lineNum"> 487 </span> : _M_data(__tmp); -<span class="lineNum"> 488 </span> : } -<span class="lineNum"> 489 </span> : } -<span class="lineNum"> 490 </span> : -<span class="lineNum"> 491 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 492 </span> : void -<span class="lineNum"> 493 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 494 </span> : swap(basic_string& __s) -<span class="lineNum"> 495 </span> : { -<span class="lineNum"> 496 </span> : if (_M_rep()->_M_is_leaked()) -<span class="lineNum"> 497 </span> : _M_rep()->_M_set_sharable(); -<span class="lineNum"> 498 </span> : if (__s._M_rep()->_M_is_leaked()) -<span class="lineNum"> 499 </span> : __s._M_rep()->_M_set_sharable(); -<span class="lineNum"> 500 </span> : if (this->get_allocator() == __s.get_allocator()) -<span class="lineNum"> 501 </span> : { -<span class="lineNum"> 502 </span> : _CharT* __tmp = _M_data(); -<span class="lineNum"> 503 </span> : _M_data(__s._M_data()); -<span class="lineNum"> 504 </span> : __s._M_data(__tmp); -<span class="lineNum"> 505 </span> : } -<span class="lineNum"> 506 </span> : // The code below can usually be optimized away. -<span class="lineNum"> 507 </span> : else -<span class="lineNum"> 508 </span> : { -<span class="lineNum"> 509 </span> : const basic_string __tmp1(_M_ibegin(), _M_iend(), -<span class="lineNum"> 510 </span> : __s.get_allocator()); -<span class="lineNum"> 511 </span> : const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(), -<span class="lineNum"> 512 </span> : this->get_allocator()); -<span class="lineNum"> 513 </span> : *this = __tmp2; -<span class="lineNum"> 514 </span> : __s = __tmp1; -<span class="lineNum"> 515 </span> : } -<span class="lineNum"> 516 </span> : } -<span class="lineNum"> 517 </span> : -<span class="lineNum"> 518 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 519 </span> : typename basic_string<_CharT, _Traits, _Alloc>::_Rep* -<span class="lineNum"> 520 </span> : basic_string<_CharT, _Traits, _Alloc>::_Rep:: -<span class="lineNum"> 521 </span> : _S_create(size_type __capacity, size_type __old_capacity, -<span class="lineNum"> 522 </span> : const _Alloc& __alloc) -<span class="lineNum"> 523 </span> : { -<span class="lineNum"> 524 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 525 </span> : // 83. String::npos vs. string::max_size() -<span class="lineNum"> 526 </span> : if (__capacity > _S_max_size) -<span class="lineNum"> 527 </span> : __throw_length_error(__N("basic_string::_S_create")); -<span class="lineNum"> 528 </span> : -<span class="lineNum"> 529 </span> : // The standard places no restriction on allocating more memory -<span class="lineNum"> 530 </span> : // than is strictly needed within this layer at the moment or as -<span class="lineNum"> 531 </span> : // requested by an explicit application call to reserve(). -<span class="lineNum"> 532 </span> : -<span class="lineNum"> 533 </span> : // Many malloc implementations perform quite poorly when an -<span class="lineNum"> 534 </span> : // application attempts to allocate memory in a stepwise fashion -<span class="lineNum"> 535 </span> : // growing each allocation size by only 1 char. Additionally, -<span class="lineNum"> 536 </span> : // it makes little sense to allocate less linear memory than the -<span class="lineNum"> 537 </span> : // natural blocking size of the malloc implementation. -<span class="lineNum"> 538 </span> : // Unfortunately, we would need a somewhat low-level calculation -<span class="lineNum"> 539 </span> : // with tuned parameters to get this perfect for any particular -<span class="lineNum"> 540 </span> : // malloc implementation. Fortunately, generalizations about -<span class="lineNum"> 541 </span> : // common features seen among implementations seems to suffice. -<span class="lineNum"> 542 </span> : -<span class="lineNum"> 543 </span> : // __pagesize need not match the actual VM page size for good -<span class="lineNum"> 544 </span> : // results in practice, thus we pick a common value on the low -<span class="lineNum"> 545 </span> : // side. __malloc_header_size is an estimate of the amount of -<span class="lineNum"> 546 </span> : // overhead per memory allocation (in practice seen N * sizeof -<span class="lineNum"> 547 </span> : // (void*) where N is 0, 2 or 4). According to folklore, -<span class="lineNum"> 548 </span> : // picking this value on the high side is better than -<span class="lineNum"> 549 </span> : // low-balling it (especially when this algorithm is used with -<span class="lineNum"> 550 </span> : // malloc implementations that allocate memory blocks rounded up -<span class="lineNum"> 551 </span> : // to a size which is a power of 2). -<span class="lineNum"> 552 </span> : const size_type __pagesize = 4096; -<span class="lineNum"> 553 </span> : const size_type __malloc_header_size = 4 * sizeof(void*); -<span class="lineNum"> 554 </span> : -<span class="lineNum"> 555 </span> : // The below implements an exponential growth policy, necessary to -<span class="lineNum"> 556 </span> : // meet amortized linear time requirements of the library: see -<span class="lineNum"> 557 </span> : // http://gcc.gnu.org/ml/libstdc++/2001-07/msg00085.html. -<span class="lineNum"> 558 </span> : // It's active for allocations requiring an amount of memory above -<span class="lineNum"> 559 </span> : // system pagesize. This is consistent with the requirements of the -<span class="lineNum"> 560 </span> : // standard: http://gcc.gnu.org/ml/libstdc++/2001-07/msg00130.html -<span class="lineNum"> 561 </span> : if (__capacity > __old_capacity && __capacity < 2 * __old_capacity) -<span class="lineNum"> 562 </span> : __capacity = 2 * __old_capacity; -<span class="lineNum"> 563 </span> : -<span class="lineNum"> 564 </span> : // NB: Need an array of char_type[__capacity], plus a terminating -<span class="lineNum"> 565 </span> : // null char_type() element, plus enough for the _Rep data structure. -<span class="lineNum"> 566 </span> : // Whew. Seemingly so needy, yet so elemental. -<span class="lineNum"> 567 </span> : size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); -<span class="lineNum"> 568 </span> : -<span class="lineNum"> 569 </span> : const size_type __adj_size = __size + __malloc_header_size; -<span class="lineNum"> 570 </span> : if (__adj_size > __pagesize && __capacity > __old_capacity) -<span class="lineNum"> 571 </span> : { -<span class="lineNum"> 572 </span> : const size_type __extra = __pagesize - __adj_size % __pagesize; -<span class="lineNum"> 573 </span> : __capacity += __extra / sizeof(_CharT); -<span class="lineNum"> 574 </span> : // Never allocate a string bigger than _S_max_size. -<span class="lineNum"> 575 </span> : if (__capacity > _S_max_size) -<span class="lineNum"> 576 </span> : __capacity = _S_max_size; -<span class="lineNum"> 577 </span> : __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); -<span class="lineNum"> 578 </span> : } -<span class="lineNum"> 579 </span> : -<span class="lineNum"> 580 </span> : // NB: Might throw, but no worries about a leak, mate: _Rep() -<span class="lineNum"> 581 </span> : // does not throw. -<span class="lineNum"> 582 </span> : void* __place = _Raw_bytes_alloc(__alloc).allocate(__size); -<span class="lineNum"> 583 </span> : _Rep *__p = new (__place) _Rep; -<span class="lineNum"> 584 </span> : __p->_M_capacity = __capacity; -<span class="lineNum"> 585 </span> : // ABI compatibility - 3.4.x set in _S_create both -<span class="lineNum"> 586 </span> : // _M_refcount and _M_length. All callers of _S_create -<span class="lineNum"> 587 </span> : // in basic_string.tcc then set just _M_length. -<span class="lineNum"> 588 </span> : // In 4.0.x and later both _M_refcount and _M_length -<span class="lineNum"> 589 </span> : // are initialized in the callers, unfortunately we can -<span class="lineNum"> 590 </span> : // have 3.4.x compiled code with _S_create callers inlined -<span class="lineNum"> 591 </span> : // calling 4.0.x+ _S_create. -<span class="lineNum"> 592 </span> : __p->_M_set_sharable(); -<span class="lineNum"> 593 </span> : return __p; -<span class="lineNum"> 594 </span> : } -<span class="lineNum"> 595 </span> : -<span class="lineNum"> 596 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 597 </span> : _CharT* -<span class="lineNum"> 598 </span> : basic_string<_CharT, _Traits, _Alloc>::_Rep:: -<span class="lineNum"> 599 </span> : _M_clone(const _Alloc& __alloc, size_type __res) -<span class="lineNum"> 600 </span> : { -<span class="lineNum"> 601 </span> : // Requested capacity of the clone. -<span class="lineNum"> 602 </span> : const size_type __requested_cap = this->_M_length + __res; -<span class="lineNum"> 603 </span> : _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity, -<span class="lineNum"> 604 </span> : __alloc); -<span class="lineNum"> 605 </span> : if (this->_M_length) -<span class="lineNum"> 606 </span> : _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length); -<span class="lineNum"> 607 </span> : -<span class="lineNum"> 608 </span> : __r->_M_set_length_and_sharable(this->_M_length); -<span class="lineNum"> 609 </span> : return __r->_M_refdata(); -<span class="lineNum"> 610 </span> : } -<span class="lineNum"> 611 </span> : -<span class="lineNum"> 612 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 613 </span> : void -<span class="lineNum"> 614 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 615 </span> : resize(size_type __n, _CharT __c) -<span class="lineNum"> 616 </span> : { -<span class="lineNum"> 617 </span> : const size_type __size = this->size(); -<span class="lineNum"> 618 </span> : _M_check_length(__size, __n, "basic_string::resize"); -<span class="lineNum"> 619 </span> : if (__size < __n) -<span class="lineNum"> 620 </span> : this->append(__n - __size, __c); -<span class="lineNum"> 621 </span> : else if (__n < __size) -<span class="lineNum"> 622 </span> : this->erase(__n); -<span class="lineNum"> 623 </span> : // else nothing (in particular, avoid calling _M_mutate() unnecessarily.) -<span class="lineNum"> 624 </span> : } -<span class="lineNum"> 625 </span> : -<span class="lineNum"> 626 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 627 </span> : template<typename _InputIterator> -<span class="lineNum"> 628 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 629 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 630 </span> : _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, -<span class="lineNum"> 631 </span> : _InputIterator __k2, __false_type) -<span class="lineNum"> 632 </span> : { -<span class="lineNum"> 633 </span> : const basic_string __s(__k1, __k2); -<span class="lineNum"> 634 </span> : const size_type __n1 = __i2 - __i1; -<span class="lineNum"> 635 </span> : _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch"); -<span class="lineNum"> 636 </span> : return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(), -<span class="lineNum"> 637 </span> : __s.size()); -<span class="lineNum"> 638 </span> : } -<span class="lineNum"> 639 </span> : -<span class="lineNum"> 640 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 641 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 642 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 643 </span> : _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, -<span class="lineNum"> 644 </span> : _CharT __c) -<span class="lineNum"> 645 </span> : { -<span class="lineNum"> 646 </span> : _M_check_length(__n1, __n2, "basic_string::_M_replace_aux"); -<span class="lineNum"> 647 </span> : _M_mutate(__pos1, __n1, __n2); -<span class="lineNum"> 648 </span> : if (__n2) -<span class="lineNum"> 649 </span> : _M_assign(_M_data() + __pos1, __n2, __c); -<span class="lineNum"> 650 </span> : return *this; -<span class="lineNum"> 651 </span> : } -<span class="lineNum"> 652 </span> : -<span class="lineNum"> 653 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 654 </span> : basic_string<_CharT, _Traits, _Alloc>& -<span class="lineNum"> 655 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 656 </span> : _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, -<span class="lineNum"> 657 </span> : size_type __n2) -<span class="lineNum"> 658 </span> : { -<span class="lineNum"> 659 </span> : _M_mutate(__pos1, __n1, __n2); -<span class="lineNum"> 660 </span> : if (__n2) -<span class="lineNum"> 661 </span> : _M_copy(_M_data() + __pos1, __s, __n2); -<span class="lineNum"> 662 </span> : return *this; -<span class="lineNum"> 663 </span> : } -<span class="lineNum"> 664 </span> : -<span class="lineNum"> 665 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 666 </span> : basic_string<_CharT, _Traits, _Alloc> -<span class="lineNum"> 667 </span> : operator+(const _CharT* __lhs, -<span class="lineNum"> 668 </span><span class="lineCov"> 2633 : const basic_string<_CharT, _Traits, _Alloc>& __rhs)</span> -<span class="lineNum"> 669 </span> : { -<span class="lineNum"> 670 </span> : __glibcxx_requires_string(__lhs); -<span class="lineNum"> 671 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 672 </span> : typedef typename __string_type::size_type __size_type; -<span class="lineNum"> 673 </span><span class="lineCov"> 2633 : const __size_type __len = _Traits::length(__lhs);</span> -<span class="lineNum"> 674 </span><span class="lineCov"> 2633 : __string_type __str;</span> -<span class="lineNum"> 675 </span><span class="lineCov"> 2633 : __str.reserve(__len + __rhs.size());</span> -<span class="lineNum"> 676 </span><span class="lineCov"> 2633 : __str.append(__lhs, __len);</span> -<span class="lineNum"> 677 </span><span class="lineCov"> 2633 : __str.append(__rhs);</span> -<span class="lineNum"> 678 </span><span class="lineNoCov"> 0 : return __str;</span> -<span class="lineNum"> 679 </span> : } -<span class="lineNum"> 680 </span> : -<span class="lineNum"> 681 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 682 </span> : basic_string<_CharT, _Traits, _Alloc> -<span class="lineNum"> 683 </span> : operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) -<span class="lineNum"> 684 </span> : { -<span class="lineNum"> 685 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 686 </span> : typedef typename __string_type::size_type __size_type; -<span class="lineNum"> 687 </span> : __string_type __str; -<span class="lineNum"> 688 </span> : const __size_type __len = __rhs.size(); -<span class="lineNum"> 689 </span> : __str.reserve(__len + 1); -<span class="lineNum"> 690 </span> : __str.append(__size_type(1), __lhs); -<span class="lineNum"> 691 </span> : __str.append(__rhs); -<span class="lineNum"> 692 </span> : return __str; -<span class="lineNum"> 693 </span> : } -<span class="lineNum"> 694 </span> : -<span class="lineNum"> 695 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 696 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 697 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 698 </span> : copy(_CharT* __s, size_type __n, size_type __pos) const -<span class="lineNum"> 699 </span> : { -<span class="lineNum"> 700 </span> : _M_check(__pos, "basic_string::copy"); -<span class="lineNum"> 701 </span> : __n = _M_limit(__pos, __n); -<span class="lineNum"> 702 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 703 </span> : if (__n) -<span class="lineNum"> 704 </span> : _M_copy(__s, _M_data() + __pos, __n); -<span class="lineNum"> 705 </span> : // 21.3.5.7 par 3: do not append null. (good.) -<span class="lineNum"> 706 </span> : return __n; -<span class="lineNum"> 707 </span> : } -<span class="lineNum"> 708 </span> : -<span class="lineNum"> 709 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 710 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 711 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 712 </span> : find(const _CharT* __s, size_type __pos, size_type __n) const -<span class="lineNum"> 713 </span> : { -<span class="lineNum"> 714 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 715 </span> : const size_type __size = this->size(); -<span class="lineNum"> 716 </span> : const _CharT* __data = _M_data(); -<span class="lineNum"> 717 </span> : -<span class="lineNum"> 718 </span> : if (__n == 0) -<span class="lineNum"> 719 </span> : return __pos <= __size ? __pos : npos; -<span class="lineNum"> 720 </span> : -<span class="lineNum"> 721 </span> : if (__n <= __size) -<span class="lineNum"> 722 </span> : { -<span class="lineNum"> 723 </span> : for (; __pos <= __size - __n; ++__pos) -<span class="lineNum"> 724 </span> : if (traits_type::eq(__data[__pos], __s[0]) -<span class="lineNum"> 725 </span> : && traits_type::compare(__data + __pos + 1, -<span class="lineNum"> 726 </span> : __s + 1, __n - 1) == 0) -<span class="lineNum"> 727 </span> : return __pos; -<span class="lineNum"> 728 </span> : } -<span class="lineNum"> 729 </span> : return npos; -<span class="lineNum"> 730 </span> : } -<span class="lineNum"> 731 </span> : -<span class="lineNum"> 732 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 733 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 734 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 735 </span> : find(_CharT __c, size_type __pos) const -<span class="lineNum"> 736 </span> : { -<span class="lineNum"> 737 </span> : size_type __ret = npos; -<span class="lineNum"> 738 </span> : const size_type __size = this->size(); -<span class="lineNum"> 739 </span> : if (__pos < __size) -<span class="lineNum"> 740 </span> : { -<span class="lineNum"> 741 </span> : const _CharT* __data = _M_data(); -<span class="lineNum"> 742 </span> : const size_type __n = __size - __pos; -<span class="lineNum"> 743 </span> : const _CharT* __p = traits_type::find(__data + __pos, __n, __c); -<span class="lineNum"> 744 </span> : if (__p) -<span class="lineNum"> 745 </span> : __ret = __p - __data; -<span class="lineNum"> 746 </span> : } -<span class="lineNum"> 747 </span> : return __ret; -<span class="lineNum"> 748 </span> : } -<span class="lineNum"> 749 </span> : -<span class="lineNum"> 750 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 751 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 752 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 753 </span> : rfind(const _CharT* __s, size_type __pos, size_type __n) const -<span class="lineNum"> 754 </span> : { -<span class="lineNum"> 755 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 756 </span> : const size_type __size = this->size(); -<span class="lineNum"> 757 </span> : if (__n <= __size) -<span class="lineNum"> 758 </span> : { -<span class="lineNum"> 759 </span> : __pos = std::min(size_type(__size - __n), __pos); -<span class="lineNum"> 760 </span> : const _CharT* __data = _M_data(); -<span class="lineNum"> 761 </span> : do -<span class="lineNum"> 762 </span> : { -<span class="lineNum"> 763 </span> : if (traits_type::compare(__data + __pos, __s, __n) == 0) -<span class="lineNum"> 764 </span> : return __pos; -<span class="lineNum"> 765 </span> : } -<span class="lineNum"> 766 </span> : while (__pos-- > 0); -<span class="lineNum"> 767 </span> : } -<span class="lineNum"> 768 </span> : return npos; -<span class="lineNum"> 769 </span> : } -<span class="lineNum"> 770 </span> : -<span class="lineNum"> 771 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 772 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 773 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 774 </span> : rfind(_CharT __c, size_type __pos) const -<span class="lineNum"> 775 </span> : { -<span class="lineNum"> 776 </span> : size_type __size = this->size(); -<span class="lineNum"> 777 </span> : if (__size) -<span class="lineNum"> 778 </span> : { -<span class="lineNum"> 779 </span> : if (--__size > __pos) -<span class="lineNum"> 780 </span> : __size = __pos; -<span class="lineNum"> 781 </span> : for (++__size; __size-- > 0; ) -<span class="lineNum"> 782 </span> : if (traits_type::eq(_M_data()[__size], __c)) -<span class="lineNum"> 783 </span> : return __size; -<span class="lineNum"> 784 </span> : } -<span class="lineNum"> 785 </span> : return npos; -<span class="lineNum"> 786 </span> : } -<span class="lineNum"> 787 </span> : -<span class="lineNum"> 788 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 789 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 790 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 791 </span> : find_first_of(const _CharT* __s, size_type __pos, size_type __n) const -<span class="lineNum"> 792 </span> : { -<span class="lineNum"> 793 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 794 </span> : for (; __n && __pos < this->size(); ++__pos) -<span class="lineNum"> 795 </span> : { -<span class="lineNum"> 796 </span> : const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]); -<span class="lineNum"> 797 </span> : if (__p) -<span class="lineNum"> 798 </span> : return __pos; -<span class="lineNum"> 799 </span> : } -<span class="lineNum"> 800 </span> : return npos; -<span class="lineNum"> 801 </span> : } -<span class="lineNum"> 802 </span> : -<span class="lineNum"> 803 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 804 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 805 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 806 </span> : find_last_of(const _CharT* __s, size_type __pos, size_type __n) const -<span class="lineNum"> 807 </span> : { -<span class="lineNum"> 808 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 809 </span> : size_type __size = this->size(); -<span class="lineNum"> 810 </span> : if (__size && __n) -<span class="lineNum"> 811 </span> : { -<span class="lineNum"> 812 </span> : if (--__size > __pos) -<span class="lineNum"> 813 </span> : __size = __pos; -<span class="lineNum"> 814 </span> : do -<span class="lineNum"> 815 </span> : { -<span class="lineNum"> 816 </span> : if (traits_type::find(__s, __n, _M_data()[__size])) -<span class="lineNum"> 817 </span> : return __size; -<span class="lineNum"> 818 </span> : } -<span class="lineNum"> 819 </span> : while (__size-- != 0); -<span class="lineNum"> 820 </span> : } -<span class="lineNum"> 821 </span> : return npos; -<span class="lineNum"> 822 </span> : } -<span class="lineNum"> 823 </span> : -<span class="lineNum"> 824 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 825 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 826 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 827 </span> : find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const -<span class="lineNum"> 828 </span> : { -<span class="lineNum"> 829 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 830 </span> : for (; __pos < this->size(); ++__pos) -<span class="lineNum"> 831 </span> : if (!traits_type::find(__s, __n, _M_data()[__pos])) -<span class="lineNum"> 832 </span> : return __pos; -<span class="lineNum"> 833 </span> : return npos; -<span class="lineNum"> 834 </span> : } -<span class="lineNum"> 835 </span> : -<span class="lineNum"> 836 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 837 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 838 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 839 </span> : find_first_not_of(_CharT __c, size_type __pos) const -<span class="lineNum"> 840 </span> : { -<span class="lineNum"> 841 </span> : for (; __pos < this->size(); ++__pos) -<span class="lineNum"> 842 </span> : if (!traits_type::eq(_M_data()[__pos], __c)) -<span class="lineNum"> 843 </span> : return __pos; -<span class="lineNum"> 844 </span> : return npos; -<span class="lineNum"> 845 </span> : } -<span class="lineNum"> 846 </span> : -<span class="lineNum"> 847 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 848 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 849 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 850 </span> : find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const -<span class="lineNum"> 851 </span> : { -<span class="lineNum"> 852 </span> : __glibcxx_requires_string_len(__s, __n); -<span class="lineNum"> 853 </span> : size_type __size = this->size(); -<span class="lineNum"> 854 </span> : if (__size) -<span class="lineNum"> 855 </span> : { -<span class="lineNum"> 856 </span> : if (--__size > __pos) -<span class="lineNum"> 857 </span> : __size = __pos; -<span class="lineNum"> 858 </span> : do -<span class="lineNum"> 859 </span> : { -<span class="lineNum"> 860 </span> : if (!traits_type::find(__s, __n, _M_data()[__size])) -<span class="lineNum"> 861 </span> : return __size; -<span class="lineNum"> 862 </span> : } -<span class="lineNum"> 863 </span> : while (__size--); -<span class="lineNum"> 864 </span> : } -<span class="lineNum"> 865 </span> : return npos; -<span class="lineNum"> 866 </span> : } -<span class="lineNum"> 867 </span> : -<span class="lineNum"> 868 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 869 </span> : typename basic_string<_CharT, _Traits, _Alloc>::size_type -<span class="lineNum"> 870 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 871 </span> : find_last_not_of(_CharT __c, size_type __pos) const -<span class="lineNum"> 872 </span> : { -<span class="lineNum"> 873 </span> : size_type __size = this->size(); -<span class="lineNum"> 874 </span> : if (__size) -<span class="lineNum"> 875 </span> : { -<span class="lineNum"> 876 </span> : if (--__size > __pos) -<span class="lineNum"> 877 </span> : __size = __pos; -<span class="lineNum"> 878 </span> : do -<span class="lineNum"> 879 </span> : { -<span class="lineNum"> 880 </span> : if (!traits_type::eq(_M_data()[__size], __c)) -<span class="lineNum"> 881 </span> : return __size; -<span class="lineNum"> 882 </span> : } -<span class="lineNum"> 883 </span> : while (__size--); -<span class="lineNum"> 884 </span> : } -<span class="lineNum"> 885 </span> : return npos; -<span class="lineNum"> 886 </span> : } -<span class="lineNum"> 887 </span> : -<span class="lineNum"> 888 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 889 </span> : int -<span class="lineNum"> 890 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 891 </span> : compare(size_type __pos, size_type __n, const basic_string& __str) const -<span class="lineNum"> 892 </span> : { -<span class="lineNum"> 893 </span> : _M_check(__pos, "basic_string::compare"); -<span class="lineNum"> 894 </span> : __n = _M_limit(__pos, __n); -<span class="lineNum"> 895 </span> : const size_type __osize = __str.size(); -<span class="lineNum"> 896 </span> : const size_type __len = std::min(__n, __osize); -<span class="lineNum"> 897 </span> : int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len); -<span class="lineNum"> 898 </span> : if (!__r) -<span class="lineNum"> 899 </span> : __r = _S_compare(__n, __osize); -<span class="lineNum"> 900 </span> : return __r; -<span class="lineNum"> 901 </span> : } -<span class="lineNum"> 902 </span> : -<span class="lineNum"> 903 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 904 </span> : int -<span class="lineNum"> 905 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 906 </span> : compare(size_type __pos1, size_type __n1, const basic_string& __str, -<span class="lineNum"> 907 </span> : size_type __pos2, size_type __n2) const -<span class="lineNum"> 908 </span> : { -<span class="lineNum"> 909 </span> : _M_check(__pos1, "basic_string::compare"); -<span class="lineNum"> 910 </span> : __str._M_check(__pos2, "basic_string::compare"); -<span class="lineNum"> 911 </span> : __n1 = _M_limit(__pos1, __n1); -<span class="lineNum"> 912 </span> : __n2 = __str._M_limit(__pos2, __n2); -<span class="lineNum"> 913 </span> : const size_type __len = std::min(__n1, __n2); -<span class="lineNum"> 914 </span> : int __r = traits_type::compare(_M_data() + __pos1, -<span class="lineNum"> 915 </span> : __str.data() + __pos2, __len); -<span class="lineNum"> 916 </span> : if (!__r) -<span class="lineNum"> 917 </span> : __r = _S_compare(__n1, __n2); -<span class="lineNum"> 918 </span> : return __r; -<span class="lineNum"> 919 </span> : } -<span class="lineNum"> 920 </span> : -<span class="lineNum"> 921 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 922 </span> : int -<span class="lineNum"> 923 </span> : basic_string<_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 924 </span> : compare(const _CharT* __s) const -<span class="lineNum"> 925 </span> : { -<span class="lineNum"> 926 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 927 </span> : const size_type __size = this->size(); -<span class="lineNum"> 928 </span> : const size_type __osize = traits_type::length(__s); -<span class="lineNum"> 929 </span> : const size_type __len = std::min(__size, __osize); -<span class="lineNum"> 930 </span> : int __r = traits_type::compare(_M_data(), __s, __len); -<span class="lineNum"> 931 </span> : if (!__r) -<span class="lineNum"> 932 </span> : __r = _S_compare(__size, __osize); -<span class="lineNum"> 933 </span> : return __r; -<span class="lineNum"> 934 </span> : } -<span class="lineNum"> 935 </span> : -<span class="lineNum"> 936 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 937 </span> : int -<span class="lineNum"> 938 </span> : basic_string <_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 939 </span> : compare(size_type __pos, size_type __n1, const _CharT* __s) const -<span class="lineNum"> 940 </span> : { -<span class="lineNum"> 941 </span> : __glibcxx_requires_string(__s); -<span class="lineNum"> 942 </span> : _M_check(__pos, "basic_string::compare"); -<span class="lineNum"> 943 </span> : __n1 = _M_limit(__pos, __n1); -<span class="lineNum"> 944 </span> : const size_type __osize = traits_type::length(__s); -<span class="lineNum"> 945 </span> : const size_type __len = std::min(__n1, __osize); -<span class="lineNum"> 946 </span> : int __r = traits_type::compare(_M_data() + __pos, __s, __len); -<span class="lineNum"> 947 </span> : if (!__r) -<span class="lineNum"> 948 </span> : __r = _S_compare(__n1, __osize); -<span class="lineNum"> 949 </span> : return __r; -<span class="lineNum"> 950 </span> : } -<span class="lineNum"> 951 </span> : -<span class="lineNum"> 952 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 953 </span> : int -<span class="lineNum"> 954 </span> : basic_string <_CharT, _Traits, _Alloc>:: -<span class="lineNum"> 955 </span> : compare(size_type __pos, size_type __n1, const _CharT* __s, -<span class="lineNum"> 956 </span> : size_type __n2) const -<span class="lineNum"> 957 </span> : { -<span class="lineNum"> 958 </span> : __glibcxx_requires_string_len(__s, __n2); -<span class="lineNum"> 959 </span> : _M_check(__pos, "basic_string::compare"); -<span class="lineNum"> 960 </span> : __n1 = _M_limit(__pos, __n1); -<span class="lineNum"> 961 </span> : const size_type __len = std::min(__n1, __n2); -<span class="lineNum"> 962 </span> : int __r = traits_type::compare(_M_data() + __pos, __s, __len); -<span class="lineNum"> 963 </span> : if (!__r) -<span class="lineNum"> 964 </span> : __r = _S_compare(__n1, __n2); -<span class="lineNum"> 965 </span> : return __r; -<span class="lineNum"> 966 </span> : } -<span class="lineNum"> 967 </span> : -<span class="lineNum"> 968 </span> : // 21.3.7.9 basic_string::getline and operators -<span class="lineNum"> 969 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 970 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 971 </span> : operator>>(basic_istream<_CharT, _Traits>& __in, -<span class="lineNum"> 972 </span> : basic_string<_CharT, _Traits, _Alloc>& __str) -<span class="lineNum"> 973 </span> : { -<span class="lineNum"> 974 </span> : typedef basic_istream<_CharT, _Traits> __istream_type; -<span class="lineNum"> 975 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 976 </span> : typedef typename __istream_type::ios_base __ios_base; -<span class="lineNum"> 977 </span> : typedef typename __istream_type::int_type __int_type; -<span class="lineNum"> 978 </span> : typedef typename __string_type::size_type __size_type; -<span class="lineNum"> 979 </span> : typedef ctype<_CharT> __ctype_type; -<span class="lineNum"> 980 </span> : typedef typename __ctype_type::ctype_base __ctype_base; -<span class="lineNum"> 981 </span> : -<span class="lineNum"> 982 </span> : __size_type __extracted = 0; -<span class="lineNum"> 983 </span> : typename __ios_base::iostate __err = __ios_base::goodbit; -<span class="lineNum"> 984 </span> : typename __istream_type::sentry __cerb(__in, false); -<span class="lineNum"> 985 </span> : if (__cerb) -<span class="lineNum"> 986 </span> : { -<span class="lineNum"> 987 </span> : try -<span class="lineNum"> 988 </span> : { -<span class="lineNum"> 989 </span> : // Avoid reallocation for common case. -<span class="lineNum"> 990 </span> : __str.erase(); -<span class="lineNum"> 991 </span> : _CharT __buf[128]; -<span class="lineNum"> 992 </span> : __size_type __len = 0; -<span class="lineNum"> 993 </span> : const streamsize __w = __in.width(); -<span class="lineNum"> 994 </span> : const __size_type __n = __w > 0 ? static_cast<__size_type>(__w) -<span class="lineNum"> 995 </span> : : __str.max_size(); -<span class="lineNum"> 996 </span> : const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); -<span class="lineNum"> 997 </span> : const __int_type __eof = _Traits::eof(); -<span class="lineNum"> 998 </span> : __int_type __c = __in.rdbuf()->sgetc(); -<span class="lineNum"> 999 </span> : -<span class="lineNum"> 1000 </span> : while (__extracted < __n -<span class="lineNum"> 1001 </span> : && !_Traits::eq_int_type(__c, __eof) -<span class="lineNum"> 1002 </span> : && !__ct.is(__ctype_base::space, -<span class="lineNum"> 1003 </span> : _Traits::to_char_type(__c))) -<span class="lineNum"> 1004 </span> : { -<span class="lineNum"> 1005 </span> : if (__len == sizeof(__buf) / sizeof(_CharT)) -<span class="lineNum"> 1006 </span> : { -<span class="lineNum"> 1007 </span> : __str.append(__buf, sizeof(__buf) / sizeof(_CharT)); -<span class="lineNum"> 1008 </span> : __len = 0; -<span class="lineNum"> 1009 </span> : } -<span class="lineNum"> 1010 </span> : __buf[__len++] = _Traits::to_char_type(__c); -<span class="lineNum"> 1011 </span> : ++__extracted; -<span class="lineNum"> 1012 </span> : __c = __in.rdbuf()->snextc(); -<span class="lineNum"> 1013 </span> : } -<span class="lineNum"> 1014 </span> : __str.append(__buf, __len); -<span class="lineNum"> 1015 </span> : -<span class="lineNum"> 1016 </span> : if (_Traits::eq_int_type(__c, __eof)) -<span class="lineNum"> 1017 </span> : __err |= __ios_base::eofbit; -<span class="lineNum"> 1018 </span> : __in.width(0); -<span class="lineNum"> 1019 </span> : } -<span class="lineNum"> 1020 </span> : catch(__cxxabiv1::__forced_unwind&) -<span class="lineNum"> 1021 </span> : { -<span class="lineNum"> 1022 </span> : __in._M_setstate(__ios_base::badbit); -<span class="lineNum"> 1023 </span> : __throw_exception_again; -<span class="lineNum"> 1024 </span> : } -<span class="lineNum"> 1025 </span> : catch(...) -<span class="lineNum"> 1026 </span> : { -<span class="lineNum"> 1027 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1028 </span> : // 91. Description of operator>> and getline() for string<> -<span class="lineNum"> 1029 </span> : // might cause endless loop -<span class="lineNum"> 1030 </span> : __in._M_setstate(__ios_base::badbit); -<span class="lineNum"> 1031 </span> : } -<span class="lineNum"> 1032 </span> : } -<span class="lineNum"> 1033 </span> : // 211. operator>>(istream&, string&) doesn't set failbit -<span class="lineNum"> 1034 </span> : if (!__extracted) -<span class="lineNum"> 1035 </span> : __err |= __ios_base::failbit; -<span class="lineNum"> 1036 </span> : if (__err) -<span class="lineNum"> 1037 </span> : __in.setstate(__err); -<span class="lineNum"> 1038 </span> : return __in; -<span class="lineNum"> 1039 </span> : } -<span class="lineNum"> 1040 </span> : -<span class="lineNum"> 1041 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 1042 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 1043 </span> : getline(basic_istream<_CharT, _Traits>& __in, -<span class="lineNum"> 1044 </span> : basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) -<span class="lineNum"> 1045 </span> : { -<span class="lineNum"> 1046 </span> : typedef basic_istream<_CharT, _Traits> __istream_type; -<span class="lineNum"> 1047 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 1048 </span> : typedef typename __istream_type::ios_base __ios_base; -<span class="lineNum"> 1049 </span> : typedef typename __istream_type::int_type __int_type; -<span class="lineNum"> 1050 </span> : typedef typename __string_type::size_type __size_type; -<span class="lineNum"> 1051 </span> : -<span class="lineNum"> 1052 </span> : __size_type __extracted = 0; -<span class="lineNum"> 1053 </span> : const __size_type __n = __str.max_size(); -<span class="lineNum"> 1054 </span> : typename __ios_base::iostate __err = __ios_base::goodbit; -<span class="lineNum"> 1055 </span> : typename __istream_type::sentry __cerb(__in, true); -<span class="lineNum"> 1056 </span> : if (__cerb) -<span class="lineNum"> 1057 </span> : { -<span class="lineNum"> 1058 </span> : try -<span class="lineNum"> 1059 </span> : { -<span class="lineNum"> 1060 </span> : __str.erase(); -<span class="lineNum"> 1061 </span> : const __int_type __idelim = _Traits::to_int_type(__delim); -<span class="lineNum"> 1062 </span> : const __int_type __eof = _Traits::eof(); -<span class="lineNum"> 1063 </span> : __int_type __c = __in.rdbuf()->sgetc(); -<span class="lineNum"> 1064 </span> : -<span class="lineNum"> 1065 </span> : while (__extracted < __n -<span class="lineNum"> 1066 </span> : && !_Traits::eq_int_type(__c, __eof) -<span class="lineNum"> 1067 </span> : && !_Traits::eq_int_type(__c, __idelim)) -<span class="lineNum"> 1068 </span> : { -<span class="lineNum"> 1069 </span> : __str += _Traits::to_char_type(__c); -<span class="lineNum"> 1070 </span> : ++__extracted; -<span class="lineNum"> 1071 </span> : __c = __in.rdbuf()->snextc(); -<span class="lineNum"> 1072 </span> : } -<span class="lineNum"> 1073 </span> : -<span class="lineNum"> 1074 </span> : if (_Traits::eq_int_type(__c, __eof)) -<span class="lineNum"> 1075 </span> : __err |= __ios_base::eofbit; -<span class="lineNum"> 1076 </span> : else if (_Traits::eq_int_type(__c, __idelim)) -<span class="lineNum"> 1077 </span> : { -<span class="lineNum"> 1078 </span> : ++__extracted; -<span class="lineNum"> 1079 </span> : __in.rdbuf()->sbumpc(); -<span class="lineNum"> 1080 </span> : } -<span class="lineNum"> 1081 </span> : else -<span class="lineNum"> 1082 </span> : __err |= __ios_base::failbit; -<span class="lineNum"> 1083 </span> : } -<span class="lineNum"> 1084 </span> : catch(__cxxabiv1::__forced_unwind&) -<span class="lineNum"> 1085 </span> : { -<span class="lineNum"> 1086 </span> : __in._M_setstate(__ios_base::badbit); -<span class="lineNum"> 1087 </span> : __throw_exception_again; -<span class="lineNum"> 1088 </span> : } -<span class="lineNum"> 1089 </span> : catch(...) -<span class="lineNum"> 1090 </span> : { -<span class="lineNum"> 1091 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1092 </span> : // 91. Description of operator>> and getline() for string<> -<span class="lineNum"> 1093 </span> : // might cause endless loop -<span class="lineNum"> 1094 </span> : __in._M_setstate(__ios_base::badbit); -<span class="lineNum"> 1095 </span> : } -<span class="lineNum"> 1096 </span> : } -<span class="lineNum"> 1097 </span> : if (!__extracted) -<span class="lineNum"> 1098 </span> : __err |= __ios_base::failbit; -<span class="lineNum"> 1099 </span> : if (__err) -<span class="lineNum"> 1100 </span> : __in.setstate(__err); -<span class="lineNum"> 1101 </span> : return __in; -<span class="lineNum"> 1102 </span> : } -<span class="lineNum"> 1103 </span> : -<span class="lineNum"> 1104 </span> : // Inhibit implicit instantiations for required instantiations, -<span class="lineNum"> 1105 </span> : // which are defined via explicit instantiations elsewhere. -<span class="lineNum"> 1106 </span> : // NB: This syntax is a GNU extension. -<span class="lineNum"> 1107 </span> : #if _GLIBCXX_EXTERN_TEMPLATE -<span class="lineNum"> 1108 </span> : extern template class basic_string<char>; -<span class="lineNum"> 1109 </span> : extern template -<span class="lineNum"> 1110 </span> : basic_istream<char>& -<span class="lineNum"> 1111 </span> : operator>>(basic_istream<char>&, string&); -<span class="lineNum"> 1112 </span> : extern template -<span class="lineNum"> 1113 </span> : basic_ostream<char>& -<span class="lineNum"> 1114 </span> : operator<<(basic_ostream<char>&, const string&); -<span class="lineNum"> 1115 </span> : extern template -<span class="lineNum"> 1116 </span> : basic_istream<char>& -<span class="lineNum"> 1117 </span> : getline(basic_istream<char>&, string&, char); -<span class="lineNum"> 1118 </span> : extern template -<span class="lineNum"> 1119 </span> : basic_istream<char>& -<span class="lineNum"> 1120 </span> : getline(basic_istream<char>&, string&); -<span class="lineNum"> 1121 </span> : -<span class="lineNum"> 1122 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 1123 </span> : extern template class basic_string<wchar_t>; -<span class="lineNum"> 1124 </span> : extern template -<span class="lineNum"> 1125 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 1126 </span> : operator>>(basic_istream<wchar_t>&, wstring&); -<span class="lineNum"> 1127 </span> : extern template -<span class="lineNum"> 1128 </span> : basic_ostream<wchar_t>& -<span class="lineNum"> 1129 </span> : operator<<(basic_ostream<wchar_t>&, const wstring&); -<span class="lineNum"> 1130 </span> : extern template -<span class="lineNum"> 1131 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 1132 </span> : getline(basic_istream<wchar_t>&, wstring&, wchar_t); -<span class="lineNum"> 1133 </span> : extern template -<span class="lineNum"> 1134 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 1135 </span> : getline(basic_istream<wchar_t>&, wstring&); -<span class="lineNum"> 1136 </span> : #endif -<span class="lineNum"> 1137 </span> : #endif -<span class="lineNum"> 1138 </span> : -<span class="lineNum"> 1139 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 1140 </span> : -<span class="lineNum"> 1141 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/char_traits.h.gcov.html b/rep/usr/include/c++/4.3/bits/char_traits.h.gcov.html deleted file mode 100644 index 5a682d1..0000000 --- a/rep/usr/include/c++/4.3/bits/char_traits.h.gcov.html +++ /dev/null @@ -1,438 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/char_traits.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - char_traits.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">13</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">46.2 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">6</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Character Traits for use by standard string and iostream -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file char_traits.h -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : // ISO C++ 14882: 21 Strings library -<span class="lineNum"> 39 </span> : // -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #ifndef _CHAR_TRAITS_H -<span class="lineNum"> 42 </span> : #define _CHAR_TRAITS_H 1 -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #pragma GCC system_header -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : #include <bits/stl_algobase.h> // std::copy, std::fill_n -<span class="lineNum"> 47 </span> : #include <bits/postypes.h> // For streampos -<span class="lineNum"> 48 </span> : #include <cstdio> // For EOF -<span class="lineNum"> 49 </span> : #include <cwchar> // For WEOF, wmemmove, wmemset, etc. -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : /** -<span class="lineNum"> 54 </span> : * @brief Mapping from character type to associated types. -<span class="lineNum"> 55 </span> : * -<span class="lineNum"> 56 </span> : * @note This is an implementation class for the generic version -<span class="lineNum"> 57 </span> : * of char_traits. It defines int_type, off_type, pos_type, and -<span class="lineNum"> 58 </span> : * state_type. By default these are unsigned long, streamoff, -<span class="lineNum"> 59 </span> : * streampos, and mbstate_t. Users who need a different set of -<span class="lineNum"> 60 </span> : * types, but who don't need to change the definitions of any function -<span class="lineNum"> 61 </span> : * defined in char_traits, can specialize __gnu_cxx::_Char_types -<span class="lineNum"> 62 </span> : * while leaving __gnu_cxx::char_traits alone. */ -<span class="lineNum"> 63 </span> : template<typename _CharT> -<span class="lineNum"> 64 </span> : struct _Char_types -<span class="lineNum"> 65 </span> : { -<span class="lineNum"> 66 </span> : typedef unsigned long int_type; -<span class="lineNum"> 67 </span> : typedef std::streampos pos_type; -<span class="lineNum"> 68 </span> : typedef std::streamoff off_type; -<span class="lineNum"> 69 </span> : typedef std::mbstate_t state_type; -<span class="lineNum"> 70 </span> : }; -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : /** -<span class="lineNum"> 74 </span> : * @brief Base class used to implement std::char_traits. -<span class="lineNum"> 75 </span> : * -<span class="lineNum"> 76 </span> : * @note For any given actual character type, this definition is -<span class="lineNum"> 77 </span> : * probably wrong. (Most of the member functions are likely to be -<span class="lineNum"> 78 </span> : * right, but the int_type and state_type typedefs, and the eof() -<span class="lineNum"> 79 </span> : * member function, are likely to be wrong.) The reason this class -<span class="lineNum"> 80 </span> : * exists is so users can specialize it. Classes in namespace std -<span class="lineNum"> 81 </span> : * may not be specialized for fundamental types, but classes in -<span class="lineNum"> 82 </span> : * namespace __gnu_cxx may be. -<span class="lineNum"> 83 </span> : * -<span class="lineNum"> 84 </span> : * See http://gcc.gnu.org/onlinedocs/libstdc++/21_strings/howto.html#5 -<span class="lineNum"> 85 </span> : * for advice on how to make use of this class for "unusual" character -<span class="lineNum"> 86 </span> : * types. Also, check out include/ext/pod_char_traits.h. -<span class="lineNum"> 87 </span> : */ -<span class="lineNum"> 88 </span> : template<typename _CharT> -<span class="lineNum"> 89 </span> : struct char_traits -<span class="lineNum"> 90 </span> : { -<span class="lineNum"> 91 </span> : typedef _CharT char_type; -<span class="lineNum"> 92 </span> : typedef typename _Char_types<_CharT>::int_type int_type; -<span class="lineNum"> 93 </span> : typedef typename _Char_types<_CharT>::pos_type pos_type; -<span class="lineNum"> 94 </span> : typedef typename _Char_types<_CharT>::off_type off_type; -<span class="lineNum"> 95 </span> : typedef typename _Char_types<_CharT>::state_type state_type; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : static void -<span class="lineNum"> 98 </span> : assign(char_type& __c1, const char_type& __c2) -<span class="lineNum"> 99 </span> : { __c1 = __c2; } -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : static bool -<span class="lineNum"> 102 </span> : eq(const char_type& __c1, const char_type& __c2) -<span class="lineNum"> 103 </span> : { return __c1 == __c2; } -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : static bool -<span class="lineNum"> 106 </span> : lt(const char_type& __c1, const char_type& __c2) -<span class="lineNum"> 107 </span> : { return __c1 < __c2; } -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : static int -<span class="lineNum"> 110 </span> : compare(const char_type* __s1, const char_type* __s2, std::size_t __n); -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : static std::size_t -<span class="lineNum"> 113 </span> : length(const char_type* __s); -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : static const char_type* -<span class="lineNum"> 116 </span> : find(const char_type* __s, std::size_t __n, const char_type& __a); -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : static char_type* -<span class="lineNum"> 119 </span> : move(char_type* __s1, const char_type* __s2, std::size_t __n); -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : static char_type* -<span class="lineNum"> 122 </span> : copy(char_type* __s1, const char_type* __s2, std::size_t __n); -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : static char_type* -<span class="lineNum"> 125 </span> : assign(char_type* __s, std::size_t __n, char_type __a); -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : static char_type -<span class="lineNum"> 128 </span> : to_char_type(const int_type& __c) -<span class="lineNum"> 129 </span> : { return static_cast<char_type>(__c); } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : static int_type -<span class="lineNum"> 132 </span> : to_int_type(const char_type& __c) -<span class="lineNum"> 133 </span> : { return static_cast<int_type>(__c); } -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : static bool -<span class="lineNum"> 136 </span> : eq_int_type(const int_type& __c1, const int_type& __c2) -<span class="lineNum"> 137 </span> : { return __c1 == __c2; } -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : static int_type -<span class="lineNum"> 140 </span> : eof() -<span class="lineNum"> 141 </span> : { return static_cast<int_type>(EOF); } -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : static int_type -<span class="lineNum"> 144 </span> : not_eof(const int_type& __c) -<span class="lineNum"> 145 </span> : { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); } -<span class="lineNum"> 146 </span> : }; -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : template<typename _CharT> -<span class="lineNum"> 149 </span> : int -<span class="lineNum"> 150 </span> : char_traits<_CharT>:: -<span class="lineNum"> 151 </span> : compare(const char_type* __s1, const char_type* __s2, std::size_t __n) -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : for (std::size_t __i = 0; __i < __n; ++__i) -<span class="lineNum"> 154 </span> : if (lt(__s1[__i], __s2[__i])) -<span class="lineNum"> 155 </span> : return -1; -<span class="lineNum"> 156 </span> : else if (lt(__s2[__i], __s1[__i])) -<span class="lineNum"> 157 </span> : return 1; -<span class="lineNum"> 158 </span> : return 0; -<span class="lineNum"> 159 </span> : } -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : template<typename _CharT> -<span class="lineNum"> 162 </span> : std::size_t -<span class="lineNum"> 163 </span> : char_traits<_CharT>:: -<span class="lineNum"> 164 </span> : length(const char_type* __p) -<span class="lineNum"> 165 </span> : { -<span class="lineNum"> 166 </span> : std::size_t __i = 0; -<span class="lineNum"> 167 </span> : while (!eq(__p[__i], char_type())) -<span class="lineNum"> 168 </span> : ++__i; -<span class="lineNum"> 169 </span> : return __i; -<span class="lineNum"> 170 </span> : } -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : template<typename _CharT> -<span class="lineNum"> 173 </span> : const typename char_traits<_CharT>::char_type* -<span class="lineNum"> 174 </span> : char_traits<_CharT>:: -<span class="lineNum"> 175 </span> : find(const char_type* __s, std::size_t __n, const char_type& __a) -<span class="lineNum"> 176 </span> : { -<span class="lineNum"> 177 </span> : for (std::size_t __i = 0; __i < __n; ++__i) -<span class="lineNum"> 178 </span> : if (eq(__s[__i], __a)) -<span class="lineNum"> 179 </span> : return __s + __i; -<span class="lineNum"> 180 </span> : return 0; -<span class="lineNum"> 181 </span> : } -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : template<typename _CharT> -<span class="lineNum"> 184 </span> : typename char_traits<_CharT>::char_type* -<span class="lineNum"> 185 </span> : char_traits<_CharT>:: -<span class="lineNum"> 186 </span> : move(char_type* __s1, const char_type* __s2, std::size_t __n) -<span class="lineNum"> 187 </span> : { -<span class="lineNum"> 188 </span> : return static_cast<_CharT*>(__builtin_memmove(__s1, __s2, -<span class="lineNum"> 189 </span> : __n * sizeof(char_type))); -<span class="lineNum"> 190 </span> : } -<span class="lineNum"> 191 </span> : -<span class="lineNum"> 192 </span> : template<typename _CharT> -<span class="lineNum"> 193 </span> : typename char_traits<_CharT>::char_type* -<span class="lineNum"> 194 </span> : char_traits<_CharT>:: -<span class="lineNum"> 195 </span> : copy(char_type* __s1, const char_type* __s2, std::size_t __n) -<span class="lineNum"> 196 </span> : { -<span class="lineNum"> 197 </span> : // NB: Inline std::copy so no recursive dependencies. -<span class="lineNum"> 198 </span> : std::copy(__s2, __s2 + __n, __s1); -<span class="lineNum"> 199 </span> : return __s1; -<span class="lineNum"> 200 </span> : } -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : template<typename _CharT> -<span class="lineNum"> 203 </span> : typename char_traits<_CharT>::char_type* -<span class="lineNum"> 204 </span> : char_traits<_CharT>:: -<span class="lineNum"> 205 </span> : assign(char_type* __s, std::size_t __n, char_type __a) -<span class="lineNum"> 206 </span> : { -<span class="lineNum"> 207 </span> : // NB: Inline std::fill_n so no recursive dependencies. -<span class="lineNum"> 208 </span> : std::fill_n(__s, __n, __a); -<span class="lineNum"> 209 </span> : return __s; -<span class="lineNum"> 210 </span> : } -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : // 21.1 -<span class="lineNum"> 217 </span> : /** -<span class="lineNum"> 218 </span> : * @brief Basis for explicit traits specializations. -<span class="lineNum"> 219 </span> : * -<span class="lineNum"> 220 </span> : * @note For any given actual character type, this definition is -<span class="lineNum"> 221 </span> : * probably wrong. Since this is just a thin wrapper around -<span class="lineNum"> 222 </span> : * __gnu_cxx::char_traits, it is possible to achieve a more -<span class="lineNum"> 223 </span> : * appropriate definition by specializing __gnu_cxx::char_traits. -<span class="lineNum"> 224 </span> : * -<span class="lineNum"> 225 </span> : * See http://gcc.gnu.org/onlinedocs/libstdc++/21_strings/howto.html#5 -<span class="lineNum"> 226 </span> : * for advice on how to make use of this class for "unusual" character -<span class="lineNum"> 227 </span> : * types. Also, check out include/ext/pod_char_traits.h. -<span class="lineNum"> 228 </span> : */ -<span class="lineNum"> 229 </span> : template<class _CharT> -<span class="lineNum"> 230 </span> : struct char_traits : public __gnu_cxx::char_traits<_CharT> -<span class="lineNum"> 231 </span> : { }; -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : /// 21.1.3.1 char_traits specializations -<span class="lineNum"> 235 </span> : template<> -<span class="lineNum"> 236 </span> : struct char_traits<char> -<span class="lineNum"> 237 </span> : { -<span class="lineNum"> 238 </span> : typedef char char_type; -<span class="lineNum"> 239 </span> : typedef int int_type; -<span class="lineNum"> 240 </span> : typedef streampos pos_type; -<span class="lineNum"> 241 </span> : typedef streamoff off_type; -<span class="lineNum"> 242 </span> : typedef mbstate_t state_type; -<span class="lineNum"> 243 </span> : -<span class="lineNum"> 244 </span> : static void -<span class="lineNum"> 245 </span><span class="lineCov"> 10976 : assign(char_type& __c1, const char_type& __c2)</span> -<span class="lineNum"> 246 </span><span class="lineCov"> 10976 : { __c1 = __c2; }</span> -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : static bool -<span class="lineNum"> 249 </span> : eq(const char_type& __c1, const char_type& __c2) -<span class="lineNum"> 250 </span> : { return __c1 == __c2; } -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : static bool -<span class="lineNum"> 253 </span> : lt(const char_type& __c1, const char_type& __c2) -<span class="lineNum"> 254 </span> : { return __c1 < __c2; } -<span class="lineNum"> 255 </span> : -<span class="lineNum"> 256 </span> : static int -<span class="lineNum"> 257 </span><span class="lineCov"> 115296 : compare(const char_type* __s1, const char_type* __s2, size_t __n)</span> -<span class="lineNum"> 258 </span><span class="lineCov"> 115296 : { return __builtin_memcmp(__s1, __s2, __n); }</span> -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : static size_t -<span class="lineNum"> 261 </span><span class="lineCov"> 2633 : length(const char_type* __s)</span> -<span class="lineNum"> 262 </span><span class="lineCov"> 2633 : { return __builtin_strlen(__s); }</span> -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : static const char_type* -<span class="lineNum"> 265 </span> : find(const char_type* __s, size_t __n, const char_type& __a) -<span class="lineNum"> 266 </span> : { return static_cast<const char_type*>(__builtin_memchr(__s, __a, __n)); } -<span class="lineNum"> 267 </span> : -<span class="lineNum"> 268 </span> : static char_type* -<span class="lineNum"> 269 </span> : move(char_type* __s1, const char_type* __s2, size_t __n) -<span class="lineNum"> 270 </span> : { return static_cast<char_type*>(__builtin_memmove(__s1, __s2, __n)); } -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : static char_type* -<span class="lineNum"> 273 </span><span class="lineNoCov"> 0 : copy(char_type* __s1, const char_type* __s2, size_t __n)</span> -<span class="lineNum"> 274 </span><span class="lineNoCov"> 0 : { return static_cast<char_type*>(__builtin_memcpy(__s1, __s2, __n)); }</span> -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : static char_type* -<span class="lineNum"> 277 </span> : assign(char_type* __s, size_t __n, char_type __a) -<span class="lineNum"> 278 </span> : { return static_cast<char_type*>(__builtin_memset(__s, __a, __n)); } -<span class="lineNum"> 279 </span> : -<span class="lineNum"> 280 </span> : static char_type -<span class="lineNum"> 281 </span> : to_char_type(const int_type& __c) -<span class="lineNum"> 282 </span> : { return static_cast<char_type>(__c); } -<span class="lineNum"> 283 </span> : -<span class="lineNum"> 284 </span> : // To keep both the byte 0xff and the eof symbol 0xffffffff -<span class="lineNum"> 285 </span> : // from ending up as 0xffffffff. -<span class="lineNum"> 286 </span> : static int_type -<span class="lineNum"> 287 </span><span class="lineNoCov"> 0 : to_int_type(const char_type& __c)</span> -<span class="lineNum"> 288 </span><span class="lineNoCov"> 0 : { return static_cast<int_type>(static_cast<unsigned char>(__c)); }</span> -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : static bool -<span class="lineNum"> 291 </span><span class="lineNoCov"> 0 : eq_int_type(const int_type& __c1, const int_type& __c2)</span> -<span class="lineNum"> 292 </span><span class="lineNoCov"> 0 : { return __c1 == __c2; }</span> -<span class="lineNum"> 293 </span> : -<span class="lineNum"> 294 </span> : static int_type -<span class="lineNum"> 295 </span><span class="lineNoCov"> 0 : eof() { return static_cast<int_type>(EOF); }</span> -<span class="lineNum"> 296 </span> : -<span class="lineNum"> 297 </span> : static int_type -<span class="lineNum"> 298 </span> : not_eof(const int_type& __c) -<span class="lineNum"> 299 </span> : { return (__c == eof()) ? 0 : __c; } -<span class="lineNum"> 300 </span> : }; -<span class="lineNum"> 301 </span> : -<span class="lineNum"> 302 </span> : -<span class="lineNum"> 303 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 304 </span> : /// 21.1.3.2 char_traits specializations -<span class="lineNum"> 305 </span> : template<> -<span class="lineNum"> 306 </span> : struct char_traits<wchar_t> -<span class="lineNum"> 307 </span> : { -<span class="lineNum"> 308 </span> : typedef wchar_t char_type; -<span class="lineNum"> 309 </span> : typedef wint_t int_type; -<span class="lineNum"> 310 </span> : typedef streamoff off_type; -<span class="lineNum"> 311 </span> : typedef wstreampos pos_type; -<span class="lineNum"> 312 </span> : typedef mbstate_t state_type; -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : static void -<span class="lineNum"> 315 </span> : assign(char_type& __c1, const char_type& __c2) -<span class="lineNum"> 316 </span> : { __c1 = __c2; } -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : static bool -<span class="lineNum"> 319 </span> : eq(const char_type& __c1, const char_type& __c2) -<span class="lineNum"> 320 </span> : { return __c1 == __c2; } -<span class="lineNum"> 321 </span> : -<span class="lineNum"> 322 </span> : static bool -<span class="lineNum"> 323 </span> : lt(const char_type& __c1, const char_type& __c2) -<span class="lineNum"> 324 </span> : { return __c1 < __c2; } -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span> : static int -<span class="lineNum"> 327 </span> : compare(const char_type* __s1, const char_type* __s2, size_t __n) -<span class="lineNum"> 328 </span> : { return wmemcmp(__s1, __s2, __n); } -<span class="lineNum"> 329 </span> : -<span class="lineNum"> 330 </span> : static size_t -<span class="lineNum"> 331 </span> : length(const char_type* __s) -<span class="lineNum"> 332 </span> : { return wcslen(__s); } -<span class="lineNum"> 333 </span> : -<span class="lineNum"> 334 </span> : static const char_type* -<span class="lineNum"> 335 </span> : find(const char_type* __s, size_t __n, const char_type& __a) -<span class="lineNum"> 336 </span> : { return wmemchr(__s, __a, __n); } -<span class="lineNum"> 337 </span> : -<span class="lineNum"> 338 </span> : static char_type* -<span class="lineNum"> 339 </span> : move(char_type* __s1, const char_type* __s2, size_t __n) -<span class="lineNum"> 340 </span> : { return wmemmove(__s1, __s2, __n); } -<span class="lineNum"> 341 </span> : -<span class="lineNum"> 342 </span> : static char_type* -<span class="lineNum"> 343 </span> : copy(char_type* __s1, const char_type* __s2, size_t __n) -<span class="lineNum"> 344 </span> : { return wmemcpy(__s1, __s2, __n); } -<span class="lineNum"> 345 </span> : -<span class="lineNum"> 346 </span> : static char_type* -<span class="lineNum"> 347 </span> : assign(char_type* __s, size_t __n, char_type __a) -<span class="lineNum"> 348 </span> : { return wmemset(__s, __a, __n); } -<span class="lineNum"> 349 </span> : -<span class="lineNum"> 350 </span> : static char_type -<span class="lineNum"> 351 </span> : to_char_type(const int_type& __c) { return char_type(__c); } -<span class="lineNum"> 352 </span> : -<span class="lineNum"> 353 </span> : static int_type -<span class="lineNum"> 354 </span> : to_int_type(const char_type& __c) { return int_type(__c); } -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : static bool -<span class="lineNum"> 357 </span> : eq_int_type(const int_type& __c1, const int_type& __c2) -<span class="lineNum"> 358 </span> : { return __c1 == __c2; } -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : static int_type -<span class="lineNum"> 361 </span> : eof() { return static_cast<int_type>(WEOF); } -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : static int_type -<span class="lineNum"> 364 </span> : not_eof(const int_type& __c) -<span class="lineNum"> 365 </span> : { return eq_int_type(__c, eof()) ? 0 : __c; } -<span class="lineNum"> 366 </span> : }; -<span class="lineNum"> 367 </span> : #endif //_GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 368 </span> : -<span class="lineNum"> 369 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 370 </span> : -<span class="lineNum"> 371 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/deque.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/deque.tcc.gcov.html deleted file mode 100644 index 08f01e5..0000000 --- a/rep/usr/include/c++/4.3/bits/deque.tcc.gcov.html +++ /dev/null @@ -1,900 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/deque.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - deque.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">147</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">19.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">28</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Deque implementation (out of line) -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file deque.tcc -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _DEQUE_TCC -<span class="lineNum"> 63 </span> : #define _DEQUE_TCC 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 68 </span> : deque<_Tp, _Alloc>& -<span class="lineNum"> 69 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 70 </span><span class="lineCov"> 4 : operator=(const deque& __x)</span> -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span><span class="lineCov"> 4 : const size_type __len = size();</span> -<span class="lineNum"> 73 </span><span class="lineCov"> 4 : if (&__x != this)</span> -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span><span class="lineCov"> 4 : if (__len >= __x.size())</span> -<span class="lineNum"> 76 </span><span class="lineCov"> 4 : _M_erase_at_end(std::copy(__x.begin(), __x.end(),</span> -<span class="lineNum"> 77 </span> : this->_M_impl._M_start)); -<span class="lineNum"> 78 </span> : else -<span class="lineNum"> 79 </span> : { -<span class="lineNum"> 80 </span><span class="lineNoCov"> 0 : const_iterator __mid = __x.begin() + difference_type(__len);</span> -<span class="lineNum"> 81 </span><span class="lineNoCov"> 0 : std::copy(__x.begin(), __mid, this->_M_impl._M_start);</span> -<span class="lineNum"> 82 </span><span class="lineNoCov"> 0 : insert(this->_M_impl._M_finish, __mid, __x.end());</span> -<span class="lineNum"> 83 </span> : } -<span class="lineNum"> 84 </span> : } -<span class="lineNum"> 85 </span><span class="lineCov"> 4 : return *this;</span> -<span class="lineNum"> 86 </span> : } -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 89 </span> : typename deque<_Tp, _Alloc>::iterator -<span class="lineNum"> 90 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 91 </span> : insert(iterator __position, const value_type& __x) -<span class="lineNum"> 92 </span> : { -<span class="lineNum"> 93 </span> : if (__position._M_cur == this->_M_impl._M_start._M_cur) -<span class="lineNum"> 94 </span> : { -<span class="lineNum"> 95 </span> : push_front(__x); -<span class="lineNum"> 96 </span> : return this->_M_impl._M_start; -<span class="lineNum"> 97 </span> : } -<span class="lineNum"> 98 </span> : else if (__position._M_cur == this->_M_impl._M_finish._M_cur) -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span> : push_back(__x); -<span class="lineNum"> 101 </span> : iterator __tmp = this->_M_impl._M_finish; -<span class="lineNum"> 102 </span> : --__tmp; -<span class="lineNum"> 103 </span> : return __tmp; -<span class="lineNum"> 104 </span> : } -<span class="lineNum"> 105 </span> : else -<span class="lineNum"> 106 </span> : return _M_insert_aux(__position, __x); -<span class="lineNum"> 107 </span> : } -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 110 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 111 </span> : template<typename... _Args> -<span class="lineNum"> 112 </span> : typename deque<_Tp, _Alloc>::iterator -<span class="lineNum"> 113 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 114 </span> : emplace(iterator __position, _Args&&... __args) -<span class="lineNum"> 115 </span> : { -<span class="lineNum"> 116 </span> : if (__position._M_cur == this->_M_impl._M_start._M_cur) -<span class="lineNum"> 117 </span> : { -<span class="lineNum"> 118 </span> : push_front(std::forward<_Args>(__args)...); -<span class="lineNum"> 119 </span> : return this->_M_impl._M_start; -<span class="lineNum"> 120 </span> : } -<span class="lineNum"> 121 </span> : else if (__position._M_cur == this->_M_impl._M_finish._M_cur) -<span class="lineNum"> 122 </span> : { -<span class="lineNum"> 123 </span> : push_back(std::forward<_Args>(__args)...); -<span class="lineNum"> 124 </span> : iterator __tmp = this->_M_impl._M_finish; -<span class="lineNum"> 125 </span> : --__tmp; -<span class="lineNum"> 126 </span> : return __tmp; -<span class="lineNum"> 127 </span> : } -<span class="lineNum"> 128 </span> : else -<span class="lineNum"> 129 </span> : return _M_insert_aux(__position, std::forward<_Args>(__args)...); -<span class="lineNum"> 130 </span> : } -<span class="lineNum"> 131 </span> : #endif -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 134 </span> : typename deque<_Tp, _Alloc>::iterator -<span class="lineNum"> 135 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 136 </span> : erase(iterator __position) -<span class="lineNum"> 137 </span> : { -<span class="lineNum"> 138 </span> : iterator __next = __position; -<span class="lineNum"> 139 </span> : ++__next; -<span class="lineNum"> 140 </span> : const difference_type __index = __position - begin(); -<span class="lineNum"> 141 </span> : if (static_cast<size_type>(__index) < (size() >> 1)) -<span class="lineNum"> 142 </span> : { -<span class="lineNum"> 143 </span> : if (__position != begin()) -<span class="lineNum"> 144 </span> : _GLIBCXX_MOVE_BACKWARD3(begin(), __position, __next); -<span class="lineNum"> 145 </span> : pop_front(); -<span class="lineNum"> 146 </span> : } -<span class="lineNum"> 147 </span> : else -<span class="lineNum"> 148 </span> : { -<span class="lineNum"> 149 </span> : if (__next != end()) -<span class="lineNum"> 150 </span> : _GLIBCXX_MOVE3(__next, end(), __position); -<span class="lineNum"> 151 </span> : pop_back(); -<span class="lineNum"> 152 </span> : } -<span class="lineNum"> 153 </span> : return begin() + __index; -<span class="lineNum"> 154 </span> : } -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 157 </span> : typename deque<_Tp, _Alloc>::iterator -<span class="lineNum"> 158 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 159 </span><span class="lineCov"> 1012 : erase(iterator __first, iterator __last)</span> -<span class="lineNum"> 160 </span> : { -<span class="lineNum"> 161 </span><span class="lineCov"> 1012 : if (__first == begin() && __last == end())</span> -<span class="lineNum"> 162 </span> : { -<span class="lineNum"> 163 </span><span class="lineCov"> 922 : clear();</span> -<span class="lineNum"> 164 </span><span class="lineCov"> 922 : return end();</span> -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : else -<span class="lineNum"> 167 </span> : { -<span class="lineNum"> 168 </span><span class="lineCov"> 90 : const difference_type __n = __last - __first;</span> -<span class="lineNum"> 169 </span><span class="lineCov"> 90 : const difference_type __elems_before = __first - begin();</span> -<span class="lineNum"> 170 </span><span class="lineCov"> 90 : if (static_cast<size_type>(__elems_before) <= (size() - __n) / 2)</span> -<span class="lineNum"> 171 </span> : { -<span class="lineNum"> 172 </span><span class="lineCov"> 90 : if (__first != begin())</span> -<span class="lineNum"> 173 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE_BACKWARD3(begin(), __first, __last);</span> -<span class="lineNum"> 174 </span><span class="lineCov"> 90 : _M_erase_at_begin(begin() + __n);</span> -<span class="lineNum"> 175 </span> : } -<span class="lineNum"> 176 </span> : else -<span class="lineNum"> 177 </span> : { -<span class="lineNum"> 178 </span><span class="lineNoCov"> 0 : if (__last != end())</span> -<span class="lineNum"> 179 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE3(__last, end(), __first);</span> -<span class="lineNum"> 180 </span><span class="lineNoCov"> 0 : _M_erase_at_end(end() - __n);</span> -<span class="lineNum"> 181 </span> : } -<span class="lineNum"> 182 </span><span class="lineCov"> 90 : return begin() + __elems_before;</span> -<span class="lineNum"> 183 </span> : } -<span class="lineNum"> 184 </span> : } -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span> : template <typename _Tp, class _Alloc> -<span class="lineNum"> 187 </span> : template <typename _InputIterator> -<span class="lineNum"> 188 </span> : void -<span class="lineNum"> 189 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 190 </span> : _M_assign_aux(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 191 </span> : std::input_iterator_tag) -<span class="lineNum"> 192 </span> : { -<span class="lineNum"> 193 </span> : iterator __cur = begin(); -<span class="lineNum"> 194 </span> : for (; __first != __last && __cur != end(); ++__cur, ++__first) -<span class="lineNum"> 195 </span> : *__cur = *__first; -<span class="lineNum"> 196 </span> : if (__first == __last) -<span class="lineNum"> 197 </span> : _M_erase_at_end(__cur); -<span class="lineNum"> 198 </span> : else -<span class="lineNum"> 199 </span> : insert(end(), __first, __last); -<span class="lineNum"> 200 </span> : } -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 203 </span> : void -<span class="lineNum"> 204 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 205 </span> : _M_fill_insert(iterator __pos, size_type __n, const value_type& __x) -<span class="lineNum"> 206 </span> : { -<span class="lineNum"> 207 </span> : if (__pos._M_cur == this->_M_impl._M_start._M_cur) -<span class="lineNum"> 208 </span> : { -<span class="lineNum"> 209 </span> : iterator __new_start = _M_reserve_elements_at_front(__n); -<span class="lineNum"> 210 </span> : try -<span class="lineNum"> 211 </span> : { -<span class="lineNum"> 212 </span> : std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start, -<span class="lineNum"> 213 </span> : __x, _M_get_Tp_allocator()); -<span class="lineNum"> 214 </span> : this->_M_impl._M_start = __new_start; -<span class="lineNum"> 215 </span> : } -<span class="lineNum"> 216 </span> : catch(...) -<span class="lineNum"> 217 </span> : { -<span class="lineNum"> 218 </span> : _M_destroy_nodes(__new_start._M_node, -<span class="lineNum"> 219 </span> : this->_M_impl._M_start._M_node); -<span class="lineNum"> 220 </span> : __throw_exception_again; -<span class="lineNum"> 221 </span> : } -<span class="lineNum"> 222 </span> : } -<span class="lineNum"> 223 </span> : else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) -<span class="lineNum"> 224 </span> : { -<span class="lineNum"> 225 </span> : iterator __new_finish = _M_reserve_elements_at_back(__n); -<span class="lineNum"> 226 </span> : try -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span> : std::__uninitialized_fill_a(this->_M_impl._M_finish, -<span class="lineNum"> 229 </span> : __new_finish, __x, -<span class="lineNum"> 230 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 231 </span> : this->_M_impl._M_finish = __new_finish; -<span class="lineNum"> 232 </span> : } -<span class="lineNum"> 233 </span> : catch(...) -<span class="lineNum"> 234 </span> : { -<span class="lineNum"> 235 </span> : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, -<span class="lineNum"> 236 </span> : __new_finish._M_node + 1); -<span class="lineNum"> 237 </span> : __throw_exception_again; -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : } -<span class="lineNum"> 240 </span> : else -<span class="lineNum"> 241 </span> : _M_insert_aux(__pos, __n, __x); -<span class="lineNum"> 242 </span> : } -<span class="lineNum"> 243 </span> : -<span class="lineNum"> 244 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 245 </span> : void -<span class="lineNum"> 246 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 247 </span> : _M_fill_initialize(const value_type& __value) -<span class="lineNum"> 248 </span> : { -<span class="lineNum"> 249 </span> : _Map_pointer __cur; -<span class="lineNum"> 250 </span> : try -<span class="lineNum"> 251 </span> : { -<span class="lineNum"> 252 </span> : for (__cur = this->_M_impl._M_start._M_node; -<span class="lineNum"> 253 </span> : __cur < this->_M_impl._M_finish._M_node; -<span class="lineNum"> 254 </span> : ++__cur) -<span class="lineNum"> 255 </span> : std::__uninitialized_fill_a(*__cur, *__cur + _S_buffer_size(), -<span class="lineNum"> 256 </span> : __value, _M_get_Tp_allocator()); -<span class="lineNum"> 257 </span> : std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first, -<span class="lineNum"> 258 </span> : this->_M_impl._M_finish._M_cur, -<span class="lineNum"> 259 </span> : __value, _M_get_Tp_allocator()); -<span class="lineNum"> 260 </span> : } -<span class="lineNum"> 261 </span> : catch(...) -<span class="lineNum"> 262 </span> : { -<span class="lineNum"> 263 </span> : std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur), -<span class="lineNum"> 264 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 265 </span> : __throw_exception_again; -<span class="lineNum"> 266 </span> : } -<span class="lineNum"> 267 </span> : } -<span class="lineNum"> 268 </span> : -<span class="lineNum"> 269 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 270 </span> : template <typename _InputIterator> -<span class="lineNum"> 271 </span> : void -<span class="lineNum"> 272 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 273 </span> : _M_range_initialize(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 274 </span> : std::input_iterator_tag) -<span class="lineNum"> 275 </span> : { -<span class="lineNum"> 276 </span> : this->_M_initialize_map(0); -<span class="lineNum"> 277 </span> : try -<span class="lineNum"> 278 </span> : { -<span class="lineNum"> 279 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 280 </span> : push_back(*__first); -<span class="lineNum"> 281 </span> : } -<span class="lineNum"> 282 </span> : catch(...) -<span class="lineNum"> 283 </span> : { -<span class="lineNum"> 284 </span> : clear(); -<span class="lineNum"> 285 </span> : __throw_exception_again; -<span class="lineNum"> 286 </span> : } -<span class="lineNum"> 287 </span> : } -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 290 </span> : template <typename _ForwardIterator> -<span class="lineNum"> 291 </span> : void -<span class="lineNum"> 292 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 293 </span> : _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 294 </span> : std::forward_iterator_tag) -<span class="lineNum"> 295 </span> : { -<span class="lineNum"> 296 </span> : const size_type __n = std::distance(__first, __last); -<span class="lineNum"> 297 </span> : this->_M_initialize_map(__n); -<span class="lineNum"> 298 </span> : -<span class="lineNum"> 299 </span> : _Map_pointer __cur_node; -<span class="lineNum"> 300 </span> : try -<span class="lineNum"> 301 </span> : { -<span class="lineNum"> 302 </span> : for (__cur_node = this->_M_impl._M_start._M_node; -<span class="lineNum"> 303 </span> : __cur_node < this->_M_impl._M_finish._M_node; -<span class="lineNum"> 304 </span> : ++__cur_node) -<span class="lineNum"> 305 </span> : { -<span class="lineNum"> 306 </span> : _ForwardIterator __mid = __first; -<span class="lineNum"> 307 </span> : std::advance(__mid, _S_buffer_size()); -<span class="lineNum"> 308 </span> : std::__uninitialized_copy_a(__first, __mid, *__cur_node, -<span class="lineNum"> 309 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 310 </span> : __first = __mid; -<span class="lineNum"> 311 </span> : } -<span class="lineNum"> 312 </span> : std::__uninitialized_copy_a(__first, __last, -<span class="lineNum"> 313 </span> : this->_M_impl._M_finish._M_first, -<span class="lineNum"> 314 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 315 </span> : } -<span class="lineNum"> 316 </span> : catch(...) -<span class="lineNum"> 317 </span> : { -<span class="lineNum"> 318 </span> : std::_Destroy(this->_M_impl._M_start, -<span class="lineNum"> 319 </span> : iterator(*__cur_node, __cur_node), -<span class="lineNum"> 320 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 321 </span> : __throw_exception_again; -<span class="lineNum"> 322 </span> : } -<span class="lineNum"> 323 </span> : } -<span class="lineNum"> 324 </span> : -<span class="lineNum"> 325 </span> : // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_last - 1. -<span class="lineNum"> 326 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 327 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 328 </span> : template<typename... _Args> -<span class="lineNum"> 329 </span> : void -<span class="lineNum"> 330 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 331 </span> : _M_push_back_aux(_Args&&... __args) -<span class="lineNum"> 332 </span> : #else -<span class="lineNum"> 333 </span> : void -<span class="lineNum"> 334 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 335 </span><span class="lineCov"> 13 : _M_push_back_aux(const value_type& __t)</span> -<span class="lineNum"> 336 </span> : #endif -<span class="lineNum"> 337 </span> : { -<span class="lineNum"> 338 </span><span class="lineCov"> 13 : _M_reserve_map_at_back();</span> -<span class="lineNum"> 339 </span><span class="lineCov"> 13 : *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node();</span> -<span class="lineNum"> 340 </span> : try -<span class="lineNum"> 341 </span> : { -<span class="lineNum"> 342 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 343 </span> : this->_M_impl.construct(this->_M_impl._M_finish._M_cur, -<span class="lineNum"> 344 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 345 </span> : #else -<span class="lineNum"> 346 </span><span class="lineCov"> 13 : this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t);</span> -<span class="lineNum"> 347 </span> : #endif -<span class="lineNum"> 348 </span><span class="lineCov"> 13 : this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node</span> -<span class="lineNum"> 349 </span> : + 1); -<span class="lineNum"> 350 </span><span class="lineCov"> 13 : this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first;</span> -<span class="lineNum"> 351 </span> : } -<span class="lineNum"> 352 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 353 </span> : { -<span class="lineNum"> 354 </span><span class="lineNoCov"> 0 : _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1));</span> -<span class="lineNum"> 355 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 356 </span> : } -<span class="lineNum"> 357 </span><span class="lineCov"> 13 : }</span> -<span class="lineNum"> 358 </span> : -<span class="lineNum"> 359 </span> : // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_first. -<span class="lineNum"> 360 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 361 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 362 </span> : template<typename... _Args> -<span class="lineNum"> 363 </span> : void -<span class="lineNum"> 364 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 365 </span> : _M_push_front_aux(_Args&&... __args) -<span class="lineNum"> 366 </span> : #else -<span class="lineNum"> 367 </span> : void -<span class="lineNum"> 368 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 369 </span> : _M_push_front_aux(const value_type& __t) -<span class="lineNum"> 370 </span> : #endif -<span class="lineNum"> 371 </span> : { -<span class="lineNum"> 372 </span> : _M_reserve_map_at_front(); -<span class="lineNum"> 373 </span> : *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node(); -<span class="lineNum"> 374 </span> : try -<span class="lineNum"> 375 </span> : { -<span class="lineNum"> 376 </span> : this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node -<span class="lineNum"> 377 </span> : - 1); -<span class="lineNum"> 378 </span> : this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; -<span class="lineNum"> 379 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 380 </span> : this->_M_impl.construct(this->_M_impl._M_start._M_cur, -<span class="lineNum"> 381 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 382 </span> : #else -<span class="lineNum"> 383 </span> : this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t); -<span class="lineNum"> 384 </span> : #endif -<span class="lineNum"> 385 </span> : } -<span class="lineNum"> 386 </span> : catch(...) -<span class="lineNum"> 387 </span> : { -<span class="lineNum"> 388 </span> : ++this->_M_impl._M_start; -<span class="lineNum"> 389 </span> : _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1)); -<span class="lineNum"> 390 </span> : __throw_exception_again; -<span class="lineNum"> 391 </span> : } -<span class="lineNum"> 392 </span> : } -<span class="lineNum"> 393 </span> : -<span class="lineNum"> 394 </span> : // Called only if _M_impl._M_finish._M_cur == _M_impl._M_finish._M_first. -<span class="lineNum"> 395 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 396 </span> : void deque<_Tp, _Alloc>:: -<span class="lineNum"> 397 </span><span class="lineNoCov"> 0 : _M_pop_back_aux()</span> -<span class="lineNum"> 398 </span> : { -<span class="lineNum"> 399 </span><span class="lineNoCov"> 0 : _M_deallocate_node(this->_M_impl._M_finish._M_first);</span> -<span class="lineNum"> 400 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1);</span> -<span class="lineNum"> 401 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1;</span> -<span class="lineNum"> 402 </span><span class="lineNoCov"> 0 : this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);</span> -<span class="lineNum"> 403 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : // Called only if _M_impl._M_start._M_cur == _M_impl._M_start._M_last - 1. -<span class="lineNum"> 406 </span> : // Note that if the deque has at least one element (a precondition for this -<span class="lineNum"> 407 </span> : // member function), and if -<span class="lineNum"> 408 </span> : // _M_impl._M_start._M_cur == _M_impl._M_start._M_last, -<span class="lineNum"> 409 </span> : // then the deque must have at least two nodes. -<span class="lineNum"> 410 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 411 </span> : void deque<_Tp, _Alloc>:: -<span class="lineNum"> 412 </span> : _M_pop_front_aux() -<span class="lineNum"> 413 </span> : { -<span class="lineNum"> 414 </span> : this->_M_impl.destroy(this->_M_impl._M_start._M_cur); -<span class="lineNum"> 415 </span> : _M_deallocate_node(this->_M_impl._M_start._M_first); -<span class="lineNum"> 416 </span> : this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1); -<span class="lineNum"> 417 </span> : this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first; -<span class="lineNum"> 418 </span> : } -<span class="lineNum"> 419 </span> : -<span class="lineNum"> 420 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 421 </span> : template <typename _InputIterator> -<span class="lineNum"> 422 </span> : void -<span class="lineNum"> 423 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 424 </span> : _M_range_insert_aux(iterator __pos, -<span class="lineNum"> 425 </span> : _InputIterator __first, _InputIterator __last, -<span class="lineNum"> 426 </span> : std::input_iterator_tag) -<span class="lineNum"> 427 </span> : { std::copy(__first, __last, std::inserter(*this, __pos)); } -<span class="lineNum"> 428 </span> : -<span class="lineNum"> 429 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 430 </span> : template <typename _ForwardIterator> -<span class="lineNum"> 431 </span> : void -<span class="lineNum"> 432 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 433 </span> : _M_range_insert_aux(iterator __pos, -<span class="lineNum"> 434 </span> : _ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 435 </span><span class="lineNoCov"> 0 : std::forward_iterator_tag)</span> -<span class="lineNum"> 436 </span> : { -<span class="lineNum"> 437 </span><span class="lineNoCov"> 0 : const size_type __n = std::distance(__first, __last);</span> -<span class="lineNum"> 438 </span><span class="lineNoCov"> 0 : if (__pos._M_cur == this->_M_impl._M_start._M_cur)</span> -<span class="lineNum"> 439 </span> : { -<span class="lineNum"> 440 </span><span class="lineNoCov"> 0 : iterator __new_start = _M_reserve_elements_at_front(__n);</span> -<span class="lineNum"> 441 </span> : try -<span class="lineNum"> 442 </span> : { -<span class="lineNum"> 443 </span><span class="lineNoCov"> 0 : std::__uninitialized_copy_a(__first, __last, __new_start,</span> -<span class="lineNum"> 444 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 445 </span><span class="lineNoCov"> 0 : this->_M_impl._M_start = __new_start;</span> -<span class="lineNum"> 446 </span> : } -<span class="lineNum"> 447 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 448 </span> : { -<span class="lineNum"> 449 </span><span class="lineNoCov"> 0 : _M_destroy_nodes(__new_start._M_node,</span> -<span class="lineNum"> 450 </span> : this->_M_impl._M_start._M_node); -<span class="lineNum"> 451 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 452 </span> : } -<span class="lineNum"> 453 </span> : } -<span class="lineNum"> 454 </span><span class="lineNoCov"> 0 : else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)</span> -<span class="lineNum"> 455 </span> : { -<span class="lineNum"> 456 </span><span class="lineNoCov"> 0 : iterator __new_finish = _M_reserve_elements_at_back(__n);</span> -<span class="lineNum"> 457 </span> : try -<span class="lineNum"> 458 </span> : { -<span class="lineNum"> 459 </span><span class="lineNoCov"> 0 : std::__uninitialized_copy_a(__first, __last,</span> -<span class="lineNum"> 460 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 461 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 462 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish = __new_finish;</span> -<span class="lineNum"> 463 </span> : } -<span class="lineNum"> 464 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 465 </span> : { -<span class="lineNum"> 466 </span><span class="lineNoCov"> 0 : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</span> -<span class="lineNum"> 467 </span> : __new_finish._M_node + 1); -<span class="lineNum"> 468 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 469 </span> : } -<span class="lineNum"> 470 </span> : } -<span class="lineNum"> 471 </span> : else -<span class="lineNum"> 472 </span><span class="lineNoCov"> 0 : _M_insert_aux(__pos, __first, __last, __n);</span> -<span class="lineNum"> 473 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 474 </span> : -<span class="lineNum"> 475 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 476 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 477 </span> : template<typename... _Args> -<span class="lineNum"> 478 </span> : typename deque<_Tp, _Alloc>::iterator -<span class="lineNum"> 479 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 480 </span> : _M_insert_aux(iterator __pos, _Args&&... __args) -<span class="lineNum"> 481 </span> : { -<span class="lineNum"> 482 </span> : value_type __x_copy(std::forward<_Args>(__args)...); // XXX copy -<span class="lineNum"> 483 </span> : #else -<span class="lineNum"> 484 </span> : typename deque<_Tp, _Alloc>::iterator -<span class="lineNum"> 485 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 486 </span> : _M_insert_aux(iterator __pos, const value_type& __x) -<span class="lineNum"> 487 </span> : { -<span class="lineNum"> 488 </span> : value_type __x_copy = __x; // XXX copy -<span class="lineNum"> 489 </span> : #endif -<span class="lineNum"> 490 </span> : difference_type __index = __pos - this->_M_impl._M_start; -<span class="lineNum"> 491 </span> : if (static_cast<size_type>(__index) < size() / 2) -<span class="lineNum"> 492 </span> : { -<span class="lineNum"> 493 </span> : push_front(_GLIBCXX_MOVE(front())); -<span class="lineNum"> 494 </span> : iterator __front1 = this->_M_impl._M_start; -<span class="lineNum"> 495 </span> : ++__front1; -<span class="lineNum"> 496 </span> : iterator __front2 = __front1; -<span class="lineNum"> 497 </span> : ++__front2; -<span class="lineNum"> 498 </span> : __pos = this->_M_impl._M_start + __index; -<span class="lineNum"> 499 </span> : iterator __pos1 = __pos; -<span class="lineNum"> 500 </span> : ++__pos1; -<span class="lineNum"> 501 </span> : _GLIBCXX_MOVE3(__front2, __pos1, __front1); -<span class="lineNum"> 502 </span> : } -<span class="lineNum"> 503 </span> : else -<span class="lineNum"> 504 </span> : { -<span class="lineNum"> 505 </span> : push_back(_GLIBCXX_MOVE(back())); -<span class="lineNum"> 506 </span> : iterator __back1 = this->_M_impl._M_finish; -<span class="lineNum"> 507 </span> : --__back1; -<span class="lineNum"> 508 </span> : iterator __back2 = __back1; -<span class="lineNum"> 509 </span> : --__back2; -<span class="lineNum"> 510 </span> : __pos = this->_M_impl._M_start + __index; -<span class="lineNum"> 511 </span> : _GLIBCXX_MOVE_BACKWARD3(__pos, __back2, __back1); -<span class="lineNum"> 512 </span> : } -<span class="lineNum"> 513 </span> : *__pos = _GLIBCXX_MOVE(__x_copy); -<span class="lineNum"> 514 </span> : return __pos; -<span class="lineNum"> 515 </span> : } -<span class="lineNum"> 516 </span> : -<span class="lineNum"> 517 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 518 </span> : void -<span class="lineNum"> 519 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 520 </span> : _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) -<span class="lineNum"> 521 </span> : { -<span class="lineNum"> 522 </span> : const difference_type __elems_before = __pos - this->_M_impl._M_start; -<span class="lineNum"> 523 </span> : const size_type __length = this->size(); -<span class="lineNum"> 524 </span> : value_type __x_copy = __x; -<span class="lineNum"> 525 </span> : if (__elems_before < difference_type(__length / 2)) -<span class="lineNum"> 526 </span> : { -<span class="lineNum"> 527 </span> : iterator __new_start = _M_reserve_elements_at_front(__n); -<span class="lineNum"> 528 </span> : iterator __old_start = this->_M_impl._M_start; -<span class="lineNum"> 529 </span> : __pos = this->_M_impl._M_start + __elems_before; -<span class="lineNum"> 530 </span> : try -<span class="lineNum"> 531 </span> : { -<span class="lineNum"> 532 </span> : if (__elems_before >= difference_type(__n)) -<span class="lineNum"> 533 </span> : { -<span class="lineNum"> 534 </span> : iterator __start_n = (this->_M_impl._M_start -<span class="lineNum"> 535 </span> : + difference_type(__n)); -<span class="lineNum"> 536 </span> : std::__uninitialized_move_a(this->_M_impl._M_start, -<span class="lineNum"> 537 </span> : __start_n, __new_start, -<span class="lineNum"> 538 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 539 </span> : this->_M_impl._M_start = __new_start; -<span class="lineNum"> 540 </span> : _GLIBCXX_MOVE3(__start_n, __pos, __old_start); -<span class="lineNum"> 541 </span> : std::fill(__pos - difference_type(__n), __pos, __x_copy); -<span class="lineNum"> 542 </span> : } -<span class="lineNum"> 543 </span> : else -<span class="lineNum"> 544 </span> : { -<span class="lineNum"> 545 </span> : std::__uninitialized_move_fill(this->_M_impl._M_start, -<span class="lineNum"> 546 </span> : __pos, __new_start, -<span class="lineNum"> 547 </span> : this->_M_impl._M_start, -<span class="lineNum"> 548 </span> : __x_copy, -<span class="lineNum"> 549 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 550 </span> : this->_M_impl._M_start = __new_start; -<span class="lineNum"> 551 </span> : std::fill(__old_start, __pos, __x_copy); -<span class="lineNum"> 552 </span> : } -<span class="lineNum"> 553 </span> : } -<span class="lineNum"> 554 </span> : catch(...) -<span class="lineNum"> 555 </span> : { -<span class="lineNum"> 556 </span> : _M_destroy_nodes(__new_start._M_node, -<span class="lineNum"> 557 </span> : this->_M_impl._M_start._M_node); -<span class="lineNum"> 558 </span> : __throw_exception_again; -<span class="lineNum"> 559 </span> : } -<span class="lineNum"> 560 </span> : } -<span class="lineNum"> 561 </span> : else -<span class="lineNum"> 562 </span> : { -<span class="lineNum"> 563 </span> : iterator __new_finish = _M_reserve_elements_at_back(__n); -<span class="lineNum"> 564 </span> : iterator __old_finish = this->_M_impl._M_finish; -<span class="lineNum"> 565 </span> : const difference_type __elems_after = -<span class="lineNum"> 566 </span> : difference_type(__length) - __elems_before; -<span class="lineNum"> 567 </span> : __pos = this->_M_impl._M_finish - __elems_after; -<span class="lineNum"> 568 </span> : try -<span class="lineNum"> 569 </span> : { -<span class="lineNum"> 570 </span> : if (__elems_after > difference_type(__n)) -<span class="lineNum"> 571 </span> : { -<span class="lineNum"> 572 </span> : iterator __finish_n = (this->_M_impl._M_finish -<span class="lineNum"> 573 </span> : - difference_type(__n)); -<span class="lineNum"> 574 </span> : std::__uninitialized_move_a(__finish_n, -<span class="lineNum"> 575 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 576 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 577 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 578 </span> : this->_M_impl._M_finish = __new_finish; -<span class="lineNum"> 579 </span> : _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish); -<span class="lineNum"> 580 </span> : std::fill(__pos, __pos + difference_type(__n), __x_copy); -<span class="lineNum"> 581 </span> : } -<span class="lineNum"> 582 </span> : else -<span class="lineNum"> 583 </span> : { -<span class="lineNum"> 584 </span> : std::__uninitialized_fill_move(this->_M_impl._M_finish, -<span class="lineNum"> 585 </span> : __pos + difference_type(__n), -<span class="lineNum"> 586 </span> : __x_copy, __pos, -<span class="lineNum"> 587 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 588 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 589 </span> : this->_M_impl._M_finish = __new_finish; -<span class="lineNum"> 590 </span> : std::fill(__pos, __old_finish, __x_copy); -<span class="lineNum"> 591 </span> : } -<span class="lineNum"> 592 </span> : } -<span class="lineNum"> 593 </span> : catch(...) -<span class="lineNum"> 594 </span> : { -<span class="lineNum"> 595 </span> : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, -<span class="lineNum"> 596 </span> : __new_finish._M_node + 1); -<span class="lineNum"> 597 </span> : __throw_exception_again; -<span class="lineNum"> 598 </span> : } -<span class="lineNum"> 599 </span> : } -<span class="lineNum"> 600 </span> : } -<span class="lineNum"> 601 </span> : -<span class="lineNum"> 602 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 603 </span> : template <typename _ForwardIterator> -<span class="lineNum"> 604 </span> : void -<span class="lineNum"> 605 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 606 </span> : _M_insert_aux(iterator __pos, -<span class="lineNum"> 607 </span> : _ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 608 </span><span class="lineNoCov"> 0 : size_type __n)</span> -<span class="lineNum"> 609 </span> : { -<span class="lineNum"> 610 </span><span class="lineNoCov"> 0 : const difference_type __elemsbefore = __pos - this->_M_impl._M_start;</span> -<span class="lineNum"> 611 </span><span class="lineNoCov"> 0 : const size_type __length = size();</span> -<span class="lineNum"> 612 </span><span class="lineNoCov"> 0 : if (static_cast<size_type>(__elemsbefore) < __length / 2)</span> -<span class="lineNum"> 613 </span> : { -<span class="lineNum"> 614 </span><span class="lineNoCov"> 0 : iterator __new_start = _M_reserve_elements_at_front(__n);</span> -<span class="lineNum"> 615 </span><span class="lineNoCov"> 0 : iterator __old_start = this->_M_impl._M_start;</span> -<span class="lineNum"> 616 </span><span class="lineNoCov"> 0 : __pos = this->_M_impl._M_start + __elemsbefore;</span> -<span class="lineNum"> 617 </span> : try -<span class="lineNum"> 618 </span> : { -<span class="lineNum"> 619 </span><span class="lineNoCov"> 0 : if (__elemsbefore >= difference_type(__n))</span> -<span class="lineNum"> 620 </span> : { -<span class="lineNum"> 621 </span> : iterator __start_n = (this->_M_impl._M_start -<span class="lineNum"> 622 </span><span class="lineNoCov"> 0 : + difference_type(__n));</span> -<span class="lineNum"> 623 </span><span class="lineNoCov"> 0 : std::__uninitialized_move_a(this->_M_impl._M_start,</span> -<span class="lineNum"> 624 </span> : __start_n, __new_start, -<span class="lineNum"> 625 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 626 </span><span class="lineNoCov"> 0 : this->_M_impl._M_start = __new_start;</span> -<span class="lineNum"> 627 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE3(__start_n, __pos, __old_start);</span> -<span class="lineNum"> 628 </span><span class="lineNoCov"> 0 : std::copy(__first, __last, __pos - difference_type(__n));</span> -<span class="lineNum"> 629 </span> : } -<span class="lineNum"> 630 </span> : else -<span class="lineNum"> 631 </span> : { -<span class="lineNum"> 632 </span><span class="lineNoCov"> 0 : _ForwardIterator __mid = __first;</span> -<span class="lineNum"> 633 </span><span class="lineNoCov"> 0 : std::advance(__mid, difference_type(__n) - __elemsbefore);</span> -<span class="lineNum"> 634 </span><span class="lineNoCov"> 0 : std::__uninitialized_move_copy(this->_M_impl._M_start,</span> -<span class="lineNum"> 635 </span> : __pos, __first, __mid, -<span class="lineNum"> 636 </span> : __new_start, -<span class="lineNum"> 637 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 638 </span><span class="lineNoCov"> 0 : this->_M_impl._M_start = __new_start;</span> -<span class="lineNum"> 639 </span><span class="lineNoCov"> 0 : std::copy(__mid, __last, __old_start);</span> -<span class="lineNum"> 640 </span> : } -<span class="lineNum"> 641 </span> : } -<span class="lineNum"> 642 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 643 </span> : { -<span class="lineNum"> 644 </span><span class="lineNoCov"> 0 : _M_destroy_nodes(__new_start._M_node,</span> -<span class="lineNum"> 645 </span> : this->_M_impl._M_start._M_node); -<span class="lineNum"> 646 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 647 </span> : } -<span class="lineNum"> 648 </span> : } -<span class="lineNum"> 649 </span> : else -<span class="lineNum"> 650 </span> : { -<span class="lineNum"> 651 </span><span class="lineNoCov"> 0 : iterator __new_finish = _M_reserve_elements_at_back(__n);</span> -<span class="lineNum"> 652 </span><span class="lineNoCov"> 0 : iterator __old_finish = this->_M_impl._M_finish;</span> -<span class="lineNum"> 653 </span> : const difference_type __elemsafter = -<span class="lineNum"> 654 </span><span class="lineNoCov"> 0 : difference_type(__length) - __elemsbefore;</span> -<span class="lineNum"> 655 </span><span class="lineNoCov"> 0 : __pos = this->_M_impl._M_finish - __elemsafter;</span> -<span class="lineNum"> 656 </span> : try -<span class="lineNum"> 657 </span> : { -<span class="lineNum"> 658 </span><span class="lineNoCov"> 0 : if (__elemsafter > difference_type(__n))</span> -<span class="lineNum"> 659 </span> : { -<span class="lineNum"> 660 </span> : iterator __finish_n = (this->_M_impl._M_finish -<span class="lineNum"> 661 </span><span class="lineNoCov"> 0 : - difference_type(__n));</span> -<span class="lineNum"> 662 </span><span class="lineNoCov"> 0 : std::__uninitialized_move_a(__finish_n,</span> -<span class="lineNum"> 663 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 664 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 665 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 666 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish = __new_finish;</span> -<span class="lineNum"> 667 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE_BACKWARD3(__pos, __finish_n, __old_finish);</span> -<span class="lineNum"> 668 </span><span class="lineNoCov"> 0 : std::copy(__first, __last, __pos);</span> -<span class="lineNum"> 669 </span> : } -<span class="lineNum"> 670 </span> : else -<span class="lineNum"> 671 </span> : { -<span class="lineNum"> 672 </span><span class="lineNoCov"> 0 : _ForwardIterator __mid = __first;</span> -<span class="lineNum"> 673 </span><span class="lineNoCov"> 0 : std::advance(__mid, __elemsafter);</span> -<span class="lineNum"> 674 </span><span class="lineNoCov"> 0 : std::__uninitialized_copy_move(__mid, __last, __pos,</span> -<span class="lineNum"> 675 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 676 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 677 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 678 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish = __new_finish;</span> -<span class="lineNum"> 679 </span><span class="lineNoCov"> 0 : std::copy(__first, __mid, __pos);</span> -<span class="lineNum"> 680 </span> : } -<span class="lineNum"> 681 </span> : } -<span class="lineNum"> 682 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 683 </span> : { -<span class="lineNum"> 684 </span><span class="lineNoCov"> 0 : _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,</span> -<span class="lineNum"> 685 </span> : __new_finish._M_node + 1); -<span class="lineNum"> 686 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 687 </span> : } -<span class="lineNum"> 688 </span> : } -<span class="lineNum"> 689 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 690 </span> : -<span class="lineNum"> 691 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 692 </span> : void -<span class="lineNum"> 693 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 694 </span><span class="lineCov"> 26 : _M_destroy_data_aux(iterator __first, iterator __last)</span> -<span class="lineNum"> 695 </span> : { -<span class="lineNum"> 696 </span><span class="lineCov"> 26 : for (_Map_pointer __node = __first._M_node + 1;</span> -<span class="lineNum"> 697 </span> : __node < __last._M_node; ++__node) -<span class="lineNum"> 698 </span><span class="lineNoCov"> 0 : std::_Destroy(*__node, *__node + _S_buffer_size(),</span> -<span class="lineNum"> 699 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 700 </span> : -<span class="lineNum"> 701 </span><span class="lineCov"> 26 : if (__first._M_node != __last._M_node)</span> -<span class="lineNum"> 702 </span> : { -<span class="lineNum"> 703 </span><span class="lineNoCov"> 0 : std::_Destroy(__first._M_cur, __first._M_last,</span> -<span class="lineNum"> 704 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 705 </span><span class="lineNoCov"> 0 : std::_Destroy(__last._M_first, __last._M_cur,</span> -<span class="lineNum"> 706 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 707 </span> : } -<span class="lineNum"> 708 </span> : else -<span class="lineNum"> 709 </span><span class="lineCov"> 26 : std::_Destroy(__first._M_cur, __last._M_cur,</span> -<span class="lineNum"> 710 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 711 </span><span class="lineCov"> 26 : }</span> -<span class="lineNum"> 712 </span> : -<span class="lineNum"> 713 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 714 </span> : void -<span class="lineNum"> 715 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 716 </span><span class="lineNoCov"> 0 : _M_new_elements_at_front(size_type __new_elems)</span> -<span class="lineNum"> 717 </span> : { -<span class="lineNum"> 718 </span><span class="lineNoCov"> 0 : if (this->max_size() - this->size() < __new_elems)</span> -<span class="lineNum"> 719 </span><span class="lineNoCov"> 0 : __throw_length_error(__N("deque::_M_new_elements_at_front"));</span> -<span class="lineNum"> 720 </span> : -<span class="lineNum"> 721 </span> : const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) -<span class="lineNum"> 722 </span><span class="lineNoCov"> 0 : / _S_buffer_size());</span> -<span class="lineNum"> 723 </span><span class="lineNoCov"> 0 : _M_reserve_map_at_front(__new_nodes);</span> -<span class="lineNum"> 724 </span> : size_type __i; -<span class="lineNum"> 725 </span> : try -<span class="lineNum"> 726 </span> : { -<span class="lineNum"> 727 </span><span class="lineNoCov"> 0 : for (__i = 1; __i <= __new_nodes; ++__i)</span> -<span class="lineNum"> 728 </span><span class="lineNoCov"> 0 : *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node();</span> -<span class="lineNum"> 729 </span> : } -<span class="lineNum"> 730 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 731 </span> : { -<span class="lineNum"> 732 </span><span class="lineNoCov"> 0 : for (size_type __j = 1; __j < __i; ++__j)</span> -<span class="lineNum"> 733 </span><span class="lineNoCov"> 0 : _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j));</span> -<span class="lineNum"> 734 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 735 </span> : } -<span class="lineNum"> 736 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 737 </span> : -<span class="lineNum"> 738 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 739 </span> : void -<span class="lineNum"> 740 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 741 </span><span class="lineNoCov"> 0 : _M_new_elements_at_back(size_type __new_elems)</span> -<span class="lineNum"> 742 </span> : { -<span class="lineNum"> 743 </span><span class="lineNoCov"> 0 : if (this->max_size() - this->size() < __new_elems)</span> -<span class="lineNum"> 744 </span><span class="lineNoCov"> 0 : __throw_length_error(__N("deque::_M_new_elements_at_back"));</span> -<span class="lineNum"> 745 </span> : -<span class="lineNum"> 746 </span> : const size_type __new_nodes = ((__new_elems + _S_buffer_size() - 1) -<span class="lineNum"> 747 </span><span class="lineNoCov"> 0 : / _S_buffer_size());</span> -<span class="lineNum"> 748 </span><span class="lineNoCov"> 0 : _M_reserve_map_at_back(__new_nodes);</span> -<span class="lineNum"> 749 </span> : size_type __i; -<span class="lineNum"> 750 </span> : try -<span class="lineNum"> 751 </span> : { -<span class="lineNum"> 752 </span><span class="lineNoCov"> 0 : for (__i = 1; __i <= __new_nodes; ++__i)</span> -<span class="lineNum"> 753 </span><span class="lineNoCov"> 0 : *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node();</span> -<span class="lineNum"> 754 </span> : } -<span class="lineNum"> 755 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 756 </span> : { -<span class="lineNum"> 757 </span><span class="lineNoCov"> 0 : for (size_type __j = 1; __j < __i; ++__j)</span> -<span class="lineNum"> 758 </span><span class="lineNoCov"> 0 : _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j));</span> -<span class="lineNum"> 759 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 760 </span> : } -<span class="lineNum"> 761 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 762 </span> : -<span class="lineNum"> 763 </span> : template <typename _Tp, typename _Alloc> -<span class="lineNum"> 764 </span> : void -<span class="lineNum"> 765 </span> : deque<_Tp, _Alloc>:: -<span class="lineNum"> 766 </span><span class="lineNoCov"> 0 : _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front)</span> -<span class="lineNum"> 767 </span> : { -<span class="lineNum"> 768 </span> : const size_type __old_num_nodes -<span class="lineNum"> 769 </span><span class="lineNoCov"> 0 : = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1;</span> -<span class="lineNum"> 770 </span><span class="lineNoCov"> 0 : const size_type __new_num_nodes = __old_num_nodes + __nodes_to_add;</span> -<span class="lineNum"> 771 </span> : -<span class="lineNum"> 772 </span> : _Map_pointer __new_nstart; -<span class="lineNum"> 773 </span><span class="lineNoCov"> 0 : if (this->_M_impl._M_map_size > 2 * __new_num_nodes)</span> -<span class="lineNum"> 774 </span> : { -<span class="lineNum"> 775 </span><span class="lineNoCov"> 0 : __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size</span> -<span class="lineNum"> 776 </span> : - __new_num_nodes) / 2 -<span class="lineNum"> 777 </span> : + (__add_at_front ? __nodes_to_add : 0); -<span class="lineNum"> 778 </span><span class="lineNoCov"> 0 : if (__new_nstart < this->_M_impl._M_start._M_node)</span> -<span class="lineNum"> 779 </span><span class="lineNoCov"> 0 : std::copy(this->_M_impl._M_start._M_node,</span> -<span class="lineNum"> 780 </span> : this->_M_impl._M_finish._M_node + 1, -<span class="lineNum"> 781 </span> : __new_nstart); -<span class="lineNum"> 782 </span> : else -<span class="lineNum"> 783 </span><span class="lineNoCov"> 0 : std::copy_backward(this->_M_impl._M_start._M_node,</span> -<span class="lineNum"> 784 </span> : this->_M_impl._M_finish._M_node + 1, -<span class="lineNum"> 785 </span> : __new_nstart + __old_num_nodes); -<span class="lineNum"> 786 </span> : } -<span class="lineNum"> 787 </span> : else -<span class="lineNum"> 788 </span> : { -<span class="lineNum"> 789 </span> : size_type __new_map_size = this->_M_impl._M_map_size -<span class="lineNum"> 790 </span> : + std::max(this->_M_impl._M_map_size, -<span class="lineNum"> 791 </span><span class="lineNoCov"> 0 : __nodes_to_add) + 2;</span> -<span class="lineNum"> 792 </span> : -<span class="lineNum"> 793 </span><span class="lineNoCov"> 0 : _Map_pointer __new_map = this->_M_allocate_map(__new_map_size);</span> -<span class="lineNum"> 794 </span><span class="lineNoCov"> 0 : __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2</span> -<span class="lineNum"> 795 </span> : + (__add_at_front ? __nodes_to_add : 0); -<span class="lineNum"> 796 </span><span class="lineNoCov"> 0 : std::copy(this->_M_impl._M_start._M_node,</span> -<span class="lineNum"> 797 </span> : this->_M_impl._M_finish._M_node + 1, -<span class="lineNum"> 798 </span> : __new_nstart); -<span class="lineNum"> 799 </span><span class="lineNoCov"> 0 : _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</span> -<span class="lineNum"> 800 </span> : -<span class="lineNum"> 801 </span><span class="lineNoCov"> 0 : this->_M_impl._M_map = __new_map;</span> -<span class="lineNum"> 802 </span><span class="lineNoCov"> 0 : this->_M_impl._M_map_size = __new_map_size;</span> -<span class="lineNum"> 803 </span> : } -<span class="lineNum"> 804 </span> : -<span class="lineNum"> 805 </span><span class="lineNoCov"> 0 : this->_M_impl._M_start._M_set_node(__new_nstart);</span> -<span class="lineNum"> 806 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1);</span> -<span class="lineNum"> 807 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 808 </span> : -<span class="lineNum"> 809 </span> : // Overload for deque::iterators, exploiting the "segmented-iterator -<span class="lineNum"> 810 </span> : // optimization". NB: leave const_iterators alone! -<span class="lineNum"> 811 </span> : template<typename _Tp> -<span class="lineNum"> 812 </span> : void -<span class="lineNum"> 813 </span> : fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, -<span class="lineNum"> 814 </span> : const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value) -<span class="lineNum"> 815 </span> : { -<span class="lineNum"> 816 </span> : typedef typename _Deque_iterator<_Tp, _Tp&, _Tp*>::_Self _Self; -<span class="lineNum"> 817 </span> : -<span class="lineNum"> 818 </span> : for (typename _Self::_Map_pointer __node = __first._M_node + 1; -<span class="lineNum"> 819 </span> : __node < __last._M_node; ++__node) -<span class="lineNum"> 820 </span> : std::fill(*__node, *__node + _Self::_S_buffer_size(), __value); -<span class="lineNum"> 821 </span> : -<span class="lineNum"> 822 </span> : if (__first._M_node != __last._M_node) -<span class="lineNum"> 823 </span> : { -<span class="lineNum"> 824 </span> : std::fill(__first._M_cur, __first._M_last, __value); -<span class="lineNum"> 825 </span> : std::fill(__last._M_first, __last._M_cur, __value); -<span class="lineNum"> 826 </span> : } -<span class="lineNum"> 827 </span> : else -<span class="lineNum"> 828 </span> : std::fill(__first._M_cur, __last._M_cur, __value); -<span class="lineNum"> 829 </span> : } -<span class="lineNum"> 830 </span> : -<span class="lineNum"> 831 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 832 </span> : -<span class="lineNum"> 833 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/index.html b/rep/usr/include/c++/4.3/bits/index.html deleted file mode 100644 index 4e6a4f9..0000000 --- a/rep/usr/include/c++/4.3/bits/index.html +++ /dev/null @@ -1,353 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/c++/4.3/bits</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2051</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">69.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1418</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="allocator.h.gcov.html">allocator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=71 height=10 alt="71.4%"><img src="../../../../../snow.png" width=29 height=10 alt="71.4%"></td></tr></table> - </td> - <td class="coverPerHi">71.4 %</td> - <td class="coverNumHi">5 / 7 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="basic_ios.h.gcov.html">basic_ios.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 35 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="basic_string.h.gcov.html">basic_string.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../amber.png" width=17 height=10 alt="17.4%"><img src="../../../../../snow.png" width=83 height=10 alt="17.4%"></td></tr></table> - </td> - <td class="coverPerMed">17.4 %</td> - <td class="coverNumMed">31 / 178 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="basic_string.tcc.gcov.html">basic_string.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=74 height=10 alt="73.9%"><img src="../../../../../snow.png" width=26 height=10 alt="73.9%"></td></tr></table> - </td> - <td class="coverPerHi">73.9 %</td> - <td class="coverNumHi">17 / 23 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="char_traits.h.gcov.html">char_traits.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../amber.png" width=46 height=10 alt="46.2%"><img src="../../../../../snow.png" width=54 height=10 alt="46.2%"></td></tr></table> - </td> - <td class="coverPerMed">46.2 %</td> - <td class="coverNumMed">6 / 13 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="deque.tcc.gcov.html">deque.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../amber.png" width=19 height=10 alt="19.0%"><img src="../../../../../snow.png" width=81 height=10 alt="19.0%"></td></tr></table> - </td> - <td class="coverPerMed">19.0 %</td> - <td class="coverNumMed">28 / 147 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="ios_base.h.gcov.html">ios_base.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=67 height=10 alt="66.7%"><img src="../../../../../snow.png" width=33 height=10 alt="66.7%"></td></tr></table> - </td> - <td class="coverPerHi">66.7 %</td> - <td class="coverNumHi">20 / 30 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="list.tcc.gcov.html">list.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">11 / 11 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="locale_facets.h.gcov.html">locale_facets.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 13 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="postypes.h.gcov.html">postypes.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 3 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_algo.h.gcov.html">stl_algo.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=85 height=10 alt="85.0%"><img src="../../../../../snow.png" width=15 height=10 alt="85.0%"></td></tr></table> - </td> - <td class="coverPerHi">85.0 %</td> - <td class="coverNumHi">192 / 226 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_algobase.h.gcov.html">stl_algobase.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=91 height=10 alt="91.1%"><img src="../../../../../snow.png" width=9 height=10 alt="91.1%"></td></tr></table> - </td> - <td class="coverPerHi">91.1 %</td> - <td class="coverNumHi">72 / 79 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_bvector.h.gcov.html">stl_bvector.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=70 height=10 alt="70.4%"><img src="../../../../../snow.png" width=30 height=10 alt="70.4%"></td></tr></table> - </td> - <td class="coverPerHi">70.4 %</td> - <td class="coverNumHi">81 / 115 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_construct.h.gcov.html">stl_construct.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">12 / 12 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_deque.h.gcov.html">stl_deque.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=78 height=10 alt="78.3%"><img src="../../../../../snow.png" width=22 height=10 alt="78.3%"></td></tr></table> - </td> - <td class="coverPerHi">78.3 %</td> - <td class="coverNumHi">148 / 189 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_function.h.gcov.html">stl_function.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">17 / 17 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_heap.h.gcov.html">stl_heap.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 92 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_iterator.h.gcov.html">stl_iterator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=94 height=10 alt="93.9%"><img src="../../../../../snow.png" width=6 height=10 alt="93.9%"></td></tr></table> - </td> - <td class="coverPerHi">93.9 %</td> - <td class="coverNumHi">62 / 66 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_iterator_base_funcs.h.gcov.html">stl_iterator_base_funcs.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=82 height=10 alt="82.1%"><img src="../../../../../snow.png" width=18 height=10 alt="82.1%"></td></tr></table> - </td> - <td class="coverPerHi">82.1 %</td> - <td class="coverNumHi">23 / 28 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_iterator_base_types.h.gcov.html">stl_iterator_base_types.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">3 / 3 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_list.h.gcov.html">stl_list.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=94 height=10 alt="93.6%"><img src="../../../../../snow.png" width=6 height=10 alt="93.6%"></td></tr></table> - </td> - <td class="coverPerHi">93.6 %</td> - <td class="coverNumHi">88 / 94 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_map.h.gcov.html">stl_map.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">41 / 41 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_move.h.gcov.html">stl_move.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">5 / 5 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_pair.h.gcov.html">stl_pair.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">9 / 9 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_set.h.gcov.html">stl_set.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">33 / 33 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_stack.h.gcov.html">stl_stack.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">12 / 12 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_tree.h.gcov.html">stl_tree.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=94 height=10 alt="94.2%"><img src="../../../../../snow.png" width=6 height=10 alt="94.2%"></td></tr></table> - </td> - <td class="coverPerHi">94.2 %</td> - <td class="coverNumHi">278 / 295 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_uninitialized.h.gcov.html">stl_uninitialized.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=58 height=10 alt="58.1%"><img src="../../../../../snow.png" width=42 height=10 alt="58.1%"></td></tr></table> - </td> - <td class="coverPerHi">58.1 %</td> - <td class="coverNumHi">25 / 43 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stl_vector.h.gcov.html">stl_vector.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=91 height=10 alt="91.3%"><img src="../../../../../snow.png" width=9 height=10 alt="91.3%"></td></tr></table> - </td> - <td class="coverPerHi">91.3 %</td> - <td class="coverNumHi">94 / 103 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stream_iterator.h.gcov.html">stream_iterator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">33 / 33 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="vector.tcc.gcov.html">vector.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=75 height=10 alt="75.0%"><img src="../../../../../snow.png" width=25 height=10 alt="75.0%"></td></tr></table> - </td> - <td class="coverPerHi">75.0 %</td> - <td class="coverNumHi">72 / 96 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/ios_base.h.gcov.html b/rep/usr/include/c++/4.3/bits/ios_base.h.gcov.html deleted file mode 100644 index 091c26d..0000000 --- a/rep/usr/include/c++/4.3/bits/ios_base.h.gcov.html +++ /dev/null @@ -1,1039 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/ios_base.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - ios_base.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">30</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">66.7 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">20</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Iostreams base classes -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file ios_base.h -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : // ISO C++ 14882: 27.4 Iostreams base classes -<span class="lineNum"> 39 </span> : // -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #ifndef _IOS_BASE_H -<span class="lineNum"> 42 </span> : #define _IOS_BASE_H 1 -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #pragma GCC system_header -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : #include <ext/atomicity.h> -<span class="lineNum"> 47 </span> : #include <bits/localefwd.h> -<span class="lineNum"> 48 </span> : #include <bits/locale_classes.h> -<span class="lineNum"> 49 </span> : #include <cstdio> // For SEEK_CUR, SEEK_END -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : // The following definitions of bitmask types are enums, not ints, -<span class="lineNum"> 54 </span> : // as permitted (but not required) in the standard, in order to provide -<span class="lineNum"> 55 </span> : // better type safety in iostream calls. A side effect is that -<span class="lineNum"> 56 </span> : // expressions involving them are no longer compile-time constants. -<span class="lineNum"> 57 </span> : enum _Ios_Fmtflags -<span class="lineNum"> 58 </span> : { -<span class="lineNum"> 59 </span> : _S_boolalpha = 1L << 0, -<span class="lineNum"> 60 </span> : _S_dec = 1L << 1, -<span class="lineNum"> 61 </span> : _S_fixed = 1L << 2, -<span class="lineNum"> 62 </span> : _S_hex = 1L << 3, -<span class="lineNum"> 63 </span> : _S_internal = 1L << 4, -<span class="lineNum"> 64 </span> : _S_left = 1L << 5, -<span class="lineNum"> 65 </span> : _S_oct = 1L << 6, -<span class="lineNum"> 66 </span> : _S_right = 1L << 7, -<span class="lineNum"> 67 </span> : _S_scientific = 1L << 8, -<span class="lineNum"> 68 </span> : _S_showbase = 1L << 9, -<span class="lineNum"> 69 </span> : _S_showpoint = 1L << 10, -<span class="lineNum"> 70 </span> : _S_showpos = 1L << 11, -<span class="lineNum"> 71 </span> : _S_skipws = 1L << 12, -<span class="lineNum"> 72 </span> : _S_unitbuf = 1L << 13, -<span class="lineNum"> 73 </span> : _S_uppercase = 1L << 14, -<span class="lineNum"> 74 </span> : _S_adjustfield = _S_left | _S_right | _S_internal, -<span class="lineNum"> 75 </span> : _S_basefield = _S_dec | _S_oct | _S_hex, -<span class="lineNum"> 76 </span> : _S_floatfield = _S_scientific | _S_fixed, -<span class="lineNum"> 77 </span> : _S_ios_fmtflags_end = 1L << 16 -<span class="lineNum"> 78 </span> : }; -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : inline _Ios_Fmtflags -<span class="lineNum"> 81 </span><span class="lineCov"> 66 : operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b)</span> -<span class="lineNum"> 82 </span><span class="lineCov"> 66 : { return _Ios_Fmtflags(static_cast<int>(__a) & static_cast<int>(__b)); }</span> -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : inline _Ios_Fmtflags -<span class="lineNum"> 85 </span><span class="lineCov"> 33 : operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b)</span> -<span class="lineNum"> 86 </span><span class="lineCov"> 33 : { return _Ios_Fmtflags(static_cast<int>(__a) | static_cast<int>(__b)); }</span> -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : inline _Ios_Fmtflags -<span class="lineNum"> 89 </span> : operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b) -<span class="lineNum"> 90 </span> : { return _Ios_Fmtflags(static_cast<int>(__a) ^ static_cast<int>(__b)); } -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : inline _Ios_Fmtflags& -<span class="lineNum"> 93 </span><span class="lineCov"> 33 : operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)</span> -<span class="lineNum"> 94 </span><span class="lineCov"> 33 : { return __a = __a | __b; }</span> -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : inline _Ios_Fmtflags& -<span class="lineNum"> 97 </span><span class="lineCov"> 33 : operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b)</span> -<span class="lineNum"> 98 </span><span class="lineCov"> 33 : { return __a = __a & __b; }</span> -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : inline _Ios_Fmtflags& -<span class="lineNum"> 101 </span> : operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) -<span class="lineNum"> 102 </span> : { return __a = __a ^ __b; } -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : inline _Ios_Fmtflags -<span class="lineNum"> 105 </span><span class="lineCov"> 33 : operator~(_Ios_Fmtflags __a)</span> -<span class="lineNum"> 106 </span><span class="lineCov"> 33 : { return _Ios_Fmtflags(~static_cast<int>(__a)); }</span> -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : enum _Ios_Openmode -<span class="lineNum"> 110 </span> : { -<span class="lineNum"> 111 </span> : _S_app = 1L << 0, -<span class="lineNum"> 112 </span> : _S_ate = 1L << 1, -<span class="lineNum"> 113 </span> : _S_bin = 1L << 2, -<span class="lineNum"> 114 </span> : _S_in = 1L << 3, -<span class="lineNum"> 115 </span> : _S_out = 1L << 4, -<span class="lineNum"> 116 </span> : _S_trunc = 1L << 5, -<span class="lineNum"> 117 </span> : _S_ios_openmode_end = 1L << 16 -<span class="lineNum"> 118 </span> : }; -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : inline _Ios_Openmode -<span class="lineNum"> 121 </span><span class="lineNoCov"> 0 : operator&(_Ios_Openmode __a, _Ios_Openmode __b)</span> -<span class="lineNum"> 122 </span><span class="lineNoCov"> 0 : { return _Ios_Openmode(static_cast<int>(__a) & static_cast<int>(__b)); }</span> -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : inline _Ios_Openmode -<span class="lineNum"> 125 </span><span class="lineCov"> 1364 : operator|(_Ios_Openmode __a, _Ios_Openmode __b)</span> -<span class="lineNum"> 126 </span><span class="lineCov"> 1364 : { return _Ios_Openmode(static_cast<int>(__a) | static_cast<int>(__b)); }</span> -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : inline _Ios_Openmode -<span class="lineNum"> 129 </span> : operator^(_Ios_Openmode __a, _Ios_Openmode __b) -<span class="lineNum"> 130 </span> : { return _Ios_Openmode(static_cast<int>(__a) ^ static_cast<int>(__b)); } -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : inline _Ios_Openmode& -<span class="lineNum"> 133 </span> : operator|=(_Ios_Openmode& __a, _Ios_Openmode __b) -<span class="lineNum"> 134 </span> : { return __a = __a | __b; } -<span class="lineNum"> 135 </span> : -<span class="lineNum"> 136 </span> : inline _Ios_Openmode& -<span class="lineNum"> 137 </span> : operator&=(_Ios_Openmode& __a, _Ios_Openmode __b) -<span class="lineNum"> 138 </span> : { return __a = __a & __b; } -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : inline _Ios_Openmode& -<span class="lineNum"> 141 </span> : operator^=(_Ios_Openmode& __a, _Ios_Openmode __b) -<span class="lineNum"> 142 </span> : { return __a = __a ^ __b; } -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : inline _Ios_Openmode -<span class="lineNum"> 145 </span> : operator~(_Ios_Openmode __a) -<span class="lineNum"> 146 </span> : { return _Ios_Openmode(~static_cast<int>(__a)); } -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : enum _Ios_Iostate -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span> : _S_goodbit = 0, -<span class="lineNum"> 152 </span> : _S_badbit = 1L << 0, -<span class="lineNum"> 153 </span> : _S_eofbit = 1L << 1, -<span class="lineNum"> 154 </span> : _S_failbit = 1L << 2, -<span class="lineNum"> 155 </span> : _S_ios_iostate_end = 1L << 16 -<span class="lineNum"> 156 </span> : }; -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : inline _Ios_Iostate -<span class="lineNum"> 159 </span><span class="lineNoCov"> 0 : operator&(_Ios_Iostate __a, _Ios_Iostate __b)</span> -<span class="lineNum"> 160 </span><span class="lineNoCov"> 0 : { return _Ios_Iostate(static_cast<int>(__a) & static_cast<int>(__b)); }</span> -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : inline _Ios_Iostate -<span class="lineNum"> 163 </span><span class="lineNoCov"> 0 : operator|(_Ios_Iostate __a, _Ios_Iostate __b)</span> -<span class="lineNum"> 164 </span><span class="lineNoCov"> 0 : { return _Ios_Iostate(static_cast<int>(__a) | static_cast<int>(__b)); }</span> -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : inline _Ios_Iostate -<span class="lineNum"> 167 </span> : operator^(_Ios_Iostate __a, _Ios_Iostate __b) -<span class="lineNum"> 168 </span> : { return _Ios_Iostate(static_cast<int>(__a) ^ static_cast<int>(__b)); } -<span class="lineNum"> 169 </span> : -<span class="lineNum"> 170 </span> : inline _Ios_Iostate& -<span class="lineNum"> 171 </span> : operator|=(_Ios_Iostate& __a, _Ios_Iostate __b) -<span class="lineNum"> 172 </span> : { return __a = __a | __b; } -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : inline _Ios_Iostate& -<span class="lineNum"> 175 </span> : operator&=(_Ios_Iostate& __a, _Ios_Iostate __b) -<span class="lineNum"> 176 </span> : { return __a = __a & __b; } -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : inline _Ios_Iostate& -<span class="lineNum"> 179 </span> : operator^=(_Ios_Iostate& __a, _Ios_Iostate __b) -<span class="lineNum"> 180 </span> : { return __a = __a ^ __b; } -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : inline _Ios_Iostate -<span class="lineNum"> 183 </span> : operator~(_Ios_Iostate __a) -<span class="lineNum"> 184 </span> : { return _Ios_Iostate(~static_cast<int>(__a)); } -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span> : enum _Ios_Seekdir -<span class="lineNum"> 187 </span> : { -<span class="lineNum"> 188 </span> : _S_beg = 0, -<span class="lineNum"> 189 </span> : _S_cur = SEEK_CUR, -<span class="lineNum"> 190 </span> : _S_end = SEEK_END, -<span class="lineNum"> 191 </span> : _S_ios_seekdir_end = 1L << 16 -<span class="lineNum"> 192 </span> : }; -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : // 27.4.2 Class ios_base -<span class="lineNum"> 195 </span> : /** -<span class="lineNum"> 196 </span> : * @brief The base of the I/O class hierarchy. -<span class="lineNum"> 197 </span> : * -<span class="lineNum"> 198 </span> : * This class defines everything that can be defined about I/O that does -<span class="lineNum"> 199 </span> : * not depend on the type of characters being input or output. Most -<span class="lineNum"> 200 </span> : * people will only see @c ios_base when they need to specify the full -<span class="lineNum"> 201 </span> : * name of the various I/O flags (e.g., the openmodes). -<span class="lineNum"> 202 </span> : */ -<span class="lineNum"> 203 </span> : class ios_base -<span class="lineNum"> 204 </span> : { -<span class="lineNum"> 205 </span> : public: -<span class="lineNum"> 206 </span> : -<span class="lineNum"> 207 </span> : // 27.4.2.1.1 Class ios_base::failure -<span class="lineNum"> 208 </span> : /// These are thrown to indicate problems. Doc me. -<span class="lineNum"> 209 </span> : class failure : public exception -<span class="lineNum"> 210 </span> : { -<span class="lineNum"> 211 </span> : public: -<span class="lineNum"> 212 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 213 </span> : // 48. Use of non-existent exception constructor -<span class="lineNum"> 214 </span> : explicit -<span class="lineNum"> 215 </span> : failure(const string& __str) throw(); -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : // This declaration is not useless: -<span class="lineNum"> 218 </span> : // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 -<span class="lineNum"> 219 </span> : virtual -<span class="lineNum"> 220 </span> : ~failure() throw(); -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : virtual const char* -<span class="lineNum"> 223 </span> : what() const throw(); -<span class="lineNum"> 224 </span> : -<span class="lineNum"> 225 </span> : private: -<span class="lineNum"> 226 </span> : string _M_msg; -<span class="lineNum"> 227 </span> : }; -<span class="lineNum"> 228 </span> : -<span class="lineNum"> 229 </span> : // 27.4.2.1.2 Type ios_base::fmtflags -<span class="lineNum"> 230 </span> : /** -<span class="lineNum"> 231 </span> : * @brief This is a bitmask type. -<span class="lineNum"> 232 </span> : * -<span class="lineNum"> 233 </span> : * @c "_Ios_Fmtflags" is implementation-defined, but it is valid to -<span class="lineNum"> 234 </span> : * perform bitwise operations on these values and expect the Right -<span class="lineNum"> 235 </span> : * Thing to happen. Defined objects of type fmtflags are: -<span class="lineNum"> 236 </span> : * - boolalpha -<span class="lineNum"> 237 </span> : * - dec -<span class="lineNum"> 238 </span> : * - fixed -<span class="lineNum"> 239 </span> : * - hex -<span class="lineNum"> 240 </span> : * - internal -<span class="lineNum"> 241 </span> : * - left -<span class="lineNum"> 242 </span> : * - oct -<span class="lineNum"> 243 </span> : * - right -<span class="lineNum"> 244 </span> : * - scientific -<span class="lineNum"> 245 </span> : * - showbase -<span class="lineNum"> 246 </span> : * - showpoint -<span class="lineNum"> 247 </span> : * - showpos -<span class="lineNum"> 248 </span> : * - skipws -<span class="lineNum"> 249 </span> : * - unitbuf -<span class="lineNum"> 250 </span> : * - uppercase -<span class="lineNum"> 251 </span> : * - adjustfield -<span class="lineNum"> 252 </span> : * - basefield -<span class="lineNum"> 253 </span> : * - floatfield -<span class="lineNum"> 254 </span> : */ -<span class="lineNum"> 255 </span> : typedef _Ios_Fmtflags fmtflags; -<span class="lineNum"> 256 </span> : -<span class="lineNum"> 257 </span> : /// Insert/extract @c bool in alphabetic rather than numeric format. -<span class="lineNum"> 258 </span> : static const fmtflags boolalpha = _S_boolalpha; -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : /// Converts integer input or generates integer output in decimal base. -<span class="lineNum"> 261 </span> : static const fmtflags dec = _S_dec; -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : /// Generate floating-point output in fixed-point notation. -<span class="lineNum"> 264 </span> : static const fmtflags fixed = _S_fixed; -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : /// Converts integer input or generates integer output in hexadecimal base. -<span class="lineNum"> 267 </span> : static const fmtflags hex = _S_hex; -<span class="lineNum"> 268 </span> : -<span class="lineNum"> 269 </span> : /// Adds fill characters at a designated internal point in certain -<span class="lineNum"> 270 </span> : /// generated output, or identical to @c right if no such point is -<span class="lineNum"> 271 </span> : /// designated. -<span class="lineNum"> 272 </span> : static const fmtflags internal = _S_internal; -<span class="lineNum"> 273 </span> : -<span class="lineNum"> 274 </span> : /// Adds fill characters on the right (final positions) of certain -<span class="lineNum"> 275 </span> : /// generated output. (I.e., the thing you print is flush left.) -<span class="lineNum"> 276 </span> : static const fmtflags left = _S_left; -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : /// Converts integer input or generates integer output in octal base. -<span class="lineNum"> 279 </span> : static const fmtflags oct = _S_oct; -<span class="lineNum"> 280 </span> : -<span class="lineNum"> 281 </span> : /// Adds fill characters on the left (initial positions) of certain -<span class="lineNum"> 282 </span> : /// generated output. (I.e., the thing you print is flush right.) -<span class="lineNum"> 283 </span> : static const fmtflags right = _S_right; -<span class="lineNum"> 284 </span> : -<span class="lineNum"> 285 </span> : /// Generates floating-point output in scientific notation. -<span class="lineNum"> 286 </span> : static const fmtflags scientific = _S_scientific; -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : /// Generates a prefix indicating the numeric base of generated integer -<span class="lineNum"> 289 </span> : /// output. -<span class="lineNum"> 290 </span> : static const fmtflags showbase = _S_showbase; -<span class="lineNum"> 291 </span> : -<span class="lineNum"> 292 </span> : /// Generates a decimal-point character unconditionally in generated -<span class="lineNum"> 293 </span> : /// floating-point output. -<span class="lineNum"> 294 </span> : static const fmtflags showpoint = _S_showpoint; -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : /// Generates a + sign in non-negative generated numeric output. -<span class="lineNum"> 297 </span> : static const fmtflags showpos = _S_showpos; -<span class="lineNum"> 298 </span> : -<span class="lineNum"> 299 </span> : /// Skips leading white space before certain input operations. -<span class="lineNum"> 300 </span> : static const fmtflags skipws = _S_skipws; -<span class="lineNum"> 301 </span> : -<span class="lineNum"> 302 </span> : /// Flushes output after each output operation. -<span class="lineNum"> 303 </span> : static const fmtflags unitbuf = _S_unitbuf; -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : /// Replaces certain lowercase letters with their uppercase equivalents -<span class="lineNum"> 306 </span> : /// in generated output. -<span class="lineNum"> 307 </span> : static const fmtflags uppercase = _S_uppercase; -<span class="lineNum"> 308 </span> : -<span class="lineNum"> 309 </span> : /// A mask of left|right|internal. Useful for the 2-arg form of @c setf. -<span class="lineNum"> 310 </span> : static const fmtflags adjustfield = _S_adjustfield; -<span class="lineNum"> 311 </span> : -<span class="lineNum"> 312 </span> : /// A mask of dec|oct|hex. Useful for the 2-arg form of @c setf. -<span class="lineNum"> 313 </span> : static const fmtflags basefield = _S_basefield; -<span class="lineNum"> 314 </span> : -<span class="lineNum"> 315 </span> : /// A mask of scientific|fixed. Useful for the 2-arg form of @c setf. -<span class="lineNum"> 316 </span> : static const fmtflags floatfield = _S_floatfield; -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : // 27.4.2.1.3 Type ios_base::iostate -<span class="lineNum"> 319 </span> : /** -<span class="lineNum"> 320 </span> : * @brief This is a bitmask type. -<span class="lineNum"> 321 </span> : * -<span class="lineNum"> 322 </span> : * @c "_Ios_Iostate" is implementation-defined, but it is valid to -<span class="lineNum"> 323 </span> : * perform bitwise operations on these values and expect the Right -<span class="lineNum"> 324 </span> : * Thing to happen. Defined objects of type iostate are: -<span class="lineNum"> 325 </span> : * - badbit -<span class="lineNum"> 326 </span> : * - eofbit -<span class="lineNum"> 327 </span> : * - failbit -<span class="lineNum"> 328 </span> : * - goodbit -<span class="lineNum"> 329 </span> : */ -<span class="lineNum"> 330 </span> : typedef _Ios_Iostate iostate; -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : /// Indicates a loss of integrity in an input or output sequence (such -<span class="lineNum"> 333 </span> : /// as an irrecoverable read error from a file). -<span class="lineNum"> 334 </span> : static const iostate badbit = _S_badbit; -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : /// Indicates that an input operation reached the end of an input sequence. -<span class="lineNum"> 337 </span> : static const iostate eofbit = _S_eofbit; -<span class="lineNum"> 338 </span> : -<span class="lineNum"> 339 </span> : /// Indicates that an input operation failed to read the expected -<span class="lineNum"> 340 </span> : /// characters, or that an output operation failed to generate the -<span class="lineNum"> 341 </span> : /// desired characters. -<span class="lineNum"> 342 </span> : static const iostate failbit = _S_failbit; -<span class="lineNum"> 343 </span> : -<span class="lineNum"> 344 </span> : /// Indicates all is well. -<span class="lineNum"> 345 </span> : static const iostate goodbit = _S_goodbit; -<span class="lineNum"> 346 </span> : -<span class="lineNum"> 347 </span> : // 27.4.2.1.4 Type ios_base::openmode -<span class="lineNum"> 348 </span> : /** -<span class="lineNum"> 349 </span> : * @brief This is a bitmask type. -<span class="lineNum"> 350 </span> : * -<span class="lineNum"> 351 </span> : * @c "_Ios_Openmode" is implementation-defined, but it is valid to -<span class="lineNum"> 352 </span> : * perform bitwise operations on these values and expect the Right -<span class="lineNum"> 353 </span> : * Thing to happen. Defined objects of type openmode are: -<span class="lineNum"> 354 </span> : * - app -<span class="lineNum"> 355 </span> : * - ate -<span class="lineNum"> 356 </span> : * - binary -<span class="lineNum"> 357 </span> : * - in -<span class="lineNum"> 358 </span> : * - out -<span class="lineNum"> 359 </span> : * - trunc -<span class="lineNum"> 360 </span> : */ -<span class="lineNum"> 361 </span> : typedef _Ios_Openmode openmode; -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : /// Seek to end before each write. -<span class="lineNum"> 364 </span> : static const openmode app = _S_app; -<span class="lineNum"> 365 </span> : -<span class="lineNum"> 366 </span> : /// Open and seek to end immediately after opening. -<span class="lineNum"> 367 </span> : static const openmode ate = _S_ate; -<span class="lineNum"> 368 </span> : -<span class="lineNum"> 369 </span> : /// Perform input and output in binary mode (as opposed to text mode). -<span class="lineNum"> 370 </span> : /// This is probably not what you think it is; see -<span class="lineNum"> 371 </span> : /// http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#3 and -<span class="lineNum"> 372 </span> : /// http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#7 for more. -<span class="lineNum"> 373 </span> : static const openmode binary = _S_bin; -<span class="lineNum"> 374 </span> : -<span class="lineNum"> 375 </span> : /// Open for input. Default for @c ifstream and fstream. -<span class="lineNum"> 376 </span> : static const openmode in = _S_in; -<span class="lineNum"> 377 </span> : -<span class="lineNum"> 378 </span> : /// Open for output. Default for @c ofstream and fstream. -<span class="lineNum"> 379 </span> : static const openmode out = _S_out; -<span class="lineNum"> 380 </span> : -<span class="lineNum"> 381 </span> : /// Open for input. Default for @c ofstream. -<span class="lineNum"> 382 </span> : static const openmode trunc = _S_trunc; -<span class="lineNum"> 383 </span> : -<span class="lineNum"> 384 </span> : // 27.4.2.1.5 Type ios_base::seekdir -<span class="lineNum"> 385 </span> : /** -<span class="lineNum"> 386 </span> : * @brief This is an enumerated type. -<span class="lineNum"> 387 </span> : * -<span class="lineNum"> 388 </span> : * @c "_Ios_Seekdir" is implementation-defined. Defined values -<span class="lineNum"> 389 </span> : * of type seekdir are: -<span class="lineNum"> 390 </span> : * - beg -<span class="lineNum"> 391 </span> : * - cur, equivalent to @c SEEK_CUR in the C standard library. -<span class="lineNum"> 392 </span> : * - end, equivalent to @c SEEK_END in the C standard library. -<span class="lineNum"> 393 </span> : */ -<span class="lineNum"> 394 </span> : typedef _Ios_Seekdir seekdir; -<span class="lineNum"> 395 </span> : -<span class="lineNum"> 396 </span> : /// Request a seek relative to the beginning of the stream. -<span class="lineNum"> 397 </span> : static const seekdir beg = _S_beg; -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : /// Request a seek relative to the current position within the sequence. -<span class="lineNum"> 400 </span> : static const seekdir cur = _S_cur; -<span class="lineNum"> 401 </span> : -<span class="lineNum"> 402 </span> : /// Request a seek relative to the current end of the sequence. -<span class="lineNum"> 403 </span> : static const seekdir end = _S_end; -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : // Annex D.6 -<span class="lineNum"> 406 </span> : typedef int io_state; -<span class="lineNum"> 407 </span> : typedef int open_mode; -<span class="lineNum"> 408 </span> : typedef int seek_dir; -<span class="lineNum"> 409 </span> : -<span class="lineNum"> 410 </span> : typedef std::streampos streampos; -<span class="lineNum"> 411 </span> : typedef std::streamoff streamoff; -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span> : // Callbacks; -<span class="lineNum"> 414 </span> : /** -<span class="lineNum"> 415 </span> : * @brief The set of events that may be passed to an event callback. -<span class="lineNum"> 416 </span> : * -<span class="lineNum"> 417 </span> : * erase_event is used during ~ios() and copyfmt(). imbue_event is used -<span class="lineNum"> 418 </span> : * during imbue(). copyfmt_event is used during copyfmt(). -<span class="lineNum"> 419 </span> : */ -<span class="lineNum"> 420 </span> : enum event -<span class="lineNum"> 421 </span> : { -<span class="lineNum"> 422 </span> : erase_event, -<span class="lineNum"> 423 </span> : imbue_event, -<span class="lineNum"> 424 </span> : copyfmt_event -<span class="lineNum"> 425 </span> : }; -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span> : /** -<span class="lineNum"> 428 </span> : * @brief The type of an event callback function. -<span class="lineNum"> 429 </span> : * @param event One of the members of the event enum. -<span class="lineNum"> 430 </span> : * @param ios_base Reference to the ios_base object. -<span class="lineNum"> 431 </span> : * @param int The integer provided when the callback was registered. -<span class="lineNum"> 432 </span> : * -<span class="lineNum"> 433 </span> : * Event callbacks are user defined functions that get called during -<span class="lineNum"> 434 </span> : * several ios_base and basic_ios functions, specifically imbue(), -<span class="lineNum"> 435 </span> : * copyfmt(), and ~ios(). -<span class="lineNum"> 436 </span> : */ -<span class="lineNum"> 437 </span> : typedef void (*event_callback) (event, ios_base&, int); -<span class="lineNum"> 438 </span> : -<span class="lineNum"> 439 </span> : /** -<span class="lineNum"> 440 </span> : * @brief Add the callback __fn with parameter __index. -<span class="lineNum"> 441 </span> : * @param __fn The function to add. -<span class="lineNum"> 442 </span> : * @param __index The integer to pass to the function when invoked. -<span class="lineNum"> 443 </span> : * -<span class="lineNum"> 444 </span> : * Registers a function as an event callback with an integer parameter to -<span class="lineNum"> 445 </span> : * be passed to the function when invoked. Multiple copies of the -<span class="lineNum"> 446 </span> : * function are allowed. If there are multiple callbacks, they are -<span class="lineNum"> 447 </span> : * invoked in the order they were registered. -<span class="lineNum"> 448 </span> : */ -<span class="lineNum"> 449 </span> : void -<span class="lineNum"> 450 </span> : register_callback(event_callback __fn, int __index); -<span class="lineNum"> 451 </span> : -<span class="lineNum"> 452 </span> : protected: -<span class="lineNum"> 453 </span> : //@{ -<span class="lineNum"> 454 </span> : /** -<span class="lineNum"> 455 </span> : * ios_base data members (doc me) -<span class="lineNum"> 456 </span> : */ -<span class="lineNum"> 457 </span> : streamsize _M_precision; -<span class="lineNum"> 458 </span> : streamsize _M_width; -<span class="lineNum"> 459 </span> : fmtflags _M_flags; -<span class="lineNum"> 460 </span> : iostate _M_exception; -<span class="lineNum"> 461 </span> : iostate _M_streambuf_state; -<span class="lineNum"> 462 </span> : //@} -<span class="lineNum"> 463 </span> : -<span class="lineNum"> 464 </span> : // 27.4.2.6 Members for callbacks -<span class="lineNum"> 465 </span> : // 27.4.2.6 ios_base callbacks -<span class="lineNum"> 466 </span> : struct _Callback_list -<span class="lineNum"> 467 </span> : { -<span class="lineNum"> 468 </span> : // Data Members -<span class="lineNum"> 469 </span> : _Callback_list* _M_next; -<span class="lineNum"> 470 </span> : ios_base::event_callback _M_fn; -<span class="lineNum"> 471 </span> : int _M_index; -<span class="lineNum"> 472 </span> : _Atomic_word _M_refcount; // 0 means one reference. -<span class="lineNum"> 473 </span> : -<span class="lineNum"> 474 </span> : _Callback_list(ios_base::event_callback __fn, int __index, -<span class="lineNum"> 475 </span> : _Callback_list* __cb) -<span class="lineNum"> 476 </span> : : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { } -<span class="lineNum"> 477 </span> : -<span class="lineNum"> 478 </span> : void -<span class="lineNum"> 479 </span> : _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : // 0 => OK to delete. -<span class="lineNum"> 482 </span> : int -<span class="lineNum"> 483 </span> : _M_remove_reference() -<span class="lineNum"> 484 </span> : { return __gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1); } -<span class="lineNum"> 485 </span> : }; -<span class="lineNum"> 486 </span> : -<span class="lineNum"> 487 </span> : _Callback_list* _M_callbacks; -<span class="lineNum"> 488 </span> : -<span class="lineNum"> 489 </span> : void -<span class="lineNum"> 490 </span> : _M_call_callbacks(event __ev) throw(); -<span class="lineNum"> 491 </span> : -<span class="lineNum"> 492 </span> : void -<span class="lineNum"> 493 </span> : _M_dispose_callbacks(void); -<span class="lineNum"> 494 </span> : -<span class="lineNum"> 495 </span> : // 27.4.2.5 Members for iword/pword storage -<span class="lineNum"> 496 </span> : struct _Words -<span class="lineNum"> 497 </span> : { -<span class="lineNum"> 498 </span> : void* _M_pword; -<span class="lineNum"> 499 </span> : long _M_iword; -<span class="lineNum"> 500 </span> : _Words() : _M_pword(0), _M_iword(0) { } -<span class="lineNum"> 501 </span> : }; -<span class="lineNum"> 502 </span> : -<span class="lineNum"> 503 </span> : // Only for failed iword/pword calls. -<span class="lineNum"> 504 </span> : _Words _M_word_zero; -<span class="lineNum"> 505 </span> : -<span class="lineNum"> 506 </span> : // Guaranteed storage. -<span class="lineNum"> 507 </span> : // The first 5 iword and pword slots are reserved for internal use. -<span class="lineNum"> 508 </span> : enum { _S_local_word_size = 8 }; -<span class="lineNum"> 509 </span> : _Words _M_local_word[_S_local_word_size]; -<span class="lineNum"> 510 </span> : -<span class="lineNum"> 511 </span> : // Allocated storage. -<span class="lineNum"> 512 </span> : int _M_word_size; -<span class="lineNum"> 513 </span> : _Words* _M_word; -<span class="lineNum"> 514 </span> : -<span class="lineNum"> 515 </span> : _Words& -<span class="lineNum"> 516 </span> : _M_grow_words(int __index, bool __iword); -<span class="lineNum"> 517 </span> : -<span class="lineNum"> 518 </span> : // Members for locale and locale caching. -<span class="lineNum"> 519 </span> : locale _M_ios_locale; -<span class="lineNum"> 520 </span> : -<span class="lineNum"> 521 </span> : void -<span class="lineNum"> 522 </span> : _M_init(); -<span class="lineNum"> 523 </span> : -<span class="lineNum"> 524 </span> : public: -<span class="lineNum"> 525 </span> : -<span class="lineNum"> 526 </span> : // 27.4.2.1.6 Class ios_base::Init -<span class="lineNum"> 527 </span> : // Used to initialize standard streams. In theory, g++ could use -<span class="lineNum"> 528 </span> : // -finit-priority to order this stuff correctly without going -<span class="lineNum"> 529 </span> : // through these machinations. -<span class="lineNum"> 530 </span> : class Init -<span class="lineNum"> 531 </span> : { -<span class="lineNum"> 532 </span> : friend class ios_base; -<span class="lineNum"> 533 </span> : public: -<span class="lineNum"> 534 </span> : Init(); -<span class="lineNum"> 535 </span> : ~Init(); -<span class="lineNum"> 536 </span> : -<span class="lineNum"> 537 </span> : private: -<span class="lineNum"> 538 </span> : static _Atomic_word _S_refcount; -<span class="lineNum"> 539 </span> : static bool _S_synced_with_stdio; -<span class="lineNum"> 540 </span> : }; -<span class="lineNum"> 541 </span> : -<span class="lineNum"> 542 </span> : // [27.4.2.2] fmtflags state functions -<span class="lineNum"> 543 </span> : /** -<span class="lineNum"> 544 </span> : * @brief Access to format flags. -<span class="lineNum"> 545 </span> : * @return The format control flags for both input and output. -<span class="lineNum"> 546 </span> : */ -<span class="lineNum"> 547 </span> : fmtflags -<span class="lineNum"> 548 </span> : flags() const -<span class="lineNum"> 549 </span> : { return _M_flags; } -<span class="lineNum"> 550 </span> : -<span class="lineNum"> 551 </span> : /** -<span class="lineNum"> 552 </span> : * @brief Setting new format flags all at once. -<span class="lineNum"> 553 </span> : * @param fmtfl The new flags to set. -<span class="lineNum"> 554 </span> : * @return The previous format control flags. -<span class="lineNum"> 555 </span> : * -<span class="lineNum"> 556 </span> : * This function overwrites all the format flags with @a fmtfl. -<span class="lineNum"> 557 </span> : */ -<span class="lineNum"> 558 </span> : fmtflags -<span class="lineNum"> 559 </span> : flags(fmtflags __fmtfl) -<span class="lineNum"> 560 </span> : { -<span class="lineNum"> 561 </span> : fmtflags __old = _M_flags; -<span class="lineNum"> 562 </span> : _M_flags = __fmtfl; -<span class="lineNum"> 563 </span> : return __old; -<span class="lineNum"> 564 </span> : } -<span class="lineNum"> 565 </span> : -<span class="lineNum"> 566 </span> : /** -<span class="lineNum"> 567 </span> : * @brief Setting new format flags. -<span class="lineNum"> 568 </span> : * @param fmtfl Additional flags to set. -<span class="lineNum"> 569 </span> : * @return The previous format control flags. -<span class="lineNum"> 570 </span> : * -<span class="lineNum"> 571 </span> : * This function sets additional flags in format control. Flags that -<span class="lineNum"> 572 </span> : * were previously set remain set. -<span class="lineNum"> 573 </span> : */ -<span class="lineNum"> 574 </span> : fmtflags -<span class="lineNum"> 575 </span> : setf(fmtflags __fmtfl) -<span class="lineNum"> 576 </span> : { -<span class="lineNum"> 577 </span> : fmtflags __old = _M_flags; -<span class="lineNum"> 578 </span> : _M_flags |= __fmtfl; -<span class="lineNum"> 579 </span> : return __old; -<span class="lineNum"> 580 </span> : } -<span class="lineNum"> 581 </span> : -<span class="lineNum"> 582 </span> : /** -<span class="lineNum"> 583 </span> : * @brief Setting new format flags. -<span class="lineNum"> 584 </span> : * @param fmtfl Additional flags to set. -<span class="lineNum"> 585 </span> : * @param mask The flags mask for @a fmtfl. -<span class="lineNum"> 586 </span> : * @return The previous format control flags. -<span class="lineNum"> 587 </span> : * -<span class="lineNum"> 588 </span> : * This function clears @a mask in the format flags, then sets -<span class="lineNum"> 589 </span> : * @a fmtfl @c & @a mask. An example mask is @c ios_base::adjustfield. -<span class="lineNum"> 590 </span> : */ -<span class="lineNum"> 591 </span> : fmtflags -<span class="lineNum"> 592 </span><span class="lineCov"> 33 : setf(fmtflags __fmtfl, fmtflags __mask)</span> -<span class="lineNum"> 593 </span> : { -<span class="lineNum"> 594 </span><span class="lineCov"> 33 : fmtflags __old = _M_flags;</span> -<span class="lineNum"> 595 </span><span class="lineCov"> 33 : _M_flags &= ~__mask;</span> -<span class="lineNum"> 596 </span><span class="lineCov"> 33 : _M_flags |= (__fmtfl & __mask);</span> -<span class="lineNum"> 597 </span><span class="lineCov"> 33 : return __old;</span> -<span class="lineNum"> 598 </span> : } -<span class="lineNum"> 599 </span> : -<span class="lineNum"> 600 </span> : /** -<span class="lineNum"> 601 </span> : * @brief Clearing format flags. -<span class="lineNum"> 602 </span> : * @param mask The flags to unset. -<span class="lineNum"> 603 </span> : * -<span class="lineNum"> 604 </span> : * This function clears @a mask in the format flags. -<span class="lineNum"> 605 </span> : */ -<span class="lineNum"> 606 </span> : void -<span class="lineNum"> 607 </span> : unsetf(fmtflags __mask) -<span class="lineNum"> 608 </span> : { _M_flags &= ~__mask; } -<span class="lineNum"> 609 </span> : -<span class="lineNum"> 610 </span> : /** -<span class="lineNum"> 611 </span> : * @brief Flags access. -<span class="lineNum"> 612 </span> : * @return The precision to generate on certain output operations. -<span class="lineNum"> 613 </span> : * -<span class="lineNum"> 614 </span> : * Be careful if you try to give a definition of "precision" here; see -<span class="lineNum"> 615 </span> : * DR 189. -<span class="lineNum"> 616 </span> : */ -<span class="lineNum"> 617 </span> : streamsize -<span class="lineNum"> 618 </span> : precision() const -<span class="lineNum"> 619 </span> : { return _M_precision; } -<span class="lineNum"> 620 </span> : -<span class="lineNum"> 621 </span> : /** -<span class="lineNum"> 622 </span> : * @brief Changing flags. -<span class="lineNum"> 623 </span> : * @param prec The new precision value. -<span class="lineNum"> 624 </span> : * @return The previous value of precision(). -<span class="lineNum"> 625 </span> : */ -<span class="lineNum"> 626 </span> : streamsize -<span class="lineNum"> 627 </span> : precision(streamsize __prec) -<span class="lineNum"> 628 </span> : { -<span class="lineNum"> 629 </span> : streamsize __old = _M_precision; -<span class="lineNum"> 630 </span> : _M_precision = __prec; -<span class="lineNum"> 631 </span> : return __old; -<span class="lineNum"> 632 </span> : } -<span class="lineNum"> 633 </span> : -<span class="lineNum"> 634 </span> : /** -<span class="lineNum"> 635 </span> : * @brief Flags access. -<span class="lineNum"> 636 </span> : * @return The minimum field width to generate on output operations. -<span class="lineNum"> 637 </span> : * -<span class="lineNum"> 638 </span> : * "Minimum field width" refers to the number of characters. -<span class="lineNum"> 639 </span> : */ -<span class="lineNum"> 640 </span> : streamsize -<span class="lineNum"> 641 </span> : width() const -<span class="lineNum"> 642 </span> : { return _M_width; } -<span class="lineNum"> 643 </span> : -<span class="lineNum"> 644 </span> : /** -<span class="lineNum"> 645 </span> : * @brief Changing flags. -<span class="lineNum"> 646 </span> : * @param wide The new width value. -<span class="lineNum"> 647 </span> : * @return The previous value of width(). -<span class="lineNum"> 648 </span> : */ -<span class="lineNum"> 649 </span> : streamsize -<span class="lineNum"> 650 </span><span class="lineNoCov"> 0 : width(streamsize __wide)</span> -<span class="lineNum"> 651 </span> : { -<span class="lineNum"> 652 </span><span class="lineNoCov"> 0 : streamsize __old = _M_width;</span> -<span class="lineNum"> 653 </span><span class="lineNoCov"> 0 : _M_width = __wide;</span> -<span class="lineNum"> 654 </span><span class="lineNoCov"> 0 : return __old;</span> -<span class="lineNum"> 655 </span> : } -<span class="lineNum"> 656 </span> : -<span class="lineNum"> 657 </span> : // [27.4.2.4] ios_base static members -<span class="lineNum"> 658 </span> : /** -<span class="lineNum"> 659 </span> : * @brief Interaction with the standard C I/O objects. -<span class="lineNum"> 660 </span> : * @param sync Whether to synchronize or not. -<span class="lineNum"> 661 </span> : * @return True if the standard streams were previously synchronized. -<span class="lineNum"> 662 </span> : * -<span class="lineNum"> 663 </span> : * The synchronization referred to is @e only that between the standard -<span class="lineNum"> 664 </span> : * C facilities (e.g., stdout) and the standard C++ objects (e.g., -<span class="lineNum"> 665 </span> : * cout). User-declared streams are unaffected. See -<span class="lineNum"> 666 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#8 for more. -<span class="lineNum"> 667 </span> : */ -<span class="lineNum"> 668 </span> : static bool -<span class="lineNum"> 669 </span> : sync_with_stdio(bool __sync = true); -<span class="lineNum"> 670 </span> : -<span class="lineNum"> 671 </span> : // [27.4.2.3] ios_base locale functions -<span class="lineNum"> 672 </span> : /** -<span class="lineNum"> 673 </span> : * @brief Setting a new locale. -<span class="lineNum"> 674 </span> : * @param loc The new locale. -<span class="lineNum"> 675 </span> : * @return The previous locale. -<span class="lineNum"> 676 </span> : * -<span class="lineNum"> 677 </span> : * Sets the new locale for this stream, and then invokes each callback -<span class="lineNum"> 678 </span> : * with imbue_event. -<span class="lineNum"> 679 </span> : */ -<span class="lineNum"> 680 </span> : locale -<span class="lineNum"> 681 </span> : imbue(const locale& __loc); -<span class="lineNum"> 682 </span> : -<span class="lineNum"> 683 </span> : /** -<span class="lineNum"> 684 </span> : * @brief Locale access -<span class="lineNum"> 685 </span> : * @return A copy of the current locale. -<span class="lineNum"> 686 </span> : * -<span class="lineNum"> 687 </span> : * If @c imbue(loc) has previously been called, then this function -<span class="lineNum"> 688 </span> : * returns @c loc. Otherwise, it returns a copy of @c std::locale(), -<span class="lineNum"> 689 </span> : * the global C++ locale. -<span class="lineNum"> 690 </span> : */ -<span class="lineNum"> 691 </span> : locale -<span class="lineNum"> 692 </span> : getloc() const -<span class="lineNum"> 693 </span> : { return _M_ios_locale; } -<span class="lineNum"> 694 </span> : -<span class="lineNum"> 695 </span> : /** -<span class="lineNum"> 696 </span> : * @brief Locale access -<span class="lineNum"> 697 </span> : * @return A reference to the current locale. -<span class="lineNum"> 698 </span> : * -<span class="lineNum"> 699 </span> : * Like getloc above, but returns a reference instead of -<span class="lineNum"> 700 </span> : * generating a copy. -<span class="lineNum"> 701 </span> : */ -<span class="lineNum"> 702 </span> : const locale& -<span class="lineNum"> 703 </span> : _M_getloc() const -<span class="lineNum"> 704 </span> : { return _M_ios_locale; } -<span class="lineNum"> 705 </span> : -<span class="lineNum"> 706 </span> : // [27.4.2.5] ios_base storage functions -<span class="lineNum"> 707 </span> : /** -<span class="lineNum"> 708 </span> : * @brief Access to unique indices. -<span class="lineNum"> 709 </span> : * @return An integer different from all previous calls. -<span class="lineNum"> 710 </span> : * -<span class="lineNum"> 711 </span> : * This function returns a unique integer every time it is called. It -<span class="lineNum"> 712 </span> : * can be used for any purpose, but is primarily intended to be a unique -<span class="lineNum"> 713 </span> : * index for the iword and pword functions. The expectation is that an -<span class="lineNum"> 714 </span> : * application calls xalloc in order to obtain an index in the iword and -<span class="lineNum"> 715 </span> : * pword arrays that can be used without fear of conflict. -<span class="lineNum"> 716 </span> : * -<span class="lineNum"> 717 </span> : * The implementation maintains a static variable that is incremented and -<span class="lineNum"> 718 </span> : * returned on each invocation. xalloc is guaranteed to return an index -<span class="lineNum"> 719 </span> : * that is safe to use in the iword and pword arrays. -<span class="lineNum"> 720 </span> : */ -<span class="lineNum"> 721 </span> : static int -<span class="lineNum"> 722 </span> : xalloc() throw(); -<span class="lineNum"> 723 </span> : -<span class="lineNum"> 724 </span> : /** -<span class="lineNum"> 725 </span> : * @brief Access to integer array. -<span class="lineNum"> 726 </span> : * @param __ix Index into the array. -<span class="lineNum"> 727 </span> : * @return A reference to an integer associated with the index. -<span class="lineNum"> 728 </span> : * -<span class="lineNum"> 729 </span> : * The iword function provides access to an array of integers that can be -<span class="lineNum"> 730 </span> : * used for any purpose. The array grows as required to hold the -<span class="lineNum"> 731 </span> : * supplied index. All integers in the array are initialized to 0. -<span class="lineNum"> 732 </span> : * -<span class="lineNum"> 733 </span> : * The implementation reserves several indices. You should use xalloc to -<span class="lineNum"> 734 </span> : * obtain an index that is safe to use. Also note that since the array -<span class="lineNum"> 735 </span> : * can grow dynamically, it is not safe to hold onto the reference. -<span class="lineNum"> 736 </span> : */ -<span class="lineNum"> 737 </span> : long& -<span class="lineNum"> 738 </span> : iword(int __ix) -<span class="lineNum"> 739 </span> : { -<span class="lineNum"> 740 </span> : _Words& __word = (__ix < _M_word_size) -<span class="lineNum"> 741 </span> : ? _M_word[__ix] : _M_grow_words(__ix, true); -<span class="lineNum"> 742 </span> : return __word._M_iword; -<span class="lineNum"> 743 </span> : } -<span class="lineNum"> 744 </span> : -<span class="lineNum"> 745 </span> : /** -<span class="lineNum"> 746 </span> : * @brief Access to void pointer array. -<span class="lineNum"> 747 </span> : * @param __ix Index into the array. -<span class="lineNum"> 748 </span> : * @return A reference to a void* associated with the index. -<span class="lineNum"> 749 </span> : * -<span class="lineNum"> 750 </span> : * The pword function provides access to an array of pointers that can be -<span class="lineNum"> 751 </span> : * used for any purpose. The array grows as required to hold the -<span class="lineNum"> 752 </span> : * supplied index. All pointers in the array are initialized to 0. -<span class="lineNum"> 753 </span> : * -<span class="lineNum"> 754 </span> : * The implementation reserves several indices. You should use xalloc to -<span class="lineNum"> 755 </span> : * obtain an index that is safe to use. Also note that since the array -<span class="lineNum"> 756 </span> : * can grow dynamically, it is not safe to hold onto the reference. -<span class="lineNum"> 757 </span> : */ -<span class="lineNum"> 758 </span> : void*& -<span class="lineNum"> 759 </span> : pword(int __ix) -<span class="lineNum"> 760 </span> : { -<span class="lineNum"> 761 </span> : _Words& __word = (__ix < _M_word_size) -<span class="lineNum"> 762 </span> : ? _M_word[__ix] : _M_grow_words(__ix, false); -<span class="lineNum"> 763 </span> : return __word._M_pword; -<span class="lineNum"> 764 </span> : } -<span class="lineNum"> 765 </span> : -<span class="lineNum"> 766 </span> : // Destructor -<span class="lineNum"> 767 </span> : /** -<span class="lineNum"> 768 </span> : * Invokes each callback with erase_event. Destroys local storage. -<span class="lineNum"> 769 </span> : * -<span class="lineNum"> 770 </span> : * Note that the ios_base object for the standard streams never gets -<span class="lineNum"> 771 </span> : * destroyed. As a result, any callbacks registered with the standard -<span class="lineNum"> 772 </span> : * streams will not get invoked with erase_event (unless copyfmt is -<span class="lineNum"> 773 </span> : * used). -<span class="lineNum"> 774 </span> : */ -<span class="lineNum"> 775 </span> : virtual ~ios_base(); -<span class="lineNum"> 776 </span> : -<span class="lineNum"> 777 </span> : protected: -<span class="lineNum"> 778 </span> : ios_base(); -<span class="lineNum"> 779 </span> : -<span class="lineNum"> 780 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 781 </span> : // 50. Copy constructor and assignment operator of ios_base -<span class="lineNum"> 782 </span> : private: -<span class="lineNum"> 783 </span> : ios_base(const ios_base&); -<span class="lineNum"> 784 </span> : -<span class="lineNum"> 785 </span> : ios_base& -<span class="lineNum"> 786 </span> : operator=(const ios_base&); -<span class="lineNum"> 787 </span> : }; -<span class="lineNum"> 788 </span> : -<span class="lineNum"> 789 </span> : // [27.4.5.1] fmtflags manipulators -<span class="lineNum"> 790 </span> : /// Calls base.setf(ios_base::boolalpha). -<span class="lineNum"> 791 </span> : inline ios_base& -<span class="lineNum"> 792 </span> : boolalpha(ios_base& __base) -<span class="lineNum"> 793 </span> : { -<span class="lineNum"> 794 </span> : __base.setf(ios_base::boolalpha); -<span class="lineNum"> 795 </span> : return __base; -<span class="lineNum"> 796 </span> : } -<span class="lineNum"> 797 </span> : -<span class="lineNum"> 798 </span> : /// Calls base.unsetf(ios_base::boolalpha). -<span class="lineNum"> 799 </span> : inline ios_base& -<span class="lineNum"> 800 </span> : noboolalpha(ios_base& __base) -<span class="lineNum"> 801 </span> : { -<span class="lineNum"> 802 </span> : __base.unsetf(ios_base::boolalpha); -<span class="lineNum"> 803 </span> : return __base; -<span class="lineNum"> 804 </span> : } -<span class="lineNum"> 805 </span> : -<span class="lineNum"> 806 </span> : /// Calls base.setf(ios_base::showbase). -<span class="lineNum"> 807 </span> : inline ios_base& -<span class="lineNum"> 808 </span> : showbase(ios_base& __base) -<span class="lineNum"> 809 </span> : { -<span class="lineNum"> 810 </span> : __base.setf(ios_base::showbase); -<span class="lineNum"> 811 </span> : return __base; -<span class="lineNum"> 812 </span> : } -<span class="lineNum"> 813 </span> : -<span class="lineNum"> 814 </span> : /// Calls base.unsetf(ios_base::showbase). -<span class="lineNum"> 815 </span> : inline ios_base& -<span class="lineNum"> 816 </span> : noshowbase(ios_base& __base) -<span class="lineNum"> 817 </span> : { -<span class="lineNum"> 818 </span> : __base.unsetf(ios_base::showbase); -<span class="lineNum"> 819 </span> : return __base; -<span class="lineNum"> 820 </span> : } -<span class="lineNum"> 821 </span> : -<span class="lineNum"> 822 </span> : /// Calls base.setf(ios_base::showpoint). -<span class="lineNum"> 823 </span> : inline ios_base& -<span class="lineNum"> 824 </span> : showpoint(ios_base& __base) -<span class="lineNum"> 825 </span> : { -<span class="lineNum"> 826 </span> : __base.setf(ios_base::showpoint); -<span class="lineNum"> 827 </span> : return __base; -<span class="lineNum"> 828 </span> : } -<span class="lineNum"> 829 </span> : -<span class="lineNum"> 830 </span> : /// Calls base.unsetf(ios_base::showpoint). -<span class="lineNum"> 831 </span> : inline ios_base& -<span class="lineNum"> 832 </span> : noshowpoint(ios_base& __base) -<span class="lineNum"> 833 </span> : { -<span class="lineNum"> 834 </span> : __base.unsetf(ios_base::showpoint); -<span class="lineNum"> 835 </span> : return __base; -<span class="lineNum"> 836 </span> : } -<span class="lineNum"> 837 </span> : -<span class="lineNum"> 838 </span> : /// Calls base.setf(ios_base::showpos). -<span class="lineNum"> 839 </span> : inline ios_base& -<span class="lineNum"> 840 </span> : showpos(ios_base& __base) -<span class="lineNum"> 841 </span> : { -<span class="lineNum"> 842 </span> : __base.setf(ios_base::showpos); -<span class="lineNum"> 843 </span> : return __base; -<span class="lineNum"> 844 </span> : } -<span class="lineNum"> 845 </span> : -<span class="lineNum"> 846 </span> : /// Calls base.unsetf(ios_base::showpos). -<span class="lineNum"> 847 </span> : inline ios_base& -<span class="lineNum"> 848 </span> : noshowpos(ios_base& __base) -<span class="lineNum"> 849 </span> : { -<span class="lineNum"> 850 </span> : __base.unsetf(ios_base::showpos); -<span class="lineNum"> 851 </span> : return __base; -<span class="lineNum"> 852 </span> : } -<span class="lineNum"> 853 </span> : -<span class="lineNum"> 854 </span> : /// Calls base.setf(ios_base::skipws). -<span class="lineNum"> 855 </span> : inline ios_base& -<span class="lineNum"> 856 </span> : skipws(ios_base& __base) -<span class="lineNum"> 857 </span> : { -<span class="lineNum"> 858 </span> : __base.setf(ios_base::skipws); -<span class="lineNum"> 859 </span> : return __base; -<span class="lineNum"> 860 </span> : } -<span class="lineNum"> 861 </span> : -<span class="lineNum"> 862 </span> : /// Calls base.unsetf(ios_base::skipws). -<span class="lineNum"> 863 </span> : inline ios_base& -<span class="lineNum"> 864 </span> : noskipws(ios_base& __base) -<span class="lineNum"> 865 </span> : { -<span class="lineNum"> 866 </span> : __base.unsetf(ios_base::skipws); -<span class="lineNum"> 867 </span> : return __base; -<span class="lineNum"> 868 </span> : } -<span class="lineNum"> 869 </span> : -<span class="lineNum"> 870 </span> : /// Calls base.setf(ios_base::uppercase). -<span class="lineNum"> 871 </span> : inline ios_base& -<span class="lineNum"> 872 </span> : uppercase(ios_base& __base) -<span class="lineNum"> 873 </span> : { -<span class="lineNum"> 874 </span> : __base.setf(ios_base::uppercase); -<span class="lineNum"> 875 </span> : return __base; -<span class="lineNum"> 876 </span> : } -<span class="lineNum"> 877 </span> : -<span class="lineNum"> 878 </span> : /// Calls base.unsetf(ios_base::uppercase). -<span class="lineNum"> 879 </span> : inline ios_base& -<span class="lineNum"> 880 </span> : nouppercase(ios_base& __base) -<span class="lineNum"> 881 </span> : { -<span class="lineNum"> 882 </span> : __base.unsetf(ios_base::uppercase); -<span class="lineNum"> 883 </span> : return __base; -<span class="lineNum"> 884 </span> : } -<span class="lineNum"> 885 </span> : -<span class="lineNum"> 886 </span> : /// Calls base.setf(ios_base::unitbuf). -<span class="lineNum"> 887 </span> : inline ios_base& -<span class="lineNum"> 888 </span> : unitbuf(ios_base& __base) -<span class="lineNum"> 889 </span> : { -<span class="lineNum"> 890 </span> : __base.setf(ios_base::unitbuf); -<span class="lineNum"> 891 </span> : return __base; -<span class="lineNum"> 892 </span> : } -<span class="lineNum"> 893 </span> : -<span class="lineNum"> 894 </span> : /// Calls base.unsetf(ios_base::unitbuf). -<span class="lineNum"> 895 </span> : inline ios_base& -<span class="lineNum"> 896 </span> : nounitbuf(ios_base& __base) -<span class="lineNum"> 897 </span> : { -<span class="lineNum"> 898 </span> : __base.unsetf(ios_base::unitbuf); -<span class="lineNum"> 899 </span> : return __base; -<span class="lineNum"> 900 </span> : } -<span class="lineNum"> 901 </span> : -<span class="lineNum"> 902 </span> : // [27.4.5.2] adjustfield manipulators -<span class="lineNum"> 903 </span> : /// Calls base.setf(ios_base::internal, ios_base::adjustfield). -<span class="lineNum"> 904 </span> : inline ios_base& -<span class="lineNum"> 905 </span><span class="lineCov"> 33 : internal(ios_base& __base)</span> -<span class="lineNum"> 906 </span> : { -<span class="lineNum"> 907 </span><span class="lineCov"> 33 : __base.setf(ios_base::internal, ios_base::adjustfield);</span> -<span class="lineNum"> 908 </span><span class="lineCov"> 33 : return __base;</span> -<span class="lineNum"> 909 </span> : } -<span class="lineNum"> 910 </span> : -<span class="lineNum"> 911 </span> : /// Calls base.setf(ios_base::left, ios_base::adjustfield). -<span class="lineNum"> 912 </span> : inline ios_base& -<span class="lineNum"> 913 </span> : left(ios_base& __base) -<span class="lineNum"> 914 </span> : { -<span class="lineNum"> 915 </span> : __base.setf(ios_base::left, ios_base::adjustfield); -<span class="lineNum"> 916 </span> : return __base; -<span class="lineNum"> 917 </span> : } -<span class="lineNum"> 918 </span> : -<span class="lineNum"> 919 </span> : /// Calls base.setf(ios_base::right, ios_base::adjustfield). -<span class="lineNum"> 920 </span> : inline ios_base& -<span class="lineNum"> 921 </span> : right(ios_base& __base) -<span class="lineNum"> 922 </span> : { -<span class="lineNum"> 923 </span> : __base.setf(ios_base::right, ios_base::adjustfield); -<span class="lineNum"> 924 </span> : return __base; -<span class="lineNum"> 925 </span> : } -<span class="lineNum"> 926 </span> : -<span class="lineNum"> 927 </span> : // [27.4.5.3] basefield manipulators -<span class="lineNum"> 928 </span> : /// Calls base.setf(ios_base::dec, ios_base::basefield). -<span class="lineNum"> 929 </span> : inline ios_base& -<span class="lineNum"> 930 </span> : dec(ios_base& __base) -<span class="lineNum"> 931 </span> : { -<span class="lineNum"> 932 </span> : __base.setf(ios_base::dec, ios_base::basefield); -<span class="lineNum"> 933 </span> : return __base; -<span class="lineNum"> 934 </span> : } -<span class="lineNum"> 935 </span> : -<span class="lineNum"> 936 </span> : /// Calls base.setf(ios_base::hex, ios_base::basefield). -<span class="lineNum"> 937 </span> : inline ios_base& -<span class="lineNum"> 938 </span> : hex(ios_base& __base) -<span class="lineNum"> 939 </span> : { -<span class="lineNum"> 940 </span> : __base.setf(ios_base::hex, ios_base::basefield); -<span class="lineNum"> 941 </span> : return __base; -<span class="lineNum"> 942 </span> : } -<span class="lineNum"> 943 </span> : -<span class="lineNum"> 944 </span> : /// Calls base.setf(ios_base::oct, ios_base::basefield). -<span class="lineNum"> 945 </span> : inline ios_base& -<span class="lineNum"> 946 </span> : oct(ios_base& __base) -<span class="lineNum"> 947 </span> : { -<span class="lineNum"> 948 </span> : __base.setf(ios_base::oct, ios_base::basefield); -<span class="lineNum"> 949 </span> : return __base; -<span class="lineNum"> 950 </span> : } -<span class="lineNum"> 951 </span> : -<span class="lineNum"> 952 </span> : // [27.4.5.4] floatfield manipulators -<span class="lineNum"> 953 </span> : /// Calls base.setf(ios_base::fixed, ios_base::floatfield). -<span class="lineNum"> 954 </span> : inline ios_base& -<span class="lineNum"> 955 </span> : fixed(ios_base& __base) -<span class="lineNum"> 956 </span> : { -<span class="lineNum"> 957 </span> : __base.setf(ios_base::fixed, ios_base::floatfield); -<span class="lineNum"> 958 </span> : return __base; -<span class="lineNum"> 959 </span> : } -<span class="lineNum"> 960 </span> : -<span class="lineNum"> 961 </span> : /// Calls base.setf(ios_base::scientific, ios_base::floatfield). -<span class="lineNum"> 962 </span> : inline ios_base& -<span class="lineNum"> 963 </span> : scientific(ios_base& __base) -<span class="lineNum"> 964 </span> : { -<span class="lineNum"> 965 </span> : __base.setf(ios_base::scientific, ios_base::floatfield); -<span class="lineNum"> 966 </span> : return __base; -<span class="lineNum"> 967 </span> : } -<span class="lineNum"> 968 </span> : -<span class="lineNum"> 969 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 970 </span> : -<span class="lineNum"> 971 </span> : #endif /* _IOS_BASE_H */ -<span class="lineNum"> 972 </span> : -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/list.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/list.tcc.gcov.html deleted file mode 100644 index 18b3b6a..0000000 --- a/rep/usr/include/c++/4.3/bits/list.tcc.gcov.html +++ /dev/null @@ -1,484 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/list.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - list.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // List implementation (out of line) -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file list.tcc -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _LIST_TCC -<span class="lineNum"> 63 </span> : #define _LIST_TCC 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 68 </span> : void -<span class="lineNum"> 69 </span> : _List_base<_Tp, _Alloc>:: -<span class="lineNum"> 70 </span><span class="lineCov"> 19 : _M_clear()</span> -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span> : typedef _List_node<_Tp> _Node; -<span class="lineNum"> 73 </span><span class="lineCov"> 19 : _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next);</span> -<span class="lineNum"> 74 </span><span class="lineCov"> 60 : while (__cur != &this->_M_impl._M_node)</span> -<span class="lineNum"> 75 </span> : { -<span class="lineNum"> 76 </span><span class="lineCov"> 22 : _Node* __tmp = __cur;</span> -<span class="lineNum"> 77 </span><span class="lineCov"> 22 : __cur = static_cast<_Node*>(__cur->_M_next);</span> -<span class="lineNum"> 78 </span><span class="lineCov"> 22 : _M_get_Tp_allocator().destroy(&__tmp->_M_data);</span> -<span class="lineNum"> 79 </span><span class="lineCov"> 22 : _M_put_node(__tmp);</span> -<span class="lineNum"> 80 </span> : } -<span class="lineNum"> 81 </span><span class="lineCov"> 19 : }</span> -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 84 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 85 </span> : template<typename... _Args> -<span class="lineNum"> 86 </span> : typename list<_Tp, _Alloc>::iterator -<span class="lineNum"> 87 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 88 </span> : emplace(iterator __position, _Args&&... __args) -<span class="lineNum"> 89 </span> : { -<span class="lineNum"> 90 </span> : _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...); -<span class="lineNum"> 91 </span> : __tmp->hook(__position._M_node); -<span class="lineNum"> 92 </span> : return iterator(__tmp); -<span class="lineNum"> 93 </span> : } -<span class="lineNum"> 94 </span> : #endif -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 97 </span> : typename list<_Tp, _Alloc>::iterator -<span class="lineNum"> 98 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 99 </span> : insert(iterator __position, const value_type& __x) -<span class="lineNum"> 100 </span> : { -<span class="lineNum"> 101 </span> : _Node* __tmp = _M_create_node(__x); -<span class="lineNum"> 102 </span> : __tmp->hook(__position._M_node); -<span class="lineNum"> 103 </span> : return iterator(__tmp); -<span class="lineNum"> 104 </span> : } -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 107 </span> : typename list<_Tp, _Alloc>::iterator -<span class="lineNum"> 108 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 109 </span><span class="lineCov"> 25 : erase(iterator __position)</span> -<span class="lineNum"> 110 </span> : { -<span class="lineNum"> 111 </span><span class="lineCov"> 25 : iterator __ret = iterator(__position._M_node->_M_next);</span> -<span class="lineNum"> 112 </span><span class="lineCov"> 25 : _M_erase(__position);</span> -<span class="lineNum"> 113 </span> : return __ret; -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 117 </span> : void -<span class="lineNum"> 118 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 119 </span> : resize(size_type __new_size, value_type __x) -<span class="lineNum"> 120 </span> : { -<span class="lineNum"> 121 </span> : iterator __i = begin(); -<span class="lineNum"> 122 </span> : size_type __len = 0; -<span class="lineNum"> 123 </span> : for (; __i != end() && __len < __new_size; ++__i, ++__len) -<span class="lineNum"> 124 </span> : ; -<span class="lineNum"> 125 </span> : if (__len == __new_size) -<span class="lineNum"> 126 </span> : erase(__i, end()); -<span class="lineNum"> 127 </span> : else // __i == end() -<span class="lineNum"> 128 </span> : insert(end(), __new_size - __len, __x); -<span class="lineNum"> 129 </span> : } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 132 </span> : list<_Tp, _Alloc>& -<span class="lineNum"> 133 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 134 </span> : operator=(const list& __x) -<span class="lineNum"> 135 </span> : { -<span class="lineNum"> 136 </span> : if (this != &__x) -<span class="lineNum"> 137 </span> : { -<span class="lineNum"> 138 </span> : iterator __first1 = begin(); -<span class="lineNum"> 139 </span> : iterator __last1 = end(); -<span class="lineNum"> 140 </span> : const_iterator __first2 = __x.begin(); -<span class="lineNum"> 141 </span> : const_iterator __last2 = __x.end(); -<span class="lineNum"> 142 </span> : for (; __first1 != __last1 && __first2 != __last2; -<span class="lineNum"> 143 </span> : ++__first1, ++__first2) -<span class="lineNum"> 144 </span> : *__first1 = *__first2; -<span class="lineNum"> 145 </span> : if (__first2 == __last2) -<span class="lineNum"> 146 </span> : erase(__first1, __last1); -<span class="lineNum"> 147 </span> : else -<span class="lineNum"> 148 </span> : insert(__last1, __first2, __last2); -<span class="lineNum"> 149 </span> : } -<span class="lineNum"> 150 </span> : return *this; -<span class="lineNum"> 151 </span> : } -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 154 </span> : void -<span class="lineNum"> 155 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 156 </span> : _M_fill_assign(size_type __n, const value_type& __val) -<span class="lineNum"> 157 </span> : { -<span class="lineNum"> 158 </span> : iterator __i = begin(); -<span class="lineNum"> 159 </span> : for (; __i != end() && __n > 0; ++__i, --__n) -<span class="lineNum"> 160 </span> : *__i = __val; -<span class="lineNum"> 161 </span> : if (__n > 0) -<span class="lineNum"> 162 </span> : insert(end(), __n, __val); -<span class="lineNum"> 163 </span> : else -<span class="lineNum"> 164 </span> : erase(__i, end()); -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 168 </span> : template <typename _InputIterator> -<span class="lineNum"> 169 </span> : void -<span class="lineNum"> 170 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 171 </span> : _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2, -<span class="lineNum"> 172 </span> : __false_type) -<span class="lineNum"> 173 </span> : { -<span class="lineNum"> 174 </span> : iterator __first1 = begin(); -<span class="lineNum"> 175 </span> : iterator __last1 = end(); -<span class="lineNum"> 176 </span> : for (; __first1 != __last1 && __first2 != __last2; -<span class="lineNum"> 177 </span> : ++__first1, ++__first2) -<span class="lineNum"> 178 </span> : *__first1 = *__first2; -<span class="lineNum"> 179 </span> : if (__first2 == __last2) -<span class="lineNum"> 180 </span> : erase(__first1, __last1); -<span class="lineNum"> 181 </span> : else -<span class="lineNum"> 182 </span> : insert(__last1, __first2, __last2); -<span class="lineNum"> 183 </span> : } -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 186 </span> : void -<span class="lineNum"> 187 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 188 </span> : remove(const value_type& __value) -<span class="lineNum"> 189 </span> : { -<span class="lineNum"> 190 </span> : iterator __first = begin(); -<span class="lineNum"> 191 </span> : iterator __last = end(); -<span class="lineNum"> 192 </span> : iterator __extra = __last; -<span class="lineNum"> 193 </span> : while (__first != __last) -<span class="lineNum"> 194 </span> : { -<span class="lineNum"> 195 </span> : iterator __next = __first; -<span class="lineNum"> 196 </span> : ++__next; -<span class="lineNum"> 197 </span> : if (*__first == __value) -<span class="lineNum"> 198 </span> : { -<span class="lineNum"> 199 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 200 </span> : // 526. Is it undefined if a function in the standard changes -<span class="lineNum"> 201 </span> : // in parameters? -<span class="lineNum"> 202 </span> : if (&*__first != &__value) -<span class="lineNum"> 203 </span> : _M_erase(__first); -<span class="lineNum"> 204 </span> : else -<span class="lineNum"> 205 </span> : __extra = __first; -<span class="lineNum"> 206 </span> : } -<span class="lineNum"> 207 </span> : __first = __next; -<span class="lineNum"> 208 </span> : } -<span class="lineNum"> 209 </span> : if (__extra != __last) -<span class="lineNum"> 210 </span> : _M_erase(__extra); -<span class="lineNum"> 211 </span> : } -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 214 </span> : void -<span class="lineNum"> 215 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 216 </span> : unique() -<span class="lineNum"> 217 </span> : { -<span class="lineNum"> 218 </span> : iterator __first = begin(); -<span class="lineNum"> 219 </span> : iterator __last = end(); -<span class="lineNum"> 220 </span> : if (__first == __last) -<span class="lineNum"> 221 </span> : return; -<span class="lineNum"> 222 </span> : iterator __next = __first; -<span class="lineNum"> 223 </span> : while (++__next != __last) -<span class="lineNum"> 224 </span> : { -<span class="lineNum"> 225 </span> : if (*__first == *__next) -<span class="lineNum"> 226 </span> : _M_erase(__next); -<span class="lineNum"> 227 </span> : else -<span class="lineNum"> 228 </span> : __first = __next; -<span class="lineNum"> 229 </span> : __next = __first; -<span class="lineNum"> 230 </span> : } -<span class="lineNum"> 231 </span> : } -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 234 </span> : void -<span class="lineNum"> 235 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 236 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 237 </span> : merge(list&& __x) -<span class="lineNum"> 238 </span> : #else -<span class="lineNum"> 239 </span> : merge(list& __x) -<span class="lineNum"> 240 </span> : #endif -<span class="lineNum"> 241 </span> : { -<span class="lineNum"> 242 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 243 </span> : // 300. list::merge() specification incomplete -<span class="lineNum"> 244 </span> : if (this != &__x) -<span class="lineNum"> 245 </span> : { -<span class="lineNum"> 246 </span> : _M_check_equal_allocators(__x); -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : iterator __first1 = begin(); -<span class="lineNum"> 249 </span> : iterator __last1 = end(); -<span class="lineNum"> 250 </span> : iterator __first2 = __x.begin(); -<span class="lineNum"> 251 </span> : iterator __last2 = __x.end(); -<span class="lineNum"> 252 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 253 </span> : if (*__first2 < *__first1) -<span class="lineNum"> 254 </span> : { -<span class="lineNum"> 255 </span> : iterator __next = __first2; -<span class="lineNum"> 256 </span> : _M_transfer(__first1, __first2, ++__next); -<span class="lineNum"> 257 </span> : __first2 = __next; -<span class="lineNum"> 258 </span> : } -<span class="lineNum"> 259 </span> : else -<span class="lineNum"> 260 </span> : ++__first1; -<span class="lineNum"> 261 </span> : if (__first2 != __last2) -<span class="lineNum"> 262 </span> : _M_transfer(__last1, __first2, __last2); -<span class="lineNum"> 263 </span> : } -<span class="lineNum"> 264 </span> : } -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 267 </span> : template <typename _StrictWeakOrdering> -<span class="lineNum"> 268 </span> : void -<span class="lineNum"> 269 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 270 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 271 </span> : merge(list&& __x, _StrictWeakOrdering __comp) -<span class="lineNum"> 272 </span> : #else -<span class="lineNum"> 273 </span> : merge(list& __x, _StrictWeakOrdering __comp) -<span class="lineNum"> 274 </span> : #endif -<span class="lineNum"> 275 </span> : { -<span class="lineNum"> 276 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 277 </span> : // 300. list::merge() specification incomplete -<span class="lineNum"> 278 </span> : if (this != &__x) -<span class="lineNum"> 279 </span> : { -<span class="lineNum"> 280 </span> : _M_check_equal_allocators(__x); -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span> : iterator __first1 = begin(); -<span class="lineNum"> 283 </span> : iterator __last1 = end(); -<span class="lineNum"> 284 </span> : iterator __first2 = __x.begin(); -<span class="lineNum"> 285 </span> : iterator __last2 = __x.end(); -<span class="lineNum"> 286 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 287 </span> : if (__comp(*__first2, *__first1)) -<span class="lineNum"> 288 </span> : { -<span class="lineNum"> 289 </span> : iterator __next = __first2; -<span class="lineNum"> 290 </span> : _M_transfer(__first1, __first2, ++__next); -<span class="lineNum"> 291 </span> : __first2 = __next; -<span class="lineNum"> 292 </span> : } -<span class="lineNum"> 293 </span> : else -<span class="lineNum"> 294 </span> : ++__first1; -<span class="lineNum"> 295 </span> : if (__first2 != __last2) -<span class="lineNum"> 296 </span> : _M_transfer(__last1, __first2, __last2); -<span class="lineNum"> 297 </span> : } -<span class="lineNum"> 298 </span> : } -<span class="lineNum"> 299 </span> : -<span class="lineNum"> 300 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 301 </span> : void -<span class="lineNum"> 302 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 303 </span> : sort() -<span class="lineNum"> 304 </span> : { -<span class="lineNum"> 305 </span> : // Do nothing if the list has length 0 or 1. -<span class="lineNum"> 306 </span> : if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node -<span class="lineNum"> 307 </span> : && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) -<span class="lineNum"> 308 </span> : { -<span class="lineNum"> 309 </span> : list __carry; -<span class="lineNum"> 310 </span> : list __tmp[64]; -<span class="lineNum"> 311 </span> : list * __fill = &__tmp[0]; -<span class="lineNum"> 312 </span> : list * __counter; -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : do -<span class="lineNum"> 315 </span> : { -<span class="lineNum"> 316 </span> : __carry.splice(__carry.begin(), *this, begin()); -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : for(__counter = &__tmp[0]; -<span class="lineNum"> 319 </span> : __counter != __fill && !__counter->empty(); -<span class="lineNum"> 320 </span> : ++__counter) -<span class="lineNum"> 321 </span> : { -<span class="lineNum"> 322 </span> : __counter->merge(__carry); -<span class="lineNum"> 323 </span> : __carry.swap(*__counter); -<span class="lineNum"> 324 </span> : } -<span class="lineNum"> 325 </span> : __carry.swap(*__counter); -<span class="lineNum"> 326 </span> : if (__counter == __fill) -<span class="lineNum"> 327 </span> : ++__fill; -<span class="lineNum"> 328 </span> : } -<span class="lineNum"> 329 </span> : while ( !empty() ); -<span class="lineNum"> 330 </span> : -<span class="lineNum"> 331 </span> : for (__counter = &__tmp[1]; __counter != __fill; ++__counter) -<span class="lineNum"> 332 </span> : __counter->merge(*(__counter - 1)); -<span class="lineNum"> 333 </span> : swap( *(__fill - 1) ); -<span class="lineNum"> 334 </span> : } -<span class="lineNum"> 335 </span> : } -<span class="lineNum"> 336 </span> : -<span class="lineNum"> 337 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 338 </span> : template <typename _Predicate> -<span class="lineNum"> 339 </span> : void -<span class="lineNum"> 340 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 341 </span> : remove_if(_Predicate __pred) -<span class="lineNum"> 342 </span> : { -<span class="lineNum"> 343 </span> : iterator __first = begin(); -<span class="lineNum"> 344 </span> : iterator __last = end(); -<span class="lineNum"> 345 </span> : while (__first != __last) -<span class="lineNum"> 346 </span> : { -<span class="lineNum"> 347 </span> : iterator __next = __first; -<span class="lineNum"> 348 </span> : ++__next; -<span class="lineNum"> 349 </span> : if (__pred(*__first)) -<span class="lineNum"> 350 </span> : _M_erase(__first); -<span class="lineNum"> 351 </span> : __first = __next; -<span class="lineNum"> 352 </span> : } -<span class="lineNum"> 353 </span> : } -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 356 </span> : template <typename _BinaryPredicate> -<span class="lineNum"> 357 </span> : void -<span class="lineNum"> 358 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 359 </span> : unique(_BinaryPredicate __binary_pred) -<span class="lineNum"> 360 </span> : { -<span class="lineNum"> 361 </span> : iterator __first = begin(); -<span class="lineNum"> 362 </span> : iterator __last = end(); -<span class="lineNum"> 363 </span> : if (__first == __last) -<span class="lineNum"> 364 </span> : return; -<span class="lineNum"> 365 </span> : iterator __next = __first; -<span class="lineNum"> 366 </span> : while (++__next != __last) -<span class="lineNum"> 367 </span> : { -<span class="lineNum"> 368 </span> : if (__binary_pred(*__first, *__next)) -<span class="lineNum"> 369 </span> : _M_erase(__next); -<span class="lineNum"> 370 </span> : else -<span class="lineNum"> 371 </span> : __first = __next; -<span class="lineNum"> 372 </span> : __next = __first; -<span class="lineNum"> 373 </span> : } -<span class="lineNum"> 374 </span> : } -<span class="lineNum"> 375 </span> : -<span class="lineNum"> 376 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 377 </span> : template <typename _StrictWeakOrdering> -<span class="lineNum"> 378 </span> : void -<span class="lineNum"> 379 </span> : list<_Tp, _Alloc>:: -<span class="lineNum"> 380 </span> : sort(_StrictWeakOrdering __comp) -<span class="lineNum"> 381 </span> : { -<span class="lineNum"> 382 </span> : // Do nothing if the list has length 0 or 1. -<span class="lineNum"> 383 </span> : if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node -<span class="lineNum"> 384 </span> : && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) -<span class="lineNum"> 385 </span> : { -<span class="lineNum"> 386 </span> : list __carry; -<span class="lineNum"> 387 </span> : list __tmp[64]; -<span class="lineNum"> 388 </span> : list * __fill = &__tmp[0]; -<span class="lineNum"> 389 </span> : list * __counter; -<span class="lineNum"> 390 </span> : -<span class="lineNum"> 391 </span> : do -<span class="lineNum"> 392 </span> : { -<span class="lineNum"> 393 </span> : __carry.splice(__carry.begin(), *this, begin()); -<span class="lineNum"> 394 </span> : -<span class="lineNum"> 395 </span> : for(__counter = &__tmp[0]; -<span class="lineNum"> 396 </span> : __counter != __fill && !__counter->empty(); -<span class="lineNum"> 397 </span> : ++__counter) -<span class="lineNum"> 398 </span> : { -<span class="lineNum"> 399 </span> : __counter->merge(__carry, __comp); -<span class="lineNum"> 400 </span> : __carry.swap(*__counter); -<span class="lineNum"> 401 </span> : } -<span class="lineNum"> 402 </span> : __carry.swap(*__counter); -<span class="lineNum"> 403 </span> : if (__counter == __fill) -<span class="lineNum"> 404 </span> : ++__fill; -<span class="lineNum"> 405 </span> : } -<span class="lineNum"> 406 </span> : while ( !empty() ); -<span class="lineNum"> 407 </span> : -<span class="lineNum"> 408 </span> : for (__counter = &__tmp[1]; __counter != __fill; ++__counter) -<span class="lineNum"> 409 </span> : __counter->merge(*(__counter - 1), __comp); -<span class="lineNum"> 410 </span> : swap(*(__fill - 1)); -<span class="lineNum"> 411 </span> : } -<span class="lineNum"> 412 </span> : } -<span class="lineNum"> 413 </span> : -<span class="lineNum"> 414 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : #endif /* _LIST_TCC */ -<span class="lineNum"> 417 </span> : -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/locale_facets.h.gcov.html b/rep/usr/include/c++/4.3/bits/locale_facets.h.gcov.html deleted file mode 100644 index d54e58e..0000000 --- a/rep/usr/include/c++/4.3/bits/locale_facets.h.gcov.html +++ /dev/null @@ -1,2705 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/locale_facets.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - locale_facets.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">13</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Locale support -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file locale_facets.h -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : // ISO C++ 14882: 22.1 Locales -<span class="lineNum"> 39 </span> : // -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #ifndef _LOCALE_FACETS_H -<span class="lineNum"> 42 </span> : #define _LOCALE_FACETS_H 1 -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #pragma GCC system_header -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : #include <cwctype> // For wctype_t -<span class="lineNum"> 47 </span> : #include <cctype> -<span class="lineNum"> 48 </span> : #include <bits/ctype_base.h> -<span class="lineNum"> 49 </span> : #include <iosfwd> -<span class="lineNum"> 50 </span> : #include <bits/ios_base.h> // For ios_base, ios_base::iostate -<span class="lineNum"> 51 </span> : #include <streambuf> -<span class="lineNum"> 52 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 53 </span> : #include <ext/type_traits.h> -<span class="lineNum"> 54 </span> : #include <ext/numeric_traits.h> -<span class="lineNum"> 55 </span> : #include <bits/streambuf_iterator.h> -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : // NB: Don't instantiate required wchar_t facets if no wchar_t support. -<span class="lineNum"> 60 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 61 </span> : # define _GLIBCXX_NUM_FACETS 28 -<span class="lineNum"> 62 </span> : #else -<span class="lineNum"> 63 </span> : # define _GLIBCXX_NUM_FACETS 14 -<span class="lineNum"> 64 </span> : #endif -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : // Convert string to numeric value of type _Tv and store results. -<span class="lineNum"> 67 </span> : // NB: This is specialized for all required types, there is no -<span class="lineNum"> 68 </span> : // generic definition. -<span class="lineNum"> 69 </span> : template<typename _Tv> -<span class="lineNum"> 70 </span> : void -<span class="lineNum"> 71 </span> : __convert_to_v(const char* __in, _Tv& __out, ios_base::iostate& __err, -<span class="lineNum"> 72 </span> : const __c_locale& __cloc); -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : // Explicit specializations for required types. -<span class="lineNum"> 75 </span> : template<> -<span class="lineNum"> 76 </span> : void -<span class="lineNum"> 77 </span> : __convert_to_v(const char*, float&, ios_base::iostate&, -<span class="lineNum"> 78 </span> : const __c_locale&); -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : template<> -<span class="lineNum"> 81 </span> : void -<span class="lineNum"> 82 </span> : __convert_to_v(const char*, double&, ios_base::iostate&, -<span class="lineNum"> 83 </span> : const __c_locale&); -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : template<> -<span class="lineNum"> 86 </span> : void -<span class="lineNum"> 87 </span> : __convert_to_v(const char*, long double&, ios_base::iostate&, -<span class="lineNum"> 88 </span> : const __c_locale&); -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : // NB: __pad is a struct, rather than a function, so it can be -<span class="lineNum"> 91 </span> : // partially-specialized. -<span class="lineNum"> 92 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 93 </span> : struct __pad -<span class="lineNum"> 94 </span> : { -<span class="lineNum"> 95 </span> : static void -<span class="lineNum"> 96 </span> : _S_pad(ios_base& __io, _CharT __fill, _CharT* __news, -<span class="lineNum"> 97 </span> : const _CharT* __olds, const streamsize __newlen, -<span class="lineNum"> 98 </span> : const streamsize __oldlen); -<span class="lineNum"> 99 </span> : }; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : // Used by both numeric and monetary facets. -<span class="lineNum"> 102 </span> : // Inserts "group separator" characters into an array of characters. -<span class="lineNum"> 103 </span> : // It's recursive, one iteration per group. It moves the characters -<span class="lineNum"> 104 </span> : // in the buffer this way: "xxxx12345" -> "12,345xxx". Call this -<span class="lineNum"> 105 </span> : // only with __gsize != 0. -<span class="lineNum"> 106 </span> : template<typename _CharT> -<span class="lineNum"> 107 </span> : _CharT* -<span class="lineNum"> 108 </span> : __add_grouping(_CharT* __s, _CharT __sep, -<span class="lineNum"> 109 </span> : const char* __gbeg, size_t __gsize, -<span class="lineNum"> 110 </span> : const _CharT* __first, const _CharT* __last); -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : // This template permits specializing facet output code for -<span class="lineNum"> 113 </span> : // ostreambuf_iterator. For ostreambuf_iterator, sputn is -<span class="lineNum"> 114 </span> : // significantly more efficient than incrementing iterators. -<span class="lineNum"> 115 </span> : template<typename _CharT> -<span class="lineNum"> 116 </span> : inline -<span class="lineNum"> 117 </span> : ostreambuf_iterator<_CharT> -<span class="lineNum"> 118 </span> : __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) -<span class="lineNum"> 119 </span> : { -<span class="lineNum"> 120 </span> : __s._M_put(__ws, __len); -<span class="lineNum"> 121 </span> : return __s; -<span class="lineNum"> 122 </span> : } -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : // This is the unspecialized form of the template. -<span class="lineNum"> 125 </span> : template<typename _CharT, typename _OutIter> -<span class="lineNum"> 126 </span> : inline -<span class="lineNum"> 127 </span> : _OutIter -<span class="lineNum"> 128 </span> : __write(_OutIter __s, const _CharT* __ws, int __len) -<span class="lineNum"> 129 </span> : { -<span class="lineNum"> 130 </span> : for (int __j = 0; __j < __len; __j++, ++__s) -<span class="lineNum"> 131 </span> : *__s = __ws[__j]; -<span class="lineNum"> 132 </span> : return __s; -<span class="lineNum"> 133 </span> : } -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : -<span class="lineNum"> 136 </span> : // 22.2.1.1 Template class ctype -<span class="lineNum"> 137 </span> : // Include host and configuration specific ctype enums for ctype_base. -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : // Common base for ctype<_CharT>. -<span class="lineNum"> 140 </span> : /** -<span class="lineNum"> 141 </span> : * @brief Common base for ctype facet -<span class="lineNum"> 142 </span> : * -<span class="lineNum"> 143 </span> : * This template class provides implementations of the public functions -<span class="lineNum"> 144 </span> : * that forward to the protected virtual functions. -<span class="lineNum"> 145 </span> : * -<span class="lineNum"> 146 </span> : * This template also provides abstract stubs for the protected virtual -<span class="lineNum"> 147 </span> : * functions. -<span class="lineNum"> 148 </span> : */ -<span class="lineNum"> 149 </span> : template<typename _CharT> -<span class="lineNum"> 150 </span> : class __ctype_abstract_base : public locale::facet, public ctype_base -<span class="lineNum"> 151 </span> : { -<span class="lineNum"> 152 </span> : public: -<span class="lineNum"> 153 </span> : // Types: -<span class="lineNum"> 154 </span> : /// Typedef for the template parameter -<span class="lineNum"> 155 </span> : typedef _CharT char_type; -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : /** -<span class="lineNum"> 158 </span> : * @brief Test char_type classification. -<span class="lineNum"> 159 </span> : * -<span class="lineNum"> 160 </span> : * This function finds a mask M for @a c and compares it to mask @a m. -<span class="lineNum"> 161 </span> : * It does so by returning the value of ctype<char_type>::do_is(). -<span class="lineNum"> 162 </span> : * -<span class="lineNum"> 163 </span> : * @param c The char_type to compare the mask of. -<span class="lineNum"> 164 </span> : * @param m The mask to compare against. -<span class="lineNum"> 165 </span> : * @return (M & m) != 0. -<span class="lineNum"> 166 </span> : */ -<span class="lineNum"> 167 </span> : bool -<span class="lineNum"> 168 </span> : is(mask __m, char_type __c) const -<span class="lineNum"> 169 </span> : { return this->do_is(__m, __c); } -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : /** -<span class="lineNum"> 172 </span> : * @brief Return a mask array. -<span class="lineNum"> 173 </span> : * -<span class="lineNum"> 174 </span> : * This function finds the mask for each char_type in the range [lo,hi) -<span class="lineNum"> 175 </span> : * and successively writes it to vec. vec must have as many elements -<span class="lineNum"> 176 </span> : * as the char array. It does so by returning the value of -<span class="lineNum"> 177 </span> : * ctype<char_type>::do_is(). -<span class="lineNum"> 178 </span> : * -<span class="lineNum"> 179 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 180 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 181 </span> : * @param vec Pointer to an array of mask storage. -<span class="lineNum"> 182 </span> : * @return @a hi. -<span class="lineNum"> 183 </span> : */ -<span class="lineNum"> 184 </span> : const char_type* -<span class="lineNum"> 185 </span> : is(const char_type *__lo, const char_type *__hi, mask *__vec) const -<span class="lineNum"> 186 </span> : { return this->do_is(__lo, __hi, __vec); } -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /** -<span class="lineNum"> 189 </span> : * @brief Find char_type matching a mask -<span class="lineNum"> 190 </span> : * -<span class="lineNum"> 191 </span> : * This function searches for and returns the first char_type c in -<span class="lineNum"> 192 </span> : * [lo,hi) for which is(m,c) is true. It does so by returning -<span class="lineNum"> 193 </span> : * ctype<char_type>::do_scan_is(). -<span class="lineNum"> 194 </span> : * -<span class="lineNum"> 195 </span> : * @param m The mask to compare against. -<span class="lineNum"> 196 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 197 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 198 </span> : * @return Pointer to matching char_type if found, else @a hi. -<span class="lineNum"> 199 </span> : */ -<span class="lineNum"> 200 </span> : const char_type* -<span class="lineNum"> 201 </span> : scan_is(mask __m, const char_type* __lo, const char_type* __hi) const -<span class="lineNum"> 202 </span> : { return this->do_scan_is(__m, __lo, __hi); } -<span class="lineNum"> 203 </span> : -<span class="lineNum"> 204 </span> : /** -<span class="lineNum"> 205 </span> : * @brief Find char_type not matching a mask -<span class="lineNum"> 206 </span> : * -<span class="lineNum"> 207 </span> : * This function searches for and returns the first char_type c in -<span class="lineNum"> 208 </span> : * [lo,hi) for which is(m,c) is false. It does so by returning -<span class="lineNum"> 209 </span> : * ctype<char_type>::do_scan_not(). -<span class="lineNum"> 210 </span> : * -<span class="lineNum"> 211 </span> : * @param m The mask to compare against. -<span class="lineNum"> 212 </span> : * @param lo Pointer to first char in range. -<span class="lineNum"> 213 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 214 </span> : * @return Pointer to non-matching char if found, else @a hi. -<span class="lineNum"> 215 </span> : */ -<span class="lineNum"> 216 </span> : const char_type* -<span class="lineNum"> 217 </span> : scan_not(mask __m, const char_type* __lo, const char_type* __hi) const -<span class="lineNum"> 218 </span> : { return this->do_scan_not(__m, __lo, __hi); } -<span class="lineNum"> 219 </span> : -<span class="lineNum"> 220 </span> : /** -<span class="lineNum"> 221 </span> : * @brief Convert to uppercase. -<span class="lineNum"> 222 </span> : * -<span class="lineNum"> 223 </span> : * This function converts the argument to uppercase if possible. -<span class="lineNum"> 224 </span> : * If not possible (for example, '2'), returns the argument. It does -<span class="lineNum"> 225 </span> : * so by returning ctype<char_type>::do_toupper(). -<span class="lineNum"> 226 </span> : * -<span class="lineNum"> 227 </span> : * @param c The char_type to convert. -<span class="lineNum"> 228 </span> : * @return The uppercase char_type if convertible, else @a c. -<span class="lineNum"> 229 </span> : */ -<span class="lineNum"> 230 </span> : char_type -<span class="lineNum"> 231 </span> : toupper(char_type __c) const -<span class="lineNum"> 232 </span> : { return this->do_toupper(__c); } -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : /** -<span class="lineNum"> 235 </span> : * @brief Convert array to uppercase. -<span class="lineNum"> 236 </span> : * -<span class="lineNum"> 237 </span> : * This function converts each char_type in the range [lo,hi) to -<span class="lineNum"> 238 </span> : * uppercase if possible. Other elements remain untouched. It does so -<span class="lineNum"> 239 </span> : * by returning ctype<char_type>:: do_toupper(lo, hi). -<span class="lineNum"> 240 </span> : * -<span class="lineNum"> 241 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 242 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 243 </span> : * @return @a hi. -<span class="lineNum"> 244 </span> : */ -<span class="lineNum"> 245 </span> : const char_type* -<span class="lineNum"> 246 </span> : toupper(char_type *__lo, const char_type* __hi) const -<span class="lineNum"> 247 </span> : { return this->do_toupper(__lo, __hi); } -<span class="lineNum"> 248 </span> : -<span class="lineNum"> 249 </span> : /** -<span class="lineNum"> 250 </span> : * @brief Convert to lowercase. -<span class="lineNum"> 251 </span> : * -<span class="lineNum"> 252 </span> : * This function converts the argument to lowercase if possible. If -<span class="lineNum"> 253 </span> : * not possible (for example, '2'), returns the argument. It does so -<span class="lineNum"> 254 </span> : * by returning ctype<char_type>::do_tolower(c). -<span class="lineNum"> 255 </span> : * -<span class="lineNum"> 256 </span> : * @param c The char_type to convert. -<span class="lineNum"> 257 </span> : * @return The lowercase char_type if convertible, else @a c. -<span class="lineNum"> 258 </span> : */ -<span class="lineNum"> 259 </span> : char_type -<span class="lineNum"> 260 </span> : tolower(char_type __c) const -<span class="lineNum"> 261 </span> : { return this->do_tolower(__c); } -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : /** -<span class="lineNum"> 264 </span> : * @brief Convert array to lowercase. -<span class="lineNum"> 265 </span> : * -<span class="lineNum"> 266 </span> : * This function converts each char_type in the range [lo,hi) to -<span class="lineNum"> 267 </span> : * lowercase if possible. Other elements remain untouched. It does so -<span class="lineNum"> 268 </span> : * by returning ctype<char_type>:: do_tolower(lo, hi). -<span class="lineNum"> 269 </span> : * -<span class="lineNum"> 270 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 271 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 272 </span> : * @return @a hi. -<span class="lineNum"> 273 </span> : */ -<span class="lineNum"> 274 </span> : const char_type* -<span class="lineNum"> 275 </span> : tolower(char_type* __lo, const char_type* __hi) const -<span class="lineNum"> 276 </span> : { return this->do_tolower(__lo, __hi); } -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : /** -<span class="lineNum"> 279 </span> : * @brief Widen char to char_type -<span class="lineNum"> 280 </span> : * -<span class="lineNum"> 281 </span> : * This function converts the char argument to char_type using the -<span class="lineNum"> 282 </span> : * simplest reasonable transformation. It does so by returning -<span class="lineNum"> 283 </span> : * ctype<char_type>::do_widen(c). -<span class="lineNum"> 284 </span> : * -<span class="lineNum"> 285 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 286 </span> : * codecvt for that. -<span class="lineNum"> 287 </span> : * -<span class="lineNum"> 288 </span> : * @param c The char to convert. -<span class="lineNum"> 289 </span> : * @return The converted char_type. -<span class="lineNum"> 290 </span> : */ -<span class="lineNum"> 291 </span> : char_type -<span class="lineNum"> 292 </span> : widen(char __c) const -<span class="lineNum"> 293 </span> : { return this->do_widen(__c); } -<span class="lineNum"> 294 </span> : -<span class="lineNum"> 295 </span> : /** -<span class="lineNum"> 296 </span> : * @brief Widen array to char_type -<span class="lineNum"> 297 </span> : * -<span class="lineNum"> 298 </span> : * This function converts each char in the input to char_type using the -<span class="lineNum"> 299 </span> : * simplest reasonable transformation. It does so by returning -<span class="lineNum"> 300 </span> : * ctype<char_type>::do_widen(c). -<span class="lineNum"> 301 </span> : * -<span class="lineNum"> 302 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 303 </span> : * codecvt for that. -<span class="lineNum"> 304 </span> : * -<span class="lineNum"> 305 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 306 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 307 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 308 </span> : * @return @a hi. -<span class="lineNum"> 309 </span> : */ -<span class="lineNum"> 310 </span> : const char* -<span class="lineNum"> 311 </span> : widen(const char* __lo, const char* __hi, char_type* __to) const -<span class="lineNum"> 312 </span> : { return this->do_widen(__lo, __hi, __to); } -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : /** -<span class="lineNum"> 315 </span> : * @brief Narrow char_type to char -<span class="lineNum"> 316 </span> : * -<span class="lineNum"> 317 </span> : * This function converts the char_type to char using the simplest -<span class="lineNum"> 318 </span> : * reasonable transformation. If the conversion fails, dfault is -<span class="lineNum"> 319 </span> : * returned instead. It does so by returning -<span class="lineNum"> 320 </span> : * ctype<char_type>::do_narrow(c). -<span class="lineNum"> 321 </span> : * -<span class="lineNum"> 322 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 323 </span> : * codecvt for that. -<span class="lineNum"> 324 </span> : * -<span class="lineNum"> 325 </span> : * @param c The char_type to convert. -<span class="lineNum"> 326 </span> : * @param dfault Char to return if conversion fails. -<span class="lineNum"> 327 </span> : * @return The converted char. -<span class="lineNum"> 328 </span> : */ -<span class="lineNum"> 329 </span> : char -<span class="lineNum"> 330 </span> : narrow(char_type __c, char __dfault) const -<span class="lineNum"> 331 </span> : { return this->do_narrow(__c, __dfault); } -<span class="lineNum"> 332 </span> : -<span class="lineNum"> 333 </span> : /** -<span class="lineNum"> 334 </span> : * @brief Narrow array to char array -<span class="lineNum"> 335 </span> : * -<span class="lineNum"> 336 </span> : * This function converts each char_type in the input to char using the -<span class="lineNum"> 337 </span> : * simplest reasonable transformation and writes the results to the -<span class="lineNum"> 338 </span> : * destination array. For any char_type in the input that cannot be -<span class="lineNum"> 339 </span> : * converted, @a dfault is used instead. It does so by returning -<span class="lineNum"> 340 </span> : * ctype<char_type>::do_narrow(lo, hi, dfault, to). -<span class="lineNum"> 341 </span> : * -<span class="lineNum"> 342 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 343 </span> : * codecvt for that. -<span class="lineNum"> 344 </span> : * -<span class="lineNum"> 345 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 346 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 347 </span> : * @param dfault Char to use if conversion fails. -<span class="lineNum"> 348 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 349 </span> : * @return @a hi. -<span class="lineNum"> 350 </span> : */ -<span class="lineNum"> 351 </span> : const char_type* -<span class="lineNum"> 352 </span> : narrow(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 353 </span> : char __dfault, char *__to) const -<span class="lineNum"> 354 </span> : { return this->do_narrow(__lo, __hi, __dfault, __to); } -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : protected: -<span class="lineNum"> 357 </span> : explicit -<span class="lineNum"> 358 </span> : __ctype_abstract_base(size_t __refs = 0): facet(__refs) { } -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : virtual -<span class="lineNum"> 361 </span> : ~__ctype_abstract_base() { } -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : /** -<span class="lineNum"> 364 </span> : * @brief Test char_type classification. -<span class="lineNum"> 365 </span> : * -<span class="lineNum"> 366 </span> : * This function finds a mask M for @a c and compares it to mask @a m. -<span class="lineNum"> 367 </span> : * -<span class="lineNum"> 368 </span> : * do_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 369 </span> : * classifying. do_is() must always return the same result for the -<span class="lineNum"> 370 </span> : * same input. -<span class="lineNum"> 371 </span> : * -<span class="lineNum"> 372 </span> : * @param c The char_type to find the mask of. -<span class="lineNum"> 373 </span> : * @param m The mask to compare against. -<span class="lineNum"> 374 </span> : * @return (M & m) != 0. -<span class="lineNum"> 375 </span> : */ -<span class="lineNum"> 376 </span> : virtual bool -<span class="lineNum"> 377 </span> : do_is(mask __m, char_type __c) const = 0; -<span class="lineNum"> 378 </span> : -<span class="lineNum"> 379 </span> : /** -<span class="lineNum"> 380 </span> : * @brief Return a mask array. -<span class="lineNum"> 381 </span> : * -<span class="lineNum"> 382 </span> : * This function finds the mask for each char_type in the range [lo,hi) -<span class="lineNum"> 383 </span> : * and successively writes it to vec. vec must have as many elements -<span class="lineNum"> 384 </span> : * as the input. -<span class="lineNum"> 385 </span> : * -<span class="lineNum"> 386 </span> : * do_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 387 </span> : * classifying. do_is() must always return the same result for the -<span class="lineNum"> 388 </span> : * same input. -<span class="lineNum"> 389 </span> : * -<span class="lineNum"> 390 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 391 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 392 </span> : * @param vec Pointer to an array of mask storage. -<span class="lineNum"> 393 </span> : * @return @a hi. -<span class="lineNum"> 394 </span> : */ -<span class="lineNum"> 395 </span> : virtual const char_type* -<span class="lineNum"> 396 </span> : do_is(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 397 </span> : mask* __vec) const = 0; -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : /** -<span class="lineNum"> 400 </span> : * @brief Find char_type matching mask -<span class="lineNum"> 401 </span> : * -<span class="lineNum"> 402 </span> : * This function searches for and returns the first char_type c in -<span class="lineNum"> 403 </span> : * [lo,hi) for which is(m,c) is true. -<span class="lineNum"> 404 </span> : * -<span class="lineNum"> 405 </span> : * do_scan_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 406 </span> : * match searching. do_is() must always return the same result for the -<span class="lineNum"> 407 </span> : * same input. -<span class="lineNum"> 408 </span> : * -<span class="lineNum"> 409 </span> : * @param m The mask to compare against. -<span class="lineNum"> 410 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 411 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 412 </span> : * @return Pointer to a matching char_type if found, else @a hi. -<span class="lineNum"> 413 </span> : */ -<span class="lineNum"> 414 </span> : virtual const char_type* -<span class="lineNum"> 415 </span> : do_scan_is(mask __m, const char_type* __lo, -<span class="lineNum"> 416 </span> : const char_type* __hi) const = 0; -<span class="lineNum"> 417 </span> : -<span class="lineNum"> 418 </span> : /** -<span class="lineNum"> 419 </span> : * @brief Find char_type not matching mask -<span class="lineNum"> 420 </span> : * -<span class="lineNum"> 421 </span> : * This function searches for and returns a pointer to the first -<span class="lineNum"> 422 </span> : * char_type c of [lo,hi) for which is(m,c) is false. -<span class="lineNum"> 423 </span> : * -<span class="lineNum"> 424 </span> : * do_scan_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 425 </span> : * match searching. do_is() must always return the same result for the -<span class="lineNum"> 426 </span> : * same input. -<span class="lineNum"> 427 </span> : * -<span class="lineNum"> 428 </span> : * @param m The mask to compare against. -<span class="lineNum"> 429 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 430 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 431 </span> : * @return Pointer to a non-matching char_type if found, else @a hi. -<span class="lineNum"> 432 </span> : */ -<span class="lineNum"> 433 </span> : virtual const char_type* -<span class="lineNum"> 434 </span> : do_scan_not(mask __m, const char_type* __lo, -<span class="lineNum"> 435 </span> : const char_type* __hi) const = 0; -<span class="lineNum"> 436 </span> : -<span class="lineNum"> 437 </span> : /** -<span class="lineNum"> 438 </span> : * @brief Convert to uppercase. -<span class="lineNum"> 439 </span> : * -<span class="lineNum"> 440 </span> : * This virtual function converts the char_type argument to uppercase -<span class="lineNum"> 441 </span> : * if possible. If not possible (for example, '2'), returns the -<span class="lineNum"> 442 </span> : * argument. -<span class="lineNum"> 443 </span> : * -<span class="lineNum"> 444 </span> : * do_toupper() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 445 </span> : * uppercasing. do_toupper() must always return the same result for -<span class="lineNum"> 446 </span> : * the same input. -<span class="lineNum"> 447 </span> : * -<span class="lineNum"> 448 </span> : * @param c The char_type to convert. -<span class="lineNum"> 449 </span> : * @return The uppercase char_type if convertible, else @a c. -<span class="lineNum"> 450 </span> : */ -<span class="lineNum"> 451 </span> : virtual char_type -<span class="lineNum"> 452 </span> : do_toupper(char_type) const = 0; -<span class="lineNum"> 453 </span> : -<span class="lineNum"> 454 </span> : /** -<span class="lineNum"> 455 </span> : * @brief Convert array to uppercase. -<span class="lineNum"> 456 </span> : * -<span class="lineNum"> 457 </span> : * This virtual function converts each char_type in the range [lo,hi) -<span class="lineNum"> 458 </span> : * to uppercase if possible. Other elements remain untouched. -<span class="lineNum"> 459 </span> : * -<span class="lineNum"> 460 </span> : * do_toupper() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 461 </span> : * uppercasing. do_toupper() must always return the same result for -<span class="lineNum"> 462 </span> : * the same input. -<span class="lineNum"> 463 </span> : * -<span class="lineNum"> 464 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 465 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 466 </span> : * @return @a hi. -<span class="lineNum"> 467 </span> : */ -<span class="lineNum"> 468 </span> : virtual const char_type* -<span class="lineNum"> 469 </span> : do_toupper(char_type* __lo, const char_type* __hi) const = 0; -<span class="lineNum"> 470 </span> : -<span class="lineNum"> 471 </span> : /** -<span class="lineNum"> 472 </span> : * @brief Convert to lowercase. -<span class="lineNum"> 473 </span> : * -<span class="lineNum"> 474 </span> : * This virtual function converts the argument to lowercase if -<span class="lineNum"> 475 </span> : * possible. If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 476 </span> : * -<span class="lineNum"> 477 </span> : * do_tolower() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 478 </span> : * lowercasing. do_tolower() must always return the same result for -<span class="lineNum"> 479 </span> : * the same input. -<span class="lineNum"> 480 </span> : * -<span class="lineNum"> 481 </span> : * @param c The char_type to convert. -<span class="lineNum"> 482 </span> : * @return The lowercase char_type if convertible, else @a c. -<span class="lineNum"> 483 </span> : */ -<span class="lineNum"> 484 </span> : virtual char_type -<span class="lineNum"> 485 </span> : do_tolower(char_type) const = 0; -<span class="lineNum"> 486 </span> : -<span class="lineNum"> 487 </span> : /** -<span class="lineNum"> 488 </span> : * @brief Convert array to lowercase. -<span class="lineNum"> 489 </span> : * -<span class="lineNum"> 490 </span> : * This virtual function converts each char_type in the range [lo,hi) -<span class="lineNum"> 491 </span> : * to lowercase if possible. Other elements remain untouched. -<span class="lineNum"> 492 </span> : * -<span class="lineNum"> 493 </span> : * do_tolower() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 494 </span> : * lowercasing. do_tolower() must always return the same result for -<span class="lineNum"> 495 </span> : * the same input. -<span class="lineNum"> 496 </span> : * -<span class="lineNum"> 497 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 498 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 499 </span> : * @return @a hi. -<span class="lineNum"> 500 </span> : */ -<span class="lineNum"> 501 </span> : virtual const char_type* -<span class="lineNum"> 502 </span> : do_tolower(char_type* __lo, const char_type* __hi) const = 0; -<span class="lineNum"> 503 </span> : -<span class="lineNum"> 504 </span> : /** -<span class="lineNum"> 505 </span> : * @brief Widen char -<span class="lineNum"> 506 </span> : * -<span class="lineNum"> 507 </span> : * This virtual function converts the char to char_type using the -<span class="lineNum"> 508 </span> : * simplest reasonable transformation. -<span class="lineNum"> 509 </span> : * -<span class="lineNum"> 510 </span> : * do_widen() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 511 </span> : * widening. do_widen() must always return the same result for the -<span class="lineNum"> 512 </span> : * same input. -<span class="lineNum"> 513 </span> : * -<span class="lineNum"> 514 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 515 </span> : * codecvt for that. -<span class="lineNum"> 516 </span> : * -<span class="lineNum"> 517 </span> : * @param c The char to convert. -<span class="lineNum"> 518 </span> : * @return The converted char_type -<span class="lineNum"> 519 </span> : */ -<span class="lineNum"> 520 </span> : virtual char_type -<span class="lineNum"> 521 </span> : do_widen(char) const = 0; -<span class="lineNum"> 522 </span> : -<span class="lineNum"> 523 </span> : /** -<span class="lineNum"> 524 </span> : * @brief Widen char array -<span class="lineNum"> 525 </span> : * -<span class="lineNum"> 526 </span> : * This function converts each char in the input to char_type using the -<span class="lineNum"> 527 </span> : * simplest reasonable transformation. -<span class="lineNum"> 528 </span> : * -<span class="lineNum"> 529 </span> : * do_widen() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 530 </span> : * widening. do_widen() must always return the same result for the -<span class="lineNum"> 531 </span> : * same input. -<span class="lineNum"> 532 </span> : * -<span class="lineNum"> 533 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 534 </span> : * codecvt for that. -<span class="lineNum"> 535 </span> : * -<span class="lineNum"> 536 </span> : * @param lo Pointer to start range. -<span class="lineNum"> 537 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 538 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 539 </span> : * @return @a hi. -<span class="lineNum"> 540 </span> : */ -<span class="lineNum"> 541 </span> : virtual const char* -<span class="lineNum"> 542 </span> : do_widen(const char* __lo, const char* __hi, -<span class="lineNum"> 543 </span> : char_type* __dest) const = 0; -<span class="lineNum"> 544 </span> : -<span class="lineNum"> 545 </span> : /** -<span class="lineNum"> 546 </span> : * @brief Narrow char_type to char -<span class="lineNum"> 547 </span> : * -<span class="lineNum"> 548 </span> : * This virtual function converts the argument to char using the -<span class="lineNum"> 549 </span> : * simplest reasonable transformation. If the conversion fails, dfault -<span class="lineNum"> 550 </span> : * is returned instead. -<span class="lineNum"> 551 </span> : * -<span class="lineNum"> 552 </span> : * do_narrow() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 553 </span> : * narrowing. do_narrow() must always return the same result for the -<span class="lineNum"> 554 </span> : * same input. -<span class="lineNum"> 555 </span> : * -<span class="lineNum"> 556 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 557 </span> : * codecvt for that. -<span class="lineNum"> 558 </span> : * -<span class="lineNum"> 559 </span> : * @param c The char_type to convert. -<span class="lineNum"> 560 </span> : * @param dfault Char to return if conversion fails. -<span class="lineNum"> 561 </span> : * @return The converted char. -<span class="lineNum"> 562 </span> : */ -<span class="lineNum"> 563 </span> : virtual char -<span class="lineNum"> 564 </span> : do_narrow(char_type, char __dfault) const = 0; -<span class="lineNum"> 565 </span> : -<span class="lineNum"> 566 </span> : /** -<span class="lineNum"> 567 </span> : * @brief Narrow char_type array to char -<span class="lineNum"> 568 </span> : * -<span class="lineNum"> 569 </span> : * This virtual function converts each char_type in the range [lo,hi) to -<span class="lineNum"> 570 </span> : * char using the simplest reasonable transformation and writes the -<span class="lineNum"> 571 </span> : * results to the destination array. For any element in the input that -<span class="lineNum"> 572 </span> : * cannot be converted, @a dfault is used instead. -<span class="lineNum"> 573 </span> : * -<span class="lineNum"> 574 </span> : * do_narrow() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 575 </span> : * narrowing. do_narrow() must always return the same result for the -<span class="lineNum"> 576 </span> : * same input. -<span class="lineNum"> 577 </span> : * -<span class="lineNum"> 578 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 579 </span> : * codecvt for that. -<span class="lineNum"> 580 </span> : * -<span class="lineNum"> 581 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 582 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 583 </span> : * @param dfault Char to use if conversion fails. -<span class="lineNum"> 584 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 585 </span> : * @return @a hi. -<span class="lineNum"> 586 </span> : */ -<span class="lineNum"> 587 </span> : virtual const char_type* -<span class="lineNum"> 588 </span> : do_narrow(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 589 </span> : char __dfault, char* __dest) const = 0; -<span class="lineNum"> 590 </span> : }; -<span class="lineNum"> 591 </span> : -<span class="lineNum"> 592 </span> : // NB: Generic, mostly useless implementation. -<span class="lineNum"> 593 </span> : /** -<span class="lineNum"> 594 </span> : * @brief Template ctype facet -<span class="lineNum"> 595 </span> : * -<span class="lineNum"> 596 </span> : * This template class defines classification and conversion functions for -<span class="lineNum"> 597 </span> : * character sets. It wraps <cctype> functionality. Ctype gets used by -<span class="lineNum"> 598 </span> : * streams for many I/O operations. -<span class="lineNum"> 599 </span> : * -<span class="lineNum"> 600 </span> : * This template provides the protected virtual functions the developer -<span class="lineNum"> 601 </span> : * will have to replace in a derived class or specialization to make a -<span class="lineNum"> 602 </span> : * working facet. The public functions that access them are defined in -<span class="lineNum"> 603 </span> : * __ctype_abstract_base, to allow for implementation flexibility. See -<span class="lineNum"> 604 </span> : * ctype<wchar_t> for an example. The functions are documented in -<span class="lineNum"> 605 </span> : * __ctype_abstract_base. -<span class="lineNum"> 606 </span> : * -<span class="lineNum"> 607 </span> : * Note: implementations are provided for all the protected virtual -<span class="lineNum"> 608 </span> : * functions, but will likely not be useful. -<span class="lineNum"> 609 </span> : */ -<span class="lineNum"> 610 </span> : template<typename _CharT> -<span class="lineNum"> 611 </span> : class ctype : public __ctype_abstract_base<_CharT> -<span class="lineNum"> 612 </span> : { -<span class="lineNum"> 613 </span> : public: -<span class="lineNum"> 614 </span> : // Types: -<span class="lineNum"> 615 </span> : typedef _CharT char_type; -<span class="lineNum"> 616 </span> : typedef typename __ctype_abstract_base<_CharT>::mask mask; -<span class="lineNum"> 617 </span> : -<span class="lineNum"> 618 </span> : /// The facet id for ctype<char_type> -<span class="lineNum"> 619 </span> : static locale::id id; -<span class="lineNum"> 620 </span> : -<span class="lineNum"> 621 </span> : explicit -<span class="lineNum"> 622 </span> : ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { } -<span class="lineNum"> 623 </span> : -<span class="lineNum"> 624 </span> : protected: -<span class="lineNum"> 625 </span> : virtual -<span class="lineNum"> 626 </span> : ~ctype(); -<span class="lineNum"> 627 </span> : -<span class="lineNum"> 628 </span> : virtual bool -<span class="lineNum"> 629 </span> : do_is(mask __m, char_type __c) const; -<span class="lineNum"> 630 </span> : -<span class="lineNum"> 631 </span> : virtual const char_type* -<span class="lineNum"> 632 </span> : do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; -<span class="lineNum"> 633 </span> : -<span class="lineNum"> 634 </span> : virtual const char_type* -<span class="lineNum"> 635 </span> : do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 636 </span> : -<span class="lineNum"> 637 </span> : virtual const char_type* -<span class="lineNum"> 638 </span> : do_scan_not(mask __m, const char_type* __lo, -<span class="lineNum"> 639 </span> : const char_type* __hi) const; -<span class="lineNum"> 640 </span> : -<span class="lineNum"> 641 </span> : virtual char_type -<span class="lineNum"> 642 </span> : do_toupper(char_type __c) const; -<span class="lineNum"> 643 </span> : -<span class="lineNum"> 644 </span> : virtual const char_type* -<span class="lineNum"> 645 </span> : do_toupper(char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 646 </span> : -<span class="lineNum"> 647 </span> : virtual char_type -<span class="lineNum"> 648 </span> : do_tolower(char_type __c) const; -<span class="lineNum"> 649 </span> : -<span class="lineNum"> 650 </span> : virtual const char_type* -<span class="lineNum"> 651 </span> : do_tolower(char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 652 </span> : -<span class="lineNum"> 653 </span> : virtual char_type -<span class="lineNum"> 654 </span> : do_widen(char __c) const; -<span class="lineNum"> 655 </span> : -<span class="lineNum"> 656 </span> : virtual const char* -<span class="lineNum"> 657 </span> : do_widen(const char* __lo, const char* __hi, char_type* __dest) const; -<span class="lineNum"> 658 </span> : -<span class="lineNum"> 659 </span> : virtual char -<span class="lineNum"> 660 </span> : do_narrow(char_type, char __dfault) const; -<span class="lineNum"> 661 </span> : -<span class="lineNum"> 662 </span> : virtual const char_type* -<span class="lineNum"> 663 </span> : do_narrow(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 664 </span> : char __dfault, char* __dest) const; -<span class="lineNum"> 665 </span> : }; -<span class="lineNum"> 666 </span> : -<span class="lineNum"> 667 </span> : template<typename _CharT> -<span class="lineNum"> 668 </span> : locale::id ctype<_CharT>::id; -<span class="lineNum"> 669 </span> : -<span class="lineNum"> 670 </span> : // 22.2.1.3 ctype<char> specialization. -<span class="lineNum"> 671 </span> : /** -<span class="lineNum"> 672 </span> : * @brief The ctype<char> specialization. -<span class="lineNum"> 673 </span> : * -<span class="lineNum"> 674 </span> : * This class defines classification and conversion functions for -<span class="lineNum"> 675 </span> : * the char type. It gets used by char streams for many I/O -<span class="lineNum"> 676 </span> : * operations. The char specialization provides a number of -<span class="lineNum"> 677 </span> : * optimizations as well. -<span class="lineNum"> 678 </span> : */ -<span class="lineNum"> 679 </span> : template<> -<span class="lineNum"> 680 </span> : class ctype<char> : public locale::facet, public ctype_base -<span class="lineNum"> 681 </span> : { -<span class="lineNum"> 682 </span> : public: -<span class="lineNum"> 683 </span> : // Types: -<span class="lineNum"> 684 </span> : /// Typedef for the template parameter char. -<span class="lineNum"> 685 </span> : typedef char char_type; -<span class="lineNum"> 686 </span> : -<span class="lineNum"> 687 </span> : protected: -<span class="lineNum"> 688 </span> : // Data Members: -<span class="lineNum"> 689 </span> : __c_locale _M_c_locale_ctype; -<span class="lineNum"> 690 </span> : bool _M_del; -<span class="lineNum"> 691 </span> : __to_type _M_toupper; -<span class="lineNum"> 692 </span> : __to_type _M_tolower; -<span class="lineNum"> 693 </span> : const mask* _M_table; -<span class="lineNum"> 694 </span> : mutable char _M_widen_ok; -<span class="lineNum"> 695 </span> : mutable char _M_widen[1 + static_cast<unsigned char>(-1)]; -<span class="lineNum"> 696 </span> : mutable char _M_narrow[1 + static_cast<unsigned char>(-1)]; -<span class="lineNum"> 697 </span> : mutable char _M_narrow_ok; // 0 uninitialized, 1 init, -<span class="lineNum"> 698 </span> : // 2 memcpy can't be used -<span class="lineNum"> 699 </span> : -<span class="lineNum"> 700 </span> : public: -<span class="lineNum"> 701 </span> : /// The facet id for ctype<char> -<span class="lineNum"> 702 </span> : static locale::id id; -<span class="lineNum"> 703 </span> : /// The size of the mask table. It is SCHAR_MAX + 1. -<span class="lineNum"> 704 </span> : static const size_t table_size = 1 + static_cast<unsigned char>(-1); -<span class="lineNum"> 705 </span> : -<span class="lineNum"> 706 </span> : /** -<span class="lineNum"> 707 </span> : * @brief Constructor performs initialization. -<span class="lineNum"> 708 </span> : * -<span class="lineNum"> 709 </span> : * This is the constructor provided by the standard. -<span class="lineNum"> 710 </span> : * -<span class="lineNum"> 711 </span> : * @param table If non-zero, table is used as the per-char mask. -<span class="lineNum"> 712 </span> : * Else classic_table() is used. -<span class="lineNum"> 713 </span> : * @param del If true, passes ownership of table to this facet. -<span class="lineNum"> 714 </span> : * @param refs Passed to the base facet class. -<span class="lineNum"> 715 </span> : */ -<span class="lineNum"> 716 </span> : explicit -<span class="lineNum"> 717 </span> : ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0); -<span class="lineNum"> 718 </span> : -<span class="lineNum"> 719 </span> : /** -<span class="lineNum"> 720 </span> : * @brief Constructor performs static initialization. -<span class="lineNum"> 721 </span> : * -<span class="lineNum"> 722 </span> : * This constructor is used to construct the initial C locale facet. -<span class="lineNum"> 723 </span> : * -<span class="lineNum"> 724 </span> : * @param cloc Handle to C locale data. -<span class="lineNum"> 725 </span> : * @param table If non-zero, table is used as the per-char mask. -<span class="lineNum"> 726 </span> : * @param del If true, passes ownership of table to this facet. -<span class="lineNum"> 727 </span> : * @param refs Passed to the base facet class. -<span class="lineNum"> 728 </span> : */ -<span class="lineNum"> 729 </span> : explicit -<span class="lineNum"> 730 </span> : ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false, -<span class="lineNum"> 731 </span> : size_t __refs = 0); -<span class="lineNum"> 732 </span> : -<span class="lineNum"> 733 </span> : /** -<span class="lineNum"> 734 </span> : * @brief Test char classification. -<span class="lineNum"> 735 </span> : * -<span class="lineNum"> 736 </span> : * This function compares the mask table[c] to @a m. -<span class="lineNum"> 737 </span> : * -<span class="lineNum"> 738 </span> : * @param c The char to compare the mask of. -<span class="lineNum"> 739 </span> : * @param m The mask to compare against. -<span class="lineNum"> 740 </span> : * @return True if m & table[c] is true, false otherwise. -<span class="lineNum"> 741 </span> : */ -<span class="lineNum"> 742 </span> : inline bool -<span class="lineNum"> 743 </span> : is(mask __m, char __c) const; -<span class="lineNum"> 744 </span> : -<span class="lineNum"> 745 </span> : /** -<span class="lineNum"> 746 </span> : * @brief Return a mask array. -<span class="lineNum"> 747 </span> : * -<span class="lineNum"> 748 </span> : * This function finds the mask for each char in the range [lo, hi) and -<span class="lineNum"> 749 </span> : * successively writes it to vec. vec must have as many elements as -<span class="lineNum"> 750 </span> : * the char array. -<span class="lineNum"> 751 </span> : * -<span class="lineNum"> 752 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 753 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 754 </span> : * @param vec Pointer to an array of mask storage. -<span class="lineNum"> 755 </span> : * @return @a hi. -<span class="lineNum"> 756 </span> : */ -<span class="lineNum"> 757 </span> : inline const char* -<span class="lineNum"> 758 </span> : is(const char* __lo, const char* __hi, mask* __vec) const; -<span class="lineNum"> 759 </span> : -<span class="lineNum"> 760 </span> : /** -<span class="lineNum"> 761 </span> : * @brief Find char matching a mask -<span class="lineNum"> 762 </span> : * -<span class="lineNum"> 763 </span> : * This function searches for and returns the first char in [lo,hi) for -<span class="lineNum"> 764 </span> : * which is(m,char) is true. -<span class="lineNum"> 765 </span> : * -<span class="lineNum"> 766 </span> : * @param m The mask to compare against. -<span class="lineNum"> 767 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 768 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 769 </span> : * @return Pointer to a matching char if found, else @a hi. -<span class="lineNum"> 770 </span> : */ -<span class="lineNum"> 771 </span> : inline const char* -<span class="lineNum"> 772 </span> : scan_is(mask __m, const char* __lo, const char* __hi) const; -<span class="lineNum"> 773 </span> : -<span class="lineNum"> 774 </span> : /** -<span class="lineNum"> 775 </span> : * @brief Find char not matching a mask -<span class="lineNum"> 776 </span> : * -<span class="lineNum"> 777 </span> : * This function searches for and returns a pointer to the first char -<span class="lineNum"> 778 </span> : * in [lo,hi) for which is(m,char) is false. -<span class="lineNum"> 779 </span> : * -<span class="lineNum"> 780 </span> : * @param m The mask to compare against. -<span class="lineNum"> 781 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 782 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 783 </span> : * @return Pointer to a non-matching char if found, else @a hi. -<span class="lineNum"> 784 </span> : */ -<span class="lineNum"> 785 </span> : inline const char* -<span class="lineNum"> 786 </span> : scan_not(mask __m, const char* __lo, const char* __hi) const; -<span class="lineNum"> 787 </span> : -<span class="lineNum"> 788 </span> : /** -<span class="lineNum"> 789 </span> : * @brief Convert to uppercase. -<span class="lineNum"> 790 </span> : * -<span class="lineNum"> 791 </span> : * This function converts the char argument to uppercase if possible. -<span class="lineNum"> 792 </span> : * If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 793 </span> : * -<span class="lineNum"> 794 </span> : * toupper() acts as if it returns ctype<char>::do_toupper(c). -<span class="lineNum"> 795 </span> : * do_toupper() must always return the same result for the same input. -<span class="lineNum"> 796 </span> : * -<span class="lineNum"> 797 </span> : * @param c The char to convert. -<span class="lineNum"> 798 </span> : * @return The uppercase char if convertible, else @a c. -<span class="lineNum"> 799 </span> : */ -<span class="lineNum"> 800 </span> : char_type -<span class="lineNum"> 801 </span> : toupper(char_type __c) const -<span class="lineNum"> 802 </span> : { return this->do_toupper(__c); } -<span class="lineNum"> 803 </span> : -<span class="lineNum"> 804 </span> : /** -<span class="lineNum"> 805 </span> : * @brief Convert array to uppercase. -<span class="lineNum"> 806 </span> : * -<span class="lineNum"> 807 </span> : * This function converts each char in the range [lo,hi) to uppercase -<span class="lineNum"> 808 </span> : * if possible. Other chars remain untouched. -<span class="lineNum"> 809 </span> : * -<span class="lineNum"> 810 </span> : * toupper() acts as if it returns ctype<char>:: do_toupper(lo, hi). -<span class="lineNum"> 811 </span> : * do_toupper() must always return the same result for the same input. -<span class="lineNum"> 812 </span> : * -<span class="lineNum"> 813 </span> : * @param lo Pointer to first char in range. -<span class="lineNum"> 814 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 815 </span> : * @return @a hi. -<span class="lineNum"> 816 </span> : */ -<span class="lineNum"> 817 </span> : const char_type* -<span class="lineNum"> 818 </span> : toupper(char_type *__lo, const char_type* __hi) const -<span class="lineNum"> 819 </span> : { return this->do_toupper(__lo, __hi); } -<span class="lineNum"> 820 </span> : -<span class="lineNum"> 821 </span> : /** -<span class="lineNum"> 822 </span> : * @brief Convert to lowercase. -<span class="lineNum"> 823 </span> : * -<span class="lineNum"> 824 </span> : * This function converts the char argument to lowercase if possible. -<span class="lineNum"> 825 </span> : * If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 826 </span> : * -<span class="lineNum"> 827 </span> : * tolower() acts as if it returns ctype<char>::do_tolower(c). -<span class="lineNum"> 828 </span> : * do_tolower() must always return the same result for the same input. -<span class="lineNum"> 829 </span> : * -<span class="lineNum"> 830 </span> : * @param c The char to convert. -<span class="lineNum"> 831 </span> : * @return The lowercase char if convertible, else @a c. -<span class="lineNum"> 832 </span> : */ -<span class="lineNum"> 833 </span> : char_type -<span class="lineNum"> 834 </span> : tolower(char_type __c) const -<span class="lineNum"> 835 </span> : { return this->do_tolower(__c); } -<span class="lineNum"> 836 </span> : -<span class="lineNum"> 837 </span> : /** -<span class="lineNum"> 838 </span> : * @brief Convert array to lowercase. -<span class="lineNum"> 839 </span> : * -<span class="lineNum"> 840 </span> : * This function converts each char in the range [lo,hi) to lowercase -<span class="lineNum"> 841 </span> : * if possible. Other chars remain untouched. -<span class="lineNum"> 842 </span> : * -<span class="lineNum"> 843 </span> : * tolower() acts as if it returns ctype<char>:: do_tolower(lo, hi). -<span class="lineNum"> 844 </span> : * do_tolower() must always return the same result for the same input. -<span class="lineNum"> 845 </span> : * -<span class="lineNum"> 846 </span> : * @param lo Pointer to first char in range. -<span class="lineNum"> 847 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 848 </span> : * @return @a hi. -<span class="lineNum"> 849 </span> : */ -<span class="lineNum"> 850 </span> : const char_type* -<span class="lineNum"> 851 </span> : tolower(char_type* __lo, const char_type* __hi) const -<span class="lineNum"> 852 </span> : { return this->do_tolower(__lo, __hi); } -<span class="lineNum"> 853 </span> : -<span class="lineNum"> 854 </span> : /** -<span class="lineNum"> 855 </span> : * @brief Widen char -<span class="lineNum"> 856 </span> : * -<span class="lineNum"> 857 </span> : * This function converts the char to char_type using the simplest -<span class="lineNum"> 858 </span> : * reasonable transformation. For an underived ctype<char> facet, the -<span class="lineNum"> 859 </span> : * argument will be returned unchanged. -<span class="lineNum"> 860 </span> : * -<span class="lineNum"> 861 </span> : * This function works as if it returns ctype<char>::do_widen(c). -<span class="lineNum"> 862 </span> : * do_widen() must always return the same result for the same input. -<span class="lineNum"> 863 </span> : * -<span class="lineNum"> 864 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 865 </span> : * codecvt for that. -<span class="lineNum"> 866 </span> : * -<span class="lineNum"> 867 </span> : * @param c The char to convert. -<span class="lineNum"> 868 </span> : * @return The converted character. -<span class="lineNum"> 869 </span> : */ -<span class="lineNum"> 870 </span> : char_type -<span class="lineNum"> 871 </span><span class="lineNoCov"> 0 : widen(char __c) const</span> -<span class="lineNum"> 872 </span> : { -<span class="lineNum"> 873 </span><span class="lineNoCov"> 0 : if (_M_widen_ok)</span> -<span class="lineNum"> 874 </span><span class="lineNoCov"> 0 : return _M_widen[static_cast<unsigned char>(__c)];</span> -<span class="lineNum"> 875 </span><span class="lineNoCov"> 0 : this->_M_widen_init();</span> -<span class="lineNum"> 876 </span><span class="lineNoCov"> 0 : return this->do_widen(__c);</span> -<span class="lineNum"> 877 </span> : } -<span class="lineNum"> 878 </span> : -<span class="lineNum"> 879 </span> : /** -<span class="lineNum"> 880 </span> : * @brief Widen char array -<span class="lineNum"> 881 </span> : * -<span class="lineNum"> 882 </span> : * This function converts each char in the input to char using the -<span class="lineNum"> 883 </span> : * simplest reasonable transformation. For an underived ctype<char> -<span class="lineNum"> 884 </span> : * facet, the argument will be copied unchanged. -<span class="lineNum"> 885 </span> : * -<span class="lineNum"> 886 </span> : * This function works as if it returns ctype<char>::do_widen(c). -<span class="lineNum"> 887 </span> : * do_widen() must always return the same result for the same input. -<span class="lineNum"> 888 </span> : * -<span class="lineNum"> 889 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 890 </span> : * codecvt for that. -<span class="lineNum"> 891 </span> : * -<span class="lineNum"> 892 </span> : * @param lo Pointer to first char in range. -<span class="lineNum"> 893 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 894 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 895 </span> : * @return @a hi. -<span class="lineNum"> 896 </span> : */ -<span class="lineNum"> 897 </span> : const char* -<span class="lineNum"> 898 </span> : widen(const char* __lo, const char* __hi, char_type* __to) const -<span class="lineNum"> 899 </span> : { -<span class="lineNum"> 900 </span> : if (_M_widen_ok == 1) -<span class="lineNum"> 901 </span> : { -<span class="lineNum"> 902 </span> : __builtin_memcpy(__to, __lo, __hi - __lo); -<span class="lineNum"> 903 </span> : return __hi; -<span class="lineNum"> 904 </span> : } -<span class="lineNum"> 905 </span> : if (!_M_widen_ok) -<span class="lineNum"> 906 </span> : _M_widen_init(); -<span class="lineNum"> 907 </span> : return this->do_widen(__lo, __hi, __to); -<span class="lineNum"> 908 </span> : } -<span class="lineNum"> 909 </span> : -<span class="lineNum"> 910 </span> : /** -<span class="lineNum"> 911 </span> : * @brief Narrow char -<span class="lineNum"> 912 </span> : * -<span class="lineNum"> 913 </span> : * This function converts the char to char using the simplest -<span class="lineNum"> 914 </span> : * reasonable transformation. If the conversion fails, dfault is -<span class="lineNum"> 915 </span> : * returned instead. For an underived ctype<char> facet, @a c -<span class="lineNum"> 916 </span> : * will be returned unchanged. -<span class="lineNum"> 917 </span> : * -<span class="lineNum"> 918 </span> : * This function works as if it returns ctype<char>::do_narrow(c). -<span class="lineNum"> 919 </span> : * do_narrow() must always return the same result for the same input. -<span class="lineNum"> 920 </span> : * -<span class="lineNum"> 921 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 922 </span> : * codecvt for that. -<span class="lineNum"> 923 </span> : * -<span class="lineNum"> 924 </span> : * @param c The char to convert. -<span class="lineNum"> 925 </span> : * @param dfault Char to return if conversion fails. -<span class="lineNum"> 926 </span> : * @return The converted character. -<span class="lineNum"> 927 </span> : */ -<span class="lineNum"> 928 </span> : char -<span class="lineNum"> 929 </span> : narrow(char_type __c, char __dfault) const -<span class="lineNum"> 930 </span> : { -<span class="lineNum"> 931 </span> : if (_M_narrow[static_cast<unsigned char>(__c)]) -<span class="lineNum"> 932 </span> : return _M_narrow[static_cast<unsigned char>(__c)]; -<span class="lineNum"> 933 </span> : const char __t = do_narrow(__c, __dfault); -<span class="lineNum"> 934 </span> : if (__t != __dfault) -<span class="lineNum"> 935 </span> : _M_narrow[static_cast<unsigned char>(__c)] = __t; -<span class="lineNum"> 936 </span> : return __t; -<span class="lineNum"> 937 </span> : } -<span class="lineNum"> 938 </span> : -<span class="lineNum"> 939 </span> : /** -<span class="lineNum"> 940 </span> : * @brief Narrow char array -<span class="lineNum"> 941 </span> : * -<span class="lineNum"> 942 </span> : * This function converts each char in the input to char using the -<span class="lineNum"> 943 </span> : * simplest reasonable transformation and writes the results to the -<span class="lineNum"> 944 </span> : * destination array. For any char in the input that cannot be -<span class="lineNum"> 945 </span> : * converted, @a dfault is used instead. For an underived ctype<char> -<span class="lineNum"> 946 </span> : * facet, the argument will be copied unchanged. -<span class="lineNum"> 947 </span> : * -<span class="lineNum"> 948 </span> : * This function works as if it returns ctype<char>::do_narrow(lo, hi, -<span class="lineNum"> 949 </span> : * dfault, to). do_narrow() must always return the same result for the -<span class="lineNum"> 950 </span> : * same input. -<span class="lineNum"> 951 </span> : * -<span class="lineNum"> 952 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 953 </span> : * codecvt for that. -<span class="lineNum"> 954 </span> : * -<span class="lineNum"> 955 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 956 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 957 </span> : * @param dfault Char to use if conversion fails. -<span class="lineNum"> 958 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 959 </span> : * @return @a hi. -<span class="lineNum"> 960 </span> : */ -<span class="lineNum"> 961 </span> : const char_type* -<span class="lineNum"> 962 </span> : narrow(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 963 </span> : char __dfault, char *__to) const -<span class="lineNum"> 964 </span> : { -<span class="lineNum"> 965 </span> : if (__builtin_expect(_M_narrow_ok == 1, true)) -<span class="lineNum"> 966 </span> : { -<span class="lineNum"> 967 </span> : __builtin_memcpy(__to, __lo, __hi - __lo); -<span class="lineNum"> 968 </span> : return __hi; -<span class="lineNum"> 969 </span> : } -<span class="lineNum"> 970 </span> : if (!_M_narrow_ok) -<span class="lineNum"> 971 </span> : _M_narrow_init(); -<span class="lineNum"> 972 </span> : return this->do_narrow(__lo, __hi, __dfault, __to); -<span class="lineNum"> 973 </span> : } -<span class="lineNum"> 974 </span> : -<span class="lineNum"> 975 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 976 </span> : // DR 695. ctype<char>::classic_table() not accessible. -<span class="lineNum"> 977 </span> : /// Returns a pointer to the mask table provided to the constructor, or -<span class="lineNum"> 978 </span> : /// the default from classic_table() if none was provided. -<span class="lineNum"> 979 </span> : const mask* -<span class="lineNum"> 980 </span> : table() const throw() -<span class="lineNum"> 981 </span> : { return _M_table; } -<span class="lineNum"> 982 </span> : -<span class="lineNum"> 983 </span> : /// Returns a pointer to the C locale mask table. -<span class="lineNum"> 984 </span> : static const mask* -<span class="lineNum"> 985 </span> : classic_table() throw(); -<span class="lineNum"> 986 </span> : protected: -<span class="lineNum"> 987 </span> : -<span class="lineNum"> 988 </span> : /** -<span class="lineNum"> 989 </span> : * @brief Destructor. -<span class="lineNum"> 990 </span> : * -<span class="lineNum"> 991 </span> : * This function deletes table() if @a del was true in the -<span class="lineNum"> 992 </span> : * constructor. -<span class="lineNum"> 993 </span> : */ -<span class="lineNum"> 994 </span> : virtual -<span class="lineNum"> 995 </span> : ~ctype(); -<span class="lineNum"> 996 </span> : -<span class="lineNum"> 997 </span> : /** -<span class="lineNum"> 998 </span> : * @brief Convert to uppercase. -<span class="lineNum"> 999 </span> : * -<span class="lineNum"> 1000 </span> : * This virtual function converts the char argument to uppercase if -<span class="lineNum"> 1001 </span> : * possible. If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 1002 </span> : * -<span class="lineNum"> 1003 </span> : * do_toupper() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1004 </span> : * uppercasing. do_toupper() must always return the same result for -<span class="lineNum"> 1005 </span> : * the same input. -<span class="lineNum"> 1006 </span> : * -<span class="lineNum"> 1007 </span> : * @param c The char to convert. -<span class="lineNum"> 1008 </span> : * @return The uppercase char if convertible, else @a c. -<span class="lineNum"> 1009 </span> : */ -<span class="lineNum"> 1010 </span> : virtual char_type -<span class="lineNum"> 1011 </span> : do_toupper(char_type) const; -<span class="lineNum"> 1012 </span> : -<span class="lineNum"> 1013 </span> : /** -<span class="lineNum"> 1014 </span> : * @brief Convert array to uppercase. -<span class="lineNum"> 1015 </span> : * -<span class="lineNum"> 1016 </span> : * This virtual function converts each char in the range [lo,hi) to -<span class="lineNum"> 1017 </span> : * uppercase if possible. Other chars remain untouched. -<span class="lineNum"> 1018 </span> : * -<span class="lineNum"> 1019 </span> : * do_toupper() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1020 </span> : * uppercasing. do_toupper() must always return the same result for -<span class="lineNum"> 1021 </span> : * the same input. -<span class="lineNum"> 1022 </span> : * -<span class="lineNum"> 1023 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1024 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1025 </span> : * @return @a hi. -<span class="lineNum"> 1026 </span> : */ -<span class="lineNum"> 1027 </span> : virtual const char_type* -<span class="lineNum"> 1028 </span> : do_toupper(char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 1029 </span> : -<span class="lineNum"> 1030 </span> : /** -<span class="lineNum"> 1031 </span> : * @brief Convert to lowercase. -<span class="lineNum"> 1032 </span> : * -<span class="lineNum"> 1033 </span> : * This virtual function converts the char argument to lowercase if -<span class="lineNum"> 1034 </span> : * possible. If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 1035 </span> : * -<span class="lineNum"> 1036 </span> : * do_tolower() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1037 </span> : * lowercasing. do_tolower() must always return the same result for -<span class="lineNum"> 1038 </span> : * the same input. -<span class="lineNum"> 1039 </span> : * -<span class="lineNum"> 1040 </span> : * @param c The char to convert. -<span class="lineNum"> 1041 </span> : * @return The lowercase char if convertible, else @a c. -<span class="lineNum"> 1042 </span> : */ -<span class="lineNum"> 1043 </span> : virtual char_type -<span class="lineNum"> 1044 </span> : do_tolower(char_type) const; -<span class="lineNum"> 1045 </span> : -<span class="lineNum"> 1046 </span> : /** -<span class="lineNum"> 1047 </span> : * @brief Convert array to lowercase. -<span class="lineNum"> 1048 </span> : * -<span class="lineNum"> 1049 </span> : * This virtual function converts each char in the range [lo,hi) to -<span class="lineNum"> 1050 </span> : * lowercase if possible. Other chars remain untouched. -<span class="lineNum"> 1051 </span> : * -<span class="lineNum"> 1052 </span> : * do_tolower() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1053 </span> : * lowercasing. do_tolower() must always return the same result for -<span class="lineNum"> 1054 </span> : * the same input. -<span class="lineNum"> 1055 </span> : * -<span class="lineNum"> 1056 </span> : * @param lo Pointer to first char in range. -<span class="lineNum"> 1057 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1058 </span> : * @return @a hi. -<span class="lineNum"> 1059 </span> : */ -<span class="lineNum"> 1060 </span> : virtual const char_type* -<span class="lineNum"> 1061 </span> : do_tolower(char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 1062 </span> : -<span class="lineNum"> 1063 </span> : /** -<span class="lineNum"> 1064 </span> : * @brief Widen char -<span class="lineNum"> 1065 </span> : * -<span class="lineNum"> 1066 </span> : * This virtual function converts the char to char using the simplest -<span class="lineNum"> 1067 </span> : * reasonable transformation. For an underived ctype<char> facet, the -<span class="lineNum"> 1068 </span> : * argument will be returned unchanged. -<span class="lineNum"> 1069 </span> : * -<span class="lineNum"> 1070 </span> : * do_widen() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1071 </span> : * widening. do_widen() must always return the same result for the -<span class="lineNum"> 1072 </span> : * same input. -<span class="lineNum"> 1073 </span> : * -<span class="lineNum"> 1074 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1075 </span> : * codecvt for that. -<span class="lineNum"> 1076 </span> : * -<span class="lineNum"> 1077 </span> : * @param c The char to convert. -<span class="lineNum"> 1078 </span> : * @return The converted character. -<span class="lineNum"> 1079 </span> : */ -<span class="lineNum"> 1080 </span> : virtual char_type -<span class="lineNum"> 1081 </span> : do_widen(char __c) const -<span class="lineNum"> 1082 </span> : { return __c; } -<span class="lineNum"> 1083 </span> : -<span class="lineNum"> 1084 </span> : /** -<span class="lineNum"> 1085 </span> : * @brief Widen char array -<span class="lineNum"> 1086 </span> : * -<span class="lineNum"> 1087 </span> : * This function converts each char in the range [lo,hi) to char using -<span class="lineNum"> 1088 </span> : * the simplest reasonable transformation. For an underived -<span class="lineNum"> 1089 </span> : * ctype<char> facet, the argument will be copied unchanged. -<span class="lineNum"> 1090 </span> : * -<span class="lineNum"> 1091 </span> : * do_widen() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1092 </span> : * widening. do_widen() must always return the same result for the -<span class="lineNum"> 1093 </span> : * same input. -<span class="lineNum"> 1094 </span> : * -<span class="lineNum"> 1095 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1096 </span> : * codecvt for that. -<span class="lineNum"> 1097 </span> : * -<span class="lineNum"> 1098 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1099 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1100 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 1101 </span> : * @return @a hi. -<span class="lineNum"> 1102 </span> : */ -<span class="lineNum"> 1103 </span> : virtual const char* -<span class="lineNum"> 1104 </span> : do_widen(const char* __lo, const char* __hi, char_type* __dest) const -<span class="lineNum"> 1105 </span> : { -<span class="lineNum"> 1106 </span> : __builtin_memcpy(__dest, __lo, __hi - __lo); -<span class="lineNum"> 1107 </span> : return __hi; -<span class="lineNum"> 1108 </span> : } -<span class="lineNum"> 1109 </span> : -<span class="lineNum"> 1110 </span> : /** -<span class="lineNum"> 1111 </span> : * @brief Narrow char -<span class="lineNum"> 1112 </span> : * -<span class="lineNum"> 1113 </span> : * This virtual function converts the char to char using the simplest -<span class="lineNum"> 1114 </span> : * reasonable transformation. If the conversion fails, dfault is -<span class="lineNum"> 1115 </span> : * returned instead. For an underived ctype<char> facet, @a c will be -<span class="lineNum"> 1116 </span> : * returned unchanged. -<span class="lineNum"> 1117 </span> : * -<span class="lineNum"> 1118 </span> : * do_narrow() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1119 </span> : * narrowing. do_narrow() must always return the same result for the -<span class="lineNum"> 1120 </span> : * same input. -<span class="lineNum"> 1121 </span> : * -<span class="lineNum"> 1122 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1123 </span> : * codecvt for that. -<span class="lineNum"> 1124 </span> : * -<span class="lineNum"> 1125 </span> : * @param c The char to convert. -<span class="lineNum"> 1126 </span> : * @param dfault Char to return if conversion fails. -<span class="lineNum"> 1127 </span> : * @return The converted char. -<span class="lineNum"> 1128 </span> : */ -<span class="lineNum"> 1129 </span> : virtual char -<span class="lineNum"> 1130 </span> : do_narrow(char_type __c, char) const -<span class="lineNum"> 1131 </span> : { return __c; } -<span class="lineNum"> 1132 </span> : -<span class="lineNum"> 1133 </span> : /** -<span class="lineNum"> 1134 </span> : * @brief Narrow char array to char array -<span class="lineNum"> 1135 </span> : * -<span class="lineNum"> 1136 </span> : * This virtual function converts each char in the range [lo,hi) to -<span class="lineNum"> 1137 </span> : * char using the simplest reasonable transformation and writes the -<span class="lineNum"> 1138 </span> : * results to the destination array. For any char in the input that -<span class="lineNum"> 1139 </span> : * cannot be converted, @a dfault is used instead. For an underived -<span class="lineNum"> 1140 </span> : * ctype<char> facet, the argument will be copied unchanged. -<span class="lineNum"> 1141 </span> : * -<span class="lineNum"> 1142 </span> : * do_narrow() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1143 </span> : * narrowing. do_narrow() must always return the same result for the -<span class="lineNum"> 1144 </span> : * same input. -<span class="lineNum"> 1145 </span> : * -<span class="lineNum"> 1146 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1147 </span> : * codecvt for that. -<span class="lineNum"> 1148 </span> : * -<span class="lineNum"> 1149 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1150 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1151 </span> : * @param dfault Char to use if conversion fails. -<span class="lineNum"> 1152 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 1153 </span> : * @return @a hi. -<span class="lineNum"> 1154 </span> : */ -<span class="lineNum"> 1155 </span> : virtual const char_type* -<span class="lineNum"> 1156 </span> : do_narrow(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 1157 </span> : char, char* __dest) const -<span class="lineNum"> 1158 </span> : { -<span class="lineNum"> 1159 </span> : __builtin_memcpy(__dest, __lo, __hi - __lo); -<span class="lineNum"> 1160 </span> : return __hi; -<span class="lineNum"> 1161 </span> : } -<span class="lineNum"> 1162 </span> : -<span class="lineNum"> 1163 </span> : private: -<span class="lineNum"> 1164 </span> : -<span class="lineNum"> 1165 </span><span class="lineNoCov"> 0 : void _M_widen_init() const</span> -<span class="lineNum"> 1166 </span> : { -<span class="lineNum"> 1167 </span> : char __tmp[sizeof(_M_widen)]; -<span class="lineNum"> 1168 </span><span class="lineNoCov"> 0 : for (size_t __i = 0; __i < sizeof(_M_widen); ++__i)</span> -<span class="lineNum"> 1169 </span><span class="lineNoCov"> 0 : __tmp[__i] = __i;</span> -<span class="lineNum"> 1170 </span><span class="lineNoCov"> 0 : do_widen(__tmp, __tmp + sizeof(__tmp), _M_widen);</span> -<span class="lineNum"> 1171 </span> : -<span class="lineNum"> 1172 </span><span class="lineNoCov"> 0 : _M_widen_ok = 1;</span> -<span class="lineNum"> 1173 </span> : // Set _M_widen_ok to 2 if memcpy can't be used. -<span class="lineNum"> 1174 </span><span class="lineNoCov"> 0 : if (__builtin_memcmp(__tmp, _M_widen, sizeof(_M_widen)))</span> -<span class="lineNum"> 1175 </span><span class="lineNoCov"> 0 : _M_widen_ok = 2;</span> -<span class="lineNum"> 1176 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1177 </span> : -<span class="lineNum"> 1178 </span> : // Fill in the narrowing cache and flag whether all values are -<span class="lineNum"> 1179 </span> : // valid or not. _M_narrow_ok is set to 2 if memcpy can't -<span class="lineNum"> 1180 </span> : // be used. -<span class="lineNum"> 1181 </span> : void _M_narrow_init() const -<span class="lineNum"> 1182 </span> : { -<span class="lineNum"> 1183 </span> : char __tmp[sizeof(_M_narrow)]; -<span class="lineNum"> 1184 </span> : for (size_t __i = 0; __i < sizeof(_M_narrow); ++__i) -<span class="lineNum"> 1185 </span> : __tmp[__i] = __i; -<span class="lineNum"> 1186 </span> : do_narrow(__tmp, __tmp + sizeof(__tmp), 0, _M_narrow); -<span class="lineNum"> 1187 </span> : -<span class="lineNum"> 1188 </span> : _M_narrow_ok = 1; -<span class="lineNum"> 1189 </span> : if (__builtin_memcmp(__tmp, _M_narrow, sizeof(_M_narrow))) -<span class="lineNum"> 1190 </span> : _M_narrow_ok = 2; -<span class="lineNum"> 1191 </span> : else -<span class="lineNum"> 1192 </span> : { -<span class="lineNum"> 1193 </span> : // Deal with the special case of zero: renarrow with a -<span class="lineNum"> 1194 </span> : // different default and compare. -<span class="lineNum"> 1195 </span> : char __c; -<span class="lineNum"> 1196 </span> : do_narrow(__tmp, __tmp + 1, 1, &__c); -<span class="lineNum"> 1197 </span> : if (__c == 1) -<span class="lineNum"> 1198 </span> : _M_narrow_ok = 2; -<span class="lineNum"> 1199 </span> : } -<span class="lineNum"> 1200 </span> : } -<span class="lineNum"> 1201 </span> : }; -<span class="lineNum"> 1202 </span> : -<span class="lineNum"> 1203 </span> : template<> -<span class="lineNum"> 1204 </span> : const ctype<char>& -<span class="lineNum"> 1205 </span> : use_facet<ctype<char> >(const locale& __loc); -<span class="lineNum"> 1206 </span> : -<span class="lineNum"> 1207 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 1208 </span> : // 22.2.1.3 ctype<wchar_t> specialization -<span class="lineNum"> 1209 </span> : /** -<span class="lineNum"> 1210 </span> : * @brief The ctype<wchar_t> specialization. -<span class="lineNum"> 1211 </span> : * -<span class="lineNum"> 1212 </span> : * This class defines classification and conversion functions for the -<span class="lineNum"> 1213 </span> : * wchar_t type. It gets used by wchar_t streams for many I/O operations. -<span class="lineNum"> 1214 </span> : * The wchar_t specialization provides a number of optimizations as well. -<span class="lineNum"> 1215 </span> : * -<span class="lineNum"> 1216 </span> : * ctype<wchar_t> inherits its public methods from -<span class="lineNum"> 1217 </span> : * __ctype_abstract_base<wchar_t>. -<span class="lineNum"> 1218 </span> : */ -<span class="lineNum"> 1219 </span> : template<> -<span class="lineNum"> 1220 </span> : class ctype<wchar_t> : public __ctype_abstract_base<wchar_t> -<span class="lineNum"> 1221 </span> : { -<span class="lineNum"> 1222 </span> : public: -<span class="lineNum"> 1223 </span> : // Types: -<span class="lineNum"> 1224 </span> : /// Typedef for the template parameter wchar_t. -<span class="lineNum"> 1225 </span> : typedef wchar_t char_type; -<span class="lineNum"> 1226 </span> : typedef wctype_t __wmask_type; -<span class="lineNum"> 1227 </span> : -<span class="lineNum"> 1228 </span> : protected: -<span class="lineNum"> 1229 </span> : __c_locale _M_c_locale_ctype; -<span class="lineNum"> 1230 </span> : -<span class="lineNum"> 1231 </span> : // Pre-computed narrowed and widened chars. -<span class="lineNum"> 1232 </span> : bool _M_narrow_ok; -<span class="lineNum"> 1233 </span> : char _M_narrow[128]; -<span class="lineNum"> 1234 </span> : wint_t _M_widen[1 + static_cast<unsigned char>(-1)]; -<span class="lineNum"> 1235 </span> : -<span class="lineNum"> 1236 </span> : // Pre-computed elements for do_is. -<span class="lineNum"> 1237 </span> : mask _M_bit[16]; -<span class="lineNum"> 1238 </span> : __wmask_type _M_wmask[16]; -<span class="lineNum"> 1239 </span> : -<span class="lineNum"> 1240 </span> : public: -<span class="lineNum"> 1241 </span> : // Data Members: -<span class="lineNum"> 1242 </span> : /// The facet id for ctype<wchar_t> -<span class="lineNum"> 1243 </span> : static locale::id id; -<span class="lineNum"> 1244 </span> : -<span class="lineNum"> 1245 </span> : /** -<span class="lineNum"> 1246 </span> : * @brief Constructor performs initialization. -<span class="lineNum"> 1247 </span> : * -<span class="lineNum"> 1248 </span> : * This is the constructor provided by the standard. -<span class="lineNum"> 1249 </span> : * -<span class="lineNum"> 1250 </span> : * @param refs Passed to the base facet class. -<span class="lineNum"> 1251 </span> : */ -<span class="lineNum"> 1252 </span> : explicit -<span class="lineNum"> 1253 </span> : ctype(size_t __refs = 0); -<span class="lineNum"> 1254 </span> : -<span class="lineNum"> 1255 </span> : /** -<span class="lineNum"> 1256 </span> : * @brief Constructor performs static initialization. -<span class="lineNum"> 1257 </span> : * -<span class="lineNum"> 1258 </span> : * This constructor is used to construct the initial C locale facet. -<span class="lineNum"> 1259 </span> : * -<span class="lineNum"> 1260 </span> : * @param cloc Handle to C locale data. -<span class="lineNum"> 1261 </span> : * @param refs Passed to the base facet class. -<span class="lineNum"> 1262 </span> : */ -<span class="lineNum"> 1263 </span> : explicit -<span class="lineNum"> 1264 </span> : ctype(__c_locale __cloc, size_t __refs = 0); -<span class="lineNum"> 1265 </span> : -<span class="lineNum"> 1266 </span> : protected: -<span class="lineNum"> 1267 </span> : __wmask_type -<span class="lineNum"> 1268 </span> : _M_convert_to_wmask(const mask __m) const; -<span class="lineNum"> 1269 </span> : -<span class="lineNum"> 1270 </span> : /// Destructor -<span class="lineNum"> 1271 </span> : virtual -<span class="lineNum"> 1272 </span> : ~ctype(); -<span class="lineNum"> 1273 </span> : -<span class="lineNum"> 1274 </span> : /** -<span class="lineNum"> 1275 </span> : * @brief Test wchar_t classification. -<span class="lineNum"> 1276 </span> : * -<span class="lineNum"> 1277 </span> : * This function finds a mask M for @a c and compares it to mask @a m. -<span class="lineNum"> 1278 </span> : * -<span class="lineNum"> 1279 </span> : * do_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1280 </span> : * classifying. do_is() must always return the same result for the -<span class="lineNum"> 1281 </span> : * same input. -<span class="lineNum"> 1282 </span> : * -<span class="lineNum"> 1283 </span> : * @param c The wchar_t to find the mask of. -<span class="lineNum"> 1284 </span> : * @param m The mask to compare against. -<span class="lineNum"> 1285 </span> : * @return (M & m) != 0. -<span class="lineNum"> 1286 </span> : */ -<span class="lineNum"> 1287 </span> : virtual bool -<span class="lineNum"> 1288 </span> : do_is(mask __m, char_type __c) const; -<span class="lineNum"> 1289 </span> : -<span class="lineNum"> 1290 </span> : /** -<span class="lineNum"> 1291 </span> : * @brief Return a mask array. -<span class="lineNum"> 1292 </span> : * -<span class="lineNum"> 1293 </span> : * This function finds the mask for each wchar_t in the range [lo,hi) -<span class="lineNum"> 1294 </span> : * and successively writes it to vec. vec must have as many elements -<span class="lineNum"> 1295 </span> : * as the input. -<span class="lineNum"> 1296 </span> : * -<span class="lineNum"> 1297 </span> : * do_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1298 </span> : * classifying. do_is() must always return the same result for the -<span class="lineNum"> 1299 </span> : * same input. -<span class="lineNum"> 1300 </span> : * -<span class="lineNum"> 1301 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1302 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1303 </span> : * @param vec Pointer to an array of mask storage. -<span class="lineNum"> 1304 </span> : * @return @a hi. -<span class="lineNum"> 1305 </span> : */ -<span class="lineNum"> 1306 </span> : virtual const char_type* -<span class="lineNum"> 1307 </span> : do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; -<span class="lineNum"> 1308 </span> : -<span class="lineNum"> 1309 </span> : /** -<span class="lineNum"> 1310 </span> : * @brief Find wchar_t matching mask -<span class="lineNum"> 1311 </span> : * -<span class="lineNum"> 1312 </span> : * This function searches for and returns the first wchar_t c in -<span class="lineNum"> 1313 </span> : * [lo,hi) for which is(m,c) is true. -<span class="lineNum"> 1314 </span> : * -<span class="lineNum"> 1315 </span> : * do_scan_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1316 </span> : * match searching. do_is() must always return the same result for the -<span class="lineNum"> 1317 </span> : * same input. -<span class="lineNum"> 1318 </span> : * -<span class="lineNum"> 1319 </span> : * @param m The mask to compare against. -<span class="lineNum"> 1320 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1321 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1322 </span> : * @return Pointer to a matching wchar_t if found, else @a hi. -<span class="lineNum"> 1323 </span> : */ -<span class="lineNum"> 1324 </span> : virtual const char_type* -<span class="lineNum"> 1325 </span> : do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 1326 </span> : -<span class="lineNum"> 1327 </span> : /** -<span class="lineNum"> 1328 </span> : * @brief Find wchar_t not matching mask -<span class="lineNum"> 1329 </span> : * -<span class="lineNum"> 1330 </span> : * This function searches for and returns a pointer to the first -<span class="lineNum"> 1331 </span> : * wchar_t c of [lo,hi) for which is(m,c) is false. -<span class="lineNum"> 1332 </span> : * -<span class="lineNum"> 1333 </span> : * do_scan_is() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1334 </span> : * match searching. do_is() must always return the same result for the -<span class="lineNum"> 1335 </span> : * same input. -<span class="lineNum"> 1336 </span> : * -<span class="lineNum"> 1337 </span> : * @param m The mask to compare against. -<span class="lineNum"> 1338 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1339 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1340 </span> : * @return Pointer to a non-matching wchar_t if found, else @a hi. -<span class="lineNum"> 1341 </span> : */ -<span class="lineNum"> 1342 </span> : virtual const char_type* -<span class="lineNum"> 1343 </span> : do_scan_not(mask __m, const char_type* __lo, -<span class="lineNum"> 1344 </span> : const char_type* __hi) const; -<span class="lineNum"> 1345 </span> : -<span class="lineNum"> 1346 </span> : /** -<span class="lineNum"> 1347 </span> : * @brief Convert to uppercase. -<span class="lineNum"> 1348 </span> : * -<span class="lineNum"> 1349 </span> : * This virtual function converts the wchar_t argument to uppercase if -<span class="lineNum"> 1350 </span> : * possible. If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 1351 </span> : * -<span class="lineNum"> 1352 </span> : * do_toupper() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1353 </span> : * uppercasing. do_toupper() must always return the same result for -<span class="lineNum"> 1354 </span> : * the same input. -<span class="lineNum"> 1355 </span> : * -<span class="lineNum"> 1356 </span> : * @param c The wchar_t to convert. -<span class="lineNum"> 1357 </span> : * @return The uppercase wchar_t if convertible, else @a c. -<span class="lineNum"> 1358 </span> : */ -<span class="lineNum"> 1359 </span> : virtual char_type -<span class="lineNum"> 1360 </span> : do_toupper(char_type) const; -<span class="lineNum"> 1361 </span> : -<span class="lineNum"> 1362 </span> : /** -<span class="lineNum"> 1363 </span> : * @brief Convert array to uppercase. -<span class="lineNum"> 1364 </span> : * -<span class="lineNum"> 1365 </span> : * This virtual function converts each wchar_t in the range [lo,hi) to -<span class="lineNum"> 1366 </span> : * uppercase if possible. Other elements remain untouched. -<span class="lineNum"> 1367 </span> : * -<span class="lineNum"> 1368 </span> : * do_toupper() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1369 </span> : * uppercasing. do_toupper() must always return the same result for -<span class="lineNum"> 1370 </span> : * the same input. -<span class="lineNum"> 1371 </span> : * -<span class="lineNum"> 1372 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1373 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1374 </span> : * @return @a hi. -<span class="lineNum"> 1375 </span> : */ -<span class="lineNum"> 1376 </span> : virtual const char_type* -<span class="lineNum"> 1377 </span> : do_toupper(char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 1378 </span> : -<span class="lineNum"> 1379 </span> : /** -<span class="lineNum"> 1380 </span> : * @brief Convert to lowercase. -<span class="lineNum"> 1381 </span> : * -<span class="lineNum"> 1382 </span> : * This virtual function converts the argument to lowercase if -<span class="lineNum"> 1383 </span> : * possible. If not possible (for example, '2'), returns the argument. -<span class="lineNum"> 1384 </span> : * -<span class="lineNum"> 1385 </span> : * do_tolower() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1386 </span> : * lowercasing. do_tolower() must always return the same result for -<span class="lineNum"> 1387 </span> : * the same input. -<span class="lineNum"> 1388 </span> : * -<span class="lineNum"> 1389 </span> : * @param c The wchar_t to convert. -<span class="lineNum"> 1390 </span> : * @return The lowercase wchar_t if convertible, else @a c. -<span class="lineNum"> 1391 </span> : */ -<span class="lineNum"> 1392 </span> : virtual char_type -<span class="lineNum"> 1393 </span> : do_tolower(char_type) const; -<span class="lineNum"> 1394 </span> : -<span class="lineNum"> 1395 </span> : /** -<span class="lineNum"> 1396 </span> : * @brief Convert array to lowercase. -<span class="lineNum"> 1397 </span> : * -<span class="lineNum"> 1398 </span> : * This virtual function converts each wchar_t in the range [lo,hi) to -<span class="lineNum"> 1399 </span> : * lowercase if possible. Other elements remain untouched. -<span class="lineNum"> 1400 </span> : * -<span class="lineNum"> 1401 </span> : * do_tolower() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1402 </span> : * lowercasing. do_tolower() must always return the same result for -<span class="lineNum"> 1403 </span> : * the same input. -<span class="lineNum"> 1404 </span> : * -<span class="lineNum"> 1405 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1406 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1407 </span> : * @return @a hi. -<span class="lineNum"> 1408 </span> : */ -<span class="lineNum"> 1409 </span> : virtual const char_type* -<span class="lineNum"> 1410 </span> : do_tolower(char_type* __lo, const char_type* __hi) const; -<span class="lineNum"> 1411 </span> : -<span class="lineNum"> 1412 </span> : /** -<span class="lineNum"> 1413 </span> : * @brief Widen char to wchar_t -<span class="lineNum"> 1414 </span> : * -<span class="lineNum"> 1415 </span> : * This virtual function converts the char to wchar_t using the -<span class="lineNum"> 1416 </span> : * simplest reasonable transformation. For an underived ctype<wchar_t> -<span class="lineNum"> 1417 </span> : * facet, the argument will be cast to wchar_t. -<span class="lineNum"> 1418 </span> : * -<span class="lineNum"> 1419 </span> : * do_widen() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1420 </span> : * widening. do_widen() must always return the same result for the -<span class="lineNum"> 1421 </span> : * same input. -<span class="lineNum"> 1422 </span> : * -<span class="lineNum"> 1423 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1424 </span> : * codecvt for that. -<span class="lineNum"> 1425 </span> : * -<span class="lineNum"> 1426 </span> : * @param c The char to convert. -<span class="lineNum"> 1427 </span> : * @return The converted wchar_t. -<span class="lineNum"> 1428 </span> : */ -<span class="lineNum"> 1429 </span> : virtual char_type -<span class="lineNum"> 1430 </span> : do_widen(char) const; -<span class="lineNum"> 1431 </span> : -<span class="lineNum"> 1432 </span> : /** -<span class="lineNum"> 1433 </span> : * @brief Widen char array to wchar_t array -<span class="lineNum"> 1434 </span> : * -<span class="lineNum"> 1435 </span> : * This function converts each char in the input to wchar_t using the -<span class="lineNum"> 1436 </span> : * simplest reasonable transformation. For an underived ctype<wchar_t> -<span class="lineNum"> 1437 </span> : * facet, the argument will be copied, casting each element to wchar_t. -<span class="lineNum"> 1438 </span> : * -<span class="lineNum"> 1439 </span> : * do_widen() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1440 </span> : * widening. do_widen() must always return the same result for the -<span class="lineNum"> 1441 </span> : * same input. -<span class="lineNum"> 1442 </span> : * -<span class="lineNum"> 1443 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1444 </span> : * codecvt for that. -<span class="lineNum"> 1445 </span> : * -<span class="lineNum"> 1446 </span> : * @param lo Pointer to start range. -<span class="lineNum"> 1447 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1448 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 1449 </span> : * @return @a hi. -<span class="lineNum"> 1450 </span> : */ -<span class="lineNum"> 1451 </span> : virtual const char* -<span class="lineNum"> 1452 </span> : do_widen(const char* __lo, const char* __hi, char_type* __dest) const; -<span class="lineNum"> 1453 </span> : -<span class="lineNum"> 1454 </span> : /** -<span class="lineNum"> 1455 </span> : * @brief Narrow wchar_t to char -<span class="lineNum"> 1456 </span> : * -<span class="lineNum"> 1457 </span> : * This virtual function converts the argument to char using -<span class="lineNum"> 1458 </span> : * the simplest reasonable transformation. If the conversion -<span class="lineNum"> 1459 </span> : * fails, dfault is returned instead. For an underived -<span class="lineNum"> 1460 </span> : * ctype<wchar_t> facet, @a c will be cast to char and -<span class="lineNum"> 1461 </span> : * returned. -<span class="lineNum"> 1462 </span> : * -<span class="lineNum"> 1463 </span> : * do_narrow() is a hook for a derived facet to change the -<span class="lineNum"> 1464 </span> : * behavior of narrowing. do_narrow() must always return the -<span class="lineNum"> 1465 </span> : * same result for the same input. -<span class="lineNum"> 1466 </span> : * -<span class="lineNum"> 1467 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1468 </span> : * codecvt for that. -<span class="lineNum"> 1469 </span> : * -<span class="lineNum"> 1470 </span> : * @param c The wchar_t to convert. -<span class="lineNum"> 1471 </span> : * @param dfault Char to return if conversion fails. -<span class="lineNum"> 1472 </span> : * @return The converted char. -<span class="lineNum"> 1473 </span> : */ -<span class="lineNum"> 1474 </span> : virtual char -<span class="lineNum"> 1475 </span> : do_narrow(char_type, char __dfault) const; -<span class="lineNum"> 1476 </span> : -<span class="lineNum"> 1477 </span> : /** -<span class="lineNum"> 1478 </span> : * @brief Narrow wchar_t array to char array -<span class="lineNum"> 1479 </span> : * -<span class="lineNum"> 1480 </span> : * This virtual function converts each wchar_t in the range [lo,hi) to -<span class="lineNum"> 1481 </span> : * char using the simplest reasonable transformation and writes the -<span class="lineNum"> 1482 </span> : * results to the destination array. For any wchar_t in the input that -<span class="lineNum"> 1483 </span> : * cannot be converted, @a dfault is used instead. For an underived -<span class="lineNum"> 1484 </span> : * ctype<wchar_t> facet, the argument will be copied, casting each -<span class="lineNum"> 1485 </span> : * element to char. -<span class="lineNum"> 1486 </span> : * -<span class="lineNum"> 1487 </span> : * do_narrow() is a hook for a derived facet to change the behavior of -<span class="lineNum"> 1488 </span> : * narrowing. do_narrow() must always return the same result for the -<span class="lineNum"> 1489 </span> : * same input. -<span class="lineNum"> 1490 </span> : * -<span class="lineNum"> 1491 </span> : * Note: this is not what you want for codepage conversions. See -<span class="lineNum"> 1492 </span> : * codecvt for that. -<span class="lineNum"> 1493 </span> : * -<span class="lineNum"> 1494 </span> : * @param lo Pointer to start of range. -<span class="lineNum"> 1495 </span> : * @param hi Pointer to end of range. -<span class="lineNum"> 1496 </span> : * @param dfault Char to use if conversion fails. -<span class="lineNum"> 1497 </span> : * @param to Pointer to the destination array. -<span class="lineNum"> 1498 </span> : * @return @a hi. -<span class="lineNum"> 1499 </span> : */ -<span class="lineNum"> 1500 </span> : virtual const char_type* -<span class="lineNum"> 1501 </span> : do_narrow(const char_type* __lo, const char_type* __hi, -<span class="lineNum"> 1502 </span> : char __dfault, char* __dest) const; -<span class="lineNum"> 1503 </span> : -<span class="lineNum"> 1504 </span> : // For use at construction time only. -<span class="lineNum"> 1505 </span> : void -<span class="lineNum"> 1506 </span> : _M_initialize_ctype(); -<span class="lineNum"> 1507 </span> : }; -<span class="lineNum"> 1508 </span> : -<span class="lineNum"> 1509 </span> : template<> -<span class="lineNum"> 1510 </span> : const ctype<wchar_t>& -<span class="lineNum"> 1511 </span> : use_facet<ctype<wchar_t> >(const locale& __loc); -<span class="lineNum"> 1512 </span> : #endif //_GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 1513 </span> : -<span class="lineNum"> 1514 </span> : /// class ctype_byname [22.2.1.2]. -<span class="lineNum"> 1515 </span> : template<typename _CharT> -<span class="lineNum"> 1516 </span> : class ctype_byname : public ctype<_CharT> -<span class="lineNum"> 1517 </span> : { -<span class="lineNum"> 1518 </span> : public: -<span class="lineNum"> 1519 </span> : typedef typename ctype<_CharT>::mask mask; -<span class="lineNum"> 1520 </span> : -<span class="lineNum"> 1521 </span> : explicit -<span class="lineNum"> 1522 </span> : ctype_byname(const char* __s, size_t __refs = 0); -<span class="lineNum"> 1523 </span> : -<span class="lineNum"> 1524 </span> : protected: -<span class="lineNum"> 1525 </span> : virtual -<span class="lineNum"> 1526 </span> : ~ctype_byname() { }; -<span class="lineNum"> 1527 </span> : }; -<span class="lineNum"> 1528 </span> : -<span class="lineNum"> 1529 </span> : /// 22.2.1.4 Class ctype_byname specializations. -<span class="lineNum"> 1530 </span> : template<> -<span class="lineNum"> 1531 </span> : class ctype_byname<char> : public ctype<char> -<span class="lineNum"> 1532 </span> : { -<span class="lineNum"> 1533 </span> : public: -<span class="lineNum"> 1534 </span> : explicit -<span class="lineNum"> 1535 </span> : ctype_byname(const char* __s, size_t __refs = 0); -<span class="lineNum"> 1536 </span> : -<span class="lineNum"> 1537 </span> : protected: -<span class="lineNum"> 1538 </span> : virtual -<span class="lineNum"> 1539 </span> : ~ctype_byname(); -<span class="lineNum"> 1540 </span> : }; -<span class="lineNum"> 1541 </span> : -<span class="lineNum"> 1542 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 1543 </span> : template<> -<span class="lineNum"> 1544 </span> : class ctype_byname<wchar_t> : public ctype<wchar_t> -<span class="lineNum"> 1545 </span> : { -<span class="lineNum"> 1546 </span> : public: -<span class="lineNum"> 1547 </span> : explicit -<span class="lineNum"> 1548 </span> : ctype_byname(const char* __s, size_t __refs = 0); -<span class="lineNum"> 1549 </span> : -<span class="lineNum"> 1550 </span> : protected: -<span class="lineNum"> 1551 </span> : virtual -<span class="lineNum"> 1552 </span> : ~ctype_byname(); -<span class="lineNum"> 1553 </span> : }; -<span class="lineNum"> 1554 </span> : #endif -<span class="lineNum"> 1555 </span> : -<span class="lineNum"> 1556 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 1557 </span> : -<span class="lineNum"> 1558 </span> : // Include host and configuration specific ctype inlines. -<span class="lineNum"> 1559 </span> : #include <bits/ctype_inline.h> -<span class="lineNum"> 1560 </span> : -<span class="lineNum"> 1561 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 1562 </span> : -<span class="lineNum"> 1563 </span> : // 22.2.2 The numeric category. -<span class="lineNum"> 1564 </span> : class __num_base -<span class="lineNum"> 1565 </span> : { -<span class="lineNum"> 1566 </span> : public: -<span class="lineNum"> 1567 </span> : // NB: Code depends on the order of _S_atoms_out elements. -<span class="lineNum"> 1568 </span> : // Below are the indices into _S_atoms_out. -<span class="lineNum"> 1569 </span> : enum -<span class="lineNum"> 1570 </span> : { -<span class="lineNum"> 1571 </span> : _S_ominus, -<span class="lineNum"> 1572 </span> : _S_oplus, -<span class="lineNum"> 1573 </span> : _S_ox, -<span class="lineNum"> 1574 </span> : _S_oX, -<span class="lineNum"> 1575 </span> : _S_odigits, -<span class="lineNum"> 1576 </span> : _S_odigits_end = _S_odigits + 16, -<span class="lineNum"> 1577 </span> : _S_oudigits = _S_odigits_end, -<span class="lineNum"> 1578 </span> : _S_oudigits_end = _S_oudigits + 16, -<span class="lineNum"> 1579 </span> : _S_oe = _S_odigits + 14, // For scientific notation, 'e' -<span class="lineNum"> 1580 </span> : _S_oE = _S_oudigits + 14, // For scientific notation, 'E' -<span class="lineNum"> 1581 </span> : _S_oend = _S_oudigits_end -<span class="lineNum"> 1582 </span> : }; -<span class="lineNum"> 1583 </span> : -<span class="lineNum"> 1584 </span> : // A list of valid numeric literals for output. This array -<span class="lineNum"> 1585 </span> : // contains chars that will be passed through the current locale's -<span class="lineNum"> 1586 </span> : // ctype<_CharT>.widen() and then used to render numbers. -<span class="lineNum"> 1587 </span> : // For the standard "C" locale, this is -<span class="lineNum"> 1588 </span> : // "-+xX0123456789abcdef0123456789ABCDEF". -<span class="lineNum"> 1589 </span> : static const char* _S_atoms_out; -<span class="lineNum"> 1590 </span> : -<span class="lineNum"> 1591 </span> : // String literal of acceptable (narrow) input, for num_get. -<span class="lineNum"> 1592 </span> : // "-+xX0123456789abcdefABCDEF" -<span class="lineNum"> 1593 </span> : static const char* _S_atoms_in; -<span class="lineNum"> 1594 </span> : -<span class="lineNum"> 1595 </span> : enum -<span class="lineNum"> 1596 </span> : { -<span class="lineNum"> 1597 </span> : _S_iminus, -<span class="lineNum"> 1598 </span> : _S_iplus, -<span class="lineNum"> 1599 </span> : _S_ix, -<span class="lineNum"> 1600 </span> : _S_iX, -<span class="lineNum"> 1601 </span> : _S_izero, -<span class="lineNum"> 1602 </span> : _S_ie = _S_izero + 14, -<span class="lineNum"> 1603 </span> : _S_iE = _S_izero + 20, -<span class="lineNum"> 1604 </span> : _S_iend = 26 -<span class="lineNum"> 1605 </span> : }; -<span class="lineNum"> 1606 </span> : -<span class="lineNum"> 1607 </span> : // num_put -<span class="lineNum"> 1608 </span> : // Construct and return valid scanf format for floating point types. -<span class="lineNum"> 1609 </span> : static void -<span class="lineNum"> 1610 </span> : _S_format_float(const ios_base& __io, char* __fptr, char __mod); -<span class="lineNum"> 1611 </span> : }; -<span class="lineNum"> 1612 </span> : -<span class="lineNum"> 1613 </span> : template<typename _CharT> -<span class="lineNum"> 1614 </span> : struct __numpunct_cache : public locale::facet -<span class="lineNum"> 1615 </span> : { -<span class="lineNum"> 1616 </span> : const char* _M_grouping; -<span class="lineNum"> 1617 </span> : size_t _M_grouping_size; -<span class="lineNum"> 1618 </span> : bool _M_use_grouping; -<span class="lineNum"> 1619 </span> : const _CharT* _M_truename; -<span class="lineNum"> 1620 </span> : size_t _M_truename_size; -<span class="lineNum"> 1621 </span> : const _CharT* _M_falsename; -<span class="lineNum"> 1622 </span> : size_t _M_falsename_size; -<span class="lineNum"> 1623 </span> : _CharT _M_decimal_point; -<span class="lineNum"> 1624 </span> : _CharT _M_thousands_sep; -<span class="lineNum"> 1625 </span> : -<span class="lineNum"> 1626 </span> : // A list of valid numeric literals for output: in the standard -<span class="lineNum"> 1627 </span> : // "C" locale, this is "-+xX0123456789abcdef0123456789ABCDEF". -<span class="lineNum"> 1628 </span> : // This array contains the chars after having been passed -<span class="lineNum"> 1629 </span> : // through the current locale's ctype<_CharT>.widen(). -<span class="lineNum"> 1630 </span> : _CharT _M_atoms_out[__num_base::_S_oend]; -<span class="lineNum"> 1631 </span> : -<span class="lineNum"> 1632 </span> : // A list of valid numeric literals for input: in the standard -<span class="lineNum"> 1633 </span> : // "C" locale, this is "-+xX0123456789abcdefABCDEF" -<span class="lineNum"> 1634 </span> : // This array contains the chars after having been passed -<span class="lineNum"> 1635 </span> : // through the current locale's ctype<_CharT>.widen(). -<span class="lineNum"> 1636 </span> : _CharT _M_atoms_in[__num_base::_S_iend]; -<span class="lineNum"> 1637 </span> : -<span class="lineNum"> 1638 </span> : bool _M_allocated; -<span class="lineNum"> 1639 </span> : -<span class="lineNum"> 1640 </span> : __numpunct_cache(size_t __refs = 0) : facet(__refs), -<span class="lineNum"> 1641 </span> : _M_grouping(NULL), _M_grouping_size(0), _M_use_grouping(false), -<span class="lineNum"> 1642 </span> : _M_truename(NULL), _M_truename_size(0), _M_falsename(NULL), -<span class="lineNum"> 1643 </span> : _M_falsename_size(0), _M_decimal_point(_CharT()), -<span class="lineNum"> 1644 </span> : _M_thousands_sep(_CharT()), _M_allocated(false) -<span class="lineNum"> 1645 </span> : { } -<span class="lineNum"> 1646 </span> : -<span class="lineNum"> 1647 </span> : ~__numpunct_cache(); -<span class="lineNum"> 1648 </span> : -<span class="lineNum"> 1649 </span> : void -<span class="lineNum"> 1650 </span> : _M_cache(const locale& __loc); -<span class="lineNum"> 1651 </span> : -<span class="lineNum"> 1652 </span> : private: -<span class="lineNum"> 1653 </span> : __numpunct_cache& -<span class="lineNum"> 1654 </span> : operator=(const __numpunct_cache&); -<span class="lineNum"> 1655 </span> : -<span class="lineNum"> 1656 </span> : explicit -<span class="lineNum"> 1657 </span> : __numpunct_cache(const __numpunct_cache&); -<span class="lineNum"> 1658 </span> : }; -<span class="lineNum"> 1659 </span> : -<span class="lineNum"> 1660 </span> : template<typename _CharT> -<span class="lineNum"> 1661 </span> : __numpunct_cache<_CharT>::~__numpunct_cache() -<span class="lineNum"> 1662 </span> : { -<span class="lineNum"> 1663 </span> : if (_M_allocated) -<span class="lineNum"> 1664 </span> : { -<span class="lineNum"> 1665 </span> : delete [] _M_grouping; -<span class="lineNum"> 1666 </span> : delete [] _M_truename; -<span class="lineNum"> 1667 </span> : delete [] _M_falsename; -<span class="lineNum"> 1668 </span> : } -<span class="lineNum"> 1669 </span> : } -<span class="lineNum"> 1670 </span> : -<span class="lineNum"> 1671 </span> : /** -<span class="lineNum"> 1672 </span> : * @brief Numpunct facet. -<span class="lineNum"> 1673 </span> : * -<span class="lineNum"> 1674 </span> : * This facet stores several pieces of information related to printing and -<span class="lineNum"> 1675 </span> : * scanning numbers, such as the decimal point character. It takes a -<span class="lineNum"> 1676 </span> : * template parameter specifying the char type. The numpunct facet is -<span class="lineNum"> 1677 </span> : * used by streams for many I/O operations involving numbers. -<span class="lineNum"> 1678 </span> : * -<span class="lineNum"> 1679 </span> : * The numpunct template uses protected virtual functions to provide the -<span class="lineNum"> 1680 </span> : * actual results. The public accessors forward the call to the virtual -<span class="lineNum"> 1681 </span> : * functions. These virtual functions are hooks for developers to -<span class="lineNum"> 1682 </span> : * implement the behavior they require from a numpunct facet. -<span class="lineNum"> 1683 </span> : */ -<span class="lineNum"> 1684 </span> : template<typename _CharT> -<span class="lineNum"> 1685 </span> : class numpunct : public locale::facet -<span class="lineNum"> 1686 </span> : { -<span class="lineNum"> 1687 </span> : public: -<span class="lineNum"> 1688 </span> : // Types: -<span class="lineNum"> 1689 </span> : //@{ -<span class="lineNum"> 1690 </span> : /// Public typedefs -<span class="lineNum"> 1691 </span> : typedef _CharT char_type; -<span class="lineNum"> 1692 </span> : typedef basic_string<_CharT> string_type; -<span class="lineNum"> 1693 </span> : //@} -<span class="lineNum"> 1694 </span> : typedef __numpunct_cache<_CharT> __cache_type; -<span class="lineNum"> 1695 </span> : -<span class="lineNum"> 1696 </span> : protected: -<span class="lineNum"> 1697 </span> : __cache_type* _M_data; -<span class="lineNum"> 1698 </span> : -<span class="lineNum"> 1699 </span> : public: -<span class="lineNum"> 1700 </span> : /// Numpunct facet id. -<span class="lineNum"> 1701 </span> : static locale::id id; -<span class="lineNum"> 1702 </span> : -<span class="lineNum"> 1703 </span> : /** -<span class="lineNum"> 1704 </span> : * @brief Numpunct constructor. -<span class="lineNum"> 1705 </span> : * -<span class="lineNum"> 1706 </span> : * @param refs Refcount to pass to the base class. -<span class="lineNum"> 1707 </span> : */ -<span class="lineNum"> 1708 </span> : explicit -<span class="lineNum"> 1709 </span> : numpunct(size_t __refs = 0) : facet(__refs), _M_data(NULL) -<span class="lineNum"> 1710 </span> : { _M_initialize_numpunct(); } -<span class="lineNum"> 1711 </span> : -<span class="lineNum"> 1712 </span> : /** -<span class="lineNum"> 1713 </span> : * @brief Internal constructor. Not for general use. -<span class="lineNum"> 1714 </span> : * -<span class="lineNum"> 1715 </span> : * This is a constructor for use by the library itself to set up the -<span class="lineNum"> 1716 </span> : * predefined locale facets. -<span class="lineNum"> 1717 </span> : * -<span class="lineNum"> 1718 </span> : * @param cache __numpunct_cache object. -<span class="lineNum"> 1719 </span> : * @param refs Refcount to pass to the base class. -<span class="lineNum"> 1720 </span> : */ -<span class="lineNum"> 1721 </span> : explicit -<span class="lineNum"> 1722 </span> : numpunct(__cache_type* __cache, size_t __refs = 0) -<span class="lineNum"> 1723 </span> : : facet(__refs), _M_data(__cache) -<span class="lineNum"> 1724 </span> : { _M_initialize_numpunct(); } -<span class="lineNum"> 1725 </span> : -<span class="lineNum"> 1726 </span> : /** -<span class="lineNum"> 1727 </span> : * @brief Internal constructor. Not for general use. -<span class="lineNum"> 1728 </span> : * -<span class="lineNum"> 1729 </span> : * This is a constructor for use by the library itself to set up new -<span class="lineNum"> 1730 </span> : * locales. -<span class="lineNum"> 1731 </span> : * -<span class="lineNum"> 1732 </span> : * @param cloc The "C" locale. -<span class="lineNum"> 1733 </span> : * @param refs Refcount to pass to the base class. -<span class="lineNum"> 1734 </span> : */ -<span class="lineNum"> 1735 </span> : explicit -<span class="lineNum"> 1736 </span> : numpunct(__c_locale __cloc, size_t __refs = 0) -<span class="lineNum"> 1737 </span> : : facet(__refs), _M_data(NULL) -<span class="lineNum"> 1738 </span> : { _M_initialize_numpunct(__cloc); } -<span class="lineNum"> 1739 </span> : -<span class="lineNum"> 1740 </span> : /** -<span class="lineNum"> 1741 </span> : * @brief Return decimal point character. -<span class="lineNum"> 1742 </span> : * -<span class="lineNum"> 1743 </span> : * This function returns a char_type to use as a decimal point. It -<span class="lineNum"> 1744 </span> : * does so by returning returning -<span class="lineNum"> 1745 </span> : * numpunct<char_type>::do_decimal_point(). -<span class="lineNum"> 1746 </span> : * -<span class="lineNum"> 1747 </span> : * @return @a char_type representing a decimal point. -<span class="lineNum"> 1748 </span> : */ -<span class="lineNum"> 1749 </span> : char_type -<span class="lineNum"> 1750 </span> : decimal_point() const -<span class="lineNum"> 1751 </span> : { return this->do_decimal_point(); } -<span class="lineNum"> 1752 </span> : -<span class="lineNum"> 1753 </span> : /** -<span class="lineNum"> 1754 </span> : * @brief Return thousands separator character. -<span class="lineNum"> 1755 </span> : * -<span class="lineNum"> 1756 </span> : * This function returns a char_type to use as a thousands -<span class="lineNum"> 1757 </span> : * separator. It does so by returning returning -<span class="lineNum"> 1758 </span> : * numpunct<char_type>::do_thousands_sep(). -<span class="lineNum"> 1759 </span> : * -<span class="lineNum"> 1760 </span> : * @return char_type representing a thousands separator. -<span class="lineNum"> 1761 </span> : */ -<span class="lineNum"> 1762 </span> : char_type -<span class="lineNum"> 1763 </span> : thousands_sep() const -<span class="lineNum"> 1764 </span> : { return this->do_thousands_sep(); } -<span class="lineNum"> 1765 </span> : -<span class="lineNum"> 1766 </span> : /** -<span class="lineNum"> 1767 </span> : * @brief Return grouping specification. -<span class="lineNum"> 1768 </span> : * -<span class="lineNum"> 1769 </span> : * This function returns a string representing groupings for the -<span class="lineNum"> 1770 </span> : * integer part of a number. Groupings indicate where thousands -<span class="lineNum"> 1771 </span> : * separators should be inserted in the integer part of a number. -<span class="lineNum"> 1772 </span> : * -<span class="lineNum"> 1773 </span> : * Each char in the return string is interpret as an integer -<span class="lineNum"> 1774 </span> : * rather than a character. These numbers represent the number -<span class="lineNum"> 1775 </span> : * of digits in a group. The first char in the string -<span class="lineNum"> 1776 </span> : * represents the number of digits in the least significant -<span class="lineNum"> 1777 </span> : * group. If a char is negative, it indicates an unlimited -<span class="lineNum"> 1778 </span> : * number of digits for the group. If more chars from the -<span class="lineNum"> 1779 </span> : * string are required to group a number, the last char is used -<span class="lineNum"> 1780 </span> : * repeatedly. -<span class="lineNum"> 1781 </span> : * -<span class="lineNum"> 1782 </span> : * For example, if the grouping() returns "\003\002" and is -<span class="lineNum"> 1783 </span> : * applied to the number 123456789, this corresponds to -<span class="lineNum"> 1784 </span> : * 12,34,56,789. Note that if the string was "32", this would -<span class="lineNum"> 1785 </span> : * put more than 50 digits into the least significant group if -<span class="lineNum"> 1786 </span> : * the character set is ASCII. -<span class="lineNum"> 1787 </span> : * -<span class="lineNum"> 1788 </span> : * The string is returned by calling -<span class="lineNum"> 1789 </span> : * numpunct<char_type>::do_grouping(). -<span class="lineNum"> 1790 </span> : * -<span class="lineNum"> 1791 </span> : * @return string representing grouping specification. -<span class="lineNum"> 1792 </span> : */ -<span class="lineNum"> 1793 </span> : string -<span class="lineNum"> 1794 </span> : grouping() const -<span class="lineNum"> 1795 </span> : { return this->do_grouping(); } -<span class="lineNum"> 1796 </span> : -<span class="lineNum"> 1797 </span> : /** -<span class="lineNum"> 1798 </span> : * @brief Return string representation of bool true. -<span class="lineNum"> 1799 </span> : * -<span class="lineNum"> 1800 </span> : * This function returns a string_type containing the text -<span class="lineNum"> 1801 </span> : * representation for true bool variables. It does so by calling -<span class="lineNum"> 1802 </span> : * numpunct<char_type>::do_truename(). -<span class="lineNum"> 1803 </span> : * -<span class="lineNum"> 1804 </span> : * @return string_type representing printed form of true. -<span class="lineNum"> 1805 </span> : */ -<span class="lineNum"> 1806 </span> : string_type -<span class="lineNum"> 1807 </span> : truename() const -<span class="lineNum"> 1808 </span> : { return this->do_truename(); } -<span class="lineNum"> 1809 </span> : -<span class="lineNum"> 1810 </span> : /** -<span class="lineNum"> 1811 </span> : * @brief Return string representation of bool false. -<span class="lineNum"> 1812 </span> : * -<span class="lineNum"> 1813 </span> : * This function returns a string_type containing the text -<span class="lineNum"> 1814 </span> : * representation for false bool variables. It does so by calling -<span class="lineNum"> 1815 </span> : * numpunct<char_type>::do_falsename(). -<span class="lineNum"> 1816 </span> : * -<span class="lineNum"> 1817 </span> : * @return string_type representing printed form of false. -<span class="lineNum"> 1818 </span> : */ -<span class="lineNum"> 1819 </span> : string_type -<span class="lineNum"> 1820 </span> : falsename() const -<span class="lineNum"> 1821 </span> : { return this->do_falsename(); } -<span class="lineNum"> 1822 </span> : -<span class="lineNum"> 1823 </span> : protected: -<span class="lineNum"> 1824 </span> : /// Destructor. -<span class="lineNum"> 1825 </span> : virtual -<span class="lineNum"> 1826 </span> : ~numpunct(); -<span class="lineNum"> 1827 </span> : -<span class="lineNum"> 1828 </span> : /** -<span class="lineNum"> 1829 </span> : * @brief Return decimal point character. -<span class="lineNum"> 1830 </span> : * -<span class="lineNum"> 1831 </span> : * Returns a char_type to use as a decimal point. This function is a -<span class="lineNum"> 1832 </span> : * hook for derived classes to change the value returned. -<span class="lineNum"> 1833 </span> : * -<span class="lineNum"> 1834 </span> : * @return @a char_type representing a decimal point. -<span class="lineNum"> 1835 </span> : */ -<span class="lineNum"> 1836 </span> : virtual char_type -<span class="lineNum"> 1837 </span> : do_decimal_point() const -<span class="lineNum"> 1838 </span> : { return _M_data->_M_decimal_point; } -<span class="lineNum"> 1839 </span> : -<span class="lineNum"> 1840 </span> : /** -<span class="lineNum"> 1841 </span> : * @brief Return thousands separator character. -<span class="lineNum"> 1842 </span> : * -<span class="lineNum"> 1843 </span> : * Returns a char_type to use as a thousands separator. This function -<span class="lineNum"> 1844 </span> : * is a hook for derived classes to change the value returned. -<span class="lineNum"> 1845 </span> : * -<span class="lineNum"> 1846 </span> : * @return @a char_type representing a thousands separator. -<span class="lineNum"> 1847 </span> : */ -<span class="lineNum"> 1848 </span> : virtual char_type -<span class="lineNum"> 1849 </span> : do_thousands_sep() const -<span class="lineNum"> 1850 </span> : { return _M_data->_M_thousands_sep; } -<span class="lineNum"> 1851 </span> : -<span class="lineNum"> 1852 </span> : /** -<span class="lineNum"> 1853 </span> : * @brief Return grouping specification. -<span class="lineNum"> 1854 </span> : * -<span class="lineNum"> 1855 </span> : * Returns a string representing groupings for the integer part of a -<span class="lineNum"> 1856 </span> : * number. This function is a hook for derived classes to change the -<span class="lineNum"> 1857 </span> : * value returned. @see grouping() for details. -<span class="lineNum"> 1858 </span> : * -<span class="lineNum"> 1859 </span> : * @return String representing grouping specification. -<span class="lineNum"> 1860 </span> : */ -<span class="lineNum"> 1861 </span> : virtual string -<span class="lineNum"> 1862 </span> : do_grouping() const -<span class="lineNum"> 1863 </span> : { return _M_data->_M_grouping; } -<span class="lineNum"> 1864 </span> : -<span class="lineNum"> 1865 </span> : /** -<span class="lineNum"> 1866 </span> : * @brief Return string representation of bool true. -<span class="lineNum"> 1867 </span> : * -<span class="lineNum"> 1868 </span> : * Returns a string_type containing the text representation for true -<span class="lineNum"> 1869 </span> : * bool variables. This function is a hook for derived classes to -<span class="lineNum"> 1870 </span> : * change the value returned. -<span class="lineNum"> 1871 </span> : * -<span class="lineNum"> 1872 </span> : * @return string_type representing printed form of true. -<span class="lineNum"> 1873 </span> : */ -<span class="lineNum"> 1874 </span> : virtual string_type -<span class="lineNum"> 1875 </span> : do_truename() const -<span class="lineNum"> 1876 </span> : { return _M_data->_M_truename; } -<span class="lineNum"> 1877 </span> : -<span class="lineNum"> 1878 </span> : /** -<span class="lineNum"> 1879 </span> : * @brief Return string representation of bool false. -<span class="lineNum"> 1880 </span> : * -<span class="lineNum"> 1881 </span> : * Returns a string_type containing the text representation for false -<span class="lineNum"> 1882 </span> : * bool variables. This function is a hook for derived classes to -<span class="lineNum"> 1883 </span> : * change the value returned. -<span class="lineNum"> 1884 </span> : * -<span class="lineNum"> 1885 </span> : * @return string_type representing printed form of false. -<span class="lineNum"> 1886 </span> : */ -<span class="lineNum"> 1887 </span> : virtual string_type -<span class="lineNum"> 1888 </span> : do_falsename() const -<span class="lineNum"> 1889 </span> : { return _M_data->_M_falsename; } -<span class="lineNum"> 1890 </span> : -<span class="lineNum"> 1891 </span> : // For use at construction time only. -<span class="lineNum"> 1892 </span> : void -<span class="lineNum"> 1893 </span> : _M_initialize_numpunct(__c_locale __cloc = NULL); -<span class="lineNum"> 1894 </span> : }; -<span class="lineNum"> 1895 </span> : -<span class="lineNum"> 1896 </span> : template<typename _CharT> -<span class="lineNum"> 1897 </span> : locale::id numpunct<_CharT>::id; -<span class="lineNum"> 1898 </span> : -<span class="lineNum"> 1899 </span> : template<> -<span class="lineNum"> 1900 </span> : numpunct<char>::~numpunct(); -<span class="lineNum"> 1901 </span> : -<span class="lineNum"> 1902 </span> : template<> -<span class="lineNum"> 1903 </span> : void -<span class="lineNum"> 1904 </span> : numpunct<char>::_M_initialize_numpunct(__c_locale __cloc); -<span class="lineNum"> 1905 </span> : -<span class="lineNum"> 1906 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 1907 </span> : template<> -<span class="lineNum"> 1908 </span> : numpunct<wchar_t>::~numpunct(); -<span class="lineNum"> 1909 </span> : -<span class="lineNum"> 1910 </span> : template<> -<span class="lineNum"> 1911 </span> : void -<span class="lineNum"> 1912 </span> : numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc); -<span class="lineNum"> 1913 </span> : #endif -<span class="lineNum"> 1914 </span> : -<span class="lineNum"> 1915 </span> : /// class numpunct_byname [22.2.3.2]. -<span class="lineNum"> 1916 </span> : template<typename _CharT> -<span class="lineNum"> 1917 </span> : class numpunct_byname : public numpunct<_CharT> -<span class="lineNum"> 1918 </span> : { -<span class="lineNum"> 1919 </span> : public: -<span class="lineNum"> 1920 </span> : typedef _CharT char_type; -<span class="lineNum"> 1921 </span> : typedef basic_string<_CharT> string_type; -<span class="lineNum"> 1922 </span> : -<span class="lineNum"> 1923 </span> : explicit -<span class="lineNum"> 1924 </span> : numpunct_byname(const char* __s, size_t __refs = 0) -<span class="lineNum"> 1925 </span> : : numpunct<_CharT>(__refs) -<span class="lineNum"> 1926 </span> : { -<span class="lineNum"> 1927 </span> : if (__builtin_strcmp(__s, "C") != 0 -<span class="lineNum"> 1928 </span> : && __builtin_strcmp(__s, "POSIX") != 0) -<span class="lineNum"> 1929 </span> : { -<span class="lineNum"> 1930 </span> : __c_locale __tmp; -<span class="lineNum"> 1931 </span> : this->_S_create_c_locale(__tmp, __s); -<span class="lineNum"> 1932 </span> : this->_M_initialize_numpunct(__tmp); -<span class="lineNum"> 1933 </span> : this->_S_destroy_c_locale(__tmp); -<span class="lineNum"> 1934 </span> : } -<span class="lineNum"> 1935 </span> : } -<span class="lineNum"> 1936 </span> : -<span class="lineNum"> 1937 </span> : protected: -<span class="lineNum"> 1938 </span> : virtual -<span class="lineNum"> 1939 </span> : ~numpunct_byname() { } -<span class="lineNum"> 1940 </span> : }; -<span class="lineNum"> 1941 </span> : -<span class="lineNum"> 1942 </span> : _GLIBCXX_BEGIN_LDBL_NAMESPACE -<span class="lineNum"> 1943 </span> : -<span class="lineNum"> 1944 </span> : /** -<span class="lineNum"> 1945 </span> : * @brief Facet for parsing number strings. -<span class="lineNum"> 1946 </span> : * -<span class="lineNum"> 1947 </span> : * This facet encapsulates the code to parse and return a number -<span class="lineNum"> 1948 </span> : * from a string. It is used by the istream numeric extraction -<span class="lineNum"> 1949 </span> : * operators. -<span class="lineNum"> 1950 </span> : * -<span class="lineNum"> 1951 </span> : * The num_get template uses protected virtual functions to provide the -<span class="lineNum"> 1952 </span> : * actual results. The public accessors forward the call to the virtual -<span class="lineNum"> 1953 </span> : * functions. These virtual functions are hooks for developers to -<span class="lineNum"> 1954 </span> : * implement the behavior they require from the num_get facet. -<span class="lineNum"> 1955 </span> : */ -<span class="lineNum"> 1956 </span> : template<typename _CharT, typename _InIter> -<span class="lineNum"> 1957 </span> : class num_get : public locale::facet -<span class="lineNum"> 1958 </span> : { -<span class="lineNum"> 1959 </span> : public: -<span class="lineNum"> 1960 </span> : // Types: -<span class="lineNum"> 1961 </span> : //@{ -<span class="lineNum"> 1962 </span> : /// Public typedefs -<span class="lineNum"> 1963 </span> : typedef _CharT char_type; -<span class="lineNum"> 1964 </span> : typedef _InIter iter_type; -<span class="lineNum"> 1965 </span> : //@} -<span class="lineNum"> 1966 </span> : -<span class="lineNum"> 1967 </span> : /// Numpunct facet id. -<span class="lineNum"> 1968 </span> : static locale::id id; -<span class="lineNum"> 1969 </span> : -<span class="lineNum"> 1970 </span> : /** -<span class="lineNum"> 1971 </span> : * @brief Constructor performs initialization. -<span class="lineNum"> 1972 </span> : * -<span class="lineNum"> 1973 </span> : * This is the constructor provided by the standard. -<span class="lineNum"> 1974 </span> : * -<span class="lineNum"> 1975 </span> : * @param refs Passed to the base facet class. -<span class="lineNum"> 1976 </span> : */ -<span class="lineNum"> 1977 </span> : explicit -<span class="lineNum"> 1978 </span> : num_get(size_t __refs = 0) : facet(__refs) { } -<span class="lineNum"> 1979 </span> : -<span class="lineNum"> 1980 </span> : /** -<span class="lineNum"> 1981 </span> : * @brief Numeric parsing. -<span class="lineNum"> 1982 </span> : * -<span class="lineNum"> 1983 </span> : * Parses the input stream into the bool @a v. It does so by calling -<span class="lineNum"> 1984 </span> : * num_get::do_get(). -<span class="lineNum"> 1985 </span> : * -<span class="lineNum"> 1986 </span> : * If ios_base::boolalpha is set, attempts to read -<span class="lineNum"> 1987 </span> : * ctype<CharT>::truename() or ctype<CharT>::falsename(). Sets -<span class="lineNum"> 1988 </span> : * @a v to true or false if successful. Sets err to -<span class="lineNum"> 1989 </span> : * ios_base::failbit if reading the string fails. Sets err to -<span class="lineNum"> 1990 </span> : * ios_base::eofbit if the stream is emptied. -<span class="lineNum"> 1991 </span> : * -<span class="lineNum"> 1992 </span> : * If ios_base::boolalpha is not set, proceeds as with reading a long, -<span class="lineNum"> 1993 </span> : * except if the value is 1, sets @a v to true, if the value is 0, sets -<span class="lineNum"> 1994 </span> : * @a v to false, and otherwise set err to ios_base::failbit. -<span class="lineNum"> 1995 </span> : * -<span class="lineNum"> 1996 </span> : * @param in Start of input stream. -<span class="lineNum"> 1997 </span> : * @param end End of input stream. -<span class="lineNum"> 1998 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 1999 </span> : * @param err Error flags to set. -<span class="lineNum"> 2000 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2001 </span> : * @return Iterator after reading. -<span class="lineNum"> 2002 </span> : */ -<span class="lineNum"> 2003 </span> : iter_type -<span class="lineNum"> 2004 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2005 </span> : ios_base::iostate& __err, bool& __v) const -<span class="lineNum"> 2006 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2007 </span> : -<span class="lineNum"> 2008 </span> : //@{ -<span class="lineNum"> 2009 </span> : /** -<span class="lineNum"> 2010 </span> : * @brief Numeric parsing. -<span class="lineNum"> 2011 </span> : * -<span class="lineNum"> 2012 </span> : * Parses the input stream into the integral variable @a v. It does so -<span class="lineNum"> 2013 </span> : * by calling num_get::do_get(). -<span class="lineNum"> 2014 </span> : * -<span class="lineNum"> 2015 </span> : * Parsing is affected by the flag settings in @a io. -<span class="lineNum"> 2016 </span> : * -<span class="lineNum"> 2017 </span> : * The basic parse is affected by the value of io.flags() & -<span class="lineNum"> 2018 </span> : * ios_base::basefield. If equal to ios_base::oct, parses like the -<span class="lineNum"> 2019 </span> : * scanf %o specifier. Else if equal to ios_base::hex, parses like %X -<span class="lineNum"> 2020 </span> : * specifier. Else if basefield equal to 0, parses like the %i -<span class="lineNum"> 2021 </span> : * specifier. Otherwise, parses like %d for signed and %u for unsigned -<span class="lineNum"> 2022 </span> : * types. The matching type length modifier is also used. -<span class="lineNum"> 2023 </span> : * -<span class="lineNum"> 2024 </span> : * Digit grouping is interpreted according to numpunct::grouping() and -<span class="lineNum"> 2025 </span> : * numpunct::thousands_sep(). If the pattern of digit groups isn't -<span class="lineNum"> 2026 </span> : * consistent, sets err to ios_base::failbit. -<span class="lineNum"> 2027 </span> : * -<span class="lineNum"> 2028 </span> : * If parsing the string yields a valid value for @a v, @a v is set. -<span class="lineNum"> 2029 </span> : * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. -<span class="lineNum"> 2030 </span> : * Sets err to ios_base::eofbit if the stream is emptied. -<span class="lineNum"> 2031 </span> : * -<span class="lineNum"> 2032 </span> : * @param in Start of input stream. -<span class="lineNum"> 2033 </span> : * @param end End of input stream. -<span class="lineNum"> 2034 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2035 </span> : * @param err Error flags to set. -<span class="lineNum"> 2036 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2037 </span> : * @return Iterator after reading. -<span class="lineNum"> 2038 </span> : */ -<span class="lineNum"> 2039 </span> : iter_type -<span class="lineNum"> 2040 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2041 </span> : ios_base::iostate& __err, long& __v) const -<span class="lineNum"> 2042 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2043 </span> : -<span class="lineNum"> 2044 </span> : iter_type -<span class="lineNum"> 2045 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2046 </span> : ios_base::iostate& __err, unsigned short& __v) const -<span class="lineNum"> 2047 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2048 </span> : -<span class="lineNum"> 2049 </span> : iter_type -<span class="lineNum"> 2050 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2051 </span> : ios_base::iostate& __err, unsigned int& __v) const -<span class="lineNum"> 2052 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2053 </span> : -<span class="lineNum"> 2054 </span> : iter_type -<span class="lineNum"> 2055 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2056 </span> : ios_base::iostate& __err, unsigned long& __v) const -<span class="lineNum"> 2057 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2058 </span> : -<span class="lineNum"> 2059 </span> : #ifdef _GLIBCXX_USE_LONG_LONG -<span class="lineNum"> 2060 </span> : iter_type -<span class="lineNum"> 2061 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2062 </span> : ios_base::iostate& __err, long long& __v) const -<span class="lineNum"> 2063 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2064 </span> : -<span class="lineNum"> 2065 </span> : iter_type -<span class="lineNum"> 2066 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2067 </span> : ios_base::iostate& __err, unsigned long long& __v) const -<span class="lineNum"> 2068 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2069 </span> : #endif -<span class="lineNum"> 2070 </span> : //@} -<span class="lineNum"> 2071 </span> : -<span class="lineNum"> 2072 </span> : //@{ -<span class="lineNum"> 2073 </span> : /** -<span class="lineNum"> 2074 </span> : * @brief Numeric parsing. -<span class="lineNum"> 2075 </span> : * -<span class="lineNum"> 2076 </span> : * Parses the input stream into the integral variable @a v. It does so -<span class="lineNum"> 2077 </span> : * by calling num_get::do_get(). -<span class="lineNum"> 2078 </span> : * -<span class="lineNum"> 2079 </span> : * The input characters are parsed like the scanf %g specifier. The -<span class="lineNum"> 2080 </span> : * matching type length modifier is also used. -<span class="lineNum"> 2081 </span> : * -<span class="lineNum"> 2082 </span> : * The decimal point character used is numpunct::decimal_point(). -<span class="lineNum"> 2083 </span> : * Digit grouping is interpreted according to numpunct::grouping() and -<span class="lineNum"> 2084 </span> : * numpunct::thousands_sep(). If the pattern of digit groups isn't -<span class="lineNum"> 2085 </span> : * consistent, sets err to ios_base::failbit. -<span class="lineNum"> 2086 </span> : * -<span class="lineNum"> 2087 </span> : * If parsing the string yields a valid value for @a v, @a v is set. -<span class="lineNum"> 2088 </span> : * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. -<span class="lineNum"> 2089 </span> : * Sets err to ios_base::eofbit if the stream is emptied. -<span class="lineNum"> 2090 </span> : * -<span class="lineNum"> 2091 </span> : * @param in Start of input stream. -<span class="lineNum"> 2092 </span> : * @param end End of input stream. -<span class="lineNum"> 2093 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2094 </span> : * @param err Error flags to set. -<span class="lineNum"> 2095 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2096 </span> : * @return Iterator after reading. -<span class="lineNum"> 2097 </span> : */ -<span class="lineNum"> 2098 </span> : iter_type -<span class="lineNum"> 2099 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2100 </span> : ios_base::iostate& __err, float& __v) const -<span class="lineNum"> 2101 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2102 </span> : -<span class="lineNum"> 2103 </span> : iter_type -<span class="lineNum"> 2104 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2105 </span> : ios_base::iostate& __err, double& __v) const -<span class="lineNum"> 2106 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2107 </span> : -<span class="lineNum"> 2108 </span> : iter_type -<span class="lineNum"> 2109 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2110 </span> : ios_base::iostate& __err, long double& __v) const -<span class="lineNum"> 2111 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2112 </span> : //@} -<span class="lineNum"> 2113 </span> : -<span class="lineNum"> 2114 </span> : /** -<span class="lineNum"> 2115 </span> : * @brief Numeric parsing. -<span class="lineNum"> 2116 </span> : * -<span class="lineNum"> 2117 </span> : * Parses the input stream into the pointer variable @a v. It does so -<span class="lineNum"> 2118 </span> : * by calling num_get::do_get(). -<span class="lineNum"> 2119 </span> : * -<span class="lineNum"> 2120 </span> : * The input characters are parsed like the scanf %p specifier. -<span class="lineNum"> 2121 </span> : * -<span class="lineNum"> 2122 </span> : * Digit grouping is interpreted according to numpunct::grouping() and -<span class="lineNum"> 2123 </span> : * numpunct::thousands_sep(). If the pattern of digit groups isn't -<span class="lineNum"> 2124 </span> : * consistent, sets err to ios_base::failbit. -<span class="lineNum"> 2125 </span> : * -<span class="lineNum"> 2126 </span> : * Note that the digit grouping effect for pointers is a bit ambiguous -<span class="lineNum"> 2127 </span> : * in the standard and shouldn't be relied on. See DR 344. -<span class="lineNum"> 2128 </span> : * -<span class="lineNum"> 2129 </span> : * If parsing the string yields a valid value for @a v, @a v is set. -<span class="lineNum"> 2130 </span> : * Otherwise, sets err to ios_base::failbit and leaves @a v unaltered. -<span class="lineNum"> 2131 </span> : * Sets err to ios_base::eofbit if the stream is emptied. -<span class="lineNum"> 2132 </span> : * -<span class="lineNum"> 2133 </span> : * @param in Start of input stream. -<span class="lineNum"> 2134 </span> : * @param end End of input stream. -<span class="lineNum"> 2135 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2136 </span> : * @param err Error flags to set. -<span class="lineNum"> 2137 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2138 </span> : * @return Iterator after reading. -<span class="lineNum"> 2139 </span> : */ -<span class="lineNum"> 2140 </span> : iter_type -<span class="lineNum"> 2141 </span> : get(iter_type __in, iter_type __end, ios_base& __io, -<span class="lineNum"> 2142 </span> : ios_base::iostate& __err, void*& __v) const -<span class="lineNum"> 2143 </span> : { return this->do_get(__in, __end, __io, __err, __v); } -<span class="lineNum"> 2144 </span> : -<span class="lineNum"> 2145 </span> : protected: -<span class="lineNum"> 2146 </span> : /// Destructor. -<span class="lineNum"> 2147 </span> : virtual ~num_get() { } -<span class="lineNum"> 2148 </span> : -<span class="lineNum"> 2149 </span> : iter_type -<span class="lineNum"> 2150 </span> : _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&, -<span class="lineNum"> 2151 </span> : string& __xtrc) const; -<span class="lineNum"> 2152 </span> : -<span class="lineNum"> 2153 </span> : template<typename _ValueT> -<span class="lineNum"> 2154 </span> : iter_type -<span class="lineNum"> 2155 </span> : _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&, -<span class="lineNum"> 2156 </span> : _ValueT& __v) const; -<span class="lineNum"> 2157 </span> : -<span class="lineNum"> 2158 </span> : template<typename _CharT2> -<span class="lineNum"> 2159 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, int>::__type -<span class="lineNum"> 2160 </span> : _M_find(const _CharT2*, size_t __len, _CharT2 __c) const -<span class="lineNum"> 2161 </span> : { -<span class="lineNum"> 2162 </span> : int __ret = -1; -<span class="lineNum"> 2163 </span> : if (__len <= 10) -<span class="lineNum"> 2164 </span> : { -<span class="lineNum"> 2165 </span> : if (__c >= _CharT2('0') && __c < _CharT2(_CharT2('0') + __len)) -<span class="lineNum"> 2166 </span> : __ret = __c - _CharT2('0'); -<span class="lineNum"> 2167 </span> : } -<span class="lineNum"> 2168 </span> : else -<span class="lineNum"> 2169 </span> : { -<span class="lineNum"> 2170 </span> : if (__c >= _CharT2('0') && __c <= _CharT2('9')) -<span class="lineNum"> 2171 </span> : __ret = __c - _CharT2('0'); -<span class="lineNum"> 2172 </span> : else if (__c >= _CharT2('a') && __c <= _CharT2('f')) -<span class="lineNum"> 2173 </span> : __ret = 10 + (__c - _CharT2('a')); -<span class="lineNum"> 2174 </span> : else if (__c >= _CharT2('A') && __c <= _CharT2('F')) -<span class="lineNum"> 2175 </span> : __ret = 10 + (__c - _CharT2('A')); -<span class="lineNum"> 2176 </span> : } -<span class="lineNum"> 2177 </span> : return __ret; -<span class="lineNum"> 2178 </span> : } -<span class="lineNum"> 2179 </span> : -<span class="lineNum"> 2180 </span> : template<typename _CharT2> -<span class="lineNum"> 2181 </span> : typename __gnu_cxx::__enable_if<!__is_char<_CharT2>::__value, -<span class="lineNum"> 2182 </span> : int>::__type -<span class="lineNum"> 2183 </span> : _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const -<span class="lineNum"> 2184 </span> : { -<span class="lineNum"> 2185 </span> : int __ret = -1; -<span class="lineNum"> 2186 </span> : const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); -<span class="lineNum"> 2187 </span> : if (__q) -<span class="lineNum"> 2188 </span> : { -<span class="lineNum"> 2189 </span> : __ret = __q - __zero; -<span class="lineNum"> 2190 </span> : if (__ret > 15) -<span class="lineNum"> 2191 </span> : __ret -= 6; -<span class="lineNum"> 2192 </span> : } -<span class="lineNum"> 2193 </span> : return __ret; -<span class="lineNum"> 2194 </span> : } -<span class="lineNum"> 2195 </span> : -<span class="lineNum"> 2196 </span> : //@{ -<span class="lineNum"> 2197 </span> : /** -<span class="lineNum"> 2198 </span> : * @brief Numeric parsing. -<span class="lineNum"> 2199 </span> : * -<span class="lineNum"> 2200 </span> : * Parses the input stream into the variable @a v. This function is a -<span class="lineNum"> 2201 </span> : * hook for derived classes to change the value returned. @see get() -<span class="lineNum"> 2202 </span> : * for more details. -<span class="lineNum"> 2203 </span> : * -<span class="lineNum"> 2204 </span> : * @param in Start of input stream. -<span class="lineNum"> 2205 </span> : * @param end End of input stream. -<span class="lineNum"> 2206 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2207 </span> : * @param err Error flags to set. -<span class="lineNum"> 2208 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2209 </span> : * @return Iterator after reading. -<span class="lineNum"> 2210 </span> : */ -<span class="lineNum"> 2211 </span> : virtual iter_type -<span class="lineNum"> 2212 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const; -<span class="lineNum"> 2213 </span> : -<span class="lineNum"> 2214 </span> : -<span class="lineNum"> 2215 </span> : virtual iter_type -<span class="lineNum"> 2216 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long&) const; -<span class="lineNum"> 2217 </span> : -<span class="lineNum"> 2218 </span> : virtual iter_type -<span class="lineNum"> 2219 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2220 </span> : unsigned short&) const; -<span class="lineNum"> 2221 </span> : -<span class="lineNum"> 2222 </span> : virtual iter_type -<span class="lineNum"> 2223 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2224 </span> : unsigned int&) const; -<span class="lineNum"> 2225 </span> : -<span class="lineNum"> 2226 </span> : virtual iter_type -<span class="lineNum"> 2227 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2228 </span> : unsigned long&) const; -<span class="lineNum"> 2229 </span> : -<span class="lineNum"> 2230 </span> : #ifdef _GLIBCXX_USE_LONG_LONG -<span class="lineNum"> 2231 </span> : virtual iter_type -<span class="lineNum"> 2232 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2233 </span> : long long&) const; -<span class="lineNum"> 2234 </span> : -<span class="lineNum"> 2235 </span> : virtual iter_type -<span class="lineNum"> 2236 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2237 </span> : unsigned long long&) const; -<span class="lineNum"> 2238 </span> : #endif -<span class="lineNum"> 2239 </span> : -<span class="lineNum"> 2240 </span> : virtual iter_type -<span class="lineNum"> 2241 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2242 </span> : float&) const; -<span class="lineNum"> 2243 </span> : -<span class="lineNum"> 2244 </span> : virtual iter_type -<span class="lineNum"> 2245 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2246 </span> : double&) const; -<span class="lineNum"> 2247 </span> : -<span class="lineNum"> 2248 </span> : // XXX GLIBCXX_ABI Deprecated -<span class="lineNum"> 2249 </span> : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ -<span class="lineNum"> 2250 </span> : virtual iter_type -<span class="lineNum"> 2251 </span> : __do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2252 </span> : double&) const; -<span class="lineNum"> 2253 </span> : #else -<span class="lineNum"> 2254 </span> : virtual iter_type -<span class="lineNum"> 2255 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2256 </span> : long double&) const; -<span class="lineNum"> 2257 </span> : #endif -<span class="lineNum"> 2258 </span> : -<span class="lineNum"> 2259 </span> : virtual iter_type -<span class="lineNum"> 2260 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2261 </span> : void*&) const; -<span class="lineNum"> 2262 </span> : -<span class="lineNum"> 2263 </span> : // XXX GLIBCXX_ABI Deprecated -<span class="lineNum"> 2264 </span> : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ -<span class="lineNum"> 2265 </span> : virtual iter_type -<span class="lineNum"> 2266 </span> : do_get(iter_type, iter_type, ios_base&, ios_base::iostate& __err, -<span class="lineNum"> 2267 </span> : long double&) const; -<span class="lineNum"> 2268 </span> : #endif -<span class="lineNum"> 2269 </span> : //@} -<span class="lineNum"> 2270 </span> : }; -<span class="lineNum"> 2271 </span> : -<span class="lineNum"> 2272 </span> : template<typename _CharT, typename _InIter> -<span class="lineNum"> 2273 </span> : locale::id num_get<_CharT, _InIter>::id; -<span class="lineNum"> 2274 </span> : -<span class="lineNum"> 2275 </span> : -<span class="lineNum"> 2276 </span> : /** -<span class="lineNum"> 2277 </span> : * @brief Facet for converting numbers to strings. -<span class="lineNum"> 2278 </span> : * -<span class="lineNum"> 2279 </span> : * This facet encapsulates the code to convert a number to a string. It is -<span class="lineNum"> 2280 </span> : * used by the ostream numeric insertion operators. -<span class="lineNum"> 2281 </span> : * -<span class="lineNum"> 2282 </span> : * The num_put template uses protected virtual functions to provide the -<span class="lineNum"> 2283 </span> : * actual results. The public accessors forward the call to the virtual -<span class="lineNum"> 2284 </span> : * functions. These virtual functions are hooks for developers to -<span class="lineNum"> 2285 </span> : * implement the behavior they require from the num_put facet. -<span class="lineNum"> 2286 </span> : */ -<span class="lineNum"> 2287 </span> : template<typename _CharT, typename _OutIter> -<span class="lineNum"> 2288 </span> : class num_put : public locale::facet -<span class="lineNum"> 2289 </span> : { -<span class="lineNum"> 2290 </span> : public: -<span class="lineNum"> 2291 </span> : // Types: -<span class="lineNum"> 2292 </span> : //@{ -<span class="lineNum"> 2293 </span> : /// Public typedefs -<span class="lineNum"> 2294 </span> : typedef _CharT char_type; -<span class="lineNum"> 2295 </span> : typedef _OutIter iter_type; -<span class="lineNum"> 2296 </span> : //@} -<span class="lineNum"> 2297 </span> : -<span class="lineNum"> 2298 </span> : /// Numpunct facet id. -<span class="lineNum"> 2299 </span> : static locale::id id; -<span class="lineNum"> 2300 </span> : -<span class="lineNum"> 2301 </span> : /** -<span class="lineNum"> 2302 </span> : * @brief Constructor performs initialization. -<span class="lineNum"> 2303 </span> : * -<span class="lineNum"> 2304 </span> : * This is the constructor provided by the standard. -<span class="lineNum"> 2305 </span> : * -<span class="lineNum"> 2306 </span> : * @param refs Passed to the base facet class. -<span class="lineNum"> 2307 </span> : */ -<span class="lineNum"> 2308 </span> : explicit -<span class="lineNum"> 2309 </span> : num_put(size_t __refs = 0) : facet(__refs) { } -<span class="lineNum"> 2310 </span> : -<span class="lineNum"> 2311 </span> : /** -<span class="lineNum"> 2312 </span> : * @brief Numeric formatting. -<span class="lineNum"> 2313 </span> : * -<span class="lineNum"> 2314 </span> : * Formats the boolean @a v and inserts it into a stream. It does so -<span class="lineNum"> 2315 </span> : * by calling num_put::do_put(). -<span class="lineNum"> 2316 </span> : * -<span class="lineNum"> 2317 </span> : * If ios_base::boolalpha is set, writes ctype<CharT>::truename() or -<span class="lineNum"> 2318 </span> : * ctype<CharT>::falsename(). Otherwise formats @a v as an int. -<span class="lineNum"> 2319 </span> : * -<span class="lineNum"> 2320 </span> : * @param s Stream to write to. -<span class="lineNum"> 2321 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2322 </span> : * @param fill Char_type to use for filling. -<span class="lineNum"> 2323 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2324 </span> : * @return Iterator after writing. -<span class="lineNum"> 2325 </span> : */ -<span class="lineNum"> 2326 </span> : iter_type -<span class="lineNum"> 2327 </span> : put(iter_type __s, ios_base& __f, char_type __fill, bool __v) const -<span class="lineNum"> 2328 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2329 </span> : -<span class="lineNum"> 2330 </span> : //@{ -<span class="lineNum"> 2331 </span> : /** -<span class="lineNum"> 2332 </span> : * @brief Numeric formatting. -<span class="lineNum"> 2333 </span> : * -<span class="lineNum"> 2334 </span> : * Formats the integral value @a v and inserts it into a -<span class="lineNum"> 2335 </span> : * stream. It does so by calling num_put::do_put(). -<span class="lineNum"> 2336 </span> : * -<span class="lineNum"> 2337 </span> : * Formatting is affected by the flag settings in @a io. -<span class="lineNum"> 2338 </span> : * -<span class="lineNum"> 2339 </span> : * The basic format is affected by the value of io.flags() & -<span class="lineNum"> 2340 </span> : * ios_base::basefield. If equal to ios_base::oct, formats like the -<span class="lineNum"> 2341 </span> : * printf %o specifier. Else if equal to ios_base::hex, formats like -<span class="lineNum"> 2342 </span> : * %x or %X with ios_base::uppercase unset or set respectively. -<span class="lineNum"> 2343 </span> : * Otherwise, formats like %d, %ld, %lld for signed and %u, %lu, %llu -<span class="lineNum"> 2344 </span> : * for unsigned values. Note that if both oct and hex are set, neither -<span class="lineNum"> 2345 </span> : * will take effect. -<span class="lineNum"> 2346 </span> : * -<span class="lineNum"> 2347 </span> : * If ios_base::showpos is set, '+' is output before positive values. -<span class="lineNum"> 2348 </span> : * If ios_base::showbase is set, '0' precedes octal values (except 0) -<span class="lineNum"> 2349 </span> : * and '0[xX]' precedes hex values. -<span class="lineNum"> 2350 </span> : * -<span class="lineNum"> 2351 </span> : * Thousands separators are inserted according to numpunct::grouping() -<span class="lineNum"> 2352 </span> : * and numpunct::thousands_sep(). The decimal point character used is -<span class="lineNum"> 2353 </span> : * numpunct::decimal_point(). -<span class="lineNum"> 2354 </span> : * -<span class="lineNum"> 2355 </span> : * If io.width() is non-zero, enough @a fill characters are inserted to -<span class="lineNum"> 2356 </span> : * make the result at least that wide. If -<span class="lineNum"> 2357 </span> : * (io.flags() & ios_base::adjustfield) == ios_base::left, result is -<span class="lineNum"> 2358 </span> : * padded at the end. If ios_base::internal, then padding occurs -<span class="lineNum"> 2359 </span> : * immediately after either a '+' or '-' or after '0x' or '0X'. -<span class="lineNum"> 2360 </span> : * Otherwise, padding occurs at the beginning. -<span class="lineNum"> 2361 </span> : * -<span class="lineNum"> 2362 </span> : * @param s Stream to write to. -<span class="lineNum"> 2363 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2364 </span> : * @param fill Char_type to use for filling. -<span class="lineNum"> 2365 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2366 </span> : * @return Iterator after writing. -<span class="lineNum"> 2367 </span> : */ -<span class="lineNum"> 2368 </span> : iter_type -<span class="lineNum"> 2369 </span> : put(iter_type __s, ios_base& __f, char_type __fill, long __v) const -<span class="lineNum"> 2370 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2371 </span> : -<span class="lineNum"> 2372 </span> : iter_type -<span class="lineNum"> 2373 </span> : put(iter_type __s, ios_base& __f, char_type __fill, -<span class="lineNum"> 2374 </span> : unsigned long __v) const -<span class="lineNum"> 2375 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2376 </span> : -<span class="lineNum"> 2377 </span> : #ifdef _GLIBCXX_USE_LONG_LONG -<span class="lineNum"> 2378 </span> : iter_type -<span class="lineNum"> 2379 </span> : put(iter_type __s, ios_base& __f, char_type __fill, long long __v) const -<span class="lineNum"> 2380 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2381 </span> : -<span class="lineNum"> 2382 </span> : iter_type -<span class="lineNum"> 2383 </span> : put(iter_type __s, ios_base& __f, char_type __fill, -<span class="lineNum"> 2384 </span> : unsigned long long __v) const -<span class="lineNum"> 2385 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2386 </span> : #endif -<span class="lineNum"> 2387 </span> : //@} -<span class="lineNum"> 2388 </span> : -<span class="lineNum"> 2389 </span> : //@{ -<span class="lineNum"> 2390 </span> : /** -<span class="lineNum"> 2391 </span> : * @brief Numeric formatting. -<span class="lineNum"> 2392 </span> : * -<span class="lineNum"> 2393 </span> : * Formats the floating point value @a v and inserts it into a stream. -<span class="lineNum"> 2394 </span> : * It does so by calling num_put::do_put(). -<span class="lineNum"> 2395 </span> : * -<span class="lineNum"> 2396 </span> : * Formatting is affected by the flag settings in @a io. -<span class="lineNum"> 2397 </span> : * -<span class="lineNum"> 2398 </span> : * The basic format is affected by the value of io.flags() & -<span class="lineNum"> 2399 </span> : * ios_base::floatfield. If equal to ios_base::fixed, formats like the -<span class="lineNum"> 2400 </span> : * printf %f specifier. Else if equal to ios_base::scientific, formats -<span class="lineNum"> 2401 </span> : * like %e or %E with ios_base::uppercase unset or set respectively. -<span class="lineNum"> 2402 </span> : * Otherwise, formats like %g or %G depending on uppercase. Note that -<span class="lineNum"> 2403 </span> : * if both fixed and scientific are set, the effect will also be like -<span class="lineNum"> 2404 </span> : * %g or %G. -<span class="lineNum"> 2405 </span> : * -<span class="lineNum"> 2406 </span> : * The output precision is given by io.precision(). This precision is -<span class="lineNum"> 2407 </span> : * capped at numeric_limits::digits10 + 2 (different for double and -<span class="lineNum"> 2408 </span> : * long double). The default precision is 6. -<span class="lineNum"> 2409 </span> : * -<span class="lineNum"> 2410 </span> : * If ios_base::showpos is set, '+' is output before positive values. -<span class="lineNum"> 2411 </span> : * If ios_base::showpoint is set, a decimal point will always be -<span class="lineNum"> 2412 </span> : * output. -<span class="lineNum"> 2413 </span> : * -<span class="lineNum"> 2414 </span> : * Thousands separators are inserted according to numpunct::grouping() -<span class="lineNum"> 2415 </span> : * and numpunct::thousands_sep(). The decimal point character used is -<span class="lineNum"> 2416 </span> : * numpunct::decimal_point(). -<span class="lineNum"> 2417 </span> : * -<span class="lineNum"> 2418 </span> : * If io.width() is non-zero, enough @a fill characters are inserted to -<span class="lineNum"> 2419 </span> : * make the result at least that wide. If -<span class="lineNum"> 2420 </span> : * (io.flags() & ios_base::adjustfield) == ios_base::left, result is -<span class="lineNum"> 2421 </span> : * padded at the end. If ios_base::internal, then padding occurs -<span class="lineNum"> 2422 </span> : * immediately after either a '+' or '-' or after '0x' or '0X'. -<span class="lineNum"> 2423 </span> : * Otherwise, padding occurs at the beginning. -<span class="lineNum"> 2424 </span> : * -<span class="lineNum"> 2425 </span> : * @param s Stream to write to. -<span class="lineNum"> 2426 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2427 </span> : * @param fill Char_type to use for filling. -<span class="lineNum"> 2428 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2429 </span> : * @return Iterator after writing. -<span class="lineNum"> 2430 </span> : */ -<span class="lineNum"> 2431 </span> : iter_type -<span class="lineNum"> 2432 </span> : put(iter_type __s, ios_base& __f, char_type __fill, double __v) const -<span class="lineNum"> 2433 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2434 </span> : -<span class="lineNum"> 2435 </span> : iter_type -<span class="lineNum"> 2436 </span> : put(iter_type __s, ios_base& __f, char_type __fill, -<span class="lineNum"> 2437 </span> : long double __v) const -<span class="lineNum"> 2438 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2439 </span> : //@} -<span class="lineNum"> 2440 </span> : -<span class="lineNum"> 2441 </span> : /** -<span class="lineNum"> 2442 </span> : * @brief Numeric formatting. -<span class="lineNum"> 2443 </span> : * -<span class="lineNum"> 2444 </span> : * Formats the pointer value @a v and inserts it into a stream. It -<span class="lineNum"> 2445 </span> : * does so by calling num_put::do_put(). -<span class="lineNum"> 2446 </span> : * -<span class="lineNum"> 2447 </span> : * This function formats @a v as an unsigned long with ios_base::hex -<span class="lineNum"> 2448 </span> : * and ios_base::showbase set. -<span class="lineNum"> 2449 </span> : * -<span class="lineNum"> 2450 </span> : * @param s Stream to write to. -<span class="lineNum"> 2451 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2452 </span> : * @param fill Char_type to use for filling. -<span class="lineNum"> 2453 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2454 </span> : * @return Iterator after writing. -<span class="lineNum"> 2455 </span> : */ -<span class="lineNum"> 2456 </span> : iter_type -<span class="lineNum"> 2457 </span> : put(iter_type __s, ios_base& __f, char_type __fill, -<span class="lineNum"> 2458 </span> : const void* __v) const -<span class="lineNum"> 2459 </span> : { return this->do_put(__s, __f, __fill, __v); } -<span class="lineNum"> 2460 </span> : -<span class="lineNum"> 2461 </span> : protected: -<span class="lineNum"> 2462 </span> : template<typename _ValueT> -<span class="lineNum"> 2463 </span> : iter_type -<span class="lineNum"> 2464 </span> : _M_insert_float(iter_type, ios_base& __io, char_type __fill, -<span class="lineNum"> 2465 </span> : char __mod, _ValueT __v) const; -<span class="lineNum"> 2466 </span> : -<span class="lineNum"> 2467 </span> : void -<span class="lineNum"> 2468 </span> : _M_group_float(const char* __grouping, size_t __grouping_size, -<span class="lineNum"> 2469 </span> : char_type __sep, const char_type* __p, char_type* __new, -<span class="lineNum"> 2470 </span> : char_type* __cs, int& __len) const; -<span class="lineNum"> 2471 </span> : -<span class="lineNum"> 2472 </span> : template<typename _ValueT> -<span class="lineNum"> 2473 </span> : iter_type -<span class="lineNum"> 2474 </span> : _M_insert_int(iter_type, ios_base& __io, char_type __fill, -<span class="lineNum"> 2475 </span> : _ValueT __v) const; -<span class="lineNum"> 2476 </span> : -<span class="lineNum"> 2477 </span> : void -<span class="lineNum"> 2478 </span> : _M_group_int(const char* __grouping, size_t __grouping_size, -<span class="lineNum"> 2479 </span> : char_type __sep, ios_base& __io, char_type* __new, -<span class="lineNum"> 2480 </span> : char_type* __cs, int& __len) const; -<span class="lineNum"> 2481 </span> : -<span class="lineNum"> 2482 </span> : void -<span class="lineNum"> 2483 </span> : _M_pad(char_type __fill, streamsize __w, ios_base& __io, -<span class="lineNum"> 2484 </span> : char_type* __new, const char_type* __cs, int& __len) const; -<span class="lineNum"> 2485 </span> : -<span class="lineNum"> 2486 </span> : /// Destructor. -<span class="lineNum"> 2487 </span> : virtual -<span class="lineNum"> 2488 </span> : ~num_put() { }; -<span class="lineNum"> 2489 </span> : -<span class="lineNum"> 2490 </span> : //@{ -<span class="lineNum"> 2491 </span> : /** -<span class="lineNum"> 2492 </span> : * @brief Numeric formatting. -<span class="lineNum"> 2493 </span> : * -<span class="lineNum"> 2494 </span> : * These functions do the work of formatting numeric values and -<span class="lineNum"> 2495 </span> : * inserting them into a stream. This function is a hook for derived -<span class="lineNum"> 2496 </span> : * classes to change the value returned. -<span class="lineNum"> 2497 </span> : * -<span class="lineNum"> 2498 </span> : * @param s Stream to write to. -<span class="lineNum"> 2499 </span> : * @param io Source of locale and flags. -<span class="lineNum"> 2500 </span> : * @param fill Char_type to use for filling. -<span class="lineNum"> 2501 </span> : * @param v Value to format and insert. -<span class="lineNum"> 2502 </span> : * @return Iterator after writing. -<span class="lineNum"> 2503 </span> : */ -<span class="lineNum"> 2504 </span> : virtual iter_type -<span class="lineNum"> 2505 </span> : do_put(iter_type, ios_base&, char_type __fill, bool __v) const; -<span class="lineNum"> 2506 </span> : -<span class="lineNum"> 2507 </span> : virtual iter_type -<span class="lineNum"> 2508 </span> : do_put(iter_type, ios_base&, char_type __fill, long __v) const; -<span class="lineNum"> 2509 </span> : -<span class="lineNum"> 2510 </span> : virtual iter_type -<span class="lineNum"> 2511 </span> : do_put(iter_type, ios_base&, char_type __fill, unsigned long) const; -<span class="lineNum"> 2512 </span> : -<span class="lineNum"> 2513 </span> : #ifdef _GLIBCXX_USE_LONG_LONG -<span class="lineNum"> 2514 </span> : virtual iter_type -<span class="lineNum"> 2515 </span> : do_put(iter_type, ios_base&, char_type __fill, long long __v) const; -<span class="lineNum"> 2516 </span> : -<span class="lineNum"> 2517 </span> : virtual iter_type -<span class="lineNum"> 2518 </span> : do_put(iter_type, ios_base&, char_type __fill, unsigned long long) const; -<span class="lineNum"> 2519 </span> : #endif -<span class="lineNum"> 2520 </span> : -<span class="lineNum"> 2521 </span> : virtual iter_type -<span class="lineNum"> 2522 </span> : do_put(iter_type, ios_base&, char_type __fill, double __v) const; -<span class="lineNum"> 2523 </span> : -<span class="lineNum"> 2524 </span> : // XXX GLIBCXX_ABI Deprecated -<span class="lineNum"> 2525 </span> : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ -<span class="lineNum"> 2526 </span> : virtual iter_type -<span class="lineNum"> 2527 </span> : __do_put(iter_type, ios_base&, char_type __fill, double __v) const; -<span class="lineNum"> 2528 </span> : #else -<span class="lineNum"> 2529 </span> : virtual iter_type -<span class="lineNum"> 2530 </span> : do_put(iter_type, ios_base&, char_type __fill, long double __v) const; -<span class="lineNum"> 2531 </span> : #endif -<span class="lineNum"> 2532 </span> : -<span class="lineNum"> 2533 </span> : virtual iter_type -<span class="lineNum"> 2534 </span> : do_put(iter_type, ios_base&, char_type __fill, const void* __v) const; -<span class="lineNum"> 2535 </span> : -<span class="lineNum"> 2536 </span> : // XXX GLIBCXX_ABI Deprecated -<span class="lineNum"> 2537 </span> : #if defined _GLIBCXX_LONG_DOUBLE_COMPAT && defined __LONG_DOUBLE_128__ -<span class="lineNum"> 2538 </span> : virtual iter_type -<span class="lineNum"> 2539 </span> : do_put(iter_type, ios_base&, char_type __fill, long double __v) const; -<span class="lineNum"> 2540 </span> : #endif -<span class="lineNum"> 2541 </span> : //@} -<span class="lineNum"> 2542 </span> : }; -<span class="lineNum"> 2543 </span> : -<span class="lineNum"> 2544 </span> : template <typename _CharT, typename _OutIter> -<span class="lineNum"> 2545 </span> : locale::id num_put<_CharT, _OutIter>::id; -<span class="lineNum"> 2546 </span> : -<span class="lineNum"> 2547 </span> : _GLIBCXX_END_LDBL_NAMESPACE -<span class="lineNum"> 2548 </span> : -<span class="lineNum"> 2549 </span> : // Subclause convenience interfaces, inlines. -<span class="lineNum"> 2550 </span> : // NB: These are inline because, when used in a loop, some compilers -<span class="lineNum"> 2551 </span> : // can hoist the body out of the loop; then it's just as fast as the -<span class="lineNum"> 2552 </span> : // C is*() function. -<span class="lineNum"> 2553 </span> : -<span class="lineNum"> 2554 </span> : /// Convenience interface to ctype.is(ctype_base::space, __c). -<span class="lineNum"> 2555 </span> : template<typename _CharT> -<span class="lineNum"> 2556 </span> : inline bool -<span class="lineNum"> 2557 </span> : isspace(_CharT __c, const locale& __loc) -<span class="lineNum"> 2558 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::space, __c); } -<span class="lineNum"> 2559 </span> : -<span class="lineNum"> 2560 </span> : /// Convenience interface to ctype.is(ctype_base::print, __c). -<span class="lineNum"> 2561 </span> : template<typename _CharT> -<span class="lineNum"> 2562 </span> : inline bool -<span class="lineNum"> 2563 </span> : isprint(_CharT __c, const locale& __loc) -<span class="lineNum"> 2564 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::print, __c); } -<span class="lineNum"> 2565 </span> : -<span class="lineNum"> 2566 </span> : /// Convenience interface to ctype.is(ctype_base::cntrl, __c). -<span class="lineNum"> 2567 </span> : template<typename _CharT> -<span class="lineNum"> 2568 </span> : inline bool -<span class="lineNum"> 2569 </span> : iscntrl(_CharT __c, const locale& __loc) -<span class="lineNum"> 2570 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::cntrl, __c); } -<span class="lineNum"> 2571 </span> : -<span class="lineNum"> 2572 </span> : /// Convenience interface to ctype.is(ctype_base::upper, __c). -<span class="lineNum"> 2573 </span> : template<typename _CharT> -<span class="lineNum"> 2574 </span> : inline bool -<span class="lineNum"> 2575 </span> : isupper(_CharT __c, const locale& __loc) -<span class="lineNum"> 2576 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::upper, __c); } -<span class="lineNum"> 2577 </span> : -<span class="lineNum"> 2578 </span> : /// Convenience interface to ctype.is(ctype_base::lower, __c). -<span class="lineNum"> 2579 </span> : template<typename _CharT> -<span class="lineNum"> 2580 </span> : inline bool -<span class="lineNum"> 2581 </span> : islower(_CharT __c, const locale& __loc) -<span class="lineNum"> 2582 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::lower, __c); } -<span class="lineNum"> 2583 </span> : -<span class="lineNum"> 2584 </span> : /// Convenience interface to ctype.is(ctype_base::alpha, __c). -<span class="lineNum"> 2585 </span> : template<typename _CharT> -<span class="lineNum"> 2586 </span> : inline bool -<span class="lineNum"> 2587 </span> : isalpha(_CharT __c, const locale& __loc) -<span class="lineNum"> 2588 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alpha, __c); } -<span class="lineNum"> 2589 </span> : -<span class="lineNum"> 2590 </span> : /// Convenience interface to ctype.is(ctype_base::digit, __c). -<span class="lineNum"> 2591 </span> : template<typename _CharT> -<span class="lineNum"> 2592 </span> : inline bool -<span class="lineNum"> 2593 </span> : isdigit(_CharT __c, const locale& __loc) -<span class="lineNum"> 2594 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::digit, __c); } -<span class="lineNum"> 2595 </span> : -<span class="lineNum"> 2596 </span> : /// Convenience interface to ctype.is(ctype_base::punct, __c). -<span class="lineNum"> 2597 </span> : template<typename _CharT> -<span class="lineNum"> 2598 </span> : inline bool -<span class="lineNum"> 2599 </span> : ispunct(_CharT __c, const locale& __loc) -<span class="lineNum"> 2600 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::punct, __c); } -<span class="lineNum"> 2601 </span> : -<span class="lineNum"> 2602 </span> : /// Convenience interface to ctype.is(ctype_base::xdigit, __c). -<span class="lineNum"> 2603 </span> : template<typename _CharT> -<span class="lineNum"> 2604 </span> : inline bool -<span class="lineNum"> 2605 </span> : isxdigit(_CharT __c, const locale& __loc) -<span class="lineNum"> 2606 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::xdigit, __c); } -<span class="lineNum"> 2607 </span> : -<span class="lineNum"> 2608 </span> : /// Convenience interface to ctype.is(ctype_base::alnum, __c). -<span class="lineNum"> 2609 </span> : template<typename _CharT> -<span class="lineNum"> 2610 </span> : inline bool -<span class="lineNum"> 2611 </span> : isalnum(_CharT __c, const locale& __loc) -<span class="lineNum"> 2612 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alnum, __c); } -<span class="lineNum"> 2613 </span> : -<span class="lineNum"> 2614 </span> : /// Convenience interface to ctype.is(ctype_base::graph, __c). -<span class="lineNum"> 2615 </span> : template<typename _CharT> -<span class="lineNum"> 2616 </span> : inline bool -<span class="lineNum"> 2617 </span> : isgraph(_CharT __c, const locale& __loc) -<span class="lineNum"> 2618 </span> : { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::graph, __c); } -<span class="lineNum"> 2619 </span> : -<span class="lineNum"> 2620 </span> : /// Convenience interface to ctype.toupper(__c). -<span class="lineNum"> 2621 </span> : template<typename _CharT> -<span class="lineNum"> 2622 </span> : inline _CharT -<span class="lineNum"> 2623 </span> : toupper(_CharT __c, const locale& __loc) -<span class="lineNum"> 2624 </span> : { return use_facet<ctype<_CharT> >(__loc).toupper(__c); } -<span class="lineNum"> 2625 </span> : -<span class="lineNum"> 2626 </span> : /// Convenience interface to ctype.tolower(__c). -<span class="lineNum"> 2627 </span> : template<typename _CharT> -<span class="lineNum"> 2628 </span> : inline _CharT -<span class="lineNum"> 2629 </span> : tolower(_CharT __c, const locale& __loc) -<span class="lineNum"> 2630 </span> : { return use_facet<ctype<_CharT> >(__loc).tolower(__c); } -<span class="lineNum"> 2631 </span> : -<span class="lineNum"> 2632 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 2633 </span> : -<span class="lineNum"> 2634 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 2635 </span> : # include <bits/locale_facets.tcc> -<span class="lineNum"> 2636 </span> : #endif -<span class="lineNum"> 2637 </span> : -<span class="lineNum"> 2638 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/postypes.h.gcov.html b/rep/usr/include/c++/4.3/bits/postypes.h.gcov.html deleted file mode 100644 index 9775ab9..0000000 --- a/rep/usr/include/c++/4.3/bits/postypes.h.gcov.html +++ /dev/null @@ -1,280 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/postypes.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - postypes.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Position types -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 19 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 21 </span> : // USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file postypes.h -<span class="lineNum"> 33 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 34 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : // ISO C++ 14882: 27.4.1 - Types -<span class="lineNum"> 39 </span> : // ISO C++ 14882: 27.4.3 - Template class fpos -<span class="lineNum"> 40 </span> : // -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #ifndef _GLIBCXX_POSTYPES_H -<span class="lineNum"> 43 </span> : #define _GLIBCXX_POSTYPES_H 1 -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #pragma GCC system_header -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : #include <cwchar> // For mbstate_t -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : #ifdef _GLIBCXX_HAVE_STDINT_H -<span class="lineNum"> 50 </span> : #include <stdint.h> // For int64_t -<span class="lineNum"> 51 </span> : #endif -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : // The types streamoff, streampos and wstreampos and the class -<span class="lineNum"> 56 </span> : // template fpos<> are described in clauses 21.1.2, 21.1.3, 27.1.2, -<span class="lineNum"> 57 </span> : // 27.2, 27.4.1, 27.4.3 and D.6. Despite all this verbiage, the -<span class="lineNum"> 58 </span> : // behaviour of these types is mostly implementation defined or -<span class="lineNum"> 59 </span> : // unspecified. The behaviour in this implementation is as noted -<span class="lineNum"> 60 </span> : // below. -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : /** -<span class="lineNum"> 63 </span> : * @brief Type used by fpos, char_traits<char>, and char_traits<wchar_t>. -<span class="lineNum"> 64 </span> : * -<span class="lineNum"> 65 </span> : * In clauses 21.1.3.1 and 27.4.1 streamoff is described as an -<span class="lineNum"> 66 </span> : * implementation defined type. -<span class="lineNum"> 67 </span> : * Note: In versions of GCC up to and including GCC 3.3, streamoff -<span class="lineNum"> 68 </span> : * was typedef long. -<span class="lineNum"> 69 </span> : */ -<span class="lineNum"> 70 </span> : #ifdef _GLIBCXX_HAVE_INT64_T -<span class="lineNum"> 71 </span> : typedef int64_t streamoff; -<span class="lineNum"> 72 </span> : #else -<span class="lineNum"> 73 </span> : typedef long long streamoff; -<span class="lineNum"> 74 </span> : #endif -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : /// Integral type for I/O operation counts and buffer sizes. -<span class="lineNum"> 77 </span> : typedef ptrdiff_t streamsize; // Signed integral type -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : /** -<span class="lineNum"> 80 </span> : * @brief Class representing stream positions. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * The standard places no requirements upon the template parameter StateT. -<span class="lineNum"> 83 </span> : * In this implementation StateT must be DefaultConstructible, -<span class="lineNum"> 84 </span> : * CopyConstructible and Assignable. The standard only requires that fpos -<span class="lineNum"> 85 </span> : * should contain a member of type StateT. In this implementation it also -<span class="lineNum"> 86 </span> : * contains an offset stored as a signed integer. -<span class="lineNum"> 87 </span> : * -<span class="lineNum"> 88 </span> : * @param StateT Type passed to and returned from state(). -<span class="lineNum"> 89 </span> : */ -<span class="lineNum"> 90 </span> : template<typename _StateT> -<span class="lineNum"> 91 </span> : class fpos -<span class="lineNum"> 92 </span> : { -<span class="lineNum"> 93 </span> : private: -<span class="lineNum"> 94 </span> : streamoff _M_off; -<span class="lineNum"> 95 </span> : _StateT _M_state; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : public: -<span class="lineNum"> 98 </span> : // The standard doesn't require that fpos objects can be default -<span class="lineNum"> 99 </span> : // constructed. This implementation provides a default -<span class="lineNum"> 100 </span> : // constructor that initializes the offset to 0 and default -<span class="lineNum"> 101 </span> : // constructs the state. -<span class="lineNum"> 102 </span> : fpos() -<span class="lineNum"> 103 </span> : : _M_off(0), _M_state() { } -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : // The standard requires that fpos objects can be constructed -<span class="lineNum"> 106 </span> : // from streamoff objects using the constructor syntax, and -<span class="lineNum"> 107 </span> : // fails to give any meaningful semantics. In this -<span class="lineNum"> 108 </span> : // implementation implicit conversion is also allowed, and this -<span class="lineNum"> 109 </span> : // constructor stores the streamoff as the offset and default -<span class="lineNum"> 110 </span> : // constructs the state. -<span class="lineNum"> 111 </span> : /// Construct position from offset. -<span class="lineNum"> 112 </span><span class="lineNoCov"> 0 : fpos(streamoff __off)</span> -<span class="lineNum"> 113 </span><span class="lineNoCov"> 0 : : _M_off(__off), _M_state() { }</span> -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : /// Convert to streamoff. -<span class="lineNum"> 116 </span><span class="lineNoCov"> 0 : operator streamoff() const { return _M_off; }</span> -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : /// Remember the value of @a st. -<span class="lineNum"> 119 </span> : void -<span class="lineNum"> 120 </span> : state(_StateT __st) -<span class="lineNum"> 121 </span> : { _M_state = __st; } -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : /// Return the last set value of @a st. -<span class="lineNum"> 124 </span> : _StateT -<span class="lineNum"> 125 </span> : state() const -<span class="lineNum"> 126 </span> : { return _M_state; } -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : // The standard requires that this operator must be defined, but -<span class="lineNum"> 129 </span> : // gives no semantics. In this implementation it just adds its -<span class="lineNum"> 130 </span> : // argument to the stored offset and returns *this. -<span class="lineNum"> 131 </span> : /// Add offset to this position. -<span class="lineNum"> 132 </span> : fpos& -<span class="lineNum"> 133 </span> : operator+=(streamoff __off) -<span class="lineNum"> 134 </span> : { -<span class="lineNum"> 135 </span> : _M_off += __off; -<span class="lineNum"> 136 </span> : return *this; -<span class="lineNum"> 137 </span> : } -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : // The standard requires that this operator must be defined, but -<span class="lineNum"> 140 </span> : // gives no semantics. In this implementation it just subtracts -<span class="lineNum"> 141 </span> : // its argument from the stored offset and returns *this. -<span class="lineNum"> 142 </span> : /// Subtract offset from this position. -<span class="lineNum"> 143 </span> : fpos& -<span class="lineNum"> 144 </span> : operator-=(streamoff __off) -<span class="lineNum"> 145 </span> : { -<span class="lineNum"> 146 </span> : _M_off -= __off; -<span class="lineNum"> 147 </span> : return *this; -<span class="lineNum"> 148 </span> : } -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : // The standard requires that this operator must be defined, but -<span class="lineNum"> 151 </span> : // defines its semantics only in terms of operator-. In this -<span class="lineNum"> 152 </span> : // implementation it constructs a copy of *this, adds the -<span class="lineNum"> 153 </span> : // argument to that copy using operator+= and then returns the -<span class="lineNum"> 154 </span> : // copy. -<span class="lineNum"> 155 </span> : /// Add position and offset. -<span class="lineNum"> 156 </span> : fpos -<span class="lineNum"> 157 </span> : operator+(streamoff __off) const -<span class="lineNum"> 158 </span> : { -<span class="lineNum"> 159 </span> : fpos __pos(*this); -<span class="lineNum"> 160 </span> : __pos += __off; -<span class="lineNum"> 161 </span> : return __pos; -<span class="lineNum"> 162 </span> : } -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : // The standard requires that this operator must be defined, but -<span class="lineNum"> 165 </span> : // defines its semantics only in terms of operator+. In this -<span class="lineNum"> 166 </span> : // implementation it constructs a copy of *this, subtracts the -<span class="lineNum"> 167 </span> : // argument from that copy using operator-= and then returns the -<span class="lineNum"> 168 </span> : // copy. -<span class="lineNum"> 169 </span> : /// Subtract offset from position. -<span class="lineNum"> 170 </span> : fpos -<span class="lineNum"> 171 </span> : operator-(streamoff __off) const -<span class="lineNum"> 172 </span> : { -<span class="lineNum"> 173 </span> : fpos __pos(*this); -<span class="lineNum"> 174 </span> : __pos -= __off; -<span class="lineNum"> 175 </span> : return __pos; -<span class="lineNum"> 176 </span> : } -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : // The standard requires that this operator must be defined, but -<span class="lineNum"> 179 </span> : // defines its semantics only in terms of operator+. In this -<span class="lineNum"> 180 </span> : // implementation it returns the difference between the offset -<span class="lineNum"> 181 </span> : // stored in *this and in the argument. -<span class="lineNum"> 182 </span> : /// Subtract position to return offset. -<span class="lineNum"> 183 </span> : streamoff -<span class="lineNum"> 184 </span> : operator-(const fpos& __other) const -<span class="lineNum"> 185 </span> : { return _M_off - __other._M_off; } -<span class="lineNum"> 186 </span> : }; -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : // The standard only requires that operator== must be an -<span class="lineNum"> 189 </span> : // equivalence relation. In this implementation two fpos<StateT> -<span class="lineNum"> 190 </span> : // objects belong to the same equivalence class if the contained -<span class="lineNum"> 191 </span> : // offsets compare equal. -<span class="lineNum"> 192 </span> : /// Test if equivalent to another position. -<span class="lineNum"> 193 </span> : template<typename _StateT> -<span class="lineNum"> 194 </span> : inline bool -<span class="lineNum"> 195 </span> : operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) -<span class="lineNum"> 196 </span> : { return streamoff(__lhs) == streamoff(__rhs); } -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : template<typename _StateT> -<span class="lineNum"> 199 </span> : inline bool -<span class="lineNum"> 200 </span> : operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) -<span class="lineNum"> 201 </span> : { return streamoff(__lhs) != streamoff(__rhs); } -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : // Clauses 21.1.3.1 and 21.1.3.2 describe streampos and wstreampos -<span class="lineNum"> 204 </span> : // as implementation defined types, but clause 27.2 requires that -<span class="lineNum"> 205 </span> : // they must both be typedefs for fpos<mbstate_t> -<span class="lineNum"> 206 </span> : /// File position for char streams. -<span class="lineNum"> 207 </span> : typedef fpos<mbstate_t> streampos; -<span class="lineNum"> 208 </span> : /// File position for wchar_t streams. -<span class="lineNum"> 209 </span> : typedef fpos<mbstate_t> wstreampos; -<span class="lineNum"> 210 </span> : -<span class="lineNum"> 211 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html deleted file mode 100644 index bb0c409..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html +++ /dev/null @@ -1,5703 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_algo.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_algo.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">226</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">85.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">192</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Algorithm implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_algo.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_ALGO_H -<span class="lineNum"> 63 </span> : #define _STL_ALGO_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <cstdlib> // for rand -<span class="lineNum"> 66 </span> : #include <bits/algorithmfwd.h> -<span class="lineNum"> 67 </span> : #include <bits/stl_heap.h> -<span class="lineNum"> 68 </span> : #include <bits/stl_tempbuf.h> // for _Temporary_buffer -<span class="lineNum"> 69 </span> : #include <debug/debug.h> -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : // See concept_check.h for the __glibcxx_*_requires macros. -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : /** -<span class="lineNum"> 76 </span> : * @brief Find the median of three values. -<span class="lineNum"> 77 </span> : * @param a A value. -<span class="lineNum"> 78 </span> : * @param b A value. -<span class="lineNum"> 79 </span> : * @param c A value. -<span class="lineNum"> 80 </span> : * @return One of @p a, @p b or @p c. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n -<span class="lineNum"> 83 </span> : * then the value returned will be @c m. -<span class="lineNum"> 84 </span> : * This is an SGI extension. -<span class="lineNum"> 85 </span> : * @ingroup SGIextensions -<span class="lineNum"> 86 </span> : */ -<span class="lineNum"> 87 </span> : template<typename _Tp> -<span class="lineNum"> 88 </span> : inline const _Tp& -<span class="lineNum"> 89 </span><span class="lineCov"> 133 : __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)</span> -<span class="lineNum"> 90 </span> : { -<span class="lineNum"> 91 </span> : // concept requirements -<span class="lineNum"> 92 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) -<span class="lineNum"> 93 </span><span class="lineCov"> 133 : if (__a < __b)</span> -<span class="lineNum"> 94 </span><span class="lineCov"> 132 : if (__b < __c)</span> -<span class="lineNum"> 95 </span><span class="lineCov"> 132 : return __b;</span> -<span class="lineNum"> 96 </span><span class="lineNoCov"> 0 : else if (__a < __c)</span> -<span class="lineNum"> 97 </span><span class="lineNoCov"> 0 : return __c;</span> -<span class="lineNum"> 98 </span> : else -<span class="lineNum"> 99 </span><span class="lineNoCov"> 0 : return __a;</span> -<span class="lineNum"> 100 </span><span class="lineCov"> 1 : else if (__a < __c)</span> -<span class="lineNum"> 101 </span><span class="lineNoCov"> 0 : return __a;</span> -<span class="lineNum"> 102 </span><span class="lineCov"> 1 : else if (__b < __c)</span> -<span class="lineNum"> 103 </span><span class="lineNoCov"> 0 : return __c;</span> -<span class="lineNum"> 104 </span> : else -<span class="lineNum"> 105 </span><span class="lineCov"> 1 : return __b;</span> -<span class="lineNum"> 106 </span> : } -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : /** -<span class="lineNum"> 109 </span> : * @brief Find the median of three values using a predicate for comparison. -<span class="lineNum"> 110 </span> : * @param a A value. -<span class="lineNum"> 111 </span> : * @param b A value. -<span class="lineNum"> 112 </span> : * @param c A value. -<span class="lineNum"> 113 </span> : * @param comp A binary predicate. -<span class="lineNum"> 114 </span> : * @return One of @p a, @p b or @p c. -<span class="lineNum"> 115 </span> : * -<span class="lineNum"> 116 </span> : * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m) -<span class="lineNum"> 117 </span> : * and @p comp(m,n) are both true then the value returned will be @c m. -<span class="lineNum"> 118 </span> : * This is an SGI extension. -<span class="lineNum"> 119 </span> : * @ingroup SGIextensions -<span class="lineNum"> 120 </span> : */ -<span class="lineNum"> 121 </span> : template<typename _Tp, typename _Compare> -<span class="lineNum"> 122 </span> : inline const _Tp& -<span class="lineNum"> 123 </span><span class="lineCov"> 710 : __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)</span> -<span class="lineNum"> 124 </span> : { -<span class="lineNum"> 125 </span> : // concept requirements -<span class="lineNum"> 126 </span> : __glibcxx_function_requires(_BinaryFunctionConcept<_Compare, bool, -<span class="lineNum"> 127 </span> : _Tp, _Tp>) -<span class="lineNum"> 128 </span><span class="lineCov"> 710 : if (__comp(__a, __b))</span> -<span class="lineNum"> 129 </span><span class="lineCov"> 433 : if (__comp(__b, __c))</span> -<span class="lineNum"> 130 </span><span class="lineCov"> 143 : return __b;</span> -<span class="lineNum"> 131 </span><span class="lineCov"> 290 : else if (__comp(__a, __c))</span> -<span class="lineNum"> 132 </span><span class="lineCov"> 54 : return __c;</span> -<span class="lineNum"> 133 </span> : else -<span class="lineNum"> 134 </span><span class="lineCov"> 236 : return __a;</span> -<span class="lineNum"> 135 </span><span class="lineCov"> 277 : else if (__comp(__a, __c))</span> -<span class="lineNum"> 136 </span><span class="lineCov"> 81 : return __a;</span> -<span class="lineNum"> 137 </span><span class="lineCov"> 196 : else if (__comp(__b, __c))</span> -<span class="lineNum"> 138 </span><span class="lineCov"> 99 : return __c;</span> -<span class="lineNum"> 139 </span> : else -<span class="lineNum"> 140 </span><span class="lineCov"> 97 : return __b;</span> -<span class="lineNum"> 141 </span> : } -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : // for_each -<span class="lineNum"> 144 </span> : -<span class="lineNum"> 145 </span> : /// This is an overload used by find() for the Input Iterator case. -<span class="lineNum"> 146 </span> : template<typename _InputIterator, typename _Tp> -<span class="lineNum"> 147 </span> : inline _InputIterator -<span class="lineNum"> 148 </span> : __find(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 149 </span> : const _Tp& __val, input_iterator_tag) -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span> : while (__first != __last && !(*__first == __val)) -<span class="lineNum"> 152 </span> : ++__first; -<span class="lineNum"> 153 </span> : return __first; -<span class="lineNum"> 154 </span> : } -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : /// This is an overload used by find_if() for the Input Iterator case. -<span class="lineNum"> 157 </span> : template<typename _InputIterator, typename _Predicate> -<span class="lineNum"> 158 </span> : inline _InputIterator -<span class="lineNum"> 159 </span> : __find_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 160 </span><span class="lineCov"> 3 : _Predicate __pred, input_iterator_tag)</span> -<span class="lineNum"> 161 </span> : { -<span class="lineNum"> 162 </span><span class="lineCov"> 7 : while (__first != __last && !bool(__pred(*__first)))</span> -<span class="lineNum"> 163 </span><span class="lineCov"> 1 : ++__first;</span> -<span class="lineNum"> 164 </span><span class="lineCov"> 3 : return __first;</span> -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /// This is an overload used by find() for the RAI case. -<span class="lineNum"> 168 </span> : template<typename _RandomAccessIterator, typename _Tp> -<span class="lineNum"> 169 </span> : _RandomAccessIterator -<span class="lineNum"> 170 </span> : __find(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 171 </span><span class="lineCov"> 3362 : const _Tp& __val, random_access_iterator_tag)</span> -<span class="lineNum"> 172 </span> : { -<span class="lineNum"> 173 </span> : typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 174 </span><span class="lineCov"> 3362 : __trip_count = (__last - __first) >> 2;</span> -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span><span class="lineCov"> 5967 : for (; __trip_count > 0; --__trip_count)</span> -<span class="lineNum"> 177 </span> : { -<span class="lineNum"> 178 </span><span class="lineCov"> 3337 : if (*__first == __val)</span> -<span class="lineNum"> 179 </span><span class="lineCov"> 42 : return __first;</span> -<span class="lineNum"> 180 </span><span class="lineCov"> 3295 : ++__first;</span> -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span><span class="lineCov"> 3295 : if (*__first == __val)</span> -<span class="lineNum"> 183 </span><span class="lineCov"> 16 : return __first;</span> -<span class="lineNum"> 184 </span><span class="lineCov"> 3279 : ++__first;</span> -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span><span class="lineCov"> 3279 : if (*__first == __val)</span> -<span class="lineNum"> 187 </span><span class="lineCov"> 42 : return __first;</span> -<span class="lineNum"> 188 </span><span class="lineCov"> 3237 : ++__first;</span> -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span><span class="lineCov"> 3237 : if (*__first == __val)</span> -<span class="lineNum"> 191 </span><span class="lineCov"> 632 : return __first;</span> -<span class="lineNum"> 192 </span><span class="lineCov"> 2605 : ++__first;</span> -<span class="lineNum"> 193 </span> : } -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span><span class="lineCov"> 2630 : switch (__last - __first)</span> -<span class="lineNum"> 196 </span> : { -<span class="lineNum"> 197 </span> : case 3: -<span class="lineNum"> 198 </span><span class="lineCov"> 107 : if (*__first == __val)</span> -<span class="lineNum"> 199 </span><span class="lineNoCov"> 0 : return __first;</span> -<span class="lineNum"> 200 </span><span class="lineCov"> 107 : ++__first;</span> -<span class="lineNum"> 201 </span> : case 2: -<span class="lineNum"> 202 </span><span class="lineCov"> 243 : if (*__first == __val)</span> -<span class="lineNum"> 203 </span><span class="lineNoCov"> 0 : return __first;</span> -<span class="lineNum"> 204 </span><span class="lineCov"> 243 : ++__first;</span> -<span class="lineNum"> 205 </span> : case 1: -<span class="lineNum"> 206 </span><span class="lineCov"> 370 : if (*__first == __val)</span> -<span class="lineNum"> 207 </span><span class="lineCov"> 370 : return __first;</span> -<span class="lineNum"> 208 </span><span class="lineNoCov"> 0 : ++__first;</span> -<span class="lineNum"> 209 </span> : case 0: -<span class="lineNum"> 210 </span> : default: -<span class="lineNum"> 211 </span><span class="lineCov"> 2260 : return __last;</span> -<span class="lineNum"> 212 </span> : } -<span class="lineNum"> 213 </span> : } -<span class="lineNum"> 214 </span> : -<span class="lineNum"> 215 </span> : /// This is an overload used by find_if() for the RAI case. -<span class="lineNum"> 216 </span> : template<typename _RandomAccessIterator, typename _Predicate> -<span class="lineNum"> 217 </span> : _RandomAccessIterator -<span class="lineNum"> 218 </span> : __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 219 </span> : _Predicate __pred, random_access_iterator_tag) -<span class="lineNum"> 220 </span> : { -<span class="lineNum"> 221 </span> : typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 222 </span> : __trip_count = (__last - __first) >> 2; -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : for (; __trip_count > 0; --__trip_count) -<span class="lineNum"> 225 </span> : { -<span class="lineNum"> 226 </span> : if (__pred(*__first)) -<span class="lineNum"> 227 </span> : return __first; -<span class="lineNum"> 228 </span> : ++__first; -<span class="lineNum"> 229 </span> : -<span class="lineNum"> 230 </span> : if (__pred(*__first)) -<span class="lineNum"> 231 </span> : return __first; -<span class="lineNum"> 232 </span> : ++__first; -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : if (__pred(*__first)) -<span class="lineNum"> 235 </span> : return __first; -<span class="lineNum"> 236 </span> : ++__first; -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : if (__pred(*__first)) -<span class="lineNum"> 239 </span> : return __first; -<span class="lineNum"> 240 </span> : ++__first; -<span class="lineNum"> 241 </span> : } -<span class="lineNum"> 242 </span> : -<span class="lineNum"> 243 </span> : switch (__last - __first) -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : case 3: -<span class="lineNum"> 246 </span> : if (__pred(*__first)) -<span class="lineNum"> 247 </span> : return __first; -<span class="lineNum"> 248 </span> : ++__first; -<span class="lineNum"> 249 </span> : case 2: -<span class="lineNum"> 250 </span> : if (__pred(*__first)) -<span class="lineNum"> 251 </span> : return __first; -<span class="lineNum"> 252 </span> : ++__first; -<span class="lineNum"> 253 </span> : case 1: -<span class="lineNum"> 254 </span> : if (__pred(*__first)) -<span class="lineNum"> 255 </span> : return __first; -<span class="lineNum"> 256 </span> : ++__first; -<span class="lineNum"> 257 </span> : case 0: -<span class="lineNum"> 258 </span> : default: -<span class="lineNum"> 259 </span> : return __last; -<span class="lineNum"> 260 </span> : } -<span class="lineNum"> 261 </span> : } -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : // set_difference -<span class="lineNum"> 264 </span> : // set_intersection -<span class="lineNum"> 265 </span> : // set_symmetric_difference -<span class="lineNum"> 266 </span> : // set_union -<span class="lineNum"> 267 </span> : // for_each -<span class="lineNum"> 268 </span> : // find -<span class="lineNum"> 269 </span> : // find_if -<span class="lineNum"> 270 </span> : // find_first_of -<span class="lineNum"> 271 </span> : // adjacent_find -<span class="lineNum"> 272 </span> : // count -<span class="lineNum"> 273 </span> : // count_if -<span class="lineNum"> 274 </span> : // search -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : /** -<span class="lineNum"> 277 </span> : * This is an uglified -<span class="lineNum"> 278 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) -<span class="lineNum"> 279 </span> : * overloaded for forward iterators. -<span class="lineNum"> 280 </span> : */ -<span class="lineNum"> 281 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp> -<span class="lineNum"> 282 </span> : _ForwardIterator -<span class="lineNum"> 283 </span> : __search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 284 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 285 </span> : std::forward_iterator_tag) -<span class="lineNum"> 286 </span> : { -<span class="lineNum"> 287 </span> : __first = _GLIBCXX_STD_P::find(__first, __last, __val); -<span class="lineNum"> 288 </span> : while (__first != __last) -<span class="lineNum"> 289 </span> : { -<span class="lineNum"> 290 </span> : typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 291 </span> : __n = __count; -<span class="lineNum"> 292 </span> : _ForwardIterator __i = __first; -<span class="lineNum"> 293 </span> : ++__i; -<span class="lineNum"> 294 </span> : while (__i != __last && __n != 1 && *__i == __val) -<span class="lineNum"> 295 </span> : { -<span class="lineNum"> 296 </span> : ++__i; -<span class="lineNum"> 297 </span> : --__n; -<span class="lineNum"> 298 </span> : } -<span class="lineNum"> 299 </span> : if (__n == 1) -<span class="lineNum"> 300 </span> : return __first; -<span class="lineNum"> 301 </span> : if (__i == __last) -<span class="lineNum"> 302 </span> : return __last; -<span class="lineNum"> 303 </span> : __first = _GLIBCXX_STD_P::find(++__i, __last, __val); -<span class="lineNum"> 304 </span> : } -<span class="lineNum"> 305 </span> : return __last; -<span class="lineNum"> 306 </span> : } -<span class="lineNum"> 307 </span> : -<span class="lineNum"> 308 </span> : /** -<span class="lineNum"> 309 </span> : * This is an uglified -<span class="lineNum"> 310 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) -<span class="lineNum"> 311 </span> : * overloaded for random access iterators. -<span class="lineNum"> 312 </span> : */ -<span class="lineNum"> 313 </span> : template<typename _RandomAccessIter, typename _Integer, typename _Tp> -<span class="lineNum"> 314 </span> : _RandomAccessIter -<span class="lineNum"> 315 </span> : __search_n(_RandomAccessIter __first, _RandomAccessIter __last, -<span class="lineNum"> 316 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 317 </span> : std::random_access_iterator_tag) -<span class="lineNum"> 318 </span> : { -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : typedef typename std::iterator_traits<_RandomAccessIter>::difference_type -<span class="lineNum"> 321 </span> : _DistanceType; -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : _DistanceType __tailSize = __last - __first; -<span class="lineNum"> 324 </span> : const _DistanceType __pattSize = __count; -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 327 </span> : return __last; -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : const _DistanceType __skipOffset = __pattSize - 1; -<span class="lineNum"> 330 </span> : _RandomAccessIter __lookAhead = __first + __skipOffset; -<span class="lineNum"> 331 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 332 </span> : -<span class="lineNum"> 333 </span> : while (1) // the main loop... -<span class="lineNum"> 334 </span> : { -<span class="lineNum"> 335 </span> : // __lookAhead here is always pointing to the last element of next -<span class="lineNum"> 336 </span> : // possible match. -<span class="lineNum"> 337 </span> : while (!(*__lookAhead == __val)) // the skip loop... -<span class="lineNum"> 338 </span> : { -<span class="lineNum"> 339 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 340 </span> : return __last; // Failure -<span class="lineNum"> 341 </span> : __lookAhead += __pattSize; -<span class="lineNum"> 342 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 343 </span> : } -<span class="lineNum"> 344 </span> : _DistanceType __remainder = __skipOffset; -<span class="lineNum"> 345 </span> : for (_RandomAccessIter __backTrack = __lookAhead - 1; -<span class="lineNum"> 346 </span> : *__backTrack == __val; --__backTrack) -<span class="lineNum"> 347 </span> : { -<span class="lineNum"> 348 </span> : if (--__remainder == 0) -<span class="lineNum"> 349 </span> : return (__lookAhead - __skipOffset); // Success -<span class="lineNum"> 350 </span> : } -<span class="lineNum"> 351 </span> : if (__remainder > __tailSize) -<span class="lineNum"> 352 </span> : return __last; // Failure -<span class="lineNum"> 353 </span> : __lookAhead += __remainder; -<span class="lineNum"> 354 </span> : __tailSize -= __remainder; -<span class="lineNum"> 355 </span> : } -<span class="lineNum"> 356 </span> : } -<span class="lineNum"> 357 </span> : -<span class="lineNum"> 358 </span> : // search_n -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : /** -<span class="lineNum"> 361 </span> : * This is an uglified -<span class="lineNum"> 362 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, -<span class="lineNum"> 363 </span> : * _BinaryPredicate) -<span class="lineNum"> 364 </span> : * overloaded for forward iterators. -<span class="lineNum"> 365 </span> : */ -<span class="lineNum"> 366 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp, -<span class="lineNum"> 367 </span> : typename _BinaryPredicate> -<span class="lineNum"> 368 </span> : _ForwardIterator -<span class="lineNum"> 369 </span> : __search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 370 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 371 </span> : _BinaryPredicate __binary_pred, std::forward_iterator_tag) -<span class="lineNum"> 372 </span> : { -<span class="lineNum"> 373 </span> : while (__first != __last && !bool(__binary_pred(*__first, __val))) -<span class="lineNum"> 374 </span> : ++__first; -<span class="lineNum"> 375 </span> : -<span class="lineNum"> 376 </span> : while (__first != __last) -<span class="lineNum"> 377 </span> : { -<span class="lineNum"> 378 </span> : typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 379 </span> : __n = __count; -<span class="lineNum"> 380 </span> : _ForwardIterator __i = __first; -<span class="lineNum"> 381 </span> : ++__i; -<span class="lineNum"> 382 </span> : while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))) -<span class="lineNum"> 383 </span> : { -<span class="lineNum"> 384 </span> : ++__i; -<span class="lineNum"> 385 </span> : --__n; -<span class="lineNum"> 386 </span> : } -<span class="lineNum"> 387 </span> : if (__n == 1) -<span class="lineNum"> 388 </span> : return __first; -<span class="lineNum"> 389 </span> : if (__i == __last) -<span class="lineNum"> 390 </span> : return __last; -<span class="lineNum"> 391 </span> : __first = ++__i; -<span class="lineNum"> 392 </span> : while (__first != __last -<span class="lineNum"> 393 </span> : && !bool(__binary_pred(*__first, __val))) -<span class="lineNum"> 394 </span> : ++__first; -<span class="lineNum"> 395 </span> : } -<span class="lineNum"> 396 </span> : return __last; -<span class="lineNum"> 397 </span> : } -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : /** -<span class="lineNum"> 400 </span> : * This is an uglified -<span class="lineNum"> 401 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, -<span class="lineNum"> 402 </span> : * _BinaryPredicate) -<span class="lineNum"> 403 </span> : * overloaded for random access iterators. -<span class="lineNum"> 404 </span> : */ -<span class="lineNum"> 405 </span> : template<typename _RandomAccessIter, typename _Integer, typename _Tp, -<span class="lineNum"> 406 </span> : typename _BinaryPredicate> -<span class="lineNum"> 407 </span> : _RandomAccessIter -<span class="lineNum"> 408 </span> : __search_n(_RandomAccessIter __first, _RandomAccessIter __last, -<span class="lineNum"> 409 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 410 </span> : _BinaryPredicate __binary_pred, std::random_access_iterator_tag) -<span class="lineNum"> 411 </span> : { -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span> : typedef typename std::iterator_traits<_RandomAccessIter>::difference_type -<span class="lineNum"> 414 </span> : _DistanceType; -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : _DistanceType __tailSize = __last - __first; -<span class="lineNum"> 417 </span> : const _DistanceType __pattSize = __count; -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 420 </span> : return __last; -<span class="lineNum"> 421 </span> : -<span class="lineNum"> 422 </span> : const _DistanceType __skipOffset = __pattSize - 1; -<span class="lineNum"> 423 </span> : _RandomAccessIter __lookAhead = __first + __skipOffset; -<span class="lineNum"> 424 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : while (1) // the main loop... -<span class="lineNum"> 427 </span> : { -<span class="lineNum"> 428 </span> : // __lookAhead here is always pointing to the last element of next -<span class="lineNum"> 429 </span> : // possible match. -<span class="lineNum"> 430 </span> : while (!bool(__binary_pred(*__lookAhead, __val))) // the skip loop... -<span class="lineNum"> 431 </span> : { -<span class="lineNum"> 432 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 433 </span> : return __last; // Failure -<span class="lineNum"> 434 </span> : __lookAhead += __pattSize; -<span class="lineNum"> 435 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 436 </span> : } -<span class="lineNum"> 437 </span> : _DistanceType __remainder = __skipOffset; -<span class="lineNum"> 438 </span> : for (_RandomAccessIter __backTrack = __lookAhead - 1; -<span class="lineNum"> 439 </span> : __binary_pred(*__backTrack, __val); --__backTrack) -<span class="lineNum"> 440 </span> : { -<span class="lineNum"> 441 </span> : if (--__remainder == 0) -<span class="lineNum"> 442 </span> : return (__lookAhead - __skipOffset); // Success -<span class="lineNum"> 443 </span> : } -<span class="lineNum"> 444 </span> : if (__remainder > __tailSize) -<span class="lineNum"> 445 </span> : return __last; // Failure -<span class="lineNum"> 446 </span> : __lookAhead += __remainder; -<span class="lineNum"> 447 </span> : __tailSize -= __remainder; -<span class="lineNum"> 448 </span> : } -<span class="lineNum"> 449 </span> : } -<span class="lineNum"> 450 </span> : -<span class="lineNum"> 451 </span> : // find_end for forward iterators. -<span class="lineNum"> 452 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 453 </span> : _ForwardIterator1 -<span class="lineNum"> 454 </span> : __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 455 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 456 </span> : forward_iterator_tag, forward_iterator_tag) -<span class="lineNum"> 457 </span> : { -<span class="lineNum"> 458 </span> : if (__first2 == __last2) -<span class="lineNum"> 459 </span> : return __last1; -<span class="lineNum"> 460 </span> : else -<span class="lineNum"> 461 </span> : { -<span class="lineNum"> 462 </span> : _ForwardIterator1 __result = __last1; -<span class="lineNum"> 463 </span> : while (1) -<span class="lineNum"> 464 </span> : { -<span class="lineNum"> 465 </span> : _ForwardIterator1 __new_result -<span class="lineNum"> 466 </span> : = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); -<span class="lineNum"> 467 </span> : if (__new_result == __last1) -<span class="lineNum"> 468 </span> : return __result; -<span class="lineNum"> 469 </span> : else -<span class="lineNum"> 470 </span> : { -<span class="lineNum"> 471 </span> : __result = __new_result; -<span class="lineNum"> 472 </span> : __first1 = __new_result; -<span class="lineNum"> 473 </span> : ++__first1; -<span class="lineNum"> 474 </span> : } -<span class="lineNum"> 475 </span> : } -<span class="lineNum"> 476 </span> : } -<span class="lineNum"> 477 </span> : } -<span class="lineNum"> 478 </span> : -<span class="lineNum"> 479 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2, -<span class="lineNum"> 480 </span> : typename _BinaryPredicate> -<span class="lineNum"> 481 </span> : _ForwardIterator1 -<span class="lineNum"> 482 </span> : __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 483 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 484 </span> : forward_iterator_tag, forward_iterator_tag, -<span class="lineNum"> 485 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 486 </span> : { -<span class="lineNum"> 487 </span> : if (__first2 == __last2) -<span class="lineNum"> 488 </span> : return __last1; -<span class="lineNum"> 489 </span> : else -<span class="lineNum"> 490 </span> : { -<span class="lineNum"> 491 </span> : _ForwardIterator1 __result = __last1; -<span class="lineNum"> 492 </span> : while (1) -<span class="lineNum"> 493 </span> : { -<span class="lineNum"> 494 </span> : _ForwardIterator1 __new_result -<span class="lineNum"> 495 </span> : = _GLIBCXX_STD_P::search(__first1, __last1, __first2, -<span class="lineNum"> 496 </span> : __last2, __comp); -<span class="lineNum"> 497 </span> : if (__new_result == __last1) -<span class="lineNum"> 498 </span> : return __result; -<span class="lineNum"> 499 </span> : else -<span class="lineNum"> 500 </span> : { -<span class="lineNum"> 501 </span> : __result = __new_result; -<span class="lineNum"> 502 </span> : __first1 = __new_result; -<span class="lineNum"> 503 </span> : ++__first1; -<span class="lineNum"> 504 </span> : } -<span class="lineNum"> 505 </span> : } -<span class="lineNum"> 506 </span> : } -<span class="lineNum"> 507 </span> : } -<span class="lineNum"> 508 </span> : -<span class="lineNum"> 509 </span> : // find_end for bidirectional iterators (much faster). -<span class="lineNum"> 510 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2> -<span class="lineNum"> 511 </span> : _BidirectionalIterator1 -<span class="lineNum"> 512 </span> : __find_end(_BidirectionalIterator1 __first1, -<span class="lineNum"> 513 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 514 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 515 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 516 </span> : bidirectional_iterator_tag, bidirectional_iterator_tag) -<span class="lineNum"> 517 </span> : { -<span class="lineNum"> 518 </span> : // concept requirements -<span class="lineNum"> 519 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 520 </span> : _BidirectionalIterator1>) -<span class="lineNum"> 521 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 522 </span> : _BidirectionalIterator2>) -<span class="lineNum"> 523 </span> : -<span class="lineNum"> 524 </span> : typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; -<span class="lineNum"> 525 </span> : typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; -<span class="lineNum"> 526 </span> : -<span class="lineNum"> 527 </span> : _RevIterator1 __rlast1(__first1); -<span class="lineNum"> 528 </span> : _RevIterator2 __rlast2(__first2); -<span class="lineNum"> 529 </span> : _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), -<span class="lineNum"> 530 </span> : __rlast1, -<span class="lineNum"> 531 </span> : _RevIterator2(__last2), -<span class="lineNum"> 532 </span> : __rlast2); -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : if (__rresult == __rlast1) -<span class="lineNum"> 535 </span> : return __last1; -<span class="lineNum"> 536 </span> : else -<span class="lineNum"> 537 </span> : { -<span class="lineNum"> 538 </span> : _BidirectionalIterator1 __result = __rresult.base(); -<span class="lineNum"> 539 </span> : std::advance(__result, -std::distance(__first2, __last2)); -<span class="lineNum"> 540 </span> : return __result; -<span class="lineNum"> 541 </span> : } -<span class="lineNum"> 542 </span> : } -<span class="lineNum"> 543 </span> : -<span class="lineNum"> 544 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 545 </span> : typename _BinaryPredicate> -<span class="lineNum"> 546 </span> : _BidirectionalIterator1 -<span class="lineNum"> 547 </span> : __find_end(_BidirectionalIterator1 __first1, -<span class="lineNum"> 548 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 549 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 550 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 551 </span> : bidirectional_iterator_tag, bidirectional_iterator_tag, -<span class="lineNum"> 552 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 553 </span> : { -<span class="lineNum"> 554 </span> : // concept requirements -<span class="lineNum"> 555 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 556 </span> : _BidirectionalIterator1>) -<span class="lineNum"> 557 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 558 </span> : _BidirectionalIterator2>) -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; -<span class="lineNum"> 561 </span> : typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; -<span class="lineNum"> 562 </span> : -<span class="lineNum"> 563 </span> : _RevIterator1 __rlast1(__first1); -<span class="lineNum"> 564 </span> : _RevIterator2 __rlast2(__first2); -<span class="lineNum"> 565 </span> : _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, -<span class="lineNum"> 566 </span> : _RevIterator2(__last2), __rlast2, -<span class="lineNum"> 567 </span> : __comp); -<span class="lineNum"> 568 </span> : -<span class="lineNum"> 569 </span> : if (__rresult == __rlast1) -<span class="lineNum"> 570 </span> : return __last1; -<span class="lineNum"> 571 </span> : else -<span class="lineNum"> 572 </span> : { -<span class="lineNum"> 573 </span> : _BidirectionalIterator1 __result = __rresult.base(); -<span class="lineNum"> 574 </span> : std::advance(__result, -std::distance(__first2, __last2)); -<span class="lineNum"> 575 </span> : return __result; -<span class="lineNum"> 576 </span> : } -<span class="lineNum"> 577 </span> : } -<span class="lineNum"> 578 </span> : -<span class="lineNum"> 579 </span> : /** -<span class="lineNum"> 580 </span> : * @brief Find last matching subsequence in a sequence. -<span class="lineNum"> 581 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 582 </span> : * @param last1 End of range to search. -<span class="lineNum"> 583 </span> : * @param first2 Start of sequence to match. -<span class="lineNum"> 584 </span> : * @param last2 End of sequence to match. -<span class="lineNum"> 585 </span> : * @return The last iterator @c i in the range -<span class="lineNum"> 586 </span> : * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) -<span class="lineNum"> 587 </span> : * for each @c N in the range @p [0,last2-first2), or @p last1 if no -<span class="lineNum"> 588 </span> : * such iterator exists. -<span class="lineNum"> 589 </span> : * -<span class="lineNum"> 590 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 591 </span> : * equal value-by-value with the sequence given by @p [first2,last2) and -<span class="lineNum"> 592 </span> : * returns an iterator to the first element of the sub-sequence, or -<span class="lineNum"> 593 </span> : * @p last1 if the sub-sequence is not found. The sub-sequence will be the -<span class="lineNum"> 594 </span> : * last such subsequence contained in [first,last1). -<span class="lineNum"> 595 </span> : * -<span class="lineNum"> 596 </span> : * Because the sub-sequence must lie completely within the range -<span class="lineNum"> 597 </span> : * @p [first1,last1) it must start at a position less than -<span class="lineNum"> 598 </span> : * @p last1-(last2-first2) where @p last2-first2 is the length of the -<span class="lineNum"> 599 </span> : * sub-sequence. -<span class="lineNum"> 600 </span> : * This means that the returned iterator @c i will be in the range -<span class="lineNum"> 601 </span> : * @p [first1,last1-(last2-first2)) -<span class="lineNum"> 602 </span> : */ -<span class="lineNum"> 603 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 604 </span> : inline _ForwardIterator1 -<span class="lineNum"> 605 </span> : find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 606 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2) -<span class="lineNum"> 607 </span> : { -<span class="lineNum"> 608 </span> : // concept requirements -<span class="lineNum"> 609 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 610 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 611 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 612 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 613 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 614 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 615 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 616 </span> : -<span class="lineNum"> 617 </span> : return std::__find_end(__first1, __last1, __first2, __last2, -<span class="lineNum"> 618 </span> : std::__iterator_category(__first1), -<span class="lineNum"> 619 </span> : std::__iterator_category(__first2)); -<span class="lineNum"> 620 </span> : } -<span class="lineNum"> 621 </span> : -<span class="lineNum"> 622 </span> : /** -<span class="lineNum"> 623 </span> : * @brief Find last matching subsequence in a sequence using a predicate. -<span class="lineNum"> 624 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 625 </span> : * @param last1 End of range to search. -<span class="lineNum"> 626 </span> : * @param first2 Start of sequence to match. -<span class="lineNum"> 627 </span> : * @param last2 End of sequence to match. -<span class="lineNum"> 628 </span> : * @param comp The predicate to use. -<span class="lineNum"> 629 </span> : * @return The last iterator @c i in the range -<span class="lineNum"> 630 </span> : * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p -<span class="lineNum"> 631 </span> : * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or -<span class="lineNum"> 632 </span> : * @p last1 if no such iterator exists. -<span class="lineNum"> 633 </span> : * -<span class="lineNum"> 634 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 635 </span> : * equal value-by-value with the sequence given by @p [first2,last2) using -<span class="lineNum"> 636 </span> : * comp as a predicate and returns an iterator to the first element of the -<span class="lineNum"> 637 </span> : * sub-sequence, or @p last1 if the sub-sequence is not found. The -<span class="lineNum"> 638 </span> : * sub-sequence will be the last such subsequence contained in -<span class="lineNum"> 639 </span> : * [first,last1). -<span class="lineNum"> 640 </span> : * -<span class="lineNum"> 641 </span> : * Because the sub-sequence must lie completely within the range -<span class="lineNum"> 642 </span> : * @p [first1,last1) it must start at a position less than -<span class="lineNum"> 643 </span> : * @p last1-(last2-first2) where @p last2-first2 is the length of the -<span class="lineNum"> 644 </span> : * sub-sequence. -<span class="lineNum"> 645 </span> : * This means that the returned iterator @c i will be in the range -<span class="lineNum"> 646 </span> : * @p [first1,last1-(last2-first2)) -<span class="lineNum"> 647 </span> : */ -<span class="lineNum"> 648 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2, -<span class="lineNum"> 649 </span> : typename _BinaryPredicate> -<span class="lineNum"> 650 </span> : inline _ForwardIterator1 -<span class="lineNum"> 651 </span> : find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 652 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 653 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 654 </span> : { -<span class="lineNum"> 655 </span> : // concept requirements -<span class="lineNum"> 656 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 657 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 658 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 659 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 660 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 661 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 662 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 663 </span> : -<span class="lineNum"> 664 </span> : return std::__find_end(__first1, __last1, __first2, __last2, -<span class="lineNum"> 665 </span> : std::__iterator_category(__first1), -<span class="lineNum"> 666 </span> : std::__iterator_category(__first2), -<span class="lineNum"> 667 </span> : __comp); -<span class="lineNum"> 668 </span> : } -<span class="lineNum"> 669 </span> : -<span class="lineNum"> 670 </span> : -<span class="lineNum"> 671 </span> : /** -<span class="lineNum"> 672 </span> : * @brief Copy a sequence, removing elements of a given value. -<span class="lineNum"> 673 </span> : * @param first An input iterator. -<span class="lineNum"> 674 </span> : * @param last An input iterator. -<span class="lineNum"> 675 </span> : * @param result An output iterator. -<span class="lineNum"> 676 </span> : * @param value The value to be removed. -<span class="lineNum"> 677 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 678 </span> : * -<span class="lineNum"> 679 </span> : * Copies each element in the range @p [first,last) not equal to @p value -<span class="lineNum"> 680 </span> : * to the range beginning at @p result. -<span class="lineNum"> 681 </span> : * remove_copy() is stable, so the relative order of elements that are -<span class="lineNum"> 682 </span> : * copied is unchanged. -<span class="lineNum"> 683 </span> : */ -<span class="lineNum"> 684 </span> : template<typename _InputIterator, typename _OutputIterator, typename _Tp> -<span class="lineNum"> 685 </span> : _OutputIterator -<span class="lineNum"> 686 </span> : remove_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 687 </span> : _OutputIterator __result, const _Tp& __value) -<span class="lineNum"> 688 </span> : { -<span class="lineNum"> 689 </span> : // concept requirements -<span class="lineNum"> 690 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 691 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 692 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 693 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 694 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 695 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 696 </span> : -<span class="lineNum"> 697 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 698 </span> : if (!(*__first == __value)) -<span class="lineNum"> 699 </span> : { -<span class="lineNum"> 700 </span> : *__result = *__first; -<span class="lineNum"> 701 </span> : ++__result; -<span class="lineNum"> 702 </span> : } -<span class="lineNum"> 703 </span> : return __result; -<span class="lineNum"> 704 </span> : } -<span class="lineNum"> 705 </span> : -<span class="lineNum"> 706 </span> : /** -<span class="lineNum"> 707 </span> : * @brief Copy a sequence, removing elements for which a predicate is true. -<span class="lineNum"> 708 </span> : * @param first An input iterator. -<span class="lineNum"> 709 </span> : * @param last An input iterator. -<span class="lineNum"> 710 </span> : * @param result An output iterator. -<span class="lineNum"> 711 </span> : * @param pred A predicate. -<span class="lineNum"> 712 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 713 </span> : * -<span class="lineNum"> 714 </span> : * Copies each element in the range @p [first,last) for which -<span class="lineNum"> 715 </span> : * @p pred returns false to the range beginning at @p result. -<span class="lineNum"> 716 </span> : * -<span class="lineNum"> 717 </span> : * remove_copy_if() is stable, so the relative order of elements that are -<span class="lineNum"> 718 </span> : * copied is unchanged. -<span class="lineNum"> 719 </span> : */ -<span class="lineNum"> 720 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 721 </span> : typename _Predicate> -<span class="lineNum"> 722 </span> : _OutputIterator -<span class="lineNum"> 723 </span> : remove_copy_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 724 </span><span class="lineCov"> 16 : _OutputIterator __result, _Predicate __pred)</span> -<span class="lineNum"> 725 </span> : { -<span class="lineNum"> 726 </span> : // concept requirements -<span class="lineNum"> 727 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 728 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 729 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 730 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 731 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 732 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 733 </span> : -<span class="lineNum"> 734 </span><span class="lineCov"> 80 : for (; __first != __last; ++__first)</span> -<span class="lineNum"> 735 </span><span class="lineCov"> 64 : if (!bool(__pred(*__first)))</span> -<span class="lineNum"> 736 </span> : { -<span class="lineNum"> 737 </span><span class="lineCov"> 48 : *__result = *__first;</span> -<span class="lineNum"> 738 </span><span class="lineCov"> 48 : ++__result;</span> -<span class="lineNum"> 739 </span> : } -<span class="lineNum"> 740 </span><span class="lineCov"> 16 : return __result;</span> -<span class="lineNum"> 741 </span> : } -<span class="lineNum"> 742 </span> : -<span class="lineNum"> 743 </span> : /** -<span class="lineNum"> 744 </span> : * @brief Remove elements from a sequence. -<span class="lineNum"> 745 </span> : * @param first An input iterator. -<span class="lineNum"> 746 </span> : * @param last An input iterator. -<span class="lineNum"> 747 </span> : * @param value The value to be removed. -<span class="lineNum"> 748 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 749 </span> : * -<span class="lineNum"> 750 </span> : * All elements equal to @p value are removed from the range -<span class="lineNum"> 751 </span> : * @p [first,last). -<span class="lineNum"> 752 </span> : * -<span class="lineNum"> 753 </span> : * remove() is stable, so the relative order of elements that are -<span class="lineNum"> 754 </span> : * not removed is unchanged. -<span class="lineNum"> 755 </span> : * -<span class="lineNum"> 756 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 757 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 758 </span> : */ -<span class="lineNum"> 759 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 760 </span> : _ForwardIterator -<span class="lineNum"> 761 </span> : remove(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 762 </span> : const _Tp& __value) -<span class="lineNum"> 763 </span> : { -<span class="lineNum"> 764 </span> : // concept requirements -<span class="lineNum"> 765 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 766 </span> : _ForwardIterator>) -<span class="lineNum"> 767 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 768 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 769 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 770 </span> : -<span class="lineNum"> 771 </span> : __first = _GLIBCXX_STD_P::find(__first, __last, __value); -<span class="lineNum"> 772 </span> : if(__first == __last) -<span class="lineNum"> 773 </span> : return __first; -<span class="lineNum"> 774 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 775 </span> : ++__first; -<span class="lineNum"> 776 </span> : for(; __first != __last; ++__first) -<span class="lineNum"> 777 </span> : if(!(*__first == __value)) -<span class="lineNum"> 778 </span> : { -<span class="lineNum"> 779 </span> : *__result = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 780 </span> : ++__result; -<span class="lineNum"> 781 </span> : } -<span class="lineNum"> 782 </span> : return __result; -<span class="lineNum"> 783 </span> : } -<span class="lineNum"> 784 </span> : -<span class="lineNum"> 785 </span> : /** -<span class="lineNum"> 786 </span> : * @brief Remove elements from a sequence using a predicate. -<span class="lineNum"> 787 </span> : * @param first A forward iterator. -<span class="lineNum"> 788 </span> : * @param last A forward iterator. -<span class="lineNum"> 789 </span> : * @param pred A predicate. -<span class="lineNum"> 790 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 791 </span> : * -<span class="lineNum"> 792 </span> : * All elements for which @p pred returns true are removed from the range -<span class="lineNum"> 793 </span> : * @p [first,last). -<span class="lineNum"> 794 </span> : * -<span class="lineNum"> 795 </span> : * remove_if() is stable, so the relative order of elements that are -<span class="lineNum"> 796 </span> : * not removed is unchanged. -<span class="lineNum"> 797 </span> : * -<span class="lineNum"> 798 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 799 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 800 </span> : */ -<span class="lineNum"> 801 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 802 </span> : _ForwardIterator -<span class="lineNum"> 803 </span> : remove_if(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 804 </span> : _Predicate __pred) -<span class="lineNum"> 805 </span> : { -<span class="lineNum"> 806 </span> : // concept requirements -<span class="lineNum"> 807 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 808 </span> : _ForwardIterator>) -<span class="lineNum"> 809 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 810 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 811 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 812 </span> : -<span class="lineNum"> 813 </span> : __first = _GLIBCXX_STD_P::find_if(__first, __last, __pred); -<span class="lineNum"> 814 </span> : if(__first == __last) -<span class="lineNum"> 815 </span> : return __first; -<span class="lineNum"> 816 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 817 </span> : ++__first; -<span class="lineNum"> 818 </span> : for(; __first != __last; ++__first) -<span class="lineNum"> 819 </span> : if(!bool(__pred(*__first))) -<span class="lineNum"> 820 </span> : { -<span class="lineNum"> 821 </span> : *__result = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 822 </span> : ++__result; -<span class="lineNum"> 823 </span> : } -<span class="lineNum"> 824 </span> : return __result; -<span class="lineNum"> 825 </span> : } -<span class="lineNum"> 826 </span> : -<span class="lineNum"> 827 </span> : /** -<span class="lineNum"> 828 </span> : * @brief Remove consecutive duplicate values from a sequence. -<span class="lineNum"> 829 </span> : * @param first A forward iterator. -<span class="lineNum"> 830 </span> : * @param last A forward iterator. -<span class="lineNum"> 831 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 832 </span> : * -<span class="lineNum"> 833 </span> : * Removes all but the first element from each group of consecutive -<span class="lineNum"> 834 </span> : * values that compare equal. -<span class="lineNum"> 835 </span> : * unique() is stable, so the relative order of elements that are -<span class="lineNum"> 836 </span> : * not removed is unchanged. -<span class="lineNum"> 837 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 838 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 839 </span> : */ -<span class="lineNum"> 840 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 841 </span> : _ForwardIterator -<span class="lineNum"> 842 </span> : unique(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 843 </span> : { -<span class="lineNum"> 844 </span> : // concept requirements -<span class="lineNum"> 845 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 846 </span> : _ForwardIterator>) -<span class="lineNum"> 847 </span> : __glibcxx_function_requires(_EqualityComparableConcept< -<span class="lineNum"> 848 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 849 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 850 </span> : -<span class="lineNum"> 851 </span> : // Skip the beginning, if already unique. -<span class="lineNum"> 852 </span> : __first = _GLIBCXX_STD_P::adjacent_find(__first, __last); -<span class="lineNum"> 853 </span> : if (__first == __last) -<span class="lineNum"> 854 </span> : return __last; -<span class="lineNum"> 855 </span> : -<span class="lineNum"> 856 </span> : // Do the real copy work. -<span class="lineNum"> 857 </span> : _ForwardIterator __dest = __first; -<span class="lineNum"> 858 </span> : ++__first; -<span class="lineNum"> 859 </span> : while (++__first != __last) -<span class="lineNum"> 860 </span> : if (!(*__dest == *__first)) -<span class="lineNum"> 861 </span> : *++__dest = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 862 </span> : return ++__dest; -<span class="lineNum"> 863 </span> : } -<span class="lineNum"> 864 </span> : -<span class="lineNum"> 865 </span> : /** -<span class="lineNum"> 866 </span> : * @brief Remove consecutive values from a sequence using a predicate. -<span class="lineNum"> 867 </span> : * @param first A forward iterator. -<span class="lineNum"> 868 </span> : * @param last A forward iterator. -<span class="lineNum"> 869 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 870 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 871 </span> : * -<span class="lineNum"> 872 </span> : * Removes all but the first element from each group of consecutive -<span class="lineNum"> 873 </span> : * values for which @p binary_pred returns true. -<span class="lineNum"> 874 </span> : * unique() is stable, so the relative order of elements that are -<span class="lineNum"> 875 </span> : * not removed is unchanged. -<span class="lineNum"> 876 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 877 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 878 </span> : */ -<span class="lineNum"> 879 </span> : template<typename _ForwardIterator, typename _BinaryPredicate> -<span class="lineNum"> 880 </span> : _ForwardIterator -<span class="lineNum"> 881 </span> : unique(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 882 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 883 </span> : { -<span class="lineNum"> 884 </span> : // concept requirements -<span class="lineNum"> 885 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 886 </span> : _ForwardIterator>) -<span class="lineNum"> 887 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 888 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 889 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 890 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 891 </span> : -<span class="lineNum"> 892 </span> : // Skip the beginning, if already unique. -<span class="lineNum"> 893 </span> : __first = _GLIBCXX_STD_P::adjacent_find(__first, __last, __binary_pred); -<span class="lineNum"> 894 </span> : if (__first == __last) -<span class="lineNum"> 895 </span> : return __last; -<span class="lineNum"> 896 </span> : -<span class="lineNum"> 897 </span> : // Do the real copy work. -<span class="lineNum"> 898 </span> : _ForwardIterator __dest = __first; -<span class="lineNum"> 899 </span> : ++__first; -<span class="lineNum"> 900 </span> : while (++__first != __last) -<span class="lineNum"> 901 </span> : if (!bool(__binary_pred(*__dest, *__first))) -<span class="lineNum"> 902 </span> : *++__dest = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 903 </span> : return ++__dest; -<span class="lineNum"> 904 </span> : } -<span class="lineNum"> 905 </span> : -<span class="lineNum"> 906 </span> : /** -<span class="lineNum"> 907 </span> : * This is an uglified unique_copy(_InputIterator, _InputIterator, -<span class="lineNum"> 908 </span> : * _OutputIterator) -<span class="lineNum"> 909 </span> : * overloaded for forward iterators and output iterator as result. -<span class="lineNum"> 910 </span> : */ -<span class="lineNum"> 911 </span> : template<typename _ForwardIterator, typename _OutputIterator> -<span class="lineNum"> 912 </span> : _OutputIterator -<span class="lineNum"> 913 </span> : __unique_copy(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 914 </span> : _OutputIterator __result, -<span class="lineNum"> 915 </span> : forward_iterator_tag, output_iterator_tag) -<span class="lineNum"> 916 </span> : { -<span class="lineNum"> 917 </span> : // concept requirements -- taken care of in dispatching function -<span class="lineNum"> 918 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 919 </span> : *__result = *__first; -<span class="lineNum"> 920 </span> : while (++__next != __last) -<span class="lineNum"> 921 </span> : if (!(*__first == *__next)) -<span class="lineNum"> 922 </span> : { -<span class="lineNum"> 923 </span> : __first = __next; -<span class="lineNum"> 924 </span> : *++__result = *__first; -<span class="lineNum"> 925 </span> : } -<span class="lineNum"> 926 </span> : return ++__result; -<span class="lineNum"> 927 </span> : } -<span class="lineNum"> 928 </span> : -<span class="lineNum"> 929 </span> : /** -<span class="lineNum"> 930 </span> : * This is an uglified unique_copy(_InputIterator, _InputIterator, -<span class="lineNum"> 931 </span> : * _OutputIterator) -<span class="lineNum"> 932 </span> : * overloaded for input iterators and output iterator as result. -<span class="lineNum"> 933 </span> : */ -<span class="lineNum"> 934 </span> : template<typename _InputIterator, typename _OutputIterator> -<span class="lineNum"> 935 </span> : _OutputIterator -<span class="lineNum"> 936 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 937 </span> : _OutputIterator __result, -<span class="lineNum"> 938 </span> : input_iterator_tag, output_iterator_tag) -<span class="lineNum"> 939 </span> : { -<span class="lineNum"> 940 </span> : // concept requirements -- taken care of in dispatching function -<span class="lineNum"> 941 </span> : typename iterator_traits<_InputIterator>::value_type __value = *__first; -<span class="lineNum"> 942 </span> : *__result = __value; -<span class="lineNum"> 943 </span> : while (++__first != __last) -<span class="lineNum"> 944 </span> : if (!(__value == *__first)) -<span class="lineNum"> 945 </span> : { -<span class="lineNum"> 946 </span> : __value = *__first; -<span class="lineNum"> 947 </span> : *++__result = __value; -<span class="lineNum"> 948 </span> : } -<span class="lineNum"> 949 </span> : return ++__result; -<span class="lineNum"> 950 </span> : } -<span class="lineNum"> 951 </span> : -<span class="lineNum"> 952 </span> : /** -<span class="lineNum"> 953 </span> : * This is an uglified unique_copy(_InputIterator, _InputIterator, -<span class="lineNum"> 954 </span> : * _OutputIterator) -<span class="lineNum"> 955 </span> : * overloaded for input iterators and forward iterator as result. -<span class="lineNum"> 956 </span> : */ -<span class="lineNum"> 957 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 958 </span> : _ForwardIterator -<span class="lineNum"> 959 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 960 </span> : _ForwardIterator __result, -<span class="lineNum"> 961 </span> : input_iterator_tag, forward_iterator_tag) -<span class="lineNum"> 962 </span> : { -<span class="lineNum"> 963 </span> : // concept requirements -- taken care of in dispatching function -<span class="lineNum"> 964 </span> : *__result = *__first; -<span class="lineNum"> 965 </span> : while (++__first != __last) -<span class="lineNum"> 966 </span> : if (!(*__result == *__first)) -<span class="lineNum"> 967 </span> : *++__result = *__first; -<span class="lineNum"> 968 </span> : return ++__result; -<span class="lineNum"> 969 </span> : } -<span class="lineNum"> 970 </span> : -<span class="lineNum"> 971 </span> : /** -<span class="lineNum"> 972 </span> : * This is an uglified -<span class="lineNum"> 973 </span> : * unique_copy(_InputIterator, _InputIterator, _OutputIterator, -<span class="lineNum"> 974 </span> : * _BinaryPredicate) -<span class="lineNum"> 975 </span> : * overloaded for forward iterators and output iterator as result. -<span class="lineNum"> 976 </span> : */ -<span class="lineNum"> 977 </span> : template<typename _ForwardIterator, typename _OutputIterator, -<span class="lineNum"> 978 </span> : typename _BinaryPredicate> -<span class="lineNum"> 979 </span> : _OutputIterator -<span class="lineNum"> 980 </span> : __unique_copy(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 981 </span> : _OutputIterator __result, _BinaryPredicate __binary_pred, -<span class="lineNum"> 982 </span> : forward_iterator_tag, output_iterator_tag) -<span class="lineNum"> 983 </span> : { -<span class="lineNum"> 984 </span> : // concept requirements -- iterators already checked -<span class="lineNum"> 985 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 986 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 987 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 988 </span> : -<span class="lineNum"> 989 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 990 </span> : *__result = *__first; -<span class="lineNum"> 991 </span> : while (++__next != __last) -<span class="lineNum"> 992 </span> : if (!bool(__binary_pred(*__first, *__next))) -<span class="lineNum"> 993 </span> : { -<span class="lineNum"> 994 </span> : __first = __next; -<span class="lineNum"> 995 </span> : *++__result = *__first; -<span class="lineNum"> 996 </span> : } -<span class="lineNum"> 997 </span> : return ++__result; -<span class="lineNum"> 998 </span> : } -<span class="lineNum"> 999 </span> : -<span class="lineNum"> 1000 </span> : /** -<span class="lineNum"> 1001 </span> : * This is an uglified -<span class="lineNum"> 1002 </span> : * unique_copy(_InputIterator, _InputIterator, _OutputIterator, -<span class="lineNum"> 1003 </span> : * _BinaryPredicate) -<span class="lineNum"> 1004 </span> : * overloaded for input iterators and output iterator as result. -<span class="lineNum"> 1005 </span> : */ -<span class="lineNum"> 1006 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 1007 </span> : typename _BinaryPredicate> -<span class="lineNum"> 1008 </span> : _OutputIterator -<span class="lineNum"> 1009 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1010 </span> : _OutputIterator __result, _BinaryPredicate __binary_pred, -<span class="lineNum"> 1011 </span> : input_iterator_tag, output_iterator_tag) -<span class="lineNum"> 1012 </span> : { -<span class="lineNum"> 1013 </span> : // concept requirements -- iterators already checked -<span class="lineNum"> 1014 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 1015 </span> : typename iterator_traits<_InputIterator>::value_type, -<span class="lineNum"> 1016 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 1017 </span> : -<span class="lineNum"> 1018 </span> : typename iterator_traits<_InputIterator>::value_type __value = *__first; -<span class="lineNum"> 1019 </span> : *__result = __value; -<span class="lineNum"> 1020 </span> : while (++__first != __last) -<span class="lineNum"> 1021 </span> : if (!bool(__binary_pred(__value, *__first))) -<span class="lineNum"> 1022 </span> : { -<span class="lineNum"> 1023 </span> : __value = *__first; -<span class="lineNum"> 1024 </span> : *++__result = __value; -<span class="lineNum"> 1025 </span> : } -<span class="lineNum"> 1026 </span> : return ++__result; -<span class="lineNum"> 1027 </span> : } -<span class="lineNum"> 1028 </span> : -<span class="lineNum"> 1029 </span> : /** -<span class="lineNum"> 1030 </span> : * This is an uglified -<span class="lineNum"> 1031 </span> : * unique_copy(_InputIterator, _InputIterator, _OutputIterator, -<span class="lineNum"> 1032 </span> : * _BinaryPredicate) -<span class="lineNum"> 1033 </span> : * overloaded for input iterators and forward iterator as result. -<span class="lineNum"> 1034 </span> : */ -<span class="lineNum"> 1035 </span> : template<typename _InputIterator, typename _ForwardIterator, -<span class="lineNum"> 1036 </span> : typename _BinaryPredicate> -<span class="lineNum"> 1037 </span> : _ForwardIterator -<span class="lineNum"> 1038 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1039 </span> : _ForwardIterator __result, _BinaryPredicate __binary_pred, -<span class="lineNum"> 1040 </span> : input_iterator_tag, forward_iterator_tag) -<span class="lineNum"> 1041 </span> : { -<span class="lineNum"> 1042 </span> : // concept requirements -- iterators already checked -<span class="lineNum"> 1043 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 1044 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 1045 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 1046 </span> : -<span class="lineNum"> 1047 </span> : *__result = *__first; -<span class="lineNum"> 1048 </span> : while (++__first != __last) -<span class="lineNum"> 1049 </span> : if (!bool(__binary_pred(*__result, *__first))) -<span class="lineNum"> 1050 </span> : *++__result = *__first; -<span class="lineNum"> 1051 </span> : return ++__result; -<span class="lineNum"> 1052 </span> : } -<span class="lineNum"> 1053 </span> : -<span class="lineNum"> 1054 </span> : /** -<span class="lineNum"> 1055 </span> : * This is an uglified reverse(_BidirectionalIterator, -<span class="lineNum"> 1056 </span> : * _BidirectionalIterator) -<span class="lineNum"> 1057 </span> : * overloaded for bidirectional iterators. -<span class="lineNum"> 1058 </span> : */ -<span class="lineNum"> 1059 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 1060 </span> : void -<span class="lineNum"> 1061 </span> : __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, -<span class="lineNum"> 1062 </span> : bidirectional_iterator_tag) -<span class="lineNum"> 1063 </span> : { -<span class="lineNum"> 1064 </span> : while (true) -<span class="lineNum"> 1065 </span> : if (__first == __last || __first == --__last) -<span class="lineNum"> 1066 </span> : return; -<span class="lineNum"> 1067 </span> : else -<span class="lineNum"> 1068 </span> : { -<span class="lineNum"> 1069 </span> : std::iter_swap(__first, __last); -<span class="lineNum"> 1070 </span> : ++__first; -<span class="lineNum"> 1071 </span> : } -<span class="lineNum"> 1072 </span> : } -<span class="lineNum"> 1073 </span> : -<span class="lineNum"> 1074 </span> : /** -<span class="lineNum"> 1075 </span> : * This is an uglified reverse(_BidirectionalIterator, -<span class="lineNum"> 1076 </span> : * _BidirectionalIterator) -<span class="lineNum"> 1077 </span> : * overloaded for random access iterators. -<span class="lineNum"> 1078 </span> : */ -<span class="lineNum"> 1079 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1080 </span> : void -<span class="lineNum"> 1081 </span> : __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 1082 </span> : random_access_iterator_tag) -<span class="lineNum"> 1083 </span> : { -<span class="lineNum"> 1084 </span> : if (__first == __last) -<span class="lineNum"> 1085 </span> : return; -<span class="lineNum"> 1086 </span> : --__last; -<span class="lineNum"> 1087 </span> : while (__first < __last) -<span class="lineNum"> 1088 </span> : { -<span class="lineNum"> 1089 </span> : std::iter_swap(__first, __last); -<span class="lineNum"> 1090 </span> : ++__first; -<span class="lineNum"> 1091 </span> : --__last; -<span class="lineNum"> 1092 </span> : } -<span class="lineNum"> 1093 </span> : } -<span class="lineNum"> 1094 </span> : -<span class="lineNum"> 1095 </span> : /** -<span class="lineNum"> 1096 </span> : * @brief Reverse a sequence. -<span class="lineNum"> 1097 </span> : * @param first A bidirectional iterator. -<span class="lineNum"> 1098 </span> : * @param last A bidirectional iterator. -<span class="lineNum"> 1099 </span> : * @return reverse() returns no value. -<span class="lineNum"> 1100 </span> : * -<span class="lineNum"> 1101 </span> : * Reverses the order of the elements in the range @p [first,last), -<span class="lineNum"> 1102 </span> : * so that the first element becomes the last etc. -<span class="lineNum"> 1103 </span> : * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse() -<span class="lineNum"> 1104 </span> : * swaps @p *(first+i) and @p *(last-(i+1)) -<span class="lineNum"> 1105 </span> : */ -<span class="lineNum"> 1106 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 1107 </span> : inline void -<span class="lineNum"> 1108 </span> : reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) -<span class="lineNum"> 1109 </span> : { -<span class="lineNum"> 1110 </span> : // concept requirements -<span class="lineNum"> 1111 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 1112 </span> : _BidirectionalIterator>) -<span class="lineNum"> 1113 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1114 </span> : std::__reverse(__first, __last, std::__iterator_category(__first)); -<span class="lineNum"> 1115 </span> : } -<span class="lineNum"> 1116 </span> : -<span class="lineNum"> 1117 </span> : /** -<span class="lineNum"> 1118 </span> : * @brief Copy a sequence, reversing its elements. -<span class="lineNum"> 1119 </span> : * @param first A bidirectional iterator. -<span class="lineNum"> 1120 </span> : * @param last A bidirectional iterator. -<span class="lineNum"> 1121 </span> : * @param result An output iterator. -<span class="lineNum"> 1122 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 1123 </span> : * -<span class="lineNum"> 1124 </span> : * Copies the elements in the range @p [first,last) to the range -<span class="lineNum"> 1125 </span> : * @p [result,result+(last-first)) such that the order of the -<span class="lineNum"> 1126 </span> : * elements is reversed. -<span class="lineNum"> 1127 </span> : * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy() -<span class="lineNum"> 1128 </span> : * performs the assignment @p *(result+(last-first)-i) = *(first+i). -<span class="lineNum"> 1129 </span> : * The ranges @p [first,last) and @p [result,result+(last-first)) -<span class="lineNum"> 1130 </span> : * must not overlap. -<span class="lineNum"> 1131 </span> : */ -<span class="lineNum"> 1132 </span> : template<typename _BidirectionalIterator, typename _OutputIterator> -<span class="lineNum"> 1133 </span> : _OutputIterator -<span class="lineNum"> 1134 </span> : reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, -<span class="lineNum"> 1135 </span> : _OutputIterator __result) -<span class="lineNum"> 1136 </span> : { -<span class="lineNum"> 1137 </span> : // concept requirements -<span class="lineNum"> 1138 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 1139 </span> : _BidirectionalIterator>) -<span class="lineNum"> 1140 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 1141 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 1142 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1143 </span> : -<span class="lineNum"> 1144 </span> : while (__first != __last) -<span class="lineNum"> 1145 </span> : { -<span class="lineNum"> 1146 </span> : --__last; -<span class="lineNum"> 1147 </span> : *__result = *__last; -<span class="lineNum"> 1148 </span> : ++__result; -<span class="lineNum"> 1149 </span> : } -<span class="lineNum"> 1150 </span> : return __result; -<span class="lineNum"> 1151 </span> : } -<span class="lineNum"> 1152 </span> : -<span class="lineNum"> 1153 </span> : /** -<span class="lineNum"> 1154 </span> : * This is a helper function for the rotate algorithm specialized on RAIs. -<span class="lineNum"> 1155 </span> : * It returns the greatest common divisor of two integer values. -<span class="lineNum"> 1156 </span> : */ -<span class="lineNum"> 1157 </span> : template<typename _EuclideanRingElement> -<span class="lineNum"> 1158 </span> : _EuclideanRingElement -<span class="lineNum"> 1159 </span> : __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) -<span class="lineNum"> 1160 </span> : { -<span class="lineNum"> 1161 </span> : while (__n != 0) -<span class="lineNum"> 1162 </span> : { -<span class="lineNum"> 1163 </span> : _EuclideanRingElement __t = __m % __n; -<span class="lineNum"> 1164 </span> : __m = __n; -<span class="lineNum"> 1165 </span> : __n = __t; -<span class="lineNum"> 1166 </span> : } -<span class="lineNum"> 1167 </span> : return __m; -<span class="lineNum"> 1168 </span> : } -<span class="lineNum"> 1169 </span> : -<span class="lineNum"> 1170 </span> : /// This is a helper function for the rotate algorithm. -<span class="lineNum"> 1171 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1172 </span> : void -<span class="lineNum"> 1173 </span> : __rotate(_ForwardIterator __first, -<span class="lineNum"> 1174 </span> : _ForwardIterator __middle, -<span class="lineNum"> 1175 </span> : _ForwardIterator __last, -<span class="lineNum"> 1176 </span> : forward_iterator_tag) -<span class="lineNum"> 1177 </span> : { -<span class="lineNum"> 1178 </span> : if (__first == __middle || __last == __middle) -<span class="lineNum"> 1179 </span> : return; -<span class="lineNum"> 1180 </span> : -<span class="lineNum"> 1181 </span> : _ForwardIterator __first2 = __middle; -<span class="lineNum"> 1182 </span> : do -<span class="lineNum"> 1183 </span> : { -<span class="lineNum"> 1184 </span> : std::iter_swap(__first, __first2); -<span class="lineNum"> 1185 </span> : ++__first; -<span class="lineNum"> 1186 </span> : ++__first2; -<span class="lineNum"> 1187 </span> : if (__first == __middle) -<span class="lineNum"> 1188 </span> : __middle = __first2; -<span class="lineNum"> 1189 </span> : } -<span class="lineNum"> 1190 </span> : while (__first2 != __last); -<span class="lineNum"> 1191 </span> : -<span class="lineNum"> 1192 </span> : __first2 = __middle; -<span class="lineNum"> 1193 </span> : -<span class="lineNum"> 1194 </span> : while (__first2 != __last) -<span class="lineNum"> 1195 </span> : { -<span class="lineNum"> 1196 </span> : std::iter_swap(__first, __first2); -<span class="lineNum"> 1197 </span> : ++__first; -<span class="lineNum"> 1198 </span> : ++__first2; -<span class="lineNum"> 1199 </span> : if (__first == __middle) -<span class="lineNum"> 1200 </span> : __middle = __first2; -<span class="lineNum"> 1201 </span> : else if (__first2 == __last) -<span class="lineNum"> 1202 </span> : __first2 = __middle; -<span class="lineNum"> 1203 </span> : } -<span class="lineNum"> 1204 </span> : } -<span class="lineNum"> 1205 </span> : -<span class="lineNum"> 1206 </span> : /// This is a helper function for the rotate algorithm. -<span class="lineNum"> 1207 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 1208 </span> : void -<span class="lineNum"> 1209 </span> : __rotate(_BidirectionalIterator __first, -<span class="lineNum"> 1210 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 1211 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 1212 </span> : bidirectional_iterator_tag) -<span class="lineNum"> 1213 </span> : { -<span class="lineNum"> 1214 </span> : // concept requirements -<span class="lineNum"> 1215 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 1216 </span> : _BidirectionalIterator>) -<span class="lineNum"> 1217 </span> : -<span class="lineNum"> 1218 </span> : if (__first == __middle || __last == __middle) -<span class="lineNum"> 1219 </span> : return; -<span class="lineNum"> 1220 </span> : -<span class="lineNum"> 1221 </span> : std::__reverse(__first, __middle, bidirectional_iterator_tag()); -<span class="lineNum"> 1222 </span> : std::__reverse(__middle, __last, bidirectional_iterator_tag()); -<span class="lineNum"> 1223 </span> : -<span class="lineNum"> 1224 </span> : while (__first != __middle && __middle != __last) -<span class="lineNum"> 1225 </span> : { -<span class="lineNum"> 1226 </span> : std::iter_swap(__first, --__last); -<span class="lineNum"> 1227 </span> : ++__first; -<span class="lineNum"> 1228 </span> : } -<span class="lineNum"> 1229 </span> : -<span class="lineNum"> 1230 </span> : if (__first == __middle) -<span class="lineNum"> 1231 </span> : std::__reverse(__middle, __last, bidirectional_iterator_tag()); -<span class="lineNum"> 1232 </span> : else -<span class="lineNum"> 1233 </span> : std::__reverse(__first, __middle, bidirectional_iterator_tag()); -<span class="lineNum"> 1234 </span> : } -<span class="lineNum"> 1235 </span> : -<span class="lineNum"> 1236 </span> : /// This is a helper function for the rotate algorithm. -<span class="lineNum"> 1237 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1238 </span> : void -<span class="lineNum"> 1239 </span> : __rotate(_RandomAccessIterator __first, -<span class="lineNum"> 1240 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 1241 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1242 </span> : random_access_iterator_tag) -<span class="lineNum"> 1243 </span> : { -<span class="lineNum"> 1244 </span> : // concept requirements -<span class="lineNum"> 1245 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 1246 </span> : _RandomAccessIterator>) -<span class="lineNum"> 1247 </span> : -<span class="lineNum"> 1248 </span> : if (__first == __middle || __last == __middle) -<span class="lineNum"> 1249 </span> : return; -<span class="lineNum"> 1250 </span> : -<span class="lineNum"> 1251 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 1252 </span> : _Distance; -<span class="lineNum"> 1253 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1254 </span> : _ValueType; -<span class="lineNum"> 1255 </span> : -<span class="lineNum"> 1256 </span> : const _Distance __n = __last - __first; -<span class="lineNum"> 1257 </span> : const _Distance __k = __middle - __first; -<span class="lineNum"> 1258 </span> : const _Distance __l = __n - __k; -<span class="lineNum"> 1259 </span> : -<span class="lineNum"> 1260 </span> : if (__k == __l) -<span class="lineNum"> 1261 </span> : { -<span class="lineNum"> 1262 </span> : std::swap_ranges(__first, __middle, __middle); -<span class="lineNum"> 1263 </span> : return; -<span class="lineNum"> 1264 </span> : } -<span class="lineNum"> 1265 </span> : -<span class="lineNum"> 1266 </span> : const _Distance __d = std::__gcd(__n, __k); -<span class="lineNum"> 1267 </span> : -<span class="lineNum"> 1268 </span> : for (_Distance __i = 0; __i < __d; __i++) -<span class="lineNum"> 1269 </span> : { -<span class="lineNum"> 1270 </span> : _ValueType __tmp = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 1271 </span> : _RandomAccessIterator __p = __first; -<span class="lineNum"> 1272 </span> : -<span class="lineNum"> 1273 </span> : if (__k < __l) -<span class="lineNum"> 1274 </span> : { -<span class="lineNum"> 1275 </span> : for (_Distance __j = 0; __j < __l / __d; __j++) -<span class="lineNum"> 1276 </span> : { -<span class="lineNum"> 1277 </span> : if (__p > __first + __l) -<span class="lineNum"> 1278 </span> : { -<span class="lineNum"> 1279 </span> : *__p = _GLIBCXX_MOVE(*(__p - __l)); -<span class="lineNum"> 1280 </span> : __p -= __l; -<span class="lineNum"> 1281 </span> : } -<span class="lineNum"> 1282 </span> : -<span class="lineNum"> 1283 </span> : *__p = _GLIBCXX_MOVE(*(__p + __k)); -<span class="lineNum"> 1284 </span> : __p += __k; -<span class="lineNum"> 1285 </span> : } -<span class="lineNum"> 1286 </span> : } -<span class="lineNum"> 1287 </span> : else -<span class="lineNum"> 1288 </span> : { -<span class="lineNum"> 1289 </span> : for (_Distance __j = 0; __j < __k / __d - 1; __j ++) -<span class="lineNum"> 1290 </span> : { -<span class="lineNum"> 1291 </span> : if (__p < __last - __k) -<span class="lineNum"> 1292 </span> : { -<span class="lineNum"> 1293 </span> : *__p = _GLIBCXX_MOVE(*(__p + __k)); -<span class="lineNum"> 1294 </span> : __p += __k; -<span class="lineNum"> 1295 </span> : } -<span class="lineNum"> 1296 </span> : *__p = _GLIBCXX_MOVE(*(__p - __l)); -<span class="lineNum"> 1297 </span> : __p -= __l; -<span class="lineNum"> 1298 </span> : } -<span class="lineNum"> 1299 </span> : } -<span class="lineNum"> 1300 </span> : -<span class="lineNum"> 1301 </span> : *__p = _GLIBCXX_MOVE(__tmp); -<span class="lineNum"> 1302 </span> : ++__first; -<span class="lineNum"> 1303 </span> : } -<span class="lineNum"> 1304 </span> : } -<span class="lineNum"> 1305 </span> : -<span class="lineNum"> 1306 </span> : /** -<span class="lineNum"> 1307 </span> : * @brief Rotate the elements of a sequence. -<span class="lineNum"> 1308 </span> : * @param first A forward iterator. -<span class="lineNum"> 1309 </span> : * @param middle A forward iterator. -<span class="lineNum"> 1310 </span> : * @param last A forward iterator. -<span class="lineNum"> 1311 </span> : * @return Nothing. -<span class="lineNum"> 1312 </span> : * -<span class="lineNum"> 1313 </span> : * Rotates the elements of the range @p [first,last) by @p (middle-first) -<span class="lineNum"> 1314 </span> : * positions so that the element at @p middle is moved to @p first, the -<span class="lineNum"> 1315 </span> : * element at @p middle+1 is moved to @first+1 and so on for each element -<span class="lineNum"> 1316 </span> : * in the range @p [first,last). -<span class="lineNum"> 1317 </span> : * -<span class="lineNum"> 1318 </span> : * This effectively swaps the ranges @p [first,middle) and -<span class="lineNum"> 1319 </span> : * @p [middle,last). -<span class="lineNum"> 1320 </span> : * -<span class="lineNum"> 1321 </span> : * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for -<span class="lineNum"> 1322 </span> : * each @p n in the range @p [0,last-first). -<span class="lineNum"> 1323 </span> : */ -<span class="lineNum"> 1324 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1325 </span> : inline void -<span class="lineNum"> 1326 </span> : rotate(_ForwardIterator __first, _ForwardIterator __middle, -<span class="lineNum"> 1327 </span> : _ForwardIterator __last) -<span class="lineNum"> 1328 </span> : { -<span class="lineNum"> 1329 </span> : // concept requirements -<span class="lineNum"> 1330 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 1331 </span> : _ForwardIterator>) -<span class="lineNum"> 1332 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 1333 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 1334 </span> : -<span class="lineNum"> 1335 </span> : typedef typename iterator_traits<_ForwardIterator>::iterator_category -<span class="lineNum"> 1336 </span> : _IterType; -<span class="lineNum"> 1337 </span> : std::__rotate(__first, __middle, __last, _IterType()); -<span class="lineNum"> 1338 </span> : } -<span class="lineNum"> 1339 </span> : -<span class="lineNum"> 1340 </span> : /** -<span class="lineNum"> 1341 </span> : * @brief Copy a sequence, rotating its elements. -<span class="lineNum"> 1342 </span> : * @param first A forward iterator. -<span class="lineNum"> 1343 </span> : * @param middle A forward iterator. -<span class="lineNum"> 1344 </span> : * @param last A forward iterator. -<span class="lineNum"> 1345 </span> : * @param result An output iterator. -<span class="lineNum"> 1346 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 1347 </span> : * -<span class="lineNum"> 1348 </span> : * Copies the elements of the range @p [first,last) to the range -<span class="lineNum"> 1349 </span> : * beginning at @result, rotating the copied elements by @p (middle-first) -<span class="lineNum"> 1350 </span> : * positions so that the element at @p middle is moved to @p result, the -<span class="lineNum"> 1351 </span> : * element at @p middle+1 is moved to @result+1 and so on for each element -<span class="lineNum"> 1352 </span> : * in the range @p [first,last). -<span class="lineNum"> 1353 </span> : * -<span class="lineNum"> 1354 </span> : * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for -<span class="lineNum"> 1355 </span> : * each @p n in the range @p [0,last-first). -<span class="lineNum"> 1356 </span> : */ -<span class="lineNum"> 1357 </span> : template<typename _ForwardIterator, typename _OutputIterator> -<span class="lineNum"> 1358 </span> : _OutputIterator -<span class="lineNum"> 1359 </span> : rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, -<span class="lineNum"> 1360 </span> : _ForwardIterator __last, _OutputIterator __result) -<span class="lineNum"> 1361 </span> : { -<span class="lineNum"> 1362 </span> : // concept requirements -<span class="lineNum"> 1363 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 1364 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 1365 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 1366 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 1367 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 1368 </span> : -<span class="lineNum"> 1369 </span> : return std::copy(__first, __middle, -<span class="lineNum"> 1370 </span> : std::copy(__middle, __last, __result)); -<span class="lineNum"> 1371 </span> : } -<span class="lineNum"> 1372 </span> : -<span class="lineNum"> 1373 </span> : /// This is a helper function... -<span class="lineNum"> 1374 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 1375 </span> : _ForwardIterator -<span class="lineNum"> 1376 </span> : __partition(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1377 </span> : _Predicate __pred, forward_iterator_tag) -<span class="lineNum"> 1378 </span> : { -<span class="lineNum"> 1379 </span> : if (__first == __last) -<span class="lineNum"> 1380 </span> : return __first; -<span class="lineNum"> 1381 </span> : -<span class="lineNum"> 1382 </span> : while (__pred(*__first)) -<span class="lineNum"> 1383 </span> : if (++__first == __last) -<span class="lineNum"> 1384 </span> : return __first; -<span class="lineNum"> 1385 </span> : -<span class="lineNum"> 1386 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 1387 </span> : -<span class="lineNum"> 1388 </span> : while (++__next != __last) -<span class="lineNum"> 1389 </span> : if (__pred(*__next)) -<span class="lineNum"> 1390 </span> : { -<span class="lineNum"> 1391 </span> : std::iter_swap(__first, __next); -<span class="lineNum"> 1392 </span> : ++__first; -<span class="lineNum"> 1393 </span> : } -<span class="lineNum"> 1394 </span> : -<span class="lineNum"> 1395 </span> : return __first; -<span class="lineNum"> 1396 </span> : } -<span class="lineNum"> 1397 </span> : -<span class="lineNum"> 1398 </span> : /// This is a helper function... -<span class="lineNum"> 1399 </span> : template<typename _BidirectionalIterator, typename _Predicate> -<span class="lineNum"> 1400 </span> : _BidirectionalIterator -<span class="lineNum"> 1401 </span> : __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, -<span class="lineNum"> 1402 </span> : _Predicate __pred, bidirectional_iterator_tag) -<span class="lineNum"> 1403 </span> : { -<span class="lineNum"> 1404 </span> : while (true) -<span class="lineNum"> 1405 </span> : { -<span class="lineNum"> 1406 </span> : while (true) -<span class="lineNum"> 1407 </span> : if (__first == __last) -<span class="lineNum"> 1408 </span> : return __first; -<span class="lineNum"> 1409 </span> : else if (__pred(*__first)) -<span class="lineNum"> 1410 </span> : ++__first; -<span class="lineNum"> 1411 </span> : else -<span class="lineNum"> 1412 </span> : break; -<span class="lineNum"> 1413 </span> : --__last; -<span class="lineNum"> 1414 </span> : while (true) -<span class="lineNum"> 1415 </span> : if (__first == __last) -<span class="lineNum"> 1416 </span> : return __first; -<span class="lineNum"> 1417 </span> : else if (!bool(__pred(*__last))) -<span class="lineNum"> 1418 </span> : --__last; -<span class="lineNum"> 1419 </span> : else -<span class="lineNum"> 1420 </span> : break; -<span class="lineNum"> 1421 </span> : std::iter_swap(__first, __last); -<span class="lineNum"> 1422 </span> : ++__first; -<span class="lineNum"> 1423 </span> : } -<span class="lineNum"> 1424 </span> : } -<span class="lineNum"> 1425 </span> : -<span class="lineNum"> 1426 </span> : // partition -<span class="lineNum"> 1427 </span> : -<span class="lineNum"> 1428 </span> : /// This is a helper function... -<span class="lineNum"> 1429 </span> : template<typename _ForwardIterator, typename _Predicate, typename _Distance> -<span class="lineNum"> 1430 </span> : _ForwardIterator -<span class="lineNum"> 1431 </span> : __inplace_stable_partition(_ForwardIterator __first, -<span class="lineNum"> 1432 </span> : _ForwardIterator __last, -<span class="lineNum"> 1433 </span> : _Predicate __pred, _Distance __len) -<span class="lineNum"> 1434 </span> : { -<span class="lineNum"> 1435 </span> : if (__len == 1) -<span class="lineNum"> 1436 </span> : return __pred(*__first) ? __last : __first; -<span class="lineNum"> 1437 </span> : _ForwardIterator __middle = __first; -<span class="lineNum"> 1438 </span> : std::advance(__middle, __len / 2); -<span class="lineNum"> 1439 </span> : _ForwardIterator __begin = std::__inplace_stable_partition(__first, -<span class="lineNum"> 1440 </span> : __middle, -<span class="lineNum"> 1441 </span> : __pred, -<span class="lineNum"> 1442 </span> : __len / 2); -<span class="lineNum"> 1443 </span> : _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last, -<span class="lineNum"> 1444 </span> : __pred, -<span class="lineNum"> 1445 </span> : __len -<span class="lineNum"> 1446 </span> : - __len / 2); -<span class="lineNum"> 1447 </span> : std::rotate(__begin, __middle, __end); -<span class="lineNum"> 1448 </span> : std::advance(__begin, std::distance(__middle, __end)); -<span class="lineNum"> 1449 </span> : return __begin; -<span class="lineNum"> 1450 </span> : } -<span class="lineNum"> 1451 </span> : -<span class="lineNum"> 1452 </span> : /// This is a helper function... -<span class="lineNum"> 1453 </span> : template<typename _ForwardIterator, typename _Pointer, typename _Predicate, -<span class="lineNum"> 1454 </span> : typename _Distance> -<span class="lineNum"> 1455 </span> : _ForwardIterator -<span class="lineNum"> 1456 </span> : __stable_partition_adaptive(_ForwardIterator __first, -<span class="lineNum"> 1457 </span> : _ForwardIterator __last, -<span class="lineNum"> 1458 </span> : _Predicate __pred, _Distance __len, -<span class="lineNum"> 1459 </span> : _Pointer __buffer, -<span class="lineNum"> 1460 </span> : _Distance __buffer_size) -<span class="lineNum"> 1461 </span> : { -<span class="lineNum"> 1462 </span> : if (__len <= __buffer_size) -<span class="lineNum"> 1463 </span> : { -<span class="lineNum"> 1464 </span> : _ForwardIterator __result1 = __first; -<span class="lineNum"> 1465 </span> : _Pointer __result2 = __buffer; -<span class="lineNum"> 1466 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 1467 </span> : if (__pred(*__first)) -<span class="lineNum"> 1468 </span> : { -<span class="lineNum"> 1469 </span> : *__result1 = *__first; -<span class="lineNum"> 1470 </span> : ++__result1; -<span class="lineNum"> 1471 </span> : } -<span class="lineNum"> 1472 </span> : else -<span class="lineNum"> 1473 </span> : { -<span class="lineNum"> 1474 </span> : *__result2 = *__first; -<span class="lineNum"> 1475 </span> : ++__result2; -<span class="lineNum"> 1476 </span> : } -<span class="lineNum"> 1477 </span> : std::copy(__buffer, __result2, __result1); -<span class="lineNum"> 1478 </span> : return __result1; -<span class="lineNum"> 1479 </span> : } -<span class="lineNum"> 1480 </span> : else -<span class="lineNum"> 1481 </span> : { -<span class="lineNum"> 1482 </span> : _ForwardIterator __middle = __first; -<span class="lineNum"> 1483 </span> : std::advance(__middle, __len / 2); -<span class="lineNum"> 1484 </span> : _ForwardIterator __begin = -<span class="lineNum"> 1485 </span> : std::__stable_partition_adaptive(__first, __middle, __pred, -<span class="lineNum"> 1486 </span> : __len / 2, __buffer, -<span class="lineNum"> 1487 </span> : __buffer_size); -<span class="lineNum"> 1488 </span> : _ForwardIterator __end = -<span class="lineNum"> 1489 </span> : std::__stable_partition_adaptive(__middle, __last, __pred, -<span class="lineNum"> 1490 </span> : __len - __len / 2, -<span class="lineNum"> 1491 </span> : __buffer, __buffer_size); -<span class="lineNum"> 1492 </span> : std::rotate(__begin, __middle, __end); -<span class="lineNum"> 1493 </span> : std::advance(__begin, std::distance(__middle, __end)); -<span class="lineNum"> 1494 </span> : return __begin; -<span class="lineNum"> 1495 </span> : } -<span class="lineNum"> 1496 </span> : } -<span class="lineNum"> 1497 </span> : -<span class="lineNum"> 1498 </span> : /** -<span class="lineNum"> 1499 </span> : * @brief Move elements for which a predicate is true to the beginning -<span class="lineNum"> 1500 </span> : * of a sequence, preserving relative ordering. -<span class="lineNum"> 1501 </span> : * @param first A forward iterator. -<span class="lineNum"> 1502 </span> : * @param last A forward iterator. -<span class="lineNum"> 1503 </span> : * @param pred A predicate functor. -<span class="lineNum"> 1504 </span> : * @return An iterator @p middle such that @p pred(i) is true for each -<span class="lineNum"> 1505 </span> : * iterator @p i in the range @p [first,middle) and false for each @p i -<span class="lineNum"> 1506 </span> : * in the range @p [middle,last). -<span class="lineNum"> 1507 </span> : * -<span class="lineNum"> 1508 </span> : * Performs the same function as @p partition() with the additional -<span class="lineNum"> 1509 </span> : * guarantee that the relative ordering of elements in each group is -<span class="lineNum"> 1510 </span> : * preserved, so any two elements @p x and @p y in the range -<span class="lineNum"> 1511 </span> : * @p [first,last) such that @p pred(x)==pred(y) will have the same -<span class="lineNum"> 1512 </span> : * relative ordering after calling @p stable_partition(). -<span class="lineNum"> 1513 </span> : */ -<span class="lineNum"> 1514 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 1515 </span> : _ForwardIterator -<span class="lineNum"> 1516 </span> : stable_partition(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1517 </span> : _Predicate __pred) -<span class="lineNum"> 1518 </span> : { -<span class="lineNum"> 1519 </span> : // concept requirements -<span class="lineNum"> 1520 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 1521 </span> : _ForwardIterator>) -<span class="lineNum"> 1522 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 1523 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 1524 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1525 </span> : -<span class="lineNum"> 1526 </span> : if (__first == __last) -<span class="lineNum"> 1527 </span> : return __first; -<span class="lineNum"> 1528 </span> : else -<span class="lineNum"> 1529 </span> : { -<span class="lineNum"> 1530 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 1531 </span> : _ValueType; -<span class="lineNum"> 1532 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 1533 </span> : _DistanceType; -<span class="lineNum"> 1534 </span> : -<span class="lineNum"> 1535 </span> : _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, -<span class="lineNum"> 1536 </span> : __last); -<span class="lineNum"> 1537 </span> : if (__buf.size() > 0) -<span class="lineNum"> 1538 </span> : return -<span class="lineNum"> 1539 </span> : std::__stable_partition_adaptive(__first, __last, __pred, -<span class="lineNum"> 1540 </span> : _DistanceType(__buf.requested_size()), -<span class="lineNum"> 1541 </span> : __buf.begin(), -<span class="lineNum"> 1542 </span> : _DistanceType(__buf.size())); -<span class="lineNum"> 1543 </span> : else -<span class="lineNum"> 1544 </span> : return -<span class="lineNum"> 1545 </span> : std::__inplace_stable_partition(__first, __last, __pred, -<span class="lineNum"> 1546 </span> : _DistanceType(__buf.requested_size())); -<span class="lineNum"> 1547 </span> : } -<span class="lineNum"> 1548 </span> : } -<span class="lineNum"> 1549 </span> : -<span class="lineNum"> 1550 </span> : /// This is a helper function for the sort routines. -<span class="lineNum"> 1551 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1552 </span> : void -<span class="lineNum"> 1553 </span> : __heap_select(_RandomAccessIterator __first, -<span class="lineNum"> 1554 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 1555 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1556 </span> : { -<span class="lineNum"> 1557 </span><span class="lineNoCov"> 0 : std::make_heap(__first, __middle);</span> -<span class="lineNum"> 1558 </span><span class="lineNoCov"> 0 : for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)</span> -<span class="lineNum"> 1559 </span><span class="lineNoCov"> 0 : if (*__i < *__first)</span> -<span class="lineNum"> 1560 </span><span class="lineNoCov"> 0 : std::__pop_heap(__first, __middle, __i);</span> -<span class="lineNum"> 1561 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1562 </span> : -<span class="lineNum"> 1563 </span> : /// This is a helper function for the sort routines. -<span class="lineNum"> 1564 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1565 </span> : void -<span class="lineNum"> 1566 </span> : __heap_select(_RandomAccessIterator __first, -<span class="lineNum"> 1567 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 1568 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1569 </span> : { -<span class="lineNum"> 1570 </span><span class="lineNoCov"> 0 : std::make_heap(__first, __middle, __comp);</span> -<span class="lineNum"> 1571 </span><span class="lineNoCov"> 0 : for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)</span> -<span class="lineNum"> 1572 </span><span class="lineNoCov"> 0 : if (__comp(*__i, *__first))</span> -<span class="lineNum"> 1573 </span><span class="lineNoCov"> 0 : std::__pop_heap(__first, __middle, __i, __comp);</span> -<span class="lineNum"> 1574 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1575 </span> : -<span class="lineNum"> 1576 </span> : // partial_sort -<span class="lineNum"> 1577 </span> : -<span class="lineNum"> 1578 </span> : /** -<span class="lineNum"> 1579 </span> : * @brief Copy the smallest elements of a sequence. -<span class="lineNum"> 1580 </span> : * @param first An iterator. -<span class="lineNum"> 1581 </span> : * @param last Another iterator. -<span class="lineNum"> 1582 </span> : * @param result_first A random-access iterator. -<span class="lineNum"> 1583 </span> : * @param result_last Another random-access iterator. -<span class="lineNum"> 1584 </span> : * @return An iterator indicating the end of the resulting sequence. -<span class="lineNum"> 1585 </span> : * -<span class="lineNum"> 1586 </span> : * Copies and sorts the smallest N values from the range @p [first,last) -<span class="lineNum"> 1587 </span> : * to the range beginning at @p result_first, where the number of -<span class="lineNum"> 1588 </span> : * elements to be copied, @p N, is the smaller of @p (last-first) and -<span class="lineNum"> 1589 </span> : * @p (result_last-result_first). -<span class="lineNum"> 1590 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 1591 </span> : * @p [result_first,result_first+N) such that @i precedes @j then -<span class="lineNum"> 1592 </span> : * @p *j<*i is false. -<span class="lineNum"> 1593 </span> : * The value returned is @p result_first+N. -<span class="lineNum"> 1594 </span> : */ -<span class="lineNum"> 1595 </span> : template<typename _InputIterator, typename _RandomAccessIterator> -<span class="lineNum"> 1596 </span> : _RandomAccessIterator -<span class="lineNum"> 1597 </span> : partial_sort_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1598 </span> : _RandomAccessIterator __result_first, -<span class="lineNum"> 1599 </span> : _RandomAccessIterator __result_last) -<span class="lineNum"> 1600 </span> : { -<span class="lineNum"> 1601 </span> : typedef typename iterator_traits<_InputIterator>::value_type -<span class="lineNum"> 1602 </span> : _InputValueType; -<span class="lineNum"> 1603 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1604 </span> : _OutputValueType; -<span class="lineNum"> 1605 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 1606 </span> : _DistanceType; -<span class="lineNum"> 1607 </span> : -<span class="lineNum"> 1608 </span> : // concept requirements -<span class="lineNum"> 1609 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 1610 </span> : __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, -<span class="lineNum"> 1611 </span> : _OutputValueType>) -<span class="lineNum"> 1612 </span> : __glibcxx_function_requires(_LessThanOpConcept<_InputValueType, -<span class="lineNum"> 1613 </span> : _OutputValueType>) -<span class="lineNum"> 1614 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>) -<span class="lineNum"> 1615 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1616 </span> : __glibcxx_requires_valid_range(__result_first, __result_last); -<span class="lineNum"> 1617 </span> : -<span class="lineNum"> 1618 </span> : if (__result_first == __result_last) -<span class="lineNum"> 1619 </span> : return __result_last; -<span class="lineNum"> 1620 </span> : _RandomAccessIterator __result_real_last = __result_first; -<span class="lineNum"> 1621 </span> : while(__first != __last && __result_real_last != __result_last) -<span class="lineNum"> 1622 </span> : { -<span class="lineNum"> 1623 </span> : *__result_real_last = *__first; -<span class="lineNum"> 1624 </span> : ++__result_real_last; -<span class="lineNum"> 1625 </span> : ++__first; -<span class="lineNum"> 1626 </span> : } -<span class="lineNum"> 1627 </span> : std::make_heap(__result_first, __result_real_last); -<span class="lineNum"> 1628 </span> : while (__first != __last) -<span class="lineNum"> 1629 </span> : { -<span class="lineNum"> 1630 </span> : if (*__first < *__result_first) -<span class="lineNum"> 1631 </span> : std::__adjust_heap(__result_first, _DistanceType(0), -<span class="lineNum"> 1632 </span> : _DistanceType(__result_real_last -<span class="lineNum"> 1633 </span> : - __result_first), -<span class="lineNum"> 1634 </span> : _InputValueType(*__first)); -<span class="lineNum"> 1635 </span> : ++__first; -<span class="lineNum"> 1636 </span> : } -<span class="lineNum"> 1637 </span> : std::sort_heap(__result_first, __result_real_last); -<span class="lineNum"> 1638 </span> : return __result_real_last; -<span class="lineNum"> 1639 </span> : } -<span class="lineNum"> 1640 </span> : -<span class="lineNum"> 1641 </span> : /** -<span class="lineNum"> 1642 </span> : * @brief Copy the smallest elements of a sequence using a predicate for -<span class="lineNum"> 1643 </span> : * comparison. -<span class="lineNum"> 1644 </span> : * @param first An input iterator. -<span class="lineNum"> 1645 </span> : * @param last Another input iterator. -<span class="lineNum"> 1646 </span> : * @param result_first A random-access iterator. -<span class="lineNum"> 1647 </span> : * @param result_last Another random-access iterator. -<span class="lineNum"> 1648 </span> : * @param comp A comparison functor. -<span class="lineNum"> 1649 </span> : * @return An iterator indicating the end of the resulting sequence. -<span class="lineNum"> 1650 </span> : * -<span class="lineNum"> 1651 </span> : * Copies and sorts the smallest N values from the range @p [first,last) -<span class="lineNum"> 1652 </span> : * to the range beginning at @p result_first, where the number of -<span class="lineNum"> 1653 </span> : * elements to be copied, @p N, is the smaller of @p (last-first) and -<span class="lineNum"> 1654 </span> : * @p (result_last-result_first). -<span class="lineNum"> 1655 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 1656 </span> : * @p [result_first,result_first+N) such that @i precedes @j then -<span class="lineNum"> 1657 </span> : * @p comp(*j,*i) is false. -<span class="lineNum"> 1658 </span> : * The value returned is @p result_first+N. -<span class="lineNum"> 1659 </span> : */ -<span class="lineNum"> 1660 </span> : template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1661 </span> : _RandomAccessIterator -<span class="lineNum"> 1662 </span> : partial_sort_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1663 </span> : _RandomAccessIterator __result_first, -<span class="lineNum"> 1664 </span> : _RandomAccessIterator __result_last, -<span class="lineNum"> 1665 </span> : _Compare __comp) -<span class="lineNum"> 1666 </span> : { -<span class="lineNum"> 1667 </span> : typedef typename iterator_traits<_InputIterator>::value_type -<span class="lineNum"> 1668 </span> : _InputValueType; -<span class="lineNum"> 1669 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1670 </span> : _OutputValueType; -<span class="lineNum"> 1671 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 1672 </span> : _DistanceType; -<span class="lineNum"> 1673 </span> : -<span class="lineNum"> 1674 </span> : // concept requirements -<span class="lineNum"> 1675 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 1676 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 1677 </span> : _RandomAccessIterator>) -<span class="lineNum"> 1678 </span> : __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, -<span class="lineNum"> 1679 </span> : _OutputValueType>) -<span class="lineNum"> 1680 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 1681 </span> : _InputValueType, _OutputValueType>) -<span class="lineNum"> 1682 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 1683 </span> : _OutputValueType, _OutputValueType>) -<span class="lineNum"> 1684 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1685 </span> : __glibcxx_requires_valid_range(__result_first, __result_last); -<span class="lineNum"> 1686 </span> : -<span class="lineNum"> 1687 </span> : if (__result_first == __result_last) -<span class="lineNum"> 1688 </span> : return __result_last; -<span class="lineNum"> 1689 </span> : _RandomAccessIterator __result_real_last = __result_first; -<span class="lineNum"> 1690 </span> : while(__first != __last && __result_real_last != __result_last) -<span class="lineNum"> 1691 </span> : { -<span class="lineNum"> 1692 </span> : *__result_real_last = *__first; -<span class="lineNum"> 1693 </span> : ++__result_real_last; -<span class="lineNum"> 1694 </span> : ++__first; -<span class="lineNum"> 1695 </span> : } -<span class="lineNum"> 1696 </span> : std::make_heap(__result_first, __result_real_last, __comp); -<span class="lineNum"> 1697 </span> : while (__first != __last) -<span class="lineNum"> 1698 </span> : { -<span class="lineNum"> 1699 </span> : if (__comp(*__first, *__result_first)) -<span class="lineNum"> 1700 </span> : std::__adjust_heap(__result_first, _DistanceType(0), -<span class="lineNum"> 1701 </span> : _DistanceType(__result_real_last -<span class="lineNum"> 1702 </span> : - __result_first), -<span class="lineNum"> 1703 </span> : _InputValueType(*__first), -<span class="lineNum"> 1704 </span> : __comp); -<span class="lineNum"> 1705 </span> : ++__first; -<span class="lineNum"> 1706 </span> : } -<span class="lineNum"> 1707 </span> : std::sort_heap(__result_first, __result_real_last, __comp); -<span class="lineNum"> 1708 </span> : return __result_real_last; -<span class="lineNum"> 1709 </span> : } -<span class="lineNum"> 1710 </span> : -<span class="lineNum"> 1711 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1712 </span> : template<typename _RandomAccessIterator, typename _Tp> -<span class="lineNum"> 1713 </span> : void -<span class="lineNum"> 1714 </span><span class="lineCov"> 2369 : __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)</span> -<span class="lineNum"> 1715 </span> : { -<span class="lineNum"> 1716 </span><span class="lineCov"> 2369 : _RandomAccessIterator __next = __last;</span> -<span class="lineNum"> 1717 </span><span class="lineCov"> 2369 : --__next;</span> -<span class="lineNum"> 1718 </span><span class="lineCov"> 5033 : while (__val < *__next)</span> -<span class="lineNum"> 1719 </span> : { -<span class="lineNum"> 1720 </span><span class="lineCov"> 295 : *__last = *__next;</span> -<span class="lineNum"> 1721 </span><span class="lineCov"> 295 : __last = __next;</span> -<span class="lineNum"> 1722 </span><span class="lineCov"> 295 : --__next;</span> -<span class="lineNum"> 1723 </span> : } -<span class="lineNum"> 1724 </span><span class="lineCov"> 2369 : *__last = __val;</span> -<span class="lineNum"> 1725 </span><span class="lineCov"> 2369 : }</span> -<span class="lineNum"> 1726 </span> : -<span class="lineNum"> 1727 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1728 </span> : template<typename _RandomAccessIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 1729 </span> : void -<span class="lineNum"> 1730 </span> : __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val, -<span class="lineNum"> 1731 </span><span class="lineCov"> 48163 : _Compare __comp)</span> -<span class="lineNum"> 1732 </span> : { -<span class="lineNum"> 1733 </span><span class="lineCov"> 48163 : _RandomAccessIterator __next = __last;</span> -<span class="lineNum"> 1734 </span><span class="lineCov"> 48163 : --__next;</span> -<span class="lineNum"> 1735 </span><span class="lineCov"> 273339 : while (__comp(__val, *__next))</span> -<span class="lineNum"> 1736 </span> : { -<span class="lineNum"> 1737 </span><span class="lineCov"> 177013 : *__last = *__next;</span> -<span class="lineNum"> 1738 </span><span class="lineCov"> 177013 : __last = __next;</span> -<span class="lineNum"> 1739 </span><span class="lineCov"> 177013 : --__next;</span> -<span class="lineNum"> 1740 </span> : } -<span class="lineNum"> 1741 </span><span class="lineCov"> 48163 : *__last = __val;</span> -<span class="lineNum"> 1742 </span><span class="lineCov"> 48163 : }</span> -<span class="lineNum"> 1743 </span> : -<span class="lineNum"> 1744 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1745 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1746 </span> : void -<span class="lineNum"> 1747 </span> : __insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1748 </span><span class="lineCov"> 81 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1749 </span> : { -<span class="lineNum"> 1750 </span><span class="lineCov"> 81 : if (__first == __last)</span> -<span class="lineNum"> 1751 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 1752 </span> : -<span class="lineNum"> 1753 </span><span class="lineCov"> 503 : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)</span> -<span class="lineNum"> 1754 </span> : { -<span class="lineNum"> 1755 </span> : typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1756 </span><span class="lineCov"> 422 : __val = *__i;</span> -<span class="lineNum"> 1757 </span><span class="lineCov"> 422 : if (__val < *__first)</span> -<span class="lineNum"> 1758 </span> : { -<span class="lineNum"> 1759 </span><span class="lineCov"> 151 : std::copy_backward(__first, __i, __i + 1);</span> -<span class="lineNum"> 1760 </span><span class="lineCov"> 151 : *__first = __val;</span> -<span class="lineNum"> 1761 </span> : } -<span class="lineNum"> 1762 </span> : else -<span class="lineNum"> 1763 </span><span class="lineCov"> 271 : std::__unguarded_linear_insert(__i, __val);</span> -<span class="lineNum"> 1764 </span> : } -<span class="lineNum"> 1765 </span> : } -<span class="lineNum"> 1766 </span> : -<span class="lineNum"> 1767 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1768 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1769 </span> : void -<span class="lineNum"> 1770 </span> : __insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1771 </span><span class="lineCov"> 3938 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1772 </span> : { -<span class="lineNum"> 1773 </span><span class="lineCov"> 3938 : if (__first == __last) return;</span> -<span class="lineNum"> 1774 </span> : -<span class="lineNum"> 1775 </span><span class="lineCov"> 55255 : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)</span> -<span class="lineNum"> 1776 </span> : { -<span class="lineNum"> 1777 </span> : typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1778 </span><span class="lineCov"> 51317 : __val = *__i;</span> -<span class="lineNum"> 1779 </span><span class="lineCov"> 51317 : if (__comp(__val, *__first))</span> -<span class="lineNum"> 1780 </span> : { -<span class="lineNum"> 1781 </span><span class="lineCov"> 7625 : std::copy_backward(__first, __i, __i + 1);</span> -<span class="lineNum"> 1782 </span><span class="lineCov"> 7625 : *__first = __val;</span> -<span class="lineNum"> 1783 </span> : } -<span class="lineNum"> 1784 </span> : else -<span class="lineNum"> 1785 </span><span class="lineCov"> 43692 : std::__unguarded_linear_insert(__i, __val, __comp);</span> -<span class="lineNum"> 1786 </span> : } -<span class="lineNum"> 1787 </span> : } -<span class="lineNum"> 1788 </span> : -<span class="lineNum"> 1789 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1790 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1791 </span> : inline void -<span class="lineNum"> 1792 </span> : __unguarded_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1793 </span><span class="lineCov"> 3 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1794 </span> : { -<span class="lineNum"> 1795 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1796 </span> : _ValueType; -<span class="lineNum"> 1797 </span> : -<span class="lineNum"> 1798 </span><span class="lineCov"> 2101 : for (_RandomAccessIterator __i = __first; __i != __last; ++__i)</span> -<span class="lineNum"> 1799 </span><span class="lineCov"> 2098 : std::__unguarded_linear_insert(__i, _ValueType(*__i));</span> -<span class="lineNum"> 1800 </span><span class="lineCov"> 3 : }</span> -<span class="lineNum"> 1801 </span> : -<span class="lineNum"> 1802 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1803 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1804 </span> : inline void -<span class="lineNum"> 1805 </span> : __unguarded_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1806 </span><span class="lineCov"> 261 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1807 </span> : { -<span class="lineNum"> 1808 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1809 </span> : _ValueType; -<span class="lineNum"> 1810 </span> : -<span class="lineNum"> 1811 </span><span class="lineCov"> 4732 : for (_RandomAccessIterator __i = __first; __i != __last; ++__i)</span> -<span class="lineNum"> 1812 </span><span class="lineCov"> 4471 : std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp);</span> -<span class="lineNum"> 1813 </span><span class="lineCov"> 261 : }</span> -<span class="lineNum"> 1814 </span> : -<span class="lineNum"> 1815 </span> : /** -<span class="lineNum"> 1816 </span> : * @doctodo -<span class="lineNum"> 1817 </span> : * This controls some aspect of the sort routines. -<span class="lineNum"> 1818 </span> : */ -<span class="lineNum"> 1819 </span> : enum { _S_threshold = 16 }; -<span class="lineNum"> 1820 </span> : -<span class="lineNum"> 1821 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1822 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1823 </span> : void -<span class="lineNum"> 1824 </span> : __final_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1825 </span><span class="lineCov"> 81 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1826 </span> : { -<span class="lineNum"> 1827 </span><span class="lineCov"> 81 : if (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1828 </span> : { -<span class="lineNum"> 1829 </span><span class="lineCov"> 3 : std::__insertion_sort(__first, __first + int(_S_threshold));</span> -<span class="lineNum"> 1830 </span><span class="lineCov"> 3 : std::__unguarded_insertion_sort(__first + int(_S_threshold), __last);</span> -<span class="lineNum"> 1831 </span> : } -<span class="lineNum"> 1832 </span> : else -<span class="lineNum"> 1833 </span><span class="lineCov"> 78 : std::__insertion_sort(__first, __last);</span> -<span class="lineNum"> 1834 </span><span class="lineCov"> 81 : }</span> -<span class="lineNum"> 1835 </span> : -<span class="lineNum"> 1836 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1837 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1838 </span> : void -<span class="lineNum"> 1839 </span> : __final_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1840 </span><span class="lineCov"> 3938 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1841 </span> : { -<span class="lineNum"> 1842 </span><span class="lineCov"> 3938 : if (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1843 </span> : { -<span class="lineNum"> 1844 </span><span class="lineCov"> 261 : std::__insertion_sort(__first, __first + int(_S_threshold), __comp);</span> -<span class="lineNum"> 1845 </span><span class="lineCov"> 261 : std::__unguarded_insertion_sort(__first + int(_S_threshold), __last,</span> -<span class="lineNum"> 1846 </span> : __comp); -<span class="lineNum"> 1847 </span> : } -<span class="lineNum"> 1848 </span> : else -<span class="lineNum"> 1849 </span><span class="lineCov"> 3677 : std::__insertion_sort(__first, __last, __comp);</span> -<span class="lineNum"> 1850 </span><span class="lineCov"> 3938 : }</span> -<span class="lineNum"> 1851 </span> : -<span class="lineNum"> 1852 </span> : /// This is a helper function... -<span class="lineNum"> 1853 </span> : template<typename _RandomAccessIterator, typename _Tp> -<span class="lineNum"> 1854 </span> : _RandomAccessIterator -<span class="lineNum"> 1855 </span> : __unguarded_partition(_RandomAccessIterator __first, -<span class="lineNum"> 1856 </span><span class="lineCov"> 183 : _RandomAccessIterator __last, _Tp __pivot)</span> -<span class="lineNum"> 1857 </span> : { -<span class="lineNum"> 1858 </span><span class="lineCov"> 50 : while (true)</span> -<span class="lineNum"> 1859 </span> : { -<span class="lineNum"> 1860 </span><span class="lineCov"> 6596 : while (*__first < __pivot)</span> -<span class="lineNum"> 1861 </span><span class="lineCov"> 6230 : ++__first;</span> -<span class="lineNum"> 1862 </span><span class="lineCov"> 183 : --__last;</span> -<span class="lineNum"> 1863 </span><span class="lineCov"> 6480 : while (__pivot < *__last)</span> -<span class="lineNum"> 1864 </span><span class="lineCov"> 6114 : --__last;</span> -<span class="lineNum"> 1865 </span><span class="lineCov"> 183 : if (!(__first < __last))</span> -<span class="lineNum"> 1866 </span><span class="lineCov"> 133 : return __first;</span> -<span class="lineNum"> 1867 </span><span class="lineCov"> 50 : std::iter_swap(__first, __last);</span> -<span class="lineNum"> 1868 </span><span class="lineCov"> 50 : ++__first;</span> -<span class="lineNum"> 1869 </span> : } -<span class="lineNum"> 1870 </span> : } -<span class="lineNum"> 1871 </span> : -<span class="lineNum"> 1872 </span> : /// This is a helper function... -<span class="lineNum"> 1873 </span> : template<typename _RandomAccessIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 1874 </span> : _RandomAccessIterator -<span class="lineNum"> 1875 </span> : __unguarded_partition(_RandomAccessIterator __first, -<span class="lineNum"> 1876 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1877 </span><span class="lineCov"> 7740 : _Tp __pivot, _Compare __comp)</span> -<span class="lineNum"> 1878 </span> : { -<span class="lineNum"> 1879 </span><span class="lineCov"> 7030 : while (true)</span> -<span class="lineNum"> 1880 </span> : { -<span class="lineNum"> 1881 </span><span class="lineCov"> 25088 : while (__comp(*__first, __pivot))</span> -<span class="lineNum"> 1882 </span><span class="lineCov"> 9608 : ++__first;</span> -<span class="lineNum"> 1883 </span><span class="lineCov"> 7740 : --__last;</span> -<span class="lineNum"> 1884 </span><span class="lineCov"> 23207 : while (__comp(__pivot, *__last))</span> -<span class="lineNum"> 1885 </span><span class="lineCov"> 7727 : --__last;</span> -<span class="lineNum"> 1886 </span><span class="lineCov"> 7740 : if (!(__first < __last))</span> -<span class="lineNum"> 1887 </span><span class="lineCov"> 710 : return __first;</span> -<span class="lineNum"> 1888 </span><span class="lineCov"> 7030 : std::iter_swap(__first, __last);</span> -<span class="lineNum"> 1889 </span><span class="lineCov"> 7030 : ++__first;</span> -<span class="lineNum"> 1890 </span> : } -<span class="lineNum"> 1891 </span> : } -<span class="lineNum"> 1892 </span> : -<span class="lineNum"> 1893 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1894 </span> : template<typename _RandomAccessIterator, typename _Size> -<span class="lineNum"> 1895 </span> : void -<span class="lineNum"> 1896 </span> : __introsort_loop(_RandomAccessIterator __first, -<span class="lineNum"> 1897 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1898 </span><span class="lineCov"> 214 : _Size __depth_limit)</span> -<span class="lineNum"> 1899 </span> : { -<span class="lineNum"> 1900 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1901 </span> : _ValueType; -<span class="lineNum"> 1902 </span> : -<span class="lineNum"> 1903 </span><span class="lineCov"> 561 : while (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1904 </span> : { -<span class="lineNum"> 1905 </span><span class="lineCov"> 133 : if (__depth_limit == 0)</span> -<span class="lineNum"> 1906 </span> : { -<span class="lineNum"> 1907 </span><span class="lineNoCov"> 0 : _GLIBCXX_STD_P::partial_sort(__first, __last, __last);</span> -<span class="lineNum"> 1908 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 1909 </span> : } -<span class="lineNum"> 1910 </span><span class="lineCov"> 133 : --__depth_limit;</span> -<span class="lineNum"> 1911 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 1912 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 1913 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 1914 </span> : *(__first -<span class="lineNum"> 1915 </span> : + (__last -<span class="lineNum"> 1916 </span> : - __first) -<span class="lineNum"> 1917 </span> : / 2), -<span class="lineNum"> 1918 </span> : *(__last -<span class="lineNum"> 1919 </span><span class="lineCov"> 133 : - 1))));</span> -<span class="lineNum"> 1920 </span><span class="lineCov"> 133 : std::__introsort_loop(__cut, __last, __depth_limit);</span> -<span class="lineNum"> 1921 </span><span class="lineCov"> 133 : __last = __cut;</span> -<span class="lineNum"> 1922 </span> : } -<span class="lineNum"> 1923 </span> : } -<span class="lineNum"> 1924 </span> : -<span class="lineNum"> 1925 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1926 </span> : template<typename _RandomAccessIterator, typename _Size, typename _Compare> -<span class="lineNum"> 1927 </span> : void -<span class="lineNum"> 1928 </span> : __introsort_loop(_RandomAccessIterator __first, -<span class="lineNum"> 1929 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1930 </span><span class="lineCov"> 4648 : _Size __depth_limit, _Compare __comp)</span> -<span class="lineNum"> 1931 </span> : { -<span class="lineNum"> 1932 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1933 </span> : _ValueType; -<span class="lineNum"> 1934 </span> : -<span class="lineNum"> 1935 </span><span class="lineCov"> 10006 : while (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1936 </span> : { -<span class="lineNum"> 1937 </span><span class="lineCov"> 710 : if (__depth_limit == 0)</span> -<span class="lineNum"> 1938 </span> : { -<span class="lineNum"> 1939 </span><span class="lineNoCov"> 0 : _GLIBCXX_STD_P::partial_sort(__first, __last, __last, __comp);</span> -<span class="lineNum"> 1940 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 1941 </span> : } -<span class="lineNum"> 1942 </span><span class="lineCov"> 710 : --__depth_limit;</span> -<span class="lineNum"> 1943 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 1944 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 1945 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 1946 </span> : *(__first -<span class="lineNum"> 1947 </span> : + (__last -<span class="lineNum"> 1948 </span> : - __first) -<span class="lineNum"> 1949 </span> : / 2), -<span class="lineNum"> 1950 </span> : *(__last - 1), -<span class="lineNum"> 1951 </span> : __comp)), -<span class="lineNum"> 1952 </span><span class="lineCov"> 710 : __comp);</span> -<span class="lineNum"> 1953 </span><span class="lineCov"> 710 : std::__introsort_loop(__cut, __last, __depth_limit, __comp);</span> -<span class="lineNum"> 1954 </span><span class="lineCov"> 710 : __last = __cut;</span> -<span class="lineNum"> 1955 </span> : } -<span class="lineNum"> 1956 </span> : } -<span class="lineNum"> 1957 </span> : -<span class="lineNum"> 1958 </span> : /// This is a helper function for the sort routines. Precondition: __n > 0. -<span class="lineNum"> 1959 </span> : template<typename _Size> -<span class="lineNum"> 1960 </span> : inline _Size -<span class="lineNum"> 1961 </span> : __lg(_Size __n) -<span class="lineNum"> 1962 </span> : { -<span class="lineNum"> 1963 </span> : _Size __k; -<span class="lineNum"> 1964 </span> : for (__k = 0; __n != 0; __n >>= 1) -<span class="lineNum"> 1965 </span> : ++__k; -<span class="lineNum"> 1966 </span> : return __k - 1; -<span class="lineNum"> 1967 </span> : } -<span class="lineNum"> 1968 </span> : -<span class="lineNum"> 1969 </span> : inline int -<span class="lineNum"> 1970 </span><span class="lineCov"> 3946 : __lg(int __n)</span> -<span class="lineNum"> 1971 </span><span class="lineCov"> 3946 : { return sizeof(int) * __CHAR_BIT__ - 1 - __builtin_clz(__n); }</span> -<span class="lineNum"> 1972 </span> : -<span class="lineNum"> 1973 </span> : inline long -<span class="lineNum"> 1974 </span> : __lg(long __n) -<span class="lineNum"> 1975 </span> : { return sizeof(long) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); } -<span class="lineNum"> 1976 </span> : -<span class="lineNum"> 1977 </span> : inline long long -<span class="lineNum"> 1978 </span> : __lg(long long __n) -<span class="lineNum"> 1979 </span> : { return sizeof(long long) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); } -<span class="lineNum"> 1980 </span> : -<span class="lineNum"> 1981 </span> : // sort -<span class="lineNum"> 1982 </span> : -<span class="lineNum"> 1983 </span> : template<typename _RandomAccessIterator, typename _Size> -<span class="lineNum"> 1984 </span> : void -<span class="lineNum"> 1985 </span> : __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 1986 </span> : _RandomAccessIterator __last, _Size __depth_limit) -<span class="lineNum"> 1987 </span> : { -<span class="lineNum"> 1988 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1989 </span> : _ValueType; -<span class="lineNum"> 1990 </span> : -<span class="lineNum"> 1991 </span> : while (__last - __first > 3) -<span class="lineNum"> 1992 </span> : { -<span class="lineNum"> 1993 </span> : if (__depth_limit == 0) -<span class="lineNum"> 1994 </span> : { -<span class="lineNum"> 1995 </span> : std::__heap_select(__first, __nth + 1, __last); -<span class="lineNum"> 1996 </span> : -<span class="lineNum"> 1997 </span> : // Place the nth largest element in its final position. -<span class="lineNum"> 1998 </span> : std::iter_swap(__first, __nth); -<span class="lineNum"> 1999 </span> : return; -<span class="lineNum"> 2000 </span> : } -<span class="lineNum"> 2001 </span> : --__depth_limit; -<span class="lineNum"> 2002 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 2003 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 2004 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 2005 </span> : *(__first -<span class="lineNum"> 2006 </span> : + (__last -<span class="lineNum"> 2007 </span> : - __first) -<span class="lineNum"> 2008 </span> : / 2), -<span class="lineNum"> 2009 </span> : *(__last -<span class="lineNum"> 2010 </span> : - 1)))); -<span class="lineNum"> 2011 </span> : if (__cut <= __nth) -<span class="lineNum"> 2012 </span> : __first = __cut; -<span class="lineNum"> 2013 </span> : else -<span class="lineNum"> 2014 </span> : __last = __cut; -<span class="lineNum"> 2015 </span> : } -<span class="lineNum"> 2016 </span> : std::__insertion_sort(__first, __last); -<span class="lineNum"> 2017 </span> : } -<span class="lineNum"> 2018 </span> : -<span class="lineNum"> 2019 </span> : template<typename _RandomAccessIterator, typename _Size, typename _Compare> -<span class="lineNum"> 2020 </span> : void -<span class="lineNum"> 2021 </span> : __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 2022 </span> : _RandomAccessIterator __last, _Size __depth_limit, -<span class="lineNum"> 2023 </span> : _Compare __comp) -<span class="lineNum"> 2024 </span> : { -<span class="lineNum"> 2025 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 2026 </span> : _ValueType; -<span class="lineNum"> 2027 </span> : -<span class="lineNum"> 2028 </span> : while (__last - __first > 3) -<span class="lineNum"> 2029 </span> : { -<span class="lineNum"> 2030 </span> : if (__depth_limit == 0) -<span class="lineNum"> 2031 </span> : { -<span class="lineNum"> 2032 </span> : std::__heap_select(__first, __nth + 1, __last, __comp); -<span class="lineNum"> 2033 </span> : // Place the nth largest element in its final position. -<span class="lineNum"> 2034 </span> : std::iter_swap(__first, __nth); -<span class="lineNum"> 2035 </span> : return; -<span class="lineNum"> 2036 </span> : } -<span class="lineNum"> 2037 </span> : --__depth_limit; -<span class="lineNum"> 2038 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 2039 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 2040 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 2041 </span> : *(__first -<span class="lineNum"> 2042 </span> : + (__last -<span class="lineNum"> 2043 </span> : - __first) -<span class="lineNum"> 2044 </span> : / 2), -<span class="lineNum"> 2045 </span> : *(__last - 1), -<span class="lineNum"> 2046 </span> : __comp)), -<span class="lineNum"> 2047 </span> : __comp); -<span class="lineNum"> 2048 </span> : if (__cut <= __nth) -<span class="lineNum"> 2049 </span> : __first = __cut; -<span class="lineNum"> 2050 </span> : else -<span class="lineNum"> 2051 </span> : __last = __cut; -<span class="lineNum"> 2052 </span> : } -<span class="lineNum"> 2053 </span> : std::__insertion_sort(__first, __last, __comp); -<span class="lineNum"> 2054 </span> : } -<span class="lineNum"> 2055 </span> : -<span class="lineNum"> 2056 </span> : // nth_element -<span class="lineNum"> 2057 </span> : -<span class="lineNum"> 2058 </span> : /** -<span class="lineNum"> 2059 </span> : * @brief Finds the first position in which @a val could be inserted -<span class="lineNum"> 2060 </span> : * without changing the ordering. -<span class="lineNum"> 2061 </span> : * @param first An iterator. -<span class="lineNum"> 2062 </span> : * @param last Another iterator. -<span class="lineNum"> 2063 </span> : * @param val The search term. -<span class="lineNum"> 2064 </span> : * @return An iterator pointing to the first element "not less -<span class="lineNum"> 2065 </span> : * than" @a val, or end() if every element is less than -<span class="lineNum"> 2066 </span> : * @a val. -<span class="lineNum"> 2067 </span> : * @ingroup binarysearch -<span class="lineNum"> 2068 </span> : */ -<span class="lineNum"> 2069 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2070 </span> : _ForwardIterator -<span class="lineNum"> 2071 </span> : lower_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2072 </span> : const _Tp& __val) -<span class="lineNum"> 2073 </span> : { -<span class="lineNum"> 2074 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2075 </span> : _ValueType; -<span class="lineNum"> 2076 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2077 </span> : _DistanceType; -<span class="lineNum"> 2078 </span> : -<span class="lineNum"> 2079 </span> : // concept requirements -<span class="lineNum"> 2080 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2081 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) -<span class="lineNum"> 2082 </span> : __glibcxx_requires_partitioned_lower(__first, __last, __val); -<span class="lineNum"> 2083 </span> : -<span class="lineNum"> 2084 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2085 </span> : _DistanceType __half; -<span class="lineNum"> 2086 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2087 </span> : -<span class="lineNum"> 2088 </span> : while (__len > 0) -<span class="lineNum"> 2089 </span> : { -<span class="lineNum"> 2090 </span> : __half = __len >> 1; -<span class="lineNum"> 2091 </span> : __middle = __first; -<span class="lineNum"> 2092 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2093 </span> : if (*__middle < __val) -<span class="lineNum"> 2094 </span> : { -<span class="lineNum"> 2095 </span> : __first = __middle; -<span class="lineNum"> 2096 </span> : ++__first; -<span class="lineNum"> 2097 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2098 </span> : } -<span class="lineNum"> 2099 </span> : else -<span class="lineNum"> 2100 </span> : __len = __half; -<span class="lineNum"> 2101 </span> : } -<span class="lineNum"> 2102 </span> : return __first; -<span class="lineNum"> 2103 </span> : } -<span class="lineNum"> 2104 </span> : -<span class="lineNum"> 2105 </span> : /** -<span class="lineNum"> 2106 </span> : * @brief Finds the first position in which @a val could be inserted -<span class="lineNum"> 2107 </span> : * without changing the ordering. -<span class="lineNum"> 2108 </span> : * @param first An iterator. -<span class="lineNum"> 2109 </span> : * @param last Another iterator. -<span class="lineNum"> 2110 </span> : * @param val The search term. -<span class="lineNum"> 2111 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2112 </span> : * @return An iterator pointing to the first element "not less than" @a val, -<span class="lineNum"> 2113 </span> : * or end() if every element is less than @a val. -<span class="lineNum"> 2114 </span> : * @ingroup binarysearch -<span class="lineNum"> 2115 </span> : * -<span class="lineNum"> 2116 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2117 </span> : * the function used for the initial sort. -<span class="lineNum"> 2118 </span> : */ -<span class="lineNum"> 2119 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2120 </span> : _ForwardIterator -<span class="lineNum"> 2121 </span> : lower_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2122 </span> : const _Tp& __val, _Compare __comp) -<span class="lineNum"> 2123 </span> : { -<span class="lineNum"> 2124 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2125 </span> : _ValueType; -<span class="lineNum"> 2126 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2127 </span> : _DistanceType; -<span class="lineNum"> 2128 </span> : -<span class="lineNum"> 2129 </span> : // concept requirements -<span class="lineNum"> 2130 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2131 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2132 </span> : _ValueType, _Tp>) -<span class="lineNum"> 2133 </span> : __glibcxx_requires_partitioned_lower_pred(__first, __last, -<span class="lineNum"> 2134 </span> : __val, __comp); -<span class="lineNum"> 2135 </span> : -<span class="lineNum"> 2136 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2137 </span> : _DistanceType __half; -<span class="lineNum"> 2138 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2139 </span> : -<span class="lineNum"> 2140 </span> : while (__len > 0) -<span class="lineNum"> 2141 </span> : { -<span class="lineNum"> 2142 </span> : __half = __len >> 1; -<span class="lineNum"> 2143 </span> : __middle = __first; -<span class="lineNum"> 2144 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2145 </span> : if (__comp(*__middle, __val)) -<span class="lineNum"> 2146 </span> : { -<span class="lineNum"> 2147 </span> : __first = __middle; -<span class="lineNum"> 2148 </span> : ++__first; -<span class="lineNum"> 2149 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2150 </span> : } -<span class="lineNum"> 2151 </span> : else -<span class="lineNum"> 2152 </span> : __len = __half; -<span class="lineNum"> 2153 </span> : } -<span class="lineNum"> 2154 </span> : return __first; -<span class="lineNum"> 2155 </span> : } -<span class="lineNum"> 2156 </span> : -<span class="lineNum"> 2157 </span> : /** -<span class="lineNum"> 2158 </span> : * @brief Finds the last position in which @a val could be inserted -<span class="lineNum"> 2159 </span> : * without changing the ordering. -<span class="lineNum"> 2160 </span> : * @param first An iterator. -<span class="lineNum"> 2161 </span> : * @param last Another iterator. -<span class="lineNum"> 2162 </span> : * @param val The search term. -<span class="lineNum"> 2163 </span> : * @return An iterator pointing to the first element greater than @a val, -<span class="lineNum"> 2164 </span> : * or end() if no elements are greater than @a val. -<span class="lineNum"> 2165 </span> : * @ingroup binarysearch -<span class="lineNum"> 2166 </span> : */ -<span class="lineNum"> 2167 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2168 </span> : _ForwardIterator -<span class="lineNum"> 2169 </span> : upper_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2170 </span> : const _Tp& __val) -<span class="lineNum"> 2171 </span> : { -<span class="lineNum"> 2172 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2173 </span> : _ValueType; -<span class="lineNum"> 2174 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2175 </span> : _DistanceType; -<span class="lineNum"> 2176 </span> : -<span class="lineNum"> 2177 </span> : // concept requirements -<span class="lineNum"> 2178 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2179 </span> : __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) -<span class="lineNum"> 2180 </span> : __glibcxx_requires_partitioned_upper(__first, __last, __val); -<span class="lineNum"> 2181 </span> : -<span class="lineNum"> 2182 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2183 </span> : _DistanceType __half; -<span class="lineNum"> 2184 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2185 </span> : -<span class="lineNum"> 2186 </span> : while (__len > 0) -<span class="lineNum"> 2187 </span> : { -<span class="lineNum"> 2188 </span> : __half = __len >> 1; -<span class="lineNum"> 2189 </span> : __middle = __first; -<span class="lineNum"> 2190 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2191 </span> : if (__val < *__middle) -<span class="lineNum"> 2192 </span> : __len = __half; -<span class="lineNum"> 2193 </span> : else -<span class="lineNum"> 2194 </span> : { -<span class="lineNum"> 2195 </span> : __first = __middle; -<span class="lineNum"> 2196 </span> : ++__first; -<span class="lineNum"> 2197 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2198 </span> : } -<span class="lineNum"> 2199 </span> : } -<span class="lineNum"> 2200 </span> : return __first; -<span class="lineNum"> 2201 </span> : } -<span class="lineNum"> 2202 </span> : -<span class="lineNum"> 2203 </span> : /** -<span class="lineNum"> 2204 </span> : * @brief Finds the last position in which @a val could be inserted -<span class="lineNum"> 2205 </span> : * without changing the ordering. -<span class="lineNum"> 2206 </span> : * @param first An iterator. -<span class="lineNum"> 2207 </span> : * @param last Another iterator. -<span class="lineNum"> 2208 </span> : * @param val The search term. -<span class="lineNum"> 2209 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2210 </span> : * @return An iterator pointing to the first element greater than @a val, -<span class="lineNum"> 2211 </span> : * or end() if no elements are greater than @a val. -<span class="lineNum"> 2212 </span> : * @ingroup binarysearch -<span class="lineNum"> 2213 </span> : * -<span class="lineNum"> 2214 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2215 </span> : * the function used for the initial sort. -<span class="lineNum"> 2216 </span> : */ -<span class="lineNum"> 2217 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2218 </span> : _ForwardIterator -<span class="lineNum"> 2219 </span> : upper_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2220 </span> : const _Tp& __val, _Compare __comp) -<span class="lineNum"> 2221 </span> : { -<span class="lineNum"> 2222 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2223 </span> : _ValueType; -<span class="lineNum"> 2224 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2225 </span> : _DistanceType; -<span class="lineNum"> 2226 </span> : -<span class="lineNum"> 2227 </span> : // concept requirements -<span class="lineNum"> 2228 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2229 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2230 </span> : _Tp, _ValueType>) -<span class="lineNum"> 2231 </span> : __glibcxx_requires_partitioned_upper_pred(__first, __last, -<span class="lineNum"> 2232 </span> : __val, __comp); -<span class="lineNum"> 2233 </span> : -<span class="lineNum"> 2234 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2235 </span> : _DistanceType __half; -<span class="lineNum"> 2236 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2237 </span> : -<span class="lineNum"> 2238 </span> : while (__len > 0) -<span class="lineNum"> 2239 </span> : { -<span class="lineNum"> 2240 </span> : __half = __len >> 1; -<span class="lineNum"> 2241 </span> : __middle = __first; -<span class="lineNum"> 2242 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2243 </span> : if (__comp(__val, *__middle)) -<span class="lineNum"> 2244 </span> : __len = __half; -<span class="lineNum"> 2245 </span> : else -<span class="lineNum"> 2246 </span> : { -<span class="lineNum"> 2247 </span> : __first = __middle; -<span class="lineNum"> 2248 </span> : ++__first; -<span class="lineNum"> 2249 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2250 </span> : } -<span class="lineNum"> 2251 </span> : } -<span class="lineNum"> 2252 </span> : return __first; -<span class="lineNum"> 2253 </span> : } -<span class="lineNum"> 2254 </span> : -<span class="lineNum"> 2255 </span> : /** -<span class="lineNum"> 2256 </span> : * @brief Finds the largest subrange in which @a val could be inserted -<span class="lineNum"> 2257 </span> : * at any place in it without changing the ordering. -<span class="lineNum"> 2258 </span> : * @param first An iterator. -<span class="lineNum"> 2259 </span> : * @param last Another iterator. -<span class="lineNum"> 2260 </span> : * @param val The search term. -<span class="lineNum"> 2261 </span> : * @return An pair of iterators defining the subrange. -<span class="lineNum"> 2262 </span> : * @ingroup binarysearch -<span class="lineNum"> 2263 </span> : * -<span class="lineNum"> 2264 </span> : * This is equivalent to -<span class="lineNum"> 2265 </span> : * @code -<span class="lineNum"> 2266 </span> : * std::make_pair(lower_bound(first, last, val), -<span class="lineNum"> 2267 </span> : * upper_bound(first, last, val)) -<span class="lineNum"> 2268 </span> : * @endcode -<span class="lineNum"> 2269 </span> : * but does not actually call those functions. -<span class="lineNum"> 2270 </span> : */ -<span class="lineNum"> 2271 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2272 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 2273 </span> : equal_range(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2274 </span> : const _Tp& __val) -<span class="lineNum"> 2275 </span> : { -<span class="lineNum"> 2276 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2277 </span> : _ValueType; -<span class="lineNum"> 2278 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2279 </span> : _DistanceType; -<span class="lineNum"> 2280 </span> : -<span class="lineNum"> 2281 </span> : // concept requirements -<span class="lineNum"> 2282 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2283 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) -<span class="lineNum"> 2284 </span> : __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) -<span class="lineNum"> 2285 </span> : __glibcxx_requires_partitioned_lower(__first, __last, __val); -<span class="lineNum"> 2286 </span> : __glibcxx_requires_partitioned_upper(__first, __last, __val); -<span class="lineNum"> 2287 </span> : -<span class="lineNum"> 2288 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2289 </span> : _DistanceType __half; -<span class="lineNum"> 2290 </span> : _ForwardIterator __middle, __left, __right; -<span class="lineNum"> 2291 </span> : -<span class="lineNum"> 2292 </span> : while (__len > 0) -<span class="lineNum"> 2293 </span> : { -<span class="lineNum"> 2294 </span> : __half = __len >> 1; -<span class="lineNum"> 2295 </span> : __middle = __first; -<span class="lineNum"> 2296 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2297 </span> : if (*__middle < __val) -<span class="lineNum"> 2298 </span> : { -<span class="lineNum"> 2299 </span> : __first = __middle; -<span class="lineNum"> 2300 </span> : ++__first; -<span class="lineNum"> 2301 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2302 </span> : } -<span class="lineNum"> 2303 </span> : else if (__val < *__middle) -<span class="lineNum"> 2304 </span> : __len = __half; -<span class="lineNum"> 2305 </span> : else -<span class="lineNum"> 2306 </span> : { -<span class="lineNum"> 2307 </span> : __left = std::lower_bound(__first, __middle, __val); -<span class="lineNum"> 2308 </span> : std::advance(__first, __len); -<span class="lineNum"> 2309 </span> : __right = std::upper_bound(++__middle, __first, __val); -<span class="lineNum"> 2310 </span> : return pair<_ForwardIterator, _ForwardIterator>(__left, __right); -<span class="lineNum"> 2311 </span> : } -<span class="lineNum"> 2312 </span> : } -<span class="lineNum"> 2313 </span> : return pair<_ForwardIterator, _ForwardIterator>(__first, __first); -<span class="lineNum"> 2314 </span> : } -<span class="lineNum"> 2315 </span> : -<span class="lineNum"> 2316 </span> : /** -<span class="lineNum"> 2317 </span> : * @brief Finds the largest subrange in which @a val could be inserted -<span class="lineNum"> 2318 </span> : * at any place in it without changing the ordering. -<span class="lineNum"> 2319 </span> : * @param first An iterator. -<span class="lineNum"> 2320 </span> : * @param last Another iterator. -<span class="lineNum"> 2321 </span> : * @param val The search term. -<span class="lineNum"> 2322 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2323 </span> : * @return An pair of iterators defining the subrange. -<span class="lineNum"> 2324 </span> : * @ingroup binarysearch -<span class="lineNum"> 2325 </span> : * -<span class="lineNum"> 2326 </span> : * This is equivalent to -<span class="lineNum"> 2327 </span> : * @code -<span class="lineNum"> 2328 </span> : * std::make_pair(lower_bound(first, last, val, comp), -<span class="lineNum"> 2329 </span> : * upper_bound(first, last, val, comp)) -<span class="lineNum"> 2330 </span> : * @endcode -<span class="lineNum"> 2331 </span> : * but does not actually call those functions. -<span class="lineNum"> 2332 </span> : */ -<span class="lineNum"> 2333 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2334 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 2335 </span> : equal_range(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2336 </span> : const _Tp& __val, -<span class="lineNum"> 2337 </span> : _Compare __comp) -<span class="lineNum"> 2338 </span> : { -<span class="lineNum"> 2339 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2340 </span> : _ValueType; -<span class="lineNum"> 2341 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2342 </span> : _DistanceType; -<span class="lineNum"> 2343 </span> : -<span class="lineNum"> 2344 </span> : // concept requirements -<span class="lineNum"> 2345 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2346 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2347 </span> : _ValueType, _Tp>) -<span class="lineNum"> 2348 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2349 </span> : _Tp, _ValueType>) -<span class="lineNum"> 2350 </span> : __glibcxx_requires_partitioned_lower_pred(__first, __last, -<span class="lineNum"> 2351 </span> : __val, __comp); -<span class="lineNum"> 2352 </span> : __glibcxx_requires_partitioned_upper_pred(__first, __last, -<span class="lineNum"> 2353 </span> : __val, __comp); -<span class="lineNum"> 2354 </span> : -<span class="lineNum"> 2355 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2356 </span> : _DistanceType __half; -<span class="lineNum"> 2357 </span> : _ForwardIterator __middle, __left, __right; -<span class="lineNum"> 2358 </span> : -<span class="lineNum"> 2359 </span> : while (__len > 0) -<span class="lineNum"> 2360 </span> : { -<span class="lineNum"> 2361 </span> : __half = __len >> 1; -<span class="lineNum"> 2362 </span> : __middle = __first; -<span class="lineNum"> 2363 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2364 </span> : if (__comp(*__middle, __val)) -<span class="lineNum"> 2365 </span> : { -<span class="lineNum"> 2366 </span> : __first = __middle; -<span class="lineNum"> 2367 </span> : ++__first; -<span class="lineNum"> 2368 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2369 </span> : } -<span class="lineNum"> 2370 </span> : else if (__comp(__val, *__middle)) -<span class="lineNum"> 2371 </span> : __len = __half; -<span class="lineNum"> 2372 </span> : else -<span class="lineNum"> 2373 </span> : { -<span class="lineNum"> 2374 </span> : __left = std::lower_bound(__first, __middle, __val, __comp); -<span class="lineNum"> 2375 </span> : std::advance(__first, __len); -<span class="lineNum"> 2376 </span> : __right = std::upper_bound(++__middle, __first, __val, __comp); -<span class="lineNum"> 2377 </span> : return pair<_ForwardIterator, _ForwardIterator>(__left, __right); -<span class="lineNum"> 2378 </span> : } -<span class="lineNum"> 2379 </span> : } -<span class="lineNum"> 2380 </span> : return pair<_ForwardIterator, _ForwardIterator>(__first, __first); -<span class="lineNum"> 2381 </span> : } -<span class="lineNum"> 2382 </span> : -<span class="lineNum"> 2383 </span> : /** -<span class="lineNum"> 2384 </span> : * @brief Determines whether an element exists in a range. -<span class="lineNum"> 2385 </span> : * @param first An iterator. -<span class="lineNum"> 2386 </span> : * @param last Another iterator. -<span class="lineNum"> 2387 </span> : * @param val The search term. -<span class="lineNum"> 2388 </span> : * @return True if @a val (or its equivalent) is in [@a first,@a last ]. -<span class="lineNum"> 2389 </span> : * @ingroup binarysearch -<span class="lineNum"> 2390 </span> : * -<span class="lineNum"> 2391 </span> : * Note that this does not actually return an iterator to @a val. For -<span class="lineNum"> 2392 </span> : * that, use std::find or a container's specialized find member functions. -<span class="lineNum"> 2393 </span> : */ -<span class="lineNum"> 2394 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2395 </span> : bool -<span class="lineNum"> 2396 </span> : binary_search(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2397 </span> : const _Tp& __val) -<span class="lineNum"> 2398 </span> : { -<span class="lineNum"> 2399 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2400 </span> : _ValueType; -<span class="lineNum"> 2401 </span> : -<span class="lineNum"> 2402 </span> : // concept requirements -<span class="lineNum"> 2403 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2404 </span> : __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) -<span class="lineNum"> 2405 </span> : __glibcxx_requires_partitioned_lower(__first, __last, __val); -<span class="lineNum"> 2406 </span> : __glibcxx_requires_partitioned_upper(__first, __last, __val); -<span class="lineNum"> 2407 </span> : -<span class="lineNum"> 2408 </span> : _ForwardIterator __i = std::lower_bound(__first, __last, __val); -<span class="lineNum"> 2409 </span> : return __i != __last && !(__val < *__i); -<span class="lineNum"> 2410 </span> : } -<span class="lineNum"> 2411 </span> : -<span class="lineNum"> 2412 </span> : /** -<span class="lineNum"> 2413 </span> : * @brief Determines whether an element exists in a range. -<span class="lineNum"> 2414 </span> : * @param first An iterator. -<span class="lineNum"> 2415 </span> : * @param last Another iterator. -<span class="lineNum"> 2416 </span> : * @param val The search term. -<span class="lineNum"> 2417 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2418 </span> : * @return True if @a val (or its equivalent) is in [@a first,@a last ]. -<span class="lineNum"> 2419 </span> : * @ingroup binarysearch -<span class="lineNum"> 2420 </span> : * -<span class="lineNum"> 2421 </span> : * Note that this does not actually return an iterator to @a val. For -<span class="lineNum"> 2422 </span> : * that, use std::find or a container's specialized find member functions. -<span class="lineNum"> 2423 </span> : * -<span class="lineNum"> 2424 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2425 </span> : * the function used for the initial sort. -<span class="lineNum"> 2426 </span> : */ -<span class="lineNum"> 2427 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2428 </span> : bool -<span class="lineNum"> 2429 </span> : binary_search(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2430 </span> : const _Tp& __val, _Compare __comp) -<span class="lineNum"> 2431 </span> : { -<span class="lineNum"> 2432 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2433 </span> : _ValueType; -<span class="lineNum"> 2434 </span> : -<span class="lineNum"> 2435 </span> : // concept requirements -<span class="lineNum"> 2436 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2437 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2438 </span> : _Tp, _ValueType>) -<span class="lineNum"> 2439 </span> : __glibcxx_requires_partitioned_lower_pred(__first, __last, -<span class="lineNum"> 2440 </span> : __val, __comp); -<span class="lineNum"> 2441 </span> : __glibcxx_requires_partitioned_upper_pred(__first, __last, -<span class="lineNum"> 2442 </span> : __val, __comp); -<span class="lineNum"> 2443 </span> : -<span class="lineNum"> 2444 </span> : _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); -<span class="lineNum"> 2445 </span> : return __i != __last && !bool(__comp(__val, *__i)); -<span class="lineNum"> 2446 </span> : } -<span class="lineNum"> 2447 </span> : -<span class="lineNum"> 2448 </span> : // merge -<span class="lineNum"> 2449 </span> : -<span class="lineNum"> 2450 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2451 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 2452 </span> : typename _BidirectionalIterator3> -<span class="lineNum"> 2453 </span> : _BidirectionalIterator3 -<span class="lineNum"> 2454 </span> : __merge_backward(_BidirectionalIterator1 __first1, -<span class="lineNum"> 2455 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 2456 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 2457 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 2458 </span> : _BidirectionalIterator3 __result) -<span class="lineNum"> 2459 </span> : { -<span class="lineNum"> 2460 </span> : if (__first1 == __last1) -<span class="lineNum"> 2461 </span> : return std::copy_backward(__first2, __last2, __result); -<span class="lineNum"> 2462 </span> : if (__first2 == __last2) -<span class="lineNum"> 2463 </span> : return std::copy_backward(__first1, __last1, __result); -<span class="lineNum"> 2464 </span> : --__last1; -<span class="lineNum"> 2465 </span> : --__last2; -<span class="lineNum"> 2466 </span> : while (true) -<span class="lineNum"> 2467 </span> : { -<span class="lineNum"> 2468 </span> : if (*__last2 < *__last1) -<span class="lineNum"> 2469 </span> : { -<span class="lineNum"> 2470 </span> : *--__result = *__last1; -<span class="lineNum"> 2471 </span> : if (__first1 == __last1) -<span class="lineNum"> 2472 </span> : return std::copy_backward(__first2, ++__last2, __result); -<span class="lineNum"> 2473 </span> : --__last1; -<span class="lineNum"> 2474 </span> : } -<span class="lineNum"> 2475 </span> : else -<span class="lineNum"> 2476 </span> : { -<span class="lineNum"> 2477 </span> : *--__result = *__last2; -<span class="lineNum"> 2478 </span> : if (__first2 == __last2) -<span class="lineNum"> 2479 </span> : return std::copy_backward(__first1, ++__last1, __result); -<span class="lineNum"> 2480 </span> : --__last2; -<span class="lineNum"> 2481 </span> : } -<span class="lineNum"> 2482 </span> : } -<span class="lineNum"> 2483 </span> : } -<span class="lineNum"> 2484 </span> : -<span class="lineNum"> 2485 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2486 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 2487 </span> : typename _BidirectionalIterator3, typename _Compare> -<span class="lineNum"> 2488 </span> : _BidirectionalIterator3 -<span class="lineNum"> 2489 </span> : __merge_backward(_BidirectionalIterator1 __first1, -<span class="lineNum"> 2490 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 2491 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 2492 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 2493 </span> : _BidirectionalIterator3 __result, -<span class="lineNum"> 2494 </span> : _Compare __comp) -<span class="lineNum"> 2495 </span> : { -<span class="lineNum"> 2496 </span> : if (__first1 == __last1) -<span class="lineNum"> 2497 </span> : return std::copy_backward(__first2, __last2, __result); -<span class="lineNum"> 2498 </span> : if (__first2 == __last2) -<span class="lineNum"> 2499 </span> : return std::copy_backward(__first1, __last1, __result); -<span class="lineNum"> 2500 </span> : --__last1; -<span class="lineNum"> 2501 </span> : --__last2; -<span class="lineNum"> 2502 </span> : while (true) -<span class="lineNum"> 2503 </span> : { -<span class="lineNum"> 2504 </span> : if (__comp(*__last2, *__last1)) -<span class="lineNum"> 2505 </span> : { -<span class="lineNum"> 2506 </span> : *--__result = *__last1; -<span class="lineNum"> 2507 </span> : if (__first1 == __last1) -<span class="lineNum"> 2508 </span> : return std::copy_backward(__first2, ++__last2, __result); -<span class="lineNum"> 2509 </span> : --__last1; -<span class="lineNum"> 2510 </span> : } -<span class="lineNum"> 2511 </span> : else -<span class="lineNum"> 2512 </span> : { -<span class="lineNum"> 2513 </span> : *--__result = *__last2; -<span class="lineNum"> 2514 </span> : if (__first2 == __last2) -<span class="lineNum"> 2515 </span> : return std::copy_backward(__first1, ++__last1, __result); -<span class="lineNum"> 2516 </span> : --__last2; -<span class="lineNum"> 2517 </span> : } -<span class="lineNum"> 2518 </span> : } -<span class="lineNum"> 2519 </span> : } -<span class="lineNum"> 2520 </span> : -<span class="lineNum"> 2521 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2522 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 2523 </span> : typename _Distance> -<span class="lineNum"> 2524 </span> : _BidirectionalIterator1 -<span class="lineNum"> 2525 </span> : __rotate_adaptive(_BidirectionalIterator1 __first, -<span class="lineNum"> 2526 </span> : _BidirectionalIterator1 __middle, -<span class="lineNum"> 2527 </span> : _BidirectionalIterator1 __last, -<span class="lineNum"> 2528 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2529 </span> : _BidirectionalIterator2 __buffer, -<span class="lineNum"> 2530 </span> : _Distance __buffer_size) -<span class="lineNum"> 2531 </span> : { -<span class="lineNum"> 2532 </span> : _BidirectionalIterator2 __buffer_end; -<span class="lineNum"> 2533 </span> : if (__len1 > __len2 && __len2 <= __buffer_size) -<span class="lineNum"> 2534 </span> : { -<span class="lineNum"> 2535 </span> : __buffer_end = std::copy(__middle, __last, __buffer); -<span class="lineNum"> 2536 </span> : std::copy_backward(__first, __middle, __last); -<span class="lineNum"> 2537 </span> : return std::copy(__buffer, __buffer_end, __first); -<span class="lineNum"> 2538 </span> : } -<span class="lineNum"> 2539 </span> : else if (__len1 <= __buffer_size) -<span class="lineNum"> 2540 </span> : { -<span class="lineNum"> 2541 </span> : __buffer_end = std::copy(__first, __middle, __buffer); -<span class="lineNum"> 2542 </span> : std::copy(__middle, __last, __first); -<span class="lineNum"> 2543 </span> : return std::copy_backward(__buffer, __buffer_end, __last); -<span class="lineNum"> 2544 </span> : } -<span class="lineNum"> 2545 </span> : else -<span class="lineNum"> 2546 </span> : { -<span class="lineNum"> 2547 </span> : std::rotate(__first, __middle, __last); -<span class="lineNum"> 2548 </span> : std::advance(__first, std::distance(__middle, __last)); -<span class="lineNum"> 2549 </span> : return __first; -<span class="lineNum"> 2550 </span> : } -<span class="lineNum"> 2551 </span> : } -<span class="lineNum"> 2552 </span> : -<span class="lineNum"> 2553 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2554 </span> : template<typename _BidirectionalIterator, typename _Distance, -<span class="lineNum"> 2555 </span> : typename _Pointer> -<span class="lineNum"> 2556 </span> : void -<span class="lineNum"> 2557 </span> : __merge_adaptive(_BidirectionalIterator __first, -<span class="lineNum"> 2558 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2559 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2560 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2561 </span> : _Pointer __buffer, _Distance __buffer_size) -<span class="lineNum"> 2562 </span> : { -<span class="lineNum"> 2563 </span> : if (__len1 <= __len2 && __len1 <= __buffer_size) -<span class="lineNum"> 2564 </span> : { -<span class="lineNum"> 2565 </span> : _Pointer __buffer_end = std::copy(__first, __middle, __buffer); -<span class="lineNum"> 2566 </span> : _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, -<span class="lineNum"> 2567 </span> : __first); -<span class="lineNum"> 2568 </span> : } -<span class="lineNum"> 2569 </span> : else if (__len2 <= __buffer_size) -<span class="lineNum"> 2570 </span> : { -<span class="lineNum"> 2571 </span> : _Pointer __buffer_end = std::copy(__middle, __last, __buffer); -<span class="lineNum"> 2572 </span> : std::__merge_backward(__first, __middle, __buffer, -<span class="lineNum"> 2573 </span> : __buffer_end, __last); -<span class="lineNum"> 2574 </span> : } -<span class="lineNum"> 2575 </span> : else -<span class="lineNum"> 2576 </span> : { -<span class="lineNum"> 2577 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2578 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2579 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2580 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2581 </span> : if (__len1 > __len2) -<span class="lineNum"> 2582 </span> : { -<span class="lineNum"> 2583 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2584 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2585 </span> : __second_cut = std::lower_bound(__middle, __last, -<span class="lineNum"> 2586 </span> : *__first_cut); -<span class="lineNum"> 2587 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2588 </span> : } -<span class="lineNum"> 2589 </span> : else -<span class="lineNum"> 2590 </span> : { -<span class="lineNum"> 2591 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2592 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2593 </span> : __first_cut = std::upper_bound(__first, __middle, -<span class="lineNum"> 2594 </span> : *__second_cut); -<span class="lineNum"> 2595 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2596 </span> : } -<span class="lineNum"> 2597 </span> : _BidirectionalIterator __new_middle = -<span class="lineNum"> 2598 </span> : std::__rotate_adaptive(__first_cut, __middle, __second_cut, -<span class="lineNum"> 2599 </span> : __len1 - __len11, __len22, __buffer, -<span class="lineNum"> 2600 </span> : __buffer_size); -<span class="lineNum"> 2601 </span> : std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, -<span class="lineNum"> 2602 </span> : __len22, __buffer, __buffer_size); -<span class="lineNum"> 2603 </span> : std::__merge_adaptive(__new_middle, __second_cut, __last, -<span class="lineNum"> 2604 </span> : __len1 - __len11, -<span class="lineNum"> 2605 </span> : __len2 - __len22, __buffer, __buffer_size); -<span class="lineNum"> 2606 </span> : } -<span class="lineNum"> 2607 </span> : } -<span class="lineNum"> 2608 </span> : -<span class="lineNum"> 2609 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2610 </span> : template<typename _BidirectionalIterator, typename _Distance, -<span class="lineNum"> 2611 </span> : typename _Pointer, typename _Compare> -<span class="lineNum"> 2612 </span> : void -<span class="lineNum"> 2613 </span> : __merge_adaptive(_BidirectionalIterator __first, -<span class="lineNum"> 2614 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2615 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2616 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2617 </span> : _Pointer __buffer, _Distance __buffer_size, -<span class="lineNum"> 2618 </span> : _Compare __comp) -<span class="lineNum"> 2619 </span> : { -<span class="lineNum"> 2620 </span> : if (__len1 <= __len2 && __len1 <= __buffer_size) -<span class="lineNum"> 2621 </span> : { -<span class="lineNum"> 2622 </span> : _Pointer __buffer_end = std::copy(__first, __middle, __buffer); -<span class="lineNum"> 2623 </span> : _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, -<span class="lineNum"> 2624 </span> : __first, __comp); -<span class="lineNum"> 2625 </span> : } -<span class="lineNum"> 2626 </span> : else if (__len2 <= __buffer_size) -<span class="lineNum"> 2627 </span> : { -<span class="lineNum"> 2628 </span> : _Pointer __buffer_end = std::copy(__middle, __last, __buffer); -<span class="lineNum"> 2629 </span> : std::__merge_backward(__first, __middle, __buffer, __buffer_end, -<span class="lineNum"> 2630 </span> : __last, __comp); -<span class="lineNum"> 2631 </span> : } -<span class="lineNum"> 2632 </span> : else -<span class="lineNum"> 2633 </span> : { -<span class="lineNum"> 2634 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2635 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2636 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2637 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2638 </span> : if (__len1 > __len2) -<span class="lineNum"> 2639 </span> : { -<span class="lineNum"> 2640 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2641 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2642 </span> : __second_cut = std::lower_bound(__middle, __last, *__first_cut, -<span class="lineNum"> 2643 </span> : __comp); -<span class="lineNum"> 2644 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2645 </span> : } -<span class="lineNum"> 2646 </span> : else -<span class="lineNum"> 2647 </span> : { -<span class="lineNum"> 2648 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2649 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2650 </span> : __first_cut = std::upper_bound(__first, __middle, *__second_cut, -<span class="lineNum"> 2651 </span> : __comp); -<span class="lineNum"> 2652 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2653 </span> : } -<span class="lineNum"> 2654 </span> : _BidirectionalIterator __new_middle = -<span class="lineNum"> 2655 </span> : std::__rotate_adaptive(__first_cut, __middle, __second_cut, -<span class="lineNum"> 2656 </span> : __len1 - __len11, __len22, __buffer, -<span class="lineNum"> 2657 </span> : __buffer_size); -<span class="lineNum"> 2658 </span> : std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, -<span class="lineNum"> 2659 </span> : __len22, __buffer, __buffer_size, __comp); -<span class="lineNum"> 2660 </span> : std::__merge_adaptive(__new_middle, __second_cut, __last, -<span class="lineNum"> 2661 </span> : __len1 - __len11, -<span class="lineNum"> 2662 </span> : __len2 - __len22, __buffer, -<span class="lineNum"> 2663 </span> : __buffer_size, __comp); -<span class="lineNum"> 2664 </span> : } -<span class="lineNum"> 2665 </span> : } -<span class="lineNum"> 2666 </span> : -<span class="lineNum"> 2667 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2668 </span> : template<typename _BidirectionalIterator, typename _Distance> -<span class="lineNum"> 2669 </span> : void -<span class="lineNum"> 2670 </span> : __merge_without_buffer(_BidirectionalIterator __first, -<span class="lineNum"> 2671 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2672 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2673 </span> : _Distance __len1, _Distance __len2) -<span class="lineNum"> 2674 </span> : { -<span class="lineNum"> 2675 </span> : if (__len1 == 0 || __len2 == 0) -<span class="lineNum"> 2676 </span> : return; -<span class="lineNum"> 2677 </span> : if (__len1 + __len2 == 2) -<span class="lineNum"> 2678 </span> : { -<span class="lineNum"> 2679 </span> : if (*__middle < *__first) -<span class="lineNum"> 2680 </span> : std::iter_swap(__first, __middle); -<span class="lineNum"> 2681 </span> : return; -<span class="lineNum"> 2682 </span> : } -<span class="lineNum"> 2683 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2684 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2685 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2686 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2687 </span> : if (__len1 > __len2) -<span class="lineNum"> 2688 </span> : { -<span class="lineNum"> 2689 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2690 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2691 </span> : __second_cut = std::lower_bound(__middle, __last, *__first_cut); -<span class="lineNum"> 2692 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2693 </span> : } -<span class="lineNum"> 2694 </span> : else -<span class="lineNum"> 2695 </span> : { -<span class="lineNum"> 2696 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2697 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2698 </span> : __first_cut = std::upper_bound(__first, __middle, *__second_cut); -<span class="lineNum"> 2699 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2700 </span> : } -<span class="lineNum"> 2701 </span> : std::rotate(__first_cut, __middle, __second_cut); -<span class="lineNum"> 2702 </span> : _BidirectionalIterator __new_middle = __first_cut; -<span class="lineNum"> 2703 </span> : std::advance(__new_middle, std::distance(__middle, __second_cut)); -<span class="lineNum"> 2704 </span> : std::__merge_without_buffer(__first, __first_cut, __new_middle, -<span class="lineNum"> 2705 </span> : __len11, __len22); -<span class="lineNum"> 2706 </span> : std::__merge_without_buffer(__new_middle, __second_cut, __last, -<span class="lineNum"> 2707 </span> : __len1 - __len11, __len2 - __len22); -<span class="lineNum"> 2708 </span> : } -<span class="lineNum"> 2709 </span> : -<span class="lineNum"> 2710 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2711 </span> : template<typename _BidirectionalIterator, typename _Distance, -<span class="lineNum"> 2712 </span> : typename _Compare> -<span class="lineNum"> 2713 </span> : void -<span class="lineNum"> 2714 </span> : __merge_without_buffer(_BidirectionalIterator __first, -<span class="lineNum"> 2715 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2716 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2717 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2718 </span> : _Compare __comp) -<span class="lineNum"> 2719 </span> : { -<span class="lineNum"> 2720 </span> : if (__len1 == 0 || __len2 == 0) -<span class="lineNum"> 2721 </span> : return; -<span class="lineNum"> 2722 </span> : if (__len1 + __len2 == 2) -<span class="lineNum"> 2723 </span> : { -<span class="lineNum"> 2724 </span> : if (__comp(*__middle, *__first)) -<span class="lineNum"> 2725 </span> : std::iter_swap(__first, __middle); -<span class="lineNum"> 2726 </span> : return; -<span class="lineNum"> 2727 </span> : } -<span class="lineNum"> 2728 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2729 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2730 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2731 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2732 </span> : if (__len1 > __len2) -<span class="lineNum"> 2733 </span> : { -<span class="lineNum"> 2734 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2735 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2736 </span> : __second_cut = std::lower_bound(__middle, __last, *__first_cut, -<span class="lineNum"> 2737 </span> : __comp); -<span class="lineNum"> 2738 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2739 </span> : } -<span class="lineNum"> 2740 </span> : else -<span class="lineNum"> 2741 </span> : { -<span class="lineNum"> 2742 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2743 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2744 </span> : __first_cut = std::upper_bound(__first, __middle, *__second_cut, -<span class="lineNum"> 2745 </span> : __comp); -<span class="lineNum"> 2746 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2747 </span> : } -<span class="lineNum"> 2748 </span> : std::rotate(__first_cut, __middle, __second_cut); -<span class="lineNum"> 2749 </span> : _BidirectionalIterator __new_middle = __first_cut; -<span class="lineNum"> 2750 </span> : std::advance(__new_middle, std::distance(__middle, __second_cut)); -<span class="lineNum"> 2751 </span> : std::__merge_without_buffer(__first, __first_cut, __new_middle, -<span class="lineNum"> 2752 </span> : __len11, __len22, __comp); -<span class="lineNum"> 2753 </span> : std::__merge_without_buffer(__new_middle, __second_cut, __last, -<span class="lineNum"> 2754 </span> : __len1 - __len11, __len2 - __len22, __comp); -<span class="lineNum"> 2755 </span> : } -<span class="lineNum"> 2756 </span> : -<span class="lineNum"> 2757 </span> : /** -<span class="lineNum"> 2758 </span> : * @brief Merges two sorted ranges in place. -<span class="lineNum"> 2759 </span> : * @param first An iterator. -<span class="lineNum"> 2760 </span> : * @param middle Another iterator. -<span class="lineNum"> 2761 </span> : * @param last Another iterator. -<span class="lineNum"> 2762 </span> : * @return Nothing. -<span class="lineNum"> 2763 </span> : * -<span class="lineNum"> 2764 </span> : * Merges two sorted and consecutive ranges, [first,middle) and -<span class="lineNum"> 2765 </span> : * [middle,last), and puts the result in [first,last). The output will -<span class="lineNum"> 2766 </span> : * be sorted. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 2767 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 2768 </span> : * come before elements from the second. -<span class="lineNum"> 2769 </span> : * -<span class="lineNum"> 2770 </span> : * If enough additional memory is available, this takes (last-first)-1 -<span class="lineNum"> 2771 </span> : * comparisons. Otherwise an NlogN algorithm is used, where N is -<span class="lineNum"> 2772 </span> : * distance(first,last). -<span class="lineNum"> 2773 </span> : */ -<span class="lineNum"> 2774 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 2775 </span> : void -<span class="lineNum"> 2776 </span> : inplace_merge(_BidirectionalIterator __first, -<span class="lineNum"> 2777 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2778 </span> : _BidirectionalIterator __last) -<span class="lineNum"> 2779 </span> : { -<span class="lineNum"> 2780 </span> : typedef typename iterator_traits<_BidirectionalIterator>::value_type -<span class="lineNum"> 2781 </span> : _ValueType; -<span class="lineNum"> 2782 </span> : typedef typename iterator_traits<_BidirectionalIterator>::difference_type -<span class="lineNum"> 2783 </span> : _DistanceType; -<span class="lineNum"> 2784 </span> : -<span class="lineNum"> 2785 </span> : // concept requirements -<span class="lineNum"> 2786 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 2787 </span> : _BidirectionalIterator>) -<span class="lineNum"> 2788 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 2789 </span> : __glibcxx_requires_sorted(__first, __middle); -<span class="lineNum"> 2790 </span> : __glibcxx_requires_sorted(__middle, __last); -<span class="lineNum"> 2791 </span> : -<span class="lineNum"> 2792 </span> : if (__first == __middle || __middle == __last) -<span class="lineNum"> 2793 </span> : return; -<span class="lineNum"> 2794 </span> : -<span class="lineNum"> 2795 </span> : _DistanceType __len1 = std::distance(__first, __middle); -<span class="lineNum"> 2796 </span> : _DistanceType __len2 = std::distance(__middle, __last); -<span class="lineNum"> 2797 </span> : -<span class="lineNum"> 2798 </span> : _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, -<span class="lineNum"> 2799 </span> : __last); -<span class="lineNum"> 2800 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 2801 </span> : std::__merge_without_buffer(__first, __middle, __last, __len1, __len2); -<span class="lineNum"> 2802 </span> : else -<span class="lineNum"> 2803 </span> : std::__merge_adaptive(__first, __middle, __last, __len1, __len2, -<span class="lineNum"> 2804 </span> : __buf.begin(), _DistanceType(__buf.size())); -<span class="lineNum"> 2805 </span> : } -<span class="lineNum"> 2806 </span> : -<span class="lineNum"> 2807 </span> : /** -<span class="lineNum"> 2808 </span> : * @brief Merges two sorted ranges in place. -<span class="lineNum"> 2809 </span> : * @param first An iterator. -<span class="lineNum"> 2810 </span> : * @param middle Another iterator. -<span class="lineNum"> 2811 </span> : * @param last Another iterator. -<span class="lineNum"> 2812 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2813 </span> : * @return Nothing. -<span class="lineNum"> 2814 </span> : * -<span class="lineNum"> 2815 </span> : * Merges two sorted and consecutive ranges, [first,middle) and -<span class="lineNum"> 2816 </span> : * [middle,last), and puts the result in [first,last). The output will -<span class="lineNum"> 2817 </span> : * be sorted. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 2818 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 2819 </span> : * come before elements from the second. -<span class="lineNum"> 2820 </span> : * -<span class="lineNum"> 2821 </span> : * If enough additional memory is available, this takes (last-first)-1 -<span class="lineNum"> 2822 </span> : * comparisons. Otherwise an NlogN algorithm is used, where N is -<span class="lineNum"> 2823 </span> : * distance(first,last). -<span class="lineNum"> 2824 </span> : * -<span class="lineNum"> 2825 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2826 </span> : * the function used for the initial sort. -<span class="lineNum"> 2827 </span> : */ -<span class="lineNum"> 2828 </span> : template<typename _BidirectionalIterator, typename _Compare> -<span class="lineNum"> 2829 </span> : void -<span class="lineNum"> 2830 </span> : inplace_merge(_BidirectionalIterator __first, -<span class="lineNum"> 2831 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2832 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2833 </span> : _Compare __comp) -<span class="lineNum"> 2834 </span> : { -<span class="lineNum"> 2835 </span> : typedef typename iterator_traits<_BidirectionalIterator>::value_type -<span class="lineNum"> 2836 </span> : _ValueType; -<span class="lineNum"> 2837 </span> : typedef typename iterator_traits<_BidirectionalIterator>::difference_type -<span class="lineNum"> 2838 </span> : _DistanceType; -<span class="lineNum"> 2839 </span> : -<span class="lineNum"> 2840 </span> : // concept requirements -<span class="lineNum"> 2841 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 2842 </span> : _BidirectionalIterator>) -<span class="lineNum"> 2843 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2844 </span> : _ValueType, _ValueType>) -<span class="lineNum"> 2845 </span> : __glibcxx_requires_sorted_pred(__first, __middle, __comp); -<span class="lineNum"> 2846 </span> : __glibcxx_requires_sorted_pred(__middle, __last, __comp); -<span class="lineNum"> 2847 </span> : -<span class="lineNum"> 2848 </span> : if (__first == __middle || __middle == __last) -<span class="lineNum"> 2849 </span> : return; -<span class="lineNum"> 2850 </span> : -<span class="lineNum"> 2851 </span> : const _DistanceType __len1 = std::distance(__first, __middle); -<span class="lineNum"> 2852 </span> : const _DistanceType __len2 = std::distance(__middle, __last); -<span class="lineNum"> 2853 </span> : -<span class="lineNum"> 2854 </span> : _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, -<span class="lineNum"> 2855 </span> : __last); -<span class="lineNum"> 2856 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 2857 </span> : std::__merge_without_buffer(__first, __middle, __last, __len1, -<span class="lineNum"> 2858 </span> : __len2, __comp); -<span class="lineNum"> 2859 </span> : else -<span class="lineNum"> 2860 </span> : std::__merge_adaptive(__first, __middle, __last, __len1, __len2, -<span class="lineNum"> 2861 </span> : __buf.begin(), _DistanceType(__buf.size()), -<span class="lineNum"> 2862 </span> : __comp); -<span class="lineNum"> 2863 </span> : } -<span class="lineNum"> 2864 </span> : -<span class="lineNum"> 2865 </span> : template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, -<span class="lineNum"> 2866 </span> : typename _Distance> -<span class="lineNum"> 2867 </span> : void -<span class="lineNum"> 2868 </span> : __merge_sort_loop(_RandomAccessIterator1 __first, -<span class="lineNum"> 2869 </span> : _RandomAccessIterator1 __last, -<span class="lineNum"> 2870 </span> : _RandomAccessIterator2 __result, -<span class="lineNum"> 2871 </span> : _Distance __step_size) -<span class="lineNum"> 2872 </span> : { -<span class="lineNum"> 2873 </span> : const _Distance __two_step = 2 * __step_size; -<span class="lineNum"> 2874 </span> : -<span class="lineNum"> 2875 </span> : while (__last - __first >= __two_step) -<span class="lineNum"> 2876 </span> : { -<span class="lineNum"> 2877 </span> : __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2878 </span> : __first + __step_size, -<span class="lineNum"> 2879 </span> : __first + __two_step, -<span class="lineNum"> 2880 </span> : __result); -<span class="lineNum"> 2881 </span> : __first += __two_step; -<span class="lineNum"> 2882 </span> : } -<span class="lineNum"> 2883 </span> : -<span class="lineNum"> 2884 </span> : __step_size = std::min(_Distance(__last - __first), __step_size); -<span class="lineNum"> 2885 </span> : _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2886 </span> : __first + __step_size, __last, -<span class="lineNum"> 2887 </span> : __result); -<span class="lineNum"> 2888 </span> : } -<span class="lineNum"> 2889 </span> : -<span class="lineNum"> 2890 </span> : template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, -<span class="lineNum"> 2891 </span> : typename _Distance, typename _Compare> -<span class="lineNum"> 2892 </span> : void -<span class="lineNum"> 2893 </span> : __merge_sort_loop(_RandomAccessIterator1 __first, -<span class="lineNum"> 2894 </span> : _RandomAccessIterator1 __last, -<span class="lineNum"> 2895 </span> : _RandomAccessIterator2 __result, _Distance __step_size, -<span class="lineNum"> 2896 </span> : _Compare __comp) -<span class="lineNum"> 2897 </span> : { -<span class="lineNum"> 2898 </span> : const _Distance __two_step = 2 * __step_size; -<span class="lineNum"> 2899 </span> : -<span class="lineNum"> 2900 </span> : while (__last - __first >= __two_step) -<span class="lineNum"> 2901 </span> : { -<span class="lineNum"> 2902 </span> : __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2903 </span> : __first + __step_size, __first + __two_step, -<span class="lineNum"> 2904 </span> : __result, -<span class="lineNum"> 2905 </span> : __comp); -<span class="lineNum"> 2906 </span> : __first += __two_step; -<span class="lineNum"> 2907 </span> : } -<span class="lineNum"> 2908 </span> : __step_size = std::min(_Distance(__last - __first), __step_size); -<span class="lineNum"> 2909 </span> : -<span class="lineNum"> 2910 </span> : _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2911 </span> : __first + __step_size, __last, __result, __comp); -<span class="lineNum"> 2912 </span> : } -<span class="lineNum"> 2913 </span> : -<span class="lineNum"> 2914 </span> : template<typename _RandomAccessIterator, typename _Distance> -<span class="lineNum"> 2915 </span> : void -<span class="lineNum"> 2916 </span> : __chunk_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 2917 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2918 </span> : _Distance __chunk_size) -<span class="lineNum"> 2919 </span> : { -<span class="lineNum"> 2920 </span> : while (__last - __first >= __chunk_size) -<span class="lineNum"> 2921 </span> : { -<span class="lineNum"> 2922 </span> : std::__insertion_sort(__first, __first + __chunk_size); -<span class="lineNum"> 2923 </span> : __first += __chunk_size; -<span class="lineNum"> 2924 </span> : } -<span class="lineNum"> 2925 </span> : std::__insertion_sort(__first, __last); -<span class="lineNum"> 2926 </span> : } -<span class="lineNum"> 2927 </span> : -<span class="lineNum"> 2928 </span> : template<typename _RandomAccessIterator, typename _Distance, -<span class="lineNum"> 2929 </span> : typename _Compare> -<span class="lineNum"> 2930 </span> : void -<span class="lineNum"> 2931 </span> : __chunk_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 2932 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2933 </span> : _Distance __chunk_size, _Compare __comp) -<span class="lineNum"> 2934 </span> : { -<span class="lineNum"> 2935 </span> : while (__last - __first >= __chunk_size) -<span class="lineNum"> 2936 </span> : { -<span class="lineNum"> 2937 </span> : std::__insertion_sort(__first, __first + __chunk_size, __comp); -<span class="lineNum"> 2938 </span> : __first += __chunk_size; -<span class="lineNum"> 2939 </span> : } -<span class="lineNum"> 2940 </span> : std::__insertion_sort(__first, __last, __comp); -<span class="lineNum"> 2941 </span> : } -<span class="lineNum"> 2942 </span> : -<span class="lineNum"> 2943 </span> : enum { _S_chunk_size = 7 }; -<span class="lineNum"> 2944 </span> : -<span class="lineNum"> 2945 </span> : template<typename _RandomAccessIterator, typename _Pointer> -<span class="lineNum"> 2946 </span> : void -<span class="lineNum"> 2947 </span> : __merge_sort_with_buffer(_RandomAccessIterator __first, -<span class="lineNum"> 2948 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2949 </span> : _Pointer __buffer) -<span class="lineNum"> 2950 </span> : { -<span class="lineNum"> 2951 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 2952 </span> : _Distance; -<span class="lineNum"> 2953 </span> : -<span class="lineNum"> 2954 </span> : const _Distance __len = __last - __first; -<span class="lineNum"> 2955 </span> : const _Pointer __buffer_last = __buffer + __len; -<span class="lineNum"> 2956 </span> : -<span class="lineNum"> 2957 </span> : _Distance __step_size = _S_chunk_size; -<span class="lineNum"> 2958 </span> : std::__chunk_insertion_sort(__first, __last, __step_size); -<span class="lineNum"> 2959 </span> : -<span class="lineNum"> 2960 </span> : while (__step_size < __len) -<span class="lineNum"> 2961 </span> : { -<span class="lineNum"> 2962 </span> : std::__merge_sort_loop(__first, __last, __buffer, __step_size); -<span class="lineNum"> 2963 </span> : __step_size *= 2; -<span class="lineNum"> 2964 </span> : std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size); -<span class="lineNum"> 2965 </span> : __step_size *= 2; -<span class="lineNum"> 2966 </span> : } -<span class="lineNum"> 2967 </span> : } -<span class="lineNum"> 2968 </span> : -<span class="lineNum"> 2969 </span> : template<typename _RandomAccessIterator, typename _Pointer, typename _Compare> -<span class="lineNum"> 2970 </span> : void -<span class="lineNum"> 2971 </span> : __merge_sort_with_buffer(_RandomAccessIterator __first, -<span class="lineNum"> 2972 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2973 </span> : _Pointer __buffer, _Compare __comp) -<span class="lineNum"> 2974 </span> : { -<span class="lineNum"> 2975 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 2976 </span> : _Distance; -<span class="lineNum"> 2977 </span> : -<span class="lineNum"> 2978 </span> : const _Distance __len = __last - __first; -<span class="lineNum"> 2979 </span> : const _Pointer __buffer_last = __buffer + __len; -<span class="lineNum"> 2980 </span> : -<span class="lineNum"> 2981 </span> : _Distance __step_size = _S_chunk_size; -<span class="lineNum"> 2982 </span> : std::__chunk_insertion_sort(__first, __last, __step_size, __comp); -<span class="lineNum"> 2983 </span> : -<span class="lineNum"> 2984 </span> : while (__step_size < __len) -<span class="lineNum"> 2985 </span> : { -<span class="lineNum"> 2986 </span> : std::__merge_sort_loop(__first, __last, __buffer, -<span class="lineNum"> 2987 </span> : __step_size, __comp); -<span class="lineNum"> 2988 </span> : __step_size *= 2; -<span class="lineNum"> 2989 </span> : std::__merge_sort_loop(__buffer, __buffer_last, __first, -<span class="lineNum"> 2990 </span> : __step_size, __comp); -<span class="lineNum"> 2991 </span> : __step_size *= 2; -<span class="lineNum"> 2992 </span> : } -<span class="lineNum"> 2993 </span> : } -<span class="lineNum"> 2994 </span> : -<span class="lineNum"> 2995 </span> : template<typename _RandomAccessIterator, typename _Pointer, -<span class="lineNum"> 2996 </span> : typename _Distance> -<span class="lineNum"> 2997 </span> : void -<span class="lineNum"> 2998 </span> : __stable_sort_adaptive(_RandomAccessIterator __first, -<span class="lineNum"> 2999 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 3000 </span> : _Pointer __buffer, _Distance __buffer_size) -<span class="lineNum"> 3001 </span> : { -<span class="lineNum"> 3002 </span> : const _Distance __len = (__last - __first + 1) / 2; -<span class="lineNum"> 3003 </span> : const _RandomAccessIterator __middle = __first + __len; -<span class="lineNum"> 3004 </span> : if (__len > __buffer_size) -<span class="lineNum"> 3005 </span> : { -<span class="lineNum"> 3006 </span> : std::__stable_sort_adaptive(__first, __middle, -<span class="lineNum"> 3007 </span> : __buffer, __buffer_size); -<span class="lineNum"> 3008 </span> : std::__stable_sort_adaptive(__middle, __last, -<span class="lineNum"> 3009 </span> : __buffer, __buffer_size); -<span class="lineNum"> 3010 </span> : } -<span class="lineNum"> 3011 </span> : else -<span class="lineNum"> 3012 </span> : { -<span class="lineNum"> 3013 </span> : std::__merge_sort_with_buffer(__first, __middle, __buffer); -<span class="lineNum"> 3014 </span> : std::__merge_sort_with_buffer(__middle, __last, __buffer); -<span class="lineNum"> 3015 </span> : } -<span class="lineNum"> 3016 </span> : std::__merge_adaptive(__first, __middle, __last, -<span class="lineNum"> 3017 </span> : _Distance(__middle - __first), -<span class="lineNum"> 3018 </span> : _Distance(__last - __middle), -<span class="lineNum"> 3019 </span> : __buffer, __buffer_size); -<span class="lineNum"> 3020 </span> : } -<span class="lineNum"> 3021 </span> : -<span class="lineNum"> 3022 </span> : template<typename _RandomAccessIterator, typename _Pointer, -<span class="lineNum"> 3023 </span> : typename _Distance, typename _Compare> -<span class="lineNum"> 3024 </span> : void -<span class="lineNum"> 3025 </span> : __stable_sort_adaptive(_RandomAccessIterator __first, -<span class="lineNum"> 3026 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 3027 </span> : _Pointer __buffer, _Distance __buffer_size, -<span class="lineNum"> 3028 </span> : _Compare __comp) -<span class="lineNum"> 3029 </span> : { -<span class="lineNum"> 3030 </span> : const _Distance __len = (__last - __first + 1) / 2; -<span class="lineNum"> 3031 </span> : const _RandomAccessIterator __middle = __first + __len; -<span class="lineNum"> 3032 </span> : if (__len > __buffer_size) -<span class="lineNum"> 3033 </span> : { -<span class="lineNum"> 3034 </span> : std::__stable_sort_adaptive(__first, __middle, __buffer, -<span class="lineNum"> 3035 </span> : __buffer_size, __comp); -<span class="lineNum"> 3036 </span> : std::__stable_sort_adaptive(__middle, __last, __buffer, -<span class="lineNum"> 3037 </span> : __buffer_size, __comp); -<span class="lineNum"> 3038 </span> : } -<span class="lineNum"> 3039 </span> : else -<span class="lineNum"> 3040 </span> : { -<span class="lineNum"> 3041 </span> : std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); -<span class="lineNum"> 3042 </span> : std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); -<span class="lineNum"> 3043 </span> : } -<span class="lineNum"> 3044 </span> : std::__merge_adaptive(__first, __middle, __last, -<span class="lineNum"> 3045 </span> : _Distance(__middle - __first), -<span class="lineNum"> 3046 </span> : _Distance(__last - __middle), -<span class="lineNum"> 3047 </span> : __buffer, __buffer_size, -<span class="lineNum"> 3048 </span> : __comp); -<span class="lineNum"> 3049 </span> : } -<span class="lineNum"> 3050 </span> : -<span class="lineNum"> 3051 </span> : /// This is a helper function for the stable sorting routines. -<span class="lineNum"> 3052 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 3053 </span> : void -<span class="lineNum"> 3054 </span> : __inplace_stable_sort(_RandomAccessIterator __first, -<span class="lineNum"> 3055 </span> : _RandomAccessIterator __last) -<span class="lineNum"> 3056 </span> : { -<span class="lineNum"> 3057 </span> : if (__last - __first < 15) -<span class="lineNum"> 3058 </span> : { -<span class="lineNum"> 3059 </span> : std::__insertion_sort(__first, __last); -<span class="lineNum"> 3060 </span> : return; -<span class="lineNum"> 3061 </span> : } -<span class="lineNum"> 3062 </span> : _RandomAccessIterator __middle = __first + (__last - __first) / 2; -<span class="lineNum"> 3063 </span> : std::__inplace_stable_sort(__first, __middle); -<span class="lineNum"> 3064 </span> : std::__inplace_stable_sort(__middle, __last); -<span class="lineNum"> 3065 </span> : std::__merge_without_buffer(__first, __middle, __last, -<span class="lineNum"> 3066 </span> : __middle - __first, -<span class="lineNum"> 3067 </span> : __last - __middle); -<span class="lineNum"> 3068 </span> : } -<span class="lineNum"> 3069 </span> : -<span class="lineNum"> 3070 </span> : /// This is a helper function for the stable sorting routines. -<span class="lineNum"> 3071 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 3072 </span> : void -<span class="lineNum"> 3073 </span> : __inplace_stable_sort(_RandomAccessIterator __first, -<span class="lineNum"> 3074 </span> : _RandomAccessIterator __last, _Compare __comp) -<span class="lineNum"> 3075 </span> : { -<span class="lineNum"> 3076 </span> : if (__last - __first < 15) -<span class="lineNum"> 3077 </span> : { -<span class="lineNum"> 3078 </span> : std::__insertion_sort(__first, __last, __comp); -<span class="lineNum"> 3079 </span> : return; -<span class="lineNum"> 3080 </span> : } -<span class="lineNum"> 3081 </span> : _RandomAccessIterator __middle = __first + (__last - __first) / 2; -<span class="lineNum"> 3082 </span> : std::__inplace_stable_sort(__first, __middle, __comp); -<span class="lineNum"> 3083 </span> : std::__inplace_stable_sort(__middle, __last, __comp); -<span class="lineNum"> 3084 </span> : std::__merge_without_buffer(__first, __middle, __last, -<span class="lineNum"> 3085 </span> : __middle - __first, -<span class="lineNum"> 3086 </span> : __last - __middle, -<span class="lineNum"> 3087 </span> : __comp); -<span class="lineNum"> 3088 </span> : } -<span class="lineNum"> 3089 </span> : -<span class="lineNum"> 3090 </span> : // stable_sort -<span class="lineNum"> 3091 </span> : -<span class="lineNum"> 3092 </span> : // Set algorithms: includes, set_union, set_intersection, set_difference, -<span class="lineNum"> 3093 </span> : // set_symmetric_difference. All of these algorithms have the precondition -<span class="lineNum"> 3094 </span> : // that their input ranges are sorted and the postcondition that their output -<span class="lineNum"> 3095 </span> : // ranges are sorted. -<span class="lineNum"> 3096 </span> : -<span class="lineNum"> 3097 </span> : /** -<span class="lineNum"> 3098 </span> : * @brief Determines whether all elements of a sequence exists in a range. -<span class="lineNum"> 3099 </span> : * @param first1 Start of search range. -<span class="lineNum"> 3100 </span> : * @param last1 End of search range. -<span class="lineNum"> 3101 </span> : * @param first2 Start of sequence -<span class="lineNum"> 3102 </span> : * @param last2 End of sequence. -<span class="lineNum"> 3103 </span> : * @return True if each element in [first2,last2) is contained in order -<span class="lineNum"> 3104 </span> : * within [first1,last1). False otherwise. -<span class="lineNum"> 3105 </span> : * @ingroup setoperations -<span class="lineNum"> 3106 </span> : * -<span class="lineNum"> 3107 </span> : * This operation expects both [first1,last1) and [first2,last2) to be -<span class="lineNum"> 3108 </span> : * sorted. Searches for the presence of each element in [first2,last2) -<span class="lineNum"> 3109 </span> : * within [first1,last1). The iterators over each range only move forward, -<span class="lineNum"> 3110 </span> : * so this is a linear algorithm. If an element in [first2,last2) is not -<span class="lineNum"> 3111 </span> : * found before the search iterator reaches @a last2, false is returned. -<span class="lineNum"> 3112 </span> : */ -<span class="lineNum"> 3113 </span> : template<typename _InputIterator1, typename _InputIterator2> -<span class="lineNum"> 3114 </span> : bool -<span class="lineNum"> 3115 </span> : includes(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 3116 </span> : _InputIterator2 __first2, _InputIterator2 __last2) -<span class="lineNum"> 3117 </span> : { -<span class="lineNum"> 3118 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 3119 </span> : _ValueType1; -<span class="lineNum"> 3120 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 3121 </span> : _ValueType2; -<span class="lineNum"> 3122 </span> : -<span class="lineNum"> 3123 </span> : // concept requirements -<span class="lineNum"> 3124 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 3125 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 3126 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 3127 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 3128 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 3129 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 3130 </span> : -<span class="lineNum"> 3131 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 3132 </span> : if (*__first2 < *__first1) -<span class="lineNum"> 3133 </span> : return false; -<span class="lineNum"> 3134 </span> : else if(*__first1 < *__first2) -<span class="lineNum"> 3135 </span> : ++__first1; -<span class="lineNum"> 3136 </span> : else -<span class="lineNum"> 3137 </span> : ++__first1, ++__first2; -<span class="lineNum"> 3138 </span> : -<span class="lineNum"> 3139 </span> : return __first2 == __last2; -<span class="lineNum"> 3140 </span> : } -<span class="lineNum"> 3141 </span> : -<span class="lineNum"> 3142 </span> : /** -<span class="lineNum"> 3143 </span> : * @brief Determines whether all elements of a sequence exists in a range -<span class="lineNum"> 3144 </span> : * using comparison. -<span class="lineNum"> 3145 </span> : * @param first1 Start of search range. -<span class="lineNum"> 3146 </span> : * @param last1 End of search range. -<span class="lineNum"> 3147 </span> : * @param first2 Start of sequence -<span class="lineNum"> 3148 </span> : * @param last2 End of sequence. -<span class="lineNum"> 3149 </span> : * @param comp Comparison function to use. -<span class="lineNum"> 3150 </span> : * @return True if each element in [first2,last2) is contained in order -<span class="lineNum"> 3151 </span> : * within [first1,last1) according to comp. False otherwise. -<span class="lineNum"> 3152 </span> : * @ingroup setoperations -<span class="lineNum"> 3153 </span> : * -<span class="lineNum"> 3154 </span> : * This operation expects both [first1,last1) and [first2,last2) to be -<span class="lineNum"> 3155 </span> : * sorted. Searches for the presence of each element in [first2,last2) -<span class="lineNum"> 3156 </span> : * within [first1,last1), using comp to decide. The iterators over each -<span class="lineNum"> 3157 </span> : * range only move forward, so this is a linear algorithm. If an element -<span class="lineNum"> 3158 </span> : * in [first2,last2) is not found before the search iterator reaches @a -<span class="lineNum"> 3159 </span> : * last2, false is returned. -<span class="lineNum"> 3160 </span> : */ -<span class="lineNum"> 3161 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 3162 </span> : typename _Compare> -<span class="lineNum"> 3163 </span> : bool -<span class="lineNum"> 3164 </span> : includes(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 3165 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 3166 </span> : _Compare __comp) -<span class="lineNum"> 3167 </span> : { -<span class="lineNum"> 3168 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 3169 </span> : _ValueType1; -<span class="lineNum"> 3170 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 3171 </span> : _ValueType2; -<span class="lineNum"> 3172 </span> : -<span class="lineNum"> 3173 </span> : // concept requirements -<span class="lineNum"> 3174 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 3175 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 3176 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3177 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 3178 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3179 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 3180 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 3181 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 3182 </span> : -<span class="lineNum"> 3183 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 3184 </span> : if (__comp(*__first2, *__first1)) -<span class="lineNum"> 3185 </span> : return false; -<span class="lineNum"> 3186 </span> : else if(__comp(*__first1, *__first2)) -<span class="lineNum"> 3187 </span> : ++__first1; -<span class="lineNum"> 3188 </span> : else -<span class="lineNum"> 3189 </span> : ++__first1, ++__first2; -<span class="lineNum"> 3190 </span> : -<span class="lineNum"> 3191 </span> : return __first2 == __last2; -<span class="lineNum"> 3192 </span> : } -<span class="lineNum"> 3193 </span> : -<span class="lineNum"> 3194 </span> : // nth_element -<span class="lineNum"> 3195 </span> : // merge -<span class="lineNum"> 3196 </span> : // set_difference -<span class="lineNum"> 3197 </span> : // set_intersection -<span class="lineNum"> 3198 </span> : // set_union -<span class="lineNum"> 3199 </span> : // stable_sort -<span class="lineNum"> 3200 </span> : // set_symmetric_difference -<span class="lineNum"> 3201 </span> : // min_element -<span class="lineNum"> 3202 </span> : // max_element -<span class="lineNum"> 3203 </span> : -<span class="lineNum"> 3204 </span> : /** -<span class="lineNum"> 3205 </span> : * @brief Permute range into the next "dictionary" ordering. -<span class="lineNum"> 3206 </span> : * @param first Start of range. -<span class="lineNum"> 3207 </span> : * @param last End of range. -<span class="lineNum"> 3208 </span> : * @return False if wrapped to first permutation, true otherwise. -<span class="lineNum"> 3209 </span> : * -<span class="lineNum"> 3210 </span> : * Treats all permutations of the range as a set of "dictionary" sorted -<span class="lineNum"> 3211 </span> : * sequences. Permutes the current sequence into the next one of this set. -<span class="lineNum"> 3212 </span> : * Returns true if there are more sequences to generate. If the sequence -<span class="lineNum"> 3213 </span> : * is the largest of the set, the smallest is generated and false returned. -<span class="lineNum"> 3214 </span> : */ -<span class="lineNum"> 3215 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 3216 </span> : bool -<span class="lineNum"> 3217 </span> : next_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3218 </span> : _BidirectionalIterator __last) -<span class="lineNum"> 3219 </span> : { -<span class="lineNum"> 3220 </span> : // concept requirements -<span class="lineNum"> 3221 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3222 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3223 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3224 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3225 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3226 </span> : -<span class="lineNum"> 3227 </span> : if (__first == __last) -<span class="lineNum"> 3228 </span> : return false; -<span class="lineNum"> 3229 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3230 </span> : ++__i; -<span class="lineNum"> 3231 </span> : if (__i == __last) -<span class="lineNum"> 3232 </span> : return false; -<span class="lineNum"> 3233 </span> : __i = __last; -<span class="lineNum"> 3234 </span> : --__i; -<span class="lineNum"> 3235 </span> : -<span class="lineNum"> 3236 </span> : for(;;) -<span class="lineNum"> 3237 </span> : { -<span class="lineNum"> 3238 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3239 </span> : --__i; -<span class="lineNum"> 3240 </span> : if (*__i < *__ii) -<span class="lineNum"> 3241 </span> : { -<span class="lineNum"> 3242 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3243 </span> : while (!(*__i < *--__j)) -<span class="lineNum"> 3244 </span> : {} -<span class="lineNum"> 3245 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3246 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3247 </span> : return true; -<span class="lineNum"> 3248 </span> : } -<span class="lineNum"> 3249 </span> : if (__i == __first) -<span class="lineNum"> 3250 </span> : { -<span class="lineNum"> 3251 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3252 </span> : return false; -<span class="lineNum"> 3253 </span> : } -<span class="lineNum"> 3254 </span> : } -<span class="lineNum"> 3255 </span> : } -<span class="lineNum"> 3256 </span> : -<span class="lineNum"> 3257 </span> : /** -<span class="lineNum"> 3258 </span> : * @brief Permute range into the next "dictionary" ordering using -<span class="lineNum"> 3259 </span> : * comparison functor. -<span class="lineNum"> 3260 </span> : * @param first Start of range. -<span class="lineNum"> 3261 </span> : * @param last End of range. -<span class="lineNum"> 3262 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3263 </span> : * @return False if wrapped to first permutation, true otherwise. -<span class="lineNum"> 3264 </span> : * -<span class="lineNum"> 3265 </span> : * Treats all permutations of the range [first,last) as a set of -<span class="lineNum"> 3266 </span> : * "dictionary" sorted sequences ordered by @a comp. Permutes the current -<span class="lineNum"> 3267 </span> : * sequence into the next one of this set. Returns true if there are more -<span class="lineNum"> 3268 </span> : * sequences to generate. If the sequence is the largest of the set, the -<span class="lineNum"> 3269 </span> : * smallest is generated and false returned. -<span class="lineNum"> 3270 </span> : */ -<span class="lineNum"> 3271 </span> : template<typename _BidirectionalIterator, typename _Compare> -<span class="lineNum"> 3272 </span> : bool -<span class="lineNum"> 3273 </span> : next_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3274 </span> : _BidirectionalIterator __last, _Compare __comp) -<span class="lineNum"> 3275 </span> : { -<span class="lineNum"> 3276 </span> : // concept requirements -<span class="lineNum"> 3277 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3278 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3279 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3280 </span> : typename iterator_traits<_BidirectionalIterator>::value_type, -<span class="lineNum"> 3281 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3282 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3283 </span> : -<span class="lineNum"> 3284 </span> : if (__first == __last) -<span class="lineNum"> 3285 </span> : return false; -<span class="lineNum"> 3286 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3287 </span> : ++__i; -<span class="lineNum"> 3288 </span> : if (__i == __last) -<span class="lineNum"> 3289 </span> : return false; -<span class="lineNum"> 3290 </span> : __i = __last; -<span class="lineNum"> 3291 </span> : --__i; -<span class="lineNum"> 3292 </span> : -<span class="lineNum"> 3293 </span> : for(;;) -<span class="lineNum"> 3294 </span> : { -<span class="lineNum"> 3295 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3296 </span> : --__i; -<span class="lineNum"> 3297 </span> : if (__comp(*__i, *__ii)) -<span class="lineNum"> 3298 </span> : { -<span class="lineNum"> 3299 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3300 </span> : while (!bool(__comp(*__i, *--__j))) -<span class="lineNum"> 3301 </span> : {} -<span class="lineNum"> 3302 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3303 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3304 </span> : return true; -<span class="lineNum"> 3305 </span> : } -<span class="lineNum"> 3306 </span> : if (__i == __first) -<span class="lineNum"> 3307 </span> : { -<span class="lineNum"> 3308 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3309 </span> : return false; -<span class="lineNum"> 3310 </span> : } -<span class="lineNum"> 3311 </span> : } -<span class="lineNum"> 3312 </span> : } -<span class="lineNum"> 3313 </span> : -<span class="lineNum"> 3314 </span> : /** -<span class="lineNum"> 3315 </span> : * @brief Permute range into the previous "dictionary" ordering. -<span class="lineNum"> 3316 </span> : * @param first Start of range. -<span class="lineNum"> 3317 </span> : * @param last End of range. -<span class="lineNum"> 3318 </span> : * @return False if wrapped to last permutation, true otherwise. -<span class="lineNum"> 3319 </span> : * -<span class="lineNum"> 3320 </span> : * Treats all permutations of the range as a set of "dictionary" sorted -<span class="lineNum"> 3321 </span> : * sequences. Permutes the current sequence into the previous one of this -<span class="lineNum"> 3322 </span> : * set. Returns true if there are more sequences to generate. If the -<span class="lineNum"> 3323 </span> : * sequence is the smallest of the set, the largest is generated and false -<span class="lineNum"> 3324 </span> : * returned. -<span class="lineNum"> 3325 </span> : */ -<span class="lineNum"> 3326 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 3327 </span> : bool -<span class="lineNum"> 3328 </span> : prev_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3329 </span> : _BidirectionalIterator __last) -<span class="lineNum"> 3330 </span> : { -<span class="lineNum"> 3331 </span> : // concept requirements -<span class="lineNum"> 3332 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3333 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3334 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3335 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3336 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3337 </span> : -<span class="lineNum"> 3338 </span> : if (__first == __last) -<span class="lineNum"> 3339 </span> : return false; -<span class="lineNum"> 3340 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3341 </span> : ++__i; -<span class="lineNum"> 3342 </span> : if (__i == __last) -<span class="lineNum"> 3343 </span> : return false; -<span class="lineNum"> 3344 </span> : __i = __last; -<span class="lineNum"> 3345 </span> : --__i; -<span class="lineNum"> 3346 </span> : -<span class="lineNum"> 3347 </span> : for(;;) -<span class="lineNum"> 3348 </span> : { -<span class="lineNum"> 3349 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3350 </span> : --__i; -<span class="lineNum"> 3351 </span> : if (*__ii < *__i) -<span class="lineNum"> 3352 </span> : { -<span class="lineNum"> 3353 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3354 </span> : while (!(*--__j < *__i)) -<span class="lineNum"> 3355 </span> : {} -<span class="lineNum"> 3356 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3357 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3358 </span> : return true; -<span class="lineNum"> 3359 </span> : } -<span class="lineNum"> 3360 </span> : if (__i == __first) -<span class="lineNum"> 3361 </span> : { -<span class="lineNum"> 3362 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3363 </span> : return false; -<span class="lineNum"> 3364 </span> : } -<span class="lineNum"> 3365 </span> : } -<span class="lineNum"> 3366 </span> : } -<span class="lineNum"> 3367 </span> : -<span class="lineNum"> 3368 </span> : /** -<span class="lineNum"> 3369 </span> : * @brief Permute range into the previous "dictionary" ordering using -<span class="lineNum"> 3370 </span> : * comparison functor. -<span class="lineNum"> 3371 </span> : * @param first Start of range. -<span class="lineNum"> 3372 </span> : * @param last End of range. -<span class="lineNum"> 3373 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3374 </span> : * @return False if wrapped to last permutation, true otherwise. -<span class="lineNum"> 3375 </span> : * -<span class="lineNum"> 3376 </span> : * Treats all permutations of the range [first,last) as a set of -<span class="lineNum"> 3377 </span> : * "dictionary" sorted sequences ordered by @a comp. Permutes the current -<span class="lineNum"> 3378 </span> : * sequence into the previous one of this set. Returns true if there are -<span class="lineNum"> 3379 </span> : * more sequences to generate. If the sequence is the smallest of the set, -<span class="lineNum"> 3380 </span> : * the largest is generated and false returned. -<span class="lineNum"> 3381 </span> : */ -<span class="lineNum"> 3382 </span> : template<typename _BidirectionalIterator, typename _Compare> -<span class="lineNum"> 3383 </span> : bool -<span class="lineNum"> 3384 </span> : prev_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3385 </span> : _BidirectionalIterator __last, _Compare __comp) -<span class="lineNum"> 3386 </span> : { -<span class="lineNum"> 3387 </span> : // concept requirements -<span class="lineNum"> 3388 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3389 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3390 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3391 </span> : typename iterator_traits<_BidirectionalIterator>::value_type, -<span class="lineNum"> 3392 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3393 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3394 </span> : -<span class="lineNum"> 3395 </span> : if (__first == __last) -<span class="lineNum"> 3396 </span> : return false; -<span class="lineNum"> 3397 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3398 </span> : ++__i; -<span class="lineNum"> 3399 </span> : if (__i == __last) -<span class="lineNum"> 3400 </span> : return false; -<span class="lineNum"> 3401 </span> : __i = __last; -<span class="lineNum"> 3402 </span> : --__i; -<span class="lineNum"> 3403 </span> : -<span class="lineNum"> 3404 </span> : for(;;) -<span class="lineNum"> 3405 </span> : { -<span class="lineNum"> 3406 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3407 </span> : --__i; -<span class="lineNum"> 3408 </span> : if (__comp(*__ii, *__i)) -<span class="lineNum"> 3409 </span> : { -<span class="lineNum"> 3410 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3411 </span> : while (!bool(__comp(*--__j, *__i))) -<span class="lineNum"> 3412 </span> : {} -<span class="lineNum"> 3413 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3414 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3415 </span> : return true; -<span class="lineNum"> 3416 </span> : } -<span class="lineNum"> 3417 </span> : if (__i == __first) -<span class="lineNum"> 3418 </span> : { -<span class="lineNum"> 3419 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3420 </span> : return false; -<span class="lineNum"> 3421 </span> : } -<span class="lineNum"> 3422 </span> : } -<span class="lineNum"> 3423 </span> : } -<span class="lineNum"> 3424 </span> : -<span class="lineNum"> 3425 </span> : // replace -<span class="lineNum"> 3426 </span> : // replace_if -<span class="lineNum"> 3427 </span> : -<span class="lineNum"> 3428 </span> : /** -<span class="lineNum"> 3429 </span> : * @brief Copy a sequence, replacing each element of one value with another -<span class="lineNum"> 3430 </span> : * value. -<span class="lineNum"> 3431 </span> : * @param first An input iterator. -<span class="lineNum"> 3432 </span> : * @param last An input iterator. -<span class="lineNum"> 3433 </span> : * @param result An output iterator. -<span class="lineNum"> 3434 </span> : * @param old_value The value to be replaced. -<span class="lineNum"> 3435 </span> : * @param new_value The replacement value. -<span class="lineNum"> 3436 </span> : * @return The end of the output sequence, @p result+(last-first). -<span class="lineNum"> 3437 </span> : * -<span class="lineNum"> 3438 </span> : * Copies each element in the input range @p [first,last) to the -<span class="lineNum"> 3439 </span> : * output range @p [result,result+(last-first)) replacing elements -<span class="lineNum"> 3440 </span> : * equal to @p old_value with @p new_value. -<span class="lineNum"> 3441 </span> : */ -<span class="lineNum"> 3442 </span> : template<typename _InputIterator, typename _OutputIterator, typename _Tp> -<span class="lineNum"> 3443 </span> : _OutputIterator -<span class="lineNum"> 3444 </span> : replace_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3445 </span> : _OutputIterator __result, -<span class="lineNum"> 3446 </span> : const _Tp& __old_value, const _Tp& __new_value) -<span class="lineNum"> 3447 </span> : { -<span class="lineNum"> 3448 </span> : // concept requirements -<span class="lineNum"> 3449 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3450 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 3451 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3452 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3453 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 3454 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3455 </span> : -<span class="lineNum"> 3456 </span> : for (; __first != __last; ++__first, ++__result) -<span class="lineNum"> 3457 </span> : if (*__first == __old_value) -<span class="lineNum"> 3458 </span> : *__result = __new_value; -<span class="lineNum"> 3459 </span> : else -<span class="lineNum"> 3460 </span> : *__result = *__first; -<span class="lineNum"> 3461 </span> : return __result; -<span class="lineNum"> 3462 </span> : } -<span class="lineNum"> 3463 </span> : -<span class="lineNum"> 3464 </span> : /** -<span class="lineNum"> 3465 </span> : * @brief Copy a sequence, replacing each value for which a predicate -<span class="lineNum"> 3466 </span> : * returns true with another value. -<span class="lineNum"> 3467 </span> : * @param first An input iterator. -<span class="lineNum"> 3468 </span> : * @param last An input iterator. -<span class="lineNum"> 3469 </span> : * @param result An output iterator. -<span class="lineNum"> 3470 </span> : * @param pred A predicate. -<span class="lineNum"> 3471 </span> : * @param new_value The replacement value. -<span class="lineNum"> 3472 </span> : * @return The end of the output sequence, @p result+(last-first). -<span class="lineNum"> 3473 </span> : * -<span class="lineNum"> 3474 </span> : * Copies each element in the range @p [first,last) to the range -<span class="lineNum"> 3475 </span> : * @p [result,result+(last-first)) replacing elements for which -<span class="lineNum"> 3476 </span> : * @p pred returns true with @p new_value. -<span class="lineNum"> 3477 </span> : */ -<span class="lineNum"> 3478 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 3479 </span> : typename _Predicate, typename _Tp> -<span class="lineNum"> 3480 </span> : _OutputIterator -<span class="lineNum"> 3481 </span> : replace_copy_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3482 </span> : _OutputIterator __result, -<span class="lineNum"> 3483 </span> : _Predicate __pred, const _Tp& __new_value) -<span class="lineNum"> 3484 </span> : { -<span class="lineNum"> 3485 </span> : // concept requirements -<span class="lineNum"> 3486 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3487 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 3488 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3489 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 3490 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3491 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3492 </span> : -<span class="lineNum"> 3493 </span> : for (; __first != __last; ++__first, ++__result) -<span class="lineNum"> 3494 </span> : if (__pred(*__first)) -<span class="lineNum"> 3495 </span> : *__result = __new_value; -<span class="lineNum"> 3496 </span> : else -<span class="lineNum"> 3497 </span> : *__result = *__first; -<span class="lineNum"> 3498 </span> : return __result; -<span class="lineNum"> 3499 </span> : } -<span class="lineNum"> 3500 </span> : -<span class="lineNum"> 3501 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 3502 </span> : /** -<span class="lineNum"> 3503 </span> : * @brief Determines whether the elements of a sequence are sorted. -<span class="lineNum"> 3504 </span> : * @param first An iterator. -<span class="lineNum"> 3505 </span> : * @param last Another iterator. -<span class="lineNum"> 3506 </span> : * @return True if the elements are sorted, false otherwise. -<span class="lineNum"> 3507 </span> : */ -<span class="lineNum"> 3508 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3509 </span> : inline bool -<span class="lineNum"> 3510 </span> : is_sorted(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3511 </span> : { return std::is_sorted_until(__first, __last) == __last; } -<span class="lineNum"> 3512 </span> : -<span class="lineNum"> 3513 </span> : /** -<span class="lineNum"> 3514 </span> : * @brief Determines whether the elements of a sequence are sorted -<span class="lineNum"> 3515 </span> : * according to a comparison functor. -<span class="lineNum"> 3516 </span> : * @param first An iterator. -<span class="lineNum"> 3517 </span> : * @param last Another iterator. -<span class="lineNum"> 3518 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3519 </span> : * @return True if the elements are sorted, false otherwise. -<span class="lineNum"> 3520 </span> : */ -<span class="lineNum"> 3521 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 3522 </span> : inline bool -<span class="lineNum"> 3523 </span> : is_sorted(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3524 </span> : _Compare __comp) -<span class="lineNum"> 3525 </span> : { return std::is_sorted_until(__first, __last, __comp) == __last; } -<span class="lineNum"> 3526 </span> : -<span class="lineNum"> 3527 </span> : /** -<span class="lineNum"> 3528 </span> : * @brief Determines the end of a sorted sequence. -<span class="lineNum"> 3529 </span> : * @param first An iterator. -<span class="lineNum"> 3530 </span> : * @param last Another iterator. -<span class="lineNum"> 3531 </span> : * @return An iterator pointing to the last iterator i in [first, last) -<span class="lineNum"> 3532 </span> : * for which the range [first, i) is sorted. -<span class="lineNum"> 3533 </span> : */ -<span class="lineNum"> 3534 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3535 </span> : _ForwardIterator -<span class="lineNum"> 3536 </span> : is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3537 </span> : { -<span class="lineNum"> 3538 </span> : // concept requirements -<span class="lineNum"> 3539 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3540 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3541 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3542 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3543 </span> : -<span class="lineNum"> 3544 </span> : if (__first == __last) -<span class="lineNum"> 3545 </span> : return __last; -<span class="lineNum"> 3546 </span> : -<span class="lineNum"> 3547 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3548 </span> : for (++__next; __next != __last; __first = __next, ++__next) -<span class="lineNum"> 3549 </span> : if (*__next < *__first) -<span class="lineNum"> 3550 </span> : return __next; -<span class="lineNum"> 3551 </span> : return __next; -<span class="lineNum"> 3552 </span> : } -<span class="lineNum"> 3553 </span> : -<span class="lineNum"> 3554 </span> : /** -<span class="lineNum"> 3555 </span> : * @brief Determines the end of a sorted sequence using comparison functor. -<span class="lineNum"> 3556 </span> : * @param first An iterator. -<span class="lineNum"> 3557 </span> : * @param last Another iterator. -<span class="lineNum"> 3558 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3559 </span> : * @return An iterator pointing to the last iterator i in [first, last) -<span class="lineNum"> 3560 </span> : * for which the range [first, i) is sorted. -<span class="lineNum"> 3561 </span> : */ -<span class="lineNum"> 3562 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 3563 </span> : _ForwardIterator -<span class="lineNum"> 3564 </span> : is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3565 </span> : _Compare __comp) -<span class="lineNum"> 3566 </span> : { -<span class="lineNum"> 3567 </span> : // concept requirements -<span class="lineNum"> 3568 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3569 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3570 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 3571 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3572 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3573 </span> : -<span class="lineNum"> 3574 </span> : if (__first == __last) -<span class="lineNum"> 3575 </span> : return __last; -<span class="lineNum"> 3576 </span> : -<span class="lineNum"> 3577 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3578 </span> : for (++__next; __next != __last; __first = __next, ++__next) -<span class="lineNum"> 3579 </span> : if (__comp(*__next, *__first)) -<span class="lineNum"> 3580 </span> : return __next; -<span class="lineNum"> 3581 </span> : return __next; -<span class="lineNum"> 3582 </span> : } -<span class="lineNum"> 3583 </span> : -<span class="lineNum"> 3584 </span> : /** -<span class="lineNum"> 3585 </span> : * @brief Determines min and max at once as an ordered pair. -<span class="lineNum"> 3586 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 3587 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 3588 </span> : * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise. -<span class="lineNum"> 3589 </span> : */ -<span class="lineNum"> 3590 </span> : template<typename _Tp> -<span class="lineNum"> 3591 </span> : inline pair<const _Tp&, const _Tp&> -<span class="lineNum"> 3592 </span> : minmax(const _Tp& __a, const _Tp& __b) -<span class="lineNum"> 3593 </span> : { -<span class="lineNum"> 3594 </span> : // concept requirements -<span class="lineNum"> 3595 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) -<span class="lineNum"> 3596 </span> : -<span class="lineNum"> 3597 </span> : return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a) -<span class="lineNum"> 3598 </span> : : pair<const _Tp&, const _Tp&>(__a, __b); -<span class="lineNum"> 3599 </span> : } -<span class="lineNum"> 3600 </span> : -<span class="lineNum"> 3601 </span> : /** -<span class="lineNum"> 3602 </span> : * @brief Determines min and max at once as an ordered pair. -<span class="lineNum"> 3603 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 3604 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 3605 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink. -<span class="lineNum"> 3606 </span> : * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise. -<span class="lineNum"> 3607 </span> : */ -<span class="lineNum"> 3608 </span> : template<typename _Tp, typename _Compare> -<span class="lineNum"> 3609 </span> : inline pair<const _Tp&, const _Tp&> -<span class="lineNum"> 3610 </span> : minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) -<span class="lineNum"> 3611 </span> : { -<span class="lineNum"> 3612 </span> : return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) -<span class="lineNum"> 3613 </span> : : pair<const _Tp&, const _Tp&>(__a, __b); -<span class="lineNum"> 3614 </span> : } -<span class="lineNum"> 3615 </span> : -<span class="lineNum"> 3616 </span> : /** -<span class="lineNum"> 3617 </span> : * @brief Return a pair of iterators pointing to the minimum and maximum -<span class="lineNum"> 3618 </span> : * elements in a range. -<span class="lineNum"> 3619 </span> : * @param first Start of range. -<span class="lineNum"> 3620 </span> : * @param last End of range. -<span class="lineNum"> 3621 </span> : * @return make_pair(m, M), where m is the first iterator i in -<span class="lineNum"> 3622 </span> : * [first, last) such that no other element in the range is -<span class="lineNum"> 3623 </span> : * smaller, and where M is the last iterator i in [first, last) -<span class="lineNum"> 3624 </span> : * such that no other element in the range is larger. -<span class="lineNum"> 3625 </span> : */ -<span class="lineNum"> 3626 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3627 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 3628 </span> : minmax_element(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3629 </span> : { -<span class="lineNum"> 3630 </span> : // concept requirements -<span class="lineNum"> 3631 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3632 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3633 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3634 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3635 </span> : -<span class="lineNum"> 3636 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3637 </span> : if (__first == __last -<span class="lineNum"> 3638 </span> : || ++__next == __last) -<span class="lineNum"> 3639 </span> : return std::make_pair(__first, __first); -<span class="lineNum"> 3640 </span> : -<span class="lineNum"> 3641 </span> : _ForwardIterator __min, __max; -<span class="lineNum"> 3642 </span> : if (*__next < *__first) -<span class="lineNum"> 3643 </span> : { -<span class="lineNum"> 3644 </span> : __min = __next; -<span class="lineNum"> 3645 </span> : __max = __first; -<span class="lineNum"> 3646 </span> : } -<span class="lineNum"> 3647 </span> : else -<span class="lineNum"> 3648 </span> : { -<span class="lineNum"> 3649 </span> : __min = __first; -<span class="lineNum"> 3650 </span> : __max = __next; -<span class="lineNum"> 3651 </span> : } -<span class="lineNum"> 3652 </span> : -<span class="lineNum"> 3653 </span> : __first = __next; -<span class="lineNum"> 3654 </span> : ++__first; -<span class="lineNum"> 3655 </span> : -<span class="lineNum"> 3656 </span> : while (__first != __last) -<span class="lineNum"> 3657 </span> : { -<span class="lineNum"> 3658 </span> : __next = __first; -<span class="lineNum"> 3659 </span> : if (++__next == __last) -<span class="lineNum"> 3660 </span> : { -<span class="lineNum"> 3661 </span> : if (*__first < *__min) -<span class="lineNum"> 3662 </span> : __min = __first; -<span class="lineNum"> 3663 </span> : else if (!(*__first < *__max)) -<span class="lineNum"> 3664 </span> : __max = __first; -<span class="lineNum"> 3665 </span> : break; -<span class="lineNum"> 3666 </span> : } -<span class="lineNum"> 3667 </span> : -<span class="lineNum"> 3668 </span> : if (*__next < *__first) -<span class="lineNum"> 3669 </span> : { -<span class="lineNum"> 3670 </span> : if (*__next < *__min) -<span class="lineNum"> 3671 </span> : __min = __next; -<span class="lineNum"> 3672 </span> : if (!(*__first < *__max)) -<span class="lineNum"> 3673 </span> : __max = __first; -<span class="lineNum"> 3674 </span> : } -<span class="lineNum"> 3675 </span> : else -<span class="lineNum"> 3676 </span> : { -<span class="lineNum"> 3677 </span> : if (*__first < *__min) -<span class="lineNum"> 3678 </span> : __min = __first; -<span class="lineNum"> 3679 </span> : if (!(*__next < *__max)) -<span class="lineNum"> 3680 </span> : __max = __next; -<span class="lineNum"> 3681 </span> : } -<span class="lineNum"> 3682 </span> : -<span class="lineNum"> 3683 </span> : __first = __next; -<span class="lineNum"> 3684 </span> : ++__first; -<span class="lineNum"> 3685 </span> : } -<span class="lineNum"> 3686 </span> : -<span class="lineNum"> 3687 </span> : return std::make_pair(__min, __max); -<span class="lineNum"> 3688 </span> : } -<span class="lineNum"> 3689 </span> : -<span class="lineNum"> 3690 </span> : /** -<span class="lineNum"> 3691 </span> : * @brief Return a pair of iterators pointing to the minimum and maximum -<span class="lineNum"> 3692 </span> : * elements in a range. -<span class="lineNum"> 3693 </span> : * @param first Start of range. -<span class="lineNum"> 3694 </span> : * @param last End of range. -<span class="lineNum"> 3695 </span> : * @param comp Comparison functor. -<span class="lineNum"> 3696 </span> : * @return make_pair(m, M), where m is the first iterator i in -<span class="lineNum"> 3697 </span> : * [first, last) such that no other element in the range is -<span class="lineNum"> 3698 </span> : * smaller, and where M is the last iterator i in [first, last) -<span class="lineNum"> 3699 </span> : * such that no other element in the range is larger. -<span class="lineNum"> 3700 </span> : */ -<span class="lineNum"> 3701 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 3702 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 3703 </span> : minmax_element(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3704 </span> : _Compare __comp) -<span class="lineNum"> 3705 </span> : { -<span class="lineNum"> 3706 </span> : // concept requirements -<span class="lineNum"> 3707 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3708 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3709 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 3710 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3711 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3712 </span> : -<span class="lineNum"> 3713 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3714 </span> : if (__first == __last -<span class="lineNum"> 3715 </span> : || ++__next == __last) -<span class="lineNum"> 3716 </span> : return std::make_pair(__first, __first); -<span class="lineNum"> 3717 </span> : -<span class="lineNum"> 3718 </span> : _ForwardIterator __min, __max; -<span class="lineNum"> 3719 </span> : if (__comp(*__next, *__first)) -<span class="lineNum"> 3720 </span> : { -<span class="lineNum"> 3721 </span> : __min = __next; -<span class="lineNum"> 3722 </span> : __max = __first; -<span class="lineNum"> 3723 </span> : } -<span class="lineNum"> 3724 </span> : else -<span class="lineNum"> 3725 </span> : { -<span class="lineNum"> 3726 </span> : __min = __first; -<span class="lineNum"> 3727 </span> : __max = __next; -<span class="lineNum"> 3728 </span> : } -<span class="lineNum"> 3729 </span> : -<span class="lineNum"> 3730 </span> : __first = __next; -<span class="lineNum"> 3731 </span> : ++__first; -<span class="lineNum"> 3732 </span> : -<span class="lineNum"> 3733 </span> : while (__first != __last) -<span class="lineNum"> 3734 </span> : { -<span class="lineNum"> 3735 </span> : __next = __first; -<span class="lineNum"> 3736 </span> : if (++__next == __last) -<span class="lineNum"> 3737 </span> : { -<span class="lineNum"> 3738 </span> : if (__comp(*__first, *__min)) -<span class="lineNum"> 3739 </span> : __min = __first; -<span class="lineNum"> 3740 </span> : else if (!__comp(*__first, *__max)) -<span class="lineNum"> 3741 </span> : __max = __first; -<span class="lineNum"> 3742 </span> : break; -<span class="lineNum"> 3743 </span> : } -<span class="lineNum"> 3744 </span> : -<span class="lineNum"> 3745 </span> : if (__comp(*__next, *__first)) -<span class="lineNum"> 3746 </span> : { -<span class="lineNum"> 3747 </span> : if (__comp(*__next, *__min)) -<span class="lineNum"> 3748 </span> : __min = __next; -<span class="lineNum"> 3749 </span> : if (!__comp(*__first, *__max)) -<span class="lineNum"> 3750 </span> : __max = __first; -<span class="lineNum"> 3751 </span> : } -<span class="lineNum"> 3752 </span> : else -<span class="lineNum"> 3753 </span> : { -<span class="lineNum"> 3754 </span> : if (__comp(*__first, *__min)) -<span class="lineNum"> 3755 </span> : __min = __first; -<span class="lineNum"> 3756 </span> : if (!__comp(*__next, *__max)) -<span class="lineNum"> 3757 </span> : __max = __next; -<span class="lineNum"> 3758 </span> : } -<span class="lineNum"> 3759 </span> : -<span class="lineNum"> 3760 </span> : __first = __next; -<span class="lineNum"> 3761 </span> : ++__first; -<span class="lineNum"> 3762 </span> : } -<span class="lineNum"> 3763 </span> : -<span class="lineNum"> 3764 </span> : return std::make_pair(__min, __max); -<span class="lineNum"> 3765 </span> : } -<span class="lineNum"> 3766 </span> : #endif // __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 3767 </span> : -<span class="lineNum"> 3768 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 3769 </span> : -<span class="lineNum"> 3770 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) -<span class="lineNum"> 3771 </span> : -<span class="lineNum"> 3772 </span> : /** -<span class="lineNum"> 3773 </span> : * @brief Apply a function to every element of a sequence. -<span class="lineNum"> 3774 </span> : * @param first An input iterator. -<span class="lineNum"> 3775 </span> : * @param last An input iterator. -<span class="lineNum"> 3776 </span> : * @param f A unary function object. -<span class="lineNum"> 3777 </span> : * @return @p f. -<span class="lineNum"> 3778 </span> : * -<span class="lineNum"> 3779 </span> : * Applies the function object @p f to each element in the range -<span class="lineNum"> 3780 </span> : * @p [first,last). @p f must not modify the order of the sequence. -<span class="lineNum"> 3781 </span> : * If @p f has a return value it is ignored. -<span class="lineNum"> 3782 </span> : */ -<span class="lineNum"> 3783 </span> : template<typename _InputIterator, typename _Function> -<span class="lineNum"> 3784 </span> : _Function -<span class="lineNum"> 3785 </span> : for_each(_InputIterator __first, _InputIterator __last, _Function __f) -<span class="lineNum"> 3786 </span> : { -<span class="lineNum"> 3787 </span> : // concept requirements -<span class="lineNum"> 3788 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3789 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3790 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 3791 </span> : __f(*__first); -<span class="lineNum"> 3792 </span> : return __f; -<span class="lineNum"> 3793 </span> : } -<span class="lineNum"> 3794 </span> : -<span class="lineNum"> 3795 </span> : /** -<span class="lineNum"> 3796 </span> : * @brief Find the first occurrence of a value in a sequence. -<span class="lineNum"> 3797 </span> : * @param first An input iterator. -<span class="lineNum"> 3798 </span> : * @param last An input iterator. -<span class="lineNum"> 3799 </span> : * @param val The value to find. -<span class="lineNum"> 3800 </span> : * @return The first iterator @c i in the range @p [first,last) -<span class="lineNum"> 3801 </span> : * such that @c *i == @p val, or @p last if no such iterator exists. -<span class="lineNum"> 3802 </span> : */ -<span class="lineNum"> 3803 </span> : template<typename _InputIterator, typename _Tp> -<span class="lineNum"> 3804 </span> : inline _InputIterator -<span class="lineNum"> 3805 </span> : find(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3806 </span><span class="lineCov"> 3362 : const _Tp& __val)</span> -<span class="lineNum"> 3807 </span> : { -<span class="lineNum"> 3808 </span> : // concept requirements -<span class="lineNum"> 3809 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3810 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3811 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 3812 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3813 </span> : return std::__find(__first, __last, __val, -<span class="lineNum"> 3814 </span><span class="lineCov"> 3362 : std::__iterator_category(__first));</span> -<span class="lineNum"> 3815 </span> : } -<span class="lineNum"> 3816 </span> : -<span class="lineNum"> 3817 </span> : /** -<span class="lineNum"> 3818 </span> : * @brief Find the first element in a sequence for which a -<span class="lineNum"> 3819 </span> : * predicate is true. -<span class="lineNum"> 3820 </span> : * @param first An input iterator. -<span class="lineNum"> 3821 </span> : * @param last An input iterator. -<span class="lineNum"> 3822 </span> : * @param pred A predicate. -<span class="lineNum"> 3823 </span> : * @return The first iterator @c i in the range @p [first,last) -<span class="lineNum"> 3824 </span> : * such that @p pred(*i) is true, or @p last if no such iterator exists. -<span class="lineNum"> 3825 </span> : */ -<span class="lineNum"> 3826 </span> : template<typename _InputIterator, typename _Predicate> -<span class="lineNum"> 3827 </span> : inline _InputIterator -<span class="lineNum"> 3828 </span> : find_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3829 </span><span class="lineCov"> 3 : _Predicate __pred)</span> -<span class="lineNum"> 3830 </span> : { -<span class="lineNum"> 3831 </span> : // concept requirements -<span class="lineNum"> 3832 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3833 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 3834 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3835 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3836 </span> : return std::__find_if(__first, __last, __pred, -<span class="lineNum"> 3837 </span><span class="lineCov"> 3 : std::__iterator_category(__first));</span> -<span class="lineNum"> 3838 </span> : } -<span class="lineNum"> 3839 </span> : -<span class="lineNum"> 3840 </span> : /** -<span class="lineNum"> 3841 </span> : * @brief Find element from a set in a sequence. -<span class="lineNum"> 3842 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 3843 </span> : * @param last1 End of range to search. -<span class="lineNum"> 3844 </span> : * @param first2 Start of match candidates. -<span class="lineNum"> 3845 </span> : * @param last2 End of match candidates. -<span class="lineNum"> 3846 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 3847 </span> : * @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an -<span class="lineNum"> 3848 </span> : * iterator in [first2,last2), or @p last1 if no such iterator exists. -<span class="lineNum"> 3849 </span> : * -<span class="lineNum"> 3850 </span> : * Searches the range @p [first1,last1) for an element that is equal to -<span class="lineNum"> 3851 </span> : * some element in the range [first2,last2). If found, returns an iterator -<span class="lineNum"> 3852 </span> : * in the range [first1,last1), otherwise returns @p last1. -<span class="lineNum"> 3853 </span> : */ -<span class="lineNum"> 3854 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 3855 </span> : _InputIterator -<span class="lineNum"> 3856 </span> : find_first_of(_InputIterator __first1, _InputIterator __last1, -<span class="lineNum"> 3857 </span> : _ForwardIterator __first2, _ForwardIterator __last2) -<span class="lineNum"> 3858 </span> : { -<span class="lineNum"> 3859 </span> : // concept requirements -<span class="lineNum"> 3860 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3861 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3862 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3863 </span> : typename iterator_traits<_InputIterator>::value_type, -<span class="lineNum"> 3864 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3865 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 3866 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 3867 </span> : -<span class="lineNum"> 3868 </span> : for (; __first1 != __last1; ++__first1) -<span class="lineNum"> 3869 </span> : for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) -<span class="lineNum"> 3870 </span> : if (*__first1 == *__iter) -<span class="lineNum"> 3871 </span> : return __first1; -<span class="lineNum"> 3872 </span> : return __last1; -<span class="lineNum"> 3873 </span> : } -<span class="lineNum"> 3874 </span> : -<span class="lineNum"> 3875 </span> : /** -<span class="lineNum"> 3876 </span> : * @brief Find element from a set in a sequence using a predicate. -<span class="lineNum"> 3877 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 3878 </span> : * @param last1 End of range to search. -<span class="lineNum"> 3879 </span> : * @param first2 Start of match candidates. -<span class="lineNum"> 3880 </span> : * @param last2 End of match candidates. -<span class="lineNum"> 3881 </span> : * @param comp Predicate to use. -<span class="lineNum"> 3882 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 3883 </span> : * @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an -<span class="lineNum"> 3884 </span> : * iterator in [first2,last2), or @p last1 if no such iterator exists. -<span class="lineNum"> 3885 </span> : * -<span class="lineNum"> 3886 </span> : -<span class="lineNum"> 3887 </span> : * Searches the range @p [first1,last1) for an element that is -<span class="lineNum"> 3888 </span> : * equal to some element in the range [first2,last2). If found, -<span class="lineNum"> 3889 </span> : * returns an iterator in the range [first1,last1), otherwise -<span class="lineNum"> 3890 </span> : * returns @p last1. -<span class="lineNum"> 3891 </span> : */ -<span class="lineNum"> 3892 </span> : template<typename _InputIterator, typename _ForwardIterator, -<span class="lineNum"> 3893 </span> : typename _BinaryPredicate> -<span class="lineNum"> 3894 </span> : _InputIterator -<span class="lineNum"> 3895 </span> : find_first_of(_InputIterator __first1, _InputIterator __last1, -<span class="lineNum"> 3896 </span> : _ForwardIterator __first2, _ForwardIterator __last2, -<span class="lineNum"> 3897 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 3898 </span> : { -<span class="lineNum"> 3899 </span> : // concept requirements -<span class="lineNum"> 3900 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3901 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3902 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 3903 </span> : typename iterator_traits<_InputIterator>::value_type, -<span class="lineNum"> 3904 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3905 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 3906 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 3907 </span> : -<span class="lineNum"> 3908 </span> : for (; __first1 != __last1; ++__first1) -<span class="lineNum"> 3909 </span> : for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) -<span class="lineNum"> 3910 </span> : if (__comp(*__first1, *__iter)) -<span class="lineNum"> 3911 </span> : return __first1; -<span class="lineNum"> 3912 </span> : return __last1; -<span class="lineNum"> 3913 </span> : } -<span class="lineNum"> 3914 </span> : -<span class="lineNum"> 3915 </span> : /** -<span class="lineNum"> 3916 </span> : * @brief Find two adjacent values in a sequence that are equal. -<span class="lineNum"> 3917 </span> : * @param first A forward iterator. -<span class="lineNum"> 3918 </span> : * @param last A forward iterator. -<span class="lineNum"> 3919 </span> : * @return The first iterator @c i such that @c i and @c i+1 are both -<span class="lineNum"> 3920 </span> : * valid iterators in @p [first,last) and such that @c *i == @c *(i+1), -<span class="lineNum"> 3921 </span> : * or @p last if no such iterator exists. -<span class="lineNum"> 3922 </span> : */ -<span class="lineNum"> 3923 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3924 </span> : _ForwardIterator -<span class="lineNum"> 3925 </span> : adjacent_find(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3926 </span> : { -<span class="lineNum"> 3927 </span> : // concept requirements -<span class="lineNum"> 3928 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3929 </span> : __glibcxx_function_requires(_EqualityComparableConcept< -<span class="lineNum"> 3930 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3931 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3932 </span> : if (__first == __last) -<span class="lineNum"> 3933 </span> : return __last; -<span class="lineNum"> 3934 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3935 </span> : while(++__next != __last) -<span class="lineNum"> 3936 </span> : { -<span class="lineNum"> 3937 </span> : if (*__first == *__next) -<span class="lineNum"> 3938 </span> : return __first; -<span class="lineNum"> 3939 </span> : __first = __next; -<span class="lineNum"> 3940 </span> : } -<span class="lineNum"> 3941 </span> : return __last; -<span class="lineNum"> 3942 </span> : } -<span class="lineNum"> 3943 </span> : -<span class="lineNum"> 3944 </span> : /** -<span class="lineNum"> 3945 </span> : * @brief Find two adjacent values in a sequence using a predicate. -<span class="lineNum"> 3946 </span> : * @param first A forward iterator. -<span class="lineNum"> 3947 </span> : * @param last A forward iterator. -<span class="lineNum"> 3948 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 3949 </span> : * @return The first iterator @c i such that @c i and @c i+1 are both -<span class="lineNum"> 3950 </span> : * valid iterators in @p [first,last) and such that -<span class="lineNum"> 3951 </span> : * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator -<span class="lineNum"> 3952 </span> : * exists. -<span class="lineNum"> 3953 </span> : */ -<span class="lineNum"> 3954 </span> : template<typename _ForwardIterator, typename _BinaryPredicate> -<span class="lineNum"> 3955 </span> : _ForwardIterator -<span class="lineNum"> 3956 </span> : adjacent_find(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3957 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 3958 </span> : { -<span class="lineNum"> 3959 </span> : // concept requirements -<span class="lineNum"> 3960 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3961 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 3962 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 3963 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3964 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3965 </span> : if (__first == __last) -<span class="lineNum"> 3966 </span> : return __last; -<span class="lineNum"> 3967 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3968 </span> : while(++__next != __last) -<span class="lineNum"> 3969 </span> : { -<span class="lineNum"> 3970 </span> : if (__binary_pred(*__first, *__next)) -<span class="lineNum"> 3971 </span> : return __first; -<span class="lineNum"> 3972 </span> : __first = __next; -<span class="lineNum"> 3973 </span> : } -<span class="lineNum"> 3974 </span> : return __last; -<span class="lineNum"> 3975 </span> : } -<span class="lineNum"> 3976 </span> : -<span class="lineNum"> 3977 </span> : /** -<span class="lineNum"> 3978 </span> : * @brief Count the number of copies of a value in a sequence. -<span class="lineNum"> 3979 </span> : * @param first An input iterator. -<span class="lineNum"> 3980 </span> : * @param last An input iterator. -<span class="lineNum"> 3981 </span> : * @param value The value to be counted. -<span class="lineNum"> 3982 </span> : * @return The number of iterators @c i in the range @p [first,last) -<span class="lineNum"> 3983 </span> : * for which @c *i == @p value -<span class="lineNum"> 3984 </span> : */ -<span class="lineNum"> 3985 </span> : template<typename _InputIterator, typename _Tp> -<span class="lineNum"> 3986 </span> : typename iterator_traits<_InputIterator>::difference_type -<span class="lineNum"> 3987 </span> : count(_InputIterator __first, _InputIterator __last, const _Tp& __value) -<span class="lineNum"> 3988 </span> : { -<span class="lineNum"> 3989 </span> : // concept requirements -<span class="lineNum"> 3990 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3991 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3992 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 3993 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3994 </span> : typename iterator_traits<_InputIterator>::difference_type __n = 0; -<span class="lineNum"> 3995 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 3996 </span> : if (*__first == __value) -<span class="lineNum"> 3997 </span> : ++__n; -<span class="lineNum"> 3998 </span> : return __n; -<span class="lineNum"> 3999 </span> : } -<span class="lineNum"> 4000 </span> : -<span class="lineNum"> 4001 </span> : /** -<span class="lineNum"> 4002 </span> : * @brief Count the elements of a sequence for which a predicate is true. -<span class="lineNum"> 4003 </span> : * @param first An input iterator. -<span class="lineNum"> 4004 </span> : * @param last An input iterator. -<span class="lineNum"> 4005 </span> : * @param pred A predicate. -<span class="lineNum"> 4006 </span> : * @return The number of iterators @c i in the range @p [first,last) -<span class="lineNum"> 4007 </span> : * for which @p pred(*i) is true. -<span class="lineNum"> 4008 </span> : */ -<span class="lineNum"> 4009 </span> : template<typename _InputIterator, typename _Predicate> -<span class="lineNum"> 4010 </span> : typename iterator_traits<_InputIterator>::difference_type -<span class="lineNum"> 4011 </span> : count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) -<span class="lineNum"> 4012 </span> : { -<span class="lineNum"> 4013 </span> : // concept requirements -<span class="lineNum"> 4014 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4015 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 4016 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4017 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4018 </span> : typename iterator_traits<_InputIterator>::difference_type __n = 0; -<span class="lineNum"> 4019 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4020 </span> : if (__pred(*__first)) -<span class="lineNum"> 4021 </span> : ++__n; -<span class="lineNum"> 4022 </span> : return __n; -<span class="lineNum"> 4023 </span> : } -<span class="lineNum"> 4024 </span> : -<span class="lineNum"> 4025 </span> : /** -<span class="lineNum"> 4026 </span> : * @brief Search a sequence for a matching sub-sequence. -<span class="lineNum"> 4027 </span> : * @param first1 A forward iterator. -<span class="lineNum"> 4028 </span> : * @param last1 A forward iterator. -<span class="lineNum"> 4029 </span> : * @param first2 A forward iterator. -<span class="lineNum"> 4030 </span> : * @param last2 A forward iterator. -<span class="lineNum"> 4031 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 4032 </span> : * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) -<span class="lineNum"> 4033 </span> : * for each @c N in the range @p [0,last2-first2), or @p last1 if no -<span class="lineNum"> 4034 </span> : * such iterator exists. -<span class="lineNum"> 4035 </span> : * -<span class="lineNum"> 4036 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 4037 </span> : * equal value-by-value with the sequence given by @p [first2,last2) and -<span class="lineNum"> 4038 </span> : * returns an iterator to the first element of the sub-sequence, or -<span class="lineNum"> 4039 </span> : * @p last1 if the sub-sequence is not found. -<span class="lineNum"> 4040 </span> : * -<span class="lineNum"> 4041 </span> : * Because the sub-sequence must lie completely within the range -<span class="lineNum"> 4042 </span> : * @p [first1,last1) it must start at a position less than -<span class="lineNum"> 4043 </span> : * @p last1-(last2-first2) where @p last2-first2 is the length of the -<span class="lineNum"> 4044 </span> : * sub-sequence. -<span class="lineNum"> 4045 </span> : * This means that the returned iterator @c i will be in the range -<span class="lineNum"> 4046 </span> : * @p [first1,last1-(last2-first2)) -<span class="lineNum"> 4047 </span> : */ -<span class="lineNum"> 4048 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 4049 </span> : _ForwardIterator1 -<span class="lineNum"> 4050 </span> : search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 4051 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2) -<span class="lineNum"> 4052 </span> : { -<span class="lineNum"> 4053 </span> : // concept requirements -<span class="lineNum"> 4054 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 4055 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 4056 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 4057 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 4058 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 4059 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 4060 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 4061 </span> : -<span class="lineNum"> 4062 </span> : // Test for empty ranges -<span class="lineNum"> 4063 </span> : if (__first1 == __last1 || __first2 == __last2) -<span class="lineNum"> 4064 </span> : return __first1; -<span class="lineNum"> 4065 </span> : -<span class="lineNum"> 4066 </span> : // Test for a pattern of length 1. -<span class="lineNum"> 4067 </span> : _ForwardIterator2 __p1(__first2); -<span class="lineNum"> 4068 </span> : if (++__p1 == __last2) -<span class="lineNum"> 4069 </span> : return _GLIBCXX_STD_P::find(__first1, __last1, *__first2); -<span class="lineNum"> 4070 </span> : -<span class="lineNum"> 4071 </span> : // General case. -<span class="lineNum"> 4072 </span> : _ForwardIterator2 __p; -<span class="lineNum"> 4073 </span> : _ForwardIterator1 __current = __first1; -<span class="lineNum"> 4074 </span> : -<span class="lineNum"> 4075 </span> : for (;;) -<span class="lineNum"> 4076 </span> : { -<span class="lineNum"> 4077 </span> : __first1 = _GLIBCXX_STD_P::find(__first1, __last1, *__first2); -<span class="lineNum"> 4078 </span> : if (__first1 == __last1) -<span class="lineNum"> 4079 </span> : return __last1; -<span class="lineNum"> 4080 </span> : -<span class="lineNum"> 4081 </span> : __p = __p1; -<span class="lineNum"> 4082 </span> : __current = __first1; -<span class="lineNum"> 4083 </span> : if (++__current == __last1) -<span class="lineNum"> 4084 </span> : return __last1; -<span class="lineNum"> 4085 </span> : -<span class="lineNum"> 4086 </span> : while (*__current == *__p) -<span class="lineNum"> 4087 </span> : { -<span class="lineNum"> 4088 </span> : if (++__p == __last2) -<span class="lineNum"> 4089 </span> : return __first1; -<span class="lineNum"> 4090 </span> : if (++__current == __last1) -<span class="lineNum"> 4091 </span> : return __last1; -<span class="lineNum"> 4092 </span> : } -<span class="lineNum"> 4093 </span> : ++__first1; -<span class="lineNum"> 4094 </span> : } -<span class="lineNum"> 4095 </span> : return __first1; -<span class="lineNum"> 4096 </span> : } -<span class="lineNum"> 4097 </span> : -<span class="lineNum"> 4098 </span> : /** -<span class="lineNum"> 4099 </span> : * @brief Search a sequence for a matching sub-sequence using a predicate. -<span class="lineNum"> 4100 </span> : * @param first1 A forward iterator. -<span class="lineNum"> 4101 </span> : * @param last1 A forward iterator. -<span class="lineNum"> 4102 </span> : * @param first2 A forward iterator. -<span class="lineNum"> 4103 </span> : * @param last2 A forward iterator. -<span class="lineNum"> 4104 </span> : * @param predicate A binary predicate. -<span class="lineNum"> 4105 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 4106 </span> : * @p [first1,last1-(last2-first2)) such that -<span class="lineNum"> 4107 </span> : * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range -<span class="lineNum"> 4108 </span> : * @p [0,last2-first2), or @p last1 if no such iterator exists. -<span class="lineNum"> 4109 </span> : * -<span class="lineNum"> 4110 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 4111 </span> : * equal value-by-value with the sequence given by @p [first2,last2), -<span class="lineNum"> 4112 </span> : * using @p predicate to determine equality, and returns an iterator -<span class="lineNum"> 4113 </span> : * to the first element of the sub-sequence, or @p last1 if no such -<span class="lineNum"> 4114 </span> : * iterator exists. -<span class="lineNum"> 4115 </span> : * -<span class="lineNum"> 4116 </span> : * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2) -<span class="lineNum"> 4117 </span> : */ -<span class="lineNum"> 4118 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2, -<span class="lineNum"> 4119 </span> : typename _BinaryPredicate> -<span class="lineNum"> 4120 </span> : _ForwardIterator1 -<span class="lineNum"> 4121 </span> : search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 4122 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 4123 </span> : _BinaryPredicate __predicate) -<span class="lineNum"> 4124 </span> : { -<span class="lineNum"> 4125 </span> : // concept requirements -<span class="lineNum"> 4126 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 4127 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 4128 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 4129 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 4130 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 4131 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 4132 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 4133 </span> : -<span class="lineNum"> 4134 </span> : // Test for empty ranges -<span class="lineNum"> 4135 </span> : if (__first1 == __last1 || __first2 == __last2) -<span class="lineNum"> 4136 </span> : return __first1; -<span class="lineNum"> 4137 </span> : -<span class="lineNum"> 4138 </span> : // Test for a pattern of length 1. -<span class="lineNum"> 4139 </span> : _ForwardIterator2 __p1(__first2); -<span class="lineNum"> 4140 </span> : if (++__p1 == __last2) -<span class="lineNum"> 4141 </span> : { -<span class="lineNum"> 4142 </span> : while (__first1 != __last1 -<span class="lineNum"> 4143 </span> : && !bool(__predicate(*__first1, *__first2))) -<span class="lineNum"> 4144 </span> : ++__first1; -<span class="lineNum"> 4145 </span> : return __first1; -<span class="lineNum"> 4146 </span> : } -<span class="lineNum"> 4147 </span> : -<span class="lineNum"> 4148 </span> : // General case. -<span class="lineNum"> 4149 </span> : _ForwardIterator2 __p; -<span class="lineNum"> 4150 </span> : _ForwardIterator1 __current = __first1; -<span class="lineNum"> 4151 </span> : -<span class="lineNum"> 4152 </span> : for (;;) -<span class="lineNum"> 4153 </span> : { -<span class="lineNum"> 4154 </span> : while (__first1 != __last1 -<span class="lineNum"> 4155 </span> : && !bool(__predicate(*__first1, *__first2))) -<span class="lineNum"> 4156 </span> : ++__first1; -<span class="lineNum"> 4157 </span> : if (__first1 == __last1) -<span class="lineNum"> 4158 </span> : return __last1; -<span class="lineNum"> 4159 </span> : -<span class="lineNum"> 4160 </span> : __p = __p1; -<span class="lineNum"> 4161 </span> : __current = __first1; -<span class="lineNum"> 4162 </span> : if (++__current == __last1) -<span class="lineNum"> 4163 </span> : return __last1; -<span class="lineNum"> 4164 </span> : -<span class="lineNum"> 4165 </span> : while (__predicate(*__current, *__p)) -<span class="lineNum"> 4166 </span> : { -<span class="lineNum"> 4167 </span> : if (++__p == __last2) -<span class="lineNum"> 4168 </span> : return __first1; -<span class="lineNum"> 4169 </span> : if (++__current == __last1) -<span class="lineNum"> 4170 </span> : return __last1; -<span class="lineNum"> 4171 </span> : } -<span class="lineNum"> 4172 </span> : ++__first1; -<span class="lineNum"> 4173 </span> : } -<span class="lineNum"> 4174 </span> : return __first1; -<span class="lineNum"> 4175 </span> : } -<span class="lineNum"> 4176 </span> : -<span class="lineNum"> 4177 </span> : -<span class="lineNum"> 4178 </span> : /** -<span class="lineNum"> 4179 </span> : * @brief Search a sequence for a number of consecutive values. -<span class="lineNum"> 4180 </span> : * @param first A forward iterator. -<span class="lineNum"> 4181 </span> : * @param last A forward iterator. -<span class="lineNum"> 4182 </span> : * @param count The number of consecutive values. -<span class="lineNum"> 4183 </span> : * @param val The value to find. -<span class="lineNum"> 4184 </span> : * @return The first iterator @c i in the range @p [first,last-count) -<span class="lineNum"> 4185 </span> : * such that @c *(i+N) == @p val for each @c N in the range @p [0,count), -<span class="lineNum"> 4186 </span> : * or @p last if no such iterator exists. -<span class="lineNum"> 4187 </span> : * -<span class="lineNum"> 4188 </span> : * Searches the range @p [first,last) for @p count consecutive elements -<span class="lineNum"> 4189 </span> : * equal to @p val. -<span class="lineNum"> 4190 </span> : */ -<span class="lineNum"> 4191 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp> -<span class="lineNum"> 4192 </span> : _ForwardIterator -<span class="lineNum"> 4193 </span> : search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4194 </span> : _Integer __count, const _Tp& __val) -<span class="lineNum"> 4195 </span> : { -<span class="lineNum"> 4196 </span> : // concept requirements -<span class="lineNum"> 4197 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 4198 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 4199 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 4200 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4201 </span> : -<span class="lineNum"> 4202 </span> : if (__count <= 0) -<span class="lineNum"> 4203 </span> : return __first; -<span class="lineNum"> 4204 </span> : if (__count == 1) -<span class="lineNum"> 4205 </span> : return _GLIBCXX_STD_P::find(__first, __last, __val); -<span class="lineNum"> 4206 </span> : return std::__search_n(__first, __last, __count, __val, -<span class="lineNum"> 4207 </span> : std::__iterator_category(__first)); -<span class="lineNum"> 4208 </span> : } -<span class="lineNum"> 4209 </span> : -<span class="lineNum"> 4210 </span> : -<span class="lineNum"> 4211 </span> : /** -<span class="lineNum"> 4212 </span> : * @brief Search a sequence for a number of consecutive values using a -<span class="lineNum"> 4213 </span> : * predicate. -<span class="lineNum"> 4214 </span> : * @param first A forward iterator. -<span class="lineNum"> 4215 </span> : * @param last A forward iterator. -<span class="lineNum"> 4216 </span> : * @param count The number of consecutive values. -<span class="lineNum"> 4217 </span> : * @param val The value to find. -<span class="lineNum"> 4218 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 4219 </span> : * @return The first iterator @c i in the range @p [first,last-count) -<span class="lineNum"> 4220 </span> : * such that @p binary_pred(*(i+N),val) is true for each @c N in the -<span class="lineNum"> 4221 </span> : * range @p [0,count), or @p last if no such iterator exists. -<span class="lineNum"> 4222 </span> : * -<span class="lineNum"> 4223 </span> : * Searches the range @p [first,last) for @p count consecutive elements -<span class="lineNum"> 4224 </span> : * for which the predicate returns true. -<span class="lineNum"> 4225 </span> : */ -<span class="lineNum"> 4226 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp, -<span class="lineNum"> 4227 </span> : typename _BinaryPredicate> -<span class="lineNum"> 4228 </span> : _ForwardIterator -<span class="lineNum"> 4229 </span> : search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4230 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 4231 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 4232 </span> : { -<span class="lineNum"> 4233 </span> : // concept requirements -<span class="lineNum"> 4234 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 4235 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 4236 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 4237 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4238 </span> : -<span class="lineNum"> 4239 </span> : if (__count <= 0) -<span class="lineNum"> 4240 </span> : return __first; -<span class="lineNum"> 4241 </span> : if (__count == 1) -<span class="lineNum"> 4242 </span> : { -<span class="lineNum"> 4243 </span> : while (__first != __last && !bool(__binary_pred(*__first, __val))) -<span class="lineNum"> 4244 </span> : ++__first; -<span class="lineNum"> 4245 </span> : return __first; -<span class="lineNum"> 4246 </span> : } -<span class="lineNum"> 4247 </span> : return std::__search_n(__first, __last, __count, __val, __binary_pred, -<span class="lineNum"> 4248 </span> : std::__iterator_category(__first)); -<span class="lineNum"> 4249 </span> : } -<span class="lineNum"> 4250 </span> : -<span class="lineNum"> 4251 </span> : -<span class="lineNum"> 4252 </span> : /** -<span class="lineNum"> 4253 </span> : * @brief Perform an operation on a sequence. -<span class="lineNum"> 4254 </span> : * @param first An input iterator. -<span class="lineNum"> 4255 </span> : * @param last An input iterator. -<span class="lineNum"> 4256 </span> : * @param result An output iterator. -<span class="lineNum"> 4257 </span> : * @param unary_op A unary operator. -<span class="lineNum"> 4258 </span> : * @return An output iterator equal to @p result+(last-first). -<span class="lineNum"> 4259 </span> : * -<span class="lineNum"> 4260 </span> : * Applies the operator to each element in the input range and assigns -<span class="lineNum"> 4261 </span> : * the results to successive elements of the output sequence. -<span class="lineNum"> 4262 </span> : * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the -<span class="lineNum"> 4263 </span> : * range @p [0,last-first). -<span class="lineNum"> 4264 </span> : * -<span class="lineNum"> 4265 </span> : * @p unary_op must not alter its argument. -<span class="lineNum"> 4266 </span> : */ -<span class="lineNum"> 4267 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 4268 </span> : typename _UnaryOperation> -<span class="lineNum"> 4269 </span> : _OutputIterator -<span class="lineNum"> 4270 </span> : transform(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 4271 </span> : _OutputIterator __result, _UnaryOperation __unary_op) -<span class="lineNum"> 4272 </span> : { -<span class="lineNum"> 4273 </span> : // concept requirements -<span class="lineNum"> 4274 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4275 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4276 </span> : // "the type returned by a _UnaryOperation" -<span class="lineNum"> 4277 </span> : __typeof__(__unary_op(*__first))>) -<span class="lineNum"> 4278 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4279 </span> : -<span class="lineNum"> 4280 </span> : for (; __first != __last; ++__first, ++__result) -<span class="lineNum"> 4281 </span> : *__result = __unary_op(*__first); -<span class="lineNum"> 4282 </span> : return __result; -<span class="lineNum"> 4283 </span> : } -<span class="lineNum"> 4284 </span> : -<span class="lineNum"> 4285 </span> : /** -<span class="lineNum"> 4286 </span> : * @brief Perform an operation on corresponding elements of two sequences. -<span class="lineNum"> 4287 </span> : * @param first1 An input iterator. -<span class="lineNum"> 4288 </span> : * @param last1 An input iterator. -<span class="lineNum"> 4289 </span> : * @param first2 An input iterator. -<span class="lineNum"> 4290 </span> : * @param result An output iterator. -<span class="lineNum"> 4291 </span> : * @param binary_op A binary operator. -<span class="lineNum"> 4292 </span> : * @return An output iterator equal to @p result+(last-first). -<span class="lineNum"> 4293 </span> : * -<span class="lineNum"> 4294 </span> : * Applies the operator to the corresponding elements in the two -<span class="lineNum"> 4295 </span> : * input ranges and assigns the results to successive elements of the -<span class="lineNum"> 4296 </span> : * output sequence. -<span class="lineNum"> 4297 </span> : * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each -<span class="lineNum"> 4298 </span> : * @c N in the range @p [0,last1-first1). -<span class="lineNum"> 4299 </span> : * -<span class="lineNum"> 4300 </span> : * @p binary_op must not alter either of its arguments. -<span class="lineNum"> 4301 </span> : */ -<span class="lineNum"> 4302 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 4303 </span> : typename _OutputIterator, typename _BinaryOperation> -<span class="lineNum"> 4304 </span> : _OutputIterator -<span class="lineNum"> 4305 </span> : transform(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 4306 </span> : _InputIterator2 __first2, _OutputIterator __result, -<span class="lineNum"> 4307 </span> : _BinaryOperation __binary_op) -<span class="lineNum"> 4308 </span> : { -<span class="lineNum"> 4309 </span> : // concept requirements -<span class="lineNum"> 4310 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 4311 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 4312 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4313 </span> : // "the type returned by a _BinaryOperation" -<span class="lineNum"> 4314 </span> : __typeof__(__binary_op(*__first1,*__first2))>) -<span class="lineNum"> 4315 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 4316 </span> : -<span class="lineNum"> 4317 </span> : for (; __first1 != __last1; ++__first1, ++__first2, ++__result) -<span class="lineNum"> 4318 </span> : *__result = __binary_op(*__first1, *__first2); -<span class="lineNum"> 4319 </span> : return __result; -<span class="lineNum"> 4320 </span> : } -<span class="lineNum"> 4321 </span> : -<span class="lineNum"> 4322 </span> : /** -<span class="lineNum"> 4323 </span> : * @brief Replace each occurrence of one value in a sequence with another -<span class="lineNum"> 4324 </span> : * value. -<span class="lineNum"> 4325 </span> : * @param first A forward iterator. -<span class="lineNum"> 4326 </span> : * @param last A forward iterator. -<span class="lineNum"> 4327 </span> : * @param old_value The value to be replaced. -<span class="lineNum"> 4328 </span> : * @param new_value The replacement value. -<span class="lineNum"> 4329 </span> : * @return replace() returns no value. -<span class="lineNum"> 4330 </span> : * -<span class="lineNum"> 4331 </span> : * For each iterator @c i in the range @p [first,last) if @c *i == -<span class="lineNum"> 4332 </span> : * @p old_value then the assignment @c *i = @p new_value is performed. -<span class="lineNum"> 4333 </span> : */ -<span class="lineNum"> 4334 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 4335 </span> : void -<span class="lineNum"> 4336 </span> : replace(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4337 </span> : const _Tp& __old_value, const _Tp& __new_value) -<span class="lineNum"> 4338 </span> : { -<span class="lineNum"> 4339 </span> : // concept requirements -<span class="lineNum"> 4340 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 4341 </span> : _ForwardIterator>) -<span class="lineNum"> 4342 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 4343 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 4344 </span> : __glibcxx_function_requires(_ConvertibleConcept<_Tp, -<span class="lineNum"> 4345 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4346 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4347 </span> : -<span class="lineNum"> 4348 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4349 </span> : if (*__first == __old_value) -<span class="lineNum"> 4350 </span> : *__first = __new_value; -<span class="lineNum"> 4351 </span> : } -<span class="lineNum"> 4352 </span> : -<span class="lineNum"> 4353 </span> : /** -<span class="lineNum"> 4354 </span> : * @brief Replace each value in a sequence for which a predicate returns -<span class="lineNum"> 4355 </span> : * true with another value. -<span class="lineNum"> 4356 </span> : * @param first A forward iterator. -<span class="lineNum"> 4357 </span> : * @param last A forward iterator. -<span class="lineNum"> 4358 </span> : * @param pred A predicate. -<span class="lineNum"> 4359 </span> : * @param new_value The replacement value. -<span class="lineNum"> 4360 </span> : * @return replace_if() returns no value. -<span class="lineNum"> 4361 </span> : * -<span class="lineNum"> 4362 </span> : * For each iterator @c i in the range @p [first,last) if @p pred(*i) -<span class="lineNum"> 4363 </span> : * is true then the assignment @c *i = @p new_value is performed. -<span class="lineNum"> 4364 </span> : */ -<span class="lineNum"> 4365 </span> : template<typename _ForwardIterator, typename _Predicate, typename _Tp> -<span class="lineNum"> 4366 </span> : void -<span class="lineNum"> 4367 </span> : replace_if(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4368 </span> : _Predicate __pred, const _Tp& __new_value) -<span class="lineNum"> 4369 </span> : { -<span class="lineNum"> 4370 </span> : // concept requirements -<span class="lineNum"> 4371 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 4372 </span> : _ForwardIterator>) -<span class="lineNum"> 4373 </span> : __glibcxx_function_requires(_ConvertibleConcept<_Tp, -<span class="lineNum"> 4374 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4375 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 4376 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4377 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4378 </span> : -<span class="lineNum"> 4379 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4380 </span> : if (__pred(*__first)) -<span class="lineNum"> 4381 </span> : *__first = __new_value; -<span class="lineNum"> 4382 </span> : } -<span class="lineNum"> 4383 </span> : -<span class="lineNum"> 4384 </span> : /** -<span class="lineNum"> 4385 </span> : * @brief Assign the result of a function object to each value in a -<span class="lineNum"> 4386 </span> : * sequence. -<span class="lineNum"> 4387 </span> : * @param first A forward iterator. -<span class="lineNum"> 4388 </span> : * @param last A forward iterator. -<span class="lineNum"> 4389 </span> : * @param gen A function object taking no arguments and returning -<span class="lineNum"> 4390 </span> : * std::iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 4391 </span> : * @return generate() returns no value. -<span class="lineNum"> 4392 </span> : * -<span class="lineNum"> 4393 </span> : * Performs the assignment @c *i = @p gen() for each @c i in the range -<span class="lineNum"> 4394 </span> : * @p [first,last). -<span class="lineNum"> 4395 </span> : */ -<span class="lineNum"> 4396 </span> : template<typename _ForwardIterator, typename _Generator> -<span class="lineNum"> 4397 </span> : void -<span class="lineNum"> 4398 </span> : generate(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4399 </span> : _Generator __gen) -<span class="lineNum"> 4400 </span> : { -<span class="lineNum"> 4401 </span> : // concept requirements -<span class="lineNum"> 4402 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 4403 </span> : __glibcxx_function_requires(_GeneratorConcept<_Generator, -<span class="lineNum"> 4404 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4405 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4406 </span> : -<span class="lineNum"> 4407 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4408 </span> : *__first = __gen(); -<span class="lineNum"> 4409 </span> : } -<span class="lineNum"> 4410 </span> : -<span class="lineNum"> 4411 </span> : /** -<span class="lineNum"> 4412 </span> : * @brief Assign the result of a function object to each value in a -<span class="lineNum"> 4413 </span> : * sequence. -<span class="lineNum"> 4414 </span> : * @param first A forward iterator. -<span class="lineNum"> 4415 </span> : * @param n The length of the sequence. -<span class="lineNum"> 4416 </span> : * @param gen A function object taking no arguments and returning -<span class="lineNum"> 4417 </span> : * std::iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 4418 </span> : * @return The end of the sequence, @p first+n -<span class="lineNum"> 4419 </span> : * -<span class="lineNum"> 4420 </span> : * Performs the assignment @c *i = @p gen() for each @c i in the range -<span class="lineNum"> 4421 </span> : * @p [first,first+n). -<span class="lineNum"> 4422 </span> : */ -<span class="lineNum"> 4423 </span> : template<typename _OutputIterator, typename _Size, typename _Generator> -<span class="lineNum"> 4424 </span> : _OutputIterator -<span class="lineNum"> 4425 </span> : generate_n(_OutputIterator __first, _Size __n, _Generator __gen) -<span class="lineNum"> 4426 </span> : { -<span class="lineNum"> 4427 </span> : // concept requirements -<span class="lineNum"> 4428 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4429 </span> : // "the type returned by a _Generator" -<span class="lineNum"> 4430 </span> : __typeof__(__gen())>) -<span class="lineNum"> 4431 </span> : -<span class="lineNum"> 4432 </span> : for (; __n > 0; --__n, ++__first) -<span class="lineNum"> 4433 </span> : *__first = __gen(); -<span class="lineNum"> 4434 </span> : return __first; -<span class="lineNum"> 4435 </span> : } -<span class="lineNum"> 4436 </span> : -<span class="lineNum"> 4437 </span> : -<span class="lineNum"> 4438 </span> : /** -<span class="lineNum"> 4439 </span> : * @brief Copy a sequence, removing consecutive duplicate values. -<span class="lineNum"> 4440 </span> : * @param first An input iterator. -<span class="lineNum"> 4441 </span> : * @param last An input iterator. -<span class="lineNum"> 4442 </span> : * @param result An output iterator. -<span class="lineNum"> 4443 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 4444 </span> : * -<span class="lineNum"> 4445 </span> : * Copies each element in the range @p [first,last) to the range -<span class="lineNum"> 4446 </span> : * beginning at @p result, except that only the first element is copied -<span class="lineNum"> 4447 </span> : * from groups of consecutive elements that compare equal. -<span class="lineNum"> 4448 </span> : * unique_copy() is stable, so the relative order of elements that are -<span class="lineNum"> 4449 </span> : * copied is unchanged. -<span class="lineNum"> 4450 </span> : * -<span class="lineNum"> 4451 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 4452 </span> : * DR 241. Does unique_copy() require CopyConstructible and Assignable? -<span class="lineNum"> 4453 </span> : * -<span class="lineNum"> 4454 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 4455 </span> : * DR 538. 241 again: Does unique_copy() require CopyConstructible and -<span class="lineNum"> 4456 </span> : * Assignable? -<span class="lineNum"> 4457 </span> : */ -<span class="lineNum"> 4458 </span> : template<typename _InputIterator, typename _OutputIterator> -<span class="lineNum"> 4459 </span> : inline _OutputIterator -<span class="lineNum"> 4460 </span> : unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 4461 </span> : _OutputIterator __result) -<span class="lineNum"> 4462 </span> : { -<span class="lineNum"> 4463 </span> : // concept requirements -<span class="lineNum"> 4464 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4465 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4466 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4467 </span> : __glibcxx_function_requires(_EqualityComparableConcept< -<span class="lineNum"> 4468 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4469 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4470 </span> : -<span class="lineNum"> 4471 </span> : if (__first == __last) -<span class="lineNum"> 4472 </span> : return __result; -<span class="lineNum"> 4473 </span> : return std::__unique_copy(__first, __last, __result, -<span class="lineNum"> 4474 </span> : std::__iterator_category(__first), -<span class="lineNum"> 4475 </span> : std::__iterator_category(__result)); -<span class="lineNum"> 4476 </span> : } -<span class="lineNum"> 4477 </span> : -<span class="lineNum"> 4478 </span> : /** -<span class="lineNum"> 4479 </span> : * @brief Copy a sequence, removing consecutive values using a predicate. -<span class="lineNum"> 4480 </span> : * @param first An input iterator. -<span class="lineNum"> 4481 </span> : * @param last An input iterator. -<span class="lineNum"> 4482 </span> : * @param result An output iterator. -<span class="lineNum"> 4483 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 4484 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 4485 </span> : * -<span class="lineNum"> 4486 </span> : * Copies each element in the range @p [first,last) to the range -<span class="lineNum"> 4487 </span> : * beginning at @p result, except that only the first element is copied -<span class="lineNum"> 4488 </span> : * from groups of consecutive elements for which @p binary_pred returns -<span class="lineNum"> 4489 </span> : * true. -<span class="lineNum"> 4490 </span> : * unique_copy() is stable, so the relative order of elements that are -<span class="lineNum"> 4491 </span> : * copied is unchanged. -<span class="lineNum"> 4492 </span> : * -<span class="lineNum"> 4493 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 4494 </span> : * DR 241. Does unique_copy() require CopyConstructible and Assignable? -<span class="lineNum"> 4495 </span> : */ -<span class="lineNum"> 4496 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 4497 </span> : typename _BinaryPredicate> -<span class="lineNum"> 4498 </span> : inline _OutputIterator -<span class="lineNum"> 4499 </span> : unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 4500 </span> : _OutputIterator __result, -<span class="lineNum"> 4501 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 4502 </span> : { -<span class="lineNum"> 4503 </span> : // concept requirements -- predicates checked later -<span class="lineNum"> 4504 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4505 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4506 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4507 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4508 </span> : -<span class="lineNum"> 4509 </span> : if (__first == __last) -<span class="lineNum"> 4510 </span> : return __result; -<span class="lineNum"> 4511 </span> : return std::__unique_copy(__first, __last, __result, __binary_pred, -<span class="lineNum"> 4512 </span> : std::__iterator_category(__first), -<span class="lineNum"> 4513 </span> : std::__iterator_category(__result)); -<span class="lineNum"> 4514 </span> : } -<span class="lineNum"> 4515 </span> : -<span class="lineNum"> 4516 </span> : -<span class="lineNum"> 4517 </span> : /** -<span class="lineNum"> 4518 </span> : * @brief Randomly shuffle the elements of a sequence. -<span class="lineNum"> 4519 </span> : * @param first A forward iterator. -<span class="lineNum"> 4520 </span> : * @param last A forward iterator. -<span class="lineNum"> 4521 </span> : * @return Nothing. -<span class="lineNum"> 4522 </span> : * -<span class="lineNum"> 4523 </span> : * Reorder the elements in the range @p [first,last) using a random -<span class="lineNum"> 4524 </span> : * distribution, so that every possible ordering of the sequence is -<span class="lineNum"> 4525 </span> : * equally likely. -<span class="lineNum"> 4526 </span> : */ -<span class="lineNum"> 4527 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4528 </span> : inline void -<span class="lineNum"> 4529 </span> : random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 4530 </span> : { -<span class="lineNum"> 4531 </span> : // concept requirements -<span class="lineNum"> 4532 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4533 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4534 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4535 </span> : -<span class="lineNum"> 4536 </span> : if (__first != __last) -<span class="lineNum"> 4537 </span> : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) -<span class="lineNum"> 4538 </span> : std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1))); -<span class="lineNum"> 4539 </span> : } -<span class="lineNum"> 4540 </span> : -<span class="lineNum"> 4541 </span> : /** -<span class="lineNum"> 4542 </span> : * @brief Shuffle the elements of a sequence using a random number -<span class="lineNum"> 4543 </span> : * generator. -<span class="lineNum"> 4544 </span> : * @param first A forward iterator. -<span class="lineNum"> 4545 </span> : * @param last A forward iterator. -<span class="lineNum"> 4546 </span> : * @param rand The RNG functor or function. -<span class="lineNum"> 4547 </span> : * @return Nothing. -<span class="lineNum"> 4548 </span> : * -<span class="lineNum"> 4549 </span> : * Reorders the elements in the range @p [first,last) using @p rand to -<span class="lineNum"> 4550 </span> : * provide a random distribution. Calling @p rand(N) for a positive -<span class="lineNum"> 4551 </span> : * integer @p N should return a randomly chosen integer from the -<span class="lineNum"> 4552 </span> : * range [0,N). -<span class="lineNum"> 4553 </span> : */ -<span class="lineNum"> 4554 </span> : template<typename _RandomAccessIterator, typename _RandomNumberGenerator> -<span class="lineNum"> 4555 </span> : void -<span class="lineNum"> 4556 </span> : random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 4557 </span> : _RandomNumberGenerator& __rand) -<span class="lineNum"> 4558 </span> : { -<span class="lineNum"> 4559 </span> : // concept requirements -<span class="lineNum"> 4560 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4561 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4562 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4563 </span> : -<span class="lineNum"> 4564 </span> : if (__first == __last) -<span class="lineNum"> 4565 </span> : return; -<span class="lineNum"> 4566 </span> : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) -<span class="lineNum"> 4567 </span> : std::iter_swap(__i, __first + __rand((__i - __first) + 1)); -<span class="lineNum"> 4568 </span> : } -<span class="lineNum"> 4569 </span> : -<span class="lineNum"> 4570 </span> : -<span class="lineNum"> 4571 </span> : /** -<span class="lineNum"> 4572 </span> : * @brief Move elements for which a predicate is true to the beginning -<span class="lineNum"> 4573 </span> : * of a sequence. -<span class="lineNum"> 4574 </span> : * @param first A forward iterator. -<span class="lineNum"> 4575 </span> : * @param last A forward iterator. -<span class="lineNum"> 4576 </span> : * @param pred A predicate functor. -<span class="lineNum"> 4577 </span> : * @return An iterator @p middle such that @p pred(i) is true for each -<span class="lineNum"> 4578 </span> : * iterator @p i in the range @p [first,middle) and false for each @p i -<span class="lineNum"> 4579 </span> : * in the range @p [middle,last). -<span class="lineNum"> 4580 </span> : * -<span class="lineNum"> 4581 </span> : * @p pred must not modify its operand. @p partition() does not preserve -<span class="lineNum"> 4582 </span> : * the relative ordering of elements in each group, use -<span class="lineNum"> 4583 </span> : * @p stable_partition() if this is needed. -<span class="lineNum"> 4584 </span> : */ -<span class="lineNum"> 4585 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 4586 </span> : inline _ForwardIterator -<span class="lineNum"> 4587 </span> : partition(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4588 </span> : _Predicate __pred) -<span class="lineNum"> 4589 </span> : { -<span class="lineNum"> 4590 </span> : // concept requirements -<span class="lineNum"> 4591 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 4592 </span> : _ForwardIterator>) -<span class="lineNum"> 4593 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 4594 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4595 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4596 </span> : -<span class="lineNum"> 4597 </span> : return std::__partition(__first, __last, __pred, -<span class="lineNum"> 4598 </span> : std::__iterator_category(__first)); -<span class="lineNum"> 4599 </span> : } -<span class="lineNum"> 4600 </span> : -<span class="lineNum"> 4601 </span> : -<span class="lineNum"> 4602 </span> : -<span class="lineNum"> 4603 </span> : /** -<span class="lineNum"> 4604 </span> : * @brief Sort the smallest elements of a sequence. -<span class="lineNum"> 4605 </span> : * @param first An iterator. -<span class="lineNum"> 4606 </span> : * @param middle Another iterator. -<span class="lineNum"> 4607 </span> : * @param last Another iterator. -<span class="lineNum"> 4608 </span> : * @return Nothing. -<span class="lineNum"> 4609 </span> : * -<span class="lineNum"> 4610 </span> : * Sorts the smallest @p (middle-first) elements in the range -<span class="lineNum"> 4611 </span> : * @p [first,last) and moves them to the range @p [first,middle). The -<span class="lineNum"> 4612 </span> : * order of the remaining elements in the range @p [middle,last) is -<span class="lineNum"> 4613 </span> : * undefined. -<span class="lineNum"> 4614 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 4615 </span> : * @p [first,middle) such that @i precedes @j and @k is an iterator in -<span class="lineNum"> 4616 </span> : * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false. -<span class="lineNum"> 4617 </span> : */ -<span class="lineNum"> 4618 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4619 </span> : inline void -<span class="lineNum"> 4620 </span> : partial_sort(_RandomAccessIterator __first, -<span class="lineNum"> 4621 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 4622 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 4623 </span> : { -<span class="lineNum"> 4624 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4625 </span> : _ValueType; -<span class="lineNum"> 4626 </span> : -<span class="lineNum"> 4627 </span> : // concept requirements -<span class="lineNum"> 4628 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4629 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4630 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4631 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 4632 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 4633 </span> : -<span class="lineNum"> 4634 </span><span class="lineNoCov"> 0 : std::__heap_select(__first, __middle, __last);</span> -<span class="lineNum"> 4635 </span><span class="lineNoCov"> 0 : std::sort_heap(__first, __middle);</span> -<span class="lineNum"> 4636 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 4637 </span> : -<span class="lineNum"> 4638 </span> : /** -<span class="lineNum"> 4639 </span> : * @brief Sort the smallest elements of a sequence using a predicate -<span class="lineNum"> 4640 </span> : * for comparison. -<span class="lineNum"> 4641 </span> : * @param first An iterator. -<span class="lineNum"> 4642 </span> : * @param middle Another iterator. -<span class="lineNum"> 4643 </span> : * @param last Another iterator. -<span class="lineNum"> 4644 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4645 </span> : * @return Nothing. -<span class="lineNum"> 4646 </span> : * -<span class="lineNum"> 4647 </span> : * Sorts the smallest @p (middle-first) elements in the range -<span class="lineNum"> 4648 </span> : * @p [first,last) and moves them to the range @p [first,middle). The -<span class="lineNum"> 4649 </span> : * order of the remaining elements in the range @p [middle,last) is -<span class="lineNum"> 4650 </span> : * undefined. -<span class="lineNum"> 4651 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 4652 </span> : * @p [first,middle) such that @i precedes @j and @k is an iterator in -<span class="lineNum"> 4653 </span> : * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i) -<span class="lineNum"> 4654 </span> : * are both false. -<span class="lineNum"> 4655 </span> : */ -<span class="lineNum"> 4656 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 4657 </span> : inline void -<span class="lineNum"> 4658 </span> : partial_sort(_RandomAccessIterator __first, -<span class="lineNum"> 4659 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 4660 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 4661 </span><span class="lineNoCov"> 0 : _Compare __comp)</span> -<span class="lineNum"> 4662 </span> : { -<span class="lineNum"> 4663 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4664 </span> : _ValueType; -<span class="lineNum"> 4665 </span> : -<span class="lineNum"> 4666 </span> : // concept requirements -<span class="lineNum"> 4667 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4668 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4669 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 4670 </span> : _ValueType, _ValueType>) -<span class="lineNum"> 4671 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 4672 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 4673 </span> : -<span class="lineNum"> 4674 </span><span class="lineNoCov"> 0 : std::__heap_select(__first, __middle, __last, __comp);</span> -<span class="lineNum"> 4675 </span><span class="lineNoCov"> 0 : std::sort_heap(__first, __middle, __comp);</span> -<span class="lineNum"> 4676 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 4677 </span> : -<span class="lineNum"> 4678 </span> : /** -<span class="lineNum"> 4679 </span> : * @brief Sort a sequence just enough to find a particular position. -<span class="lineNum"> 4680 </span> : * @param first An iterator. -<span class="lineNum"> 4681 </span> : * @param nth Another iterator. -<span class="lineNum"> 4682 </span> : * @param last Another iterator. -<span class="lineNum"> 4683 </span> : * @return Nothing. -<span class="lineNum"> 4684 </span> : * -<span class="lineNum"> 4685 </span> : * Rearranges the elements in the range @p [first,last) so that @p *nth -<span class="lineNum"> 4686 </span> : * is the same element that would have been in that position had the -<span class="lineNum"> 4687 </span> : * whole sequence been sorted. -<span class="lineNum"> 4688 </span> : * whole sequence been sorted. The elements either side of @p *nth are -<span class="lineNum"> 4689 </span> : * not completely sorted, but for any iterator @i in the range -<span class="lineNum"> 4690 </span> : * @p [first,nth) and any iterator @j in the range @p [nth,last) it -<span class="lineNum"> 4691 </span> : * holds that @p *j<*i is false. -<span class="lineNum"> 4692 </span> : */ -<span class="lineNum"> 4693 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4694 </span> : inline void -<span class="lineNum"> 4695 </span> : nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 4696 </span> : _RandomAccessIterator __last) -<span class="lineNum"> 4697 </span> : { -<span class="lineNum"> 4698 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4699 </span> : _ValueType; -<span class="lineNum"> 4700 </span> : -<span class="lineNum"> 4701 </span> : // concept requirements -<span class="lineNum"> 4702 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4703 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4704 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4705 </span> : __glibcxx_requires_valid_range(__first, __nth); -<span class="lineNum"> 4706 </span> : __glibcxx_requires_valid_range(__nth, __last); -<span class="lineNum"> 4707 </span> : -<span class="lineNum"> 4708 </span> : if (__first == __last || __nth == __last) -<span class="lineNum"> 4709 </span> : return; -<span class="lineNum"> 4710 </span> : -<span class="lineNum"> 4711 </span> : std::__introselect(__first, __nth, __last, -<span class="lineNum"> 4712 </span> : std::__lg(__last - __first) * 2); -<span class="lineNum"> 4713 </span> : } -<span class="lineNum"> 4714 </span> : -<span class="lineNum"> 4715 </span> : /** -<span class="lineNum"> 4716 </span> : * @brief Sort a sequence just enough to find a particular position -<span class="lineNum"> 4717 </span> : * using a predicate for comparison. -<span class="lineNum"> 4718 </span> : * @param first An iterator. -<span class="lineNum"> 4719 </span> : * @param nth Another iterator. -<span class="lineNum"> 4720 </span> : * @param last Another iterator. -<span class="lineNum"> 4721 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4722 </span> : * @return Nothing. -<span class="lineNum"> 4723 </span> : * -<span class="lineNum"> 4724 </span> : * Rearranges the elements in the range @p [first,last) so that @p *nth -<span class="lineNum"> 4725 </span> : * is the same element that would have been in that position had the -<span class="lineNum"> 4726 </span> : * whole sequence been sorted. The elements either side of @p *nth are -<span class="lineNum"> 4727 </span> : * not completely sorted, but for any iterator @i in the range -<span class="lineNum"> 4728 </span> : * @p [first,nth) and any iterator @j in the range @p [nth,last) it -<span class="lineNum"> 4729 </span> : * holds that @p comp(*j,*i) is false. -<span class="lineNum"> 4730 </span> : */ -<span class="lineNum"> 4731 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 4732 </span> : inline void -<span class="lineNum"> 4733 </span> : nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 4734 </span> : _RandomAccessIterator __last, _Compare __comp) -<span class="lineNum"> 4735 </span> : { -<span class="lineNum"> 4736 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4737 </span> : _ValueType; -<span class="lineNum"> 4738 </span> : -<span class="lineNum"> 4739 </span> : // concept requirements -<span class="lineNum"> 4740 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4741 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4742 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 4743 </span> : _ValueType, _ValueType>) -<span class="lineNum"> 4744 </span> : __glibcxx_requires_valid_range(__first, __nth); -<span class="lineNum"> 4745 </span> : __glibcxx_requires_valid_range(__nth, __last); -<span class="lineNum"> 4746 </span> : -<span class="lineNum"> 4747 </span> : if (__first == __last || __nth == __last) -<span class="lineNum"> 4748 </span> : return; -<span class="lineNum"> 4749 </span> : -<span class="lineNum"> 4750 </span> : std::__introselect(__first, __nth, __last, -<span class="lineNum"> 4751 </span> : std::__lg(__last - __first) * 2, __comp); -<span class="lineNum"> 4752 </span> : } -<span class="lineNum"> 4753 </span> : -<span class="lineNum"> 4754 </span> : -<span class="lineNum"> 4755 </span> : /** -<span class="lineNum"> 4756 </span> : * @brief Sort the elements of a sequence. -<span class="lineNum"> 4757 </span> : * @param first An iterator. -<span class="lineNum"> 4758 </span> : * @param last Another iterator. -<span class="lineNum"> 4759 </span> : * @return Nothing. -<span class="lineNum"> 4760 </span> : * -<span class="lineNum"> 4761 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4762 </span> : * such that @p *(i+1)<*i is false for each iterator @p i in the range -<span class="lineNum"> 4763 </span> : * @p [first,last-1). -<span class="lineNum"> 4764 </span> : * -<span class="lineNum"> 4765 </span> : * The relative ordering of equivalent elements is not preserved, use -<span class="lineNum"> 4766 </span> : * @p stable_sort() if this is needed. -<span class="lineNum"> 4767 </span> : */ -<span class="lineNum"> 4768 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4769 </span> : inline void -<span class="lineNum"> 4770 </span><span class="lineCov"> 8 : sort(_RandomAccessIterator __first, _RandomAccessIterator __last)</span> -<span class="lineNum"> 4771 </span> : { -<span class="lineNum"> 4772 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4773 </span> : _ValueType; -<span class="lineNum"> 4774 </span> : -<span class="lineNum"> 4775 </span> : // concept requirements -<span class="lineNum"> 4776 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4777 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4778 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4779 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4780 </span> : -<span class="lineNum"> 4781 </span><span class="lineCov"> 8 : if (__first != __last)</span> -<span class="lineNum"> 4782 </span> : { -<span class="lineNum"> 4783 </span><span class="lineCov"> 8 : std::__introsort_loop(__first, __last,</span> -<span class="lineNum"> 4784 </span> : std::__lg(__last - __first) * 2); -<span class="lineNum"> 4785 </span><span class="lineCov"> 8 : std::__final_insertion_sort(__first, __last);</span> -<span class="lineNum"> 4786 </span> : } -<span class="lineNum"> 4787 </span><span class="lineCov"> 8 : }</span> -<span class="lineNum"> 4788 </span> : -<span class="lineNum"> 4789 </span> : /** -<span class="lineNum"> 4790 </span> : * @brief Sort the elements of a sequence using a predicate for comparison. -<span class="lineNum"> 4791 </span> : * @param first An iterator. -<span class="lineNum"> 4792 </span> : * @param last Another iterator. -<span class="lineNum"> 4793 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4794 </span> : * @return Nothing. -<span class="lineNum"> 4795 </span> : * -<span class="lineNum"> 4796 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4797 </span> : * such that @p comp(*(i+1),*i) is false for every iterator @p i in the -<span class="lineNum"> 4798 </span> : * range @p [first,last-1). -<span class="lineNum"> 4799 </span> : * -<span class="lineNum"> 4800 </span> : * The relative ordering of equivalent elements is not preserved, use -<span class="lineNum"> 4801 </span> : * @p stable_sort() if this is needed. -<span class="lineNum"> 4802 </span> : */ -<span class="lineNum"> 4803 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 4804 </span> : inline void -<span class="lineNum"> 4805 </span> : sort(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 4806 </span><span class="lineCov"> 3938 : _Compare __comp)</span> -<span class="lineNum"> 4807 </span> : { -<span class="lineNum"> 4808 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4809 </span> : _ValueType; -<span class="lineNum"> 4810 </span> : -<span class="lineNum"> 4811 </span> : // concept requirements -<span class="lineNum"> 4812 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4813 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4814 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, -<span class="lineNum"> 4815 </span> : _ValueType>) -<span class="lineNum"> 4816 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4817 </span> : -<span class="lineNum"> 4818 </span><span class="lineCov"> 3938 : if (__first != __last)</span> -<span class="lineNum"> 4819 </span> : { -<span class="lineNum"> 4820 </span><span class="lineCov"> 3938 : std::__introsort_loop(__first, __last,</span> -<span class="lineNum"> 4821 </span> : std::__lg(__last - __first) * 2, __comp); -<span class="lineNum"> 4822 </span><span class="lineCov"> 3938 : std::__final_insertion_sort(__first, __last, __comp);</span> -<span class="lineNum"> 4823 </span> : } -<span class="lineNum"> 4824 </span><span class="lineCov"> 3938 : }</span> -<span class="lineNum"> 4825 </span> : -<span class="lineNum"> 4826 </span> : /** -<span class="lineNum"> 4827 </span> : * @brief Merges two sorted ranges. -<span class="lineNum"> 4828 </span> : * @param first1 An iterator. -<span class="lineNum"> 4829 </span> : * @param first2 Another iterator. -<span class="lineNum"> 4830 </span> : * @param last1 Another iterator. -<span class="lineNum"> 4831 </span> : * @param last2 Another iterator. -<span class="lineNum"> 4832 </span> : * @param result An iterator pointing to the end of the merged range. -<span class="lineNum"> 4833 </span> : * @return An iterator pointing to the first element "not less -<span class="lineNum"> 4834 </span> : * than" @a val. -<span class="lineNum"> 4835 </span> : * -<span class="lineNum"> 4836 </span> : * Merges the ranges [first1,last1) and [first2,last2) into the sorted range -<span class="lineNum"> 4837 </span> : * [result, result + (last1-first1) + (last2-first2)). Both input ranges -<span class="lineNum"> 4838 </span> : * must be sorted, and the output range must not overlap with either of -<span class="lineNum"> 4839 </span> : * the input ranges. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 4840 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 4841 </span> : * come before elements from the second. -<span class="lineNum"> 4842 </span> : */ -<span class="lineNum"> 4843 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 4844 </span> : typename _OutputIterator> -<span class="lineNum"> 4845 </span> : _OutputIterator -<span class="lineNum"> 4846 </span> : merge(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 4847 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 4848 </span> : _OutputIterator __result) -<span class="lineNum"> 4849 </span> : { -<span class="lineNum"> 4850 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 4851 </span> : _ValueType1; -<span class="lineNum"> 4852 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 4853 </span> : _ValueType2; -<span class="lineNum"> 4854 </span> : -<span class="lineNum"> 4855 </span> : // concept requirements -<span class="lineNum"> 4856 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 4857 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 4858 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4859 </span> : _ValueType1>) -<span class="lineNum"> 4860 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4861 </span> : _ValueType2>) -<span class="lineNum"> 4862 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 4863 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 4864 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 4865 </span> : -<span class="lineNum"> 4866 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 4867 </span> : { -<span class="lineNum"> 4868 </span> : if (*__first2 < *__first1) -<span class="lineNum"> 4869 </span> : { -<span class="lineNum"> 4870 </span> : *__result = *__first2; -<span class="lineNum"> 4871 </span> : ++__first2; -<span class="lineNum"> 4872 </span> : } -<span class="lineNum"> 4873 </span> : else -<span class="lineNum"> 4874 </span> : { -<span class="lineNum"> 4875 </span> : *__result = *__first1; -<span class="lineNum"> 4876 </span> : ++__first1; -<span class="lineNum"> 4877 </span> : } -<span class="lineNum"> 4878 </span> : ++__result; -<span class="lineNum"> 4879 </span> : } -<span class="lineNum"> 4880 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 4881 </span> : __result)); -<span class="lineNum"> 4882 </span> : } -<span class="lineNum"> 4883 </span> : -<span class="lineNum"> 4884 </span> : /** -<span class="lineNum"> 4885 </span> : * @brief Merges two sorted ranges. -<span class="lineNum"> 4886 </span> : * @param first1 An iterator. -<span class="lineNum"> 4887 </span> : * @param first2 Another iterator. -<span class="lineNum"> 4888 </span> : * @param last1 Another iterator. -<span class="lineNum"> 4889 </span> : * @param last2 Another iterator. -<span class="lineNum"> 4890 </span> : * @param result An iterator pointing to the end of the merged range. -<span class="lineNum"> 4891 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 4892 </span> : * @return An iterator pointing to the first element "not less -<span class="lineNum"> 4893 </span> : * than" @a val. -<span class="lineNum"> 4894 </span> : * -<span class="lineNum"> 4895 </span> : * Merges the ranges [first1,last1) and [first2,last2) into the sorted range -<span class="lineNum"> 4896 </span> : * [result, result + (last1-first1) + (last2-first2)). Both input ranges -<span class="lineNum"> 4897 </span> : * must be sorted, and the output range must not overlap with either of -<span class="lineNum"> 4898 </span> : * the input ranges. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 4899 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 4900 </span> : * come before elements from the second. -<span class="lineNum"> 4901 </span> : * -<span class="lineNum"> 4902 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 4903 </span> : * the function used for the initial sort. -<span class="lineNum"> 4904 </span> : */ -<span class="lineNum"> 4905 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 4906 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 4907 </span> : _OutputIterator -<span class="lineNum"> 4908 </span> : merge(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 4909 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 4910 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 4911 </span> : { -<span class="lineNum"> 4912 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 4913 </span> : _ValueType1; -<span class="lineNum"> 4914 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 4915 </span> : _ValueType2; -<span class="lineNum"> 4916 </span> : -<span class="lineNum"> 4917 </span> : // concept requirements -<span class="lineNum"> 4918 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 4919 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 4920 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4921 </span> : _ValueType1>) -<span class="lineNum"> 4922 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4923 </span> : _ValueType2>) -<span class="lineNum"> 4924 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 4925 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 4926 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 4927 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 4928 </span> : -<span class="lineNum"> 4929 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 4930 </span> : { -<span class="lineNum"> 4931 </span> : if (__comp(*__first2, *__first1)) -<span class="lineNum"> 4932 </span> : { -<span class="lineNum"> 4933 </span> : *__result = *__first2; -<span class="lineNum"> 4934 </span> : ++__first2; -<span class="lineNum"> 4935 </span> : } -<span class="lineNum"> 4936 </span> : else -<span class="lineNum"> 4937 </span> : { -<span class="lineNum"> 4938 </span> : *__result = *__first1; -<span class="lineNum"> 4939 </span> : ++__first1; -<span class="lineNum"> 4940 </span> : } -<span class="lineNum"> 4941 </span> : ++__result; -<span class="lineNum"> 4942 </span> : } -<span class="lineNum"> 4943 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 4944 </span> : __result)); -<span class="lineNum"> 4945 </span> : } -<span class="lineNum"> 4946 </span> : -<span class="lineNum"> 4947 </span> : -<span class="lineNum"> 4948 </span> : /** -<span class="lineNum"> 4949 </span> : * @brief Sort the elements of a sequence, preserving the relative order -<span class="lineNum"> 4950 </span> : * of equivalent elements. -<span class="lineNum"> 4951 </span> : * @param first An iterator. -<span class="lineNum"> 4952 </span> : * @param last Another iterator. -<span class="lineNum"> 4953 </span> : * @return Nothing. -<span class="lineNum"> 4954 </span> : * -<span class="lineNum"> 4955 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4956 </span> : * such that @p *(i+1)<*i is false for each iterator @p i in the range -<span class="lineNum"> 4957 </span> : * @p [first,last-1). -<span class="lineNum"> 4958 </span> : * -<span class="lineNum"> 4959 </span> : * The relative ordering of equivalent elements is preserved, so any two -<span class="lineNum"> 4960 </span> : * elements @p x and @p y in the range @p [first,last) such that -<span class="lineNum"> 4961 </span> : * @p x<y is false and @p y<x is false will have the same relative -<span class="lineNum"> 4962 </span> : * ordering after calling @p stable_sort(). -<span class="lineNum"> 4963 </span> : */ -<span class="lineNum"> 4964 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4965 </span> : inline void -<span class="lineNum"> 4966 </span> : stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 4967 </span> : { -<span class="lineNum"> 4968 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4969 </span> : _ValueType; -<span class="lineNum"> 4970 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 4971 </span> : _DistanceType; -<span class="lineNum"> 4972 </span> : -<span class="lineNum"> 4973 </span> : // concept requirements -<span class="lineNum"> 4974 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4975 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4976 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4977 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4978 </span> : -<span class="lineNum"> 4979 </span> : _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, -<span class="lineNum"> 4980 </span> : __last); -<span class="lineNum"> 4981 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 4982 </span> : std::__inplace_stable_sort(__first, __last); -<span class="lineNum"> 4983 </span> : else -<span class="lineNum"> 4984 </span> : std::__stable_sort_adaptive(__first, __last, __buf.begin(), -<span class="lineNum"> 4985 </span> : _DistanceType(__buf.size())); -<span class="lineNum"> 4986 </span> : } -<span class="lineNum"> 4987 </span> : -<span class="lineNum"> 4988 </span> : /** -<span class="lineNum"> 4989 </span> : * @brief Sort the elements of a sequence using a predicate for comparison, -<span class="lineNum"> 4990 </span> : * preserving the relative order of equivalent elements. -<span class="lineNum"> 4991 </span> : * @param first An iterator. -<span class="lineNum"> 4992 </span> : * @param last Another iterator. -<span class="lineNum"> 4993 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4994 </span> : * @return Nothing. -<span class="lineNum"> 4995 </span> : * -<span class="lineNum"> 4996 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4997 </span> : * such that @p comp(*(i+1),*i) is false for each iterator @p i in the -<span class="lineNum"> 4998 </span> : * range @p [first,last-1). -<span class="lineNum"> 4999 </span> : * -<span class="lineNum"> 5000 </span> : * The relative ordering of equivalent elements is preserved, so any two -<span class="lineNum"> 5001 </span> : * elements @p x and @p y in the range @p [first,last) such that -<span class="lineNum"> 5002 </span> : * @p comp(x,y) is false and @p comp(y,x) is false will have the same -<span class="lineNum"> 5003 </span> : * relative ordering after calling @p stable_sort(). -<span class="lineNum"> 5004 </span> : */ -<span class="lineNum"> 5005 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 5006 </span> : inline void -<span class="lineNum"> 5007 </span> : stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 5008 </span> : _Compare __comp) -<span class="lineNum"> 5009 </span> : { -<span class="lineNum"> 5010 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 5011 </span> : _ValueType; -<span class="lineNum"> 5012 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 5013 </span> : _DistanceType; -<span class="lineNum"> 5014 </span> : -<span class="lineNum"> 5015 </span> : // concept requirements -<span class="lineNum"> 5016 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 5017 </span> : _RandomAccessIterator>) -<span class="lineNum"> 5018 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5019 </span> : _ValueType, -<span class="lineNum"> 5020 </span> : _ValueType>) -<span class="lineNum"> 5021 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5022 </span> : -<span class="lineNum"> 5023 </span> : _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, -<span class="lineNum"> 5024 </span> : __last); -<span class="lineNum"> 5025 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 5026 </span> : std::__inplace_stable_sort(__first, __last, __comp); -<span class="lineNum"> 5027 </span> : else -<span class="lineNum"> 5028 </span> : std::__stable_sort_adaptive(__first, __last, __buf.begin(), -<span class="lineNum"> 5029 </span> : _DistanceType(__buf.size()), __comp); -<span class="lineNum"> 5030 </span> : } -<span class="lineNum"> 5031 </span> : -<span class="lineNum"> 5032 </span> : -<span class="lineNum"> 5033 </span> : /** -<span class="lineNum"> 5034 </span> : * @brief Return the union of two sorted ranges. -<span class="lineNum"> 5035 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5036 </span> : * @param last1 End of first range. -<span class="lineNum"> 5037 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5038 </span> : * @param last2 End of second range. -<span class="lineNum"> 5039 </span> : * @return End of the output range. -<span class="lineNum"> 5040 </span> : * @ingroup setoperations -<span class="lineNum"> 5041 </span> : * -<span class="lineNum"> 5042 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5043 </span> : * each range in order to the output range. Iterators increment for each -<span class="lineNum"> 5044 </span> : * range. When the current element of one range is less than the other, -<span class="lineNum"> 5045 </span> : * that element is copied and the iterator advanced. If an element is -<span class="lineNum"> 5046 </span> : * contained in both ranges, the element from the first range is copied and -<span class="lineNum"> 5047 </span> : * both ranges advance. The output range may not overlap either input -<span class="lineNum"> 5048 </span> : * range. -<span class="lineNum"> 5049 </span> : */ -<span class="lineNum"> 5050 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5051 </span> : typename _OutputIterator> -<span class="lineNum"> 5052 </span> : _OutputIterator -<span class="lineNum"> 5053 </span> : set_union(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5054 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5055 </span><span class="lineCov"> 21150 : _OutputIterator __result)</span> -<span class="lineNum"> 5056 </span> : { -<span class="lineNum"> 5057 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5058 </span> : _ValueType1; -<span class="lineNum"> 5059 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5060 </span> : _ValueType2; -<span class="lineNum"> 5061 </span> : -<span class="lineNum"> 5062 </span> : // concept requirements -<span class="lineNum"> 5063 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5064 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5065 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5066 </span> : _ValueType1>) -<span class="lineNum"> 5067 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5068 </span> : _ValueType2>) -<span class="lineNum"> 5069 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5070 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5071 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5072 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5073 </span> : -<span class="lineNum"> 5074 </span><span class="lineCov"> 42309 : while (__first1 != __last1 && __first2 != __last2)</span> -<span class="lineNum"> 5075 </span> : { -<span class="lineNum"> 5076 </span><span class="lineCov"> 9 : if (*__first1 < *__first2)</span> -<span class="lineNum"> 5077 </span> : { -<span class="lineNum"> 5078 </span><span class="lineCov"> 7 : *__result = *__first1;</span> -<span class="lineNum"> 5079 </span><span class="lineCov"> 7 : ++__first1;</span> -<span class="lineNum"> 5080 </span> : } -<span class="lineNum"> 5081 </span><span class="lineCov"> 2 : else if (*__first2 < *__first1)</span> -<span class="lineNum"> 5082 </span> : { -<span class="lineNum"> 5083 </span><span class="lineCov"> 1 : *__result = *__first2;</span> -<span class="lineNum"> 5084 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5085 </span> : } -<span class="lineNum"> 5086 </span> : else -<span class="lineNum"> 5087 </span> : { -<span class="lineNum"> 5088 </span><span class="lineCov"> 1 : *__result = *__first1;</span> -<span class="lineNum"> 5089 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5090 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5091 </span> : } -<span class="lineNum"> 5092 </span><span class="lineCov"> 9 : ++__result;</span> -<span class="lineNum"> 5093 </span> : } -<span class="lineNum"> 5094 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 5095 </span><span class="lineCov"> 21150 : __result));</span> -<span class="lineNum"> 5096 </span> : } -<span class="lineNum"> 5097 </span> : -<span class="lineNum"> 5098 </span> : /** -<span class="lineNum"> 5099 </span> : * @brief Return the union of two sorted ranges using a comparison functor. -<span class="lineNum"> 5100 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5101 </span> : * @param last1 End of first range. -<span class="lineNum"> 5102 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5103 </span> : * @param last2 End of second range. -<span class="lineNum"> 5104 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5105 </span> : * @return End of the output range. -<span class="lineNum"> 5106 </span> : * @ingroup setoperations -<span class="lineNum"> 5107 </span> : * -<span class="lineNum"> 5108 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5109 </span> : * each range in order to the output range. Iterators increment for each -<span class="lineNum"> 5110 </span> : * range. When the current element of one range is less than the other -<span class="lineNum"> 5111 </span> : * according to @a comp, that element is copied and the iterator advanced. -<span class="lineNum"> 5112 </span> : * If an equivalent element according to @a comp is contained in both -<span class="lineNum"> 5113 </span> : * ranges, the element from the first range is copied and both ranges -<span class="lineNum"> 5114 </span> : * advance. The output range may not overlap either input range. -<span class="lineNum"> 5115 </span> : */ -<span class="lineNum"> 5116 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5117 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5118 </span> : _OutputIterator -<span class="lineNum"> 5119 </span> : set_union(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5120 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5121 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 5122 </span> : { -<span class="lineNum"> 5123 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5124 </span> : _ValueType1; -<span class="lineNum"> 5125 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5126 </span> : _ValueType2; -<span class="lineNum"> 5127 </span> : -<span class="lineNum"> 5128 </span> : // concept requirements -<span class="lineNum"> 5129 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5130 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5131 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5132 </span> : _ValueType1>) -<span class="lineNum"> 5133 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5134 </span> : _ValueType2>) -<span class="lineNum"> 5135 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5136 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5137 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5138 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5139 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5140 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5141 </span> : -<span class="lineNum"> 5142 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5143 </span> : { -<span class="lineNum"> 5144 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5145 </span> : { -<span class="lineNum"> 5146 </span> : *__result = *__first1; -<span class="lineNum"> 5147 </span> : ++__first1; -<span class="lineNum"> 5148 </span> : } -<span class="lineNum"> 5149 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5150 </span> : { -<span class="lineNum"> 5151 </span> : *__result = *__first2; -<span class="lineNum"> 5152 </span> : ++__first2; -<span class="lineNum"> 5153 </span> : } -<span class="lineNum"> 5154 </span> : else -<span class="lineNum"> 5155 </span> : { -<span class="lineNum"> 5156 </span> : *__result = *__first1; -<span class="lineNum"> 5157 </span> : ++__first1; -<span class="lineNum"> 5158 </span> : ++__first2; -<span class="lineNum"> 5159 </span> : } -<span class="lineNum"> 5160 </span> : ++__result; -<span class="lineNum"> 5161 </span> : } -<span class="lineNum"> 5162 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 5163 </span> : __result)); -<span class="lineNum"> 5164 </span> : } -<span class="lineNum"> 5165 </span> : -<span class="lineNum"> 5166 </span> : /** -<span class="lineNum"> 5167 </span> : * @brief Return the intersection of two sorted ranges. -<span class="lineNum"> 5168 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5169 </span> : * @param last1 End of first range. -<span class="lineNum"> 5170 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5171 </span> : * @param last2 End of second range. -<span class="lineNum"> 5172 </span> : * @return End of the output range. -<span class="lineNum"> 5173 </span> : * @ingroup setoperations -<span class="lineNum"> 5174 </span> : * -<span class="lineNum"> 5175 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5176 </span> : * both ranges in order to the output range. Iterators increment for each -<span class="lineNum"> 5177 </span> : * range. When the current element of one range is less than the other, -<span class="lineNum"> 5178 </span> : * that iterator advances. If an element is contained in both ranges, the -<span class="lineNum"> 5179 </span> : * element from the first range is copied and both ranges advance. The -<span class="lineNum"> 5180 </span> : * output range may not overlap either input range. -<span class="lineNum"> 5181 </span> : */ -<span class="lineNum"> 5182 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5183 </span> : typename _OutputIterator> -<span class="lineNum"> 5184 </span> : _OutputIterator -<span class="lineNum"> 5185 </span> : set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5186 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5187 </span><span class="lineCov"> 2 : _OutputIterator __result)</span> -<span class="lineNum"> 5188 </span> : { -<span class="lineNum"> 5189 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5190 </span> : _ValueType1; -<span class="lineNum"> 5191 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5192 </span> : _ValueType2; -<span class="lineNum"> 5193 </span> : -<span class="lineNum"> 5194 </span> : // concept requirements -<span class="lineNum"> 5195 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5196 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5197 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5198 </span> : _ValueType1>) -<span class="lineNum"> 5199 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5200 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5201 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5202 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5203 </span> : -<span class="lineNum"> 5204 </span><span class="lineCov"> 8 : while (__first1 != __last1 && __first2 != __last2)</span> -<span class="lineNum"> 5205 </span><span class="lineCov"> 4 : if (*__first1 < *__first2)</span> -<span class="lineNum"> 5206 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5207 </span><span class="lineCov"> 3 : else if (*__first2 < *__first1)</span> -<span class="lineNum"> 5208 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5209 </span> : else -<span class="lineNum"> 5210 </span> : { -<span class="lineNum"> 5211 </span><span class="lineCov"> 2 : *__result = *__first1;</span> -<span class="lineNum"> 5212 </span><span class="lineCov"> 2 : ++__first1;</span> -<span class="lineNum"> 5213 </span><span class="lineCov"> 2 : ++__first2;</span> -<span class="lineNum"> 5214 </span><span class="lineCov"> 2 : ++__result;</span> -<span class="lineNum"> 5215 </span> : } -<span class="lineNum"> 5216 </span><span class="lineCov"> 2 : return __result;</span> -<span class="lineNum"> 5217 </span> : } -<span class="lineNum"> 5218 </span> : -<span class="lineNum"> 5219 </span> : /** -<span class="lineNum"> 5220 </span> : * @brief Return the intersection of two sorted ranges using comparison -<span class="lineNum"> 5221 </span> : * functor. -<span class="lineNum"> 5222 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5223 </span> : * @param last1 End of first range. -<span class="lineNum"> 5224 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5225 </span> : * @param last2 End of second range. -<span class="lineNum"> 5226 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5227 </span> : * @return End of the output range. -<span class="lineNum"> 5228 </span> : * @ingroup setoperations -<span class="lineNum"> 5229 </span> : * -<span class="lineNum"> 5230 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5231 </span> : * both ranges in order to the output range. Iterators increment for each -<span class="lineNum"> 5232 </span> : * range. When the current element of one range is less than the other -<span class="lineNum"> 5233 </span> : * according to @a comp, that iterator advances. If an element is -<span class="lineNum"> 5234 </span> : * contained in both ranges according to @a comp, the element from the -<span class="lineNum"> 5235 </span> : * first range is copied and both ranges advance. The output range may not -<span class="lineNum"> 5236 </span> : * overlap either input range. -<span class="lineNum"> 5237 </span> : */ -<span class="lineNum"> 5238 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5239 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5240 </span> : _OutputIterator -<span class="lineNum"> 5241 </span> : set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5242 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5243 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 5244 </span> : { -<span class="lineNum"> 5245 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5246 </span> : _ValueType1; -<span class="lineNum"> 5247 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5248 </span> : _ValueType2; -<span class="lineNum"> 5249 </span> : -<span class="lineNum"> 5250 </span> : // concept requirements -<span class="lineNum"> 5251 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5252 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5253 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5254 </span> : _ValueType1>) -<span class="lineNum"> 5255 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5256 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5257 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5258 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5259 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5260 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5261 </span> : -<span class="lineNum"> 5262 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5263 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5264 </span> : ++__first1; -<span class="lineNum"> 5265 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5266 </span> : ++__first2; -<span class="lineNum"> 5267 </span> : else -<span class="lineNum"> 5268 </span> : { -<span class="lineNum"> 5269 </span> : *__result = *__first1; -<span class="lineNum"> 5270 </span> : ++__first1; -<span class="lineNum"> 5271 </span> : ++__first2; -<span class="lineNum"> 5272 </span> : ++__result; -<span class="lineNum"> 5273 </span> : } -<span class="lineNum"> 5274 </span> : return __result; -<span class="lineNum"> 5275 </span> : } -<span class="lineNum"> 5276 </span> : -<span class="lineNum"> 5277 </span> : /** -<span class="lineNum"> 5278 </span> : * @brief Return the difference of two sorted ranges. -<span class="lineNum"> 5279 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5280 </span> : * @param last1 End of first range. -<span class="lineNum"> 5281 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5282 </span> : * @param last2 End of second range. -<span class="lineNum"> 5283 </span> : * @return End of the output range. -<span class="lineNum"> 5284 </span> : * @ingroup setoperations -<span class="lineNum"> 5285 </span> : * -<span class="lineNum"> 5286 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5287 </span> : * the first range but not the second in order to the output range. -<span class="lineNum"> 5288 </span> : * Iterators increment for each range. When the current element of the -<span class="lineNum"> 5289 </span> : * first range is less than the second, that element is copied and the -<span class="lineNum"> 5290 </span> : * iterator advances. If the current element of the second range is less, -<span class="lineNum"> 5291 </span> : * the iterator advances, but no element is copied. If an element is -<span class="lineNum"> 5292 </span> : * contained in both ranges, no elements are copied and both ranges -<span class="lineNum"> 5293 </span> : * advance. The output range may not overlap either input range. -<span class="lineNum"> 5294 </span> : */ -<span class="lineNum"> 5295 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5296 </span> : typename _OutputIterator> -<span class="lineNum"> 5297 </span> : _OutputIterator -<span class="lineNum"> 5298 </span> : set_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5299 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5300 </span><span class="lineCov"> 10 : _OutputIterator __result)</span> -<span class="lineNum"> 5301 </span> : { -<span class="lineNum"> 5302 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5303 </span> : _ValueType1; -<span class="lineNum"> 5304 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5305 </span> : _ValueType2; -<span class="lineNum"> 5306 </span> : -<span class="lineNum"> 5307 </span> : // concept requirements -<span class="lineNum"> 5308 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5309 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5310 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5311 </span> : _ValueType1>) -<span class="lineNum"> 5312 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5313 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5314 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5315 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5316 </span> : -<span class="lineNum"> 5317 </span><span class="lineCov"> 22 : while (__first1 != __last1 && __first2 != __last2)</span> -<span class="lineNum"> 5318 </span><span class="lineCov"> 2 : if (*__first1 < *__first2)</span> -<span class="lineNum"> 5319 </span> : { -<span class="lineNum"> 5320 </span><span class="lineCov"> 1 : *__result = *__first1;</span> -<span class="lineNum"> 5321 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5322 </span><span class="lineCov"> 1 : ++__result;</span> -<span class="lineNum"> 5323 </span> : } -<span class="lineNum"> 5324 </span><span class="lineCov"> 1 : else if (*__first2 < *__first1)</span> -<span class="lineNum"> 5325 </span><span class="lineNoCov"> 0 : ++__first2;</span> -<span class="lineNum"> 5326 </span> : else -<span class="lineNum"> 5327 </span> : { -<span class="lineNum"> 5328 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5329 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5330 </span> : } -<span class="lineNum"> 5331 </span><span class="lineCov"> 10 : return std::copy(__first1, __last1, __result);</span> -<span class="lineNum"> 5332 </span> : } -<span class="lineNum"> 5333 </span> : -<span class="lineNum"> 5334 </span> : /** -<span class="lineNum"> 5335 </span> : * @brief Return the difference of two sorted ranges using comparison -<span class="lineNum"> 5336 </span> : * functor. -<span class="lineNum"> 5337 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5338 </span> : * @param last1 End of first range. -<span class="lineNum"> 5339 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5340 </span> : * @param last2 End of second range. -<span class="lineNum"> 5341 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5342 </span> : * @return End of the output range. -<span class="lineNum"> 5343 </span> : * @ingroup setoperations -<span class="lineNum"> 5344 </span> : * -<span class="lineNum"> 5345 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5346 </span> : * the first range but not the second in order to the output range. -<span class="lineNum"> 5347 </span> : * Iterators increment for each range. When the current element of the -<span class="lineNum"> 5348 </span> : * first range is less than the second according to @a comp, that element -<span class="lineNum"> 5349 </span> : * is copied and the iterator advances. If the current element of the -<span class="lineNum"> 5350 </span> : * second range is less, no element is copied and the iterator advances. -<span class="lineNum"> 5351 </span> : * If an element is contained in both ranges according to @a comp, no -<span class="lineNum"> 5352 </span> : * elements are copied and both ranges advance. The output range may not -<span class="lineNum"> 5353 </span> : * overlap either input range. -<span class="lineNum"> 5354 </span> : */ -<span class="lineNum"> 5355 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5356 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5357 </span> : _OutputIterator -<span class="lineNum"> 5358 </span> : set_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5359 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5360 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 5361 </span> : { -<span class="lineNum"> 5362 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5363 </span> : _ValueType1; -<span class="lineNum"> 5364 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5365 </span> : _ValueType2; -<span class="lineNum"> 5366 </span> : -<span class="lineNum"> 5367 </span> : // concept requirements -<span class="lineNum"> 5368 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5369 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5370 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5371 </span> : _ValueType1>) -<span class="lineNum"> 5372 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5373 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5374 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5375 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5376 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5377 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5378 </span> : -<span class="lineNum"> 5379 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5380 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5381 </span> : { -<span class="lineNum"> 5382 </span> : *__result = *__first1; -<span class="lineNum"> 5383 </span> : ++__first1; -<span class="lineNum"> 5384 </span> : ++__result; -<span class="lineNum"> 5385 </span> : } -<span class="lineNum"> 5386 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5387 </span> : ++__first2; -<span class="lineNum"> 5388 </span> : else -<span class="lineNum"> 5389 </span> : { -<span class="lineNum"> 5390 </span> : ++__first1; -<span class="lineNum"> 5391 </span> : ++__first2; -<span class="lineNum"> 5392 </span> : } -<span class="lineNum"> 5393 </span> : return std::copy(__first1, __last1, __result); -<span class="lineNum"> 5394 </span> : } -<span class="lineNum"> 5395 </span> : -<span class="lineNum"> 5396 </span> : /** -<span class="lineNum"> 5397 </span> : * @brief Return the symmetric difference of two sorted ranges. -<span class="lineNum"> 5398 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5399 </span> : * @param last1 End of first range. -<span class="lineNum"> 5400 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5401 </span> : * @param last2 End of second range. -<span class="lineNum"> 5402 </span> : * @return End of the output range. -<span class="lineNum"> 5403 </span> : * @ingroup setoperations -<span class="lineNum"> 5404 </span> : * -<span class="lineNum"> 5405 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5406 </span> : * one range but not the other in order to the output range. Iterators -<span class="lineNum"> 5407 </span> : * increment for each range. When the current element of one range is less -<span class="lineNum"> 5408 </span> : * than the other, that element is copied and the iterator advances. If an -<span class="lineNum"> 5409 </span> : * element is contained in both ranges, no elements are copied and both -<span class="lineNum"> 5410 </span> : * ranges advance. The output range may not overlap either input range. -<span class="lineNum"> 5411 </span> : */ -<span class="lineNum"> 5412 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5413 </span> : typename _OutputIterator> -<span class="lineNum"> 5414 </span> : _OutputIterator -<span class="lineNum"> 5415 </span> : set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5416 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5417 </span> : _OutputIterator __result) -<span class="lineNum"> 5418 </span> : { -<span class="lineNum"> 5419 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5420 </span> : _ValueType1; -<span class="lineNum"> 5421 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5422 </span> : _ValueType2; -<span class="lineNum"> 5423 </span> : -<span class="lineNum"> 5424 </span> : // concept requirements -<span class="lineNum"> 5425 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5426 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5427 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5428 </span> : _ValueType1>) -<span class="lineNum"> 5429 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5430 </span> : _ValueType2>) -<span class="lineNum"> 5431 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5432 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5433 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5434 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5435 </span> : -<span class="lineNum"> 5436 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5437 </span> : if (*__first1 < *__first2) -<span class="lineNum"> 5438 </span> : { -<span class="lineNum"> 5439 </span> : *__result = *__first1; -<span class="lineNum"> 5440 </span> : ++__first1; -<span class="lineNum"> 5441 </span> : ++__result; -<span class="lineNum"> 5442 </span> : } -<span class="lineNum"> 5443 </span> : else if (*__first2 < *__first1) -<span class="lineNum"> 5444 </span> : { -<span class="lineNum"> 5445 </span> : *__result = *__first2; -<span class="lineNum"> 5446 </span> : ++__first2; -<span class="lineNum"> 5447 </span> : ++__result; -<span class="lineNum"> 5448 </span> : } -<span class="lineNum"> 5449 </span> : else -<span class="lineNum"> 5450 </span> : { -<span class="lineNum"> 5451 </span> : ++__first1; -<span class="lineNum"> 5452 </span> : ++__first2; -<span class="lineNum"> 5453 </span> : } -<span class="lineNum"> 5454 </span> : return std::copy(__first2, __last2, std::copy(__first1, -<span class="lineNum"> 5455 </span> : __last1, __result)); -<span class="lineNum"> 5456 </span> : } -<span class="lineNum"> 5457 </span> : -<span class="lineNum"> 5458 </span> : /** -<span class="lineNum"> 5459 </span> : * @brief Return the symmetric difference of two sorted ranges using -<span class="lineNum"> 5460 </span> : * comparison functor. -<span class="lineNum"> 5461 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5462 </span> : * @param last1 End of first range. -<span class="lineNum"> 5463 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5464 </span> : * @param last2 End of second range. -<span class="lineNum"> 5465 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5466 </span> : * @return End of the output range. -<span class="lineNum"> 5467 </span> : * @ingroup setoperations -<span class="lineNum"> 5468 </span> : * -<span class="lineNum"> 5469 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5470 </span> : * one range but not the other in order to the output range. Iterators -<span class="lineNum"> 5471 </span> : * increment for each range. When the current element of one range is less -<span class="lineNum"> 5472 </span> : * than the other according to @a comp, that element is copied and the -<span class="lineNum"> 5473 </span> : * iterator advances. If an element is contained in both ranges according -<span class="lineNum"> 5474 </span> : * to @a comp, no elements are copied and both ranges advance. The output -<span class="lineNum"> 5475 </span> : * range may not overlap either input range. -<span class="lineNum"> 5476 </span> : */ -<span class="lineNum"> 5477 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5478 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5479 </span> : _OutputIterator -<span class="lineNum"> 5480 </span> : set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5481 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5482 </span> : _OutputIterator __result, -<span class="lineNum"> 5483 </span> : _Compare __comp) -<span class="lineNum"> 5484 </span> : { -<span class="lineNum"> 5485 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5486 </span> : _ValueType1; -<span class="lineNum"> 5487 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5488 </span> : _ValueType2; -<span class="lineNum"> 5489 </span> : -<span class="lineNum"> 5490 </span> : // concept requirements -<span class="lineNum"> 5491 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5492 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5493 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5494 </span> : _ValueType1>) -<span class="lineNum"> 5495 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5496 </span> : _ValueType2>) -<span class="lineNum"> 5497 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5498 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5499 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5500 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5501 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5502 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5503 </span> : -<span class="lineNum"> 5504 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5505 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5506 </span> : { -<span class="lineNum"> 5507 </span> : *__result = *__first1; -<span class="lineNum"> 5508 </span> : ++__first1; -<span class="lineNum"> 5509 </span> : ++__result; -<span class="lineNum"> 5510 </span> : } -<span class="lineNum"> 5511 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5512 </span> : { -<span class="lineNum"> 5513 </span> : *__result = *__first2; -<span class="lineNum"> 5514 </span> : ++__first2; -<span class="lineNum"> 5515 </span> : ++__result; -<span class="lineNum"> 5516 </span> : } -<span class="lineNum"> 5517 </span> : else -<span class="lineNum"> 5518 </span> : { -<span class="lineNum"> 5519 </span> : ++__first1; -<span class="lineNum"> 5520 </span> : ++__first2; -<span class="lineNum"> 5521 </span> : } -<span class="lineNum"> 5522 </span> : return std::copy(__first2, __last2, -<span class="lineNum"> 5523 </span> : std::copy(__first1, __last1, __result)); -<span class="lineNum"> 5524 </span> : } -<span class="lineNum"> 5525 </span> : -<span class="lineNum"> 5526 </span> : -<span class="lineNum"> 5527 </span> : /** -<span class="lineNum"> 5528 </span> : * @brief Return the minimum element in a range. -<span class="lineNum"> 5529 </span> : * @param first Start of range. -<span class="lineNum"> 5530 </span> : * @param last End of range. -<span class="lineNum"> 5531 </span> : * @return Iterator referencing the first instance of the smallest value. -<span class="lineNum"> 5532 </span> : */ -<span class="lineNum"> 5533 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 5534 </span> : _ForwardIterator -<span class="lineNum"> 5535 </span> : min_element(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 5536 </span> : { -<span class="lineNum"> 5537 </span> : // concept requirements -<span class="lineNum"> 5538 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5539 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 5540 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5541 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5542 </span> : -<span class="lineNum"> 5543 </span> : if (__first == __last) -<span class="lineNum"> 5544 </span> : return __first; -<span class="lineNum"> 5545 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5546 </span> : while (++__first != __last) -<span class="lineNum"> 5547 </span> : if (*__first < *__result) -<span class="lineNum"> 5548 </span> : __result = __first; -<span class="lineNum"> 5549 </span> : return __result; -<span class="lineNum"> 5550 </span> : } -<span class="lineNum"> 5551 </span> : -<span class="lineNum"> 5552 </span> : /** -<span class="lineNum"> 5553 </span> : * @brief Return the minimum element in a range using comparison functor. -<span class="lineNum"> 5554 </span> : * @param first Start of range. -<span class="lineNum"> 5555 </span> : * @param last End of range. -<span class="lineNum"> 5556 </span> : * @param comp Comparison functor. -<span class="lineNum"> 5557 </span> : * @return Iterator referencing the first instance of the smallest value -<span class="lineNum"> 5558 </span> : * according to comp. -<span class="lineNum"> 5559 </span> : */ -<span class="lineNum"> 5560 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 5561 </span> : _ForwardIterator -<span class="lineNum"> 5562 </span> : min_element(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 5563 </span> : _Compare __comp) -<span class="lineNum"> 5564 </span> : { -<span class="lineNum"> 5565 </span> : // concept requirements -<span class="lineNum"> 5566 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5567 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5568 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 5569 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5570 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5571 </span> : -<span class="lineNum"> 5572 </span> : if (__first == __last) -<span class="lineNum"> 5573 </span> : return __first; -<span class="lineNum"> 5574 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5575 </span> : while (++__first != __last) -<span class="lineNum"> 5576 </span> : if (__comp(*__first, *__result)) -<span class="lineNum"> 5577 </span> : __result = __first; -<span class="lineNum"> 5578 </span> : return __result; -<span class="lineNum"> 5579 </span> : } -<span class="lineNum"> 5580 </span> : -<span class="lineNum"> 5581 </span> : /** -<span class="lineNum"> 5582 </span> : * @brief Return the maximum element in a range. -<span class="lineNum"> 5583 </span> : * @param first Start of range. -<span class="lineNum"> 5584 </span> : * @param last End of range. -<span class="lineNum"> 5585 </span> : * @return Iterator referencing the first instance of the largest value. -<span class="lineNum"> 5586 </span> : */ -<span class="lineNum"> 5587 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 5588 </span> : _ForwardIterator -<span class="lineNum"> 5589 </span> : max_element(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 5590 </span> : { -<span class="lineNum"> 5591 </span> : // concept requirements -<span class="lineNum"> 5592 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5593 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 5594 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5595 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5596 </span> : -<span class="lineNum"> 5597 </span> : if (__first == __last) -<span class="lineNum"> 5598 </span> : return __first; -<span class="lineNum"> 5599 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5600 </span> : while (++__first != __last) -<span class="lineNum"> 5601 </span> : if (*__result < *__first) -<span class="lineNum"> 5602 </span> : __result = __first; -<span class="lineNum"> 5603 </span> : return __result; -<span class="lineNum"> 5604 </span> : } -<span class="lineNum"> 5605 </span> : -<span class="lineNum"> 5606 </span> : /** -<span class="lineNum"> 5607 </span> : * @brief Return the maximum element in a range using comparison functor. -<span class="lineNum"> 5608 </span> : * @param first Start of range. -<span class="lineNum"> 5609 </span> : * @param last End of range. -<span class="lineNum"> 5610 </span> : * @param comp Comparison functor. -<span class="lineNum"> 5611 </span> : * @return Iterator referencing the first instance of the largest value -<span class="lineNum"> 5612 </span> : * according to comp. -<span class="lineNum"> 5613 </span> : */ -<span class="lineNum"> 5614 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 5615 </span> : _ForwardIterator -<span class="lineNum"> 5616 </span> : max_element(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 5617 </span> : _Compare __comp) -<span class="lineNum"> 5618 </span> : { -<span class="lineNum"> 5619 </span> : // concept requirements -<span class="lineNum"> 5620 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5621 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5622 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 5623 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5624 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5625 </span> : -<span class="lineNum"> 5626 </span> : if (__first == __last) return __first; -<span class="lineNum"> 5627 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5628 </span> : while (++__first != __last) -<span class="lineNum"> 5629 </span> : if (__comp(*__result, *__first)) -<span class="lineNum"> 5630 </span> : __result = __first; -<span class="lineNum"> 5631 </span> : return __result; -<span class="lineNum"> 5632 </span> : } -<span class="lineNum"> 5633 </span> : -<span class="lineNum"> 5634 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 5635 </span> : -<span class="lineNum"> 5636 </span> : #endif /* _STL_ALGO_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_algobase.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_algobase.h.gcov.html deleted file mode 100644 index 3535447..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_algobase.h.gcov.html +++ /dev/null @@ -1,1207 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_algobase.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_algobase.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">79</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">91.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">72</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Core algorithmic facilities -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1998 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_algobase.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_ALGOBASE_H -<span class="lineNum"> 63 </span> : #define _STL_ALGOBASE_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/c++config.h> -<span class="lineNum"> 66 </span> : #include <cstddef> -<span class="lineNum"> 67 </span> : #include <bits/functexcept.h> -<span class="lineNum"> 68 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 69 </span> : #include <ext/type_traits.h> -<span class="lineNum"> 70 </span> : #include <ext/numeric_traits.h> -<span class="lineNum"> 71 </span> : #include <bits/stl_pair.h> -<span class="lineNum"> 72 </span> : #include <bits/stl_iterator_base_types.h> -<span class="lineNum"> 73 </span> : #include <bits/stl_iterator_base_funcs.h> -<span class="lineNum"> 74 </span> : #include <bits/stl_iterator.h> -<span class="lineNum"> 75 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 76 </span> : #include <debug/debug.h> -<span class="lineNum"> 77 </span> : #include <bits/stl_move.h> // For std::swap and _GLIBCXX_MOVE -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a -<span class="lineNum"> 82 </span> : // nutshell, we are partially implementing the resolution of DR 187, -<span class="lineNum"> 83 </span> : // when it's safe, i.e., the value_types are equal. -<span class="lineNum"> 84 </span> : template<bool _BoolType> -<span class="lineNum"> 85 </span> : struct __iter_swap -<span class="lineNum"> 86 </span> : { -<span class="lineNum"> 87 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 88 </span> : static void -<span class="lineNum"> 89 </span> : iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) -<span class="lineNum"> 90 </span> : { -<span class="lineNum"> 91 </span> : typedef typename iterator_traits<_ForwardIterator1>::value_type -<span class="lineNum"> 92 </span> : _ValueType1; -<span class="lineNum"> 93 </span> : _ValueType1 __tmp = _GLIBCXX_MOVE(*__a); -<span class="lineNum"> 94 </span> : *__a = _GLIBCXX_MOVE(*__b); -<span class="lineNum"> 95 </span> : *__b = _GLIBCXX_MOVE(__tmp); -<span class="lineNum"> 96 </span> : } -<span class="lineNum"> 97 </span> : }; -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : template<> -<span class="lineNum"> 100 </span> : struct __iter_swap<true> -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 103 </span> : static void -<span class="lineNum"> 104 </span><span class="lineCov"> 7080 : iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</span> -<span class="lineNum"> 105 </span> : { -<span class="lineNum"> 106 </span><span class="lineCov"> 7080 : swap(*__a, *__b);</span> -<span class="lineNum"> 107 </span><span class="lineCov"> 7080 : }</span> -<span class="lineNum"> 108 </span> : }; -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : /** -<span class="lineNum"> 111 </span> : * @brief Swaps the contents of two iterators. -<span class="lineNum"> 112 </span> : * @param a An iterator. -<span class="lineNum"> 113 </span> : * @param b Another iterator. -<span class="lineNum"> 114 </span> : * @return Nothing. -<span class="lineNum"> 115 </span> : * -<span class="lineNum"> 116 </span> : * This function swaps the values pointed to by two iterators, not the -<span class="lineNum"> 117 </span> : * iterators themselves. -<span class="lineNum"> 118 </span> : */ -<span class="lineNum"> 119 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 120 </span> : inline void -<span class="lineNum"> 121 </span><span class="lineCov"> 7080 : iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</span> -<span class="lineNum"> 122 </span> : { -<span class="lineNum"> 123 </span> : typedef typename iterator_traits<_ForwardIterator1>::value_type -<span class="lineNum"> 124 </span> : _ValueType1; -<span class="lineNum"> 125 </span> : typedef typename iterator_traits<_ForwardIterator2>::value_type -<span class="lineNum"> 126 </span> : _ValueType2; -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : // concept requirements -<span class="lineNum"> 129 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 130 </span> : _ForwardIterator1>) -<span class="lineNum"> 131 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 132 </span> : _ForwardIterator2>) -<span class="lineNum"> 133 </span> : __glibcxx_function_requires(_ConvertibleConcept<_ValueType1, -<span class="lineNum"> 134 </span> : _ValueType2>) -<span class="lineNum"> 135 </span> : __glibcxx_function_requires(_ConvertibleConcept<_ValueType2, -<span class="lineNum"> 136 </span> : _ValueType1>) -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : typedef typename iterator_traits<_ForwardIterator1>::reference -<span class="lineNum"> 139 </span> : _ReferenceType1; -<span class="lineNum"> 140 </span> : typedef typename iterator_traits<_ForwardIterator2>::reference -<span class="lineNum"> 141 </span> : _ReferenceType2; -<span class="lineNum"> 142 </span><span class="lineCov"> 7080 : std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value</span> -<span class="lineNum"> 143 </span> : && __are_same<_ValueType1&, _ReferenceType1>::__value -<span class="lineNum"> 144 </span> : && __are_same<_ValueType2&, _ReferenceType2>::__value>:: -<span class="lineNum"> 145 </span> : iter_swap(__a, __b); -<span class="lineNum"> 146 </span><span class="lineCov"> 7080 : }</span> -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : /** -<span class="lineNum"> 149 </span> : * @brief Swap the elements of two sequences. -<span class="lineNum"> 150 </span> : * @param first1 A forward iterator. -<span class="lineNum"> 151 </span> : * @param last1 A forward iterator. -<span class="lineNum"> 152 </span> : * @param first2 A forward iterator. -<span class="lineNum"> 153 </span> : * @return An iterator equal to @p first2+(last1-first1). -<span class="lineNum"> 154 </span> : * -<span class="lineNum"> 155 </span> : * Swaps each element in the range @p [first1,last1) with the -<span class="lineNum"> 156 </span> : * corresponding element in the range @p [first2,(last1-first1)). -<span class="lineNum"> 157 </span> : * The ranges must not overlap. -<span class="lineNum"> 158 </span> : */ -<span class="lineNum"> 159 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 160 </span> : _ForwardIterator2 -<span class="lineNum"> 161 </span> : swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 162 </span> : _ForwardIterator2 __first2) -<span class="lineNum"> 163 </span> : { -<span class="lineNum"> 164 </span> : // concept requirements -<span class="lineNum"> 165 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 166 </span> : _ForwardIterator1>) -<span class="lineNum"> 167 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 168 </span> : _ForwardIterator2>) -<span class="lineNum"> 169 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : for (; __first1 != __last1; ++__first1, ++__first2) -<span class="lineNum"> 172 </span> : std::iter_swap(__first1, __first2); -<span class="lineNum"> 173 </span> : return __first2; -<span class="lineNum"> 174 </span> : } -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : /** -<span class="lineNum"> 177 </span> : * @brief This does what you think it does. -<span class="lineNum"> 178 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 179 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 180 </span> : * @return The lesser of the parameters. -<span class="lineNum"> 181 </span> : * -<span class="lineNum"> 182 </span> : * This is the simple classic generic implementation. It will work on -<span class="lineNum"> 183 </span> : * temporary expressions, since they are only evaluated once, unlike a -<span class="lineNum"> 184 </span> : * preprocessor macro. -<span class="lineNum"> 185 </span> : */ -<span class="lineNum"> 186 </span> : template<typename _Tp> -<span class="lineNum"> 187 </span> : inline const _Tp& -<span class="lineNum"> 188 </span><span class="lineNoCov"> 0 : min(const _Tp& __a, const _Tp& __b)</span> -<span class="lineNum"> 189 </span> : { -<span class="lineNum"> 190 </span> : // concept requirements -<span class="lineNum"> 191 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) -<span class="lineNum"> 192 </span> : //return __b < __a ? __b : __a; -<span class="lineNum"> 193 </span><span class="lineNoCov"> 0 : if (__b < __a)</span> -<span class="lineNum"> 194 </span><span class="lineNoCov"> 0 : return __b;</span> -<span class="lineNum"> 195 </span><span class="lineNoCov"> 0 : return __a;</span> -<span class="lineNum"> 196 </span> : } -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : /** -<span class="lineNum"> 199 </span> : * @brief This does what you think it does. -<span class="lineNum"> 200 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 201 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 202 </span> : * @return The greater of the parameters. -<span class="lineNum"> 203 </span> : * -<span class="lineNum"> 204 </span> : * This is the simple classic generic implementation. It will work on -<span class="lineNum"> 205 </span> : * temporary expressions, since they are only evaluated once, unlike a -<span class="lineNum"> 206 </span> : * preprocessor macro. -<span class="lineNum"> 207 </span> : */ -<span class="lineNum"> 208 </span> : template<typename _Tp> -<span class="lineNum"> 209 </span> : inline const _Tp& -<span class="lineNum"> 210 </span><span class="lineCov"> 20743 : max(const _Tp& __a, const _Tp& __b)</span> -<span class="lineNum"> 211 </span> : { -<span class="lineNum"> 212 </span> : // concept requirements -<span class="lineNum"> 213 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) -<span class="lineNum"> 214 </span> : //return __a < __b ? __b : __a; -<span class="lineNum"> 215 </span><span class="lineCov"> 20743 : if (__a < __b)</span> -<span class="lineNum"> 216 </span><span class="lineCov"> 4790 : return __b;</span> -<span class="lineNum"> 217 </span><span class="lineCov"> 15953 : return __a;</span> -<span class="lineNum"> 218 </span> : } -<span class="lineNum"> 219 </span> : -<span class="lineNum"> 220 </span> : /** -<span class="lineNum"> 221 </span> : * @brief This does what you think it does. -<span class="lineNum"> 222 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 223 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 224 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink. -<span class="lineNum"> 225 </span> : * @return The lesser of the parameters. -<span class="lineNum"> 226 </span> : * -<span class="lineNum"> 227 </span> : * This will work on temporary expressions, since they are only evaluated -<span class="lineNum"> 228 </span> : * once, unlike a preprocessor macro. -<span class="lineNum"> 229 </span> : */ -<span class="lineNum"> 230 </span> : template<typename _Tp, typename _Compare> -<span class="lineNum"> 231 </span> : inline const _Tp& -<span class="lineNum"> 232 </span> : min(const _Tp& __a, const _Tp& __b, _Compare __comp) -<span class="lineNum"> 233 </span> : { -<span class="lineNum"> 234 </span> : //return __comp(__b, __a) ? __b : __a; -<span class="lineNum"> 235 </span> : if (__comp(__b, __a)) -<span class="lineNum"> 236 </span> : return __b; -<span class="lineNum"> 237 </span> : return __a; -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : /** -<span class="lineNum"> 241 </span> : * @brief This does what you think it does. -<span class="lineNum"> 242 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 243 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 244 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink. -<span class="lineNum"> 245 </span> : * @return The greater of the parameters. -<span class="lineNum"> 246 </span> : * -<span class="lineNum"> 247 </span> : * This will work on temporary expressions, since they are only evaluated -<span class="lineNum"> 248 </span> : * once, unlike a preprocessor macro. -<span class="lineNum"> 249 </span> : */ -<span class="lineNum"> 250 </span> : template<typename _Tp, typename _Compare> -<span class="lineNum"> 251 </span> : inline const _Tp& -<span class="lineNum"> 252 </span> : max(const _Tp& __a, const _Tp& __b, _Compare __comp) -<span class="lineNum"> 253 </span> : { -<span class="lineNum"> 254 </span> : //return __comp(__a, __b) ? __b : __a; -<span class="lineNum"> 255 </span> : if (__comp(__a, __b)) -<span class="lineNum"> 256 </span> : return __b; -<span class="lineNum"> 257 </span> : return __a; -<span class="lineNum"> 258 </span> : } -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : -<span class="lineNum"> 261 </span> : // If _Iterator is a __normal_iterator return its base (a plain pointer, -<span class="lineNum"> 262 </span> : // normally) otherwise return it untouched. See copy, fill, ... -<span class="lineNum"> 263 </span> : template<typename _Iterator, -<span class="lineNum"> 264 </span> : bool _IsNormal = __is_normal_iterator<_Iterator>::__value> -<span class="lineNum"> 265 </span> : struct __niter_base -<span class="lineNum"> 266 </span> : { -<span class="lineNum"> 267 </span> : static _Iterator -<span class="lineNum"> 268 </span><span class="lineCov"> 256058 : __b(_Iterator __it)</span> -<span class="lineNum"> 269 </span><span class="lineCov"> 256058 : { return __it; }</span> -<span class="lineNum"> 270 </span> : }; -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : template<typename _Iterator> -<span class="lineNum"> 273 </span> : struct __niter_base<_Iterator, true> -<span class="lineNum"> 274 </span> : { -<span class="lineNum"> 275 </span> : static typename _Iterator::iterator_type -<span class="lineNum"> 276 </span><span class="lineCov"> 23362 : __b(_Iterator __it)</span> -<span class="lineNum"> 277 </span><span class="lineCov"> 23362 : { return __it.base(); }</span> -<span class="lineNum"> 278 </span> : }; -<span class="lineNum"> 279 </span> : -<span class="lineNum"> 280 </span> : // Likewise, for move_iterator. -<span class="lineNum"> 281 </span> : template<typename _Iterator, -<span class="lineNum"> 282 </span> : bool _IsMove = __is_move_iterator<_Iterator>::__value> -<span class="lineNum"> 283 </span> : struct __miter_base -<span class="lineNum"> 284 </span> : { -<span class="lineNum"> 285 </span> : static _Iterator -<span class="lineNum"> 286 </span><span class="lineCov"> 156418 : __b(_Iterator __it)</span> -<span class="lineNum"> 287 </span><span class="lineCov"> 156418 : { return __it; }</span> -<span class="lineNum"> 288 </span> : }; -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : template<typename _Iterator> -<span class="lineNum"> 291 </span> : struct __miter_base<_Iterator, true> -<span class="lineNum"> 292 </span> : { -<span class="lineNum"> 293 </span> : static typename _Iterator::iterator_type -<span class="lineNum"> 294 </span> : __b(_Iterator __it) -<span class="lineNum"> 295 </span> : { return __it.base(); } -<span class="lineNum"> 296 </span> : }; -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : // All of these auxiliary structs serve two purposes. (1) Replace -<span class="lineNum"> 299 </span> : // calls to copy with memmove whenever possible. (Memmove, not memcpy, -<span class="lineNum"> 300 </span> : // because the input and output ranges are permitted to overlap.) -<span class="lineNum"> 301 </span> : // (2) If we're using random access iterators, then write the loop as -<span class="lineNum"> 302 </span> : // a for loop with an explicit count. -<span class="lineNum"> 303 </span> : -<span class="lineNum"> 304 </span> : template<bool, bool, typename> -<span class="lineNum"> 305 </span> : struct __copy_move -<span class="lineNum"> 306 </span> : { -<span class="lineNum"> 307 </span> : template<typename _II, typename _OI> -<span class="lineNum"> 308 </span> : static _OI -<span class="lineNum"> 309 </span><span class="lineCov"> 42335 : __copy_m(_II __first, _II __last, _OI __result)</span> -<span class="lineNum"> 310 </span> : { -<span class="lineNum"> 311 </span><span class="lineCov"> 159330 : for (; __first != __last; ++__result, ++__first)</span> -<span class="lineNum"> 312 </span><span class="lineCov"> 112959 : *__result = *__first;</span> -<span class="lineNum"> 313 </span><span class="lineCov"> 42335 : return __result;</span> -<span class="lineNum"> 314 </span> : } -<span class="lineNum"> 315 </span> : }; -<span class="lineNum"> 316 </span> : -<span class="lineNum"> 317 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 318 </span> : template<typename _Category> -<span class="lineNum"> 319 </span> : struct __copy_move<true, false, _Category> -<span class="lineNum"> 320 </span> : { -<span class="lineNum"> 321 </span> : template<typename _II, typename _OI> -<span class="lineNum"> 322 </span> : static _OI -<span class="lineNum"> 323 </span> : __copy_m(_II __first, _II __last, _OI __result) -<span class="lineNum"> 324 </span> : { -<span class="lineNum"> 325 </span> : for (; __first != __last; ++__result, ++__first) -<span class="lineNum"> 326 </span> : *__result = std::move(*__first); -<span class="lineNum"> 327 </span> : return __result; -<span class="lineNum"> 328 </span> : } -<span class="lineNum"> 329 </span> : }; -<span class="lineNum"> 330 </span> : #endif -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : template<> -<span class="lineNum"> 333 </span> : struct __copy_move<false, false, random_access_iterator_tag> -<span class="lineNum"> 334 </span> : { -<span class="lineNum"> 335 </span> : template<typename _II, typename _OI> -<span class="lineNum"> 336 </span> : static _OI -<span class="lineNum"> 337 </span><span class="lineCov"> 945 : __copy_m(_II __first, _II __last, _OI __result)</span> -<span class="lineNum"> 338 </span> : { -<span class="lineNum"> 339 </span> : typedef typename iterator_traits<_II>::difference_type _Distance; -<span class="lineNum"> 340 </span><span class="lineCov"> 12957 : for(_Distance __n = __last - __first; __n > 0; --__n)</span> -<span class="lineNum"> 341 </span> : { -<span class="lineNum"> 342 </span><span class="lineCov"> 12012 : *__result = *__first;</span> -<span class="lineNum"> 343 </span><span class="lineCov"> 12012 : ++__first;</span> -<span class="lineNum"> 344 </span><span class="lineCov"> 12012 : ++__result;</span> -<span class="lineNum"> 345 </span> : } -<span class="lineNum"> 346 </span><span class="lineCov"> 945 : return __result;</span> -<span class="lineNum"> 347 </span> : } -<span class="lineNum"> 348 </span> : }; -<span class="lineNum"> 349 </span> : -<span class="lineNum"> 350 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 351 </span> : template<> -<span class="lineNum"> 352 </span> : struct __copy_move<true, false, random_access_iterator_tag> -<span class="lineNum"> 353 </span> : { -<span class="lineNum"> 354 </span> : template<typename _II, typename _OI> -<span class="lineNum"> 355 </span> : static _OI -<span class="lineNum"> 356 </span> : __copy_m(_II __first, _II __last, _OI __result) -<span class="lineNum"> 357 </span> : { -<span class="lineNum"> 358 </span> : typedef typename iterator_traits<_II>::difference_type _Distance; -<span class="lineNum"> 359 </span> : for(_Distance __n = __last - __first; __n > 0; --__n) -<span class="lineNum"> 360 </span> : { -<span class="lineNum"> 361 </span> : *__result = std::move(*__first); -<span class="lineNum"> 362 </span> : ++__first; -<span class="lineNum"> 363 </span> : ++__result; -<span class="lineNum"> 364 </span> : } -<span class="lineNum"> 365 </span> : return __result; -<span class="lineNum"> 366 </span> : } -<span class="lineNum"> 367 </span> : }; -<span class="lineNum"> 368 </span> : #endif -<span class="lineNum"> 369 </span> : -<span class="lineNum"> 370 </span> : template<bool _IsMove> -<span class="lineNum"> 371 </span> : struct __copy_move<_IsMove, true, random_access_iterator_tag> -<span class="lineNum"> 372 </span> : { -<span class="lineNum"> 373 </span> : template<typename _Tp> -<span class="lineNum"> 374 </span> : static _Tp* -<span class="lineNum"> 375 </span><span class="lineCov"> 27153 : __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result)</span> -<span class="lineNum"> 376 </span> : { -<span class="lineNum"> 377 </span><span class="lineCov"> 27153 : __builtin_memmove(__result, __first,</span> -<span class="lineNum"> 378 </span> : sizeof(_Tp) * (__last - __first)); -<span class="lineNum"> 379 </span><span class="lineCov"> 27153 : return __result + (__last - __first);</span> -<span class="lineNum"> 380 </span> : } -<span class="lineNum"> 381 </span> : }; -<span class="lineNum"> 382 </span> : -<span class="lineNum"> 383 </span> : template<bool _IsMove, typename _II, typename _OI> -<span class="lineNum"> 384 </span> : inline _OI -<span class="lineNum"> 385 </span><span class="lineCov"> 70433 : __copy_move_a(_II __first, _II __last, _OI __result)</span> -<span class="lineNum"> 386 </span> : { -<span class="lineNum"> 387 </span> : typedef typename iterator_traits<_II>::value_type _ValueTypeI; -<span class="lineNum"> 388 </span> : typedef typename iterator_traits<_OI>::value_type _ValueTypeO; -<span class="lineNum"> 389 </span> : typedef typename iterator_traits<_II>::iterator_category _Category; -<span class="lineNum"> 390 </span> : const bool __simple = (__is_pod(_ValueTypeI) -<span class="lineNum"> 391 </span> : && __is_pointer<_II>::__value -<span class="lineNum"> 392 </span> : && __is_pointer<_OI>::__value -<span class="lineNum"> 393 </span><span class="lineCov"> 70433 : && __are_same<_ValueTypeI, _ValueTypeO>::__value);</span> -<span class="lineNum"> 394 </span> : -<span class="lineNum"> 395 </span> : return std::__copy_move<_IsMove, __simple, -<span class="lineNum"> 396 </span><span class="lineCov"> 70433 : _Category>::__copy_m(__first, __last, __result);</span> -<span class="lineNum"> 397 </span> : } -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : // Helpers for streambuf iterators (either istream or ostream). -<span class="lineNum"> 400 </span> : // NB: avoid including <iosfwd>, relatively large. -<span class="lineNum"> 401 </span> : template<typename _CharT> -<span class="lineNum"> 402 </span> : struct char_traits; -<span class="lineNum"> 403 </span> : -<span class="lineNum"> 404 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 405 </span> : class istreambuf_iterator; -<span class="lineNum"> 406 </span> : -<span class="lineNum"> 407 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 408 </span> : class ostreambuf_iterator; -<span class="lineNum"> 409 </span> : -<span class="lineNum"> 410 </span> : template<bool _IsMove, typename _CharT> -<span class="lineNum"> 411 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, -<span class="lineNum"> 412 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type -<span class="lineNum"> 413 </span> : __copy_move_a2(_CharT*, _CharT*, -<span class="lineNum"> 414 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> >); -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : template<bool _IsMove, typename _CharT> -<span class="lineNum"> 417 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, -<span class="lineNum"> 418 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type -<span class="lineNum"> 419 </span> : __copy_move_a2(const _CharT*, const _CharT*, -<span class="lineNum"> 420 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> >); -<span class="lineNum"> 421 </span> : -<span class="lineNum"> 422 </span> : template<bool _IsMove, typename _CharT> -<span class="lineNum"> 423 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, -<span class="lineNum"> 424 </span> : _CharT*>::__type -<span class="lineNum"> 425 </span> : __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >, -<span class="lineNum"> 426 </span> : istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*); -<span class="lineNum"> 427 </span> : -<span class="lineNum"> 428 </span> : template<bool _IsMove, typename _II, typename _OI> -<span class="lineNum"> 429 </span> : inline _OI -<span class="lineNum"> 430 </span><span class="lineCov"> 70433 : __copy_move_a2(_II __first, _II __last, _OI __result)</span> -<span class="lineNum"> 431 </span> : { -<span class="lineNum"> 432 </span> : return _OI(std::__copy_move_a<_IsMove> -<span class="lineNum"> 433 </span> : (std::__niter_base<_II>::__b(__first), -<span class="lineNum"> 434 </span> : std::__niter_base<_II>::__b(__last), -<span class="lineNum"> 435 </span><span class="lineCov"> 70433 : std::__niter_base<_OI>::__b(__result)));</span> -<span class="lineNum"> 436 </span> : } -<span class="lineNum"> 437 </span> : -<span class="lineNum"> 438 </span> : /** -<span class="lineNum"> 439 </span> : * @brief Copies the range [first,last) into result. -<span class="lineNum"> 440 </span> : * @param first An input iterator. -<span class="lineNum"> 441 </span> : * @param last An input iterator. -<span class="lineNum"> 442 </span> : * @param result An output iterator. -<span class="lineNum"> 443 </span> : * @return result + (first - last) -<span class="lineNum"> 444 </span> : * -<span class="lineNum"> 445 </span> : * This inline function will boil down to a call to @c memmove whenever -<span class="lineNum"> 446 </span> : * possible. Failing that, if random access iterators are passed, then the -<span class="lineNum"> 447 </span> : * loop count will be known (and therefore a candidate for compiler -<span class="lineNum"> 448 </span> : * optimizations such as unrolling). Result may not be contained within -<span class="lineNum"> 449 </span> : * [first,last); the copy_backward function should be used instead. -<span class="lineNum"> 450 </span> : * -<span class="lineNum"> 451 </span> : * Note that the end of the output range is permitted to be contained -<span class="lineNum"> 452 </span> : * within [first,last). -<span class="lineNum"> 453 </span> : */ -<span class="lineNum"> 454 </span> : template<typename _II, typename _OI> -<span class="lineNum"> 455 </span> : inline _OI -<span class="lineNum"> 456 </span><span class="lineCov"> 70433 : copy(_II __first, _II __last, _OI __result)</span> -<span class="lineNum"> 457 </span> : { -<span class="lineNum"> 458 </span> : // concept requirements -<span class="lineNum"> 459 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II>) -<span class="lineNum"> 460 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OI, -<span class="lineNum"> 461 </span> : typename iterator_traits<_II>::value_type>) -<span class="lineNum"> 462 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 463 </span> : -<span class="lineNum"> 464 </span> : return (std::__copy_move_a2<__is_move_iterator<_II>::__value> -<span class="lineNum"> 465 </span> : (std::__miter_base<_II>::__b(__first), -<span class="lineNum"> 466 </span><span class="lineCov"> 70433 : std::__miter_base<_II>::__b(__last), __result));</span> -<span class="lineNum"> 467 </span> : } -<span class="lineNum"> 468 </span> : -<span class="lineNum"> 469 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 470 </span> : /** -<span class="lineNum"> 471 </span> : * @brief Moves the range [first,last) into result. -<span class="lineNum"> 472 </span> : * @param first An input iterator. -<span class="lineNum"> 473 </span> : * @param last An input iterator. -<span class="lineNum"> 474 </span> : * @param result An output iterator. -<span class="lineNum"> 475 </span> : * @return result + (first - last) -<span class="lineNum"> 476 </span> : * -<span class="lineNum"> 477 </span> : * This inline function will boil down to a call to @c memmove whenever -<span class="lineNum"> 478 </span> : * possible. Failing that, if random access iterators are passed, then the -<span class="lineNum"> 479 </span> : * loop count will be known (and therefore a candidate for compiler -<span class="lineNum"> 480 </span> : * optimizations such as unrolling). Result may not be contained within -<span class="lineNum"> 481 </span> : * [first,last); the move_backward function should be used instead. -<span class="lineNum"> 482 </span> : * -<span class="lineNum"> 483 </span> : * Note that the end of the output range is permitted to be contained -<span class="lineNum"> 484 </span> : * within [first,last). -<span class="lineNum"> 485 </span> : */ -<span class="lineNum"> 486 </span> : template<typename _II, typename _OI> -<span class="lineNum"> 487 </span> : inline _OI -<span class="lineNum"> 488 </span> : move(_II __first, _II __last, _OI __result) -<span class="lineNum"> 489 </span> : { -<span class="lineNum"> 490 </span> : // concept requirements -<span class="lineNum"> 491 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II>) -<span class="lineNum"> 492 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OI, -<span class="lineNum"> 493 </span> : typename iterator_traits<_II>::value_type>) -<span class="lineNum"> 494 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 495 </span> : -<span class="lineNum"> 496 </span> : return (std::__copy_move_a2<true> -<span class="lineNum"> 497 </span> : (std::__miter_base<_II>::__b(__first), -<span class="lineNum"> 498 </span> : std::__miter_base<_II>::__b(__last), __result)); -<span class="lineNum"> 499 </span> : } -<span class="lineNum"> 500 </span> : -<span class="lineNum"> 501 </span> : #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp) -<span class="lineNum"> 502 </span> : #else -<span class="lineNum"> 503 </span> : #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp) -<span class="lineNum"> 504 </span> : #endif -<span class="lineNum"> 505 </span> : -<span class="lineNum"> 506 </span> : template<bool, bool, typename> -<span class="lineNum"> 507 </span> : struct __copy_move_backward -<span class="lineNum"> 508 </span> : { -<span class="lineNum"> 509 </span> : template<typename _BI1, typename _BI2> -<span class="lineNum"> 510 </span> : static _BI2 -<span class="lineNum"> 511 </span> : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) -<span class="lineNum"> 512 </span> : { -<span class="lineNum"> 513 </span> : while (__first != __last) -<span class="lineNum"> 514 </span> : *--__result = *--__last; -<span class="lineNum"> 515 </span> : return __result; -<span class="lineNum"> 516 </span> : } -<span class="lineNum"> 517 </span> : }; -<span class="lineNum"> 518 </span> : -<span class="lineNum"> 519 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 520 </span> : template<typename _Category> -<span class="lineNum"> 521 </span> : struct __copy_move_backward<true, false, _Category> -<span class="lineNum"> 522 </span> : { -<span class="lineNum"> 523 </span> : template<typename _BI1, typename _BI2> -<span class="lineNum"> 524 </span> : static _BI2 -<span class="lineNum"> 525 </span> : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) -<span class="lineNum"> 526 </span> : { -<span class="lineNum"> 527 </span> : while (__first != __last) -<span class="lineNum"> 528 </span> : *--__result = std::move(*--__last); -<span class="lineNum"> 529 </span> : return __result; -<span class="lineNum"> 530 </span> : } -<span class="lineNum"> 531 </span> : }; -<span class="lineNum"> 532 </span> : #endif -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : template<> -<span class="lineNum"> 535 </span> : struct __copy_move_backward<false, false, random_access_iterator_tag> -<span class="lineNum"> 536 </span> : { -<span class="lineNum"> 537 </span> : template<typename _BI1, typename _BI2> -<span class="lineNum"> 538 </span> : static _BI2 -<span class="lineNum"> 539 </span><span class="lineCov"> 150 : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</span> -<span class="lineNum"> 540 </span> : { -<span class="lineNum"> 541 </span> : typename iterator_traits<_BI1>::difference_type __n; -<span class="lineNum"> 542 </span><span class="lineCov"> 524 : for (__n = __last - __first; __n > 0; --__n)</span> -<span class="lineNum"> 543 </span><span class="lineCov"> 374 : *--__result = *--__last;</span> -<span class="lineNum"> 544 </span><span class="lineCov"> 150 : return __result;</span> -<span class="lineNum"> 545 </span> : } -<span class="lineNum"> 546 </span> : }; -<span class="lineNum"> 547 </span> : -<span class="lineNum"> 548 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 549 </span> : template<> -<span class="lineNum"> 550 </span> : struct __copy_move_backward<true, false, random_access_iterator_tag> -<span class="lineNum"> 551 </span> : { -<span class="lineNum"> 552 </span> : template<typename _BI1, typename _BI2> -<span class="lineNum"> 553 </span> : static _BI2 -<span class="lineNum"> 554 </span> : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) -<span class="lineNum"> 555 </span> : { -<span class="lineNum"> 556 </span> : typename iterator_traits<_BI1>::difference_type __n; -<span class="lineNum"> 557 </span> : for (__n = __last - __first; __n > 0; --__n) -<span class="lineNum"> 558 </span> : *--__result = std::move(*--__last); -<span class="lineNum"> 559 </span> : return __result; -<span class="lineNum"> 560 </span> : } -<span class="lineNum"> 561 </span> : }; -<span class="lineNum"> 562 </span> : #endif -<span class="lineNum"> 563 </span> : -<span class="lineNum"> 564 </span> : template<bool _IsMove> -<span class="lineNum"> 565 </span> : struct __copy_move_backward<_IsMove, true, random_access_iterator_tag> -<span class="lineNum"> 566 </span> : { -<span class="lineNum"> 567 </span> : template<typename _Tp> -<span class="lineNum"> 568 </span> : static _Tp* -<span class="lineNum"> 569 </span><span class="lineCov"> 7626 : __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result)</span> -<span class="lineNum"> 570 </span> : { -<span class="lineNum"> 571 </span><span class="lineCov"> 7626 : const ptrdiff_t _Num = __last - __first;</span> -<span class="lineNum"> 572 </span><span class="lineCov"> 7626 : __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num);</span> -<span class="lineNum"> 573 </span><span class="lineCov"> 7626 : return __result - _Num;</span> -<span class="lineNum"> 574 </span> : } -<span class="lineNum"> 575 </span> : }; -<span class="lineNum"> 576 </span> : -<span class="lineNum"> 577 </span> : template<bool _IsMove, typename _BI1, typename _BI2> -<span class="lineNum"> 578 </span> : inline _BI2 -<span class="lineNum"> 579 </span><span class="lineCov"> 7776 : __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result)</span> -<span class="lineNum"> 580 </span> : { -<span class="lineNum"> 581 </span> : typedef typename iterator_traits<_BI1>::value_type _ValueType1; -<span class="lineNum"> 582 </span> : typedef typename iterator_traits<_BI2>::value_type _ValueType2; -<span class="lineNum"> 583 </span> : typedef typename iterator_traits<_BI1>::iterator_category _Category; -<span class="lineNum"> 584 </span> : const bool __simple = (__is_pod(_ValueType1) -<span class="lineNum"> 585 </span> : && __is_pointer<_BI1>::__value -<span class="lineNum"> 586 </span> : && __is_pointer<_BI2>::__value -<span class="lineNum"> 587 </span><span class="lineCov"> 7776 : && __are_same<_ValueType1, _ValueType2>::__value);</span> -<span class="lineNum"> 588 </span> : -<span class="lineNum"> 589 </span> : return std::__copy_move_backward<_IsMove, __simple, -<span class="lineNum"> 590 </span> : _Category>::__copy_move_b(__first, -<span class="lineNum"> 591 </span> : __last, -<span class="lineNum"> 592 </span><span class="lineCov"> 7776 : __result);</span> -<span class="lineNum"> 593 </span> : } -<span class="lineNum"> 594 </span> : -<span class="lineNum"> 595 </span> : template<bool _IsMove, typename _BI1, typename _BI2> -<span class="lineNum"> 596 </span> : inline _BI2 -<span class="lineNum"> 597 </span><span class="lineCov"> 7776 : __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result)</span> -<span class="lineNum"> 598 </span> : { -<span class="lineNum"> 599 </span> : return _BI2(std::__copy_move_backward_a<_IsMove> -<span class="lineNum"> 600 </span> : (std::__niter_base<_BI1>::__b(__first), -<span class="lineNum"> 601 </span> : std::__niter_base<_BI1>::__b(__last), -<span class="lineNum"> 602 </span><span class="lineCov"> 7776 : std::__niter_base<_BI2>::__b(__result)));</span> -<span class="lineNum"> 603 </span> : } -<span class="lineNum"> 604 </span> : -<span class="lineNum"> 605 </span> : /** -<span class="lineNum"> 606 </span> : * @brief Copies the range [first,last) into result. -<span class="lineNum"> 607 </span> : * @param first A bidirectional iterator. -<span class="lineNum"> 608 </span> : * @param last A bidirectional iterator. -<span class="lineNum"> 609 </span> : * @param result A bidirectional iterator. -<span class="lineNum"> 610 </span> : * @return result - (first - last) -<span class="lineNum"> 611 </span> : * -<span class="lineNum"> 612 </span> : * The function has the same effect as copy, but starts at the end of the -<span class="lineNum"> 613 </span> : * range and works its way to the start, returning the start of the result. -<span class="lineNum"> 614 </span> : * This inline function will boil down to a call to @c memmove whenever -<span class="lineNum"> 615 </span> : * possible. Failing that, if random access iterators are passed, then the -<span class="lineNum"> 616 </span> : * loop count will be known (and therefore a candidate for compiler -<span class="lineNum"> 617 </span> : * optimizations such as unrolling). -<span class="lineNum"> 618 </span> : * -<span class="lineNum"> 619 </span> : * Result may not be in the range [first,last). Use copy instead. Note -<span class="lineNum"> 620 </span> : * that the start of the output range may overlap [first,last). -<span class="lineNum"> 621 </span> : */ -<span class="lineNum"> 622 </span> : template<typename _BI1, typename _BI2> -<span class="lineNum"> 623 </span> : inline _BI2 -<span class="lineNum"> 624 </span><span class="lineCov"> 7776 : copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)</span> -<span class="lineNum"> 625 </span> : { -<span class="lineNum"> 626 </span> : // concept requirements -<span class="lineNum"> 627 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>) -<span class="lineNum"> 628 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>) -<span class="lineNum"> 629 </span> : __glibcxx_function_requires(_ConvertibleConcept< -<span class="lineNum"> 630 </span> : typename iterator_traits<_BI1>::value_type, -<span class="lineNum"> 631 </span> : typename iterator_traits<_BI2>::value_type>) -<span class="lineNum"> 632 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 633 </span> : -<span class="lineNum"> 634 </span> : return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value> -<span class="lineNum"> 635 </span> : (std::__miter_base<_BI1>::__b(__first), -<span class="lineNum"> 636 </span><span class="lineCov"> 7776 : std::__miter_base<_BI1>::__b(__last), __result));</span> -<span class="lineNum"> 637 </span> : } -<span class="lineNum"> 638 </span> : -<span class="lineNum"> 639 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 640 </span> : /** -<span class="lineNum"> 641 </span> : * @brief Moves the range [first,last) into result. -<span class="lineNum"> 642 </span> : * @param first A bidirectional iterator. -<span class="lineNum"> 643 </span> : * @param last A bidirectional iterator. -<span class="lineNum"> 644 </span> : * @param result A bidirectional iterator. -<span class="lineNum"> 645 </span> : * @return result - (first - last) -<span class="lineNum"> 646 </span> : * -<span class="lineNum"> 647 </span> : * The function has the same effect as move, but starts at the end of the -<span class="lineNum"> 648 </span> : * range and works its way to the start, returning the start of the result. -<span class="lineNum"> 649 </span> : * This inline function will boil down to a call to @c memmove whenever -<span class="lineNum"> 650 </span> : * possible. Failing that, if random access iterators are passed, then the -<span class="lineNum"> 651 </span> : * loop count will be known (and therefore a candidate for compiler -<span class="lineNum"> 652 </span> : * optimizations such as unrolling). -<span class="lineNum"> 653 </span> : * -<span class="lineNum"> 654 </span> : * Result may not be in the range [first,last). Use move instead. Note -<span class="lineNum"> 655 </span> : * that the start of the output range may overlap [first,last). -<span class="lineNum"> 656 </span> : */ -<span class="lineNum"> 657 </span> : template<typename _BI1, typename _BI2> -<span class="lineNum"> 658 </span> : inline _BI2 -<span class="lineNum"> 659 </span> : move_backward(_BI1 __first, _BI1 __last, _BI2 __result) -<span class="lineNum"> 660 </span> : { -<span class="lineNum"> 661 </span> : // concept requirements -<span class="lineNum"> 662 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>) -<span class="lineNum"> 663 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>) -<span class="lineNum"> 664 </span> : __glibcxx_function_requires(_ConvertibleConcept< -<span class="lineNum"> 665 </span> : typename iterator_traits<_BI1>::value_type, -<span class="lineNum"> 666 </span> : typename iterator_traits<_BI2>::value_type>) -<span class="lineNum"> 667 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 668 </span> : -<span class="lineNum"> 669 </span> : return (std::__copy_move_backward_a2<true> -<span class="lineNum"> 670 </span> : (std::__miter_base<_BI1>::__b(__first), -<span class="lineNum"> 671 </span> : std::__miter_base<_BI1>::__b(__last), __result)); -<span class="lineNum"> 672 </span> : } -<span class="lineNum"> 673 </span> : -<span class="lineNum"> 674 </span> : #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp) -<span class="lineNum"> 675 </span> : #else -<span class="lineNum"> 676 </span> : #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp) -<span class="lineNum"> 677 </span> : #endif -<span class="lineNum"> 678 </span> : -<span class="lineNum"> 679 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 680 </span> : inline typename -<span class="lineNum"> 681 </span> : __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type -<span class="lineNum"> 682 </span> : __fill_a(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 683 </span><span class="lineCov"> 22386 : const _Tp& __value)</span> -<span class="lineNum"> 684 </span> : { -<span class="lineNum"> 685 </span><span class="lineCov"> 22386 : for (; __first != __last; ++__first)</span> -<span class="lineNum"> 686 </span><span class="lineNoCov"> 0 : *__first = __value;</span> -<span class="lineNum"> 687 </span><span class="lineCov"> 22386 : }</span> -<span class="lineNum"> 688 </span> : -<span class="lineNum"> 689 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 690 </span> : inline typename -<span class="lineNum"> 691 </span> : __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type -<span class="lineNum"> 692 </span> : __fill_a(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 693 </span> : const _Tp& __value) -<span class="lineNum"> 694 </span> : { -<span class="lineNum"> 695 </span> : const _Tp __tmp = __value; -<span class="lineNum"> 696 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 697 </span> : *__first = __tmp; -<span class="lineNum"> 698 </span> : } -<span class="lineNum"> 699 </span> : -<span class="lineNum"> 700 </span> : // Specialization: for char types we can use memset. -<span class="lineNum"> 701 </span> : template<typename _Tp> -<span class="lineNum"> 702 </span> : inline typename -<span class="lineNum"> 703 </span> : __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type -<span class="lineNum"> 704 </span> : __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c) -<span class="lineNum"> 705 </span> : { -<span class="lineNum"> 706 </span> : const _Tp __tmp = __c; -<span class="lineNum"> 707 </span> : __builtin_memset(__first, static_cast<unsigned char>(__tmp), -<span class="lineNum"> 708 </span> : __last - __first); -<span class="lineNum"> 709 </span> : } -<span class="lineNum"> 710 </span> : -<span class="lineNum"> 711 </span> : /** -<span class="lineNum"> 712 </span> : * @brief Fills the range [first,last) with copies of value. -<span class="lineNum"> 713 </span> : * @param first A forward iterator. -<span class="lineNum"> 714 </span> : * @param last A forward iterator. -<span class="lineNum"> 715 </span> : * @param value A reference-to-const of arbitrary type. -<span class="lineNum"> 716 </span> : * @return Nothing. -<span class="lineNum"> 717 </span> : * -<span class="lineNum"> 718 </span> : * This function fills a range with copies of the same value. For char -<span class="lineNum"> 719 </span> : * types filling contiguous areas of memory, this becomes an inline call -<span class="lineNum"> 720 </span> : * to @c memset or @c wmemset. -<span class="lineNum"> 721 </span> : */ -<span class="lineNum"> 722 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 723 </span> : inline void -<span class="lineNum"> 724 </span><span class="lineCov"> 22386 : fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)</span> -<span class="lineNum"> 725 </span> : { -<span class="lineNum"> 726 </span> : // concept requirements -<span class="lineNum"> 727 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 728 </span> : _ForwardIterator>) -<span class="lineNum"> 729 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 730 </span> : -<span class="lineNum"> 731 </span><span class="lineCov"> 22386 : std::__fill_a(std::__niter_base<_ForwardIterator>::__b(__first),</span> -<span class="lineNum"> 732 </span> : std::__niter_base<_ForwardIterator>::__b(__last), __value); -<span class="lineNum"> 733 </span><span class="lineCov"> 22386 : }</span> -<span class="lineNum"> 734 </span> : -<span class="lineNum"> 735 </span> : template<typename _OutputIterator, typename _Size, typename _Tp> -<span class="lineNum"> 736 </span> : inline typename -<span class="lineNum"> 737 </span> : __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type -<span class="lineNum"> 738 </span> : __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) -<span class="lineNum"> 739 </span> : { -<span class="lineNum"> 740 </span> : for (; __n > 0; --__n, ++__first) -<span class="lineNum"> 741 </span> : *__first = __value; -<span class="lineNum"> 742 </span> : return __first; -<span class="lineNum"> 743 </span> : } -<span class="lineNum"> 744 </span> : -<span class="lineNum"> 745 </span> : template<typename _OutputIterator, typename _Size, typename _Tp> -<span class="lineNum"> 746 </span> : inline typename -<span class="lineNum"> 747 </span> : __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type -<span class="lineNum"> 748 </span><span class="lineCov"> 9 : __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)</span> -<span class="lineNum"> 749 </span> : { -<span class="lineNum"> 750 </span><span class="lineCov"> 9 : const _Tp __tmp = __value;</span> -<span class="lineNum"> 751 </span><span class="lineCov"> 9 : for (; __n > 0; --__n, ++__first)</span> -<span class="lineNum"> 752 </span><span class="lineNoCov"> 0 : *__first = __tmp;</span> -<span class="lineNum"> 753 </span><span class="lineCov"> 9 : return __first;</span> -<span class="lineNum"> 754 </span> : } -<span class="lineNum"> 755 </span> : -<span class="lineNum"> 756 </span> : template<typename _Size, typename _Tp> -<span class="lineNum"> 757 </span> : inline typename -<span class="lineNum"> 758 </span> : __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type -<span class="lineNum"> 759 </span> : __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c) -<span class="lineNum"> 760 </span> : { -<span class="lineNum"> 761 </span> : std::__fill_a(__first, __first + __n, __c); -<span class="lineNum"> 762 </span> : return __first + __n; -<span class="lineNum"> 763 </span> : } -<span class="lineNum"> 764 </span> : -<span class="lineNum"> 765 </span> : /** -<span class="lineNum"> 766 </span> : * @brief Fills the range [first,first+n) with copies of value. -<span class="lineNum"> 767 </span> : * @param first An output iterator. -<span class="lineNum"> 768 </span> : * @param n The count of copies to perform. -<span class="lineNum"> 769 </span> : * @param value A reference-to-const of arbitrary type. -<span class="lineNum"> 770 </span> : * @return The iterator at first+n. -<span class="lineNum"> 771 </span> : * -<span class="lineNum"> 772 </span> : * This function fills a range with copies of the same value. For char -<span class="lineNum"> 773 </span> : * types filling contiguous areas of memory, this becomes an inline call -<span class="lineNum"> 774 </span> : * to @c memset or @ wmemset. -<span class="lineNum"> 775 </span> : */ -<span class="lineNum"> 776 </span> : template<typename _OI, typename _Size, typename _Tp> -<span class="lineNum"> 777 </span> : inline _OI -<span class="lineNum"> 778 </span><span class="lineCov"> 9 : fill_n(_OI __first, _Size __n, const _Tp& __value)</span> -<span class="lineNum"> 779 </span> : { -<span class="lineNum"> 780 </span> : // concept requirements -<span class="lineNum"> 781 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OI, _Tp>) -<span class="lineNum"> 782 </span> : -<span class="lineNum"> 783 </span> : return _OI(std::__fill_n_a(std::__niter_base<_OI>::__b(__first), -<span class="lineNum"> 784 </span><span class="lineCov"> 9 : __n, __value));</span> -<span class="lineNum"> 785 </span> : } -<span class="lineNum"> 786 </span> : -<span class="lineNum"> 787 </span> : template<bool _BoolType> -<span class="lineNum"> 788 </span> : struct __equal -<span class="lineNum"> 789 </span> : { -<span class="lineNum"> 790 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 791 </span> : static bool -<span class="lineNum"> 792 </span><span class="lineCov"> 4 : equal(_II1 __first1, _II1 __last1, _II2 __first2)</span> -<span class="lineNum"> 793 </span> : { -<span class="lineNum"> 794 </span><span class="lineCov"> 51 : for (; __first1 != __last1; ++__first1, ++__first2)</span> -<span class="lineNum"> 795 </span><span class="lineCov"> 47 : if (!(*__first1 == *__first2))</span> -<span class="lineNum"> 796 </span><span class="lineNoCov"> 0 : return false;</span> -<span class="lineNum"> 797 </span><span class="lineCov"> 4 : return true;</span> -<span class="lineNum"> 798 </span> : } -<span class="lineNum"> 799 </span> : }; -<span class="lineNum"> 800 </span> : -<span class="lineNum"> 801 </span> : template<> -<span class="lineNum"> 802 </span> : struct __equal<true> -<span class="lineNum"> 803 </span> : { -<span class="lineNum"> 804 </span> : template<typename _Tp> -<span class="lineNum"> 805 </span> : static bool -<span class="lineNum"> 806 </span> : equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2) -<span class="lineNum"> 807 </span> : { -<span class="lineNum"> 808 </span> : return !__builtin_memcmp(__first1, __first2, sizeof(_Tp) -<span class="lineNum"> 809 </span> : * (__last1 - __first1)); -<span class="lineNum"> 810 </span> : } -<span class="lineNum"> 811 </span> : }; -<span class="lineNum"> 812 </span> : -<span class="lineNum"> 813 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 814 </span> : inline bool -<span class="lineNum"> 815 </span><span class="lineCov"> 4 : __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)</span> -<span class="lineNum"> 816 </span> : { -<span class="lineNum"> 817 </span> : typedef typename iterator_traits<_II1>::value_type _ValueType1; -<span class="lineNum"> 818 </span> : typedef typename iterator_traits<_II2>::value_type _ValueType2; -<span class="lineNum"> 819 </span> : const bool __simple = (__is_integer<_ValueType1>::__value -<span class="lineNum"> 820 </span> : && __is_pointer<_II1>::__value -<span class="lineNum"> 821 </span> : && __is_pointer<_II2>::__value -<span class="lineNum"> 822 </span><span class="lineCov"> 4 : && __are_same<_ValueType1, _ValueType2>::__value);</span> -<span class="lineNum"> 823 </span> : -<span class="lineNum"> 824 </span><span class="lineCov"> 4 : return std::__equal<__simple>::equal(__first1, __last1, __first2);</span> -<span class="lineNum"> 825 </span> : } -<span class="lineNum"> 826 </span> : -<span class="lineNum"> 827 </span> : -<span class="lineNum"> 828 </span> : template<typename, typename> -<span class="lineNum"> 829 </span> : struct __lc_rai -<span class="lineNum"> 830 </span> : { -<span class="lineNum"> 831 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 832 </span> : static _II1 -<span class="lineNum"> 833 </span> : __newlast1(_II1, _II1 __last1, _II2, _II2) -<span class="lineNum"> 834 </span> : { return __last1; } -<span class="lineNum"> 835 </span> : -<span class="lineNum"> 836 </span> : template<typename _II> -<span class="lineNum"> 837 </span> : static bool -<span class="lineNum"> 838 </span> : __cnd2(_II __first, _II __last) -<span class="lineNum"> 839 </span> : { return __first != __last; } -<span class="lineNum"> 840 </span> : }; -<span class="lineNum"> 841 </span> : -<span class="lineNum"> 842 </span> : template<> -<span class="lineNum"> 843 </span> : struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag> -<span class="lineNum"> 844 </span> : { -<span class="lineNum"> 845 </span> : template<typename _RAI1, typename _RAI2> -<span class="lineNum"> 846 </span> : static _RAI1 -<span class="lineNum"> 847 </span> : __newlast1(_RAI1 __first1, _RAI1 __last1, -<span class="lineNum"> 848 </span> : _RAI2 __first2, _RAI2 __last2) -<span class="lineNum"> 849 </span> : { -<span class="lineNum"> 850 </span> : const typename iterator_traits<_RAI1>::difference_type -<span class="lineNum"> 851 </span> : __diff1 = __last1 - __first1; -<span class="lineNum"> 852 </span> : const typename iterator_traits<_RAI2>::difference_type -<span class="lineNum"> 853 </span> : __diff2 = __last2 - __first2; -<span class="lineNum"> 854 </span> : return __diff2 < __diff1 ? __first1 + __diff2 : __last1; -<span class="lineNum"> 855 </span> : } -<span class="lineNum"> 856 </span> : -<span class="lineNum"> 857 </span> : template<typename _RAI> -<span class="lineNum"> 858 </span> : static bool -<span class="lineNum"> 859 </span> : __cnd2(_RAI, _RAI) -<span class="lineNum"> 860 </span> : { return true; } -<span class="lineNum"> 861 </span> : }; -<span class="lineNum"> 862 </span> : -<span class="lineNum"> 863 </span> : template<bool _BoolType> -<span class="lineNum"> 864 </span> : struct __lexicographical_compare -<span class="lineNum"> 865 </span> : { -<span class="lineNum"> 866 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 867 </span> : static bool __lc(_II1, _II1, _II2, _II2); -<span class="lineNum"> 868 </span> : }; -<span class="lineNum"> 869 </span> : -<span class="lineNum"> 870 </span> : template<bool _BoolType> -<span class="lineNum"> 871 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 872 </span> : bool -<span class="lineNum"> 873 </span> : __lexicographical_compare<_BoolType>:: -<span class="lineNum"> 874 </span> : __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) -<span class="lineNum"> 875 </span> : { -<span class="lineNum"> 876 </span> : typedef typename iterator_traits<_II1>::iterator_category _Category1; -<span class="lineNum"> 877 </span> : typedef typename iterator_traits<_II2>::iterator_category _Category2; -<span class="lineNum"> 878 </span> : typedef std::__lc_rai<_Category1, _Category2> __rai_type; -<span class="lineNum"> 879 </span> : -<span class="lineNum"> 880 </span> : __last1 = __rai_type::__newlast1(__first1, __last1, -<span class="lineNum"> 881 </span> : __first2, __last2); -<span class="lineNum"> 882 </span> : for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); -<span class="lineNum"> 883 </span> : ++__first1, ++__first2) -<span class="lineNum"> 884 </span> : { -<span class="lineNum"> 885 </span> : if (*__first1 < *__first2) -<span class="lineNum"> 886 </span> : return true; -<span class="lineNum"> 887 </span> : if (*__first2 < *__first1) -<span class="lineNum"> 888 </span> : return false; -<span class="lineNum"> 889 </span> : } -<span class="lineNum"> 890 </span> : return __first1 == __last1 && __first2 != __last2; -<span class="lineNum"> 891 </span> : } -<span class="lineNum"> 892 </span> : -<span class="lineNum"> 893 </span> : template<> -<span class="lineNum"> 894 </span> : struct __lexicographical_compare<true> -<span class="lineNum"> 895 </span> : { -<span class="lineNum"> 896 </span> : template<typename _Tp, typename _Up> -<span class="lineNum"> 897 </span> : static bool -<span class="lineNum"> 898 </span> : __lc(const _Tp* __first1, const _Tp* __last1, -<span class="lineNum"> 899 </span> : const _Up* __first2, const _Up* __last2) -<span class="lineNum"> 900 </span> : { -<span class="lineNum"> 901 </span> : const size_t __len1 = __last1 - __first1; -<span class="lineNum"> 902 </span> : const size_t __len2 = __last2 - __first2; -<span class="lineNum"> 903 </span> : const int __result = __builtin_memcmp(__first1, __first2, -<span class="lineNum"> 904 </span> : std::min(__len1, __len2)); -<span class="lineNum"> 905 </span> : return __result != 0 ? __result < 0 : __len1 < __len2; -<span class="lineNum"> 906 </span> : } -<span class="lineNum"> 907 </span> : }; -<span class="lineNum"> 908 </span> : -<span class="lineNum"> 909 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 910 </span> : inline bool -<span class="lineNum"> 911 </span> : __lexicographical_compare_aux(_II1 __first1, _II1 __last1, -<span class="lineNum"> 912 </span> : _II2 __first2, _II2 __last2) -<span class="lineNum"> 913 </span> : { -<span class="lineNum"> 914 </span> : typedef typename iterator_traits<_II1>::value_type _ValueType1; -<span class="lineNum"> 915 </span> : typedef typename iterator_traits<_II2>::value_type _ValueType2; -<span class="lineNum"> 916 </span> : const bool __simple = -<span class="lineNum"> 917 </span> : (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value -<span class="lineNum"> 918 </span> : && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed -<span class="lineNum"> 919 </span> : && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed -<span class="lineNum"> 920 </span> : && __is_pointer<_II1>::__value -<span class="lineNum"> 921 </span> : && __is_pointer<_II2>::__value); -<span class="lineNum"> 922 </span> : -<span class="lineNum"> 923 </span> : return std::__lexicographical_compare<__simple>::__lc(__first1, __last1, -<span class="lineNum"> 924 </span> : __first2, __last2); -<span class="lineNum"> 925 </span> : } -<span class="lineNum"> 926 </span> : -<span class="lineNum"> 927 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 928 </span> : -<span class="lineNum"> 929 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) -<span class="lineNum"> 930 </span> : -<span class="lineNum"> 931 </span> : /** -<span class="lineNum"> 932 </span> : * @brief Tests a range for element-wise equality. -<span class="lineNum"> 933 </span> : * @param first1 An input iterator. -<span class="lineNum"> 934 </span> : * @param last1 An input iterator. -<span class="lineNum"> 935 </span> : * @param first2 An input iterator. -<span class="lineNum"> 936 </span> : * @return A boolean true or false. -<span class="lineNum"> 937 </span> : * -<span class="lineNum"> 938 </span> : * This compares the elements of two ranges using @c == and returns true or -<span class="lineNum"> 939 </span> : * false depending on whether all of the corresponding elements of the -<span class="lineNum"> 940 </span> : * ranges are equal. -<span class="lineNum"> 941 </span> : */ -<span class="lineNum"> 942 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 943 </span> : inline bool -<span class="lineNum"> 944 </span><span class="lineCov"> 4 : equal(_II1 __first1, _II1 __last1, _II2 __first2)</span> -<span class="lineNum"> 945 </span> : { -<span class="lineNum"> 946 </span> : // concept requirements -<span class="lineNum"> 947 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II1>) -<span class="lineNum"> 948 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II2>) -<span class="lineNum"> 949 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 950 </span> : typename iterator_traits<_II1>::value_type, -<span class="lineNum"> 951 </span> : typename iterator_traits<_II2>::value_type>) -<span class="lineNum"> 952 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 953 </span> : -<span class="lineNum"> 954 </span> : return std::__equal_aux(std::__niter_base<_II1>::__b(__first1), -<span class="lineNum"> 955 </span> : std::__niter_base<_II1>::__b(__last1), -<span class="lineNum"> 956 </span><span class="lineCov"> 4 : std::__niter_base<_II2>::__b(__first2));</span> -<span class="lineNum"> 957 </span> : } -<span class="lineNum"> 958 </span> : -<span class="lineNum"> 959 </span> : /** -<span class="lineNum"> 960 </span> : * @brief Tests a range for element-wise equality. -<span class="lineNum"> 961 </span> : * @param first1 An input iterator. -<span class="lineNum"> 962 </span> : * @param last1 An input iterator. -<span class="lineNum"> 963 </span> : * @param first2 An input iterator. -<span class="lineNum"> 964 </span> : * @param binary_pred A binary predicate @link s20_3_1_base -<span class="lineNum"> 965 </span> : * functor@endlink. -<span class="lineNum"> 966 </span> : * @return A boolean true or false. -<span class="lineNum"> 967 </span> : * -<span class="lineNum"> 968 </span> : * This compares the elements of two ranges using the binary_pred -<span class="lineNum"> 969 </span> : * parameter, and returns true or -<span class="lineNum"> 970 </span> : * false depending on whether all of the corresponding elements of the -<span class="lineNum"> 971 </span> : * ranges are equal. -<span class="lineNum"> 972 </span> : */ -<span class="lineNum"> 973 </span> : template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> -<span class="lineNum"> 974 </span> : inline bool -<span class="lineNum"> 975 </span> : equal(_IIter1 __first1, _IIter1 __last1, -<span class="lineNum"> 976 </span> : _IIter2 __first2, _BinaryPredicate __binary_pred) -<span class="lineNum"> 977 </span> : { -<span class="lineNum"> 978 </span> : // concept requirements -<span class="lineNum"> 979 </span> : __glibcxx_function_requires(_InputIteratorConcept<_IIter1>) -<span class="lineNum"> 980 </span> : __glibcxx_function_requires(_InputIteratorConcept<_IIter2>) -<span class="lineNum"> 981 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 982 </span> : -<span class="lineNum"> 983 </span> : for (; __first1 != __last1; ++__first1, ++__first2) -<span class="lineNum"> 984 </span> : if (!bool(__binary_pred(*__first1, *__first2))) -<span class="lineNum"> 985 </span> : return false; -<span class="lineNum"> 986 </span> : return true; -<span class="lineNum"> 987 </span> : } -<span class="lineNum"> 988 </span> : -<span class="lineNum"> 989 </span> : /** -<span class="lineNum"> 990 </span> : * @brief Performs "dictionary" comparison on ranges. -<span class="lineNum"> 991 </span> : * @param first1 An input iterator. -<span class="lineNum"> 992 </span> : * @param last1 An input iterator. -<span class="lineNum"> 993 </span> : * @param first2 An input iterator. -<span class="lineNum"> 994 </span> : * @param last2 An input iterator. -<span class="lineNum"> 995 </span> : * @return A boolean true or false. -<span class="lineNum"> 996 </span> : * -<span class="lineNum"> 997 </span> : * "Returns true if the sequence of elements defined by the range -<span class="lineNum"> 998 </span> : * [first1,last1) is lexicographically less than the sequence of elements -<span class="lineNum"> 999 </span> : * defined by the range [first2,last2). Returns false otherwise." -<span class="lineNum"> 1000 </span> : * (Quoted from [25.3.8]/1.) If the iterators are all character pointers, -<span class="lineNum"> 1001 </span> : * then this is an inline call to @c memcmp. -<span class="lineNum"> 1002 </span> : */ -<span class="lineNum"> 1003 </span> : template<typename _II1, typename _II2> -<span class="lineNum"> 1004 </span> : inline bool -<span class="lineNum"> 1005 </span> : lexicographical_compare(_II1 __first1, _II1 __last1, -<span class="lineNum"> 1006 </span> : _II2 __first2, _II2 __last2) -<span class="lineNum"> 1007 </span> : { -<span class="lineNum"> 1008 </span> : // concept requirements -<span class="lineNum"> 1009 </span> : typedef typename iterator_traits<_II1>::value_type _ValueType1; -<span class="lineNum"> 1010 </span> : typedef typename iterator_traits<_II2>::value_type _ValueType2; -<span class="lineNum"> 1011 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II1>) -<span class="lineNum"> 1012 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II2>) -<span class="lineNum"> 1013 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 1014 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 1015 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 1016 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 1017 </span> : -<span class="lineNum"> 1018 </span> : return std::__lexicographical_compare_aux -<span class="lineNum"> 1019 </span> : (std::__niter_base<_II1>::__b(__first1), -<span class="lineNum"> 1020 </span> : std::__niter_base<_II1>::__b(__last1), -<span class="lineNum"> 1021 </span> : std::__niter_base<_II2>::__b(__first2), -<span class="lineNum"> 1022 </span> : std::__niter_base<_II2>::__b(__last2)); -<span class="lineNum"> 1023 </span> : } -<span class="lineNum"> 1024 </span> : -<span class="lineNum"> 1025 </span> : /** -<span class="lineNum"> 1026 </span> : * @brief Performs "dictionary" comparison on ranges. -<span class="lineNum"> 1027 </span> : * @param first1 An input iterator. -<span class="lineNum"> 1028 </span> : * @param last1 An input iterator. -<span class="lineNum"> 1029 </span> : * @param first2 An input iterator. -<span class="lineNum"> 1030 </span> : * @param last2 An input iterator. -<span class="lineNum"> 1031 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink. -<span class="lineNum"> 1032 </span> : * @return A boolean true or false. -<span class="lineNum"> 1033 </span> : * -<span class="lineNum"> 1034 </span> : * The same as the four-parameter @c lexicographical_compare, but uses the -<span class="lineNum"> 1035 </span> : * comp parameter instead of @c <. -<span class="lineNum"> 1036 </span> : */ -<span class="lineNum"> 1037 </span> : template<typename _II1, typename _II2, typename _Compare> -<span class="lineNum"> 1038 </span> : bool -<span class="lineNum"> 1039 </span> : lexicographical_compare(_II1 __first1, _II1 __last1, -<span class="lineNum"> 1040 </span> : _II2 __first2, _II2 __last2, _Compare __comp) -<span class="lineNum"> 1041 </span> : { -<span class="lineNum"> 1042 </span> : typedef typename iterator_traits<_II1>::iterator_category _Category1; -<span class="lineNum"> 1043 </span> : typedef typename iterator_traits<_II2>::iterator_category _Category2; -<span class="lineNum"> 1044 </span> : typedef std::__lc_rai<_Category1, _Category2> __rai_type; -<span class="lineNum"> 1045 </span> : -<span class="lineNum"> 1046 </span> : // concept requirements -<span class="lineNum"> 1047 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II1>) -<span class="lineNum"> 1048 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II2>) -<span class="lineNum"> 1049 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 1050 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 1051 </span> : -<span class="lineNum"> 1052 </span> : __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); -<span class="lineNum"> 1053 </span> : for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); -<span class="lineNum"> 1054 </span> : ++__first1, ++__first2) -<span class="lineNum"> 1055 </span> : { -<span class="lineNum"> 1056 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 1057 </span> : return true; -<span class="lineNum"> 1058 </span> : if (__comp(*__first2, *__first1)) -<span class="lineNum"> 1059 </span> : return false; -<span class="lineNum"> 1060 </span> : } -<span class="lineNum"> 1061 </span> : return __first1 == __last1 && __first2 != __last2; -<span class="lineNum"> 1062 </span> : } -<span class="lineNum"> 1063 </span> : -<span class="lineNum"> 1064 </span> : /** -<span class="lineNum"> 1065 </span> : * @brief Finds the places in ranges which don't match. -<span class="lineNum"> 1066 </span> : * @param first1 An input iterator. -<span class="lineNum"> 1067 </span> : * @param last1 An input iterator. -<span class="lineNum"> 1068 </span> : * @param first2 An input iterator. -<span class="lineNum"> 1069 </span> : * @return A pair of iterators pointing to the first mismatch. -<span class="lineNum"> 1070 </span> : * -<span class="lineNum"> 1071 </span> : * This compares the elements of two ranges using @c == and returns a pair -<span class="lineNum"> 1072 </span> : * of iterators. The first iterator points into the first range, the -<span class="lineNum"> 1073 </span> : * second iterator points into the second range, and the elements pointed -<span class="lineNum"> 1074 </span> : * to by the iterators are not equal. -<span class="lineNum"> 1075 </span> : */ -<span class="lineNum"> 1076 </span> : template<typename _InputIterator1, typename _InputIterator2> -<span class="lineNum"> 1077 </span> : pair<_InputIterator1, _InputIterator2> -<span class="lineNum"> 1078 </span> : mismatch(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 1079 </span> : _InputIterator2 __first2) -<span class="lineNum"> 1080 </span> : { -<span class="lineNum"> 1081 </span> : // concept requirements -<span class="lineNum"> 1082 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 1083 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 1084 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 1085 </span> : typename iterator_traits<_InputIterator1>::value_type, -<span class="lineNum"> 1086 </span> : typename iterator_traits<_InputIterator2>::value_type>) -<span class="lineNum"> 1087 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 1088 </span> : -<span class="lineNum"> 1089 </span> : while (__first1 != __last1 && *__first1 == *__first2) -<span class="lineNum"> 1090 </span> : { -<span class="lineNum"> 1091 </span> : ++__first1; -<span class="lineNum"> 1092 </span> : ++__first2; -<span class="lineNum"> 1093 </span> : } -<span class="lineNum"> 1094 </span> : return pair<_InputIterator1, _InputIterator2>(__first1, __first2); -<span class="lineNum"> 1095 </span> : } -<span class="lineNum"> 1096 </span> : -<span class="lineNum"> 1097 </span> : /** -<span class="lineNum"> 1098 </span> : * @brief Finds the places in ranges which don't match. -<span class="lineNum"> 1099 </span> : * @param first1 An input iterator. -<span class="lineNum"> 1100 </span> : * @param last1 An input iterator. -<span class="lineNum"> 1101 </span> : * @param first2 An input iterator. -<span class="lineNum"> 1102 </span> : * @param binary_pred A binary predicate @link s20_3_1_base -<span class="lineNum"> 1103 </span> : * functor@endlink. -<span class="lineNum"> 1104 </span> : * @return A pair of iterators pointing to the first mismatch. -<span class="lineNum"> 1105 </span> : * -<span class="lineNum"> 1106 </span> : * This compares the elements of two ranges using the binary_pred -<span class="lineNum"> 1107 </span> : * parameter, and returns a pair -<span class="lineNum"> 1108 </span> : * of iterators. The first iterator points into the first range, the -<span class="lineNum"> 1109 </span> : * second iterator points into the second range, and the elements pointed -<span class="lineNum"> 1110 </span> : * to by the iterators are not equal. -<span class="lineNum"> 1111 </span> : */ -<span class="lineNum"> 1112 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 1113 </span> : typename _BinaryPredicate> -<span class="lineNum"> 1114 </span> : pair<_InputIterator1, _InputIterator2> -<span class="lineNum"> 1115 </span> : mismatch(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 1116 </span> : _InputIterator2 __first2, _BinaryPredicate __binary_pred) -<span class="lineNum"> 1117 </span> : { -<span class="lineNum"> 1118 </span> : // concept requirements -<span class="lineNum"> 1119 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 1120 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 1121 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 1122 </span> : -<span class="lineNum"> 1123 </span> : while (__first1 != __last1 && bool(__binary_pred(*__first1, *__first2))) -<span class="lineNum"> 1124 </span> : { -<span class="lineNum"> 1125 </span> : ++__first1; -<span class="lineNum"> 1126 </span> : ++__first2; -<span class="lineNum"> 1127 </span> : } -<span class="lineNum"> 1128 </span> : return pair<_InputIterator1, _InputIterator2>(__first1, __first2); -<span class="lineNum"> 1129 </span> : } -<span class="lineNum"> 1130 </span> : -<span class="lineNum"> 1131 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 1132 </span> : -<span class="lineNum"> 1133 </span> : // NB: This file is included within many other C++ includes, as a way -<span class="lineNum"> 1134 </span> : // of getting the base algorithms. So, make sure that parallel bits -<span class="lineNum"> 1135 </span> : // come in too if requested. -<span class="lineNum"> 1136 </span> : #ifdef _GLIBCXX_PARALLEL -<span class="lineNum"> 1137 </span> : # include <parallel/algobase.h> -<span class="lineNum"> 1138 </span> : #endif -<span class="lineNum"> 1139 </span> : -<span class="lineNum"> 1140 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_bvector.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_bvector.h.gcov.html deleted file mode 100644 index 3930b85..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_bvector.h.gcov.html +++ /dev/null @@ -1,1069 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_bvector.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_bvector.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">115</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">70.4 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">81</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // vector<bool> specialization -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1999 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_bvector.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_BVECTOR_H -<span class="lineNum"> 63 </span> : #define _STL_BVECTOR_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : typedef unsigned long _Bit_type; -<span class="lineNum"> 68 </span> : enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) }; -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : struct _Bit_reference -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span> : _Bit_type * _M_p; -<span class="lineNum"> 73 </span> : _Bit_type _M_mask; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span><span class="lineCov"> 5 : _Bit_reference(_Bit_type * __x, _Bit_type __y)</span> -<span class="lineNum"> 76 </span><span class="lineCov"> 5 : : _M_p(__x), _M_mask(__y) { }</span> -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : _Bit_reference() : _M_p(0), _M_mask(0) { } -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span><span class="lineCov"> 3 : operator bool() const</span> -<span class="lineNum"> 81 </span><span class="lineCov"> 3 : { return !!(*_M_p & _M_mask); }</span> -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : _Bit_reference& -<span class="lineNum"> 84 </span><span class="lineCov"> 2 : operator=(bool __x)</span> -<span class="lineNum"> 85 </span> : { -<span class="lineNum"> 86 </span><span class="lineCov"> 2 : if (__x)</span> -<span class="lineNum"> 87 </span><span class="lineCov"> 1 : *_M_p |= _M_mask;</span> -<span class="lineNum"> 88 </span> : else -<span class="lineNum"> 89 </span><span class="lineCov"> 1 : *_M_p &= ~_M_mask;</span> -<span class="lineNum"> 90 </span><span class="lineCov"> 2 : return *this;</span> -<span class="lineNum"> 91 </span> : } -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : _Bit_reference& -<span class="lineNum"> 94 </span><span class="lineNoCov"> 0 : operator=(const _Bit_reference& __x)</span> -<span class="lineNum"> 95 </span><span class="lineNoCov"> 0 : { return *this = bool(__x); }</span> -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : bool -<span class="lineNum"> 98 </span> : operator==(const _Bit_reference& __x) const -<span class="lineNum"> 99 </span> : { return bool(*this) == bool(__x); } -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : bool -<span class="lineNum"> 102 </span> : operator<(const _Bit_reference& __x) const -<span class="lineNum"> 103 </span> : { return !bool(*this) && bool(__x); } -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : void -<span class="lineNum"> 106 </span> : flip() -<span class="lineNum"> 107 </span> : { *_M_p ^= _M_mask; } -<span class="lineNum"> 108 </span> : }; -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : struct _Bit_iterator_base -<span class="lineNum"> 111 </span> : : public std::iterator<std::random_access_iterator_tag, bool> -<span class="lineNum"> 112 </span> : { -<span class="lineNum"> 113 </span> : _Bit_type * _M_p; -<span class="lineNum"> 114 </span> : unsigned int _M_offset; -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span><span class="lineCov"> 31 : _Bit_iterator_base(_Bit_type * __x, unsigned int __y)</span> -<span class="lineNum"> 117 </span><span class="lineCov"> 31 : : _M_p(__x), _M_offset(__y) { }</span> -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : void -<span class="lineNum"> 120 </span><span class="lineCov"> 2 : _M_bump_up()</span> -<span class="lineNum"> 121 </span> : { -<span class="lineNum"> 122 </span><span class="lineCov"> 2 : if (_M_offset++ == int(_S_word_bit) - 1)</span> -<span class="lineNum"> 123 </span> : { -<span class="lineNum"> 124 </span><span class="lineNoCov"> 0 : _M_offset = 0;</span> -<span class="lineNum"> 125 </span><span class="lineNoCov"> 0 : ++_M_p;</span> -<span class="lineNum"> 126 </span> : } -<span class="lineNum"> 127 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : void -<span class="lineNum"> 130 </span><span class="lineNoCov"> 0 : _M_bump_down()</span> -<span class="lineNum"> 131 </span> : { -<span class="lineNum"> 132 </span><span class="lineNoCov"> 0 : if (_M_offset-- == 0)</span> -<span class="lineNum"> 133 </span> : { -<span class="lineNum"> 134 </span><span class="lineNoCov"> 0 : _M_offset = int(_S_word_bit) - 1;</span> -<span class="lineNum"> 135 </span><span class="lineNoCov"> 0 : --_M_p;</span> -<span class="lineNum"> 136 </span> : } -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : void -<span class="lineNum"> 140 </span><span class="lineNoCov"> 0 : _M_incr(ptrdiff_t __i)</span> -<span class="lineNum"> 141 </span> : { -<span class="lineNum"> 142 </span><span class="lineNoCov"> 0 : difference_type __n = __i + _M_offset;</span> -<span class="lineNum"> 143 </span><span class="lineNoCov"> 0 : _M_p += __n / int(_S_word_bit);</span> -<span class="lineNum"> 144 </span><span class="lineNoCov"> 0 : __n = __n % int(_S_word_bit);</span> -<span class="lineNum"> 145 </span><span class="lineNoCov"> 0 : if (__n < 0)</span> -<span class="lineNum"> 146 </span> : { -<span class="lineNum"> 147 </span><span class="lineNoCov"> 0 : __n += int(_S_word_bit);</span> -<span class="lineNum"> 148 </span><span class="lineNoCov"> 0 : --_M_p;</span> -<span class="lineNum"> 149 </span> : } -<span class="lineNum"> 150 </span><span class="lineNoCov"> 0 : _M_offset = static_cast<unsigned int>(__n);</span> -<span class="lineNum"> 151 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : bool -<span class="lineNum"> 154 </span><span class="lineCov"> 3 : operator==(const _Bit_iterator_base& __i) const</span> -<span class="lineNum"> 155 </span><span class="lineCov"> 3 : { return _M_p == __i._M_p && _M_offset == __i._M_offset; }</span> -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : bool -<span class="lineNum"> 158 </span> : operator<(const _Bit_iterator_base& __i) const -<span class="lineNum"> 159 </span> : { -<span class="lineNum"> 160 </span> : return _M_p < __i._M_p -<span class="lineNum"> 161 </span> : || (_M_p == __i._M_p && _M_offset < __i._M_offset); -<span class="lineNum"> 162 </span> : } -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : bool -<span class="lineNum"> 165 </span> : operator!=(const _Bit_iterator_base& __i) const -<span class="lineNum"> 166 </span> : { return !(*this == __i); } -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : bool -<span class="lineNum"> 169 </span> : operator>(const _Bit_iterator_base& __i) const -<span class="lineNum"> 170 </span> : { return __i < *this; } -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : bool -<span class="lineNum"> 173 </span> : operator<=(const _Bit_iterator_base& __i) const -<span class="lineNum"> 174 </span> : { return !(__i < *this); } -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : bool -<span class="lineNum"> 177 </span> : operator>=(const _Bit_iterator_base& __i) const -<span class="lineNum"> 178 </span> : { return !(*this < __i); } -<span class="lineNum"> 179 </span> : }; -<span class="lineNum"> 180 </span> : -<span class="lineNum"> 181 </span> : inline ptrdiff_t -<span class="lineNum"> 182 </span><span class="lineCov"> 9 : operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)</span> -<span class="lineNum"> 183 </span> : { -<span class="lineNum"> 184 </span> : return (int(_S_word_bit) * (__x._M_p - __y._M_p) -<span class="lineNum"> 185 </span><span class="lineCov"> 9 : + __x._M_offset - __y._M_offset);</span> -<span class="lineNum"> 186 </span> : } -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : struct _Bit_iterator : public _Bit_iterator_base -<span class="lineNum"> 189 </span> : { -<span class="lineNum"> 190 </span> : typedef _Bit_reference reference; -<span class="lineNum"> 191 </span> : typedef _Bit_reference* pointer; -<span class="lineNum"> 192 </span> : typedef _Bit_iterator iterator; -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span><span class="lineCov"> 2 : _Bit_iterator() : _Bit_iterator_base(0, 0) { }</span> -<span class="lineNum"> 195 </span> : -<span class="lineNum"> 196 </span><span class="lineCov"> 3 : _Bit_iterator(_Bit_type * __x, unsigned int __y)</span> -<span class="lineNum"> 197 </span><span class="lineCov"> 3 : : _Bit_iterator_base(__x, __y) { }</span> -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : reference -<span class="lineNum"> 200 </span><span class="lineCov"> 2 : operator*() const</span> -<span class="lineNum"> 201 </span><span class="lineCov"> 2 : { return reference(_M_p, 1UL << _M_offset); }</span> -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : iterator& -<span class="lineNum"> 204 </span><span class="lineNoCov"> 0 : operator++()</span> -<span class="lineNum"> 205 </span> : { -<span class="lineNum"> 206 </span><span class="lineNoCov"> 0 : _M_bump_up();</span> -<span class="lineNum"> 207 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 208 </span> : } -<span class="lineNum"> 209 </span> : -<span class="lineNum"> 210 </span> : iterator -<span class="lineNum"> 211 </span><span class="lineCov"> 2 : operator++(int)</span> -<span class="lineNum"> 212 </span> : { -<span class="lineNum"> 213 </span><span class="lineCov"> 2 : iterator __tmp = *this;</span> -<span class="lineNum"> 214 </span><span class="lineCov"> 2 : _M_bump_up();</span> -<span class="lineNum"> 215 </span> : return __tmp; -<span class="lineNum"> 216 </span> : } -<span class="lineNum"> 217 </span> : -<span class="lineNum"> 218 </span> : iterator& -<span class="lineNum"> 219 </span><span class="lineNoCov"> 0 : operator--()</span> -<span class="lineNum"> 220 </span> : { -<span class="lineNum"> 221 </span><span class="lineNoCov"> 0 : _M_bump_down();</span> -<span class="lineNum"> 222 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 223 </span> : } -<span class="lineNum"> 224 </span> : -<span class="lineNum"> 225 </span> : iterator -<span class="lineNum"> 226 </span> : operator--(int) -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span> : iterator __tmp = *this; -<span class="lineNum"> 229 </span> : _M_bump_down(); -<span class="lineNum"> 230 </span> : return __tmp; -<span class="lineNum"> 231 </span> : } -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : iterator& -<span class="lineNum"> 234 </span><span class="lineNoCov"> 0 : operator+=(difference_type __i)</span> -<span class="lineNum"> 235 </span> : { -<span class="lineNum"> 236 </span><span class="lineNoCov"> 0 : _M_incr(__i);</span> -<span class="lineNum"> 237 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : iterator& -<span class="lineNum"> 241 </span> : operator-=(difference_type __i) -<span class="lineNum"> 242 </span> : { -<span class="lineNum"> 243 </span> : *this += -__i; -<span class="lineNum"> 244 </span> : return *this; -<span class="lineNum"> 245 </span> : } -<span class="lineNum"> 246 </span> : -<span class="lineNum"> 247 </span> : iterator -<span class="lineNum"> 248 </span><span class="lineNoCov"> 0 : operator+(difference_type __i) const</span> -<span class="lineNum"> 249 </span> : { -<span class="lineNum"> 250 </span><span class="lineNoCov"> 0 : iterator __tmp = *this;</span> -<span class="lineNum"> 251 </span><span class="lineNoCov"> 0 : return __tmp += __i;</span> -<span class="lineNum"> 252 </span> : } -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : iterator -<span class="lineNum"> 255 </span> : operator-(difference_type __i) const -<span class="lineNum"> 256 </span> : { -<span class="lineNum"> 257 </span> : iterator __tmp = *this; -<span class="lineNum"> 258 </span> : return __tmp -= __i; -<span class="lineNum"> 259 </span> : } -<span class="lineNum"> 260 </span> : -<span class="lineNum"> 261 </span> : reference -<span class="lineNum"> 262 </span> : operator[](difference_type __i) const -<span class="lineNum"> 263 </span> : { return *(*this + __i); } -<span class="lineNum"> 264 </span> : }; -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : inline _Bit_iterator -<span class="lineNum"> 267 </span> : operator+(ptrdiff_t __n, const _Bit_iterator& __x) -<span class="lineNum"> 268 </span> : { return __x + __n; } -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span> : struct _Bit_const_iterator : public _Bit_iterator_base -<span class="lineNum"> 271 </span> : { -<span class="lineNum"> 272 </span> : typedef bool reference; -<span class="lineNum"> 273 </span> : typedef bool const_reference; -<span class="lineNum"> 274 </span> : typedef const bool* pointer; -<span class="lineNum"> 275 </span> : typedef _Bit_const_iterator const_iterator; -<span class="lineNum"> 276 </span> : -<span class="lineNum"> 277 </span> : _Bit_const_iterator() : _Bit_iterator_base(0, 0) { } -<span class="lineNum"> 278 </span> : -<span class="lineNum"> 279 </span><span class="lineCov"> 4 : _Bit_const_iterator(_Bit_type * __x, unsigned int __y)</span> -<span class="lineNum"> 280 </span><span class="lineCov"> 4 : : _Bit_iterator_base(__x, __y) { }</span> -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span><span class="lineCov"> 22 : _Bit_const_iterator(const _Bit_iterator& __x)</span> -<span class="lineNum"> 283 </span><span class="lineCov"> 22 : : _Bit_iterator_base(__x._M_p, __x._M_offset) { }</span> -<span class="lineNum"> 284 </span> : -<span class="lineNum"> 285 </span> : const_reference -<span class="lineNum"> 286 </span><span class="lineCov"> 3 : operator*() const</span> -<span class="lineNum"> 287 </span><span class="lineCov"> 3 : { return _Bit_reference(_M_p, 1UL << _M_offset); }</span> -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : const_iterator& -<span class="lineNum"> 290 </span><span class="lineNoCov"> 0 : operator++()</span> -<span class="lineNum"> 291 </span> : { -<span class="lineNum"> 292 </span><span class="lineNoCov"> 0 : _M_bump_up();</span> -<span class="lineNum"> 293 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 294 </span> : } -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : const_iterator -<span class="lineNum"> 297 </span> : operator++(int) -<span class="lineNum"> 298 </span> : { -<span class="lineNum"> 299 </span> : const_iterator __tmp = *this; -<span class="lineNum"> 300 </span> : _M_bump_up(); -<span class="lineNum"> 301 </span> : return __tmp; -<span class="lineNum"> 302 </span> : } -<span class="lineNum"> 303 </span> : -<span class="lineNum"> 304 </span> : const_iterator& -<span class="lineNum"> 305 </span> : operator--() -<span class="lineNum"> 306 </span> : { -<span class="lineNum"> 307 </span> : _M_bump_down(); -<span class="lineNum"> 308 </span> : return *this; -<span class="lineNum"> 309 </span> : } -<span class="lineNum"> 310 </span> : -<span class="lineNum"> 311 </span> : const_iterator -<span class="lineNum"> 312 </span> : operator--(int) -<span class="lineNum"> 313 </span> : { -<span class="lineNum"> 314 </span> : const_iterator __tmp = *this; -<span class="lineNum"> 315 </span> : _M_bump_down(); -<span class="lineNum"> 316 </span> : return __tmp; -<span class="lineNum"> 317 </span> : } -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : const_iterator& -<span class="lineNum"> 320 </span> : operator+=(difference_type __i) -<span class="lineNum"> 321 </span> : { -<span class="lineNum"> 322 </span> : _M_incr(__i); -<span class="lineNum"> 323 </span> : return *this; -<span class="lineNum"> 324 </span> : } -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span> : const_iterator& -<span class="lineNum"> 327 </span> : operator-=(difference_type __i) -<span class="lineNum"> 328 </span> : { -<span class="lineNum"> 329 </span> : *this += -__i; -<span class="lineNum"> 330 </span> : return *this; -<span class="lineNum"> 331 </span> : } -<span class="lineNum"> 332 </span> : -<span class="lineNum"> 333 </span> : const_iterator -<span class="lineNum"> 334 </span> : operator+(difference_type __i) const -<span class="lineNum"> 335 </span> : { -<span class="lineNum"> 336 </span> : const_iterator __tmp = *this; -<span class="lineNum"> 337 </span> : return __tmp += __i; -<span class="lineNum"> 338 </span> : } -<span class="lineNum"> 339 </span> : -<span class="lineNum"> 340 </span> : const_iterator -<span class="lineNum"> 341 </span> : operator-(difference_type __i) const -<span class="lineNum"> 342 </span> : { -<span class="lineNum"> 343 </span> : const_iterator __tmp = *this; -<span class="lineNum"> 344 </span> : return __tmp -= __i; -<span class="lineNum"> 345 </span> : } -<span class="lineNum"> 346 </span> : -<span class="lineNum"> 347 </span> : const_reference -<span class="lineNum"> 348 </span> : operator[](difference_type __i) const -<span class="lineNum"> 349 </span> : { return *(*this + __i); } -<span class="lineNum"> 350 </span> : }; -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : inline _Bit_const_iterator -<span class="lineNum"> 353 </span> : operator+(ptrdiff_t __n, const _Bit_const_iterator& __x) -<span class="lineNum"> 354 </span> : { return __x + __n; } -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : inline void -<span class="lineNum"> 357 </span> : __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x) -<span class="lineNum"> 358 </span> : { -<span class="lineNum"> 359 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 360 </span> : *__first = __x; -<span class="lineNum"> 361 </span> : } -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : inline void -<span class="lineNum"> 364 </span> : fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x) -<span class="lineNum"> 365 </span> : { -<span class="lineNum"> 366 </span> : if (__first._M_p != __last._M_p) -<span class="lineNum"> 367 </span> : { -<span class="lineNum"> 368 </span> : std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0); -<span class="lineNum"> 369 </span> : __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x); -<span class="lineNum"> 370 </span> : __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); -<span class="lineNum"> 371 </span> : } -<span class="lineNum"> 372 </span> : else -<span class="lineNum"> 373 </span> : __fill_bvector(__first, __last, __x); -<span class="lineNum"> 374 </span> : } -<span class="lineNum"> 375 </span> : -<span class="lineNum"> 376 </span> : template<typename _Alloc> -<span class="lineNum"> 377 </span> : struct _Bvector_base -<span class="lineNum"> 378 </span> : { -<span class="lineNum"> 379 </span> : typedef typename _Alloc::template rebind<_Bit_type>::other -<span class="lineNum"> 380 </span> : _Bit_alloc_type; -<span class="lineNum"> 381 </span> : -<span class="lineNum"> 382 </span> : struct _Bvector_impl -<span class="lineNum"> 383 </span> : : public _Bit_alloc_type -<span class="lineNum"> 384 </span><span class="lineCov"> 1 : {</span> -<span class="lineNum"> 385 </span> : _Bit_iterator _M_start; -<span class="lineNum"> 386 </span> : _Bit_iterator _M_finish; -<span class="lineNum"> 387 </span> : _Bit_type* _M_end_of_storage; -<span class="lineNum"> 388 </span> : -<span class="lineNum"> 389 </span><span class="lineCov"> 1 : _Bvector_impl()</span> -<span class="lineNum"> 390 </span><span class="lineCov"> 1 : : _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage(0)</span> -<span class="lineNum"> 391 </span><span class="lineCov"> 1 : { }</span> -<span class="lineNum"> 392 </span> : -<span class="lineNum"> 393 </span> : _Bvector_impl(const _Bit_alloc_type& __a) -<span class="lineNum"> 394 </span> : : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0) -<span class="lineNum"> 395 </span> : { } -<span class="lineNum"> 396 </span> : }; -<span class="lineNum"> 397 </span> : -<span class="lineNum"> 398 </span> : public: -<span class="lineNum"> 399 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 400 </span> : -<span class="lineNum"> 401 </span> : _Bit_alloc_type& -<span class="lineNum"> 402 </span> : _M_get_Bit_allocator() -<span class="lineNum"> 403 </span> : { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); } -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : const _Bit_alloc_type& -<span class="lineNum"> 406 </span><span class="lineCov"> 2 : _M_get_Bit_allocator() const</span> -<span class="lineNum"> 407 </span><span class="lineCov"> 2 : { return *static_cast<const _Bit_alloc_type*>(&this->_M_impl); }</span> -<span class="lineNum"> 408 </span> : -<span class="lineNum"> 409 </span> : allocator_type -<span class="lineNum"> 410 </span> : get_allocator() const -<span class="lineNum"> 411 </span> : { return allocator_type(_M_get_Bit_allocator()); } -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span><span class="lineCov"> 1 : _Bvector_base()</span> -<span class="lineNum"> 414 </span><span class="lineCov"> 1 : : _M_impl() { }</span> -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : _Bvector_base(const allocator_type& __a) -<span class="lineNum"> 417 </span> : : _M_impl(__a) { } -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 420 </span> : _Bvector_base(_Bvector_base&& __x) -<span class="lineNum"> 421 </span> : : _M_impl(__x._M_get_Bit_allocator()) -<span class="lineNum"> 422 </span> : { -<span class="lineNum"> 423 </span> : this->_M_impl._M_start = __x._M_impl._M_start; -<span class="lineNum"> 424 </span> : this->_M_impl._M_finish = __x._M_impl._M_finish; -<span class="lineNum"> 425 </span> : this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage; -<span class="lineNum"> 426 </span> : __x._M_impl._M_start = _Bit_iterator(); -<span class="lineNum"> 427 </span> : __x._M_impl._M_finish = _Bit_iterator(); -<span class="lineNum"> 428 </span> : __x._M_impl._M_end_of_storage = 0; -<span class="lineNum"> 429 </span> : } -<span class="lineNum"> 430 </span> : #endif -<span class="lineNum"> 431 </span> : -<span class="lineNum"> 432 </span><span class="lineCov"> 1 : ~_Bvector_base()</span> -<span class="lineNum"> 433 </span><span class="lineCov"> 1 : { this->_M_deallocate(); }</span> -<span class="lineNum"> 434 </span> : -<span class="lineNum"> 435 </span> : protected: -<span class="lineNum"> 436 </span> : _Bvector_impl _M_impl; -<span class="lineNum"> 437 </span> : -<span class="lineNum"> 438 </span> : _Bit_type* -<span class="lineNum"> 439 </span><span class="lineCov"> 1 : _M_allocate(size_t __n)</span> -<span class="lineNum"> 440 </span> : { return _M_impl.allocate((__n + int(_S_word_bit) - 1) -<span class="lineNum"> 441 </span><span class="lineCov"> 1 : / int(_S_word_bit)); }</span> -<span class="lineNum"> 442 </span> : -<span class="lineNum"> 443 </span> : void -<span class="lineNum"> 444 </span><span class="lineCov"> 2 : _M_deallocate()</span> -<span class="lineNum"> 445 </span> : { -<span class="lineNum"> 446 </span><span class="lineCov"> 2 : if (_M_impl._M_start._M_p)</span> -<span class="lineNum"> 447 </span><span class="lineCov"> 1 : _M_impl.deallocate(_M_impl._M_start._M_p,</span> -<span class="lineNum"> 448 </span> : _M_impl._M_end_of_storage - _M_impl._M_start._M_p); -<span class="lineNum"> 449 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 450 </span> : }; -<span class="lineNum"> 451 </span> : -<span class="lineNum"> 452 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 453 </span> : -<span class="lineNum"> 454 </span> : // Declare a partial specialization of vector<T, Alloc>. -<span class="lineNum"> 455 </span> : #include <bits/stl_vector.h> -<span class="lineNum"> 456 </span> : -<span class="lineNum"> 457 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 458 </span> : -<span class="lineNum"> 459 </span> : /** -<span class="lineNum"> 460 </span> : * @brief A specialization of vector for booleans which offers fixed time -<span class="lineNum"> 461 </span> : * access to individual elements in any order. -<span class="lineNum"> 462 </span> : * -<span class="lineNum"> 463 </span> : * Note that vector<bool> does not actually meet the requirements for being -<span class="lineNum"> 464 </span> : * a container. This is because the reference and pointer types are not -<span class="lineNum"> 465 </span> : * really references and pointers to bool. See DR96 for details. @see -<span class="lineNum"> 466 </span> : * vector for function documentation. -<span class="lineNum"> 467 </span> : * -<span class="lineNum"> 468 </span> : * @ingroup Containers -<span class="lineNum"> 469 </span> : * @ingroup Sequences -<span class="lineNum"> 470 </span> : * -<span class="lineNum"> 471 </span> : * In some terminology a %vector can be described as a dynamic -<span class="lineNum"> 472 </span> : * C-style array, it offers fast and efficient access to individual -<span class="lineNum"> 473 </span> : * elements in any order and saves the user from worrying about -<span class="lineNum"> 474 </span> : * memory and size allocation. Subscripting ( @c [] ) access is -<span class="lineNum"> 475 </span> : * also provided as with C-style arrays. -<span class="lineNum"> 476 </span> : */ -<span class="lineNum"> 477 </span> : template<typename _Alloc> -<span class="lineNum"> 478 </span> : class vector<bool, _Alloc> : protected _Bvector_base<_Alloc> -<span class="lineNum"> 479 </span> : { -<span class="lineNum"> 480 </span> : typedef _Bvector_base<_Alloc> _Base; -<span class="lineNum"> 481 </span> : -<span class="lineNum"> 482 </span> : public: -<span class="lineNum"> 483 </span> : typedef bool value_type; -<span class="lineNum"> 484 </span> : typedef size_t size_type; -<span class="lineNum"> 485 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 486 </span> : typedef _Bit_reference reference; -<span class="lineNum"> 487 </span> : typedef bool const_reference; -<span class="lineNum"> 488 </span> : typedef _Bit_reference* pointer; -<span class="lineNum"> 489 </span> : typedef const bool* const_pointer; -<span class="lineNum"> 490 </span> : typedef _Bit_iterator iterator; -<span class="lineNum"> 491 </span> : typedef _Bit_const_iterator const_iterator; -<span class="lineNum"> 492 </span> : typedef std::reverse_iterator<const_iterator> const_reverse_iterator; -<span class="lineNum"> 493 </span> : typedef std::reverse_iterator<iterator> reverse_iterator; -<span class="lineNum"> 494 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 495 </span> : -<span class="lineNum"> 496 </span> : allocator_type get_allocator() const -<span class="lineNum"> 497 </span> : { return _Base::get_allocator(); } -<span class="lineNum"> 498 </span> : -<span class="lineNum"> 499 </span> : protected: -<span class="lineNum"> 500 </span> : using _Base::_M_allocate; -<span class="lineNum"> 501 </span> : using _Base::_M_deallocate; -<span class="lineNum"> 502 </span> : using _Base::_M_get_Bit_allocator; -<span class="lineNum"> 503 </span> : -<span class="lineNum"> 504 </span> : public: -<span class="lineNum"> 505 </span><span class="lineCov"> 1 : vector()</span> -<span class="lineNum"> 506 </span><span class="lineCov"> 1 : : _Base() { }</span> -<span class="lineNum"> 507 </span> : -<span class="lineNum"> 508 </span> : explicit -<span class="lineNum"> 509 </span> : vector(const allocator_type& __a) -<span class="lineNum"> 510 </span> : : _Base(__a) { } -<span class="lineNum"> 511 </span> : -<span class="lineNum"> 512 </span> : explicit -<span class="lineNum"> 513 </span> : vector(size_type __n, const bool& __value = bool(), -<span class="lineNum"> 514 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 515 </span> : : _Base(__a) -<span class="lineNum"> 516 </span> : { -<span class="lineNum"> 517 </span> : _M_initialize(__n); -<span class="lineNum"> 518 </span> : std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage, -<span class="lineNum"> 519 </span> : __value ? ~0 : 0); -<span class="lineNum"> 520 </span> : } -<span class="lineNum"> 521 </span> : -<span class="lineNum"> 522 </span> : vector(const vector& __x) -<span class="lineNum"> 523 </span> : : _Base(__x._M_get_Bit_allocator()) -<span class="lineNum"> 524 </span> : { -<span class="lineNum"> 525 </span> : _M_initialize(__x.size()); -<span class="lineNum"> 526 </span> : _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start); -<span class="lineNum"> 527 </span> : } -<span class="lineNum"> 528 </span> : -<span class="lineNum"> 529 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 530 </span> : vector(vector&& __x) -<span class="lineNum"> 531 </span> : : _Base(std::forward<_Base>(__x)) { } -<span class="lineNum"> 532 </span> : #endif -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : template<typename _InputIterator> -<span class="lineNum"> 535 </span> : vector(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 536 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 537 </span> : : _Base(__a) -<span class="lineNum"> 538 </span> : { -<span class="lineNum"> 539 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 540 </span> : _M_initialize_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 541 </span> : } -<span class="lineNum"> 542 </span> : -<span class="lineNum"> 543 </span><span class="lineCov"> 1 : ~vector() { }</span> -<span class="lineNum"> 544 </span> : -<span class="lineNum"> 545 </span> : vector& -<span class="lineNum"> 546 </span> : operator=(const vector& __x) -<span class="lineNum"> 547 </span> : { -<span class="lineNum"> 548 </span> : if (&__x == this) -<span class="lineNum"> 549 </span> : return *this; -<span class="lineNum"> 550 </span> : if (__x.size() > capacity()) -<span class="lineNum"> 551 </span> : { -<span class="lineNum"> 552 </span> : this->_M_deallocate(); -<span class="lineNum"> 553 </span> : _M_initialize(__x.size()); -<span class="lineNum"> 554 </span> : } -<span class="lineNum"> 555 </span> : this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(), -<span class="lineNum"> 556 </span> : begin()); -<span class="lineNum"> 557 </span> : return *this; -<span class="lineNum"> 558 </span> : } -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 561 </span> : vector& -<span class="lineNum"> 562 </span> : operator=(vector&& __x) -<span class="lineNum"> 563 </span> : { -<span class="lineNum"> 564 </span> : // NB: DR 675. -<span class="lineNum"> 565 </span> : this->clear(); -<span class="lineNum"> 566 </span> : this->swap(__x); -<span class="lineNum"> 567 </span> : return *this; -<span class="lineNum"> 568 </span> : } -<span class="lineNum"> 569 </span> : #endif -<span class="lineNum"> 570 </span> : -<span class="lineNum"> 571 </span> : // assign(), a generalized assignment member function. Two -<span class="lineNum"> 572 </span> : // versions: one that takes a count, and one that takes a range. -<span class="lineNum"> 573 </span> : // The range version is a member template, so we dispatch on whether -<span class="lineNum"> 574 </span> : // or not the type is an integer. -<span class="lineNum"> 575 </span> : void -<span class="lineNum"> 576 </span> : assign(size_type __n, const bool& __x) -<span class="lineNum"> 577 </span> : { _M_fill_assign(__n, __x); } -<span class="lineNum"> 578 </span> : -<span class="lineNum"> 579 </span> : template<typename _InputIterator> -<span class="lineNum"> 580 </span> : void -<span class="lineNum"> 581 </span> : assign(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 582 </span> : { -<span class="lineNum"> 583 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 584 </span> : _M_assign_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 585 </span> : } -<span class="lineNum"> 586 </span> : -<span class="lineNum"> 587 </span> : iterator -<span class="lineNum"> 588 </span><span class="lineCov"> 1 : begin()</span> -<span class="lineNum"> 589 </span><span class="lineCov"> 1 : { return this->_M_impl._M_start; }</span> -<span class="lineNum"> 590 </span> : -<span class="lineNum"> 591 </span> : const_iterator -<span class="lineNum"> 592 </span><span class="lineCov"> 10 : begin() const</span> -<span class="lineNum"> 593 </span><span class="lineCov"> 10 : { return this->_M_impl._M_start; }</span> -<span class="lineNum"> 594 </span> : -<span class="lineNum"> 595 </span> : iterator -<span class="lineNum"> 596 </span><span class="lineCov"> 2 : end()</span> -<span class="lineNum"> 597 </span><span class="lineCov"> 2 : { return this->_M_impl._M_finish; }</span> -<span class="lineNum"> 598 </span> : -<span class="lineNum"> 599 </span> : const_iterator -<span class="lineNum"> 600 </span><span class="lineCov"> 10 : end() const</span> -<span class="lineNum"> 601 </span><span class="lineCov"> 10 : { return this->_M_impl._M_finish; }</span> -<span class="lineNum"> 602 </span> : -<span class="lineNum"> 603 </span> : reverse_iterator -<span class="lineNum"> 604 </span> : rbegin() -<span class="lineNum"> 605 </span> : { return reverse_iterator(end()); } -<span class="lineNum"> 606 </span> : -<span class="lineNum"> 607 </span> : const_reverse_iterator -<span class="lineNum"> 608 </span> : rbegin() const -<span class="lineNum"> 609 </span> : { return const_reverse_iterator(end()); } -<span class="lineNum"> 610 </span> : -<span class="lineNum"> 611 </span> : reverse_iterator -<span class="lineNum"> 612 </span> : rend() -<span class="lineNum"> 613 </span> : { return reverse_iterator(begin()); } -<span class="lineNum"> 614 </span> : -<span class="lineNum"> 615 </span> : const_reverse_iterator -<span class="lineNum"> 616 </span> : rend() const -<span class="lineNum"> 617 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 618 </span> : -<span class="lineNum"> 619 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 620 </span> : const_iterator -<span class="lineNum"> 621 </span> : cbegin() const -<span class="lineNum"> 622 </span> : { return this->_M_impl._M_start; } -<span class="lineNum"> 623 </span> : -<span class="lineNum"> 624 </span> : const_iterator -<span class="lineNum"> 625 </span> : cend() const -<span class="lineNum"> 626 </span> : { return this->_M_impl._M_finish; } -<span class="lineNum"> 627 </span> : -<span class="lineNum"> 628 </span> : const_reverse_iterator -<span class="lineNum"> 629 </span> : crbegin() const -<span class="lineNum"> 630 </span> : { return const_reverse_iterator(end()); } -<span class="lineNum"> 631 </span> : -<span class="lineNum"> 632 </span> : const_reverse_iterator -<span class="lineNum"> 633 </span> : crend() const -<span class="lineNum"> 634 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 635 </span> : #endif -<span class="lineNum"> 636 </span> : -<span class="lineNum"> 637 </span> : size_type -<span class="lineNum"> 638 </span><span class="lineCov"> 7 : size() const</span> -<span class="lineNum"> 639 </span><span class="lineCov"> 7 : { return size_type(end() - begin()); }</span> -<span class="lineNum"> 640 </span> : -<span class="lineNum"> 641 </span> : size_type -<span class="lineNum"> 642 </span><span class="lineCov"> 2 : max_size() const</span> -<span class="lineNum"> 643 </span> : { -<span class="lineNum"> 644 </span> : const size_type __isize = -<span class="lineNum"> 645 </span> : __gnu_cxx::__numeric_traits<difference_type>::__max -<span class="lineNum"> 646 </span><span class="lineCov"> 2 : - int(_S_word_bit) + 1;</span> -<span class="lineNum"> 647 </span><span class="lineCov"> 2 : const size_type __asize = _M_get_Bit_allocator().max_size();</span> -<span class="lineNum"> 648 </span> : return (__asize <= __isize / int(_S_word_bit) -<span class="lineNum"> 649 </span><span class="lineCov"> 2 : ? __asize * int(_S_word_bit) : __isize);</span> -<span class="lineNum"> 650 </span> : } -<span class="lineNum"> 651 </span> : -<span class="lineNum"> 652 </span> : size_type -<span class="lineNum"> 653 </span> : capacity() const -<span class="lineNum"> 654 </span> : { return size_type(const_iterator(this->_M_impl._M_end_of_storage, 0) -<span class="lineNum"> 655 </span> : - begin()); } -<span class="lineNum"> 656 </span> : -<span class="lineNum"> 657 </span> : bool -<span class="lineNum"> 658 </span><span class="lineCov"> 3 : empty() const</span> -<span class="lineNum"> 659 </span><span class="lineCov"> 3 : { return begin() == end(); }</span> -<span class="lineNum"> 660 </span> : -<span class="lineNum"> 661 </span> : reference -<span class="lineNum"> 662 </span> : operator[](size_type __n) -<span class="lineNum"> 663 </span> : { -<span class="lineNum"> 664 </span> : return *iterator(this->_M_impl._M_start._M_p -<span class="lineNum"> 665 </span> : + __n / int(_S_word_bit), __n % int(_S_word_bit)); -<span class="lineNum"> 666 </span> : } -<span class="lineNum"> 667 </span> : -<span class="lineNum"> 668 </span> : const_reference -<span class="lineNum"> 669 </span><span class="lineCov"> 3 : operator[](size_type __n) const</span> -<span class="lineNum"> 670 </span> : { -<span class="lineNum"> 671 </span> : return *const_iterator(this->_M_impl._M_start._M_p -<span class="lineNum"> 672 </span><span class="lineCov"> 3 : + __n / int(_S_word_bit), __n % int(_S_word_bit));</span> -<span class="lineNum"> 673 </span> : } -<span class="lineNum"> 674 </span> : -<span class="lineNum"> 675 </span> : protected: -<span class="lineNum"> 676 </span> : void -<span class="lineNum"> 677 </span> : _M_range_check(size_type __n) const -<span class="lineNum"> 678 </span> : { -<span class="lineNum"> 679 </span> : if (__n >= this->size()) -<span class="lineNum"> 680 </span> : __throw_out_of_range(__N("vector<bool>::_M_range_check")); -<span class="lineNum"> 681 </span> : } -<span class="lineNum"> 682 </span> : -<span class="lineNum"> 683 </span> : public: -<span class="lineNum"> 684 </span> : reference -<span class="lineNum"> 685 </span> : at(size_type __n) -<span class="lineNum"> 686 </span> : { _M_range_check(__n); return (*this)[__n]; } -<span class="lineNum"> 687 </span> : -<span class="lineNum"> 688 </span> : const_reference -<span class="lineNum"> 689 </span> : at(size_type __n) const -<span class="lineNum"> 690 </span> : { _M_range_check(__n); return (*this)[__n]; } -<span class="lineNum"> 691 </span> : -<span class="lineNum"> 692 </span> : void -<span class="lineNum"> 693 </span> : reserve(size_type __n); -<span class="lineNum"> 694 </span> : -<span class="lineNum"> 695 </span> : reference -<span class="lineNum"> 696 </span> : front() -<span class="lineNum"> 697 </span> : { return *begin(); } -<span class="lineNum"> 698 </span> : -<span class="lineNum"> 699 </span> : const_reference -<span class="lineNum"> 700 </span> : front() const -<span class="lineNum"> 701 </span> : { return *begin(); } -<span class="lineNum"> 702 </span> : -<span class="lineNum"> 703 </span> : reference -<span class="lineNum"> 704 </span> : back() -<span class="lineNum"> 705 </span> : { return *(end() - 1); } -<span class="lineNum"> 706 </span> : -<span class="lineNum"> 707 </span> : const_reference -<span class="lineNum"> 708 </span> : back() const -<span class="lineNum"> 709 </span> : { return *(end() - 1); } -<span class="lineNum"> 710 </span> : -<span class="lineNum"> 711 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 712 </span> : // DR 464. Suggestion for new member functions in standard containers. -<span class="lineNum"> 713 </span> : // N.B. DR 464 says nothing about vector<bool> but we need something -<span class="lineNum"> 714 </span> : // here due to the way we are implementing DR 464 in the debug-mode -<span class="lineNum"> 715 </span> : // vector class. -<span class="lineNum"> 716 </span> : void -<span class="lineNum"> 717 </span> : data() { } -<span class="lineNum"> 718 </span> : -<span class="lineNum"> 719 </span> : void -<span class="lineNum"> 720 </span><span class="lineCov"> 2 : push_back(bool __x)</span> -<span class="lineNum"> 721 </span> : { -<span class="lineNum"> 722 </span><span class="lineCov"> 2 : if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)</span> -<span class="lineNum"> 723 </span><span class="lineCov"> 1 : *this->_M_impl._M_finish++ = __x;</span> -<span class="lineNum"> 724 </span> : else -<span class="lineNum"> 725 </span><span class="lineCov"> 1 : _M_insert_aux(end(), __x);</span> -<span class="lineNum"> 726 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 727 </span> : -<span class="lineNum"> 728 </span> : void -<span class="lineNum"> 729 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 730 </span> : swap(vector&& __x) -<span class="lineNum"> 731 </span> : #else -<span class="lineNum"> 732 </span> : swap(vector& __x) -<span class="lineNum"> 733 </span> : #endif -<span class="lineNum"> 734 </span> : { -<span class="lineNum"> 735 </span> : std::swap(this->_M_impl._M_start, __x._M_impl._M_start); -<span class="lineNum"> 736 </span> : std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); -<span class="lineNum"> 737 </span> : std::swap(this->_M_impl._M_end_of_storage, -<span class="lineNum"> 738 </span> : __x._M_impl._M_end_of_storage); -<span class="lineNum"> 739 </span> : -<span class="lineNum"> 740 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 741 </span> : // 431. Swapping containers with unequal allocators. -<span class="lineNum"> 742 </span> : std::__alloc_swap<typename _Base::_Bit_alloc_type>:: -<span class="lineNum"> 743 </span> : _S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator()); -<span class="lineNum"> 744 </span> : } -<span class="lineNum"> 745 </span> : -<span class="lineNum"> 746 </span> : // [23.2.5]/1, third-to-last entry in synopsis listing -<span class="lineNum"> 747 </span> : static void -<span class="lineNum"> 748 </span> : swap(reference __x, reference __y) -<span class="lineNum"> 749 </span> : { -<span class="lineNum"> 750 </span> : bool __tmp = __x; -<span class="lineNum"> 751 </span> : __x = __y; -<span class="lineNum"> 752 </span> : __y = __tmp; -<span class="lineNum"> 753 </span> : } -<span class="lineNum"> 754 </span> : -<span class="lineNum"> 755 </span> : iterator -<span class="lineNum"> 756 </span> : insert(iterator __position, const bool& __x = bool()) -<span class="lineNum"> 757 </span> : { -<span class="lineNum"> 758 </span> : const difference_type __n = __position - begin(); -<span class="lineNum"> 759 </span> : if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage -<span class="lineNum"> 760 </span> : && __position == end()) -<span class="lineNum"> 761 </span> : *this->_M_impl._M_finish++ = __x; -<span class="lineNum"> 762 </span> : else -<span class="lineNum"> 763 </span> : _M_insert_aux(__position, __x); -<span class="lineNum"> 764 </span> : return begin() + __n; -<span class="lineNum"> 765 </span> : } -<span class="lineNum"> 766 </span> : -<span class="lineNum"> 767 </span> : template<typename _InputIterator> -<span class="lineNum"> 768 </span> : void -<span class="lineNum"> 769 </span> : insert(iterator __position, -<span class="lineNum"> 770 </span> : _InputIterator __first, _InputIterator __last) -<span class="lineNum"> 771 </span> : { -<span class="lineNum"> 772 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 773 </span> : _M_insert_dispatch(__position, __first, __last, _Integral()); -<span class="lineNum"> 774 </span> : } -<span class="lineNum"> 775 </span> : -<span class="lineNum"> 776 </span> : void -<span class="lineNum"> 777 </span> : insert(iterator __position, size_type __n, const bool& __x) -<span class="lineNum"> 778 </span> : { _M_fill_insert(__position, __n, __x); } -<span class="lineNum"> 779 </span> : -<span class="lineNum"> 780 </span> : void -<span class="lineNum"> 781 </span> : pop_back() -<span class="lineNum"> 782 </span> : { --this->_M_impl._M_finish; } -<span class="lineNum"> 783 </span> : -<span class="lineNum"> 784 </span> : iterator -<span class="lineNum"> 785 </span> : erase(iterator __position) -<span class="lineNum"> 786 </span> : { -<span class="lineNum"> 787 </span> : if (__position + 1 != end()) -<span class="lineNum"> 788 </span> : std::copy(__position + 1, end(), __position); -<span class="lineNum"> 789 </span> : --this->_M_impl._M_finish; -<span class="lineNum"> 790 </span> : return __position; -<span class="lineNum"> 791 </span> : } -<span class="lineNum"> 792 </span> : -<span class="lineNum"> 793 </span> : iterator -<span class="lineNum"> 794 </span> : erase(iterator __first, iterator __last) -<span class="lineNum"> 795 </span> : { -<span class="lineNum"> 796 </span> : _M_erase_at_end(std::copy(__last, end(), __first)); -<span class="lineNum"> 797 </span> : return __first; -<span class="lineNum"> 798 </span> : } -<span class="lineNum"> 799 </span> : -<span class="lineNum"> 800 </span> : void -<span class="lineNum"> 801 </span> : resize(size_type __new_size, bool __x = bool()) -<span class="lineNum"> 802 </span> : { -<span class="lineNum"> 803 </span> : if (__new_size < size()) -<span class="lineNum"> 804 </span> : _M_erase_at_end(begin() + difference_type(__new_size)); -<span class="lineNum"> 805 </span> : else -<span class="lineNum"> 806 </span> : insert(end(), __new_size - size(), __x); -<span class="lineNum"> 807 </span> : } -<span class="lineNum"> 808 </span> : -<span class="lineNum"> 809 </span> : void -<span class="lineNum"> 810 </span> : flip() -<span class="lineNum"> 811 </span> : { -<span class="lineNum"> 812 </span> : for (_Bit_type * __p = this->_M_impl._M_start._M_p; -<span class="lineNum"> 813 </span> : __p != this->_M_impl._M_end_of_storage; ++__p) -<span class="lineNum"> 814 </span> : *__p = ~*__p; -<span class="lineNum"> 815 </span> : } -<span class="lineNum"> 816 </span> : -<span class="lineNum"> 817 </span> : void -<span class="lineNum"> 818 </span> : clear() -<span class="lineNum"> 819 </span> : { _M_erase_at_end(begin()); } -<span class="lineNum"> 820 </span> : -<span class="lineNum"> 821 </span> : -<span class="lineNum"> 822 </span> : protected: -<span class="lineNum"> 823 </span> : // Precondition: __first._M_offset == 0 && __result._M_offset == 0. -<span class="lineNum"> 824 </span> : iterator -<span class="lineNum"> 825 </span> : _M_copy_aligned(const_iterator __first, const_iterator __last, -<span class="lineNum"> 826 </span><span class="lineCov"> 1 : iterator __result)</span> -<span class="lineNum"> 827 </span> : { -<span class="lineNum"> 828 </span><span class="lineCov"> 1 : _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);</span> -<span class="lineNum"> 829 </span> : return std::copy(const_iterator(__last._M_p, 0), __last, -<span class="lineNum"> 830 </span><span class="lineCov"> 1 : iterator(__q, 0));</span> -<span class="lineNum"> 831 </span> : } -<span class="lineNum"> 832 </span> : -<span class="lineNum"> 833 </span> : void -<span class="lineNum"> 834 </span> : _M_initialize(size_type __n) -<span class="lineNum"> 835 </span> : { -<span class="lineNum"> 836 </span> : _Bit_type* __q = this->_M_allocate(__n); -<span class="lineNum"> 837 </span> : this->_M_impl._M_end_of_storage = (__q -<span class="lineNum"> 838 </span> : + ((__n + int(_S_word_bit) - 1) -<span class="lineNum"> 839 </span> : / int(_S_word_bit))); -<span class="lineNum"> 840 </span> : this->_M_impl._M_start = iterator(__q, 0); -<span class="lineNum"> 841 </span> : this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n); -<span class="lineNum"> 842 </span> : } -<span class="lineNum"> 843 </span> : -<span class="lineNum"> 844 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 845 </span> : -<span class="lineNum"> 846 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 847 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 848 </span> : template<typename _Integer> -<span class="lineNum"> 849 </span> : void -<span class="lineNum"> 850 </span> : _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) -<span class="lineNum"> 851 </span> : { -<span class="lineNum"> 852 </span> : _M_initialize(static_cast<size_type>(__n)); -<span class="lineNum"> 853 </span> : std::fill(this->_M_impl._M_start._M_p, -<span class="lineNum"> 854 </span> : this->_M_impl._M_end_of_storage, __x ? ~0 : 0); -<span class="lineNum"> 855 </span> : } -<span class="lineNum"> 856 </span> : -<span class="lineNum"> 857 </span> : template<typename _InputIterator> -<span class="lineNum"> 858 </span> : void -<span class="lineNum"> 859 </span> : _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 860 </span> : __false_type) -<span class="lineNum"> 861 </span> : { _M_initialize_range(__first, __last, -<span class="lineNum"> 862 </span> : std::__iterator_category(__first)); } -<span class="lineNum"> 863 </span> : -<span class="lineNum"> 864 </span> : template<typename _InputIterator> -<span class="lineNum"> 865 </span> : void -<span class="lineNum"> 866 </span> : _M_initialize_range(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 867 </span> : std::input_iterator_tag) -<span class="lineNum"> 868 </span> : { -<span class="lineNum"> 869 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 870 </span> : push_back(*__first); -<span class="lineNum"> 871 </span> : } -<span class="lineNum"> 872 </span> : -<span class="lineNum"> 873 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 874 </span> : void -<span class="lineNum"> 875 </span> : _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 876 </span> : std::forward_iterator_tag) -<span class="lineNum"> 877 </span> : { -<span class="lineNum"> 878 </span> : const size_type __n = std::distance(__first, __last); -<span class="lineNum"> 879 </span> : _M_initialize(__n); -<span class="lineNum"> 880 </span> : std::copy(__first, __last, this->_M_impl._M_start); -<span class="lineNum"> 881 </span> : } -<span class="lineNum"> 882 </span> : -<span class="lineNum"> 883 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 884 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 885 </span> : template<typename _Integer> -<span class="lineNum"> 886 </span> : void -<span class="lineNum"> 887 </span> : _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) -<span class="lineNum"> 888 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 889 </span> : -<span class="lineNum"> 890 </span> : template<class _InputIterator> -<span class="lineNum"> 891 </span> : void -<span class="lineNum"> 892 </span> : _M_assign_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 893 </span> : __false_type) -<span class="lineNum"> 894 </span> : { _M_assign_aux(__first, __last, std::__iterator_category(__first)); } -<span class="lineNum"> 895 </span> : -<span class="lineNum"> 896 </span> : void -<span class="lineNum"> 897 </span> : _M_fill_assign(size_t __n, bool __x) -<span class="lineNum"> 898 </span> : { -<span class="lineNum"> 899 </span> : if (__n > size()) -<span class="lineNum"> 900 </span> : { -<span class="lineNum"> 901 </span> : std::fill(this->_M_impl._M_start._M_p, -<span class="lineNum"> 902 </span> : this->_M_impl._M_end_of_storage, __x ? ~0 : 0); -<span class="lineNum"> 903 </span> : insert(end(), __n - size(), __x); -<span class="lineNum"> 904 </span> : } -<span class="lineNum"> 905 </span> : else -<span class="lineNum"> 906 </span> : { -<span class="lineNum"> 907 </span> : _M_erase_at_end(begin() + __n); -<span class="lineNum"> 908 </span> : std::fill(this->_M_impl._M_start._M_p, -<span class="lineNum"> 909 </span> : this->_M_impl._M_end_of_storage, __x ? ~0 : 0); -<span class="lineNum"> 910 </span> : } -<span class="lineNum"> 911 </span> : } -<span class="lineNum"> 912 </span> : -<span class="lineNum"> 913 </span> : template<typename _InputIterator> -<span class="lineNum"> 914 </span> : void -<span class="lineNum"> 915 </span> : _M_assign_aux(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 916 </span> : std::input_iterator_tag) -<span class="lineNum"> 917 </span> : { -<span class="lineNum"> 918 </span> : iterator __cur = begin(); -<span class="lineNum"> 919 </span> : for (; __first != __last && __cur != end(); ++__cur, ++__first) -<span class="lineNum"> 920 </span> : *__cur = *__first; -<span class="lineNum"> 921 </span> : if (__first == __last) -<span class="lineNum"> 922 </span> : _M_erase_at_end(__cur); -<span class="lineNum"> 923 </span> : else -<span class="lineNum"> 924 </span> : insert(end(), __first, __last); -<span class="lineNum"> 925 </span> : } -<span class="lineNum"> 926 </span> : -<span class="lineNum"> 927 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 928 </span> : void -<span class="lineNum"> 929 </span> : _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 930 </span> : std::forward_iterator_tag) -<span class="lineNum"> 931 </span> : { -<span class="lineNum"> 932 </span> : const size_type __len = std::distance(__first, __last); -<span class="lineNum"> 933 </span> : if (__len < size()) -<span class="lineNum"> 934 </span> : _M_erase_at_end(std::copy(__first, __last, begin())); -<span class="lineNum"> 935 </span> : else -<span class="lineNum"> 936 </span> : { -<span class="lineNum"> 937 </span> : _ForwardIterator __mid = __first; -<span class="lineNum"> 938 </span> : std::advance(__mid, size()); -<span class="lineNum"> 939 </span> : std::copy(__first, __mid, begin()); -<span class="lineNum"> 940 </span> : insert(end(), __mid, __last); -<span class="lineNum"> 941 </span> : } -<span class="lineNum"> 942 </span> : } -<span class="lineNum"> 943 </span> : -<span class="lineNum"> 944 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 945 </span> : -<span class="lineNum"> 946 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 947 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 948 </span> : template<typename _Integer> -<span class="lineNum"> 949 </span> : void -<span class="lineNum"> 950 </span> : _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, -<span class="lineNum"> 951 </span> : __true_type) -<span class="lineNum"> 952 </span> : { _M_fill_insert(__pos, __n, __x); } -<span class="lineNum"> 953 </span> : -<span class="lineNum"> 954 </span> : template<typename _InputIterator> -<span class="lineNum"> 955 </span> : void -<span class="lineNum"> 956 </span> : _M_insert_dispatch(iterator __pos, -<span class="lineNum"> 957 </span> : _InputIterator __first, _InputIterator __last, -<span class="lineNum"> 958 </span> : __false_type) -<span class="lineNum"> 959 </span> : { _M_insert_range(__pos, __first, __last, -<span class="lineNum"> 960 </span> : std::__iterator_category(__first)); } -<span class="lineNum"> 961 </span> : -<span class="lineNum"> 962 </span> : void -<span class="lineNum"> 963 </span> : _M_fill_insert(iterator __position, size_type __n, bool __x); -<span class="lineNum"> 964 </span> : -<span class="lineNum"> 965 </span> : template<typename _InputIterator> -<span class="lineNum"> 966 </span> : void -<span class="lineNum"> 967 </span> : _M_insert_range(iterator __pos, _InputIterator __first, -<span class="lineNum"> 968 </span> : _InputIterator __last, std::input_iterator_tag) -<span class="lineNum"> 969 </span> : { -<span class="lineNum"> 970 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 971 </span> : { -<span class="lineNum"> 972 </span> : __pos = insert(__pos, *__first); -<span class="lineNum"> 973 </span> : ++__pos; -<span class="lineNum"> 974 </span> : } -<span class="lineNum"> 975 </span> : } -<span class="lineNum"> 976 </span> : -<span class="lineNum"> 977 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 978 </span> : void -<span class="lineNum"> 979 </span> : _M_insert_range(iterator __position, _ForwardIterator __first, -<span class="lineNum"> 980 </span> : _ForwardIterator __last, std::forward_iterator_tag); -<span class="lineNum"> 981 </span> : -<span class="lineNum"> 982 </span> : void -<span class="lineNum"> 983 </span> : _M_insert_aux(iterator __position, bool __x); -<span class="lineNum"> 984 </span> : -<span class="lineNum"> 985 </span> : size_type -<span class="lineNum"> 986 </span><span class="lineCov"> 1 : _M_check_len(size_type __n, const char* __s) const</span> -<span class="lineNum"> 987 </span> : { -<span class="lineNum"> 988 </span><span class="lineCov"> 1 : if (max_size() - size() < __n)</span> -<span class="lineNum"> 989 </span><span class="lineNoCov"> 0 : __throw_length_error(__N(__s));</span> -<span class="lineNum"> 990 </span> : -<span class="lineNum"> 991 </span><span class="lineCov"> 1 : const size_type __len = size() + std::max(size(), __n);</span> -<span class="lineNum"> 992 </span><span class="lineCov"> 1 : return (__len < size() || __len > max_size()) ? max_size() : __len;</span> -<span class="lineNum"> 993 </span> : } -<span class="lineNum"> 994 </span> : -<span class="lineNum"> 995 </span> : void -<span class="lineNum"> 996 </span> : _M_erase_at_end(iterator __pos) -<span class="lineNum"> 997 </span> : { this->_M_impl._M_finish = __pos; } -<span class="lineNum"> 998 </span> : }; -<span class="lineNum"> 999 </span> : -<span class="lineNum"> 1000 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 1001 </span> : -<span class="lineNum"> 1002 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_construct.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_construct.h.gcov.html deleted file mode 100644 index 82847c7..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_construct.h.gcov.html +++ /dev/null @@ -1,201 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_construct.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_construct.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // nonstandard construct and destroy functions -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_construct.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_CONSTRUCT_H -<span class="lineNum"> 63 </span> : #define _STL_CONSTRUCT_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <new> -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : /** -<span class="lineNum"> 70 </span> : * Constructs an object in existing memory by invoking an allocated -<span class="lineNum"> 71 </span> : * object's constructor with an initializer. -<span class="lineNum"> 72 </span> : */ -<span class="lineNum"> 73 </span> : template<typename _T1, typename _T2> -<span class="lineNum"> 74 </span> : inline void -<span class="lineNum"> 75 </span><span class="lineCov"> 23695 : _Construct(_T1* __p, const _T2& __value)</span> -<span class="lineNum"> 76 </span> : { -<span class="lineNum"> 77 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 78 </span> : // 402. wrong new expression in [some_]allocator::construct -<span class="lineNum"> 79 </span><span class="lineCov"> 23695 : ::new(static_cast<void*>(__p)) _T1(__value);</span> -<span class="lineNum"> 80 </span><span class="lineCov"> 23695 : }</span> -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : /** -<span class="lineNum"> 83 </span> : * Destroy the object pointed to by a pointer type. -<span class="lineNum"> 84 </span> : */ -<span class="lineNum"> 85 </span> : template<typename _Tp> -<span class="lineNum"> 86 </span> : inline void -<span class="lineNum"> 87 </span><span class="lineCov"> 82748 : _Destroy(_Tp* __pointer)</span> -<span class="lineNum"> 88 </span><span class="lineCov"> 82748 : { __pointer->~_Tp(); }</span> -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : /** -<span class="lineNum"> 91 </span> : * Destroy a range of objects. If the value_type of the object has -<span class="lineNum"> 92 </span> : * a trivial destructor, the compiler should optimize all of this -<span class="lineNum"> 93 </span> : * away, otherwise the objects' destructors must be invoked. -<span class="lineNum"> 94 </span> : */ -<span class="lineNum"> 95 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 96 </span> : inline void -<span class="lineNum"> 97 </span><span class="lineCov"> 33441 : _Destroy(_ForwardIterator __first, _ForwardIterator __last)</span> -<span class="lineNum"> 98 </span> : { -<span class="lineNum"> 99 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 100 </span> : _Value_type; -<span class="lineNum"> 101 </span><span class="lineCov"> 91960 : if (!__has_trivial_destructor(_Value_type))</span> -<span class="lineNum"> 102 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 103 </span><span class="lineCov"> 82748 : std::_Destroy(&*__first);</span> -<span class="lineNum"> 104 </span><span class="lineCov"> 33441 : }</span> -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : /** -<span class="lineNum"> 107 </span> : * Destroy a range of objects using the supplied allocator. For -<span class="lineNum"> 108 </span> : * nondefault allocators we do not optimize away invocation of -<span class="lineNum"> 109 </span> : * destroy() even if _Tp has a trivial destructor. -<span class="lineNum"> 110 </span> : */ -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : template <typename _Tp> class allocator; -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : template<typename _ForwardIterator, typename _Allocator> -<span class="lineNum"> 115 </span> : void -<span class="lineNum"> 116 </span> : _Destroy(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 117 </span> : _Allocator& __alloc) -<span class="lineNum"> 118 </span> : { -<span class="lineNum"> 119 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 120 </span> : __alloc.destroy(&*__first); -<span class="lineNum"> 121 </span> : } -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 124 </span> : inline void -<span class="lineNum"> 125 </span> : _Destroy(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 126 </span><span class="lineCov"> 33441 : allocator<_Tp>&)</span> -<span class="lineNum"> 127 </span> : { -<span class="lineNum"> 128 </span><span class="lineCov"> 33441 : _Destroy(__first, __last);</span> -<span class="lineNum"> 129 </span><span class="lineCov"> 33441 : }</span> -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : #endif /* _STL_CONSTRUCT_H */ -<span class="lineNum"> 134 </span> : -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_deque.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_deque.h.gcov.html deleted file mode 100644 index 6fe09f3..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_deque.h.gcov.html +++ /dev/null @@ -1,1837 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_deque.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_deque.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">189</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">78.3 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">148</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Deque implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_deque.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_DEQUE_H -<span class="lineNum"> 63 </span> : #define _STL_DEQUE_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 66 </span> : #include <bits/stl_iterator_base_types.h> -<span class="lineNum"> 67 </span> : #include <bits/stl_iterator_base_funcs.h> -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : /** -<span class="lineNum"> 72 </span> : * @brief This function controls the size of memory nodes. -<span class="lineNum"> 73 </span> : * @param size The size of an element. -<span class="lineNum"> 74 </span> : * @return The number (not byte size) of elements per node. -<span class="lineNum"> 75 </span> : * -<span class="lineNum"> 76 </span> : * This function started off as a compiler kludge from SGI, but seems to -<span class="lineNum"> 77 </span> : * be a useful wrapper around a repeated constant expression. The '512' is -<span class="lineNum"> 78 </span> : * tunable (and no other code needs to change), but no investigation has -<span class="lineNum"> 79 </span> : * been done since inheriting the SGI code. -<span class="lineNum"> 80 </span> : */ -<span class="lineNum"> 81 </span> : inline size_t -<span class="lineNum"> 82 </span><span class="lineCov"> 7753 : __deque_buf_size(size_t __size)</span> -<span class="lineNum"> 83 </span><span class="lineCov"> 7753 : { return __size < 512 ? size_t(512 / __size) : size_t(1); }</span> -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : /** -<span class="lineNum"> 87 </span> : * @brief A deque::iterator. -<span class="lineNum"> 88 </span> : * -<span class="lineNum"> 89 </span> : * Quite a bit of intelligence here. Much of the functionality of -<span class="lineNum"> 90 </span> : * deque is actually passed off to this class. A deque holds two -<span class="lineNum"> 91 </span> : * of these internally, marking its valid range. Access to -<span class="lineNum"> 92 </span> : * elements is done as offsets of either of those two, relying on -<span class="lineNum"> 93 </span> : * operator overloading in this class. -<span class="lineNum"> 94 </span> : * -<span class="lineNum"> 95 </span> : * All the functions are op overloads except for _M_set_node. -<span class="lineNum"> 96 </span> : */ -<span class="lineNum"> 97 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 98 </span> : struct _Deque_iterator -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span> : typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; -<span class="lineNum"> 101 </span> : typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator; -<span class="lineNum"> 102 </span> : -<span class="lineNum"> 103 </span><span class="lineCov"> 7595 : static size_t _S_buffer_size()</span> -<span class="lineNum"> 104 </span><span class="lineCov"> 7595 : { return __deque_buf_size(sizeof(_Tp)); }</span> -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : typedef std::random_access_iterator_tag iterator_category; -<span class="lineNum"> 107 </span> : typedef _Tp value_type; -<span class="lineNum"> 108 </span> : typedef _Ptr pointer; -<span class="lineNum"> 109 </span> : typedef _Ref reference; -<span class="lineNum"> 110 </span> : typedef size_t size_type; -<span class="lineNum"> 111 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 112 </span> : typedef _Tp** _Map_pointer; -<span class="lineNum"> 113 </span> : typedef _Deque_iterator _Self; -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : _Tp* _M_cur; -<span class="lineNum"> 116 </span> : _Tp* _M_first; -<span class="lineNum"> 117 </span> : _Tp* _M_last; -<span class="lineNum"> 118 </span> : _Map_pointer _M_node; -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : _Deque_iterator(_Tp* __x, _Map_pointer __y) -<span class="lineNum"> 121 </span> : : _M_cur(__x), _M_first(*__y), -<span class="lineNum"> 122 </span> : _M_last(*__y + _S_buffer_size()), _M_node(__y) { } -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span><span class="lineCov"> 68 : _Deque_iterator()</span> -<span class="lineNum"> 125 </span><span class="lineCov"> 68 : : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) { }</span> -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span><span class="lineCov"> 45179 : _Deque_iterator(const iterator& __x)</span> -<span class="lineNum"> 128 </span> : : _M_cur(__x._M_cur), _M_first(__x._M_first), -<span class="lineNum"> 129 </span><span class="lineCov"> 45179 : _M_last(__x._M_last), _M_node(__x._M_node) { }</span> -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : reference -<span class="lineNum"> 132 </span><span class="lineCov"> 24883 : operator*() const</span> -<span class="lineNum"> 133 </span><span class="lineCov"> 24883 : { return *_M_cur; }</span> -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : pointer -<span class="lineNum"> 136 </span> : operator->() const -<span class="lineNum"> 137 </span> : { return _M_cur; } -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : _Self& -<span class="lineNum"> 140 </span><span class="lineCov"> 24754 : operator++()</span> -<span class="lineNum"> 141 </span> : { -<span class="lineNum"> 142 </span><span class="lineCov"> 24754 : ++_M_cur;</span> -<span class="lineNum"> 143 </span><span class="lineCov"> 24754 : if (_M_cur == _M_last)</span> -<span class="lineNum"> 144 </span> : { -<span class="lineNum"> 145 </span><span class="lineCov"> 29 : _M_set_node(_M_node + 1);</span> -<span class="lineNum"> 146 </span><span class="lineCov"> 29 : _M_cur = _M_first;</span> -<span class="lineNum"> 147 </span> : } -<span class="lineNum"> 148 </span><span class="lineCov"> 24754 : return *this;</span> -<span class="lineNum"> 149 </span> : } -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span> : _Self -<span class="lineNum"> 152 </span> : operator++(int) -<span class="lineNum"> 153 </span> : { -<span class="lineNum"> 154 </span> : _Self __tmp = *this; -<span class="lineNum"> 155 </span> : ++*this; -<span class="lineNum"> 156 </span> : return __tmp; -<span class="lineNum"> 157 </span> : } -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : _Self& -<span class="lineNum"> 160 </span><span class="lineCov"> 39 : operator--()</span> -<span class="lineNum"> 161 </span> : { -<span class="lineNum"> 162 </span><span class="lineCov"> 39 : if (_M_cur == _M_first)</span> -<span class="lineNum"> 163 </span> : { -<span class="lineNum"> 164 </span><span class="lineNoCov"> 0 : _M_set_node(_M_node - 1);</span> -<span class="lineNum"> 165 </span><span class="lineNoCov"> 0 : _M_cur = _M_last;</span> -<span class="lineNum"> 166 </span> : } -<span class="lineNum"> 167 </span><span class="lineCov"> 39 : --_M_cur;</span> -<span class="lineNum"> 168 </span><span class="lineCov"> 39 : return *this;</span> -<span class="lineNum"> 169 </span> : } -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : _Self -<span class="lineNum"> 172 </span> : operator--(int) -<span class="lineNum"> 173 </span> : { -<span class="lineNum"> 174 </span> : _Self __tmp = *this; -<span class="lineNum"> 175 </span> : --*this; -<span class="lineNum"> 176 </span> : return __tmp; -<span class="lineNum"> 177 </span> : } -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : _Self& -<span class="lineNum"> 180 </span><span class="lineCov"> 180 : operator+=(difference_type __n)</span> -<span class="lineNum"> 181 </span> : { -<span class="lineNum"> 182 </span><span class="lineCov"> 180 : const difference_type __offset = __n + (_M_cur - _M_first);</span> -<span class="lineNum"> 183 </span><span class="lineCov"> 180 : if (__offset >= 0 && __offset < difference_type(_S_buffer_size()))</span> -<span class="lineNum"> 184 </span><span class="lineCov"> 178 : _M_cur += __n;</span> -<span class="lineNum"> 185 </span> : else -<span class="lineNum"> 186 </span> : { -<span class="lineNum"> 187 </span> : const difference_type __node_offset = -<span class="lineNum"> 188 </span> : __offset > 0 ? __offset / difference_type(_S_buffer_size()) -<span class="lineNum"> 189 </span> : : -difference_type((-__offset - 1) -<span class="lineNum"> 190 </span><span class="lineCov"> 2 : / _S_buffer_size()) - 1;</span> -<span class="lineNum"> 191 </span><span class="lineCov"> 2 : _M_set_node(_M_node + __node_offset);</span> -<span class="lineNum"> 192 </span><span class="lineCov"> 2 : _M_cur = _M_first + (__offset - __node_offset</span> -<span class="lineNum"> 193 </span> : * difference_type(_S_buffer_size())); -<span class="lineNum"> 194 </span> : } -<span class="lineNum"> 195 </span><span class="lineCov"> 180 : return *this;</span> -<span class="lineNum"> 196 </span> : } -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : _Self -<span class="lineNum"> 199 </span><span class="lineCov"> 180 : operator+(difference_type __n) const</span> -<span class="lineNum"> 200 </span> : { -<span class="lineNum"> 201 </span><span class="lineCov"> 180 : _Self __tmp = *this;</span> -<span class="lineNum"> 202 </span><span class="lineCov"> 180 : return __tmp += __n;</span> -<span class="lineNum"> 203 </span> : } -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span> : _Self& -<span class="lineNum"> 206 </span><span class="lineNoCov"> 0 : operator-=(difference_type __n)</span> -<span class="lineNum"> 207 </span><span class="lineNoCov"> 0 : { return *this += -__n; }</span> -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : _Self -<span class="lineNum"> 210 </span><span class="lineNoCov"> 0 : operator-(difference_type __n) const</span> -<span class="lineNum"> 211 </span> : { -<span class="lineNum"> 212 </span><span class="lineNoCov"> 0 : _Self __tmp = *this;</span> -<span class="lineNum"> 213 </span><span class="lineNoCov"> 0 : return __tmp -= __n;</span> -<span class="lineNum"> 214 </span> : } -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : reference -<span class="lineNum"> 217 </span> : operator[](difference_type __n) const -<span class="lineNum"> 218 </span> : { return *(*this + __n); } -<span class="lineNum"> 219 </span> : -<span class="lineNum"> 220 </span> : /** -<span class="lineNum"> 221 </span> : * Prepares to traverse new_node. Sets everything except -<span class="lineNum"> 222 </span> : * _M_cur, which should therefore be set by the caller -<span class="lineNum"> 223 </span> : * immediately afterwards, based on _M_first and _M_last. -<span class="lineNum"> 224 </span> : */ -<span class="lineNum"> 225 </span> : void -<span class="lineNum"> 226 </span><span class="lineCov"> 112 : _M_set_node(_Map_pointer __new_node)</span> -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span><span class="lineCov"> 112 : _M_node = __new_node;</span> -<span class="lineNum"> 229 </span><span class="lineCov"> 112 : _M_first = *__new_node;</span> -<span class="lineNum"> 230 </span><span class="lineCov"> 112 : _M_last = _M_first + difference_type(_S_buffer_size());</span> -<span class="lineNum"> 231 </span><span class="lineCov"> 112 : }</span> -<span class="lineNum"> 232 </span> : }; -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : // Note: we also provide overloads whose operands are of the same type in -<span class="lineNum"> 235 </span> : // order to avoid ambiguous overload resolution when std::rel_ops operators -<span class="lineNum"> 236 </span> : // are in scope (for additional details, see libstdc++/3628) -<span class="lineNum"> 237 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 238 </span> : inline bool -<span class="lineNum"> 239 </span> : operator==(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 240 </span><span class="lineCov"> 19443 : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)</span> -<span class="lineNum"> 241 </span><span class="lineCov"> 19443 : { return __x._M_cur == __y._M_cur; }</span> -<span class="lineNum"> 242 </span> : -<span class="lineNum"> 243 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 244 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 245 </span> : inline bool -<span class="lineNum"> 246 </span> : operator==(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 247 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 248 </span> : { return __x._M_cur == __y._M_cur; } -<span class="lineNum"> 249 </span> : -<span class="lineNum"> 250 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 251 </span> : inline bool -<span class="lineNum"> 252 </span> : operator!=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 253 </span><span class="lineCov"> 12091 : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)</span> -<span class="lineNum"> 254 </span><span class="lineCov"> 12091 : { return !(__x == __y); }</span> -<span class="lineNum"> 255 </span> : -<span class="lineNum"> 256 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 257 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 258 </span> : inline bool -<span class="lineNum"> 259 </span> : operator!=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 260 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 261 </span> : { return !(__x == __y); } -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 264 </span> : inline bool -<span class="lineNum"> 265 </span> : operator<(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 266 </span> : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) -<span class="lineNum"> 267 </span> : { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur) -<span class="lineNum"> 268 </span> : : (__x._M_node < __y._M_node); } -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 271 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 272 </span> : inline bool -<span class="lineNum"> 273 </span> : operator<(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 274 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 275 </span> : { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur) -<span class="lineNum"> 276 </span> : : (__x._M_node < __y._M_node); } -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 279 </span> : inline bool -<span class="lineNum"> 280 </span> : operator>(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 281 </span> : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) -<span class="lineNum"> 282 </span> : { return __y < __x; } -<span class="lineNum"> 283 </span> : -<span class="lineNum"> 284 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 285 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 286 </span> : inline bool -<span class="lineNum"> 287 </span> : operator>(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 288 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 289 </span> : { return __y < __x; } -<span class="lineNum"> 290 </span> : -<span class="lineNum"> 291 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 292 </span> : inline bool -<span class="lineNum"> 293 </span> : operator<=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 294 </span> : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) -<span class="lineNum"> 295 </span> : { return !(__y < __x); } -<span class="lineNum"> 296 </span> : -<span class="lineNum"> 297 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 298 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 299 </span> : inline bool -<span class="lineNum"> 300 </span> : operator<=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 301 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 302 </span> : { return !(__y < __x); } -<span class="lineNum"> 303 </span> : -<span class="lineNum"> 304 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 305 </span> : inline bool -<span class="lineNum"> 306 </span> : operator>=(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 307 </span> : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y) -<span class="lineNum"> 308 </span> : { return !(__x < __y); } -<span class="lineNum"> 309 </span> : -<span class="lineNum"> 310 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 311 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 312 </span> : inline bool -<span class="lineNum"> 313 </span> : operator>=(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 314 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 315 </span> : { return !(__x < __y); } -<span class="lineNum"> 316 </span> : -<span class="lineNum"> 317 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 318 </span> : // According to the resolution of DR179 not only the various comparison -<span class="lineNum"> 319 </span> : // operators but also operator- must accept mixed iterator/const_iterator -<span class="lineNum"> 320 </span> : // parameters. -<span class="lineNum"> 321 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 322 </span> : inline typename _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type -<span class="lineNum"> 323 </span> : operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, -<span class="lineNum"> 324 </span><span class="lineCov"> 7299 : const _Deque_iterator<_Tp, _Ref, _Ptr>& __y)</span> -<span class="lineNum"> 325 </span> : { -<span class="lineNum"> 326 </span> : return typename _Deque_iterator<_Tp, _Ref, _Ptr>::difference_type -<span class="lineNum"> 327 </span> : (_Deque_iterator<_Tp, _Ref, _Ptr>::_S_buffer_size()) -<span class="lineNum"> 328 </span> : * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first) -<span class="lineNum"> 329 </span><span class="lineCov"> 7299 : + (__y._M_last - __y._M_cur);</span> -<span class="lineNum"> 330 </span> : } -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : template<typename _Tp, typename _RefL, typename _PtrL, -<span class="lineNum"> 333 </span> : typename _RefR, typename _PtrR> -<span class="lineNum"> 334 </span> : inline typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type -<span class="lineNum"> 335 </span> : operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, -<span class="lineNum"> 336 </span> : const _Deque_iterator<_Tp, _RefR, _PtrR>& __y) -<span class="lineNum"> 337 </span> : { -<span class="lineNum"> 338 </span> : return typename _Deque_iterator<_Tp, _RefL, _PtrL>::difference_type -<span class="lineNum"> 339 </span> : (_Deque_iterator<_Tp, _RefL, _PtrL>::_S_buffer_size()) -<span class="lineNum"> 340 </span> : * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first) -<span class="lineNum"> 341 </span> : + (__y._M_last - __y._M_cur); -<span class="lineNum"> 342 </span> : } -<span class="lineNum"> 343 </span> : -<span class="lineNum"> 344 </span> : template<typename _Tp, typename _Ref, typename _Ptr> -<span class="lineNum"> 345 </span> : inline _Deque_iterator<_Tp, _Ref, _Ptr> -<span class="lineNum"> 346 </span> : operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Ref, _Ptr>& __x) -<span class="lineNum"> 347 </span> : { return __x + __n; } -<span class="lineNum"> 348 </span> : -<span class="lineNum"> 349 </span> : template<typename _Tp> -<span class="lineNum"> 350 </span> : void -<span class="lineNum"> 351 </span> : fill(const _Deque_iterator<_Tp, _Tp&, _Tp*>& __first, -<span class="lineNum"> 352 </span> : const _Deque_iterator<_Tp, _Tp&, _Tp*>& __last, const _Tp& __value); -<span class="lineNum"> 353 </span> : -<span class="lineNum"> 354 </span> : /** -<span class="lineNum"> 355 </span> : * Deque base class. This class provides the unified face for %deque's -<span class="lineNum"> 356 </span> : * allocation. This class's constructor and destructor allocate and -<span class="lineNum"> 357 </span> : * deallocate (but do not initialize) storage. This makes %exception -<span class="lineNum"> 358 </span> : * safety easier. -<span class="lineNum"> 359 </span> : * -<span class="lineNum"> 360 </span> : * Nothing in this class ever constructs or destroys an actual Tp element. -<span class="lineNum"> 361 </span> : * (Deque handles that itself.) Only/All memory management is performed -<span class="lineNum"> 362 </span> : * here. -<span class="lineNum"> 363 </span> : */ -<span class="lineNum"> 364 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 365 </span> : class _Deque_base -<span class="lineNum"> 366 </span> : { -<span class="lineNum"> 367 </span> : public: -<span class="lineNum"> 368 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 369 </span> : -<span class="lineNum"> 370 </span> : allocator_type -<span class="lineNum"> 371 </span> : get_allocator() const -<span class="lineNum"> 372 </span> : { return allocator_type(_M_get_Tp_allocator()); } -<span class="lineNum"> 373 </span> : -<span class="lineNum"> 374 </span> : typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; -<span class="lineNum"> 375 </span> : typedef _Deque_iterator<_Tp, const _Tp&, const _Tp*> const_iterator; -<span class="lineNum"> 376 </span> : -<span class="lineNum"> 377 </span><span class="lineCov"> 21 : _Deque_base()</span> -<span class="lineNum"> 378 </span><span class="lineCov"> 21 : : _M_impl()</span> -<span class="lineNum"> 379 </span><span class="lineCov"> 21 : { _M_initialize_map(0); }</span> -<span class="lineNum"> 380 </span> : -<span class="lineNum"> 381 </span><span class="lineCov"> 13 : _Deque_base(const allocator_type& __a, size_t __num_elements)</span> -<span class="lineNum"> 382 </span><span class="lineCov"> 13 : : _M_impl(__a)</span> -<span class="lineNum"> 383 </span><span class="lineCov"> 13 : { _M_initialize_map(__num_elements); }</span> -<span class="lineNum"> 384 </span> : -<span class="lineNum"> 385 </span> : _Deque_base(const allocator_type& __a) -<span class="lineNum"> 386 </span> : : _M_impl(__a) -<span class="lineNum"> 387 </span> : { } -<span class="lineNum"> 388 </span> : -<span class="lineNum"> 389 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 390 </span> : _Deque_base(_Deque_base&& __x) -<span class="lineNum"> 391 </span> : : _M_impl(__x._M_get_Tp_allocator()) -<span class="lineNum"> 392 </span> : { -<span class="lineNum"> 393 </span> : _M_initialize_map(0); -<span class="lineNum"> 394 </span> : if (__x._M_impl._M_map) -<span class="lineNum"> 395 </span> : { -<span class="lineNum"> 396 </span> : std::swap(this->_M_impl._M_start, __x._M_impl._M_start); -<span class="lineNum"> 397 </span> : std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); -<span class="lineNum"> 398 </span> : std::swap(this->_M_impl._M_map, __x._M_impl._M_map); -<span class="lineNum"> 399 </span> : std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size); -<span class="lineNum"> 400 </span> : } -<span class="lineNum"> 401 </span> : } -<span class="lineNum"> 402 </span> : #endif -<span class="lineNum"> 403 </span> : -<span class="lineNum"> 404 </span> : ~_Deque_base(); -<span class="lineNum"> 405 </span> : -<span class="lineNum"> 406 </span> : protected: -<span class="lineNum"> 407 </span> : //This struct encapsulates the implementation of the std::deque -<span class="lineNum"> 408 </span> : //standard container and at the same time makes use of the EBO -<span class="lineNum"> 409 </span> : //for empty allocators. -<span class="lineNum"> 410 </span> : typedef typename _Alloc::template rebind<_Tp*>::other _Map_alloc_type; -<span class="lineNum"> 411 </span> : -<span class="lineNum"> 412 </span> : typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; -<span class="lineNum"> 413 </span> : -<span class="lineNum"> 414 </span> : struct _Deque_impl -<span class="lineNum"> 415 </span> : : public _Tp_alloc_type -<span class="lineNum"> 416 </span><span class="lineCov"> 30 : {</span> -<span class="lineNum"> 417 </span> : _Tp** _M_map; -<span class="lineNum"> 418 </span> : size_t _M_map_size; -<span class="lineNum"> 419 </span> : iterator _M_start; -<span class="lineNum"> 420 </span> : iterator _M_finish; -<span class="lineNum"> 421 </span> : -<span class="lineNum"> 422 </span><span class="lineCov"> 21 : _Deque_impl()</span> -<span class="lineNum"> 423 </span> : : _Tp_alloc_type(), _M_map(0), _M_map_size(0), -<span class="lineNum"> 424 </span><span class="lineCov"> 21 : _M_start(), _M_finish()</span> -<span class="lineNum"> 425 </span><span class="lineCov"> 21 : { }</span> -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span><span class="lineCov"> 13 : _Deque_impl(const _Tp_alloc_type& __a)</span> -<span class="lineNum"> 428 </span> : : _Tp_alloc_type(__a), _M_map(0), _M_map_size(0), -<span class="lineNum"> 429 </span><span class="lineCov"> 13 : _M_start(), _M_finish()</span> -<span class="lineNum"> 430 </span><span class="lineCov"> 13 : { }</span> -<span class="lineNum"> 431 </span> : }; -<span class="lineNum"> 432 </span> : -<span class="lineNum"> 433 </span> : _Tp_alloc_type& -<span class="lineNum"> 434 </span><span class="lineCov"> 1085 : _M_get_Tp_allocator()</span> -<span class="lineNum"> 435 </span><span class="lineCov"> 1085 : { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }</span> -<span class="lineNum"> 436 </span> : -<span class="lineNum"> 437 </span> : const _Tp_alloc_type& -<span class="lineNum"> 438 </span><span class="lineCov"> 77 : _M_get_Tp_allocator() const</span> -<span class="lineNum"> 439 </span><span class="lineCov"> 77 : { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }</span> -<span class="lineNum"> 440 </span> : -<span class="lineNum"> 441 </span> : _Map_alloc_type -<span class="lineNum"> 442 </span><span class="lineCov"> 64 : _M_get_map_allocator() const</span> -<span class="lineNum"> 443 </span><span class="lineCov"> 64 : { return _Map_alloc_type(_M_get_Tp_allocator()); }</span> -<span class="lineNum"> 444 </span> : -<span class="lineNum"> 445 </span> : _Tp* -<span class="lineNum"> 446 </span><span class="lineCov"> 47 : _M_allocate_node()</span> -<span class="lineNum"> 447 </span> : { -<span class="lineNum"> 448 </span><span class="lineCov"> 47 : return _M_impl._Tp_alloc_type::allocate(__deque_buf_size(sizeof(_Tp)));</span> -<span class="lineNum"> 449 </span> : } -<span class="lineNum"> 450 </span> : -<span class="lineNum"> 451 </span> : void -<span class="lineNum"> 452 </span><span class="lineCov"> 43 : _M_deallocate_node(_Tp* __p)</span> -<span class="lineNum"> 453 </span> : { -<span class="lineNum"> 454 </span><span class="lineCov"> 43 : _M_impl._Tp_alloc_type::deallocate(__p, __deque_buf_size(sizeof(_Tp)));</span> -<span class="lineNum"> 455 </span><span class="lineCov"> 43 : }</span> -<span class="lineNum"> 456 </span> : -<span class="lineNum"> 457 </span> : _Tp** -<span class="lineNum"> 458 </span><span class="lineCov"> 34 : _M_allocate_map(size_t __n)</span> -<span class="lineNum"> 459 </span><span class="lineCov"> 34 : { return _M_get_map_allocator().allocate(__n); }</span> -<span class="lineNum"> 460 </span> : -<span class="lineNum"> 461 </span> : void -<span class="lineNum"> 462 </span><span class="lineCov"> 30 : _M_deallocate_map(_Tp** __p, size_t __n)</span> -<span class="lineNum"> 463 </span><span class="lineCov"> 30 : { _M_get_map_allocator().deallocate(__p, __n); }</span> -<span class="lineNum"> 464 </span> : -<span class="lineNum"> 465 </span> : protected: -<span class="lineNum"> 466 </span> : void _M_initialize_map(size_t); -<span class="lineNum"> 467 </span> : void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish); -<span class="lineNum"> 468 </span> : void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish); -<span class="lineNum"> 469 </span> : enum { _S_initial_map_size = 8 }; -<span class="lineNum"> 470 </span> : -<span class="lineNum"> 471 </span> : _Deque_impl _M_impl; -<span class="lineNum"> 472 </span> : }; -<span class="lineNum"> 473 </span> : -<span class="lineNum"> 474 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 475 </span> : _Deque_base<_Tp, _Alloc>:: -<span class="lineNum"> 476 </span><span class="lineCov"> 30 : ~_Deque_base()</span> -<span class="lineNum"> 477 </span> : { -<span class="lineNum"> 478 </span><span class="lineCov"> 30 : if (this->_M_impl._M_map)</span> -<span class="lineNum"> 479 </span> : { -<span class="lineNum"> 480 </span><span class="lineCov"> 30 : _M_destroy_nodes(this->_M_impl._M_start._M_node,</span> -<span class="lineNum"> 481 </span> : this->_M_impl._M_finish._M_node + 1); -<span class="lineNum"> 482 </span><span class="lineCov"> 30 : _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</span> -<span class="lineNum"> 483 </span> : } -<span class="lineNum"> 484 </span><span class="lineCov"> 30 : }</span> -<span class="lineNum"> 485 </span> : -<span class="lineNum"> 486 </span> : /** -<span class="lineNum"> 487 </span> : * @brief Layout storage. -<span class="lineNum"> 488 </span> : * @param num_elements The count of T's for which to allocate space -<span class="lineNum"> 489 </span> : * at first. -<span class="lineNum"> 490 </span> : * @return Nothing. -<span class="lineNum"> 491 </span> : * -<span class="lineNum"> 492 </span> : * The initial underlying memory layout is a bit complicated... -<span class="lineNum"> 493 </span> : */ -<span class="lineNum"> 494 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 495 </span> : void -<span class="lineNum"> 496 </span> : _Deque_base<_Tp, _Alloc>:: -<span class="lineNum"> 497 </span><span class="lineCov"> 34 : _M_initialize_map(size_t __num_elements)</span> -<span class="lineNum"> 498 </span> : { -<span class="lineNum"> 499 </span> : const size_t __num_nodes = (__num_elements/ __deque_buf_size(sizeof(_Tp)) -<span class="lineNum"> 500 </span><span class="lineCov"> 34 : + 1);</span> -<span class="lineNum"> 501 </span> : -<span class="lineNum"> 502 </span><span class="lineCov"> 34 : this->_M_impl._M_map_size = std::max((size_t) _S_initial_map_size,</span> -<span class="lineNum"> 503 </span> : size_t(__num_nodes + 2)); -<span class="lineNum"> 504 </span><span class="lineCov"> 34 : this->_M_impl._M_map = _M_allocate_map(this->_M_impl._M_map_size);</span> -<span class="lineNum"> 505 </span> : -<span class="lineNum"> 506 </span> : // For "small" maps (needing less than _M_map_size nodes), allocation -<span class="lineNum"> 507 </span> : // starts in the middle elements and grows outwards. So nstart may be -<span class="lineNum"> 508 </span> : // the beginning of _M_map, but for small maps it may be as far in as -<span class="lineNum"> 509 </span> : // _M_map+3. -<span class="lineNum"> 510 </span> : -<span class="lineNum"> 511 </span> : _Tp** __nstart = (this->_M_impl._M_map -<span class="lineNum"> 512 </span><span class="lineCov"> 34 : + (this->_M_impl._M_map_size - __num_nodes) / 2);</span> -<span class="lineNum"> 513 </span><span class="lineCov"> 34 : _Tp** __nfinish = __nstart + __num_nodes;</span> -<span class="lineNum"> 514 </span> : -<span class="lineNum"> 515 </span> : try -<span class="lineNum"> 516 </span><span class="lineCov"> 34 : { _M_create_nodes(__nstart, __nfinish); }</span> -<span class="lineNum"> 517 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 518 </span> : { -<span class="lineNum"> 519 </span><span class="lineNoCov"> 0 : _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size);</span> -<span class="lineNum"> 520 </span><span class="lineNoCov"> 0 : this->_M_impl._M_map = 0;</span> -<span class="lineNum"> 521 </span><span class="lineNoCov"> 0 : this->_M_impl._M_map_size = 0;</span> -<span class="lineNum"> 522 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 523 </span> : } -<span class="lineNum"> 524 </span> : -<span class="lineNum"> 525 </span><span class="lineCov"> 34 : this->_M_impl._M_start._M_set_node(__nstart);</span> -<span class="lineNum"> 526 </span><span class="lineCov"> 34 : this->_M_impl._M_finish._M_set_node(__nfinish - 1);</span> -<span class="lineNum"> 527 </span><span class="lineCov"> 34 : this->_M_impl._M_start._M_cur = _M_impl._M_start._M_first;</span> -<span class="lineNum"> 528 </span><span class="lineCov"> 34 : this->_M_impl._M_finish._M_cur = (this->_M_impl._M_finish._M_first</span> -<span class="lineNum"> 529 </span> : + __num_elements -<span class="lineNum"> 530 </span> : % __deque_buf_size(sizeof(_Tp))); -<span class="lineNum"> 531 </span><span class="lineCov"> 34 : }</span> -<span class="lineNum"> 532 </span> : -<span class="lineNum"> 533 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 534 </span> : void -<span class="lineNum"> 535 </span> : _Deque_base<_Tp, _Alloc>:: -<span class="lineNum"> 536 </span><span class="lineCov"> 34 : _M_create_nodes(_Tp** __nstart, _Tp** __nfinish)</span> -<span class="lineNum"> 537 </span> : { -<span class="lineNum"> 538 </span> : _Tp** __cur; -<span class="lineNum"> 539 </span> : try -<span class="lineNum"> 540 </span> : { -<span class="lineNum"> 541 </span><span class="lineCov"> 68 : for (__cur = __nstart; __cur < __nfinish; ++__cur)</span> -<span class="lineNum"> 542 </span><span class="lineCov"> 34 : *__cur = this->_M_allocate_node();</span> -<span class="lineNum"> 543 </span> : } -<span class="lineNum"> 544 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 545 </span> : { -<span class="lineNum"> 546 </span><span class="lineNoCov"> 0 : _M_destroy_nodes(__nstart, __cur);</span> -<span class="lineNum"> 547 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 548 </span> : } -<span class="lineNum"> 549 </span><span class="lineCov"> 34 : }</span> -<span class="lineNum"> 550 </span> : -<span class="lineNum"> 551 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 552 </span> : void -<span class="lineNum"> 553 </span> : _Deque_base<_Tp, _Alloc>:: -<span class="lineNum"> 554 </span><span class="lineCov"> 1046 : _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish)</span> -<span class="lineNum"> 555 </span> : { -<span class="lineNum"> 556 </span><span class="lineCov"> 1089 : for (_Tp** __n = __nstart; __n < __nfinish; ++__n)</span> -<span class="lineNum"> 557 </span><span class="lineCov"> 43 : _M_deallocate_node(*__n);</span> -<span class="lineNum"> 558 </span><span class="lineCov"> 1046 : }</span> -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : /** -<span class="lineNum"> 561 </span> : * @brief A standard container using fixed-size memory allocation and -<span class="lineNum"> 562 </span> : * constant-time manipulation of elements at either end. -<span class="lineNum"> 563 </span> : * -<span class="lineNum"> 564 </span> : * @ingroup Containers -<span class="lineNum"> 565 </span> : * @ingroup Sequences -<span class="lineNum"> 566 </span> : * -<span class="lineNum"> 567 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a -<span class="lineNum"> 568 </span> : * <a href="tables.html#66">reversible container</a>, and a -<span class="lineNum"> 569 </span> : * <a href="tables.html#67">sequence</a>, including the -<span class="lineNum"> 570 </span> : * <a href="tables.html#68">optional sequence requirements</a>. -<span class="lineNum"> 571 </span> : * -<span class="lineNum"> 572 </span> : * In previous HP/SGI versions of deque, there was an extra template -<span class="lineNum"> 573 </span> : * parameter so users could control the node size. This extension turned -<span class="lineNum"> 574 </span> : * out to violate the C++ standard (it can be detected using template -<span class="lineNum"> 575 </span> : * template parameters), and it was removed. -<span class="lineNum"> 576 </span> : * -<span class="lineNum"> 577 </span> : * Here's how a deque<Tp> manages memory. Each deque has 4 members: -<span class="lineNum"> 578 </span> : * -<span class="lineNum"> 579 </span> : * - Tp** _M_map -<span class="lineNum"> 580 </span> : * - size_t _M_map_size -<span class="lineNum"> 581 </span> : * - iterator _M_start, _M_finish -<span class="lineNum"> 582 </span> : * -<span class="lineNum"> 583 </span> : * map_size is at least 8. %map is an array of map_size -<span class="lineNum"> 584 </span> : * pointers-to-"nodes". (The name %map has nothing to do with the -<span class="lineNum"> 585 </span> : * std::map class, and "nodes" should not be confused with -<span class="lineNum"> 586 </span> : * std::list's usage of "node".) -<span class="lineNum"> 587 </span> : * -<span class="lineNum"> 588 </span> : * A "node" has no specific type name as such, but it is referred -<span class="lineNum"> 589 </span> : * to as "node" in this file. It is a simple array-of-Tp. If Tp -<span class="lineNum"> 590 </span> : * is very large, there will be one Tp element per node (i.e., an -<span class="lineNum"> 591 </span> : * "array" of one). For non-huge Tp's, node size is inversely -<span class="lineNum"> 592 </span> : * related to Tp size: the larger the Tp, the fewer Tp's will fit -<span class="lineNum"> 593 </span> : * in a node. The goal here is to keep the total size of a node -<span class="lineNum"> 594 </span> : * relatively small and constant over different Tp's, to improve -<span class="lineNum"> 595 </span> : * allocator efficiency. -<span class="lineNum"> 596 </span> : * -<span class="lineNum"> 597 </span> : * Not every pointer in the %map array will point to a node. If -<span class="lineNum"> 598 </span> : * the initial number of elements in the deque is small, the -<span class="lineNum"> 599 </span> : * /middle/ %map pointers will be valid, and the ones at the edges -<span class="lineNum"> 600 </span> : * will be unused. This same situation will arise as the %map -<span class="lineNum"> 601 </span> : * grows: available %map pointers, if any, will be on the ends. As -<span class="lineNum"> 602 </span> : * new nodes are created, only a subset of the %map's pointers need -<span class="lineNum"> 603 </span> : * to be copied "outward". -<span class="lineNum"> 604 </span> : * -<span class="lineNum"> 605 </span> : * Class invariants: -<span class="lineNum"> 606 </span> : * - For any nonsingular iterator i: -<span class="lineNum"> 607 </span> : * - i.node points to a member of the %map array. (Yes, you read that -<span class="lineNum"> 608 </span> : * correctly: i.node does not actually point to a node.) The member of -<span class="lineNum"> 609 </span> : * the %map array is what actually points to the node. -<span class="lineNum"> 610 </span> : * - i.first == *(i.node) (This points to the node (first Tp element).) -<span class="lineNum"> 611 </span> : * - i.last == i.first + node_size -<span class="lineNum"> 612 </span> : * - i.cur is a pointer in the range [i.first, i.last). NOTE: -<span class="lineNum"> 613 </span> : * the implication of this is that i.cur is always a dereferenceable -<span class="lineNum"> 614 </span> : * pointer, even if i is a past-the-end iterator. -<span class="lineNum"> 615 </span> : * - Start and Finish are always nonsingular iterators. NOTE: this -<span class="lineNum"> 616 </span> : * means that an empty deque must have one node, a deque with <N -<span class="lineNum"> 617 </span> : * elements (where N is the node buffer size) must have one node, a -<span class="lineNum"> 618 </span> : * deque with N through (2N-1) elements must have two nodes, etc. -<span class="lineNum"> 619 </span> : * - For every node other than start.node and finish.node, every -<span class="lineNum"> 620 </span> : * element in the node is an initialized object. If start.node == -<span class="lineNum"> 621 </span> : * finish.node, then [start.cur, finish.cur) are initialized -<span class="lineNum"> 622 </span> : * objects, and the elements outside that range are uninitialized -<span class="lineNum"> 623 </span> : * storage. Otherwise, [start.cur, start.last) and [finish.first, -<span class="lineNum"> 624 </span> : * finish.cur) are initialized objects, and [start.first, start.cur) -<span class="lineNum"> 625 </span> : * and [finish.cur, finish.last) are uninitialized storage. -<span class="lineNum"> 626 </span> : * - [%map, %map + map_size) is a valid, non-empty range. -<span class="lineNum"> 627 </span> : * - [start.node, finish.node] is a valid range contained within -<span class="lineNum"> 628 </span> : * [%map, %map + map_size). -<span class="lineNum"> 629 </span> : * - A pointer in the range [%map, %map + map_size) points to an allocated -<span class="lineNum"> 630 </span> : * node if and only if the pointer is in the range -<span class="lineNum"> 631 </span> : * [start.node, finish.node]. -<span class="lineNum"> 632 </span> : * -<span class="lineNum"> 633 </span> : * Here's the magic: nothing in deque is "aware" of the discontiguous -<span class="lineNum"> 634 </span> : * storage! -<span class="lineNum"> 635 </span> : * -<span class="lineNum"> 636 </span> : * The memory setup and layout occurs in the parent, _Base, and the iterator -<span class="lineNum"> 637 </span> : * class is entirely responsible for "leaping" from one node to the next. -<span class="lineNum"> 638 </span> : * All the implementation routines for deque itself work only through the -<span class="lineNum"> 639 </span> : * start and finish iterators. This keeps the routines simple and sane, -<span class="lineNum"> 640 </span> : * and we can use other standard algorithms as well. -<span class="lineNum"> 641 </span> : */ -<span class="lineNum"> 642 </span> : template<typename _Tp, typename _Alloc = std::allocator<_Tp> > -<span class="lineNum"> 643 </span> : class deque : protected _Deque_base<_Tp, _Alloc> -<span class="lineNum"> 644 </span> : { -<span class="lineNum"> 645 </span> : // concept requirements -<span class="lineNum"> 646 </span> : typedef typename _Alloc::value_type _Alloc_value_type; -<span class="lineNum"> 647 </span> : __glibcxx_class_requires(_Tp, _SGIAssignableConcept) -<span class="lineNum"> 648 </span> : __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) -<span class="lineNum"> 649 </span> : -<span class="lineNum"> 650 </span> : typedef _Deque_base<_Tp, _Alloc> _Base; -<span class="lineNum"> 651 </span> : typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; -<span class="lineNum"> 652 </span> : -<span class="lineNum"> 653 </span> : public: -<span class="lineNum"> 654 </span> : typedef _Tp value_type; -<span class="lineNum"> 655 </span> : typedef typename _Tp_alloc_type::pointer pointer; -<span class="lineNum"> 656 </span> : typedef typename _Tp_alloc_type::const_pointer const_pointer; -<span class="lineNum"> 657 </span> : typedef typename _Tp_alloc_type::reference reference; -<span class="lineNum"> 658 </span> : typedef typename _Tp_alloc_type::const_reference const_reference; -<span class="lineNum"> 659 </span> : typedef typename _Base::iterator iterator; -<span class="lineNum"> 660 </span> : typedef typename _Base::const_iterator const_iterator; -<span class="lineNum"> 661 </span> : typedef std::reverse_iterator<const_iterator> const_reverse_iterator; -<span class="lineNum"> 662 </span> : typedef std::reverse_iterator<iterator> reverse_iterator; -<span class="lineNum"> 663 </span> : typedef size_t size_type; -<span class="lineNum"> 664 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 665 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 666 </span> : -<span class="lineNum"> 667 </span> : protected: -<span class="lineNum"> 668 </span> : typedef pointer* _Map_pointer; -<span class="lineNum"> 669 </span> : -<span class="lineNum"> 670 </span><span class="lineNoCov"> 0 : static size_t _S_buffer_size()</span> -<span class="lineNum"> 671 </span><span class="lineNoCov"> 0 : { return __deque_buf_size(sizeof(_Tp)); }</span> -<span class="lineNum"> 672 </span> : -<span class="lineNum"> 673 </span> : // Functions controlling memory layout, and nothing else. -<span class="lineNum"> 674 </span> : using _Base::_M_initialize_map; -<span class="lineNum"> 675 </span> : using _Base::_M_create_nodes; -<span class="lineNum"> 676 </span> : using _Base::_M_destroy_nodes; -<span class="lineNum"> 677 </span> : using _Base::_M_allocate_node; -<span class="lineNum"> 678 </span> : using _Base::_M_deallocate_node; -<span class="lineNum"> 679 </span> : using _Base::_M_allocate_map; -<span class="lineNum"> 680 </span> : using _Base::_M_deallocate_map; -<span class="lineNum"> 681 </span> : using _Base::_M_get_Tp_allocator; -<span class="lineNum"> 682 </span> : -<span class="lineNum"> 683 </span> : /** -<span class="lineNum"> 684 </span> : * A total of four data members accumulated down the hierarchy. -<span class="lineNum"> 685 </span> : * May be accessed via _M_impl.* -<span class="lineNum"> 686 </span> : */ -<span class="lineNum"> 687 </span> : using _Base::_M_impl; -<span class="lineNum"> 688 </span> : -<span class="lineNum"> 689 </span> : public: -<span class="lineNum"> 690 </span> : // [23.2.1.1] construct/copy/destroy -<span class="lineNum"> 691 </span> : // (assign() and get_allocator() are also listed in this section) -<span class="lineNum"> 692 </span> : /** -<span class="lineNum"> 693 </span> : * @brief Default constructor creates no elements. -<span class="lineNum"> 694 </span> : */ -<span class="lineNum"> 695 </span><span class="lineCov"> 21 : deque()</span> -<span class="lineNum"> 696 </span><span class="lineCov"> 21 : : _Base() { }</span> -<span class="lineNum"> 697 </span> : -<span class="lineNum"> 698 </span> : /** -<span class="lineNum"> 699 </span> : * @brief Creates a %deque with no elements. -<span class="lineNum"> 700 </span> : * @param a An allocator object. -<span class="lineNum"> 701 </span> : */ -<span class="lineNum"> 702 </span> : explicit -<span class="lineNum"> 703 </span> : deque(const allocator_type& __a) -<span class="lineNum"> 704 </span> : : _Base(__a, 0) { } -<span class="lineNum"> 705 </span> : -<span class="lineNum"> 706 </span> : /** -<span class="lineNum"> 707 </span> : * @brief Creates a %deque with copies of an exemplar element. -<span class="lineNum"> 708 </span> : * @param n The number of elements to initially create. -<span class="lineNum"> 709 </span> : * @param value An element to copy. -<span class="lineNum"> 710 </span> : * @param a An allocator. -<span class="lineNum"> 711 </span> : * -<span class="lineNum"> 712 </span> : * This constructor fills the %deque with @a n copies of @a value. -<span class="lineNum"> 713 </span> : */ -<span class="lineNum"> 714 </span> : explicit -<span class="lineNum"> 715 </span> : deque(size_type __n, const value_type& __value = value_type(), -<span class="lineNum"> 716 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 717 </span> : : _Base(__a, __n) -<span class="lineNum"> 718 </span> : { _M_fill_initialize(__value); } -<span class="lineNum"> 719 </span> : -<span class="lineNum"> 720 </span> : /** -<span class="lineNum"> 721 </span> : * @brief %Deque copy constructor. -<span class="lineNum"> 722 </span> : * @param x A %deque of identical element and allocator types. -<span class="lineNum"> 723 </span> : * -<span class="lineNum"> 724 </span> : * The newly-created %deque uses a copy of the allocation object used -<span class="lineNum"> 725 </span> : * by @a x. -<span class="lineNum"> 726 </span> : */ -<span class="lineNum"> 727 </span><span class="lineCov"> 13 : deque(const deque& __x)</span> -<span class="lineNum"> 728 </span><span class="lineCov"> 13 : : _Base(__x._M_get_Tp_allocator(), __x.size())</span> -<span class="lineNum"> 729 </span><span class="lineCov"> 13 : { std::__uninitialized_copy_a(__x.begin(), __x.end(), </span> -<span class="lineNum"> 730 </span> : this->_M_impl._M_start, -<span class="lineNum"> 731 </span><span class="lineCov"> 13 : _M_get_Tp_allocator()); }</span> -<span class="lineNum"> 732 </span> : -<span class="lineNum"> 733 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 734 </span> : /** -<span class="lineNum"> 735 </span> : * @brief %Deque move constructor. -<span class="lineNum"> 736 </span> : * @param x A %deque of identical element and allocator types. -<span class="lineNum"> 737 </span> : * -<span class="lineNum"> 738 </span> : * The newly-created %deque contains the exact contents of @a x. -<span class="lineNum"> 739 </span> : * The contents of @a x are a valid, but unspecified %deque. -<span class="lineNum"> 740 </span> : */ -<span class="lineNum"> 741 </span> : deque(deque&& __x) -<span class="lineNum"> 742 </span> : : _Base(std::forward<_Base>(__x)) { } -<span class="lineNum"> 743 </span> : #endif -<span class="lineNum"> 744 </span> : -<span class="lineNum"> 745 </span> : /** -<span class="lineNum"> 746 </span> : * @brief Builds a %deque from a range. -<span class="lineNum"> 747 </span> : * @param first An input iterator. -<span class="lineNum"> 748 </span> : * @param last An input iterator. -<span class="lineNum"> 749 </span> : * @param a An allocator object. -<span class="lineNum"> 750 </span> : * -<span class="lineNum"> 751 </span> : * Create a %deque consisting of copies of the elements from [first, -<span class="lineNum"> 752 </span> : * last). -<span class="lineNum"> 753 </span> : * -<span class="lineNum"> 754 </span> : * If the iterators are forward, bidirectional, or random-access, then -<span class="lineNum"> 755 </span> : * this will call the elements' copy constructor N times (where N is -<span class="lineNum"> 756 </span> : * distance(first,last)) and do no memory reallocation. But if only -<span class="lineNum"> 757 </span> : * input iterators are used, then this will do at most 2N calls to the -<span class="lineNum"> 758 </span> : * copy constructor, and logN memory reallocations. -<span class="lineNum"> 759 </span> : */ -<span class="lineNum"> 760 </span> : template<typename _InputIterator> -<span class="lineNum"> 761 </span> : deque(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 762 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 763 </span> : : _Base(__a) -<span class="lineNum"> 764 </span> : { -<span class="lineNum"> 765 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 766 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 767 </span> : _M_initialize_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 768 </span> : } -<span class="lineNum"> 769 </span> : -<span class="lineNum"> 770 </span> : /** -<span class="lineNum"> 771 </span> : * The dtor only erases the elements, and note that if the elements -<span class="lineNum"> 772 </span> : * themselves are pointers, the pointed-to memory is not touched in any -<span class="lineNum"> 773 </span> : * way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 774 </span> : */ -<span class="lineNum"> 775 </span><span class="lineCov"> 30 : ~deque()</span> -<span class="lineNum"> 776 </span><span class="lineCov"> 30 : { _M_destroy_data(begin(), end(), _M_get_Tp_allocator()); }</span> -<span class="lineNum"> 777 </span> : -<span class="lineNum"> 778 </span> : /** -<span class="lineNum"> 779 </span> : * @brief %Deque assignment operator. -<span class="lineNum"> 780 </span> : * @param x A %deque of identical element and allocator types. -<span class="lineNum"> 781 </span> : * -<span class="lineNum"> 782 </span> : * All the elements of @a x are copied, but unlike the copy constructor, -<span class="lineNum"> 783 </span> : * the allocator object is not copied. -<span class="lineNum"> 784 </span> : */ -<span class="lineNum"> 785 </span> : deque& -<span class="lineNum"> 786 </span> : operator=(const deque& __x); -<span class="lineNum"> 787 </span> : -<span class="lineNum"> 788 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 789 </span> : /** -<span class="lineNum"> 790 </span> : * @brief %Deque move assignment operator. -<span class="lineNum"> 791 </span> : * @param x A %deque of identical element and allocator types. -<span class="lineNum"> 792 </span> : * -<span class="lineNum"> 793 </span> : * The contents of @a x are moved into this deque (without copying). -<span class="lineNum"> 794 </span> : * @a x is a valid, but unspecified %deque. -<span class="lineNum"> 795 </span> : */ -<span class="lineNum"> 796 </span> : deque& -<span class="lineNum"> 797 </span> : operator=(deque&& __x) -<span class="lineNum"> 798 </span> : { -<span class="lineNum"> 799 </span> : // NB: DR 675. -<span class="lineNum"> 800 </span> : this->clear(); -<span class="lineNum"> 801 </span> : this->swap(__x); -<span class="lineNum"> 802 </span> : return *this; -<span class="lineNum"> 803 </span> : } -<span class="lineNum"> 804 </span> : #endif -<span class="lineNum"> 805 </span> : -<span class="lineNum"> 806 </span> : /** -<span class="lineNum"> 807 </span> : * @brief Assigns a given value to a %deque. -<span class="lineNum"> 808 </span> : * @param n Number of elements to be assigned. -<span class="lineNum"> 809 </span> : * @param val Value to be assigned. -<span class="lineNum"> 810 </span> : * -<span class="lineNum"> 811 </span> : * This function fills a %deque with @a n copies of the given -<span class="lineNum"> 812 </span> : * value. Note that the assignment completely changes the -<span class="lineNum"> 813 </span> : * %deque and that the resulting %deque's size is the same as -<span class="lineNum"> 814 </span> : * the number of elements assigned. Old data may be lost. -<span class="lineNum"> 815 </span> : */ -<span class="lineNum"> 816 </span> : void -<span class="lineNum"> 817 </span> : assign(size_type __n, const value_type& __val) -<span class="lineNum"> 818 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 819 </span> : -<span class="lineNum"> 820 </span> : /** -<span class="lineNum"> 821 </span> : * @brief Assigns a range to a %deque. -<span class="lineNum"> 822 </span> : * @param first An input iterator. -<span class="lineNum"> 823 </span> : * @param last An input iterator. -<span class="lineNum"> 824 </span> : * -<span class="lineNum"> 825 </span> : * This function fills a %deque with copies of the elements in the -<span class="lineNum"> 826 </span> : * range [first,last). -<span class="lineNum"> 827 </span> : * -<span class="lineNum"> 828 </span> : * Note that the assignment completely changes the %deque and that the -<span class="lineNum"> 829 </span> : * resulting %deque's size is the same as the number of elements -<span class="lineNum"> 830 </span> : * assigned. Old data may be lost. -<span class="lineNum"> 831 </span> : */ -<span class="lineNum"> 832 </span> : template<typename _InputIterator> -<span class="lineNum"> 833 </span> : void -<span class="lineNum"> 834 </span> : assign(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 835 </span> : { -<span class="lineNum"> 836 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 837 </span> : _M_assign_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 838 </span> : } -<span class="lineNum"> 839 </span> : -<span class="lineNum"> 840 </span> : /// Get a copy of the memory allocation object. -<span class="lineNum"> 841 </span> : allocator_type -<span class="lineNum"> 842 </span> : get_allocator() const -<span class="lineNum"> 843 </span> : { return _Base::get_allocator(); } -<span class="lineNum"> 844 </span> : -<span class="lineNum"> 845 </span> : // iterators -<span class="lineNum"> 846 </span> : /** -<span class="lineNum"> 847 </span> : * Returns a read/write iterator that points to the first element in the -<span class="lineNum"> 848 </span> : * %deque. Iteration is done in ordinary element order. -<span class="lineNum"> 849 </span> : */ -<span class="lineNum"> 850 </span> : iterator -<span class="lineNum"> 851 </span><span class="lineCov"> 7800 : begin()</span> -<span class="lineNum"> 852 </span><span class="lineCov"> 7800 : { return this->_M_impl._M_start; }</span> -<span class="lineNum"> 853 </span> : -<span class="lineNum"> 854 </span> : /** -<span class="lineNum"> 855 </span> : * Returns a read-only (constant) iterator that points to the first -<span class="lineNum"> 856 </span> : * element in the %deque. Iteration is done in ordinary element order. -<span class="lineNum"> 857 </span> : */ -<span class="lineNum"> 858 </span> : const_iterator -<span class="lineNum"> 859 </span><span class="lineCov"> 17 : begin() const</span> -<span class="lineNum"> 860 </span><span class="lineCov"> 17 : { return this->_M_impl._M_start; }</span> -<span class="lineNum"> 861 </span> : -<span class="lineNum"> 862 </span> : /** -<span class="lineNum"> 863 </span> : * Returns a read/write iterator that points one past the last -<span class="lineNum"> 864 </span> : * element in the %deque. Iteration is done in ordinary -<span class="lineNum"> 865 </span> : * element order. -<span class="lineNum"> 866 </span> : */ -<span class="lineNum"> 867 </span> : iterator -<span class="lineNum"> 868 </span><span class="lineCov"> 10575 : end()</span> -<span class="lineNum"> 869 </span><span class="lineCov"> 10575 : { return this->_M_impl._M_finish; }</span> -<span class="lineNum"> 870 </span> : -<span class="lineNum"> 871 </span> : /** -<span class="lineNum"> 872 </span> : * Returns a read-only (constant) iterator that points one past -<span class="lineNum"> 873 </span> : * the last element in the %deque. Iteration is done in -<span class="lineNum"> 874 </span> : * ordinary element order. -<span class="lineNum"> 875 </span> : */ -<span class="lineNum"> 876 </span> : const_iterator -<span class="lineNum"> 877 </span><span class="lineCov"> 17 : end() const</span> -<span class="lineNum"> 878 </span><span class="lineCov"> 17 : { return this->_M_impl._M_finish; }</span> -<span class="lineNum"> 879 </span> : -<span class="lineNum"> 880 </span> : /** -<span class="lineNum"> 881 </span> : * Returns a read/write reverse iterator that points to the -<span class="lineNum"> 882 </span> : * last element in the %deque. Iteration is done in reverse -<span class="lineNum"> 883 </span> : * element order. -<span class="lineNum"> 884 </span> : */ -<span class="lineNum"> 885 </span> : reverse_iterator -<span class="lineNum"> 886 </span> : rbegin() -<span class="lineNum"> 887 </span> : { return reverse_iterator(this->_M_impl._M_finish); } -<span class="lineNum"> 888 </span> : -<span class="lineNum"> 889 </span> : /** -<span class="lineNum"> 890 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 891 </span> : * to the last element in the %deque. Iteration is done in -<span class="lineNum"> 892 </span> : * reverse element order. -<span class="lineNum"> 893 </span> : */ -<span class="lineNum"> 894 </span> : const_reverse_iterator -<span class="lineNum"> 895 </span> : rbegin() const -<span class="lineNum"> 896 </span> : { return const_reverse_iterator(this->_M_impl._M_finish); } -<span class="lineNum"> 897 </span> : -<span class="lineNum"> 898 </span> : /** -<span class="lineNum"> 899 </span> : * Returns a read/write reverse iterator that points to one -<span class="lineNum"> 900 </span> : * before the first element in the %deque. Iteration is done -<span class="lineNum"> 901 </span> : * in reverse element order. -<span class="lineNum"> 902 </span> : */ -<span class="lineNum"> 903 </span> : reverse_iterator -<span class="lineNum"> 904 </span> : rend() -<span class="lineNum"> 905 </span> : { return reverse_iterator(this->_M_impl._M_start); } -<span class="lineNum"> 906 </span> : -<span class="lineNum"> 907 </span> : /** -<span class="lineNum"> 908 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 909 </span> : * to one before the first element in the %deque. Iteration is -<span class="lineNum"> 910 </span> : * done in reverse element order. -<span class="lineNum"> 911 </span> : */ -<span class="lineNum"> 912 </span> : const_reverse_iterator -<span class="lineNum"> 913 </span> : rend() const -<span class="lineNum"> 914 </span> : { return const_reverse_iterator(this->_M_impl._M_start); } -<span class="lineNum"> 915 </span> : -<span class="lineNum"> 916 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 917 </span> : /** -<span class="lineNum"> 918 </span> : * Returns a read-only (constant) iterator that points to the first -<span class="lineNum"> 919 </span> : * element in the %deque. Iteration is done in ordinary element order. -<span class="lineNum"> 920 </span> : */ -<span class="lineNum"> 921 </span> : const_iterator -<span class="lineNum"> 922 </span> : cbegin() const -<span class="lineNum"> 923 </span> : { return this->_M_impl._M_start; } -<span class="lineNum"> 924 </span> : -<span class="lineNum"> 925 </span> : /** -<span class="lineNum"> 926 </span> : * Returns a read-only (constant) iterator that points one past -<span class="lineNum"> 927 </span> : * the last element in the %deque. Iteration is done in -<span class="lineNum"> 928 </span> : * ordinary element order. -<span class="lineNum"> 929 </span> : */ -<span class="lineNum"> 930 </span> : const_iterator -<span class="lineNum"> 931 </span> : cend() const -<span class="lineNum"> 932 </span> : { return this->_M_impl._M_finish; } -<span class="lineNum"> 933 </span> : -<span class="lineNum"> 934 </span> : /** -<span class="lineNum"> 935 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 936 </span> : * to the last element in the %deque. Iteration is done in -<span class="lineNum"> 937 </span> : * reverse element order. -<span class="lineNum"> 938 </span> : */ -<span class="lineNum"> 939 </span> : const_reverse_iterator -<span class="lineNum"> 940 </span> : crbegin() const -<span class="lineNum"> 941 </span> : { return const_reverse_iterator(this->_M_impl._M_finish); } -<span class="lineNum"> 942 </span> : -<span class="lineNum"> 943 </span> : /** -<span class="lineNum"> 944 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 945 </span> : * to one before the first element in the %deque. Iteration is -<span class="lineNum"> 946 </span> : * done in reverse element order. -<span class="lineNum"> 947 </span> : */ -<span class="lineNum"> 948 </span> : const_reverse_iterator -<span class="lineNum"> 949 </span> : crend() const -<span class="lineNum"> 950 </span> : { return const_reverse_iterator(this->_M_impl._M_start); } -<span class="lineNum"> 951 </span> : #endif -<span class="lineNum"> 952 </span> : -<span class="lineNum"> 953 </span> : // [23.2.1.2] capacity -<span class="lineNum"> 954 </span> : /** Returns the number of elements in the %deque. */ -<span class="lineNum"> 955 </span> : size_type -<span class="lineNum"> 956 </span><span class="lineCov"> 111 : size() const</span> -<span class="lineNum"> 957 </span><span class="lineCov"> 111 : { return this->_M_impl._M_finish - this->_M_impl._M_start; }</span> -<span class="lineNum"> 958 </span> : -<span class="lineNum"> 959 </span> : /** Returns the size() of the largest possible %deque. */ -<span class="lineNum"> 960 </span> : size_type -<span class="lineNum"> 961 </span><span class="lineNoCov"> 0 : max_size() const</span> -<span class="lineNum"> 962 </span><span class="lineNoCov"> 0 : { return _M_get_Tp_allocator().max_size(); }</span> -<span class="lineNum"> 963 </span> : -<span class="lineNum"> 964 </span> : /** -<span class="lineNum"> 965 </span> : * @brief Resizes the %deque to the specified number of elements. -<span class="lineNum"> 966 </span> : * @param new_size Number of elements the %deque should contain. -<span class="lineNum"> 967 </span> : * @param x Data with which new elements should be populated. -<span class="lineNum"> 968 </span> : * -<span class="lineNum"> 969 </span> : * This function will %resize the %deque to the specified -<span class="lineNum"> 970 </span> : * number of elements. If the number is smaller than the -<span class="lineNum"> 971 </span> : * %deque's current size the %deque is truncated, otherwise the -<span class="lineNum"> 972 </span> : * %deque is extended and new elements are populated with given -<span class="lineNum"> 973 </span> : * data. -<span class="lineNum"> 974 </span> : */ -<span class="lineNum"> 975 </span> : void -<span class="lineNum"> 976 </span> : resize(size_type __new_size, value_type __x = value_type()) -<span class="lineNum"> 977 </span> : { -<span class="lineNum"> 978 </span> : const size_type __len = size(); -<span class="lineNum"> 979 </span> : if (__new_size < __len) -<span class="lineNum"> 980 </span> : _M_erase_at_end(this->_M_impl._M_start + difference_type(__new_size)); -<span class="lineNum"> 981 </span> : else -<span class="lineNum"> 982 </span> : insert(this->_M_impl._M_finish, __new_size - __len, __x); -<span class="lineNum"> 983 </span> : } -<span class="lineNum"> 984 </span> : -<span class="lineNum"> 985 </span> : /** -<span class="lineNum"> 986 </span> : * Returns true if the %deque is empty. (Thus begin() would -<span class="lineNum"> 987 </span> : * equal end().) -<span class="lineNum"> 988 </span> : */ -<span class="lineNum"> 989 </span> : bool -<span class="lineNum"> 990 </span><span class="lineCov"> 32 : empty() const</span> -<span class="lineNum"> 991 </span><span class="lineCov"> 32 : { return this->_M_impl._M_finish == this->_M_impl._M_start; }</span> -<span class="lineNum"> 992 </span> : -<span class="lineNum"> 993 </span> : // element access -<span class="lineNum"> 994 </span> : /** -<span class="lineNum"> 995 </span> : * @brief Subscript access to the data contained in the %deque. -<span class="lineNum"> 996 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 997 </span> : * accessed. -<span class="lineNum"> 998 </span> : * @return Read/write reference to data. -<span class="lineNum"> 999 </span> : * -<span class="lineNum"> 1000 </span> : * This operator allows for easy, array-style, data access. -<span class="lineNum"> 1001 </span> : * Note that data access with this operator is unchecked and -<span class="lineNum"> 1002 </span> : * out_of_range lookups are not defined. (For checked lookups -<span class="lineNum"> 1003 </span> : * see at().) -<span class="lineNum"> 1004 </span> : */ -<span class="lineNum"> 1005 </span> : reference -<span class="lineNum"> 1006 </span> : operator[](size_type __n) -<span class="lineNum"> 1007 </span> : { return this->_M_impl._M_start[difference_type(__n)]; } -<span class="lineNum"> 1008 </span> : -<span class="lineNum"> 1009 </span> : /** -<span class="lineNum"> 1010 </span> : * @brief Subscript access to the data contained in the %deque. -<span class="lineNum"> 1011 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 1012 </span> : * accessed. -<span class="lineNum"> 1013 </span> : * @return Read-only (constant) reference to data. -<span class="lineNum"> 1014 </span> : * -<span class="lineNum"> 1015 </span> : * This operator allows for easy, array-style, data access. -<span class="lineNum"> 1016 </span> : * Note that data access with this operator is unchecked and -<span class="lineNum"> 1017 </span> : * out_of_range lookups are not defined. (For checked lookups -<span class="lineNum"> 1018 </span> : * see at().) -<span class="lineNum"> 1019 </span> : */ -<span class="lineNum"> 1020 </span> : const_reference -<span class="lineNum"> 1021 </span> : operator[](size_type __n) const -<span class="lineNum"> 1022 </span> : { return this->_M_impl._M_start[difference_type(__n)]; } -<span class="lineNum"> 1023 </span> : -<span class="lineNum"> 1024 </span> : protected: -<span class="lineNum"> 1025 </span> : /// Safety check used only from at(). -<span class="lineNum"> 1026 </span> : void -<span class="lineNum"> 1027 </span> : _M_range_check(size_type __n) const -<span class="lineNum"> 1028 </span> : { -<span class="lineNum"> 1029 </span> : if (__n >= this->size()) -<span class="lineNum"> 1030 </span> : __throw_out_of_range(__N("deque::_M_range_check")); -<span class="lineNum"> 1031 </span> : } -<span class="lineNum"> 1032 </span> : -<span class="lineNum"> 1033 </span> : public: -<span class="lineNum"> 1034 </span> : /** -<span class="lineNum"> 1035 </span> : * @brief Provides access to the data contained in the %deque. -<span class="lineNum"> 1036 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 1037 </span> : * accessed. -<span class="lineNum"> 1038 </span> : * @return Read/write reference to data. -<span class="lineNum"> 1039 </span> : * @throw std::out_of_range If @a n is an invalid index. -<span class="lineNum"> 1040 </span> : * -<span class="lineNum"> 1041 </span> : * This function provides for safer data access. The parameter -<span class="lineNum"> 1042 </span> : * is first checked that it is in the range of the deque. The -<span class="lineNum"> 1043 </span> : * function throws out_of_range if the check fails. -<span class="lineNum"> 1044 </span> : */ -<span class="lineNum"> 1045 </span> : reference -<span class="lineNum"> 1046 </span> : at(size_type __n) -<span class="lineNum"> 1047 </span> : { -<span class="lineNum"> 1048 </span> : _M_range_check(__n); -<span class="lineNum"> 1049 </span> : return (*this)[__n]; -<span class="lineNum"> 1050 </span> : } -<span class="lineNum"> 1051 </span> : -<span class="lineNum"> 1052 </span> : /** -<span class="lineNum"> 1053 </span> : * @brief Provides access to the data contained in the %deque. -<span class="lineNum"> 1054 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 1055 </span> : * accessed. -<span class="lineNum"> 1056 </span> : * @return Read-only (constant) reference to data. -<span class="lineNum"> 1057 </span> : * @throw std::out_of_range If @a n is an invalid index. -<span class="lineNum"> 1058 </span> : * -<span class="lineNum"> 1059 </span> : * This function provides for safer data access. The parameter is first -<span class="lineNum"> 1060 </span> : * checked that it is in the range of the deque. The function throws -<span class="lineNum"> 1061 </span> : * out_of_range if the check fails. -<span class="lineNum"> 1062 </span> : */ -<span class="lineNum"> 1063 </span> : const_reference -<span class="lineNum"> 1064 </span> : at(size_type __n) const -<span class="lineNum"> 1065 </span> : { -<span class="lineNum"> 1066 </span> : _M_range_check(__n); -<span class="lineNum"> 1067 </span> : return (*this)[__n]; -<span class="lineNum"> 1068 </span> : } -<span class="lineNum"> 1069 </span> : -<span class="lineNum"> 1070 </span> : /** -<span class="lineNum"> 1071 </span> : * Returns a read/write reference to the data at the first -<span class="lineNum"> 1072 </span> : * element of the %deque. -<span class="lineNum"> 1073 </span> : */ -<span class="lineNum"> 1074 </span> : reference -<span class="lineNum"> 1075 </span> : front() -<span class="lineNum"> 1076 </span> : { return *begin(); } -<span class="lineNum"> 1077 </span> : -<span class="lineNum"> 1078 </span> : /** -<span class="lineNum"> 1079 </span> : * Returns a read-only (constant) reference to the data at the first -<span class="lineNum"> 1080 </span> : * element of the %deque. -<span class="lineNum"> 1081 </span> : */ -<span class="lineNum"> 1082 </span> : const_reference -<span class="lineNum"> 1083 </span> : front() const -<span class="lineNum"> 1084 </span> : { return *begin(); } -<span class="lineNum"> 1085 </span> : -<span class="lineNum"> 1086 </span> : /** -<span class="lineNum"> 1087 </span> : * Returns a read/write reference to the data at the last element of the -<span class="lineNum"> 1088 </span> : * %deque. -<span class="lineNum"> 1089 </span> : */ -<span class="lineNum"> 1090 </span> : reference -<span class="lineNum"> 1091 </span><span class="lineCov"> 39 : back()</span> -<span class="lineNum"> 1092 </span> : { -<span class="lineNum"> 1093 </span><span class="lineCov"> 39 : iterator __tmp = end();</span> -<span class="lineNum"> 1094 </span><span class="lineCov"> 39 : --__tmp;</span> -<span class="lineNum"> 1095 </span><span class="lineCov"> 39 : return *__tmp;</span> -<span class="lineNum"> 1096 </span> : } -<span class="lineNum"> 1097 </span> : -<span class="lineNum"> 1098 </span> : /** -<span class="lineNum"> 1099 </span> : * Returns a read-only (constant) reference to the data at the last -<span class="lineNum"> 1100 </span> : * element of the %deque. -<span class="lineNum"> 1101 </span> : */ -<span class="lineNum"> 1102 </span> : const_reference -<span class="lineNum"> 1103 </span> : back() const -<span class="lineNum"> 1104 </span> : { -<span class="lineNum"> 1105 </span> : const_iterator __tmp = end(); -<span class="lineNum"> 1106 </span> : --__tmp; -<span class="lineNum"> 1107 </span> : return *__tmp; -<span class="lineNum"> 1108 </span> : } -<span class="lineNum"> 1109 </span> : -<span class="lineNum"> 1110 </span> : // [23.2.1.2] modifiers -<span class="lineNum"> 1111 </span> : /** -<span class="lineNum"> 1112 </span> : * @brief Add data to the front of the %deque. -<span class="lineNum"> 1113 </span> : * @param x Data to be added. -<span class="lineNum"> 1114 </span> : * -<span class="lineNum"> 1115 </span> : * This is a typical stack operation. The function creates an -<span class="lineNum"> 1116 </span> : * element at the front of the %deque and assigns the given -<span class="lineNum"> 1117 </span> : * data to it. Due to the nature of a %deque this operation -<span class="lineNum"> 1118 </span> : * can be done in constant time. -<span class="lineNum"> 1119 </span> : */ -<span class="lineNum"> 1120 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1121 </span> : void -<span class="lineNum"> 1122 </span> : push_front(const value_type& __x) -<span class="lineNum"> 1123 </span> : { -<span class="lineNum"> 1124 </span> : if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) -<span class="lineNum"> 1125 </span> : { -<span class="lineNum"> 1126 </span> : this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, __x); -<span class="lineNum"> 1127 </span> : --this->_M_impl._M_start._M_cur; -<span class="lineNum"> 1128 </span> : } -<span class="lineNum"> 1129 </span> : else -<span class="lineNum"> 1130 </span> : _M_push_front_aux(__x); -<span class="lineNum"> 1131 </span> : } -<span class="lineNum"> 1132 </span> : #else -<span class="lineNum"> 1133 </span> : template<typename... _Args> -<span class="lineNum"> 1134 </span> : void -<span class="lineNum"> 1135 </span> : push_front(_Args&&... __args) -<span class="lineNum"> 1136 </span> : { -<span class="lineNum"> 1137 </span> : if (this->_M_impl._M_start._M_cur != this->_M_impl._M_start._M_first) -<span class="lineNum"> 1138 </span> : { -<span class="lineNum"> 1139 </span> : this->_M_impl.construct(this->_M_impl._M_start._M_cur - 1, -<span class="lineNum"> 1140 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 1141 </span> : --this->_M_impl._M_start._M_cur; -<span class="lineNum"> 1142 </span> : } -<span class="lineNum"> 1143 </span> : else -<span class="lineNum"> 1144 </span> : _M_push_front_aux(std::forward<_Args>(__args)...); -<span class="lineNum"> 1145 </span> : } -<span class="lineNum"> 1146 </span> : #endif -<span class="lineNum"> 1147 </span> : -<span class="lineNum"> 1148 </span> : /** -<span class="lineNum"> 1149 </span> : * @brief Add data to the end of the %deque. -<span class="lineNum"> 1150 </span> : * @param x Data to be added. -<span class="lineNum"> 1151 </span> : * -<span class="lineNum"> 1152 </span> : * This is a typical stack operation. The function creates an -<span class="lineNum"> 1153 </span> : * element at the end of the %deque and assigns the given data -<span class="lineNum"> 1154 </span> : * to it. Due to the nature of a %deque this operation can be -<span class="lineNum"> 1155 </span> : * done in constant time. -<span class="lineNum"> 1156 </span> : */ -<span class="lineNum"> 1157 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1158 </span> : void -<span class="lineNum"> 1159 </span><span class="lineCov"> 12012 : push_back(const value_type& __x)</span> -<span class="lineNum"> 1160 </span> : { -<span class="lineNum"> 1161 </span><span class="lineCov"> 12012 : if (this->_M_impl._M_finish._M_cur</span> -<span class="lineNum"> 1162 </span> : != this->_M_impl._M_finish._M_last - 1) -<span class="lineNum"> 1163 </span> : { -<span class="lineNum"> 1164 </span><span class="lineCov"> 11999 : this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __x);</span> -<span class="lineNum"> 1165 </span><span class="lineCov"> 11999 : ++this->_M_impl._M_finish._M_cur;</span> -<span class="lineNum"> 1166 </span> : } -<span class="lineNum"> 1167 </span> : else -<span class="lineNum"> 1168 </span><span class="lineCov"> 13 : _M_push_back_aux(__x);</span> -<span class="lineNum"> 1169 </span><span class="lineCov"> 12012 : }</span> -<span class="lineNum"> 1170 </span> : #else -<span class="lineNum"> 1171 </span> : template<typename... _Args> -<span class="lineNum"> 1172 </span> : void -<span class="lineNum"> 1173 </span> : push_back(_Args&&... __args) -<span class="lineNum"> 1174 </span> : { -<span class="lineNum"> 1175 </span> : if (this->_M_impl._M_finish._M_cur -<span class="lineNum"> 1176 </span> : != this->_M_impl._M_finish._M_last - 1) -<span class="lineNum"> 1177 </span> : { -<span class="lineNum"> 1178 </span> : this->_M_impl.construct(this->_M_impl._M_finish._M_cur, -<span class="lineNum"> 1179 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 1180 </span> : ++this->_M_impl._M_finish._M_cur; -<span class="lineNum"> 1181 </span> : } -<span class="lineNum"> 1182 </span> : else -<span class="lineNum"> 1183 </span> : _M_push_back_aux(std::forward<_Args>(__args)...); -<span class="lineNum"> 1184 </span> : } -<span class="lineNum"> 1185 </span> : #endif -<span class="lineNum"> 1186 </span> : -<span class="lineNum"> 1187 </span> : /** -<span class="lineNum"> 1188 </span> : * @brief Removes first element. -<span class="lineNum"> 1189 </span> : * -<span class="lineNum"> 1190 </span> : * This is a typical stack operation. It shrinks the %deque by one. -<span class="lineNum"> 1191 </span> : * -<span class="lineNum"> 1192 </span> : * Note that no data is returned, and if the first element's data is -<span class="lineNum"> 1193 </span> : * needed, it should be retrieved before pop_front() is called. -<span class="lineNum"> 1194 </span> : */ -<span class="lineNum"> 1195 </span> : void -<span class="lineNum"> 1196 </span> : pop_front() -<span class="lineNum"> 1197 </span> : { -<span class="lineNum"> 1198 </span> : if (this->_M_impl._M_start._M_cur -<span class="lineNum"> 1199 </span> : != this->_M_impl._M_start._M_last - 1) -<span class="lineNum"> 1200 </span> : { -<span class="lineNum"> 1201 </span> : this->_M_impl.destroy(this->_M_impl._M_start._M_cur); -<span class="lineNum"> 1202 </span> : ++this->_M_impl._M_start._M_cur; -<span class="lineNum"> 1203 </span> : } -<span class="lineNum"> 1204 </span> : else -<span class="lineNum"> 1205 </span> : _M_pop_front_aux(); -<span class="lineNum"> 1206 </span> : } -<span class="lineNum"> 1207 </span> : -<span class="lineNum"> 1208 </span> : /** -<span class="lineNum"> 1209 </span> : * @brief Removes last element. -<span class="lineNum"> 1210 </span> : * -<span class="lineNum"> 1211 </span> : * This is a typical stack operation. It shrinks the %deque by one. -<span class="lineNum"> 1212 </span> : * -<span class="lineNum"> 1213 </span> : * Note that no data is returned, and if the last element's data is -<span class="lineNum"> 1214 </span> : * needed, it should be retrieved before pop_back() is called. -<span class="lineNum"> 1215 </span> : */ -<span class="lineNum"> 1216 </span> : void -<span class="lineNum"> 1217 </span><span class="lineCov"> 24 : pop_back()</span> -<span class="lineNum"> 1218 </span> : { -<span class="lineNum"> 1219 </span><span class="lineCov"> 24 : if (this->_M_impl._M_finish._M_cur</span> -<span class="lineNum"> 1220 </span> : != this->_M_impl._M_finish._M_first) -<span class="lineNum"> 1221 </span> : { -<span class="lineNum"> 1222 </span><span class="lineCov"> 24 : --this->_M_impl._M_finish._M_cur;</span> -<span class="lineNum"> 1223 </span><span class="lineCov"> 24 : this->_M_impl.destroy(this->_M_impl._M_finish._M_cur);</span> -<span class="lineNum"> 1224 </span> : } -<span class="lineNum"> 1225 </span> : else -<span class="lineNum"> 1226 </span><span class="lineNoCov"> 0 : _M_pop_back_aux();</span> -<span class="lineNum"> 1227 </span><span class="lineCov"> 24 : }</span> -<span class="lineNum"> 1228 </span> : -<span class="lineNum"> 1229 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1230 </span> : /** -<span class="lineNum"> 1231 </span> : * @brief Inserts an object in %deque before specified iterator. -<span class="lineNum"> 1232 </span> : * @param position An iterator into the %deque. -<span class="lineNum"> 1233 </span> : * @param args Arguments. -<span class="lineNum"> 1234 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 1235 </span> : * -<span class="lineNum"> 1236 </span> : * This function will insert an object of type T constructed -<span class="lineNum"> 1237 </span> : * with T(std::forward<Args>(args)...) before the specified location. -<span class="lineNum"> 1238 </span> : */ -<span class="lineNum"> 1239 </span> : template<typename... _Args> -<span class="lineNum"> 1240 </span> : iterator -<span class="lineNum"> 1241 </span> : emplace(iterator __position, _Args&&... __args); -<span class="lineNum"> 1242 </span> : #endif -<span class="lineNum"> 1243 </span> : -<span class="lineNum"> 1244 </span> : /** -<span class="lineNum"> 1245 </span> : * @brief Inserts given value into %deque before specified iterator. -<span class="lineNum"> 1246 </span> : * @param position An iterator into the %deque. -<span class="lineNum"> 1247 </span> : * @param x Data to be inserted. -<span class="lineNum"> 1248 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 1249 </span> : * -<span class="lineNum"> 1250 </span> : * This function will insert a copy of the given value before the -<span class="lineNum"> 1251 </span> : * specified location. -<span class="lineNum"> 1252 </span> : */ -<span class="lineNum"> 1253 </span> : iterator -<span class="lineNum"> 1254 </span> : insert(iterator __position, const value_type& __x); -<span class="lineNum"> 1255 </span> : -<span class="lineNum"> 1256 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1257 </span> : /** -<span class="lineNum"> 1258 </span> : * @brief Inserts given rvalue into %deque before specified iterator. -<span class="lineNum"> 1259 </span> : * @param position An iterator into the %deque. -<span class="lineNum"> 1260 </span> : * @param x Data to be inserted. -<span class="lineNum"> 1261 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 1262 </span> : * -<span class="lineNum"> 1263 </span> : * This function will insert a copy of the given rvalue before the -<span class="lineNum"> 1264 </span> : * specified location. -<span class="lineNum"> 1265 </span> : */ -<span class="lineNum"> 1266 </span> : iterator -<span class="lineNum"> 1267 </span> : insert(iterator __position, value_type&& __x) -<span class="lineNum"> 1268 </span> : { return emplace(__position, std::move(__x)); } -<span class="lineNum"> 1269 </span> : #endif -<span class="lineNum"> 1270 </span> : -<span class="lineNum"> 1271 </span> : /** -<span class="lineNum"> 1272 </span> : * @brief Inserts a number of copies of given data into the %deque. -<span class="lineNum"> 1273 </span> : * @param position An iterator into the %deque. -<span class="lineNum"> 1274 </span> : * @param n Number of elements to be inserted. -<span class="lineNum"> 1275 </span> : * @param x Data to be inserted. -<span class="lineNum"> 1276 </span> : * -<span class="lineNum"> 1277 </span> : * This function will insert a specified number of copies of the given -<span class="lineNum"> 1278 </span> : * data before the location specified by @a position. -<span class="lineNum"> 1279 </span> : */ -<span class="lineNum"> 1280 </span> : void -<span class="lineNum"> 1281 </span> : insert(iterator __position, size_type __n, const value_type& __x) -<span class="lineNum"> 1282 </span> : { _M_fill_insert(__position, __n, __x); } -<span class="lineNum"> 1283 </span> : -<span class="lineNum"> 1284 </span> : /** -<span class="lineNum"> 1285 </span> : * @brief Inserts a range into the %deque. -<span class="lineNum"> 1286 </span> : * @param position An iterator into the %deque. -<span class="lineNum"> 1287 </span> : * @param first An input iterator. -<span class="lineNum"> 1288 </span> : * @param last An input iterator. -<span class="lineNum"> 1289 </span> : * -<span class="lineNum"> 1290 </span> : * This function will insert copies of the data in the range -<span class="lineNum"> 1291 </span> : * [first,last) into the %deque before the location specified -<span class="lineNum"> 1292 </span> : * by @a pos. This is known as "range insert." -<span class="lineNum"> 1293 </span> : */ -<span class="lineNum"> 1294 </span> : template<typename _InputIterator> -<span class="lineNum"> 1295 </span> : void -<span class="lineNum"> 1296 </span> : insert(iterator __position, _InputIterator __first, -<span class="lineNum"> 1297 </span><span class="lineNoCov"> 0 : _InputIterator __last)</span> -<span class="lineNum"> 1298 </span> : { -<span class="lineNum"> 1299 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 1300 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 1301 </span><span class="lineNoCov"> 0 : _M_insert_dispatch(__position, __first, __last, _Integral());</span> -<span class="lineNum"> 1302 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1303 </span> : -<span class="lineNum"> 1304 </span> : /** -<span class="lineNum"> 1305 </span> : * @brief Remove element at given position. -<span class="lineNum"> 1306 </span> : * @param position Iterator pointing to element to be erased. -<span class="lineNum"> 1307 </span> : * @return An iterator pointing to the next element (or end()). -<span class="lineNum"> 1308 </span> : * -<span class="lineNum"> 1309 </span> : * This function will erase the element at the given position and thus -<span class="lineNum"> 1310 </span> : * shorten the %deque by one. -<span class="lineNum"> 1311 </span> : * -<span class="lineNum"> 1312 </span> : * The user is cautioned that -<span class="lineNum"> 1313 </span> : * this function only erases the element, and that if the element is -<span class="lineNum"> 1314 </span> : * itself a pointer, the pointed-to memory is not touched in any way. -<span class="lineNum"> 1315 </span> : * Managing the pointer is the user's responsibility. -<span class="lineNum"> 1316 </span> : */ -<span class="lineNum"> 1317 </span> : iterator -<span class="lineNum"> 1318 </span> : erase(iterator __position); -<span class="lineNum"> 1319 </span> : -<span class="lineNum"> 1320 </span> : /** -<span class="lineNum"> 1321 </span> : * @brief Remove a range of elements. -<span class="lineNum"> 1322 </span> : * @param first Iterator pointing to the first element to be erased. -<span class="lineNum"> 1323 </span> : * @param last Iterator pointing to one past the last element to be -<span class="lineNum"> 1324 </span> : * erased. -<span class="lineNum"> 1325 </span> : * @return An iterator pointing to the element pointed to by @a last -<span class="lineNum"> 1326 </span> : * prior to erasing (or end()). -<span class="lineNum"> 1327 </span> : * -<span class="lineNum"> 1328 </span> : * This function will erase the elements in the range [first,last) and -<span class="lineNum"> 1329 </span> : * shorten the %deque accordingly. -<span class="lineNum"> 1330 </span> : * -<span class="lineNum"> 1331 </span> : * The user is cautioned that -<span class="lineNum"> 1332 </span> : * this function only erases the elements, and that if the elements -<span class="lineNum"> 1333 </span> : * themselves are pointers, the pointed-to memory is not touched in any -<span class="lineNum"> 1334 </span> : * way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 1335 </span> : */ -<span class="lineNum"> 1336 </span> : iterator -<span class="lineNum"> 1337 </span> : erase(iterator __first, iterator __last); -<span class="lineNum"> 1338 </span> : -<span class="lineNum"> 1339 </span> : /** -<span class="lineNum"> 1340 </span> : * @brief Swaps data with another %deque. -<span class="lineNum"> 1341 </span> : * @param x A %deque of the same element and allocator types. -<span class="lineNum"> 1342 </span> : * -<span class="lineNum"> 1343 </span> : * This exchanges the elements between two deques in constant time. -<span class="lineNum"> 1344 </span> : * (Four pointers, so it should be quite fast.) -<span class="lineNum"> 1345 </span> : * Note that the global std::swap() function is specialized such that -<span class="lineNum"> 1346 </span> : * std::swap(d1,d2) will feed to this function. -<span class="lineNum"> 1347 </span> : */ -<span class="lineNum"> 1348 </span> : void -<span class="lineNum"> 1349 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1350 </span> : swap(deque&& __x) -<span class="lineNum"> 1351 </span> : #else -<span class="lineNum"> 1352 </span> : swap(deque& __x) -<span class="lineNum"> 1353 </span> : #endif -<span class="lineNum"> 1354 </span> : { -<span class="lineNum"> 1355 </span> : std::swap(this->_M_impl._M_start, __x._M_impl._M_start); -<span class="lineNum"> 1356 </span> : std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); -<span class="lineNum"> 1357 </span> : std::swap(this->_M_impl._M_map, __x._M_impl._M_map); -<span class="lineNum"> 1358 </span> : std::swap(this->_M_impl._M_map_size, __x._M_impl._M_map_size); -<span class="lineNum"> 1359 </span> : -<span class="lineNum"> 1360 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1361 </span> : // 431. Swapping containers with unequal allocators. -<span class="lineNum"> 1362 </span> : std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(), -<span class="lineNum"> 1363 </span> : __x._M_get_Tp_allocator()); -<span class="lineNum"> 1364 </span> : } -<span class="lineNum"> 1365 </span> : -<span class="lineNum"> 1366 </span> : /** -<span class="lineNum"> 1367 </span> : * Erases all the elements. Note that this function only erases the -<span class="lineNum"> 1368 </span> : * elements, and that if the elements themselves are pointers, the -<span class="lineNum"> 1369 </span> : * pointed-to memory is not touched in any way. Managing the pointer is -<span class="lineNum"> 1370 </span> : * the user's responsibility. -<span class="lineNum"> 1371 </span> : */ -<span class="lineNum"> 1372 </span> : void -<span class="lineNum"> 1373 </span><span class="lineCov"> 922 : clear()</span> -<span class="lineNum"> 1374 </span><span class="lineCov"> 922 : { _M_erase_at_end(begin()); }</span> -<span class="lineNum"> 1375 </span> : -<span class="lineNum"> 1376 </span> : protected: -<span class="lineNum"> 1377 </span> : // Internal constructor functions follow. -<span class="lineNum"> 1378 </span> : -<span class="lineNum"> 1379 </span> : // called by the range constructor to implement [23.1.1]/9 -<span class="lineNum"> 1380 </span> : -<span class="lineNum"> 1381 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1382 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1383 </span> : template<typename _Integer> -<span class="lineNum"> 1384 </span> : void -<span class="lineNum"> 1385 </span> : _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) -<span class="lineNum"> 1386 </span> : { -<span class="lineNum"> 1387 </span> : _M_initialize_map(static_cast<size_type>(__n)); -<span class="lineNum"> 1388 </span> : _M_fill_initialize(__x); -<span class="lineNum"> 1389 </span> : } -<span class="lineNum"> 1390 </span> : -<span class="lineNum"> 1391 </span> : // called by the range constructor to implement [23.1.1]/9 -<span class="lineNum"> 1392 </span> : template<typename _InputIterator> -<span class="lineNum"> 1393 </span> : void -<span class="lineNum"> 1394 </span> : _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1395 </span> : __false_type) -<span class="lineNum"> 1396 </span> : { -<span class="lineNum"> 1397 </span> : typedef typename std::iterator_traits<_InputIterator>:: -<span class="lineNum"> 1398 </span> : iterator_category _IterCategory; -<span class="lineNum"> 1399 </span> : _M_range_initialize(__first, __last, _IterCategory()); -<span class="lineNum"> 1400 </span> : } -<span class="lineNum"> 1401 </span> : -<span class="lineNum"> 1402 </span> : // called by the second initialize_dispatch above -<span class="lineNum"> 1403 </span> : //@{ -<span class="lineNum"> 1404 </span> : /** -<span class="lineNum"> 1405 </span> : * @brief Fills the deque with whatever is in [first,last). -<span class="lineNum"> 1406 </span> : * @param first An input iterator. -<span class="lineNum"> 1407 </span> : * @param last An input iterator. -<span class="lineNum"> 1408 </span> : * @return Nothing. -<span class="lineNum"> 1409 </span> : * -<span class="lineNum"> 1410 </span> : * If the iterators are actually forward iterators (or better), then the -<span class="lineNum"> 1411 </span> : * memory layout can be done all at once. Else we move forward using -<span class="lineNum"> 1412 </span> : * push_back on each value from the iterator. -<span class="lineNum"> 1413 </span> : */ -<span class="lineNum"> 1414 </span> : template<typename _InputIterator> -<span class="lineNum"> 1415 </span> : void -<span class="lineNum"> 1416 </span> : _M_range_initialize(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1417 </span> : std::input_iterator_tag); -<span class="lineNum"> 1418 </span> : -<span class="lineNum"> 1419 </span> : // called by the second initialize_dispatch above -<span class="lineNum"> 1420 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1421 </span> : void -<span class="lineNum"> 1422 </span> : _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1423 </span> : std::forward_iterator_tag); -<span class="lineNum"> 1424 </span> : //@} -<span class="lineNum"> 1425 </span> : -<span class="lineNum"> 1426 </span> : /** -<span class="lineNum"> 1427 </span> : * @brief Fills the %deque with copies of value. -<span class="lineNum"> 1428 </span> : * @param value Initial value. -<span class="lineNum"> 1429 </span> : * @return Nothing. -<span class="lineNum"> 1430 </span> : * @pre _M_start and _M_finish have already been initialized, -<span class="lineNum"> 1431 </span> : * but none of the %deque's elements have yet been constructed. -<span class="lineNum"> 1432 </span> : * -<span class="lineNum"> 1433 </span> : * This function is called only when the user provides an explicit size -<span class="lineNum"> 1434 </span> : * (with or without an explicit exemplar value). -<span class="lineNum"> 1435 </span> : */ -<span class="lineNum"> 1436 </span> : void -<span class="lineNum"> 1437 </span> : _M_fill_initialize(const value_type& __value); -<span class="lineNum"> 1438 </span> : -<span class="lineNum"> 1439 </span> : // Internal assign functions follow. The *_aux functions do the actual -<span class="lineNum"> 1440 </span> : // assignment work for the range versions. -<span class="lineNum"> 1441 </span> : -<span class="lineNum"> 1442 </span> : // called by the range assign to implement [23.1.1]/9 -<span class="lineNum"> 1443 </span> : -<span class="lineNum"> 1444 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1445 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1446 </span> : template<typename _Integer> -<span class="lineNum"> 1447 </span> : void -<span class="lineNum"> 1448 </span> : _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) -<span class="lineNum"> 1449 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 1450 </span> : -<span class="lineNum"> 1451 </span> : // called by the range assign to implement [23.1.1]/9 -<span class="lineNum"> 1452 </span> : template<typename _InputIterator> -<span class="lineNum"> 1453 </span> : void -<span class="lineNum"> 1454 </span> : _M_assign_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1455 </span> : __false_type) -<span class="lineNum"> 1456 </span> : { -<span class="lineNum"> 1457 </span> : typedef typename std::iterator_traits<_InputIterator>:: -<span class="lineNum"> 1458 </span> : iterator_category _IterCategory; -<span class="lineNum"> 1459 </span> : _M_assign_aux(__first, __last, _IterCategory()); -<span class="lineNum"> 1460 </span> : } -<span class="lineNum"> 1461 </span> : -<span class="lineNum"> 1462 </span> : // called by the second assign_dispatch above -<span class="lineNum"> 1463 </span> : template<typename _InputIterator> -<span class="lineNum"> 1464 </span> : void -<span class="lineNum"> 1465 </span> : _M_assign_aux(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1466 </span> : std::input_iterator_tag); -<span class="lineNum"> 1467 </span> : -<span class="lineNum"> 1468 </span> : // called by the second assign_dispatch above -<span class="lineNum"> 1469 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1470 </span> : void -<span class="lineNum"> 1471 </span> : _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1472 </span> : std::forward_iterator_tag) -<span class="lineNum"> 1473 </span> : { -<span class="lineNum"> 1474 </span> : const size_type __len = std::distance(__first, __last); -<span class="lineNum"> 1475 </span> : if (__len > size()) -<span class="lineNum"> 1476 </span> : { -<span class="lineNum"> 1477 </span> : _ForwardIterator __mid = __first; -<span class="lineNum"> 1478 </span> : std::advance(__mid, size()); -<span class="lineNum"> 1479 </span> : std::copy(__first, __mid, begin()); -<span class="lineNum"> 1480 </span> : insert(end(), __mid, __last); -<span class="lineNum"> 1481 </span> : } -<span class="lineNum"> 1482 </span> : else -<span class="lineNum"> 1483 </span> : _M_erase_at_end(std::copy(__first, __last, begin())); -<span class="lineNum"> 1484 </span> : } -<span class="lineNum"> 1485 </span> : -<span class="lineNum"> 1486 </span> : // Called by assign(n,t), and the range assign when it turns out -<span class="lineNum"> 1487 </span> : // to be the same thing. -<span class="lineNum"> 1488 </span> : void -<span class="lineNum"> 1489 </span> : _M_fill_assign(size_type __n, const value_type& __val) -<span class="lineNum"> 1490 </span> : { -<span class="lineNum"> 1491 </span> : if (__n > size()) -<span class="lineNum"> 1492 </span> : { -<span class="lineNum"> 1493 </span> : std::fill(begin(), end(), __val); -<span class="lineNum"> 1494 </span> : insert(end(), __n - size(), __val); -<span class="lineNum"> 1495 </span> : } -<span class="lineNum"> 1496 </span> : else -<span class="lineNum"> 1497 </span> : { -<span class="lineNum"> 1498 </span> : _M_erase_at_end(begin() + difference_type(__n)); -<span class="lineNum"> 1499 </span> : std::fill(begin(), end(), __val); -<span class="lineNum"> 1500 </span> : } -<span class="lineNum"> 1501 </span> : } -<span class="lineNum"> 1502 </span> : -<span class="lineNum"> 1503 </span> : //@{ -<span class="lineNum"> 1504 </span> : /// Helper functions for push_* and pop_*. -<span class="lineNum"> 1505 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1506 </span> : void _M_push_back_aux(const value_type&); -<span class="lineNum"> 1507 </span> : -<span class="lineNum"> 1508 </span> : void _M_push_front_aux(const value_type&); -<span class="lineNum"> 1509 </span> : #else -<span class="lineNum"> 1510 </span> : template<typename... _Args> -<span class="lineNum"> 1511 </span> : void _M_push_back_aux(_Args&&... __args); -<span class="lineNum"> 1512 </span> : -<span class="lineNum"> 1513 </span> : template<typename... _Args> -<span class="lineNum"> 1514 </span> : void _M_push_front_aux(_Args&&... __args); -<span class="lineNum"> 1515 </span> : #endif -<span class="lineNum"> 1516 </span> : -<span class="lineNum"> 1517 </span> : void _M_pop_back_aux(); -<span class="lineNum"> 1518 </span> : -<span class="lineNum"> 1519 </span> : void _M_pop_front_aux(); -<span class="lineNum"> 1520 </span> : //@} -<span class="lineNum"> 1521 </span> : -<span class="lineNum"> 1522 </span> : // Internal insert functions follow. The *_aux functions do the actual -<span class="lineNum"> 1523 </span> : // insertion work when all shortcuts fail. -<span class="lineNum"> 1524 </span> : -<span class="lineNum"> 1525 </span> : // called by the range insert to implement [23.1.1]/9 -<span class="lineNum"> 1526 </span> : -<span class="lineNum"> 1527 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1528 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1529 </span> : template<typename _Integer> -<span class="lineNum"> 1530 </span> : void -<span class="lineNum"> 1531 </span> : _M_insert_dispatch(iterator __pos, -<span class="lineNum"> 1532 </span> : _Integer __n, _Integer __x, __true_type) -<span class="lineNum"> 1533 </span> : { _M_fill_insert(__pos, __n, __x); } -<span class="lineNum"> 1534 </span> : -<span class="lineNum"> 1535 </span> : // called by the range insert to implement [23.1.1]/9 -<span class="lineNum"> 1536 </span> : template<typename _InputIterator> -<span class="lineNum"> 1537 </span> : void -<span class="lineNum"> 1538 </span> : _M_insert_dispatch(iterator __pos, -<span class="lineNum"> 1539 </span> : _InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1540 </span><span class="lineNoCov"> 0 : __false_type)</span> -<span class="lineNum"> 1541 </span> : { -<span class="lineNum"> 1542 </span> : typedef typename std::iterator_traits<_InputIterator>:: -<span class="lineNum"> 1543 </span> : iterator_category _IterCategory; -<span class="lineNum"> 1544 </span><span class="lineNoCov"> 0 : _M_range_insert_aux(__pos, __first, __last, _IterCategory());</span> -<span class="lineNum"> 1545 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1546 </span> : -<span class="lineNum"> 1547 </span> : // called by the second insert_dispatch above -<span class="lineNum"> 1548 </span> : template<typename _InputIterator> -<span class="lineNum"> 1549 </span> : void -<span class="lineNum"> 1550 </span> : _M_range_insert_aux(iterator __pos, _InputIterator __first, -<span class="lineNum"> 1551 </span> : _InputIterator __last, std::input_iterator_tag); -<span class="lineNum"> 1552 </span> : -<span class="lineNum"> 1553 </span> : // called by the second insert_dispatch above -<span class="lineNum"> 1554 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1555 </span> : void -<span class="lineNum"> 1556 </span> : _M_range_insert_aux(iterator __pos, _ForwardIterator __first, -<span class="lineNum"> 1557 </span> : _ForwardIterator __last, std::forward_iterator_tag); -<span class="lineNum"> 1558 </span> : -<span class="lineNum"> 1559 </span> : // Called by insert(p,n,x), and the range insert when it turns out to be -<span class="lineNum"> 1560 </span> : // the same thing. Can use fill functions in optimal situations, -<span class="lineNum"> 1561 </span> : // otherwise passes off to insert_aux(p,n,x). -<span class="lineNum"> 1562 </span> : void -<span class="lineNum"> 1563 </span> : _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); -<span class="lineNum"> 1564 </span> : -<span class="lineNum"> 1565 </span> : // called by insert(p,x) -<span class="lineNum"> 1566 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1567 </span> : iterator -<span class="lineNum"> 1568 </span> : _M_insert_aux(iterator __pos, const value_type& __x); -<span class="lineNum"> 1569 </span> : #else -<span class="lineNum"> 1570 </span> : template<typename... _Args> -<span class="lineNum"> 1571 </span> : iterator -<span class="lineNum"> 1572 </span> : _M_insert_aux(iterator __pos, _Args&&... __args); -<span class="lineNum"> 1573 </span> : #endif -<span class="lineNum"> 1574 </span> : -<span class="lineNum"> 1575 </span> : // called by insert(p,n,x) via fill_insert -<span class="lineNum"> 1576 </span> : void -<span class="lineNum"> 1577 </span> : _M_insert_aux(iterator __pos, size_type __n, const value_type& __x); -<span class="lineNum"> 1578 </span> : -<span class="lineNum"> 1579 </span> : // called by range_insert_aux for forward iterators -<span class="lineNum"> 1580 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1581 </span> : void -<span class="lineNum"> 1582 </span> : _M_insert_aux(iterator __pos, -<span class="lineNum"> 1583 </span> : _ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1584 </span> : size_type __n); -<span class="lineNum"> 1585 </span> : -<span class="lineNum"> 1586 </span> : -<span class="lineNum"> 1587 </span> : // Internal erase functions follow. -<span class="lineNum"> 1588 </span> : -<span class="lineNum"> 1589 </span> : void -<span class="lineNum"> 1590 </span> : _M_destroy_data_aux(iterator __first, iterator __last); -<span class="lineNum"> 1591 </span> : -<span class="lineNum"> 1592 </span> : // Called by ~deque(). -<span class="lineNum"> 1593 </span> : // NB: Doesn't deallocate the nodes. -<span class="lineNum"> 1594 </span> : template<typename _Alloc1> -<span class="lineNum"> 1595 </span> : void -<span class="lineNum"> 1596 </span> : _M_destroy_data(iterator __first, iterator __last, const _Alloc1&) -<span class="lineNum"> 1597 </span> : { _M_destroy_data_aux(__first, __last); } -<span class="lineNum"> 1598 </span> : -<span class="lineNum"> 1599 </span> : void -<span class="lineNum"> 1600 </span> : _M_destroy_data(iterator __first, iterator __last, -<span class="lineNum"> 1601 </span><span class="lineCov"> 1046 : const std::allocator<_Tp>&)</span> -<span class="lineNum"> 1602 </span> : { -<span class="lineNum"> 1603 </span> : if (!__has_trivial_destructor(value_type)) -<span class="lineNum"> 1604 </span><span class="lineCov"> 26 : _M_destroy_data_aux(__first, __last);</span> -<span class="lineNum"> 1605 </span><span class="lineCov"> 1046 : }</span> -<span class="lineNum"> 1606 </span> : -<span class="lineNum"> 1607 </span> : // Called by erase(q1, q2). -<span class="lineNum"> 1608 </span> : void -<span class="lineNum"> 1609 </span><span class="lineCov"> 90 : _M_erase_at_begin(iterator __pos)</span> -<span class="lineNum"> 1610 </span> : { -<span class="lineNum"> 1611 </span><span class="lineCov"> 90 : _M_destroy_data(begin(), __pos, _M_get_Tp_allocator());</span> -<span class="lineNum"> 1612 </span><span class="lineCov"> 90 : _M_destroy_nodes(this->_M_impl._M_start._M_node, __pos._M_node);</span> -<span class="lineNum"> 1613 </span><span class="lineCov"> 90 : this->_M_impl._M_start = __pos;</span> -<span class="lineNum"> 1614 </span><span class="lineCov"> 90 : }</span> -<span class="lineNum"> 1615 </span> : -<span class="lineNum"> 1616 </span> : // Called by erase(q1, q2), resize(), clear(), _M_assign_aux, -<span class="lineNum"> 1617 </span> : // _M_fill_assign, operator=. -<span class="lineNum"> 1618 </span> : void -<span class="lineNum"> 1619 </span><span class="lineCov"> 926 : _M_erase_at_end(iterator __pos)</span> -<span class="lineNum"> 1620 </span> : { -<span class="lineNum"> 1621 </span><span class="lineCov"> 926 : _M_destroy_data(__pos, end(), _M_get_Tp_allocator());</span> -<span class="lineNum"> 1622 </span><span class="lineCov"> 926 : _M_destroy_nodes(__pos._M_node + 1,</span> -<span class="lineNum"> 1623 </span> : this->_M_impl._M_finish._M_node + 1); -<span class="lineNum"> 1624 </span><span class="lineCov"> 926 : this->_M_impl._M_finish = __pos;</span> -<span class="lineNum"> 1625 </span><span class="lineCov"> 926 : }</span> -<span class="lineNum"> 1626 </span> : -<span class="lineNum"> 1627 </span> : //@{ -<span class="lineNum"> 1628 </span> : /// Memory-handling helpers for the previous internal insert functions. -<span class="lineNum"> 1629 </span> : iterator -<span class="lineNum"> 1630 </span><span class="lineNoCov"> 0 : _M_reserve_elements_at_front(size_type __n)</span> -<span class="lineNum"> 1631 </span> : { -<span class="lineNum"> 1632 </span> : const size_type __vacancies = this->_M_impl._M_start._M_cur -<span class="lineNum"> 1633 </span><span class="lineNoCov"> 0 : - this->_M_impl._M_start._M_first;</span> -<span class="lineNum"> 1634 </span><span class="lineNoCov"> 0 : if (__n > __vacancies)</span> -<span class="lineNum"> 1635 </span><span class="lineNoCov"> 0 : _M_new_elements_at_front(__n - __vacancies);</span> -<span class="lineNum"> 1636 </span><span class="lineNoCov"> 0 : return this->_M_impl._M_start - difference_type(__n);</span> -<span class="lineNum"> 1637 </span> : } -<span class="lineNum"> 1638 </span> : -<span class="lineNum"> 1639 </span> : iterator -<span class="lineNum"> 1640 </span><span class="lineNoCov"> 0 : _M_reserve_elements_at_back(size_type __n)</span> -<span class="lineNum"> 1641 </span> : { -<span class="lineNum"> 1642 </span> : const size_type __vacancies = (this->_M_impl._M_finish._M_last -<span class="lineNum"> 1643 </span><span class="lineNoCov"> 0 : - this->_M_impl._M_finish._M_cur) - 1;</span> -<span class="lineNum"> 1644 </span><span class="lineNoCov"> 0 : if (__n > __vacancies)</span> -<span class="lineNum"> 1645 </span><span class="lineNoCov"> 0 : _M_new_elements_at_back(__n - __vacancies);</span> -<span class="lineNum"> 1646 </span><span class="lineNoCov"> 0 : return this->_M_impl._M_finish + difference_type(__n);</span> -<span class="lineNum"> 1647 </span> : } -<span class="lineNum"> 1648 </span> : -<span class="lineNum"> 1649 </span> : void -<span class="lineNum"> 1650 </span> : _M_new_elements_at_front(size_type __new_elements); -<span class="lineNum"> 1651 </span> : -<span class="lineNum"> 1652 </span> : void -<span class="lineNum"> 1653 </span> : _M_new_elements_at_back(size_type __new_elements); -<span class="lineNum"> 1654 </span> : //@} -<span class="lineNum"> 1655 </span> : -<span class="lineNum"> 1656 </span> : -<span class="lineNum"> 1657 </span> : //@{ -<span class="lineNum"> 1658 </span> : /** -<span class="lineNum"> 1659 </span> : * @brief Memory-handling helpers for the major %map. -<span class="lineNum"> 1660 </span> : * -<span class="lineNum"> 1661 </span> : * Makes sure the _M_map has space for new nodes. Does not -<span class="lineNum"> 1662 </span> : * actually add the nodes. Can invalidate _M_map pointers. -<span class="lineNum"> 1663 </span> : * (And consequently, %deque iterators.) -<span class="lineNum"> 1664 </span> : */ -<span class="lineNum"> 1665 </span> : void -<span class="lineNum"> 1666 </span><span class="lineCov"> 13 : _M_reserve_map_at_back(size_type __nodes_to_add = 1)</span> -<span class="lineNum"> 1667 </span> : { -<span class="lineNum"> 1668 </span><span class="lineCov"> 13 : if (__nodes_to_add + 1 > this->_M_impl._M_map_size</span> -<span class="lineNum"> 1669 </span> : - (this->_M_impl._M_finish._M_node - this->_M_impl._M_map)) -<span class="lineNum"> 1670 </span><span class="lineNoCov"> 0 : _M_reallocate_map(__nodes_to_add, false);</span> -<span class="lineNum"> 1671 </span><span class="lineCov"> 13 : }</span> -<span class="lineNum"> 1672 </span> : -<span class="lineNum"> 1673 </span> : void -<span class="lineNum"> 1674 </span><span class="lineNoCov"> 0 : _M_reserve_map_at_front(size_type __nodes_to_add = 1)</span> -<span class="lineNum"> 1675 </span> : { -<span class="lineNum"> 1676 </span><span class="lineNoCov"> 0 : if (__nodes_to_add > size_type(this->_M_impl._M_start._M_node</span> -<span class="lineNum"> 1677 </span> : - this->_M_impl._M_map)) -<span class="lineNum"> 1678 </span><span class="lineNoCov"> 0 : _M_reallocate_map(__nodes_to_add, true);</span> -<span class="lineNum"> 1679 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1680 </span> : -<span class="lineNum"> 1681 </span> : void -<span class="lineNum"> 1682 </span> : _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front); -<span class="lineNum"> 1683 </span> : //@} -<span class="lineNum"> 1684 </span> : }; -<span class="lineNum"> 1685 </span> : -<span class="lineNum"> 1686 </span> : -<span class="lineNum"> 1687 </span> : /** -<span class="lineNum"> 1688 </span> : * @brief Deque equality comparison. -<span class="lineNum"> 1689 </span> : * @param x A %deque. -<span class="lineNum"> 1690 </span> : * @param y A %deque of the same type as @a x. -<span class="lineNum"> 1691 </span> : * @return True iff the size and elements of the deques are equal. -<span class="lineNum"> 1692 </span> : * -<span class="lineNum"> 1693 </span> : * This is an equivalence relation. It is linear in the size of the -<span class="lineNum"> 1694 </span> : * deques. Deques are considered equivalent if their sizes are equal, -<span class="lineNum"> 1695 </span> : * and if corresponding elements compare equal. -<span class="lineNum"> 1696 </span> : */ -<span class="lineNum"> 1697 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1698 </span> : inline bool -<span class="lineNum"> 1699 </span> : operator==(const deque<_Tp, _Alloc>& __x, -<span class="lineNum"> 1700 </span> : const deque<_Tp, _Alloc>& __y) -<span class="lineNum"> 1701 </span> : { return __x.size() == __y.size() -<span class="lineNum"> 1702 </span> : && std::equal(__x.begin(), __x.end(), __y.begin()); } -<span class="lineNum"> 1703 </span> : -<span class="lineNum"> 1704 </span> : /** -<span class="lineNum"> 1705 </span> : * @brief Deque ordering relation. -<span class="lineNum"> 1706 </span> : * @param x A %deque. -<span class="lineNum"> 1707 </span> : * @param y A %deque of the same type as @a x. -<span class="lineNum"> 1708 </span> : * @return True iff @a x is lexicographically less than @a y. -<span class="lineNum"> 1709 </span> : * -<span class="lineNum"> 1710 </span> : * This is a total ordering relation. It is linear in the size of the -<span class="lineNum"> 1711 </span> : * deques. The elements must be comparable with @c <. -<span class="lineNum"> 1712 </span> : * -<span class="lineNum"> 1713 </span> : * See std::lexicographical_compare() for how the determination is made. -<span class="lineNum"> 1714 </span> : */ -<span class="lineNum"> 1715 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1716 </span> : inline bool -<span class="lineNum"> 1717 </span> : operator<(const deque<_Tp, _Alloc>& __x, -<span class="lineNum"> 1718 </span> : const deque<_Tp, _Alloc>& __y) -<span class="lineNum"> 1719 </span> : { return std::lexicographical_compare(__x.begin(), __x.end(), -<span class="lineNum"> 1720 </span> : __y.begin(), __y.end()); } -<span class="lineNum"> 1721 </span> : -<span class="lineNum"> 1722 </span> : /// Based on operator== -<span class="lineNum"> 1723 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1724 </span> : inline bool -<span class="lineNum"> 1725 </span> : operator!=(const deque<_Tp, _Alloc>& __x, -<span class="lineNum"> 1726 </span> : const deque<_Tp, _Alloc>& __y) -<span class="lineNum"> 1727 </span> : { return !(__x == __y); } -<span class="lineNum"> 1728 </span> : -<span class="lineNum"> 1729 </span> : /// Based on operator< -<span class="lineNum"> 1730 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1731 </span> : inline bool -<span class="lineNum"> 1732 </span> : operator>(const deque<_Tp, _Alloc>& __x, -<span class="lineNum"> 1733 </span> : const deque<_Tp, _Alloc>& __y) -<span class="lineNum"> 1734 </span> : { return __y < __x; } -<span class="lineNum"> 1735 </span> : -<span class="lineNum"> 1736 </span> : /// Based on operator< -<span class="lineNum"> 1737 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1738 </span> : inline bool -<span class="lineNum"> 1739 </span> : operator<=(const deque<_Tp, _Alloc>& __x, -<span class="lineNum"> 1740 </span> : const deque<_Tp, _Alloc>& __y) -<span class="lineNum"> 1741 </span> : { return !(__y < __x); } -<span class="lineNum"> 1742 </span> : -<span class="lineNum"> 1743 </span> : /// Based on operator< -<span class="lineNum"> 1744 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1745 </span> : inline bool -<span class="lineNum"> 1746 </span> : operator>=(const deque<_Tp, _Alloc>& __x, -<span class="lineNum"> 1747 </span> : const deque<_Tp, _Alloc>& __y) -<span class="lineNum"> 1748 </span> : { return !(__x < __y); } -<span class="lineNum"> 1749 </span> : -<span class="lineNum"> 1750 </span> : /// See std::deque::swap(). -<span class="lineNum"> 1751 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1752 </span> : inline void -<span class="lineNum"> 1753 </span> : swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y) -<span class="lineNum"> 1754 </span> : { __x.swap(__y); } -<span class="lineNum"> 1755 </span> : -<span class="lineNum"> 1756 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1757 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1758 </span> : inline void -<span class="lineNum"> 1759 </span> : swap(deque<_Tp,_Alloc>&& __x, deque<_Tp,_Alloc>& __y) -<span class="lineNum"> 1760 </span> : { __x.swap(__y); } -<span class="lineNum"> 1761 </span> : -<span class="lineNum"> 1762 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1763 </span> : inline void -<span class="lineNum"> 1764 </span> : swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>&& __y) -<span class="lineNum"> 1765 </span> : { __x.swap(__y); } -<span class="lineNum"> 1766 </span> : #endif -<span class="lineNum"> 1767 </span> : -<span class="lineNum"> 1768 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 1769 </span> : -<span class="lineNum"> 1770 </span> : #endif /* _STL_DEQUE_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_function.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_function.h.gcov.html deleted file mode 100644 index 7615b65..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_function.h.gcov.html +++ /dev/null @@ -1,774 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_function.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_function.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">17</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">17</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Functor implementations -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1998 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_function.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_FUNCTION_H -<span class="lineNum"> 63 </span> : #define _STL_FUNCTION_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : // 20.3.1 base classes -<span class="lineNum"> 68 </span> : /** @defgroup s20_3_1_base Functor Base Classes -<span class="lineNum"> 69 </span> : * Function objects, or @e functors, are objects with an @c operator() -<span class="lineNum"> 70 </span> : * defined and accessible. They can be passed as arguments to algorithm -<span class="lineNum"> 71 </span> : * templates and used in place of a function pointer. Not only is the -<span class="lineNum"> 72 </span> : * resulting expressiveness of the library increased, but the generated -<span class="lineNum"> 73 </span> : * code can be more efficient than what you might write by hand. When we -<span class="lineNum"> 74 </span> : * refer to "functors," then, generally we include function pointers in -<span class="lineNum"> 75 </span> : * the description as well. -<span class="lineNum"> 76 </span> : * -<span class="lineNum"> 77 </span> : * Often, functors are only created as temporaries passed to algorithm -<span class="lineNum"> 78 </span> : * calls, rather than being created as named variables. -<span class="lineNum"> 79 </span> : * -<span class="lineNum"> 80 </span> : * Two examples taken from the standard itself follow. To perform a -<span class="lineNum"> 81 </span> : * by-element addition of two vectors @c a and @c b containing @c double, -<span class="lineNum"> 82 </span> : * and put the result in @c a, use -<span class="lineNum"> 83 </span> : * \code -<span class="lineNum"> 84 </span> : * transform (a.begin(), a.end(), b.begin(), a.begin(), plus<double>()); -<span class="lineNum"> 85 </span> : * \endcode -<span class="lineNum"> 86 </span> : * To negate every element in @c a, use -<span class="lineNum"> 87 </span> : * \code -<span class="lineNum"> 88 </span> : * transform(a.begin(), a.end(), a.begin(), negate<double>()); -<span class="lineNum"> 89 </span> : * \endcode -<span class="lineNum"> 90 </span> : * The addition and negation functions will be inlined directly. -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * The standard functors are derived from structs named @c unary_function -<span class="lineNum"> 93 </span> : * and @c binary_function. These two classes contain nothing but typedefs, -<span class="lineNum"> 94 </span> : * to aid in generic (template) programming. If you write your own -<span class="lineNum"> 95 </span> : * functors, you might consider doing the same. -<span class="lineNum"> 96 </span> : * -<span class="lineNum"> 97 </span> : * @{ -<span class="lineNum"> 98 </span> : */ -<span class="lineNum"> 99 </span> : /** -<span class="lineNum"> 100 </span> : * This is one of the @link s20_3_1_base functor base classes@endlink. -<span class="lineNum"> 101 </span> : */ -<span class="lineNum"> 102 </span> : template<typename _Arg, typename _Result> -<span class="lineNum"> 103 </span> : struct unary_function -<span class="lineNum"> 104 </span><span class="lineCov"> 21 : {</span> -<span class="lineNum"> 105 </span> : typedef _Arg argument_type; ///< @c argument_type is the type of the -<span class="lineNum"> 106 </span> : /// argument (no surprises here) -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : typedef _Result result_type; ///< @c result_type is the return type -<span class="lineNum"> 109 </span> : }; -<span class="lineNum"> 110 </span> : -<span class="lineNum"> 111 </span> : /** -<span class="lineNum"> 112 </span> : * This is one of the @link s20_3_1_base functor base classes@endlink. -<span class="lineNum"> 113 </span> : */ -<span class="lineNum"> 114 </span> : template<typename _Arg1, typename _Arg2, typename _Result> -<span class="lineNum"> 115 </span> : struct binary_function -<span class="lineNum"> 116 </span> : { -<span class="lineNum"> 117 </span> : typedef _Arg1 first_argument_type; ///< the type of the first argument -<span class="lineNum"> 118 </span> : /// (no surprises here) -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : typedef _Arg2 second_argument_type; ///< the type of the second argument -<span class="lineNum"> 121 </span> : typedef _Result result_type; ///< type of the return type -<span class="lineNum"> 122 </span> : }; -<span class="lineNum"> 123 </span> : /** @} */ -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : // 20.3.2 arithmetic -<span class="lineNum"> 126 </span> : /** @defgroup s20_3_2_arithmetic Arithmetic Classes -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : * Because basic math often needs to be done during an algorithm, -<span class="lineNum"> 129 </span> : * the library provides functors for those operations. See the -<span class="lineNum"> 130 </span> : * documentation for @link s20_3_1_base the base classes@endlink -<span class="lineNum"> 131 </span> : * for examples of their use. -<span class="lineNum"> 132 </span> : * -<span class="lineNum"> 133 </span> : * @{ -<span class="lineNum"> 134 </span> : */ -<span class="lineNum"> 135 </span> : /// One of the @link s20_3_2_arithmetic math functors@endlink. -<span class="lineNum"> 136 </span> : template<typename _Tp> -<span class="lineNum"> 137 </span> : struct plus : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 138 </span> : { -<span class="lineNum"> 139 </span> : _Tp -<span class="lineNum"> 140 </span><span class="lineCov"> 4 : operator()(const _Tp& __x, const _Tp& __y) const</span> -<span class="lineNum"> 141 </span><span class="lineCov"> 4 : { return __x + __y; }</span> -<span class="lineNum"> 142 </span> : }; -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : /// One of the @link s20_3_2_arithmetic math functors@endlink. -<span class="lineNum"> 145 </span> : template<typename _Tp> -<span class="lineNum"> 146 </span> : struct minus : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 147 </span> : { -<span class="lineNum"> 148 </span> : _Tp -<span class="lineNum"> 149 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 150 </span> : { return __x - __y; } -<span class="lineNum"> 151 </span> : }; -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : /// One of the @link s20_3_2_arithmetic math functors@endlink. -<span class="lineNum"> 154 </span> : template<typename _Tp> -<span class="lineNum"> 155 </span> : struct multiplies : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 156 </span> : { -<span class="lineNum"> 157 </span> : _Tp -<span class="lineNum"> 158 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 159 </span> : { return __x * __y; } -<span class="lineNum"> 160 </span> : }; -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : /// One of the @link s20_3_2_arithmetic math functors@endlink. -<span class="lineNum"> 163 </span> : template<typename _Tp> -<span class="lineNum"> 164 </span> : struct divides : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 165 </span> : { -<span class="lineNum"> 166 </span> : _Tp -<span class="lineNum"> 167 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 168 </span> : { return __x / __y; } -<span class="lineNum"> 169 </span> : }; -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : /// One of the @link s20_3_2_arithmetic math functors@endlink. -<span class="lineNum"> 172 </span> : template<typename _Tp> -<span class="lineNum"> 173 </span> : struct modulus : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 174 </span> : { -<span class="lineNum"> 175 </span> : _Tp -<span class="lineNum"> 176 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 177 </span> : { return __x % __y; } -<span class="lineNum"> 178 </span> : }; -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : /// One of the @link s20_3_2_arithmetic math functors@endlink. -<span class="lineNum"> 181 </span> : template<typename _Tp> -<span class="lineNum"> 182 </span> : struct negate : public unary_function<_Tp, _Tp> -<span class="lineNum"> 183 </span> : { -<span class="lineNum"> 184 </span> : _Tp -<span class="lineNum"> 185 </span> : operator()(const _Tp& __x) const -<span class="lineNum"> 186 </span> : { return -__x; } -<span class="lineNum"> 187 </span> : }; -<span class="lineNum"> 188 </span> : /** @} */ -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : // 20.3.3 comparisons -<span class="lineNum"> 191 </span> : /** @defgroup s20_3_3_comparisons Comparison Classes -<span class="lineNum"> 192 </span> : * The library provides six wrapper functors for all the basic comparisons -<span class="lineNum"> 193 </span> : * in C++, like @c <. -<span class="lineNum"> 194 </span> : * -<span class="lineNum"> 195 </span> : * @{ -<span class="lineNum"> 196 </span> : */ -<span class="lineNum"> 197 </span> : /// One of the @link s20_3_3_comparisons comparison functors@endlink. -<span class="lineNum"> 198 </span> : template<typename _Tp> -<span class="lineNum"> 199 </span> : struct equal_to : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 200 </span> : { -<span class="lineNum"> 201 </span> : bool -<span class="lineNum"> 202 </span><span class="lineCov"> 66 : operator()(const _Tp& __x, const _Tp& __y) const</span> -<span class="lineNum"> 203 </span><span class="lineCov"> 66 : { return __x == __y; }</span> -<span class="lineNum"> 204 </span> : }; -<span class="lineNum"> 205 </span> : -<span class="lineNum"> 206 </span> : /// One of the @link s20_3_3_comparisons comparison functors@endlink. -<span class="lineNum"> 207 </span> : template<typename _Tp> -<span class="lineNum"> 208 </span> : struct not_equal_to : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 209 </span> : { -<span class="lineNum"> 210 </span> : bool -<span class="lineNum"> 211 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 212 </span> : { return __x != __y; } -<span class="lineNum"> 213 </span> : }; -<span class="lineNum"> 214 </span> : -<span class="lineNum"> 215 </span> : /// One of the @link s20_3_3_comparisons comparison functors@endlink. -<span class="lineNum"> 216 </span> : template<typename _Tp> -<span class="lineNum"> 217 </span> : struct greater : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 218 </span> : { -<span class="lineNum"> 219 </span> : bool -<span class="lineNum"> 220 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 221 </span> : { return __x > __y; } -<span class="lineNum"> 222 </span> : }; -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : /// One of the @link s20_3_3_comparisons comparison functors@endlink. -<span class="lineNum"> 225 </span> : template<typename _Tp> -<span class="lineNum"> 226 </span> : struct less : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span> : bool -<span class="lineNum"> 229 </span><span class="lineCov"> 10727242 : operator()(const _Tp& __x, const _Tp& __y) const</span> -<span class="lineNum"> 230 </span><span class="lineCov"> 10727242 : { return __x < __y; }</span> -<span class="lineNum"> 231 </span> : }; -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : /// One of the @link s20_3_3_comparisons comparison functors@endlink. -<span class="lineNum"> 234 </span> : template<typename _Tp> -<span class="lineNum"> 235 </span> : struct greater_equal : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 236 </span> : { -<span class="lineNum"> 237 </span> : bool -<span class="lineNum"> 238 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 239 </span> : { return __x >= __y; } -<span class="lineNum"> 240 </span> : }; -<span class="lineNum"> 241 </span> : -<span class="lineNum"> 242 </span> : /// One of the @link s20_3_3_comparisons comparison functors@endlink. -<span class="lineNum"> 243 </span> : template<typename _Tp> -<span class="lineNum"> 244 </span> : struct less_equal : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 245 </span> : { -<span class="lineNum"> 246 </span> : bool -<span class="lineNum"> 247 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 248 </span> : { return __x <= __y; } -<span class="lineNum"> 249 </span> : }; -<span class="lineNum"> 250 </span> : /** @} */ -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : // 20.3.4 logical operations -<span class="lineNum"> 253 </span> : /** @defgroup s20_3_4_logical Boolean Operations Classes -<span class="lineNum"> 254 </span> : * Here are wrapper functors for Boolean operations: @c &&, @c ||, -<span class="lineNum"> 255 </span> : * and @c !. -<span class="lineNum"> 256 </span> : * -<span class="lineNum"> 257 </span> : * @{ -<span class="lineNum"> 258 </span> : */ -<span class="lineNum"> 259 </span> : /// One of the @link s20_3_4_logical Boolean operations functors@endlink. -<span class="lineNum"> 260 </span> : template<typename _Tp> -<span class="lineNum"> 261 </span> : struct logical_and : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 262 </span> : { -<span class="lineNum"> 263 </span> : bool -<span class="lineNum"> 264 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 265 </span> : { return __x && __y; } -<span class="lineNum"> 266 </span> : }; -<span class="lineNum"> 267 </span> : -<span class="lineNum"> 268 </span> : /// One of the @link s20_3_4_logical Boolean operations functors@endlink. -<span class="lineNum"> 269 </span> : template<typename _Tp> -<span class="lineNum"> 270 </span> : struct logical_or : public binary_function<_Tp, _Tp, bool> -<span class="lineNum"> 271 </span> : { -<span class="lineNum"> 272 </span> : bool -<span class="lineNum"> 273 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 274 </span> : { return __x || __y; } -<span class="lineNum"> 275 </span> : }; -<span class="lineNum"> 276 </span> : -<span class="lineNum"> 277 </span> : /// One of the @link s20_3_4_logical Boolean operations functors@endlink. -<span class="lineNum"> 278 </span> : template<typename _Tp> -<span class="lineNum"> 279 </span> : struct logical_not : public unary_function<_Tp, bool> -<span class="lineNum"> 280 </span> : { -<span class="lineNum"> 281 </span> : bool -<span class="lineNum"> 282 </span> : operator()(const _Tp& __x) const -<span class="lineNum"> 283 </span> : { return !__x; } -<span class="lineNum"> 284 </span> : }; -<span class="lineNum"> 285 </span> : /** @} */ -<span class="lineNum"> 286 </span> : -<span class="lineNum"> 287 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 288 </span> : // DR 660. Missing Bitwise Operations. -<span class="lineNum"> 289 </span> : template<typename _Tp> -<span class="lineNum"> 290 </span> : struct bit_and : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 291 </span> : { -<span class="lineNum"> 292 </span> : _Tp -<span class="lineNum"> 293 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 294 </span> : { return __x & __y; } -<span class="lineNum"> 295 </span> : }; -<span class="lineNum"> 296 </span> : -<span class="lineNum"> 297 </span> : template<typename _Tp> -<span class="lineNum"> 298 </span> : struct bit_or : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 299 </span> : { -<span class="lineNum"> 300 </span> : _Tp -<span class="lineNum"> 301 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 302 </span> : { return __x | __y; } -<span class="lineNum"> 303 </span> : }; -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : template<typename _Tp> -<span class="lineNum"> 306 </span> : struct bit_xor : public binary_function<_Tp, _Tp, _Tp> -<span class="lineNum"> 307 </span> : { -<span class="lineNum"> 308 </span> : _Tp -<span class="lineNum"> 309 </span> : operator()(const _Tp& __x, const _Tp& __y) const -<span class="lineNum"> 310 </span> : { return __x ^ __y; } -<span class="lineNum"> 311 </span> : }; -<span class="lineNum"> 312 </span> : -<span class="lineNum"> 313 </span> : // 20.3.5 negators -<span class="lineNum"> 314 </span> : /** @defgroup s20_3_5_negators Negators -<span class="lineNum"> 315 </span> : * The functions @c not1 and @c not2 each take a predicate functor -<span class="lineNum"> 316 </span> : * and return an instance of @c unary_negate or -<span class="lineNum"> 317 </span> : * @c binary_negate, respectively. These classes are functors whose -<span class="lineNum"> 318 </span> : * @c operator() performs the stored predicate function and then returns -<span class="lineNum"> 319 </span> : * the negation of the result. -<span class="lineNum"> 320 </span> : * -<span class="lineNum"> 321 </span> : * For example, given a vector of integers and a trivial predicate, -<span class="lineNum"> 322 </span> : * \code -<span class="lineNum"> 323 </span> : * struct IntGreaterThanThree -<span class="lineNum"> 324 </span> : * : public std::unary_function<int, bool> -<span class="lineNum"> 325 </span> : * { -<span class="lineNum"> 326 </span> : * bool operator() (int x) { return x > 3; } -<span class="lineNum"> 327 </span> : * }; -<span class="lineNum"> 328 </span> : * -<span class="lineNum"> 329 </span> : * std::find_if (v.begin(), v.end(), not1(IntGreaterThanThree())); -<span class="lineNum"> 330 </span> : * \endcode -<span class="lineNum"> 331 </span> : * The call to @c find_if will locate the first index (i) of @c v for which -<span class="lineNum"> 332 </span> : * "!(v[i] > 3)" is true. -<span class="lineNum"> 333 </span> : * -<span class="lineNum"> 334 </span> : * The not1/unary_negate combination works on predicates taking a single -<span class="lineNum"> 335 </span> : * argument. The not2/binary_negate combination works on predicates which -<span class="lineNum"> 336 </span> : * take two arguments. -<span class="lineNum"> 337 </span> : * -<span class="lineNum"> 338 </span> : * @{ -<span class="lineNum"> 339 </span> : */ -<span class="lineNum"> 340 </span> : /// One of the @link s20_3_5_negators negation functors@endlink. -<span class="lineNum"> 341 </span> : template<typename _Predicate> -<span class="lineNum"> 342 </span> : class unary_negate -<span class="lineNum"> 343 </span> : : public unary_function<typename _Predicate::argument_type, bool> -<span class="lineNum"> 344 </span> : { -<span class="lineNum"> 345 </span> : protected: -<span class="lineNum"> 346 </span> : _Predicate _M_pred; -<span class="lineNum"> 347 </span> : -<span class="lineNum"> 348 </span> : public: -<span class="lineNum"> 349 </span> : explicit -<span class="lineNum"> 350 </span> : unary_negate(const _Predicate& __x) : _M_pred(__x) { } -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : bool -<span class="lineNum"> 353 </span> : operator()(const typename _Predicate::argument_type& __x) const -<span class="lineNum"> 354 </span> : { return !_M_pred(__x); } -<span class="lineNum"> 355 </span> : }; -<span class="lineNum"> 356 </span> : -<span class="lineNum"> 357 </span> : /// One of the @link s20_3_5_negators negation functors@endlink. -<span class="lineNum"> 358 </span> : template<typename _Predicate> -<span class="lineNum"> 359 </span> : inline unary_negate<_Predicate> -<span class="lineNum"> 360 </span> : not1(const _Predicate& __pred) -<span class="lineNum"> 361 </span> : { return unary_negate<_Predicate>(__pred); } -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : /// One of the @link s20_3_5_negators negation functors@endlink. -<span class="lineNum"> 364 </span> : template<typename _Predicate> -<span class="lineNum"> 365 </span> : class binary_negate -<span class="lineNum"> 366 </span> : : public binary_function<typename _Predicate::first_argument_type, -<span class="lineNum"> 367 </span> : typename _Predicate::second_argument_type, bool> -<span class="lineNum"> 368 </span> : { -<span class="lineNum"> 369 </span> : protected: -<span class="lineNum"> 370 </span> : _Predicate _M_pred; -<span class="lineNum"> 371 </span> : -<span class="lineNum"> 372 </span> : public: -<span class="lineNum"> 373 </span> : explicit -<span class="lineNum"> 374 </span> : binary_negate(const _Predicate& __x) : _M_pred(__x) { } -<span class="lineNum"> 375 </span> : -<span class="lineNum"> 376 </span> : bool -<span class="lineNum"> 377 </span> : operator()(const typename _Predicate::first_argument_type& __x, -<span class="lineNum"> 378 </span> : const typename _Predicate::second_argument_type& __y) const -<span class="lineNum"> 379 </span> : { return !_M_pred(__x, __y); } -<span class="lineNum"> 380 </span> : }; -<span class="lineNum"> 381 </span> : -<span class="lineNum"> 382 </span> : /// One of the @link s20_3_5_negators negation functors@endlink. -<span class="lineNum"> 383 </span> : template<typename _Predicate> -<span class="lineNum"> 384 </span> : inline binary_negate<_Predicate> -<span class="lineNum"> 385 </span> : not2(const _Predicate& __pred) -<span class="lineNum"> 386 </span> : { return binary_negate<_Predicate>(__pred); } -<span class="lineNum"> 387 </span> : /** @} */ -<span class="lineNum"> 388 </span> : -<span class="lineNum"> 389 </span> : // 20.3.7 adaptors pointers functions -<span class="lineNum"> 390 </span> : /** @defgroup s20_3_7_adaptors Adaptors for pointers to functions -<span class="lineNum"> 391 </span> : * The advantage of function objects over pointers to functions is that -<span class="lineNum"> 392 </span> : * the objects in the standard library declare nested typedefs describing -<span class="lineNum"> 393 </span> : * their argument and result types with uniform names (e.g., @c result_type -<span class="lineNum"> 394 </span> : * from the base classes @c unary_function and @c binary_function). -<span class="lineNum"> 395 </span> : * Sometimes those typedefs are required, not just optional. -<span class="lineNum"> 396 </span> : * -<span class="lineNum"> 397 </span> : * Adaptors are provided to turn pointers to unary (single-argument) and -<span class="lineNum"> 398 </span> : * binary (double-argument) functions into function objects. The -<span class="lineNum"> 399 </span> : * long-winded functor @c pointer_to_unary_function is constructed with a -<span class="lineNum"> 400 </span> : * function pointer @c f, and its @c operator() called with argument @c x -<span class="lineNum"> 401 </span> : * returns @c f(x). The functor @c pointer_to_binary_function does the same -<span class="lineNum"> 402 </span> : * thing, but with a double-argument @c f and @c operator(). -<span class="lineNum"> 403 </span> : * -<span class="lineNum"> 404 </span> : * The function @c ptr_fun takes a pointer-to-function @c f and constructs -<span class="lineNum"> 405 </span> : * an instance of the appropriate functor. -<span class="lineNum"> 406 </span> : * -<span class="lineNum"> 407 </span> : * @{ -<span class="lineNum"> 408 </span> : */ -<span class="lineNum"> 409 </span> : /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. -<span class="lineNum"> 410 </span> : template<typename _Arg, typename _Result> -<span class="lineNum"> 411 </span> : class pointer_to_unary_function : public unary_function<_Arg, _Result> -<span class="lineNum"> 412 </span> : { -<span class="lineNum"> 413 </span> : protected: -<span class="lineNum"> 414 </span> : _Result (*_M_ptr)(_Arg); -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : public: -<span class="lineNum"> 417 </span> : pointer_to_unary_function() { } -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : explicit -<span class="lineNum"> 420 </span><span class="lineCov"> 2 : pointer_to_unary_function(_Result (*__x)(_Arg))</span> -<span class="lineNum"> 421 </span><span class="lineCov"> 2 : : _M_ptr(__x) { }</span> -<span class="lineNum"> 422 </span> : -<span class="lineNum"> 423 </span> : _Result -<span class="lineNum"> 424 </span><span class="lineCov"> 516 : operator()(_Arg __x) const</span> -<span class="lineNum"> 425 </span><span class="lineCov"> 516 : { return _M_ptr(__x); }</span> -<span class="lineNum"> 426 </span> : }; -<span class="lineNum"> 427 </span> : -<span class="lineNum"> 428 </span> : /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. -<span class="lineNum"> 429 </span> : template<typename _Arg, typename _Result> -<span class="lineNum"> 430 </span> : inline pointer_to_unary_function<_Arg, _Result> -<span class="lineNum"> 431 </span><span class="lineCov"> 2 : ptr_fun(_Result (*__x)(_Arg))</span> -<span class="lineNum"> 432 </span><span class="lineCov"> 2 : { return pointer_to_unary_function<_Arg, _Result>(__x); }</span> -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. -<span class="lineNum"> 435 </span> : template<typename _Arg1, typename _Arg2, typename _Result> -<span class="lineNum"> 436 </span> : class pointer_to_binary_function -<span class="lineNum"> 437 </span> : : public binary_function<_Arg1, _Arg2, _Result> -<span class="lineNum"> 438 </span> : { -<span class="lineNum"> 439 </span> : protected: -<span class="lineNum"> 440 </span> : _Result (*_M_ptr)(_Arg1, _Arg2); -<span class="lineNum"> 441 </span> : -<span class="lineNum"> 442 </span> : public: -<span class="lineNum"> 443 </span> : pointer_to_binary_function() { } -<span class="lineNum"> 444 </span> : -<span class="lineNum"> 445 </span> : explicit -<span class="lineNum"> 446 </span> : pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) -<span class="lineNum"> 447 </span> : : _M_ptr(__x) { } -<span class="lineNum"> 448 </span> : -<span class="lineNum"> 449 </span> : _Result -<span class="lineNum"> 450 </span> : operator()(_Arg1 __x, _Arg2 __y) const -<span class="lineNum"> 451 </span> : { return _M_ptr(__x, __y); } -<span class="lineNum"> 452 </span> : }; -<span class="lineNum"> 453 </span> : -<span class="lineNum"> 454 </span> : /// One of the @link s20_3_7_adaptors adaptors for function pointers@endlink. -<span class="lineNum"> 455 </span> : template<typename _Arg1, typename _Arg2, typename _Result> -<span class="lineNum"> 456 </span> : inline pointer_to_binary_function<_Arg1, _Arg2, _Result> -<span class="lineNum"> 457 </span> : ptr_fun(_Result (*__x)(_Arg1, _Arg2)) -<span class="lineNum"> 458 </span> : { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); } -<span class="lineNum"> 459 </span> : /** @} */ -<span class="lineNum"> 460 </span> : -<span class="lineNum"> 461 </span> : template<typename _Tp> -<span class="lineNum"> 462 </span> : struct _Identity : public unary_function<_Tp,_Tp> -<span class="lineNum"> 463 </span> : { -<span class="lineNum"> 464 </span> : _Tp& -<span class="lineNum"> 465 </span> : operator()(_Tp& __x) const -<span class="lineNum"> 466 </span> : { return __x; } -<span class="lineNum"> 467 </span> : -<span class="lineNum"> 468 </span> : const _Tp& -<span class="lineNum"> 469 </span><span class="lineCov"> 16055496 : operator()(const _Tp& __x) const</span> -<span class="lineNum"> 470 </span><span class="lineCov"> 16055496 : { return __x; }</span> -<span class="lineNum"> 471 </span> : }; -<span class="lineNum"> 472 </span> : -<span class="lineNum"> 473 </span> : template<typename _Pair> -<span class="lineNum"> 474 </span> : struct _Select1st : public unary_function<_Pair, -<span class="lineNum"> 475 </span> : typename _Pair::first_type> -<span class="lineNum"> 476 </span> : { -<span class="lineNum"> 477 </span> : typename _Pair::first_type& -<span class="lineNum"> 478 </span> : operator()(_Pair& __x) const -<span class="lineNum"> 479 </span> : { return __x.first; } -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : const typename _Pair::first_type& -<span class="lineNum"> 482 </span><span class="lineCov"> 4509167 : operator()(const _Pair& __x) const</span> -<span class="lineNum"> 483 </span><span class="lineCov"> 4509167 : { return __x.first; }</span> -<span class="lineNum"> 484 </span> : }; -<span class="lineNum"> 485 </span> : -<span class="lineNum"> 486 </span> : template<typename _Pair> -<span class="lineNum"> 487 </span> : struct _Select2nd : public unary_function<_Pair, -<span class="lineNum"> 488 </span> : typename _Pair::second_type> -<span class="lineNum"> 489 </span> : { -<span class="lineNum"> 490 </span> : typename _Pair::second_type& -<span class="lineNum"> 491 </span> : operator()(_Pair& __x) const -<span class="lineNum"> 492 </span> : { return __x.second; } -<span class="lineNum"> 493 </span> : -<span class="lineNum"> 494 </span> : const typename _Pair::second_type& -<span class="lineNum"> 495 </span> : operator()(const _Pair& __x) const -<span class="lineNum"> 496 </span> : { return __x.second; } -<span class="lineNum"> 497 </span> : }; -<span class="lineNum"> 498 </span> : -<span class="lineNum"> 499 </span> : // 20.3.8 adaptors pointers members -<span class="lineNum"> 500 </span> : /** @defgroup s20_3_8_memadaptors Adaptors for pointers to members -<span class="lineNum"> 501 </span> : * There are a total of 8 = 2^3 function objects in this family. -<span class="lineNum"> 502 </span> : * (1) Member functions taking no arguments vs member functions taking -<span class="lineNum"> 503 </span> : * one argument. -<span class="lineNum"> 504 </span> : * (2) Call through pointer vs call through reference. -<span class="lineNum"> 505 </span> : * (3) Const vs non-const member function. -<span class="lineNum"> 506 </span> : * -<span class="lineNum"> 507 </span> : * All of this complexity is in the function objects themselves. You can -<span class="lineNum"> 508 </span> : * ignore it by using the helper function mem_fun and mem_fun_ref, -<span class="lineNum"> 509 </span> : * which create whichever type of adaptor is appropriate. -<span class="lineNum"> 510 </span> : * -<span class="lineNum"> 511 </span> : * @{ -<span class="lineNum"> 512 </span> : */ -<span class="lineNum"> 513 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 514 </span> : /// pointers@endlink. -<span class="lineNum"> 515 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 516 </span> : class mem_fun_t : public unary_function<_Tp*, _Ret> -<span class="lineNum"> 517 </span> : { -<span class="lineNum"> 518 </span> : public: -<span class="lineNum"> 519 </span> : explicit -<span class="lineNum"> 520 </span> : mem_fun_t(_Ret (_Tp::*__pf)()) -<span class="lineNum"> 521 </span> : : _M_f(__pf) { } -<span class="lineNum"> 522 </span> : -<span class="lineNum"> 523 </span> : _Ret -<span class="lineNum"> 524 </span> : operator()(_Tp* __p) const -<span class="lineNum"> 525 </span> : { return (__p->*_M_f)(); } -<span class="lineNum"> 526 </span> : -<span class="lineNum"> 527 </span> : private: -<span class="lineNum"> 528 </span> : _Ret (_Tp::*_M_f)(); -<span class="lineNum"> 529 </span> : }; -<span class="lineNum"> 530 </span> : -<span class="lineNum"> 531 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 532 </span> : /// pointers@endlink. -<span class="lineNum"> 533 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 534 </span> : class const_mem_fun_t : public unary_function<const _Tp*, _Ret> -<span class="lineNum"> 535 </span> : { -<span class="lineNum"> 536 </span> : public: -<span class="lineNum"> 537 </span> : explicit -<span class="lineNum"> 538 </span> : const_mem_fun_t(_Ret (_Tp::*__pf)() const) -<span class="lineNum"> 539 </span> : : _M_f(__pf) { } -<span class="lineNum"> 540 </span> : -<span class="lineNum"> 541 </span> : _Ret -<span class="lineNum"> 542 </span> : operator()(const _Tp* __p) const -<span class="lineNum"> 543 </span> : { return (__p->*_M_f)(); } -<span class="lineNum"> 544 </span> : -<span class="lineNum"> 545 </span> : private: -<span class="lineNum"> 546 </span> : _Ret (_Tp::*_M_f)() const; -<span class="lineNum"> 547 </span> : }; -<span class="lineNum"> 548 </span> : -<span class="lineNum"> 549 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 550 </span> : /// pointers@endlink. -<span class="lineNum"> 551 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 552 </span> : class mem_fun_ref_t : public unary_function<_Tp, _Ret> -<span class="lineNum"> 553 </span> : { -<span class="lineNum"> 554 </span> : public: -<span class="lineNum"> 555 </span> : explicit -<span class="lineNum"> 556 </span> : mem_fun_ref_t(_Ret (_Tp::*__pf)()) -<span class="lineNum"> 557 </span> : : _M_f(__pf) { } -<span class="lineNum"> 558 </span> : -<span class="lineNum"> 559 </span> : _Ret -<span class="lineNum"> 560 </span> : operator()(_Tp& __r) const -<span class="lineNum"> 561 </span> : { return (__r.*_M_f)(); } -<span class="lineNum"> 562 </span> : -<span class="lineNum"> 563 </span> : private: -<span class="lineNum"> 564 </span> : _Ret (_Tp::*_M_f)(); -<span class="lineNum"> 565 </span> : }; -<span class="lineNum"> 566 </span> : -<span class="lineNum"> 567 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 568 </span> : /// pointers@endlink. -<span class="lineNum"> 569 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 570 </span> : class const_mem_fun_ref_t : public unary_function<_Tp, _Ret> -<span class="lineNum"> 571 </span> : { -<span class="lineNum"> 572 </span> : public: -<span class="lineNum"> 573 </span> : explicit -<span class="lineNum"> 574 </span> : const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const) -<span class="lineNum"> 575 </span> : : _M_f(__pf) { } -<span class="lineNum"> 576 </span> : -<span class="lineNum"> 577 </span> : _Ret -<span class="lineNum"> 578 </span> : operator()(const _Tp& __r) const -<span class="lineNum"> 579 </span> : { return (__r.*_M_f)(); } -<span class="lineNum"> 580 </span> : -<span class="lineNum"> 581 </span> : private: -<span class="lineNum"> 582 </span> : _Ret (_Tp::*_M_f)() const; -<span class="lineNum"> 583 </span> : }; -<span class="lineNum"> 584 </span> : -<span class="lineNum"> 585 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 586 </span> : /// pointers@endlink. -<span class="lineNum"> 587 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 588 </span> : class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret> -<span class="lineNum"> 589 </span> : { -<span class="lineNum"> 590 </span> : public: -<span class="lineNum"> 591 </span> : explicit -<span class="lineNum"> 592 </span> : mem_fun1_t(_Ret (_Tp::*__pf)(_Arg)) -<span class="lineNum"> 593 </span> : : _M_f(__pf) { } -<span class="lineNum"> 594 </span> : -<span class="lineNum"> 595 </span> : _Ret -<span class="lineNum"> 596 </span> : operator()(_Tp* __p, _Arg __x) const -<span class="lineNum"> 597 </span> : { return (__p->*_M_f)(__x); } -<span class="lineNum"> 598 </span> : -<span class="lineNum"> 599 </span> : private: -<span class="lineNum"> 600 </span> : _Ret (_Tp::*_M_f)(_Arg); -<span class="lineNum"> 601 </span> : }; -<span class="lineNum"> 602 </span> : -<span class="lineNum"> 603 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 604 </span> : /// pointers@endlink. -<span class="lineNum"> 605 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 606 </span> : class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret> -<span class="lineNum"> 607 </span> : { -<span class="lineNum"> 608 </span> : public: -<span class="lineNum"> 609 </span> : explicit -<span class="lineNum"> 610 </span> : const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const) -<span class="lineNum"> 611 </span> : : _M_f(__pf) { } -<span class="lineNum"> 612 </span> : -<span class="lineNum"> 613 </span> : _Ret -<span class="lineNum"> 614 </span> : operator()(const _Tp* __p, _Arg __x) const -<span class="lineNum"> 615 </span> : { return (__p->*_M_f)(__x); } -<span class="lineNum"> 616 </span> : -<span class="lineNum"> 617 </span> : private: -<span class="lineNum"> 618 </span> : _Ret (_Tp::*_M_f)(_Arg) const; -<span class="lineNum"> 619 </span> : }; -<span class="lineNum"> 620 </span> : -<span class="lineNum"> 621 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 622 </span> : /// pointers@endlink. -<span class="lineNum"> 623 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 624 </span> : class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> -<span class="lineNum"> 625 </span> : { -<span class="lineNum"> 626 </span> : public: -<span class="lineNum"> 627 </span> : explicit -<span class="lineNum"> 628 </span> : mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) -<span class="lineNum"> 629 </span> : : _M_f(__pf) { } -<span class="lineNum"> 630 </span> : -<span class="lineNum"> 631 </span> : _Ret -<span class="lineNum"> 632 </span> : operator()(_Tp& __r, _Arg __x) const -<span class="lineNum"> 633 </span> : { return (__r.*_M_f)(__x); } -<span class="lineNum"> 634 </span> : -<span class="lineNum"> 635 </span> : private: -<span class="lineNum"> 636 </span> : _Ret (_Tp::*_M_f)(_Arg); -<span class="lineNum"> 637 </span> : }; -<span class="lineNum"> 638 </span> : -<span class="lineNum"> 639 </span> : /// One of the @link s20_3_8_memadaptors adaptors for member -<span class="lineNum"> 640 </span> : /// pointers@endlink. -<span class="lineNum"> 641 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 642 </span> : class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> -<span class="lineNum"> 643 </span> : { -<span class="lineNum"> 644 </span> : public: -<span class="lineNum"> 645 </span> : explicit -<span class="lineNum"> 646 </span> : const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const) -<span class="lineNum"> 647 </span> : : _M_f(__pf) { } -<span class="lineNum"> 648 </span> : -<span class="lineNum"> 649 </span> : _Ret -<span class="lineNum"> 650 </span> : operator()(const _Tp& __r, _Arg __x) const -<span class="lineNum"> 651 </span> : { return (__r.*_M_f)(__x); } -<span class="lineNum"> 652 </span> : -<span class="lineNum"> 653 </span> : private: -<span class="lineNum"> 654 </span> : _Ret (_Tp::*_M_f)(_Arg) const; -<span class="lineNum"> 655 </span> : }; -<span class="lineNum"> 656 </span> : -<span class="lineNum"> 657 </span> : // Mem_fun adaptor helper functions. There are only two: -<span class="lineNum"> 658 </span> : // mem_fun and mem_fun_ref. -<span class="lineNum"> 659 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 660 </span> : inline mem_fun_t<_Ret, _Tp> -<span class="lineNum"> 661 </span> : mem_fun(_Ret (_Tp::*__f)()) -<span class="lineNum"> 662 </span> : { return mem_fun_t<_Ret, _Tp>(__f); } -<span class="lineNum"> 663 </span> : -<span class="lineNum"> 664 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 665 </span> : inline const_mem_fun_t<_Ret, _Tp> -<span class="lineNum"> 666 </span> : mem_fun(_Ret (_Tp::*__f)() const) -<span class="lineNum"> 667 </span> : { return const_mem_fun_t<_Ret, _Tp>(__f); } -<span class="lineNum"> 668 </span> : -<span class="lineNum"> 669 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 670 </span> : inline mem_fun_ref_t<_Ret, _Tp> -<span class="lineNum"> 671 </span> : mem_fun_ref(_Ret (_Tp::*__f)()) -<span class="lineNum"> 672 </span> : { return mem_fun_ref_t<_Ret, _Tp>(__f); } -<span class="lineNum"> 673 </span> : -<span class="lineNum"> 674 </span> : template<typename _Ret, typename _Tp> -<span class="lineNum"> 675 </span> : inline const_mem_fun_ref_t<_Ret, _Tp> -<span class="lineNum"> 676 </span> : mem_fun_ref(_Ret (_Tp::*__f)() const) -<span class="lineNum"> 677 </span> : { return const_mem_fun_ref_t<_Ret, _Tp>(__f); } -<span class="lineNum"> 678 </span> : -<span class="lineNum"> 679 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 680 </span> : inline mem_fun1_t<_Ret, _Tp, _Arg> -<span class="lineNum"> 681 </span> : mem_fun(_Ret (_Tp::*__f)(_Arg)) -<span class="lineNum"> 682 </span> : { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } -<span class="lineNum"> 683 </span> : -<span class="lineNum"> 684 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 685 </span> : inline const_mem_fun1_t<_Ret, _Tp, _Arg> -<span class="lineNum"> 686 </span> : mem_fun(_Ret (_Tp::*__f)(_Arg) const) -<span class="lineNum"> 687 </span> : { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } -<span class="lineNum"> 688 </span> : -<span class="lineNum"> 689 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 690 </span> : inline mem_fun1_ref_t<_Ret, _Tp, _Arg> -<span class="lineNum"> 691 </span> : mem_fun_ref(_Ret (_Tp::*__f)(_Arg)) -<span class="lineNum"> 692 </span> : { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } -<span class="lineNum"> 693 </span> : -<span class="lineNum"> 694 </span> : template<typename _Ret, typename _Tp, typename _Arg> -<span class="lineNum"> 695 </span> : inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> -<span class="lineNum"> 696 </span> : mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const) -<span class="lineNum"> 697 </span> : { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } -<span class="lineNum"> 698 </span> : -<span class="lineNum"> 699 </span> : /** @} */ -<span class="lineNum"> 700 </span> : -<span class="lineNum"> 701 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 702 </span> : -<span class="lineNum"> 703 </span> : #if !defined(__GXX_EXPERIMENTAL_CXX0X__) || _GLIBCXX_DEPRECATED -<span class="lineNum"> 704 </span> : # include <backward/binders.h> -<span class="lineNum"> 705 </span> : #endif -<span class="lineNum"> 706 </span> : -<span class="lineNum"> 707 </span> : #endif /* _STL_FUNCTION_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_heap.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_heap.h.gcov.html deleted file mode 100644 index c9d582a..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_heap.h.gcov.html +++ /dev/null @@ -1,637 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_heap.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_heap.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">92</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Heap implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * Copyright (c) 1997 -<span class="lineNum"> 45 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 46 </span> : * -<span class="lineNum"> 47 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 48 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 49 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 50 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 51 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 52 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 53 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 54 </span> : */ -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : /** @file stl_heap.h -<span class="lineNum"> 57 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 58 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 59 </span> : */ -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : #ifndef _STL_HEAP_H -<span class="lineNum"> 62 </span> : #define _STL_HEAP_H 1 -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : #include <debug/debug.h> -<span class="lineNum"> 65 </span> : #include <bits/stl_move.h> -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : template<typename _RandomAccessIterator, typename _Distance> -<span class="lineNum"> 70 </span> : _Distance -<span class="lineNum"> 71 </span> : __is_heap_until(_RandomAccessIterator __first, _Distance __n) -<span class="lineNum"> 72 </span> : { -<span class="lineNum"> 73 </span> : _Distance __parent = 0; -<span class="lineNum"> 74 </span> : for (_Distance __child = 1; __child < __n; ++__child) -<span class="lineNum"> 75 </span> : { -<span class="lineNum"> 76 </span> : if (__first[__parent] < __first[__child]) -<span class="lineNum"> 77 </span> : return __child; -<span class="lineNum"> 78 </span> : if ((__child & 1) == 0) -<span class="lineNum"> 79 </span> : ++__parent; -<span class="lineNum"> 80 </span> : } -<span class="lineNum"> 81 </span> : return __n; -<span class="lineNum"> 82 </span> : } -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : template<typename _RandomAccessIterator, typename _Distance, -<span class="lineNum"> 85 </span> : typename _Compare> -<span class="lineNum"> 86 </span> : _Distance -<span class="lineNum"> 87 </span> : __is_heap_until(_RandomAccessIterator __first, _Distance __n, -<span class="lineNum"> 88 </span> : _Compare __comp) -<span class="lineNum"> 89 </span> : { -<span class="lineNum"> 90 </span> : _Distance __parent = 0; -<span class="lineNum"> 91 </span> : for (_Distance __child = 1; __child < __n; ++__child) -<span class="lineNum"> 92 </span> : { -<span class="lineNum"> 93 </span> : if (__comp(__first[__parent], __first[__child])) -<span class="lineNum"> 94 </span> : return __child; -<span class="lineNum"> 95 </span> : if ((__child & 1) == 0) -<span class="lineNum"> 96 </span> : ++__parent; -<span class="lineNum"> 97 </span> : } -<span class="lineNum"> 98 </span> : return __n; -<span class="lineNum"> 99 </span> : } -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : // __is_heap, a predicate testing whether or not a range is a heap. -<span class="lineNum"> 102 </span> : // This function is an extension, not part of the C++ standard. -<span class="lineNum"> 103 </span> : template<typename _RandomAccessIterator, typename _Distance> -<span class="lineNum"> 104 </span> : inline bool -<span class="lineNum"> 105 </span> : __is_heap(_RandomAccessIterator __first, _Distance __n) -<span class="lineNum"> 106 </span> : { return std::__is_heap_until(__first, __n) == __n; } -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : template<typename _RandomAccessIterator, typename _Compare, -<span class="lineNum"> 109 </span> : typename _Distance> -<span class="lineNum"> 110 </span> : inline bool -<span class="lineNum"> 111 </span> : __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) -<span class="lineNum"> 112 </span> : { return std::__is_heap_until(__first, __n, __comp) == __n; } -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 115 </span> : inline bool -<span class="lineNum"> 116 </span> : __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 117 </span> : { return std::__is_heap(__first, std::distance(__first, __last)); } -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 120 </span> : inline bool -<span class="lineNum"> 121 </span> : __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 122 </span> : _Compare __comp) -<span class="lineNum"> 123 </span> : { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap, -<span class="lineNum"> 126 </span> : // + is_heap and is_heap_until in C++0x. -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : template<typename _RandomAccessIterator, typename _Distance, typename _Tp> -<span class="lineNum"> 129 </span> : void -<span class="lineNum"> 130 </span> : __push_heap(_RandomAccessIterator __first, -<span class="lineNum"> 131 </span><span class="lineNoCov"> 0 : _Distance __holeIndex, _Distance __topIndex, _Tp __value)</span> -<span class="lineNum"> 132 </span> : { -<span class="lineNum"> 133 </span><span class="lineNoCov"> 0 : _Distance __parent = (__holeIndex - 1) / 2;</span> -<span class="lineNum"> 134 </span><span class="lineNoCov"> 0 : while (__holeIndex > __topIndex && *(__first + __parent) < __value)</span> -<span class="lineNum"> 135 </span> : { -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));</span> -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : __holeIndex = __parent;</span> -<span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : __parent = (__holeIndex - 1) / 2;</span> -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);</span> -<span class="lineNum"> 141 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : /** -<span class="lineNum"> 144 </span> : * @brief Push an element onto a heap. -<span class="lineNum"> 145 </span> : * @param first Start of heap. -<span class="lineNum"> 146 </span> : * @param last End of heap + element. -<span class="lineNum"> 147 </span> : * @ingroup heap -<span class="lineNum"> 148 </span> : * -<span class="lineNum"> 149 </span> : * This operation pushes the element at last-1 onto the valid heap over the -<span class="lineNum"> 150 </span> : * range [first,last-1). After completion, [first,last) is a valid heap. -<span class="lineNum"> 151 </span> : */ -<span class="lineNum"> 152 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 153 </span> : inline void -<span class="lineNum"> 154 </span> : push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 155 </span> : { -<span class="lineNum"> 156 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 157 </span> : _ValueType; -<span class="lineNum"> 158 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 159 </span> : _DistanceType; -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : // concept requirements -<span class="lineNum"> 162 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 163 </span> : _RandomAccessIterator>) -<span class="lineNum"> 164 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 165 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 166 </span> : __glibcxx_requires_heap(__first, __last - 1); -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); -<span class="lineNum"> 169 </span> : std::__push_heap(__first, _DistanceType((__last - __first) - 1), -<span class="lineNum"> 170 </span> : _DistanceType(0), _GLIBCXX_MOVE(__value)); -<span class="lineNum"> 171 </span> : } -<span class="lineNum"> 172 </span> : -<span class="lineNum"> 173 </span> : template<typename _RandomAccessIterator, typename _Distance, typename _Tp, -<span class="lineNum"> 174 </span> : typename _Compare> -<span class="lineNum"> 175 </span> : void -<span class="lineNum"> 176 </span> : __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, -<span class="lineNum"> 177 </span><span class="lineNoCov"> 0 : _Distance __topIndex, _Tp __value, _Compare __comp)</span> -<span class="lineNum"> 178 </span> : { -<span class="lineNum"> 179 </span><span class="lineNoCov"> 0 : _Distance __parent = (__holeIndex - 1) / 2;</span> -<span class="lineNum"> 180 </span><span class="lineNoCov"> 0 : while (__holeIndex > __topIndex</span> -<span class="lineNum"> 181 </span> : && __comp(*(__first + __parent), __value)) -<span class="lineNum"> 182 </span> : { -<span class="lineNum"> 183 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));</span> -<span class="lineNum"> 184 </span><span class="lineNoCov"> 0 : __holeIndex = __parent;</span> -<span class="lineNum"> 185 </span><span class="lineNoCov"> 0 : __parent = (__holeIndex - 1) / 2;</span> -<span class="lineNum"> 186 </span> : } -<span class="lineNum"> 187 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);</span> -<span class="lineNum"> 188 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : /** -<span class="lineNum"> 191 </span> : * @brief Push an element onto a heap using comparison functor. -<span class="lineNum"> 192 </span> : * @param first Start of heap. -<span class="lineNum"> 193 </span> : * @param last End of heap + element. -<span class="lineNum"> 194 </span> : * @param comp Comparison functor. -<span class="lineNum"> 195 </span> : * @ingroup heap -<span class="lineNum"> 196 </span> : * -<span class="lineNum"> 197 </span> : * This operation pushes the element at last-1 onto the valid heap over the -<span class="lineNum"> 198 </span> : * range [first,last-1). After completion, [first,last) is a valid heap. -<span class="lineNum"> 199 </span> : * Compare operations are performed using comp. -<span class="lineNum"> 200 </span> : */ -<span class="lineNum"> 201 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 202 </span> : inline void -<span class="lineNum"> 203 </span> : push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 204 </span> : _Compare __comp) -<span class="lineNum"> 205 </span> : { -<span class="lineNum"> 206 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 207 </span> : _ValueType; -<span class="lineNum"> 208 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 209 </span> : _DistanceType; -<span class="lineNum"> 210 </span> : -<span class="lineNum"> 211 </span> : // concept requirements -<span class="lineNum"> 212 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 213 </span> : _RandomAccessIterator>) -<span class="lineNum"> 214 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 215 </span> : __glibcxx_requires_heap_pred(__first, __last - 1, __comp); -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); -<span class="lineNum"> 218 </span> : std::__push_heap(__first, _DistanceType((__last - __first) - 1), -<span class="lineNum"> 219 </span> : _DistanceType(0), _GLIBCXX_MOVE(__value), __comp); -<span class="lineNum"> 220 </span> : } -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : template<typename _RandomAccessIterator, typename _Distance, typename _Tp> -<span class="lineNum"> 223 </span> : void -<span class="lineNum"> 224 </span> : __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, -<span class="lineNum"> 225 </span><span class="lineNoCov"> 0 : _Distance __len, _Tp __value)</span> -<span class="lineNum"> 226 </span> : { -<span class="lineNum"> 227 </span><span class="lineNoCov"> 0 : const _Distance __topIndex = __holeIndex;</span> -<span class="lineNum"> 228 </span><span class="lineNoCov"> 0 : _Distance __secondChild = __holeIndex;</span> -<span class="lineNum"> 229 </span><span class="lineNoCov"> 0 : while (__secondChild < (__len - 1) / 2)</span> -<span class="lineNum"> 230 </span> : { -<span class="lineNum"> 231 </span><span class="lineNoCov"> 0 : __secondChild = 2 * (__secondChild + 1);</span> -<span class="lineNum"> 232 </span><span class="lineNoCov"> 0 : if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))</span> -<span class="lineNum"> 233 </span><span class="lineNoCov"> 0 : __secondChild--;</span> -<span class="lineNum"> 234 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));</span> -<span class="lineNum"> 235 </span><span class="lineNoCov"> 0 : __holeIndex = __secondChild;</span> -<span class="lineNum"> 236 </span> : } -<span class="lineNum"> 237 </span><span class="lineNoCov"> 0 : if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)</span> -<span class="lineNum"> 238 </span> : { -<span class="lineNum"> 239 </span><span class="lineNoCov"> 0 : __secondChild = 2 * (__secondChild + 1);</span> -<span class="lineNum"> 240 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first</span> -<span class="lineNum"> 241 </span> : + (__secondChild - 1))); -<span class="lineNum"> 242 </span><span class="lineNoCov"> 0 : __holeIndex = __secondChild - 1;</span> -<span class="lineNum"> 243 </span> : } -<span class="lineNum"> 244 </span><span class="lineNoCov"> 0 : std::__push_heap(__first, __holeIndex, __topIndex,</span> -<span class="lineNum"> 245 </span> : _GLIBCXX_MOVE(__value)); -<span class="lineNum"> 246 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 249 </span> : inline void -<span class="lineNum"> 250 </span> : __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 251 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __result)</span> -<span class="lineNum"> 252 </span> : { -<span class="lineNum"> 253 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 254 </span> : _ValueType; -<span class="lineNum"> 255 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 256 </span> : _DistanceType; -<span class="lineNum"> 257 </span> : -<span class="lineNum"> 258 </span><span class="lineNoCov"> 0 : _ValueType __value = _GLIBCXX_MOVE(*__result);</span> -<span class="lineNum"> 259 </span><span class="lineNoCov"> 0 : *__result = _GLIBCXX_MOVE(*__first);</span> -<span class="lineNum"> 260 </span><span class="lineNoCov"> 0 : std::__adjust_heap(__first, _DistanceType(0),</span> -<span class="lineNum"> 261 </span> : _DistanceType(__last - __first), -<span class="lineNum"> 262 </span> : _GLIBCXX_MOVE(__value)); -<span class="lineNum"> 263 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 264 </span> : -<span class="lineNum"> 265 </span> : /** -<span class="lineNum"> 266 </span> : * @brief Pop an element off a heap. -<span class="lineNum"> 267 </span> : * @param first Start of heap. -<span class="lineNum"> 268 </span> : * @param last End of heap. -<span class="lineNum"> 269 </span> : * @ingroup heap -<span class="lineNum"> 270 </span> : * -<span class="lineNum"> 271 </span> : * This operation pops the top of the heap. The elements first and last-1 -<span class="lineNum"> 272 </span> : * are swapped and [first,last-1) is made into a heap. -<span class="lineNum"> 273 </span> : */ -<span class="lineNum"> 274 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 275 </span> : inline void -<span class="lineNum"> 276 </span><span class="lineNoCov"> 0 : pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</span> -<span class="lineNum"> 277 </span> : { -<span class="lineNum"> 278 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 279 </span> : _ValueType; -<span class="lineNum"> 280 </span> : -<span class="lineNum"> 281 </span> : // concept requirements -<span class="lineNum"> 282 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 283 </span> : _RandomAccessIterator>) -<span class="lineNum"> 284 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 285 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 286 </span> : __glibcxx_requires_heap(__first, __last); -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span><span class="lineNoCov"> 0 : std::__pop_heap(__first, __last - 1, __last - 1);</span> -<span class="lineNum"> 289 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 290 </span> : -<span class="lineNum"> 291 </span> : template<typename _RandomAccessIterator, typename _Distance, -<span class="lineNum"> 292 </span> : typename _Tp, typename _Compare> -<span class="lineNum"> 293 </span> : void -<span class="lineNum"> 294 </span> : __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, -<span class="lineNum"> 295 </span><span class="lineNoCov"> 0 : _Distance __len, _Tp __value, _Compare __comp)</span> -<span class="lineNum"> 296 </span> : { -<span class="lineNum"> 297 </span><span class="lineNoCov"> 0 : const _Distance __topIndex = __holeIndex;</span> -<span class="lineNum"> 298 </span><span class="lineNoCov"> 0 : _Distance __secondChild = __holeIndex;</span> -<span class="lineNum"> 299 </span><span class="lineNoCov"> 0 : while (__secondChild < (__len - 1) / 2)</span> -<span class="lineNum"> 300 </span> : { -<span class="lineNum"> 301 </span><span class="lineNoCov"> 0 : __secondChild = 2 * (__secondChild + 1);</span> -<span class="lineNum"> 302 </span><span class="lineNoCov"> 0 : if (__comp(*(__first + __secondChild),</span> -<span class="lineNum"> 303 </span> : *(__first + (__secondChild - 1)))) -<span class="lineNum"> 304 </span><span class="lineNoCov"> 0 : __secondChild--;</span> -<span class="lineNum"> 305 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));</span> -<span class="lineNum"> 306 </span><span class="lineNoCov"> 0 : __holeIndex = __secondChild;</span> -<span class="lineNum"> 307 </span> : } -<span class="lineNum"> 308 </span><span class="lineNoCov"> 0 : if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)</span> -<span class="lineNum"> 309 </span> : { -<span class="lineNum"> 310 </span><span class="lineNoCov"> 0 : __secondChild = 2 * (__secondChild + 1);</span> -<span class="lineNum"> 311 </span><span class="lineNoCov"> 0 : *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first</span> -<span class="lineNum"> 312 </span> : + (__secondChild - 1))); -<span class="lineNum"> 313 </span><span class="lineNoCov"> 0 : __holeIndex = __secondChild - 1;</span> -<span class="lineNum"> 314 </span> : } -<span class="lineNum"> 315 </span><span class="lineNoCov"> 0 : std::__push_heap(__first, __holeIndex, __topIndex, </span> -<span class="lineNum"> 316 </span> : _GLIBCXX_MOVE(__value), __comp); -<span class="lineNum"> 317 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 320 </span> : inline void -<span class="lineNum"> 321 </span> : __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 322 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __result, _Compare __comp)</span> -<span class="lineNum"> 323 </span> : { -<span class="lineNum"> 324 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 325 </span> : _ValueType; -<span class="lineNum"> 326 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 327 </span> : _DistanceType; -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span><span class="lineNoCov"> 0 : _ValueType __value = _GLIBCXX_MOVE(*__result);</span> -<span class="lineNum"> 330 </span><span class="lineNoCov"> 0 : *__result = _GLIBCXX_MOVE(*__first);</span> -<span class="lineNum"> 331 </span><span class="lineNoCov"> 0 : std::__adjust_heap(__first, _DistanceType(0),</span> -<span class="lineNum"> 332 </span> : _DistanceType(__last - __first), -<span class="lineNum"> 333 </span> : _GLIBCXX_MOVE(__value), __comp); -<span class="lineNum"> 334 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : /** -<span class="lineNum"> 337 </span> : * @brief Pop an element off a heap using comparison functor. -<span class="lineNum"> 338 </span> : * @param first Start of heap. -<span class="lineNum"> 339 </span> : * @param last End of heap. -<span class="lineNum"> 340 </span> : * @param comp Comparison functor to use. -<span class="lineNum"> 341 </span> : * @ingroup heap -<span class="lineNum"> 342 </span> : * -<span class="lineNum"> 343 </span> : * This operation pops the top of the heap. The elements first and last-1 -<span class="lineNum"> 344 </span> : * are swapped and [first,last-1) is made into a heap. Comparisons are -<span class="lineNum"> 345 </span> : * made using comp. -<span class="lineNum"> 346 </span> : */ -<span class="lineNum"> 347 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 348 </span> : inline void -<span class="lineNum"> 349 </span> : pop_heap(_RandomAccessIterator __first, -<span class="lineNum"> 350 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 351 </span> : { -<span class="lineNum"> 352 </span> : // concept requirements -<span class="lineNum"> 353 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 354 </span> : _RandomAccessIterator>) -<span class="lineNum"> 355 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 356 </span> : __glibcxx_requires_heap_pred(__first, __last, __comp); -<span class="lineNum"> 357 </span> : -<span class="lineNum"> 358 </span><span class="lineNoCov"> 0 : std::__pop_heap(__first, __last - 1, __last - 1, __comp);</span> -<span class="lineNum"> 359 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 360 </span> : -<span class="lineNum"> 361 </span> : /** -<span class="lineNum"> 362 </span> : * @brief Construct a heap over a range. -<span class="lineNum"> 363 </span> : * @param first Start of heap. -<span class="lineNum"> 364 </span> : * @param last End of heap. -<span class="lineNum"> 365 </span> : * @ingroup heap -<span class="lineNum"> 366 </span> : * -<span class="lineNum"> 367 </span> : * This operation makes the elements in [first,last) into a heap. -<span class="lineNum"> 368 </span> : */ -<span class="lineNum"> 369 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 370 </span> : void -<span class="lineNum"> 371 </span><span class="lineNoCov"> 0 : make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</span> -<span class="lineNum"> 372 </span> : { -<span class="lineNum"> 373 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 374 </span> : _ValueType; -<span class="lineNum"> 375 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 376 </span> : _DistanceType; -<span class="lineNum"> 377 </span> : -<span class="lineNum"> 378 </span> : // concept requirements -<span class="lineNum"> 379 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 380 </span> : _RandomAccessIterator>) -<span class="lineNum"> 381 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 382 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 383 </span> : -<span class="lineNum"> 384 </span><span class="lineNoCov"> 0 : if (__last - __first < 2)</span> -<span class="lineNum"> 385 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span><span class="lineNoCov"> 0 : const _DistanceType __len = __last - __first;</span> -<span class="lineNum"> 388 </span><span class="lineNoCov"> 0 : _DistanceType __parent = (__len - 2) / 2;</span> -<span class="lineNum"> 389 </span><span class="lineNoCov"> 0 : while (true)</span> -<span class="lineNum"> 390 </span> : { -<span class="lineNum"> 391 </span><span class="lineNoCov"> 0 : _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));</span> -<span class="lineNum"> 392 </span><span class="lineNoCov"> 0 : std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value));</span> -<span class="lineNum"> 393 </span><span class="lineNoCov"> 0 : if (__parent == 0)</span> -<span class="lineNum"> 394 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 395 </span><span class="lineNoCov"> 0 : __parent--;</span> -<span class="lineNum"> 396 </span> : } -<span class="lineNum"> 397 </span> : } -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : /** -<span class="lineNum"> 400 </span> : * @brief Construct a heap over a range using comparison functor. -<span class="lineNum"> 401 </span> : * @param first Start of heap. -<span class="lineNum"> 402 </span> : * @param last End of heap. -<span class="lineNum"> 403 </span> : * @param comp Comparison functor to use. -<span class="lineNum"> 404 </span> : * @ingroup heap -<span class="lineNum"> 405 </span> : * -<span class="lineNum"> 406 </span> : * This operation makes the elements in [first,last) into a heap. -<span class="lineNum"> 407 </span> : * Comparisons are made using comp. -<span class="lineNum"> 408 </span> : */ -<span class="lineNum"> 409 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 410 </span> : void -<span class="lineNum"> 411 </span> : make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 412 </span><span class="lineNoCov"> 0 : _Compare __comp)</span> -<span class="lineNum"> 413 </span> : { -<span class="lineNum"> 414 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 415 </span> : _ValueType; -<span class="lineNum"> 416 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 417 </span> : _DistanceType; -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : // concept requirements -<span class="lineNum"> 420 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 421 </span> : _RandomAccessIterator>) -<span class="lineNum"> 422 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 423 </span> : -<span class="lineNum"> 424 </span><span class="lineNoCov"> 0 : if (__last - __first < 2)</span> -<span class="lineNum"> 425 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span><span class="lineNoCov"> 0 : const _DistanceType __len = __last - __first;</span> -<span class="lineNum"> 428 </span><span class="lineNoCov"> 0 : _DistanceType __parent = (__len - 2) / 2;</span> -<span class="lineNum"> 429 </span><span class="lineNoCov"> 0 : while (true)</span> -<span class="lineNum"> 430 </span> : { -<span class="lineNum"> 431 </span><span class="lineNoCov"> 0 : _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));</span> -<span class="lineNum"> 432 </span><span class="lineNoCov"> 0 : std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),</span> -<span class="lineNum"> 433 </span> : __comp); -<span class="lineNum"> 434 </span><span class="lineNoCov"> 0 : if (__parent == 0)</span> -<span class="lineNum"> 435 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 436 </span><span class="lineNoCov"> 0 : __parent--;</span> -<span class="lineNum"> 437 </span> : } -<span class="lineNum"> 438 </span> : } -<span class="lineNum"> 439 </span> : -<span class="lineNum"> 440 </span> : /** -<span class="lineNum"> 441 </span> : * @brief Sort a heap. -<span class="lineNum"> 442 </span> : * @param first Start of heap. -<span class="lineNum"> 443 </span> : * @param last End of heap. -<span class="lineNum"> 444 </span> : * @ingroup heap -<span class="lineNum"> 445 </span> : * -<span class="lineNum"> 446 </span> : * This operation sorts the valid heap in the range [first,last). -<span class="lineNum"> 447 </span> : */ -<span class="lineNum"> 448 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 449 </span> : void -<span class="lineNum"> 450 </span><span class="lineNoCov"> 0 : sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</span> -<span class="lineNum"> 451 </span> : { -<span class="lineNum"> 452 </span> : // concept requirements -<span class="lineNum"> 453 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 454 </span> : _RandomAccessIterator>) -<span class="lineNum"> 455 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 456 </span> : typename iterator_traits<_RandomAccessIterator>::value_type>) -<span class="lineNum"> 457 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 458 </span> : __glibcxx_requires_heap(__first, __last); -<span class="lineNum"> 459 </span> : -<span class="lineNum"> 460 </span><span class="lineNoCov"> 0 : while (__last - __first > 1)</span> -<span class="lineNum"> 461 </span><span class="lineNoCov"> 0 : std::pop_heap(__first, _RandomAccessIterator(__last--));</span> -<span class="lineNum"> 462 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 463 </span> : -<span class="lineNum"> 464 </span> : /** -<span class="lineNum"> 465 </span> : * @brief Sort a heap using comparison functor. -<span class="lineNum"> 466 </span> : * @param first Start of heap. -<span class="lineNum"> 467 </span> : * @param last End of heap. -<span class="lineNum"> 468 </span> : * @param comp Comparison functor to use. -<span class="lineNum"> 469 </span> : * @ingroup heap -<span class="lineNum"> 470 </span> : * -<span class="lineNum"> 471 </span> : * This operation sorts the valid heap in the range [first,last). -<span class="lineNum"> 472 </span> : * Comparisons are made using comp. -<span class="lineNum"> 473 </span> : */ -<span class="lineNum"> 474 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 475 </span> : void -<span class="lineNum"> 476 </span> : sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 477 </span><span class="lineNoCov"> 0 : _Compare __comp)</span> -<span class="lineNum"> 478 </span> : { -<span class="lineNum"> 479 </span> : // concept requirements -<span class="lineNum"> 480 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 481 </span> : _RandomAccessIterator>) -<span class="lineNum"> 482 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 483 </span> : __glibcxx_requires_heap_pred(__first, __last, __comp); -<span class="lineNum"> 484 </span> : -<span class="lineNum"> 485 </span><span class="lineNoCov"> 0 : while (__last - __first > 1)</span> -<span class="lineNum"> 486 </span><span class="lineNoCov"> 0 : std::pop_heap(__first, _RandomAccessIterator(__last--), __comp);</span> -<span class="lineNum"> 487 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 488 </span> : -<span class="lineNum"> 489 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 490 </span> : /** -<span class="lineNum"> 491 </span> : * @brief Search the end of a heap. -<span class="lineNum"> 492 </span> : * @param first Start of range. -<span class="lineNum"> 493 </span> : * @param last End of range. -<span class="lineNum"> 494 </span> : * @return An iterator pointing to the first element not in the heap. -<span class="lineNum"> 495 </span> : * @ingroup heap -<span class="lineNum"> 496 </span> : * -<span class="lineNum"> 497 </span> : * This operation returns the last iterator i in [first, last) for which -<span class="lineNum"> 498 </span> : * the range [first, i) is a heap. -<span class="lineNum"> 499 </span> : */ -<span class="lineNum"> 500 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 501 </span> : inline _RandomAccessIterator -<span class="lineNum"> 502 </span> : is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 503 </span> : { -<span class="lineNum"> 504 </span> : // concept requirements -<span class="lineNum"> 505 </span> : __glibcxx_function_requires(_RandomAccessIteratorConcept< -<span class="lineNum"> 506 </span> : _RandomAccessIterator>) -<span class="lineNum"> 507 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 508 </span> : typename iterator_traits<_RandomAccessIterator>::value_type>) -<span class="lineNum"> 509 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 510 </span> : -<span class="lineNum"> 511 </span> : return __first + std::__is_heap_until(__first, std::distance(__first, -<span class="lineNum"> 512 </span> : __last)); -<span class="lineNum"> 513 </span> : } -<span class="lineNum"> 514 </span> : -<span class="lineNum"> 515 </span> : /** -<span class="lineNum"> 516 </span> : * @brief Search the end of a heap using comparison functor. -<span class="lineNum"> 517 </span> : * @param first Start of range. -<span class="lineNum"> 518 </span> : * @param last End of range. -<span class="lineNum"> 519 </span> : * @param comp Comparison functor to use. -<span class="lineNum"> 520 </span> : * @return An iterator pointing to the first element not in the heap. -<span class="lineNum"> 521 </span> : * @ingroup heap -<span class="lineNum"> 522 </span> : * -<span class="lineNum"> 523 </span> : * This operation returns the last iterator i in [first, last) for which -<span class="lineNum"> 524 </span> : * the range [first, i) is a heap. Comparisons are made using comp. -<span class="lineNum"> 525 </span> : */ -<span class="lineNum"> 526 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 527 </span> : inline _RandomAccessIterator -<span class="lineNum"> 528 </span> : is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 529 </span> : _Compare __comp) -<span class="lineNum"> 530 </span> : { -<span class="lineNum"> 531 </span> : // concept requirements -<span class="lineNum"> 532 </span> : __glibcxx_function_requires(_RandomAccessIteratorConcept< -<span class="lineNum"> 533 </span> : _RandomAccessIterator>) -<span class="lineNum"> 534 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 535 </span> : -<span class="lineNum"> 536 </span> : return __first + std::__is_heap_until(__first, std::distance(__first, -<span class="lineNum"> 537 </span> : __last), -<span class="lineNum"> 538 </span> : __comp); -<span class="lineNum"> 539 </span> : } -<span class="lineNum"> 540 </span> : -<span class="lineNum"> 541 </span> : /** -<span class="lineNum"> 542 </span> : * @brief Determines whether a range is a heap. -<span class="lineNum"> 543 </span> : * @param first Start of range. -<span class="lineNum"> 544 </span> : * @param last End of range. -<span class="lineNum"> 545 </span> : * @return True if range is a heap, false otherwise. -<span class="lineNum"> 546 </span> : * @ingroup heap -<span class="lineNum"> 547 </span> : */ -<span class="lineNum"> 548 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 549 </span> : inline bool -<span class="lineNum"> 550 </span> : is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 551 </span> : { return std::is_heap_until(__first, __last) == __last; } -<span class="lineNum"> 552 </span> : -<span class="lineNum"> 553 </span> : /** -<span class="lineNum"> 554 </span> : * @brief Determines whether a range is a heap using comparison functor. -<span class="lineNum"> 555 </span> : * @param first Start of range. -<span class="lineNum"> 556 </span> : * @param last End of range. -<span class="lineNum"> 557 </span> : * @param comp Comparison functor to use. -<span class="lineNum"> 558 </span> : * @return True if range is a heap, false otherwise. -<span class="lineNum"> 559 </span> : * @ingroup heap -<span class="lineNum"> 560 </span> : */ -<span class="lineNum"> 561 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 562 </span> : inline bool -<span class="lineNum"> 563 </span> : is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 564 </span> : _Compare __comp) -<span class="lineNum"> 565 </span> : { return std::is_heap_until(__first, __last, __comp) == __last; } -<span class="lineNum"> 566 </span> : #endif -<span class="lineNum"> 567 </span> : -<span class="lineNum"> 568 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 569 </span> : -<span class="lineNum"> 570 </span> : #endif /* _STL_HEAP_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_iterator.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_iterator.h.gcov.html deleted file mode 100644 index 20e1312..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_iterator.h.gcov.html +++ /dev/null @@ -1,1095 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_iterator.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_iterator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">66</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">93.9 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">62</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Iterators -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1998 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_iterator.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * This file implements reverse_iterator, back_insert_iterator, -<span class="lineNum"> 62 </span> : * front_insert_iterator, insert_iterator, __normal_iterator, and their -<span class="lineNum"> 63 </span> : * supporting functions and overloaded operators. -<span class="lineNum"> 64 </span> : */ -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : #ifndef _STL_ITERATOR_H -<span class="lineNum"> 67 </span> : #define _STL_ITERATOR_H 1 -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 70 </span> : #include <ext/type_traits.h> -<span class="lineNum"> 71 </span> : #include <bits/stl_move.h> -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : // 24.4.1 Reverse iterators -<span class="lineNum"> 76 </span> : /** -<span class="lineNum"> 77 </span> : * "Bidirectional and random access iterators have corresponding reverse -<span class="lineNum"> 78 </span> : * %iterator adaptors that iterate through the data structure in the -<span class="lineNum"> 79 </span> : * opposite direction. They have the same signatures as the corresponding -<span class="lineNum"> 80 </span> : * iterators. The fundamental relation between a reverse %iterator and its -<span class="lineNum"> 81 </span> : * corresponding %iterator @c i is established by the identity: -<span class="lineNum"> 82 </span> : * @code -<span class="lineNum"> 83 </span> : * &*(reverse_iterator(i)) == &*(i - 1) -<span class="lineNum"> 84 </span> : * @endcode -<span class="lineNum"> 85 </span> : * -<span class="lineNum"> 86 </span> : * This mapping is dictated by the fact that while there is always a -<span class="lineNum"> 87 </span> : * pointer past the end of an array, there might not be a valid pointer -<span class="lineNum"> 88 </span> : * before the beginning of an array." [24.4.1]/1,2 -<span class="lineNum"> 89 </span> : * -<span class="lineNum"> 90 </span> : * Reverse iterators can be tricky and surprising at first. Their -<span class="lineNum"> 91 </span> : * semantics make sense, however, and the trickiness is a side effect of -<span class="lineNum"> 92 </span> : * the requirement that the iterators must be safe. -<span class="lineNum"> 93 </span> : */ -<span class="lineNum"> 94 </span> : template<typename _Iterator> -<span class="lineNum"> 95 </span> : class reverse_iterator -<span class="lineNum"> 96 </span> : : public iterator<typename iterator_traits<_Iterator>::iterator_category, -<span class="lineNum"> 97 </span> : typename iterator_traits<_Iterator>::value_type, -<span class="lineNum"> 98 </span> : typename iterator_traits<_Iterator>::difference_type, -<span class="lineNum"> 99 </span> : typename iterator_traits<_Iterator>::pointer, -<span class="lineNum"> 100 </span> : typename iterator_traits<_Iterator>::reference> -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span> : protected: -<span class="lineNum"> 103 </span> : _Iterator current; -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : public: -<span class="lineNum"> 106 </span> : typedef _Iterator iterator_type; -<span class="lineNum"> 107 </span> : typedef typename iterator_traits<_Iterator>::difference_type -<span class="lineNum"> 108 </span> : difference_type; -<span class="lineNum"> 109 </span> : typedef typename iterator_traits<_Iterator>::reference reference; -<span class="lineNum"> 110 </span> : typedef typename iterator_traits<_Iterator>::pointer pointer; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : public: -<span class="lineNum"> 113 </span> : /** -<span class="lineNum"> 114 </span> : * The default constructor default-initializes member @p current. -<span class="lineNum"> 115 </span> : * If it is a pointer, that means it is zero-initialized. -<span class="lineNum"> 116 </span> : */ -<span class="lineNum"> 117 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 118 </span> : // 235 No specification of default ctor for reverse_iterator -<span class="lineNum"> 119 </span> : reverse_iterator() : current() { } -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : /** -<span class="lineNum"> 122 </span> : * This %iterator will move in the opposite direction that @p x does. -<span class="lineNum"> 123 </span> : */ -<span class="lineNum"> 124 </span> : explicit -<span class="lineNum"> 125 </span><span class="lineCov"> 34 : reverse_iterator(iterator_type __x) : current(__x) { }</span> -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : /** -<span class="lineNum"> 128 </span> : * The copy constructor is normal. -<span class="lineNum"> 129 </span> : */ -<span class="lineNum"> 130 </span> : reverse_iterator(const reverse_iterator& __x) -<span class="lineNum"> 131 </span> : : current(__x.current) { } -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : /** -<span class="lineNum"> 134 </span> : * A reverse_iterator across other types can be copied in the normal -<span class="lineNum"> 135 </span> : * fashion. -<span class="lineNum"> 136 </span> : */ -<span class="lineNum"> 137 </span> : template<typename _Iter> -<span class="lineNum"> 138 </span> : reverse_iterator(const reverse_iterator<_Iter>& __x) -<span class="lineNum"> 139 </span> : : current(__x.base()) { } -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : /** -<span class="lineNum"> 142 </span> : * @return @c current, the %iterator used for underlying work. -<span class="lineNum"> 143 </span> : */ -<span class="lineNum"> 144 </span> : iterator_type -<span class="lineNum"> 145 </span> : base() const -<span class="lineNum"> 146 </span> : { return current; } -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : /** -<span class="lineNum"> 149 </span> : * @return TODO -<span class="lineNum"> 150 </span> : * -<span class="lineNum"> 151 </span> : * @doctodo -<span class="lineNum"> 152 </span> : */ -<span class="lineNum"> 153 </span> : reference -<span class="lineNum"> 154 </span><span class="lineCov"> 34 : operator*() const</span> -<span class="lineNum"> 155 </span> : { -<span class="lineNum"> 156 </span><span class="lineCov"> 34 : _Iterator __tmp = current;</span> -<span class="lineNum"> 157 </span><span class="lineCov"> 34 : return *--__tmp;</span> -<span class="lineNum"> 158 </span> : } -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : /** -<span class="lineNum"> 161 </span> : * @return TODO -<span class="lineNum"> 162 </span> : * -<span class="lineNum"> 163 </span> : * @doctodo -<span class="lineNum"> 164 </span> : */ -<span class="lineNum"> 165 </span> : pointer -<span class="lineNum"> 166 </span><span class="lineCov"> 32 : operator->() const</span> -<span class="lineNum"> 167 </span><span class="lineCov"> 32 : { return &(operator*()); }</span> -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : /** -<span class="lineNum"> 170 </span> : * @return TODO -<span class="lineNum"> 171 </span> : * -<span class="lineNum"> 172 </span> : * @doctodo -<span class="lineNum"> 173 </span> : */ -<span class="lineNum"> 174 </span> : reverse_iterator& -<span class="lineNum"> 175 </span> : operator++() -<span class="lineNum"> 176 </span> : { -<span class="lineNum"> 177 </span> : --current; -<span class="lineNum"> 178 </span> : return *this; -<span class="lineNum"> 179 </span> : } -<span class="lineNum"> 180 </span> : -<span class="lineNum"> 181 </span> : /** -<span class="lineNum"> 182 </span> : * @return TODO -<span class="lineNum"> 183 </span> : * -<span class="lineNum"> 184 </span> : * @doctodo -<span class="lineNum"> 185 </span> : */ -<span class="lineNum"> 186 </span> : reverse_iterator -<span class="lineNum"> 187 </span> : operator++(int) -<span class="lineNum"> 188 </span> : { -<span class="lineNum"> 189 </span> : reverse_iterator __tmp = *this; -<span class="lineNum"> 190 </span> : --current; -<span class="lineNum"> 191 </span> : return __tmp; -<span class="lineNum"> 192 </span> : } -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : /** -<span class="lineNum"> 195 </span> : * @return TODO -<span class="lineNum"> 196 </span> : * -<span class="lineNum"> 197 </span> : * @doctodo -<span class="lineNum"> 198 </span> : */ -<span class="lineNum"> 199 </span> : reverse_iterator& -<span class="lineNum"> 200 </span> : operator--() -<span class="lineNum"> 201 </span> : { -<span class="lineNum"> 202 </span> : ++current; -<span class="lineNum"> 203 </span> : return *this; -<span class="lineNum"> 204 </span> : } -<span class="lineNum"> 205 </span> : -<span class="lineNum"> 206 </span> : /** -<span class="lineNum"> 207 </span> : * @return TODO -<span class="lineNum"> 208 </span> : * -<span class="lineNum"> 209 </span> : * @doctodo -<span class="lineNum"> 210 </span> : */ -<span class="lineNum"> 211 </span> : reverse_iterator -<span class="lineNum"> 212 </span> : operator--(int) -<span class="lineNum"> 213 </span> : { -<span class="lineNum"> 214 </span> : reverse_iterator __tmp = *this; -<span class="lineNum"> 215 </span> : ++current; -<span class="lineNum"> 216 </span> : return __tmp; -<span class="lineNum"> 217 </span> : } -<span class="lineNum"> 218 </span> : -<span class="lineNum"> 219 </span> : /** -<span class="lineNum"> 220 </span> : * @return TODO -<span class="lineNum"> 221 </span> : * -<span class="lineNum"> 222 </span> : * @doctodo -<span class="lineNum"> 223 </span> : */ -<span class="lineNum"> 224 </span> : reverse_iterator -<span class="lineNum"> 225 </span> : operator+(difference_type __n) const -<span class="lineNum"> 226 </span> : { return reverse_iterator(current - __n); } -<span class="lineNum"> 227 </span> : -<span class="lineNum"> 228 </span> : /** -<span class="lineNum"> 229 </span> : * @return TODO -<span class="lineNum"> 230 </span> : * -<span class="lineNum"> 231 </span> : * @doctodo -<span class="lineNum"> 232 </span> : */ -<span class="lineNum"> 233 </span> : reverse_iterator& -<span class="lineNum"> 234 </span> : operator+=(difference_type __n) -<span class="lineNum"> 235 </span> : { -<span class="lineNum"> 236 </span> : current -= __n; -<span class="lineNum"> 237 </span> : return *this; -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : /** -<span class="lineNum"> 241 </span> : * @return TODO -<span class="lineNum"> 242 </span> : * -<span class="lineNum"> 243 </span> : * @doctodo -<span class="lineNum"> 244 </span> : */ -<span class="lineNum"> 245 </span> : reverse_iterator -<span class="lineNum"> 246 </span> : operator-(difference_type __n) const -<span class="lineNum"> 247 </span> : { return reverse_iterator(current + __n); } -<span class="lineNum"> 248 </span> : -<span class="lineNum"> 249 </span> : /** -<span class="lineNum"> 250 </span> : * @return TODO -<span class="lineNum"> 251 </span> : * -<span class="lineNum"> 252 </span> : * @doctodo -<span class="lineNum"> 253 </span> : */ -<span class="lineNum"> 254 </span> : reverse_iterator& -<span class="lineNum"> 255 </span> : operator-=(difference_type __n) -<span class="lineNum"> 256 </span> : { -<span class="lineNum"> 257 </span> : current += __n; -<span class="lineNum"> 258 </span> : return *this; -<span class="lineNum"> 259 </span> : } -<span class="lineNum"> 260 </span> : -<span class="lineNum"> 261 </span> : /** -<span class="lineNum"> 262 </span> : * @return TODO -<span class="lineNum"> 263 </span> : * -<span class="lineNum"> 264 </span> : * @doctodo -<span class="lineNum"> 265 </span> : */ -<span class="lineNum"> 266 </span> : reference -<span class="lineNum"> 267 </span> : operator[](difference_type __n) const -<span class="lineNum"> 268 </span> : { return *(*this + __n); } -<span class="lineNum"> 269 </span> : }; -<span class="lineNum"> 270 </span> : -<span class="lineNum"> 271 </span> : //@{ -<span class="lineNum"> 272 </span> : /** -<span class="lineNum"> 273 </span> : * @param x A %reverse_iterator. -<span class="lineNum"> 274 </span> : * @param y A %reverse_iterator. -<span class="lineNum"> 275 </span> : * @return A simple bool. -<span class="lineNum"> 276 </span> : * -<span class="lineNum"> 277 </span> : * Reverse iterators forward many operations to their underlying base() -<span class="lineNum"> 278 </span> : * iterators. Others are implemented in terms of one another. -<span class="lineNum"> 279 </span> : * -<span class="lineNum"> 280 </span> : */ -<span class="lineNum"> 281 </span> : template<typename _Iterator> -<span class="lineNum"> 282 </span> : inline bool -<span class="lineNum"> 283 </span> : operator==(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 284 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 285 </span> : { return __x.base() == __y.base(); } -<span class="lineNum"> 286 </span> : -<span class="lineNum"> 287 </span> : template<typename _Iterator> -<span class="lineNum"> 288 </span> : inline bool -<span class="lineNum"> 289 </span> : operator<(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 290 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 291 </span> : { return __y.base() < __x.base(); } -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : template<typename _Iterator> -<span class="lineNum"> 294 </span> : inline bool -<span class="lineNum"> 295 </span> : operator!=(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 296 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 297 </span> : { return !(__x == __y); } -<span class="lineNum"> 298 </span> : -<span class="lineNum"> 299 </span> : template<typename _Iterator> -<span class="lineNum"> 300 </span> : inline bool -<span class="lineNum"> 301 </span> : operator>(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 302 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 303 </span> : { return __y < __x; } -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : template<typename _Iterator> -<span class="lineNum"> 306 </span> : inline bool -<span class="lineNum"> 307 </span> : operator<=(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 308 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 309 </span> : { return !(__y < __x); } -<span class="lineNum"> 310 </span> : -<span class="lineNum"> 311 </span> : template<typename _Iterator> -<span class="lineNum"> 312 </span> : inline bool -<span class="lineNum"> 313 </span> : operator>=(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 314 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 315 </span> : { return !(__x < __y); } -<span class="lineNum"> 316 </span> : -<span class="lineNum"> 317 </span> : template<typename _Iterator> -<span class="lineNum"> 318 </span> : inline typename reverse_iterator<_Iterator>::difference_type -<span class="lineNum"> 319 </span> : operator-(const reverse_iterator<_Iterator>& __x, -<span class="lineNum"> 320 </span> : const reverse_iterator<_Iterator>& __y) -<span class="lineNum"> 321 </span> : { return __y.base() - __x.base(); } -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : template<typename _Iterator> -<span class="lineNum"> 324 </span> : inline reverse_iterator<_Iterator> -<span class="lineNum"> 325 </span> : operator+(typename reverse_iterator<_Iterator>::difference_type __n, -<span class="lineNum"> 326 </span> : const reverse_iterator<_Iterator>& __x) -<span class="lineNum"> 327 </span> : { return reverse_iterator<_Iterator>(__x.base() - __n); } -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 330 </span> : // DR 280. Comparison of reverse_iterator to const reverse_iterator. -<span class="lineNum"> 331 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 332 </span> : inline bool -<span class="lineNum"> 333 </span> : operator==(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 334 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 335 </span> : { return __x.base() == __y.base(); } -<span class="lineNum"> 336 </span> : -<span class="lineNum"> 337 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 338 </span> : inline bool -<span class="lineNum"> 339 </span> : operator<(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 340 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 341 </span> : { return __y.base() < __x.base(); } -<span class="lineNum"> 342 </span> : -<span class="lineNum"> 343 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 344 </span> : inline bool -<span class="lineNum"> 345 </span> : operator!=(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 346 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 347 </span> : { return !(__x == __y); } -<span class="lineNum"> 348 </span> : -<span class="lineNum"> 349 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 350 </span> : inline bool -<span class="lineNum"> 351 </span> : operator>(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 352 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 353 </span> : { return __y < __x; } -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 356 </span> : inline bool -<span class="lineNum"> 357 </span> : operator<=(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 358 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 359 </span> : { return !(__y < __x); } -<span class="lineNum"> 360 </span> : -<span class="lineNum"> 361 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 362 </span> : inline bool -<span class="lineNum"> 363 </span> : operator>=(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 364 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 365 </span> : { return !(__x < __y); } -<span class="lineNum"> 366 </span> : -<span class="lineNum"> 367 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 368 </span> : inline typename reverse_iterator<_IteratorL>::difference_type -<span class="lineNum"> 369 </span> : operator-(const reverse_iterator<_IteratorL>& __x, -<span class="lineNum"> 370 </span> : const reverse_iterator<_IteratorR>& __y) -<span class="lineNum"> 371 </span> : { return __y.base() - __x.base(); } -<span class="lineNum"> 372 </span> : //@} -<span class="lineNum"> 373 </span> : -<span class="lineNum"> 374 </span> : // 24.4.2.2.1 back_insert_iterator -<span class="lineNum"> 375 </span> : /** -<span class="lineNum"> 376 </span> : * @brief Turns assignment into insertion. -<span class="lineNum"> 377 </span> : * -<span class="lineNum"> 378 </span> : * These are output iterators, constructed from a container-of-T. -<span class="lineNum"> 379 </span> : * Assigning a T to the iterator appends it to the container using -<span class="lineNum"> 380 </span> : * push_back. -<span class="lineNum"> 381 </span> : * -<span class="lineNum"> 382 </span> : * Tip: Using the back_inserter function to create these iterators can -<span class="lineNum"> 383 </span> : * save typing. -<span class="lineNum"> 384 </span> : */ -<span class="lineNum"> 385 </span> : template<typename _Container> -<span class="lineNum"> 386 </span> : class back_insert_iterator -<span class="lineNum"> 387 </span> : : public iterator<output_iterator_tag, void, void, void, void> -<span class="lineNum"> 388 </span> : { -<span class="lineNum"> 389 </span> : protected: -<span class="lineNum"> 390 </span> : _Container* container; -<span class="lineNum"> 391 </span> : -<span class="lineNum"> 392 </span> : public: -<span class="lineNum"> 393 </span> : /// A nested typedef for the type of whatever container you used. -<span class="lineNum"> 394 </span> : typedef _Container container_type; -<span class="lineNum"> 395 </span> : -<span class="lineNum"> 396 </span> : /// The only way to create this %iterator is with a container. -<span class="lineNum"> 397 </span> : explicit -<span class="lineNum"> 398 </span><span class="lineCov"> 946 : back_insert_iterator(_Container& __x) : container(&__x) { }</span> -<span class="lineNum"> 399 </span> : -<span class="lineNum"> 400 </span> : /** -<span class="lineNum"> 401 </span> : * @param value An instance of whatever type -<span class="lineNum"> 402 </span> : * container_type::const_reference is; presumably a -<span class="lineNum"> 403 </span> : * reference-to-const T for container<T>. -<span class="lineNum"> 404 </span> : * @return This %iterator, for chained operations. -<span class="lineNum"> 405 </span> : * -<span class="lineNum"> 406 </span> : * This kind of %iterator doesn't really have a "position" in the -<span class="lineNum"> 407 </span> : * container (you can think of the position as being permanently at -<span class="lineNum"> 408 </span> : * the end, if you like). Assigning a value to the %iterator will -<span class="lineNum"> 409 </span> : * always append the value to the end of the container. -<span class="lineNum"> 410 </span> : */ -<span class="lineNum"> 411 </span> : back_insert_iterator& -<span class="lineNum"> 412 </span><span class="lineCov"> 17415 : operator=(typename _Container::const_reference __value)</span> -<span class="lineNum"> 413 </span> : { -<span class="lineNum"> 414 </span><span class="lineCov"> 17415 : container->push_back(__value);</span> -<span class="lineNum"> 415 </span><span class="lineCov"> 17415 : return *this;</span> -<span class="lineNum"> 416 </span> : } -<span class="lineNum"> 417 </span> : -<span class="lineNum"> 418 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 419 </span> : back_insert_iterator& -<span class="lineNum"> 420 </span> : operator=(typename _Container::value_type&& __value) -<span class="lineNum"> 421 </span> : { -<span class="lineNum"> 422 </span> : container->push_back(std::move(__value)); -<span class="lineNum"> 423 </span> : return *this; -<span class="lineNum"> 424 </span> : } -<span class="lineNum"> 425 </span> : #endif -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span> : /// Simply returns *this. -<span class="lineNum"> 428 </span> : back_insert_iterator& -<span class="lineNum"> 429 </span><span class="lineCov"> 17419 : operator*()</span> -<span class="lineNum"> 430 </span><span class="lineCov"> 17419 : { return *this; }</span> -<span class="lineNum"> 431 </span> : -<span class="lineNum"> 432 </span> : /// Simply returns *this. (This %iterator does not "move".) -<span class="lineNum"> 433 </span> : back_insert_iterator& -<span class="lineNum"> 434 </span><span class="lineCov"> 17405 : operator++()</span> -<span class="lineNum"> 435 </span><span class="lineCov"> 17405 : { return *this; }</span> -<span class="lineNum"> 436 </span> : -<span class="lineNum"> 437 </span> : /// Simply returns *this. (This %iterator does not "move".) -<span class="lineNum"> 438 </span> : back_insert_iterator -<span class="lineNum"> 439 </span><span class="lineCov"> 10 : operator++(int)</span> -<span class="lineNum"> 440 </span><span class="lineCov"> 10 : { return *this; }</span> -<span class="lineNum"> 441 </span> : }; -<span class="lineNum"> 442 </span> : -<span class="lineNum"> 443 </span> : /** -<span class="lineNum"> 444 </span> : * @param x A container of arbitrary type. -<span class="lineNum"> 445 </span> : * @return An instance of back_insert_iterator working on @p x. -<span class="lineNum"> 446 </span> : * -<span class="lineNum"> 447 </span> : * This wrapper function helps in creating back_insert_iterator instances. -<span class="lineNum"> 448 </span> : * Typing the name of the %iterator requires knowing the precise full -<span class="lineNum"> 449 </span> : * type of the container, which can be tedious and impedes generic -<span class="lineNum"> 450 </span> : * programming. Using this function lets you take advantage of automatic -<span class="lineNum"> 451 </span> : * template parameter deduction, making the compiler match the correct -<span class="lineNum"> 452 </span> : * types for you. -<span class="lineNum"> 453 </span> : */ -<span class="lineNum"> 454 </span> : template<typename _Container> -<span class="lineNum"> 455 </span> : inline back_insert_iterator<_Container> -<span class="lineNum"> 456 </span><span class="lineCov"> 946 : back_inserter(_Container& __x)</span> -<span class="lineNum"> 457 </span><span class="lineCov"> 946 : { return back_insert_iterator<_Container>(__x); }</span> -<span class="lineNum"> 458 </span> : -<span class="lineNum"> 459 </span> : /** -<span class="lineNum"> 460 </span> : * @brief Turns assignment into insertion. -<span class="lineNum"> 461 </span> : * -<span class="lineNum"> 462 </span> : * These are output iterators, constructed from a container-of-T. -<span class="lineNum"> 463 </span> : * Assigning a T to the iterator prepends it to the container using -<span class="lineNum"> 464 </span> : * push_front. -<span class="lineNum"> 465 </span> : * -<span class="lineNum"> 466 </span> : * Tip: Using the front_inserter function to create these iterators can -<span class="lineNum"> 467 </span> : * save typing. -<span class="lineNum"> 468 </span> : */ -<span class="lineNum"> 469 </span> : template<typename _Container> -<span class="lineNum"> 470 </span> : class front_insert_iterator -<span class="lineNum"> 471 </span> : : public iterator<output_iterator_tag, void, void, void, void> -<span class="lineNum"> 472 </span> : { -<span class="lineNum"> 473 </span> : protected: -<span class="lineNum"> 474 </span> : _Container* container; -<span class="lineNum"> 475 </span> : -<span class="lineNum"> 476 </span> : public: -<span class="lineNum"> 477 </span> : /// A nested typedef for the type of whatever container you used. -<span class="lineNum"> 478 </span> : typedef _Container container_type; -<span class="lineNum"> 479 </span> : -<span class="lineNum"> 480 </span> : /// The only way to create this %iterator is with a container. -<span class="lineNum"> 481 </span> : explicit front_insert_iterator(_Container& __x) : container(&__x) { } -<span class="lineNum"> 482 </span> : -<span class="lineNum"> 483 </span> : /** -<span class="lineNum"> 484 </span> : * @param value An instance of whatever type -<span class="lineNum"> 485 </span> : * container_type::const_reference is; presumably a -<span class="lineNum"> 486 </span> : * reference-to-const T for container<T>. -<span class="lineNum"> 487 </span> : * @return This %iterator, for chained operations. -<span class="lineNum"> 488 </span> : * -<span class="lineNum"> 489 </span> : * This kind of %iterator doesn't really have a "position" in the -<span class="lineNum"> 490 </span> : * container (you can think of the position as being permanently at -<span class="lineNum"> 491 </span> : * the front, if you like). Assigning a value to the %iterator will -<span class="lineNum"> 492 </span> : * always prepend the value to the front of the container. -<span class="lineNum"> 493 </span> : */ -<span class="lineNum"> 494 </span> : front_insert_iterator& -<span class="lineNum"> 495 </span> : operator=(typename _Container::const_reference __value) -<span class="lineNum"> 496 </span> : { -<span class="lineNum"> 497 </span> : container->push_front(__value); -<span class="lineNum"> 498 </span> : return *this; -<span class="lineNum"> 499 </span> : } -<span class="lineNum"> 500 </span> : -<span class="lineNum"> 501 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 502 </span> : front_insert_iterator& -<span class="lineNum"> 503 </span> : operator=(typename _Container::value_type&& __value) -<span class="lineNum"> 504 </span> : { -<span class="lineNum"> 505 </span> : container->push_front(std::move(__value)); -<span class="lineNum"> 506 </span> : return *this; -<span class="lineNum"> 507 </span> : } -<span class="lineNum"> 508 </span> : #endif -<span class="lineNum"> 509 </span> : -<span class="lineNum"> 510 </span> : /// Simply returns *this. -<span class="lineNum"> 511 </span> : front_insert_iterator& -<span class="lineNum"> 512 </span> : operator*() -<span class="lineNum"> 513 </span> : { return *this; } -<span class="lineNum"> 514 </span> : -<span class="lineNum"> 515 </span> : /// Simply returns *this. (This %iterator does not "move".) -<span class="lineNum"> 516 </span> : front_insert_iterator& -<span class="lineNum"> 517 </span> : operator++() -<span class="lineNum"> 518 </span> : { return *this; } -<span class="lineNum"> 519 </span> : -<span class="lineNum"> 520 </span> : /// Simply returns *this. (This %iterator does not "move".) -<span class="lineNum"> 521 </span> : front_insert_iterator -<span class="lineNum"> 522 </span> : operator++(int) -<span class="lineNum"> 523 </span> : { return *this; } -<span class="lineNum"> 524 </span> : }; -<span class="lineNum"> 525 </span> : -<span class="lineNum"> 526 </span> : /** -<span class="lineNum"> 527 </span> : * @param x A container of arbitrary type. -<span class="lineNum"> 528 </span> : * @return An instance of front_insert_iterator working on @p x. -<span class="lineNum"> 529 </span> : * -<span class="lineNum"> 530 </span> : * This wrapper function helps in creating front_insert_iterator instances. -<span class="lineNum"> 531 </span> : * Typing the name of the %iterator requires knowing the precise full -<span class="lineNum"> 532 </span> : * type of the container, which can be tedious and impedes generic -<span class="lineNum"> 533 </span> : * programming. Using this function lets you take advantage of automatic -<span class="lineNum"> 534 </span> : * template parameter deduction, making the compiler match the correct -<span class="lineNum"> 535 </span> : * types for you. -<span class="lineNum"> 536 </span> : */ -<span class="lineNum"> 537 </span> : template<typename _Container> -<span class="lineNum"> 538 </span> : inline front_insert_iterator<_Container> -<span class="lineNum"> 539 </span> : front_inserter(_Container& __x) -<span class="lineNum"> 540 </span> : { return front_insert_iterator<_Container>(__x); } -<span class="lineNum"> 541 </span> : -<span class="lineNum"> 542 </span> : /** -<span class="lineNum"> 543 </span> : * @brief Turns assignment into insertion. -<span class="lineNum"> 544 </span> : * -<span class="lineNum"> 545 </span> : * These are output iterators, constructed from a container-of-T. -<span class="lineNum"> 546 </span> : * Assigning a T to the iterator inserts it in the container at the -<span class="lineNum"> 547 </span> : * %iterator's position, rather than overwriting the value at that -<span class="lineNum"> 548 </span> : * position. -<span class="lineNum"> 549 </span> : * -<span class="lineNum"> 550 </span> : * (Sequences will actually insert a @e copy of the value before the -<span class="lineNum"> 551 </span> : * %iterator's position.) -<span class="lineNum"> 552 </span> : * -<span class="lineNum"> 553 </span> : * Tip: Using the inserter function to create these iterators can -<span class="lineNum"> 554 </span> : * save typing. -<span class="lineNum"> 555 </span> : */ -<span class="lineNum"> 556 </span> : template<typename _Container> -<span class="lineNum"> 557 </span> : class insert_iterator -<span class="lineNum"> 558 </span> : : public iterator<output_iterator_tag, void, void, void, void> -<span class="lineNum"> 559 </span> : { -<span class="lineNum"> 560 </span> : protected: -<span class="lineNum"> 561 </span> : _Container* container; -<span class="lineNum"> 562 </span> : typename _Container::iterator iter; -<span class="lineNum"> 563 </span> : -<span class="lineNum"> 564 </span> : public: -<span class="lineNum"> 565 </span> : /// A nested typedef for the type of whatever container you used. -<span class="lineNum"> 566 </span> : typedef _Container container_type; -<span class="lineNum"> 567 </span> : -<span class="lineNum"> 568 </span> : /** -<span class="lineNum"> 569 </span> : * The only way to create this %iterator is with a container and an -<span class="lineNum"> 570 </span> : * initial position (a normal %iterator into the container). -<span class="lineNum"> 571 </span> : */ -<span class="lineNum"> 572 </span><span class="lineCov"> 21203 : insert_iterator(_Container& __x, typename _Container::iterator __i)</span> -<span class="lineNum"> 573 </span><span class="lineCov"> 21203 : : container(&__x), iter(__i) {}</span> -<span class="lineNum"> 574 </span> : -<span class="lineNum"> 575 </span> : /** -<span class="lineNum"> 576 </span> : * @param value An instance of whatever type -<span class="lineNum"> 577 </span> : * container_type::const_reference is; presumably a -<span class="lineNum"> 578 </span> : * reference-to-const T for container<T>. -<span class="lineNum"> 579 </span> : * @return This %iterator, for chained operations. -<span class="lineNum"> 580 </span> : * -<span class="lineNum"> 581 </span> : * This kind of %iterator maintains its own position in the -<span class="lineNum"> 582 </span> : * container. Assigning a value to the %iterator will insert the -<span class="lineNum"> 583 </span> : * value into the container at the place before the %iterator. -<span class="lineNum"> 584 </span> : * -<span class="lineNum"> 585 </span> : * The position is maintained such that subsequent assignments will -<span class="lineNum"> 586 </span> : * insert values immediately after one another. For example, -<span class="lineNum"> 587 </span> : * @code -<span class="lineNum"> 588 </span> : * // vector v contains A and Z -<span class="lineNum"> 589 </span> : * -<span class="lineNum"> 590 </span> : * insert_iterator i (v, ++v.begin()); -<span class="lineNum"> 591 </span> : * i = 1; -<span class="lineNum"> 592 </span> : * i = 2; -<span class="lineNum"> 593 </span> : * i = 3; -<span class="lineNum"> 594 </span> : * -<span class="lineNum"> 595 </span> : * // vector v contains A, 1, 2, 3, and Z -<span class="lineNum"> 596 </span> : * @endcode -<span class="lineNum"> 597 </span> : */ -<span class="lineNum"> 598 </span> : insert_iterator& -<span class="lineNum"> 599 </span><span class="lineCov"> 107622 : operator=(typename _Container::const_reference __value)</span> -<span class="lineNum"> 600 </span> : { -<span class="lineNum"> 601 </span><span class="lineCov"> 107622 : iter = container->insert(iter, __value);</span> -<span class="lineNum"> 602 </span><span class="lineCov"> 107622 : ++iter;</span> -<span class="lineNum"> 603 </span><span class="lineCov"> 107622 : return *this;</span> -<span class="lineNum"> 604 </span> : } -<span class="lineNum"> 605 </span> : -<span class="lineNum"> 606 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 607 </span> : insert_iterator& -<span class="lineNum"> 608 </span> : operator=(typename _Container::value_type&& __value) -<span class="lineNum"> 609 </span> : { -<span class="lineNum"> 610 </span> : iter = container->insert(iter, std::move(__value)); -<span class="lineNum"> 611 </span> : ++iter; -<span class="lineNum"> 612 </span> : return *this; -<span class="lineNum"> 613 </span> : } -<span class="lineNum"> 614 </span> : #endif -<span class="lineNum"> 615 </span> : -<span class="lineNum"> 616 </span> : /// Simply returns *this. -<span class="lineNum"> 617 </span> : insert_iterator& -<span class="lineNum"> 618 </span><span class="lineCov"> 107650 : operator*()</span> -<span class="lineNum"> 619 </span><span class="lineCov"> 107650 : { return *this; }</span> -<span class="lineNum"> 620 </span> : -<span class="lineNum"> 621 </span> : /// Simply returns *this. (This %iterator does not "move".) -<span class="lineNum"> 622 </span> : insert_iterator& -<span class="lineNum"> 623 </span><span class="lineCov"> 107622 : operator++()</span> -<span class="lineNum"> 624 </span><span class="lineCov"> 107622 : { return *this; }</span> -<span class="lineNum"> 625 </span> : -<span class="lineNum"> 626 </span> : /// Simply returns *this. (This %iterator does not "move".) -<span class="lineNum"> 627 </span> : insert_iterator& -<span class="lineNum"> 628 </span><span class="lineNoCov"> 0 : operator++(int)</span> -<span class="lineNum"> 629 </span><span class="lineNoCov"> 0 : { return *this; }</span> -<span class="lineNum"> 630 </span> : }; -<span class="lineNum"> 631 </span> : -<span class="lineNum"> 632 </span> : /** -<span class="lineNum"> 633 </span> : * @param x A container of arbitrary type. -<span class="lineNum"> 634 </span> : * @return An instance of insert_iterator working on @p x. -<span class="lineNum"> 635 </span> : * -<span class="lineNum"> 636 </span> : * This wrapper function helps in creating insert_iterator instances. -<span class="lineNum"> 637 </span> : * Typing the name of the %iterator requires knowing the precise full -<span class="lineNum"> 638 </span> : * type of the container, which can be tedious and impedes generic -<span class="lineNum"> 639 </span> : * programming. Using this function lets you take advantage of automatic -<span class="lineNum"> 640 </span> : * template parameter deduction, making the compiler match the correct -<span class="lineNum"> 641 </span> : * types for you. -<span class="lineNum"> 642 </span> : */ -<span class="lineNum"> 643 </span> : template<typename _Container, typename _Iterator> -<span class="lineNum"> 644 </span> : inline insert_iterator<_Container> -<span class="lineNum"> 645 </span><span class="lineCov"> 21203 : inserter(_Container& __x, _Iterator __i)</span> -<span class="lineNum"> 646 </span> : { -<span class="lineNum"> 647 </span> : return insert_iterator<_Container>(__x, -<span class="lineNum"> 648 </span><span class="lineCov"> 21203 : typename _Container::iterator(__i));</span> -<span class="lineNum"> 649 </span> : } -<span class="lineNum"> 650 </span> : -<span class="lineNum"> 651 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 652 </span> : -<span class="lineNum"> 653 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 654 </span> : -<span class="lineNum"> 655 </span> : // This iterator adapter is 'normal' in the sense that it does not -<span class="lineNum"> 656 </span> : // change the semantics of any of the operators of its iterator -<span class="lineNum"> 657 </span> : // parameter. Its primary purpose is to convert an iterator that is -<span class="lineNum"> 658 </span> : // not a class, e.g. a pointer, into an iterator that is a class. -<span class="lineNum"> 659 </span> : // The _Container parameter exists solely so that different containers -<span class="lineNum"> 660 </span> : // using this template can instantiate different types, even if the -<span class="lineNum"> 661 </span> : // _Iterator parameter is the same. -<span class="lineNum"> 662 </span> : using std::iterator_traits; -<span class="lineNum"> 663 </span> : using std::iterator; -<span class="lineNum"> 664 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 665 </span> : class __normal_iterator -<span class="lineNum"> 666 </span> : { -<span class="lineNum"> 667 </span> : protected: -<span class="lineNum"> 668 </span> : _Iterator _M_current; -<span class="lineNum"> 669 </span> : -<span class="lineNum"> 670 </span> : public: -<span class="lineNum"> 671 </span> : typedef _Iterator iterator_type; -<span class="lineNum"> 672 </span> : typedef typename iterator_traits<_Iterator>::iterator_category -<span class="lineNum"> 673 </span> : iterator_category; -<span class="lineNum"> 674 </span> : typedef typename iterator_traits<_Iterator>::value_type value_type; -<span class="lineNum"> 675 </span> : typedef typename iterator_traits<_Iterator>::difference_type -<span class="lineNum"> 676 </span> : difference_type; -<span class="lineNum"> 677 </span> : typedef typename iterator_traits<_Iterator>::reference reference; -<span class="lineNum"> 678 </span> : typedef typename iterator_traits<_Iterator>::pointer pointer; -<span class="lineNum"> 679 </span> : -<span class="lineNum"> 680 </span><span class="lineCov"> 3 : __normal_iterator() : _M_current(_Iterator()) { }</span> -<span class="lineNum"> 681 </span> : -<span class="lineNum"> 682 </span> : explicit -<span class="lineNum"> 683 </span><span class="lineCov"> 150393 : __normal_iterator(const _Iterator& __i) : _M_current(__i) { }</span> -<span class="lineNum"> 684 </span> : -<span class="lineNum"> 685 </span> : // Allow iterator to const_iterator conversion -<span class="lineNum"> 686 </span> : template<typename _Iter> -<span class="lineNum"> 687 </span> : __normal_iterator(const __normal_iterator<_Iter, -<span class="lineNum"> 688 </span> : typename __enable_if< -<span class="lineNum"> 689 </span> : (std::__are_same<_Iter, typename _Container::pointer>::__value), -<span class="lineNum"> 690 </span><span class="lineCov"> 28 : _Container>::__type>& __i)</span> -<span class="lineNum"> 691 </span><span class="lineCov"> 28 : : _M_current(__i.base()) { }</span> -<span class="lineNum"> 692 </span> : -<span class="lineNum"> 693 </span> : // Forward iterator requirements -<span class="lineNum"> 694 </span> : reference -<span class="lineNum"> 695 </span><span class="lineCov"> 925025 : operator*() const</span> -<span class="lineNum"> 696 </span><span class="lineCov"> 925025 : { return *_M_current; }</span> -<span class="lineNum"> 697 </span> : -<span class="lineNum"> 698 </span> : pointer -<span class="lineNum"> 699 </span><span class="lineCov"> 3 : operator->() const</span> -<span class="lineNum"> 700 </span><span class="lineCov"> 3 : { return _M_current; }</span> -<span class="lineNum"> 701 </span> : -<span class="lineNum"> 702 </span> : __normal_iterator& -<span class="lineNum"> 703 </span><span class="lineCov"> 81617 : operator++()</span> -<span class="lineNum"> 704 </span> : { -<span class="lineNum"> 705 </span><span class="lineCov"> 81617 : ++_M_current;</span> -<span class="lineNum"> 706 </span><span class="lineCov"> 81617 : return *this;</span> -<span class="lineNum"> 707 </span> : } -<span class="lineNum"> 708 </span> : -<span class="lineNum"> 709 </span> : __normal_iterator -<span class="lineNum"> 710 </span><span class="lineCov"> 54836 : operator++(int)</span> -<span class="lineNum"> 711 </span><span class="lineCov"> 54836 : { return __normal_iterator(_M_current++); }</span> -<span class="lineNum"> 712 </span> : -<span class="lineNum"> 713 </span> : // Bidirectional iterator requirements -<span class="lineNum"> 714 </span> : __normal_iterator& -<span class="lineNum"> 715 </span><span class="lineCov"> 249605 : operator--()</span> -<span class="lineNum"> 716 </span> : { -<span class="lineNum"> 717 </span><span class="lineCov"> 249605 : --_M_current;</span> -<span class="lineNum"> 718 </span><span class="lineCov"> 249605 : return *this;</span> -<span class="lineNum"> 719 </span> : } -<span class="lineNum"> 720 </span> : -<span class="lineNum"> 721 </span> : __normal_iterator -<span class="lineNum"> 722 </span><span class="lineNoCov"> 0 : operator--(int)</span> -<span class="lineNum"> 723 </span><span class="lineNoCov"> 0 : { return __normal_iterator(_M_current--); }</span> -<span class="lineNum"> 724 </span> : -<span class="lineNum"> 725 </span> : // Random access iterator requirements -<span class="lineNum"> 726 </span> : reference -<span class="lineNum"> 727 </span> : operator[](const difference_type& __n) const -<span class="lineNum"> 728 </span> : { return _M_current[__n]; } -<span class="lineNum"> 729 </span> : -<span class="lineNum"> 730 </span> : __normal_iterator& -<span class="lineNum"> 731 </span> : operator+=(const difference_type& __n) -<span class="lineNum"> 732 </span> : { _M_current += __n; return *this; } -<span class="lineNum"> 733 </span> : -<span class="lineNum"> 734 </span> : __normal_iterator -<span class="lineNum"> 735 </span><span class="lineCov"> 13455 : operator+(const difference_type& __n) const</span> -<span class="lineNum"> 736 </span><span class="lineCov"> 13455 : { return __normal_iterator(_M_current + __n); }</span> -<span class="lineNum"> 737 </span> : -<span class="lineNum"> 738 </span> : __normal_iterator& -<span class="lineNum"> 739 </span> : operator-=(const difference_type& __n) -<span class="lineNum"> 740 </span> : { _M_current -= __n; return *this; } -<span class="lineNum"> 741 </span> : -<span class="lineNum"> 742 </span> : __normal_iterator -<span class="lineNum"> 743 </span><span class="lineCov"> 846 : operator-(const difference_type& __n) const</span> -<span class="lineNum"> 744 </span><span class="lineCov"> 846 : { return __normal_iterator(_M_current - __n); }</span> -<span class="lineNum"> 745 </span> : -<span class="lineNum"> 746 </span> : const _Iterator& -<span class="lineNum"> 747 </span><span class="lineCov"> 455202 : base() const</span> -<span class="lineNum"> 748 </span><span class="lineCov"> 455202 : { return _M_current; }</span> -<span class="lineNum"> 749 </span> : }; -<span class="lineNum"> 750 </span> : -<span class="lineNum"> 751 </span> : // Note: In what follows, the left- and right-hand-side iterators are -<span class="lineNum"> 752 </span> : // allowed to vary in types (conceptually in cv-qualification) so that -<span class="lineNum"> 753 </span> : // comparison between cv-qualified and non-cv-qualified iterators be -<span class="lineNum"> 754 </span> : // valid. However, the greedy and unfriendly operators in std::rel_ops -<span class="lineNum"> 755 </span> : // will make overload resolution ambiguous (when in scope) if we don't -<span class="lineNum"> 756 </span> : // provide overloads whose operands are of the same type. Can someone -<span class="lineNum"> 757 </span> : // remind me what generic programming is about? -- Gaby -<span class="lineNum"> 758 </span> : -<span class="lineNum"> 759 </span> : // Forward iterator requirements -<span class="lineNum"> 760 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 761 </span> : inline bool -<span class="lineNum"> 762 </span> : operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 763 </span> : const __normal_iterator<_IteratorR, _Container>& __rhs) -<span class="lineNum"> 764 </span> : { return __lhs.base() == __rhs.base(); } -<span class="lineNum"> 765 </span> : -<span class="lineNum"> 766 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 767 </span> : inline bool -<span class="lineNum"> 768 </span> : operator==(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 769 </span><span class="lineCov"> 4368 : const __normal_iterator<_Iterator, _Container>& __rhs)</span> -<span class="lineNum"> 770 </span><span class="lineCov"> 4368 : { return __lhs.base() == __rhs.base(); }</span> -<span class="lineNum"> 771 </span> : -<span class="lineNum"> 772 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 773 </span> : inline bool -<span class="lineNum"> 774 </span> : operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 775 </span><span class="lineCov"> 38 : const __normal_iterator<_IteratorR, _Container>& __rhs)</span> -<span class="lineNum"> 776 </span><span class="lineCov"> 38 : { return __lhs.base() != __rhs.base(); }</span> -<span class="lineNum"> 777 </span> : -<span class="lineNum"> 778 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 779 </span> : inline bool -<span class="lineNum"> 780 </span> : operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 781 </span><span class="lineCov"> 123290 : const __normal_iterator<_Iterator, _Container>& __rhs)</span> -<span class="lineNum"> 782 </span><span class="lineCov"> 123290 : { return __lhs.base() != __rhs.base(); }</span> -<span class="lineNum"> 783 </span> : -<span class="lineNum"> 784 </span> : // Random access iterator requirements -<span class="lineNum"> 785 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 786 </span> : inline bool -<span class="lineNum"> 787 </span> : operator<(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 788 </span> : const __normal_iterator<_IteratorR, _Container>& __rhs) -<span class="lineNum"> 789 </span> : { return __lhs.base() < __rhs.base(); } -<span class="lineNum"> 790 </span> : -<span class="lineNum"> 791 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 792 </span> : inline bool -<span class="lineNum"> 793 </span> : operator<(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 794 </span><span class="lineCov"> 7923 : const __normal_iterator<_Iterator, _Container>& __rhs)</span> -<span class="lineNum"> 795 </span><span class="lineCov"> 7923 : { return __lhs.base() < __rhs.base(); }</span> -<span class="lineNum"> 796 </span> : -<span class="lineNum"> 797 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 798 </span> : inline bool -<span class="lineNum"> 799 </span> : operator>(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 800 </span> : const __normal_iterator<_IteratorR, _Container>& __rhs) -<span class="lineNum"> 801 </span> : { return __lhs.base() > __rhs.base(); } -<span class="lineNum"> 802 </span> : -<span class="lineNum"> 803 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 804 </span> : inline bool -<span class="lineNum"> 805 </span> : operator>(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 806 </span> : const __normal_iterator<_Iterator, _Container>& __rhs) -<span class="lineNum"> 807 </span> : { return __lhs.base() > __rhs.base(); } -<span class="lineNum"> 808 </span> : -<span class="lineNum"> 809 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 810 </span> : inline bool -<span class="lineNum"> 811 </span> : operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 812 </span> : const __normal_iterator<_IteratorR, _Container>& __rhs) -<span class="lineNum"> 813 </span> : { return __lhs.base() <= __rhs.base(); } -<span class="lineNum"> 814 </span> : -<span class="lineNum"> 815 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 816 </span> : inline bool -<span class="lineNum"> 817 </span> : operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 818 </span> : const __normal_iterator<_Iterator, _Container>& __rhs) -<span class="lineNum"> 819 </span> : { return __lhs.base() <= __rhs.base(); } -<span class="lineNum"> 820 </span> : -<span class="lineNum"> 821 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 822 </span> : inline bool -<span class="lineNum"> 823 </span> : operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 824 </span> : const __normal_iterator<_IteratorR, _Container>& __rhs) -<span class="lineNum"> 825 </span> : { return __lhs.base() >= __rhs.base(); } -<span class="lineNum"> 826 </span> : -<span class="lineNum"> 827 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 828 </span> : inline bool -<span class="lineNum"> 829 </span> : operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 830 </span> : const __normal_iterator<_Iterator, _Container>& __rhs) -<span class="lineNum"> 831 </span> : { return __lhs.base() >= __rhs.base(); } -<span class="lineNum"> 832 </span> : -<span class="lineNum"> 833 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 834 </span> : // According to the resolution of DR179 not only the various comparison -<span class="lineNum"> 835 </span> : // operators but also operator- must accept mixed iterator/const_iterator -<span class="lineNum"> 836 </span> : // parameters. -<span class="lineNum"> 837 </span> : template<typename _IteratorL, typename _IteratorR, typename _Container> -<span class="lineNum"> 838 </span> : inline typename __normal_iterator<_IteratorL, _Container>::difference_type -<span class="lineNum"> 839 </span> : operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, -<span class="lineNum"> 840 </span> : const __normal_iterator<_IteratorR, _Container>& __rhs) -<span class="lineNum"> 841 </span> : { return __lhs.base() - __rhs.base(); } -<span class="lineNum"> 842 </span> : -<span class="lineNum"> 843 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 844 </span> : inline typename __normal_iterator<_Iterator, _Container>::difference_type -<span class="lineNum"> 845 </span> : operator-(const __normal_iterator<_Iterator, _Container>& __lhs, -<span class="lineNum"> 846 </span><span class="lineCov"> 37193 : const __normal_iterator<_Iterator, _Container>& __rhs)</span> -<span class="lineNum"> 847 </span><span class="lineCov"> 37193 : { return __lhs.base() - __rhs.base(); }</span> -<span class="lineNum"> 848 </span> : -<span class="lineNum"> 849 </span> : template<typename _Iterator, typename _Container> -<span class="lineNum"> 850 </span> : inline __normal_iterator<_Iterator, _Container> -<span class="lineNum"> 851 </span> : operator+(typename __normal_iterator<_Iterator, _Container>::difference_type -<span class="lineNum"> 852 </span> : __n, const __normal_iterator<_Iterator, _Container>& __i) -<span class="lineNum"> 853 </span> : { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } -<span class="lineNum"> 854 </span> : -<span class="lineNum"> 855 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 856 </span> : -<span class="lineNum"> 857 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 858 </span> : -<span class="lineNum"> 859 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 860 </span> : -<span class="lineNum"> 861 </span> : // 24.4.3 Move iterators -<span class="lineNum"> 862 </span> : /** -<span class="lineNum"> 863 </span> : * Class template move_iterator is an iterator adapter with the same -<span class="lineNum"> 864 </span> : * behavior as the underlying iterator except that its dereference -<span class="lineNum"> 865 </span> : * operator implicitly converts the value returned by the underlying -<span class="lineNum"> 866 </span> : * iterator's dereference operator to an rvalue reference. Some -<span class="lineNum"> 867 </span> : * generic algorithms can be called with move iterators to replace -<span class="lineNum"> 868 </span> : * copying with moving. -<span class="lineNum"> 869 </span> : */ -<span class="lineNum"> 870 </span> : template<typename _Iterator> -<span class="lineNum"> 871 </span> : class move_iterator -<span class="lineNum"> 872 </span> : { -<span class="lineNum"> 873 </span> : protected: -<span class="lineNum"> 874 </span> : _Iterator _M_current; -<span class="lineNum"> 875 </span> : -<span class="lineNum"> 876 </span> : public: -<span class="lineNum"> 877 </span> : typedef _Iterator iterator_type; -<span class="lineNum"> 878 </span> : typedef typename iterator_traits<_Iterator>::difference_type -<span class="lineNum"> 879 </span> : difference_type; -<span class="lineNum"> 880 </span> : // NB: DR 680. -<span class="lineNum"> 881 </span> : typedef _Iterator pointer; -<span class="lineNum"> 882 </span> : typedef typename iterator_traits<_Iterator>::value_type value_type; -<span class="lineNum"> 883 </span> : typedef typename iterator_traits<_Iterator>::iterator_category -<span class="lineNum"> 884 </span> : iterator_category; -<span class="lineNum"> 885 </span> : typedef value_type&& reference; -<span class="lineNum"> 886 </span> : -<span class="lineNum"> 887 </span> : public: -<span class="lineNum"> 888 </span> : move_iterator() -<span class="lineNum"> 889 </span> : : _M_current() { } -<span class="lineNum"> 890 </span> : -<span class="lineNum"> 891 </span> : explicit -<span class="lineNum"> 892 </span> : move_iterator(iterator_type __i) -<span class="lineNum"> 893 </span> : : _M_current(__i) { } -<span class="lineNum"> 894 </span> : -<span class="lineNum"> 895 </span> : template<typename _Iter> -<span class="lineNum"> 896 </span> : move_iterator(const move_iterator<_Iter>& __i) -<span class="lineNum"> 897 </span> : : _M_current(__i.base()) { } -<span class="lineNum"> 898 </span> : -<span class="lineNum"> 899 </span> : iterator_type -<span class="lineNum"> 900 </span> : base() const -<span class="lineNum"> 901 </span> : { return _M_current; } -<span class="lineNum"> 902 </span> : -<span class="lineNum"> 903 </span> : reference -<span class="lineNum"> 904 </span> : operator*() const -<span class="lineNum"> 905 </span> : { return *_M_current; } -<span class="lineNum"> 906 </span> : -<span class="lineNum"> 907 </span> : pointer -<span class="lineNum"> 908 </span> : operator->() const -<span class="lineNum"> 909 </span> : { return _M_current; } -<span class="lineNum"> 910 </span> : -<span class="lineNum"> 911 </span> : move_iterator& -<span class="lineNum"> 912 </span> : operator++() -<span class="lineNum"> 913 </span> : { -<span class="lineNum"> 914 </span> : ++_M_current; -<span class="lineNum"> 915 </span> : return *this; -<span class="lineNum"> 916 </span> : } -<span class="lineNum"> 917 </span> : -<span class="lineNum"> 918 </span> : move_iterator -<span class="lineNum"> 919 </span> : operator++(int) -<span class="lineNum"> 920 </span> : { -<span class="lineNum"> 921 </span> : move_iterator __tmp = *this; -<span class="lineNum"> 922 </span> : ++_M_current; -<span class="lineNum"> 923 </span> : return __tmp; -<span class="lineNum"> 924 </span> : } -<span class="lineNum"> 925 </span> : -<span class="lineNum"> 926 </span> : move_iterator& -<span class="lineNum"> 927 </span> : operator--() -<span class="lineNum"> 928 </span> : { -<span class="lineNum"> 929 </span> : --_M_current; -<span class="lineNum"> 930 </span> : return *this; -<span class="lineNum"> 931 </span> : } -<span class="lineNum"> 932 </span> : -<span class="lineNum"> 933 </span> : move_iterator -<span class="lineNum"> 934 </span> : operator--(int) -<span class="lineNum"> 935 </span> : { -<span class="lineNum"> 936 </span> : move_iterator __tmp = *this; -<span class="lineNum"> 937 </span> : --_M_current; -<span class="lineNum"> 938 </span> : return __tmp; -<span class="lineNum"> 939 </span> : } -<span class="lineNum"> 940 </span> : -<span class="lineNum"> 941 </span> : move_iterator -<span class="lineNum"> 942 </span> : operator+(difference_type __n) const -<span class="lineNum"> 943 </span> : { return move_iterator(_M_current + __n); } -<span class="lineNum"> 944 </span> : -<span class="lineNum"> 945 </span> : move_iterator& -<span class="lineNum"> 946 </span> : operator+=(difference_type __n) -<span class="lineNum"> 947 </span> : { -<span class="lineNum"> 948 </span> : _M_current += __n; -<span class="lineNum"> 949 </span> : return *this; -<span class="lineNum"> 950 </span> : } -<span class="lineNum"> 951 </span> : -<span class="lineNum"> 952 </span> : move_iterator -<span class="lineNum"> 953 </span> : operator-(difference_type __n) const -<span class="lineNum"> 954 </span> : { return move_iterator(_M_current - __n); } -<span class="lineNum"> 955 </span> : -<span class="lineNum"> 956 </span> : move_iterator& -<span class="lineNum"> 957 </span> : operator-=(difference_type __n) -<span class="lineNum"> 958 </span> : { -<span class="lineNum"> 959 </span> : _M_current -= __n; -<span class="lineNum"> 960 </span> : return *this; -<span class="lineNum"> 961 </span> : } -<span class="lineNum"> 962 </span> : -<span class="lineNum"> 963 </span> : reference -<span class="lineNum"> 964 </span> : operator[](difference_type __n) const -<span class="lineNum"> 965 </span> : { return _M_current[__n]; } -<span class="lineNum"> 966 </span> : }; -<span class="lineNum"> 967 </span> : -<span class="lineNum"> 968 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 969 </span> : inline bool -<span class="lineNum"> 970 </span> : operator==(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 971 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 972 </span> : { return __x.base() == __y.base(); } -<span class="lineNum"> 973 </span> : -<span class="lineNum"> 974 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 975 </span> : inline bool -<span class="lineNum"> 976 </span> : operator!=(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 977 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 978 </span> : { return !(__x == __y); } -<span class="lineNum"> 979 </span> : -<span class="lineNum"> 980 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 981 </span> : inline bool -<span class="lineNum"> 982 </span> : operator<(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 983 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 984 </span> : { return __x.base() < __y.base(); } -<span class="lineNum"> 985 </span> : -<span class="lineNum"> 986 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 987 </span> : inline bool -<span class="lineNum"> 988 </span> : operator<=(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 989 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 990 </span> : { return !(__y < __x); } -<span class="lineNum"> 991 </span> : -<span class="lineNum"> 992 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 993 </span> : inline bool -<span class="lineNum"> 994 </span> : operator>(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 995 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 996 </span> : { return __y < __x; } -<span class="lineNum"> 997 </span> : -<span class="lineNum"> 998 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 999 </span> : inline bool -<span class="lineNum"> 1000 </span> : operator>=(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 1001 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 1002 </span> : { return !(__x < __y); } -<span class="lineNum"> 1003 </span> : -<span class="lineNum"> 1004 </span> : template<typename _IteratorL, typename _IteratorR> -<span class="lineNum"> 1005 </span> : inline typename move_iterator<_IteratorL>::difference_type -<span class="lineNum"> 1006 </span> : operator-(const move_iterator<_IteratorL>& __x, -<span class="lineNum"> 1007 </span> : const move_iterator<_IteratorR>& __y) -<span class="lineNum"> 1008 </span> : { return __x.base() - __y.base(); } -<span class="lineNum"> 1009 </span> : -<span class="lineNum"> 1010 </span> : template<typename _Iterator> -<span class="lineNum"> 1011 </span> : inline move_iterator<_Iterator> -<span class="lineNum"> 1012 </span> : operator+(typename move_iterator<_Iterator>::difference_type __n, -<span class="lineNum"> 1013 </span> : const move_iterator<_Iterator>& __x) -<span class="lineNum"> 1014 </span> : { return __x + __n; } -<span class="lineNum"> 1015 </span> : -<span class="lineNum"> 1016 </span> : template<typename _Iterator> -<span class="lineNum"> 1017 </span> : inline move_iterator<_Iterator> -<span class="lineNum"> 1018 </span> : make_move_iterator(const _Iterator& __i) -<span class="lineNum"> 1019 </span> : { return move_iterator<_Iterator>(__i); } -<span class="lineNum"> 1020 </span> : -<span class="lineNum"> 1021 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 1022 </span> : -<span class="lineNum"> 1023 </span> : #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) std::make_move_iterator(_Iter) -<span class="lineNum"> 1024 </span> : #else -<span class="lineNum"> 1025 </span> : #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter) -<span class="lineNum"> 1026 </span> : #endif // __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1027 </span> : -<span class="lineNum"> 1028 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h.gcov.html deleted file mode 100644 index 8486f49..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_iterator_base_funcs.h.gcov.html +++ /dev/null @@ -1,249 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_iterator_base_funcs.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_iterator_base_funcs.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">28</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">82.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">23</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Functions used by iterators -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1998 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_iterator_base_funcs.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * This file contains all of the general iterator-related utility -<span class="lineNum"> 62 </span> : * functions, such as distance() and advance(). -<span class="lineNum"> 63 </span> : */ -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #ifndef _STL_ITERATOR_BASE_FUNCS_H -<span class="lineNum"> 66 </span> : #define _STL_ITERATOR_BASE_FUNCS_H 1 -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : #pragma GCC system_header -<span class="lineNum"> 69 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : template<typename _InputIterator> -<span class="lineNum"> 74 </span> : inline typename iterator_traits<_InputIterator>::difference_type -<span class="lineNum"> 75 </span> : __distance(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 76 </span><span class="lineCov"> 13 : input_iterator_tag)</span> -<span class="lineNum"> 77 </span> : { -<span class="lineNum"> 78 </span> : // concept requirements -<span class="lineNum"> 79 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span><span class="lineCov"> 13 : typename iterator_traits<_InputIterator>::difference_type __n = 0;</span> -<span class="lineNum"> 82 </span><span class="lineCov"> 37 : while (__first != __last)</span> -<span class="lineNum"> 83 </span> : { -<span class="lineNum"> 84 </span><span class="lineCov"> 11 : ++__first;</span> -<span class="lineNum"> 85 </span><span class="lineCov"> 11 : ++__n;</span> -<span class="lineNum"> 86 </span> : } -<span class="lineNum"> 87 </span><span class="lineCov"> 13 : return __n;</span> -<span class="lineNum"> 88 </span> : } -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 91 </span> : inline typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 92 </span> : __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 93 </span><span class="lineCov"> 1287 : random_access_iterator_tag)</span> -<span class="lineNum"> 94 </span> : { -<span class="lineNum"> 95 </span> : // concept requirements -<span class="lineNum"> 96 </span> : __glibcxx_function_requires(_RandomAccessIteratorConcept< -<span class="lineNum"> 97 </span> : _RandomAccessIterator>) -<span class="lineNum"> 98 </span><span class="lineCov"> 1287 : return __last - __first;</span> -<span class="lineNum"> 99 </span> : } -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : /** -<span class="lineNum"> 102 </span> : * @brief A generalization of pointer arithmetic. -<span class="lineNum"> 103 </span> : * @param first An input iterator. -<span class="lineNum"> 104 </span> : * @param last An input iterator. -<span class="lineNum"> 105 </span> : * @return The distance between them. -<span class="lineNum"> 106 </span> : * -<span class="lineNum"> 107 </span> : * Returns @c n such that first + n == last. This requires that @p last -<span class="lineNum"> 108 </span> : * must be reachable from @p first. Note that @c n may be negative. -<span class="lineNum"> 109 </span> : * -<span class="lineNum"> 110 </span> : * For random access iterators, this uses their @c + and @c - operations -<span class="lineNum"> 111 </span> : * and are constant time. For other %iterator classes they are linear time. -<span class="lineNum"> 112 </span> : */ -<span class="lineNum"> 113 </span> : template<typename _InputIterator> -<span class="lineNum"> 114 </span> : inline typename iterator_traits<_InputIterator>::difference_type -<span class="lineNum"> 115 </span><span class="lineCov"> 1300 : distance(_InputIterator __first, _InputIterator __last)</span> -<span class="lineNum"> 116 </span> : { -<span class="lineNum"> 117 </span> : // concept requirements -- taken care of in __distance -<span class="lineNum"> 118 </span> : return std::__distance(__first, __last, -<span class="lineNum"> 119 </span><span class="lineCov"> 1300 : std::__iterator_category(__first));</span> -<span class="lineNum"> 120 </span> : } -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : template<typename _InputIterator, typename _Distance> -<span class="lineNum"> 123 </span> : inline void -<span class="lineNum"> 124 </span><span class="lineCov"> 10 : __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)</span> -<span class="lineNum"> 125 </span> : { -<span class="lineNum"> 126 </span> : // concept requirements -<span class="lineNum"> 127 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 128 </span><span class="lineCov"> 41 : while (__n--)</span> -<span class="lineNum"> 129 </span><span class="lineCov"> 21 : ++__i;</span> -<span class="lineNum"> 130 </span><span class="lineCov"> 10 : }</span> -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : template<typename _BidirectionalIterator, typename _Distance> -<span class="lineNum"> 133 </span> : inline void -<span class="lineNum"> 134 </span> : __advance(_BidirectionalIterator& __i, _Distance __n, -<span class="lineNum"> 135 </span><span class="lineCov"> 55 : bidirectional_iterator_tag)</span> -<span class="lineNum"> 136 </span> : { -<span class="lineNum"> 137 </span> : // concept requirements -<span class="lineNum"> 138 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 139 </span> : _BidirectionalIterator>) -<span class="lineNum"> 140 </span><span class="lineCov"> 55 : if (__n > 0)</span> -<span class="lineNum"> 141 </span><span class="lineCov"> 165 : while (__n--)</span> -<span class="lineNum"> 142 </span><span class="lineCov"> 55 : ++__i;</span> -<span class="lineNum"> 143 </span> : else -<span class="lineNum"> 144 </span><span class="lineNoCov"> 0 : while (__n++)</span> -<span class="lineNum"> 145 </span><span class="lineNoCov"> 0 : --__i;</span> -<span class="lineNum"> 146 </span><span class="lineCov"> 55 : }</span> -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : template<typename _RandomAccessIterator, typename _Distance> -<span class="lineNum"> 149 </span> : inline void -<span class="lineNum"> 150 </span> : __advance(_RandomAccessIterator& __i, _Distance __n, -<span class="lineNum"> 151 </span><span class="lineNoCov"> 0 : random_access_iterator_tag)</span> -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : // concept requirements -<span class="lineNum"> 154 </span> : __glibcxx_function_requires(_RandomAccessIteratorConcept< -<span class="lineNum"> 155 </span> : _RandomAccessIterator>) -<span class="lineNum"> 156 </span><span class="lineNoCov"> 0 : __i += __n;</span> -<span class="lineNum"> 157 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : /** -<span class="lineNum"> 160 </span> : * @brief A generalization of pointer arithmetic. -<span class="lineNum"> 161 </span> : * @param i An input iterator. -<span class="lineNum"> 162 </span> : * @param n The "delta" by which to change @p i. -<span class="lineNum"> 163 </span> : * @return Nothing. -<span class="lineNum"> 164 </span> : * -<span class="lineNum"> 165 </span> : * This increments @p i by @p n. For bidirectional and random access -<span class="lineNum"> 166 </span> : * iterators, @p n may be negative, in which case @p i is decremented. -<span class="lineNum"> 167 </span> : * -<span class="lineNum"> 168 </span> : * For random access iterators, this uses their @c + and @c - operations -<span class="lineNum"> 169 </span> : * and are constant time. For other %iterator classes they are linear time. -<span class="lineNum"> 170 </span> : */ -<span class="lineNum"> 171 </span> : template<typename _InputIterator, typename _Distance> -<span class="lineNum"> 172 </span> : inline void -<span class="lineNum"> 173 </span><span class="lineCov"> 65 : advance(_InputIterator& __i, _Distance __n)</span> -<span class="lineNum"> 174 </span> : { -<span class="lineNum"> 175 </span> : // concept requirements -- taken care of in __advance -<span class="lineNum"> 176 </span><span class="lineCov"> 65 : typename iterator_traits<_InputIterator>::difference_type __d = __n;</span> -<span class="lineNum"> 177 </span><span class="lineCov"> 65 : std::__advance(__i, __d, std::__iterator_category(__i));</span> -<span class="lineNum"> 178 </span><span class="lineCov"> 65 : }</span> -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : #endif /* _STL_ITERATOR_BASE_FUNCS_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_iterator_base_types.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_iterator_base_types.h.gcov.html deleted file mode 100644 index fc03082..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_iterator_base_types.h.gcov.html +++ /dev/null @@ -1,239 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_iterator_base_types.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_iterator_base_types.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Types used in iterator implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996-1998 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_iterator_base_types.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * This file contains all of the general iterator-related utility types, -<span class="lineNum"> 62 </span> : * such as iterator_traits and struct iterator. -<span class="lineNum"> 63 </span> : */ -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #ifndef _STL_ITERATOR_BASE_TYPES_H -<span class="lineNum"> 66 </span> : #define _STL_ITERATOR_BASE_TYPES_H 1 -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : #pragma GCC system_header -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : #include <bits/c++config.h> -<span class="lineNum"> 71 </span> : #include <cstddef> -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : //@{ -<span class="lineNum"> 76 </span> : /** -<span class="lineNum"> 77 </span> : * @defgroup iterator_tags Iterator Tags -<span class="lineNum"> 78 </span> : * These are empty types, used to distinguish different iterators. The -<span class="lineNum"> 79 </span> : * distinction is not made by what they contain, but simply by what they -<span class="lineNum"> 80 </span> : * are. Different underlying algorithms can then be used based on the -<span class="lineNum"> 81 </span> : * different operations supported by different iterator types. -<span class="lineNum"> 82 </span> : */ -<span class="lineNum"> 83 </span> : /// Marking input iterators. -<span class="lineNum"> 84 </span> : struct input_iterator_tag {}; -<span class="lineNum"> 85 </span> : /// Marking output iterators. -<span class="lineNum"> 86 </span> : struct output_iterator_tag {}; -<span class="lineNum"> 87 </span> : /// Forward iterators support a superset of input iterator operations. -<span class="lineNum"> 88 </span> : struct forward_iterator_tag : public input_iterator_tag {}; -<span class="lineNum"> 89 </span> : /// Bidirectional iterators support a superset of forward iterator -<span class="lineNum"> 90 </span> : /// operations. -<span class="lineNum"> 91 </span> : struct bidirectional_iterator_tag : public forward_iterator_tag {}; -<span class="lineNum"> 92 </span> : /// Random-access iterators support a superset of bidirectional iterator -<span class="lineNum"> 93 </span> : /// operations. -<span class="lineNum"> 94 </span> : struct random_access_iterator_tag : public bidirectional_iterator_tag {}; -<span class="lineNum"> 95 </span> : //@} -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : /** -<span class="lineNum"> 99 </span> : * @brief Common %iterator class. -<span class="lineNum"> 100 </span> : * -<span class="lineNum"> 101 </span> : * This class does nothing but define nested typedefs. %Iterator classes -<span class="lineNum"> 102 </span> : * can inherit from this class to save some work. The typedefs are then -<span class="lineNum"> 103 </span> : * used in specializations and overloading. -<span class="lineNum"> 104 </span> : * -<span class="lineNum"> 105 </span> : * In particular, there are no default implementations of requirements -<span class="lineNum"> 106 </span> : * such as @c operator++ and the like. (How could there be?) -<span class="lineNum"> 107 </span> : */ -<span class="lineNum"> 108 </span> : template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t, -<span class="lineNum"> 109 </span> : typename _Pointer = _Tp*, typename _Reference = _Tp&> -<span class="lineNum"> 110 </span> : struct iterator -<span class="lineNum"> 111 </span><span class="lineCov"> 304336 : {</span> -<span class="lineNum"> 112 </span> : /// One of the @link iterator_tags tag types@endlink. -<span class="lineNum"> 113 </span> : typedef _Category iterator_category; -<span class="lineNum"> 114 </span> : /// The type "pointed to" by the iterator. -<span class="lineNum"> 115 </span> : typedef _Tp value_type; -<span class="lineNum"> 116 </span> : /// Distance between iterators is represented as this type. -<span class="lineNum"> 117 </span> : typedef _Distance difference_type; -<span class="lineNum"> 118 </span> : /// This type represents a pointer-to-value_type. -<span class="lineNum"> 119 </span> : typedef _Pointer pointer; -<span class="lineNum"> 120 </span> : /// This type represents a reference-to-value_type. -<span class="lineNum"> 121 </span> : typedef _Reference reference; -<span class="lineNum"> 122 </span> : }; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : /** -<span class="lineNum"> 125 </span> : * This class does nothing but define nested typedefs. The general -<span class="lineNum"> 126 </span> : * version simply "forwards" the nested typedefs from the Iterator -<span class="lineNum"> 127 </span> : * argument. Specialized versions for pointers and pointers-to-const -<span class="lineNum"> 128 </span> : * provide tighter, more correct semantics. -<span class="lineNum"> 129 </span> : */ -<span class="lineNum"> 130 </span> : template<typename _Iterator> -<span class="lineNum"> 131 </span> : struct iterator_traits -<span class="lineNum"> 132 </span> : { -<span class="lineNum"> 133 </span> : typedef typename _Iterator::iterator_category iterator_category; -<span class="lineNum"> 134 </span> : typedef typename _Iterator::value_type value_type; -<span class="lineNum"> 135 </span> : typedef typename _Iterator::difference_type difference_type; -<span class="lineNum"> 136 </span> : typedef typename _Iterator::pointer pointer; -<span class="lineNum"> 137 </span> : typedef typename _Iterator::reference reference; -<span class="lineNum"> 138 </span> : }; -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : template<typename _Tp> -<span class="lineNum"> 141 </span> : struct iterator_traits<_Tp*> -<span class="lineNum"> 142 </span> : { -<span class="lineNum"> 143 </span> : typedef random_access_iterator_tag iterator_category; -<span class="lineNum"> 144 </span> : typedef _Tp value_type; -<span class="lineNum"> 145 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 146 </span> : typedef _Tp* pointer; -<span class="lineNum"> 147 </span> : typedef _Tp& reference; -<span class="lineNum"> 148 </span> : }; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : template<typename _Tp> -<span class="lineNum"> 151 </span> : struct iterator_traits<const _Tp*> -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : typedef random_access_iterator_tag iterator_category; -<span class="lineNum"> 154 </span> : typedef _Tp value_type; -<span class="lineNum"> 155 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 156 </span> : typedef const _Tp* pointer; -<span class="lineNum"> 157 </span> : typedef const _Tp& reference; -<span class="lineNum"> 158 </span> : }; -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : /** -<span class="lineNum"> 161 </span> : * This function is not a part of the C++ standard but is syntactic -<span class="lineNum"> 162 </span> : * sugar for internal library use only. -<span class="lineNum"> 163 </span> : */ -<span class="lineNum"> 164 </span> : template<typename _Iter> -<span class="lineNum"> 165 </span> : inline typename iterator_traits<_Iter>::iterator_category -<span class="lineNum"> 166 </span><span class="lineCov"> 4730 : __iterator_category(const _Iter&)</span> -<span class="lineNum"> 167 </span><span class="lineCov"> 4730 : { return typename iterator_traits<_Iter>::iterator_category(); }</span> -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : #endif /* _STL_ITERATOR_BASE_TYPES_H */ -<span class="lineNum"> 172 </span> : -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_list.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_list.h.gcov.html deleted file mode 100644 index 9abdf8e..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_list.h.gcov.html +++ /dev/null @@ -1,1530 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_list.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_list.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">94</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">93.6 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">88</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // List implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_list.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_LIST_H -<span class="lineNum"> 63 </span> : #define _STL_LIST_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : // Supporting structures are split into common and templated types; the -<span class="lineNum"> 70 </span> : // latter publicly inherits from the former in an effort to reduce code -<span class="lineNum"> 71 </span> : // duplication. This results in some "needless" static_cast'ing later on, -<span class="lineNum"> 72 </span> : // but it's all safe downcasting. -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : /// Common part of a node in the %list. -<span class="lineNum"> 75 </span> : struct _List_node_base -<span class="lineNum"> 76 </span> : { -<span class="lineNum"> 77 </span> : _List_node_base* _M_next; -<span class="lineNum"> 78 </span> : _List_node_base* _M_prev; -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : static void -<span class="lineNum"> 81 </span> : swap(_List_node_base& __x, _List_node_base& __y); -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : void -<span class="lineNum"> 84 </span> : transfer(_List_node_base * const __first, -<span class="lineNum"> 85 </span> : _List_node_base * const __last); -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : void -<span class="lineNum"> 88 </span> : reverse(); -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : void -<span class="lineNum"> 91 </span> : hook(_List_node_base * const __position); -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : void -<span class="lineNum"> 94 </span> : unhook(); -<span class="lineNum"> 95 </span> : }; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : /// An actual node in the %list. -<span class="lineNum"> 98 </span> : template<typename _Tp> -<span class="lineNum"> 99 </span> : struct _List_node : public _List_node_base -<span class="lineNum"> 100 </span> : { -<span class="lineNum"> 101 </span> : ///< User's data. -<span class="lineNum"> 102 </span> : _Tp _M_data; -<span class="lineNum"> 103 </span> : }; -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : /** -<span class="lineNum"> 106 </span> : * @brief A list::iterator. -<span class="lineNum"> 107 </span> : * -<span class="lineNum"> 108 </span> : * All the functions are op overloads. -<span class="lineNum"> 109 </span> : */ -<span class="lineNum"> 110 </span> : template<typename _Tp> -<span class="lineNum"> 111 </span> : struct _List_iterator -<span class="lineNum"> 112 </span> : { -<span class="lineNum"> 113 </span> : typedef _List_iterator<_Tp> _Self; -<span class="lineNum"> 114 </span> : typedef _List_node<_Tp> _Node; -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 117 </span> : typedef std::bidirectional_iterator_tag iterator_category; -<span class="lineNum"> 118 </span> : typedef _Tp value_type; -<span class="lineNum"> 119 </span> : typedef _Tp* pointer; -<span class="lineNum"> 120 </span> : typedef _Tp& reference; -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : _List_iterator() -<span class="lineNum"> 123 </span> : : _M_node() { } -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : explicit -<span class="lineNum"> 126 </span><span class="lineCov"> 206 : _List_iterator(_List_node_base* __x)</span> -<span class="lineNum"> 127 </span><span class="lineCov"> 206 : : _M_node(__x) { }</span> -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : // Must downcast from List_node_base to _List_node to get to _M_data. -<span class="lineNum"> 130 </span> : reference -<span class="lineNum"> 131 </span><span class="lineCov"> 99 : operator*() const</span> -<span class="lineNum"> 132 </span><span class="lineCov"> 99 : { return static_cast<_Node*>(_M_node)->_M_data; }</span> -<span class="lineNum"> 133 </span> : -<span class="lineNum"> 134 </span> : pointer -<span class="lineNum"> 135 </span> : operator->() const -<span class="lineNum"> 136 </span> : { return &static_cast<_Node*>(_M_node)->_M_data; } -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : _Self& -<span class="lineNum"> 139 </span><span class="lineCov"> 63 : operator++()</span> -<span class="lineNum"> 140 </span> : { -<span class="lineNum"> 141 </span><span class="lineCov"> 63 : _M_node = _M_node->_M_next;</span> -<span class="lineNum"> 142 </span><span class="lineCov"> 63 : return *this;</span> -<span class="lineNum"> 143 </span> : } -<span class="lineNum"> 144 </span> : -<span class="lineNum"> 145 </span> : _Self -<span class="lineNum"> 146 </span><span class="lineNoCov"> 0 : operator++(int)</span> -<span class="lineNum"> 147 </span> : { -<span class="lineNum"> 148 </span><span class="lineNoCov"> 0 : _Self __tmp = *this;</span> -<span class="lineNum"> 149 </span><span class="lineNoCov"> 0 : _M_node = _M_node->_M_next;</span> -<span class="lineNum"> 150 </span> : return __tmp; -<span class="lineNum"> 151 </span> : } -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : _Self& -<span class="lineNum"> 154 </span><span class="lineCov"> 1 : operator--()</span> -<span class="lineNum"> 155 </span> : { -<span class="lineNum"> 156 </span><span class="lineCov"> 1 : _M_node = _M_node->_M_prev;</span> -<span class="lineNum"> 157 </span><span class="lineCov"> 1 : return *this;</span> -<span class="lineNum"> 158 </span> : } -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : _Self -<span class="lineNum"> 161 </span> : operator--(int) -<span class="lineNum"> 162 </span> : { -<span class="lineNum"> 163 </span> : _Self __tmp = *this; -<span class="lineNum"> 164 </span> : _M_node = _M_node->_M_prev; -<span class="lineNum"> 165 </span> : return __tmp; -<span class="lineNum"> 166 </span> : } -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : bool -<span class="lineNum"> 169 </span><span class="lineCov"> 108 : operator==(const _Self& __x) const</span> -<span class="lineNum"> 170 </span><span class="lineCov"> 108 : { return _M_node == __x._M_node; }</span> -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : bool -<span class="lineNum"> 173 </span><span class="lineCov"> 42 : operator!=(const _Self& __x) const</span> -<span class="lineNum"> 174 </span><span class="lineCov"> 42 : { return _M_node != __x._M_node; }</span> -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : // The only member points to the %list element. -<span class="lineNum"> 177 </span> : _List_node_base* _M_node; -<span class="lineNum"> 178 </span> : }; -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : /** -<span class="lineNum"> 181 </span> : * @brief A list::const_iterator. -<span class="lineNum"> 182 </span> : * -<span class="lineNum"> 183 </span> : * All the functions are op overloads. -<span class="lineNum"> 184 </span> : */ -<span class="lineNum"> 185 </span> : template<typename _Tp> -<span class="lineNum"> 186 </span> : struct _List_const_iterator -<span class="lineNum"> 187 </span> : { -<span class="lineNum"> 188 </span> : typedef _List_const_iterator<_Tp> _Self; -<span class="lineNum"> 189 </span> : typedef const _List_node<_Tp> _Node; -<span class="lineNum"> 190 </span> : typedef _List_iterator<_Tp> iterator; -<span class="lineNum"> 191 </span> : -<span class="lineNum"> 192 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 193 </span> : typedef std::bidirectional_iterator_tag iterator_category; -<span class="lineNum"> 194 </span> : typedef _Tp value_type; -<span class="lineNum"> 195 </span> : typedef const _Tp* pointer; -<span class="lineNum"> 196 </span> : typedef const _Tp& reference; -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : _List_const_iterator() -<span class="lineNum"> 199 </span> : : _M_node() { } -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : explicit -<span class="lineNum"> 202 </span><span class="lineCov"> 42 : _List_const_iterator(const _List_node_base* __x)</span> -<span class="lineNum"> 203 </span><span class="lineCov"> 42 : : _M_node(__x) { }</span> -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span> : _List_const_iterator(const iterator& __x) -<span class="lineNum"> 206 </span> : : _M_node(__x._M_node) { } -<span class="lineNum"> 207 </span> : -<span class="lineNum"> 208 </span> : // Must downcast from List_node_base to _List_node to get to -<span class="lineNum"> 209 </span> : // _M_data. -<span class="lineNum"> 210 </span> : reference -<span class="lineNum"> 211 </span><span class="lineCov"> 8 : operator*() const</span> -<span class="lineNum"> 212 </span><span class="lineCov"> 8 : { return static_cast<_Node*>(_M_node)->_M_data; }</span> -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : pointer -<span class="lineNum"> 215 </span> : operator->() const -<span class="lineNum"> 216 </span> : { return &static_cast<_Node*>(_M_node)->_M_data; } -<span class="lineNum"> 217 </span> : -<span class="lineNum"> 218 </span> : _Self& -<span class="lineNum"> 219 </span><span class="lineCov"> 19 : operator++()</span> -<span class="lineNum"> 220 </span> : { -<span class="lineNum"> 221 </span><span class="lineCov"> 19 : _M_node = _M_node->_M_next;</span> -<span class="lineNum"> 222 </span><span class="lineCov"> 19 : return *this;</span> -<span class="lineNum"> 223 </span> : } -<span class="lineNum"> 224 </span> : -<span class="lineNum"> 225 </span> : _Self -<span class="lineNum"> 226 </span> : operator++(int) -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span> : _Self __tmp = *this; -<span class="lineNum"> 229 </span> : _M_node = _M_node->_M_next; -<span class="lineNum"> 230 </span> : return __tmp; -<span class="lineNum"> 231 </span> : } -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : _Self& -<span class="lineNum"> 234 </span> : operator--() -<span class="lineNum"> 235 </span> : { -<span class="lineNum"> 236 </span> : _M_node = _M_node->_M_prev; -<span class="lineNum"> 237 </span> : return *this; -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : _Self -<span class="lineNum"> 241 </span> : operator--(int) -<span class="lineNum"> 242 </span> : { -<span class="lineNum"> 243 </span> : _Self __tmp = *this; -<span class="lineNum"> 244 </span> : _M_node = _M_node->_M_prev; -<span class="lineNum"> 245 </span> : return __tmp; -<span class="lineNum"> 246 </span> : } -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : bool -<span class="lineNum"> 249 </span><span class="lineCov"> 6 : operator==(const _Self& __x) const</span> -<span class="lineNum"> 250 </span><span class="lineCov"> 6 : { return _M_node == __x._M_node; }</span> -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : bool -<span class="lineNum"> 253 </span><span class="lineCov"> 38 : operator!=(const _Self& __x) const</span> -<span class="lineNum"> 254 </span><span class="lineCov"> 38 : { return _M_node != __x._M_node; }</span> -<span class="lineNum"> 255 </span> : -<span class="lineNum"> 256 </span> : // The only member points to the %list element. -<span class="lineNum"> 257 </span> : const _List_node_base* _M_node; -<span class="lineNum"> 258 </span> : }; -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : template<typename _Val> -<span class="lineNum"> 261 </span> : inline bool -<span class="lineNum"> 262 </span> : operator==(const _List_iterator<_Val>& __x, -<span class="lineNum"> 263 </span> : const _List_const_iterator<_Val>& __y) -<span class="lineNum"> 264 </span> : { return __x._M_node == __y._M_node; } -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : template<typename _Val> -<span class="lineNum"> 267 </span> : inline bool -<span class="lineNum"> 268 </span> : operator!=(const _List_iterator<_Val>& __x, -<span class="lineNum"> 269 </span> : const _List_const_iterator<_Val>& __y) -<span class="lineNum"> 270 </span> : { return __x._M_node != __y._M_node; } -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : -<span class="lineNum"> 273 </span> : /// See bits/stl_deque.h's _Deque_base for an explanation. -<span class="lineNum"> 274 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 275 </span> : class _List_base -<span class="lineNum"> 276 </span> : { -<span class="lineNum"> 277 </span> : protected: -<span class="lineNum"> 278 </span> : // NOTA BENE -<span class="lineNum"> 279 </span> : // The stored instance is not actually of "allocator_type"'s -<span class="lineNum"> 280 </span> : // type. Instead we rebind the type to -<span class="lineNum"> 281 </span> : // Allocator<List_node<Tp>>, which according to [20.1.5]/4 -<span class="lineNum"> 282 </span> : // should probably be the same. List_node<Tp> is not the same -<span class="lineNum"> 283 </span> : // size as Tp (it's two pointers larger), and specializations on -<span class="lineNum"> 284 </span> : // Tp may go unused because List_node<Tp> is being bound -<span class="lineNum"> 285 </span> : // instead. -<span class="lineNum"> 286 </span> : // -<span class="lineNum"> 287 </span> : // We put this to the test in the constructors and in -<span class="lineNum"> 288 </span> : // get_allocator, where we use conversions between -<span class="lineNum"> 289 </span> : // allocator_type and _Node_alloc_type. The conversion is -<span class="lineNum"> 290 </span> : // required by table 32 in [20.1.5]. -<span class="lineNum"> 291 </span> : typedef typename _Alloc::template rebind<_List_node<_Tp> >::other -<span class="lineNum"> 292 </span> : _Node_alloc_type; -<span class="lineNum"> 293 </span> : -<span class="lineNum"> 294 </span> : typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : struct _List_impl -<span class="lineNum"> 297 </span> : : public _Node_alloc_type -<span class="lineNum"> 298 </span><span class="lineCov"> 19 : {</span> -<span class="lineNum"> 299 </span> : _List_node_base _M_node; -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span><span class="lineCov"> 19 : _List_impl()</span> -<span class="lineNum"> 302 </span><span class="lineCov"> 19 : : _Node_alloc_type(), _M_node()</span> -<span class="lineNum"> 303 </span><span class="lineCov"> 19 : { }</span> -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : _List_impl(const _Node_alloc_type& __a) -<span class="lineNum"> 306 </span> : : _Node_alloc_type(__a), _M_node() -<span class="lineNum"> 307 </span> : { } -<span class="lineNum"> 308 </span> : }; -<span class="lineNum"> 309 </span> : -<span class="lineNum"> 310 </span> : _List_impl _M_impl; -<span class="lineNum"> 311 </span> : -<span class="lineNum"> 312 </span> : _List_node<_Tp>* -<span class="lineNum"> 313 </span><span class="lineCov"> 47 : _M_get_node()</span> -<span class="lineNum"> 314 </span><span class="lineCov"> 47 : { return _M_impl._Node_alloc_type::allocate(1); }</span> -<span class="lineNum"> 315 </span> : -<span class="lineNum"> 316 </span> : void -<span class="lineNum"> 317 </span><span class="lineCov"> 47 : _M_put_node(_List_node<_Tp>* __p)</span> -<span class="lineNum"> 318 </span><span class="lineCov"> 47 : { _M_impl._Node_alloc_type::deallocate(__p, 1); }</span> -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : public: -<span class="lineNum"> 321 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : _Node_alloc_type& -<span class="lineNum"> 324 </span> : _M_get_Node_allocator() -<span class="lineNum"> 325 </span> : { return *static_cast<_Node_alloc_type*>(&this->_M_impl); } -<span class="lineNum"> 326 </span> : -<span class="lineNum"> 327 </span> : const _Node_alloc_type& -<span class="lineNum"> 328 </span><span class="lineCov"> 94 : _M_get_Node_allocator() const</span> -<span class="lineNum"> 329 </span><span class="lineCov"> 94 : { return *static_cast<const _Node_alloc_type*>(&this->_M_impl); }</span> -<span class="lineNum"> 330 </span> : -<span class="lineNum"> 331 </span> : _Tp_alloc_type -<span class="lineNum"> 332 </span><span class="lineCov"> 94 : _M_get_Tp_allocator() const</span> -<span class="lineNum"> 333 </span><span class="lineCov"> 94 : { return _Tp_alloc_type(_M_get_Node_allocator()); }</span> -<span class="lineNum"> 334 </span> : -<span class="lineNum"> 335 </span> : allocator_type -<span class="lineNum"> 336 </span> : get_allocator() const -<span class="lineNum"> 337 </span> : { return allocator_type(_M_get_Node_allocator()); } -<span class="lineNum"> 338 </span> : -<span class="lineNum"> 339 </span><span class="lineCov"> 19 : _List_base()</span> -<span class="lineNum"> 340 </span><span class="lineCov"> 19 : : _M_impl()</span> -<span class="lineNum"> 341 </span><span class="lineCov"> 19 : { _M_init(); }</span> -<span class="lineNum"> 342 </span> : -<span class="lineNum"> 343 </span> : _List_base(const allocator_type& __a) -<span class="lineNum"> 344 </span> : : _M_impl(__a) -<span class="lineNum"> 345 </span> : { _M_init(); } -<span class="lineNum"> 346 </span> : -<span class="lineNum"> 347 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 348 </span> : _List_base(_List_base&& __x) -<span class="lineNum"> 349 </span> : : _M_impl(__x._M_get_Node_allocator()) -<span class="lineNum"> 350 </span> : { -<span class="lineNum"> 351 </span> : _M_init(); -<span class="lineNum"> 352 </span> : _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node); -<span class="lineNum"> 353 </span> : } -<span class="lineNum"> 354 </span> : #endif -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : // This is what actually destroys the list. -<span class="lineNum"> 357 </span><span class="lineCov"> 19 : ~_List_base()</span> -<span class="lineNum"> 358 </span><span class="lineCov"> 19 : { _M_clear(); }</span> -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : void -<span class="lineNum"> 361 </span> : _M_clear(); -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : void -<span class="lineNum"> 364 </span><span class="lineCov"> 19 : _M_init()</span> -<span class="lineNum"> 365 </span> : { -<span class="lineNum"> 366 </span><span class="lineCov"> 19 : this->_M_impl._M_node._M_next = &this->_M_impl._M_node;</span> -<span class="lineNum"> 367 </span><span class="lineCov"> 19 : this->_M_impl._M_node._M_prev = &this->_M_impl._M_node;</span> -<span class="lineNum"> 368 </span><span class="lineCov"> 19 : }</span> -<span class="lineNum"> 369 </span> : }; -<span class="lineNum"> 370 </span> : -<span class="lineNum"> 371 </span> : /** -<span class="lineNum"> 372 </span> : * @brief A standard container with linear time access to elements, -<span class="lineNum"> 373 </span> : * and fixed time insertion/deletion at any point in the sequence. -<span class="lineNum"> 374 </span> : * -<span class="lineNum"> 375 </span> : * @ingroup Containers -<span class="lineNum"> 376 </span> : * @ingroup Sequences -<span class="lineNum"> 377 </span> : * -<span class="lineNum"> 378 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a -<span class="lineNum"> 379 </span> : * <a href="tables.html#66">reversible container</a>, and a -<span class="lineNum"> 380 </span> : * <a href="tables.html#67">sequence</a>, including the -<span class="lineNum"> 381 </span> : * <a href="tables.html#68">optional sequence requirements</a> with the -<span class="lineNum"> 382 </span> : * %exception of @c at and @c operator[]. -<span class="lineNum"> 383 </span> : * -<span class="lineNum"> 384 </span> : * This is a @e doubly @e linked %list. Traversal up and down the -<span class="lineNum"> 385 </span> : * %list requires linear time, but adding and removing elements (or -<span class="lineNum"> 386 </span> : * @e nodes) is done in constant time, regardless of where the -<span class="lineNum"> 387 </span> : * change takes place. Unlike std::vector and std::deque, -<span class="lineNum"> 388 </span> : * random-access iterators are not provided, so subscripting ( @c -<span class="lineNum"> 389 </span> : * [] ) access is not allowed. For algorithms which only need -<span class="lineNum"> 390 </span> : * sequential access, this lack makes no difference. -<span class="lineNum"> 391 </span> : * -<span class="lineNum"> 392 </span> : * Also unlike the other standard containers, std::list provides -<span class="lineNum"> 393 </span> : * specialized algorithms %unique to linked lists, such as -<span class="lineNum"> 394 </span> : * splicing, sorting, and in-place reversal. -<span class="lineNum"> 395 </span> : * -<span class="lineNum"> 396 </span> : * A couple points on memory allocation for list<Tp>: -<span class="lineNum"> 397 </span> : * -<span class="lineNum"> 398 </span> : * First, we never actually allocate a Tp, we allocate -<span class="lineNum"> 399 </span> : * List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure -<span class="lineNum"> 400 </span> : * that after elements from %list<X,Alloc1> are spliced into -<span class="lineNum"> 401 </span> : * %list<X,Alloc2>, destroying the memory of the second %list is a -<span class="lineNum"> 402 </span> : * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away. -<span class="lineNum"> 403 </span> : * -<span class="lineNum"> 404 </span> : * Second, a %list conceptually represented as -<span class="lineNum"> 405 </span> : * @code -<span class="lineNum"> 406 </span> : * A <---> B <---> C <---> D -<span class="lineNum"> 407 </span> : * @endcode -<span class="lineNum"> 408 </span> : * is actually circular; a link exists between A and D. The %list -<span class="lineNum"> 409 </span> : * class holds (as its only data member) a private list::iterator -<span class="lineNum"> 410 </span> : * pointing to @e D, not to @e A! To get to the head of the %list, -<span class="lineNum"> 411 </span> : * we start at the tail and move forward by one. When this member -<span class="lineNum"> 412 </span> : * iterator's next/previous pointers refer to itself, the %list is -<span class="lineNum"> 413 </span> : * %empty. -<span class="lineNum"> 414 </span> : */ -<span class="lineNum"> 415 </span> : template<typename _Tp, typename _Alloc = std::allocator<_Tp> > -<span class="lineNum"> 416 </span> : class list : protected _List_base<_Tp, _Alloc> -<span class="lineNum"> 417 </span><span class="lineCov"> 19 : {</span> -<span class="lineNum"> 418 </span> : // concept requirements -<span class="lineNum"> 419 </span> : typedef typename _Alloc::value_type _Alloc_value_type; -<span class="lineNum"> 420 </span> : __glibcxx_class_requires(_Tp, _SGIAssignableConcept) -<span class="lineNum"> 421 </span> : __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) -<span class="lineNum"> 422 </span> : -<span class="lineNum"> 423 </span> : typedef _List_base<_Tp, _Alloc> _Base; -<span class="lineNum"> 424 </span> : typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : public: -<span class="lineNum"> 427 </span> : typedef _Tp value_type; -<span class="lineNum"> 428 </span> : typedef typename _Tp_alloc_type::pointer pointer; -<span class="lineNum"> 429 </span> : typedef typename _Tp_alloc_type::const_pointer const_pointer; -<span class="lineNum"> 430 </span> : typedef typename _Tp_alloc_type::reference reference; -<span class="lineNum"> 431 </span> : typedef typename _Tp_alloc_type::const_reference const_reference; -<span class="lineNum"> 432 </span> : typedef _List_iterator<_Tp> iterator; -<span class="lineNum"> 433 </span> : typedef _List_const_iterator<_Tp> const_iterator; -<span class="lineNum"> 434 </span> : typedef std::reverse_iterator<const_iterator> const_reverse_iterator; -<span class="lineNum"> 435 </span> : typedef std::reverse_iterator<iterator> reverse_iterator; -<span class="lineNum"> 436 </span> : typedef size_t size_type; -<span class="lineNum"> 437 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 438 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 439 </span> : -<span class="lineNum"> 440 </span> : protected: -<span class="lineNum"> 441 </span> : // Note that pointers-to-_Node's can be ctor-converted to -<span class="lineNum"> 442 </span> : // iterator types. -<span class="lineNum"> 443 </span> : typedef _List_node<_Tp> _Node; -<span class="lineNum"> 444 </span> : -<span class="lineNum"> 445 </span> : using _Base::_M_impl; -<span class="lineNum"> 446 </span> : using _Base::_M_put_node; -<span class="lineNum"> 447 </span> : using _Base::_M_get_node; -<span class="lineNum"> 448 </span> : using _Base::_M_get_Tp_allocator; -<span class="lineNum"> 449 </span> : using _Base::_M_get_Node_allocator; -<span class="lineNum"> 450 </span> : -<span class="lineNum"> 451 </span> : /** -<span class="lineNum"> 452 </span> : * @param x An instance of user data. -<span class="lineNum"> 453 </span> : * -<span class="lineNum"> 454 </span> : * Allocates space for a new node and constructs a copy of @a x in it. -<span class="lineNum"> 455 </span> : */ -<span class="lineNum"> 456 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 457 </span> : _Node* -<span class="lineNum"> 458 </span><span class="lineCov"> 47 : _M_create_node(const value_type& __x)</span> -<span class="lineNum"> 459 </span> : { -<span class="lineNum"> 460 </span><span class="lineCov"> 47 : _Node* __p = this->_M_get_node();</span> -<span class="lineNum"> 461 </span> : try -<span class="lineNum"> 462 </span> : { -<span class="lineNum"> 463 </span><span class="lineCov"> 47 : _M_get_Tp_allocator().construct(&__p->_M_data, __x);</span> -<span class="lineNum"> 464 </span> : } -<span class="lineNum"> 465 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 466 </span> : { -<span class="lineNum"> 467 </span><span class="lineNoCov"> 0 : _M_put_node(__p);</span> -<span class="lineNum"> 468 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 469 </span> : } -<span class="lineNum"> 470 </span><span class="lineCov"> 47 : return __p;</span> -<span class="lineNum"> 471 </span> : } -<span class="lineNum"> 472 </span> : #else -<span class="lineNum"> 473 </span> : template<typename... _Args> -<span class="lineNum"> 474 </span> : _Node* -<span class="lineNum"> 475 </span> : _M_create_node(_Args&&... __args) -<span class="lineNum"> 476 </span> : { -<span class="lineNum"> 477 </span> : _Node* __p = this->_M_get_node(); -<span class="lineNum"> 478 </span> : try -<span class="lineNum"> 479 </span> : { -<span class="lineNum"> 480 </span> : _M_get_Tp_allocator().construct(&__p->_M_data, -<span class="lineNum"> 481 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 482 </span> : } -<span class="lineNum"> 483 </span> : catch(...) -<span class="lineNum"> 484 </span> : { -<span class="lineNum"> 485 </span> : _M_put_node(__p); -<span class="lineNum"> 486 </span> : __throw_exception_again; -<span class="lineNum"> 487 </span> : } -<span class="lineNum"> 488 </span> : return __p; -<span class="lineNum"> 489 </span> : } -<span class="lineNum"> 490 </span> : #endif -<span class="lineNum"> 491 </span> : -<span class="lineNum"> 492 </span> : public: -<span class="lineNum"> 493 </span> : // [23.2.2.1] construct/copy/destroy -<span class="lineNum"> 494 </span> : // (assign() and get_allocator() are also listed in this section) -<span class="lineNum"> 495 </span> : /** -<span class="lineNum"> 496 </span> : * @brief Default constructor creates no elements. -<span class="lineNum"> 497 </span> : */ -<span class="lineNum"> 498 </span><span class="lineCov"> 19 : list()</span> -<span class="lineNum"> 499 </span><span class="lineCov"> 19 : : _Base() { }</span> -<span class="lineNum"> 500 </span> : -<span class="lineNum"> 501 </span> : /** -<span class="lineNum"> 502 </span> : * @brief Creates a %list with no elements. -<span class="lineNum"> 503 </span> : * @param a An allocator object. -<span class="lineNum"> 504 </span> : */ -<span class="lineNum"> 505 </span> : explicit -<span class="lineNum"> 506 </span> : list(const allocator_type& __a) -<span class="lineNum"> 507 </span> : : _Base(__a) { } -<span class="lineNum"> 508 </span> : -<span class="lineNum"> 509 </span> : /** -<span class="lineNum"> 510 </span> : * @brief Creates a %list with copies of an exemplar element. -<span class="lineNum"> 511 </span> : * @param n The number of elements to initially create. -<span class="lineNum"> 512 </span> : * @param value An element to copy. -<span class="lineNum"> 513 </span> : * @param a An allocator object. -<span class="lineNum"> 514 </span> : * -<span class="lineNum"> 515 </span> : * This constructor fills the %list with @a n copies of @a value. -<span class="lineNum"> 516 </span> : */ -<span class="lineNum"> 517 </span> : explicit -<span class="lineNum"> 518 </span> : list(size_type __n, const value_type& __value = value_type(), -<span class="lineNum"> 519 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 520 </span> : : _Base(__a) -<span class="lineNum"> 521 </span> : { _M_fill_initialize(__n, __value); } -<span class="lineNum"> 522 </span> : -<span class="lineNum"> 523 </span> : /** -<span class="lineNum"> 524 </span> : * @brief %List copy constructor. -<span class="lineNum"> 525 </span> : * @param x A %list of identical element and allocator types. -<span class="lineNum"> 526 </span> : * -<span class="lineNum"> 527 </span> : * The newly-created %list uses a copy of the allocation object used -<span class="lineNum"> 528 </span> : * by @a x. -<span class="lineNum"> 529 </span> : */ -<span class="lineNum"> 530 </span> : list(const list& __x) -<span class="lineNum"> 531 </span> : : _Base(__x._M_get_Node_allocator()) -<span class="lineNum"> 532 </span> : { _M_initialize_dispatch(__x.begin(), __x.end(), __false_type()); } -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 535 </span> : /** -<span class="lineNum"> 536 </span> : * @brief %List move constructor. -<span class="lineNum"> 537 </span> : * @param x A %list of identical element and allocator types. -<span class="lineNum"> 538 </span> : * -<span class="lineNum"> 539 </span> : * The newly-created %list contains the exact contents of @a x. -<span class="lineNum"> 540 </span> : * The contents of @a x are a valid, but unspecified %list. -<span class="lineNum"> 541 </span> : */ -<span class="lineNum"> 542 </span> : list(list&& __x) -<span class="lineNum"> 543 </span> : : _Base(std::forward<_Base>(__x)) { } -<span class="lineNum"> 544 </span> : #endif -<span class="lineNum"> 545 </span> : -<span class="lineNum"> 546 </span> : /** -<span class="lineNum"> 547 </span> : * @brief Builds a %list from a range. -<span class="lineNum"> 548 </span> : * @param first An input iterator. -<span class="lineNum"> 549 </span> : * @param last An input iterator. -<span class="lineNum"> 550 </span> : * @param a An allocator object. -<span class="lineNum"> 551 </span> : * -<span class="lineNum"> 552 </span> : * Create a %list consisting of copies of the elements from -<span class="lineNum"> 553 </span> : * [@a first,@a last). This is linear in N (where N is -<span class="lineNum"> 554 </span> : * distance(@a first,@a last)). -<span class="lineNum"> 555 </span> : */ -<span class="lineNum"> 556 </span> : template<typename _InputIterator> -<span class="lineNum"> 557 </span> : list(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 558 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 559 </span> : : _Base(__a) -<span class="lineNum"> 560 </span> : { -<span class="lineNum"> 561 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 562 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 563 </span> : _M_initialize_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 564 </span> : } -<span class="lineNum"> 565 </span> : -<span class="lineNum"> 566 </span> : /** -<span class="lineNum"> 567 </span> : * No explicit dtor needed as the _Base dtor takes care of -<span class="lineNum"> 568 </span> : * things. The _Base dtor only erases the elements, and note -<span class="lineNum"> 569 </span> : * that if the elements themselves are pointers, the pointed-to -<span class="lineNum"> 570 </span> : * memory is not touched in any way. Managing the pointer is -<span class="lineNum"> 571 </span> : * the user's responsibility. -<span class="lineNum"> 572 </span> : */ -<span class="lineNum"> 573 </span> : -<span class="lineNum"> 574 </span> : /** -<span class="lineNum"> 575 </span> : * @brief %List assignment operator. -<span class="lineNum"> 576 </span> : * @param x A %list of identical element and allocator types. -<span class="lineNum"> 577 </span> : * -<span class="lineNum"> 578 </span> : * All the elements of @a x are copied, but unlike the copy -<span class="lineNum"> 579 </span> : * constructor, the allocator object is not copied. -<span class="lineNum"> 580 </span> : */ -<span class="lineNum"> 581 </span> : list& -<span class="lineNum"> 582 </span> : operator=(const list& __x); -<span class="lineNum"> 583 </span> : -<span class="lineNum"> 584 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 585 </span> : /** -<span class="lineNum"> 586 </span> : * @brief %List move assignment operator. -<span class="lineNum"> 587 </span> : * @param x A %list of identical element and allocator types. -<span class="lineNum"> 588 </span> : * -<span class="lineNum"> 589 </span> : * The contents of @a x are moved into this %list (without copying). -<span class="lineNum"> 590 </span> : * @a x is a valid, but unspecified %list -<span class="lineNum"> 591 </span> : */ -<span class="lineNum"> 592 </span> : list& -<span class="lineNum"> 593 </span> : operator=(list&& __x) -<span class="lineNum"> 594 </span> : { -<span class="lineNum"> 595 </span> : // NB: DR 675. -<span class="lineNum"> 596 </span> : this->clear(); -<span class="lineNum"> 597 </span> : this->swap(__x); -<span class="lineNum"> 598 </span> : return *this; -<span class="lineNum"> 599 </span> : } -<span class="lineNum"> 600 </span> : #endif -<span class="lineNum"> 601 </span> : -<span class="lineNum"> 602 </span> : /** -<span class="lineNum"> 603 </span> : * @brief Assigns a given value to a %list. -<span class="lineNum"> 604 </span> : * @param n Number of elements to be assigned. -<span class="lineNum"> 605 </span> : * @param val Value to be assigned. -<span class="lineNum"> 606 </span> : * -<span class="lineNum"> 607 </span> : * This function fills a %list with @a n copies of the given -<span class="lineNum"> 608 </span> : * value. Note that the assignment completely changes the %list -<span class="lineNum"> 609 </span> : * and that the resulting %list's size is the same as the number -<span class="lineNum"> 610 </span> : * of elements assigned. Old data may be lost. -<span class="lineNum"> 611 </span> : */ -<span class="lineNum"> 612 </span> : void -<span class="lineNum"> 613 </span> : assign(size_type __n, const value_type& __val) -<span class="lineNum"> 614 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 615 </span> : -<span class="lineNum"> 616 </span> : /** -<span class="lineNum"> 617 </span> : * @brief Assigns a range to a %list. -<span class="lineNum"> 618 </span> : * @param first An input iterator. -<span class="lineNum"> 619 </span> : * @param last An input iterator. -<span class="lineNum"> 620 </span> : * -<span class="lineNum"> 621 </span> : * This function fills a %list with copies of the elements in the -<span class="lineNum"> 622 </span> : * range [@a first,@a last). -<span class="lineNum"> 623 </span> : * -<span class="lineNum"> 624 </span> : * Note that the assignment completely changes the %list and -<span class="lineNum"> 625 </span> : * that the resulting %list's size is the same as the number of -<span class="lineNum"> 626 </span> : * elements assigned. Old data may be lost. -<span class="lineNum"> 627 </span> : */ -<span class="lineNum"> 628 </span> : template<typename _InputIterator> -<span class="lineNum"> 629 </span> : void -<span class="lineNum"> 630 </span> : assign(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 631 </span> : { -<span class="lineNum"> 632 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 633 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 634 </span> : _M_assign_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 635 </span> : } -<span class="lineNum"> 636 </span> : -<span class="lineNum"> 637 </span> : /// Get a copy of the memory allocation object. -<span class="lineNum"> 638 </span> : allocator_type -<span class="lineNum"> 639 </span> : get_allocator() const -<span class="lineNum"> 640 </span> : { return _Base::get_allocator(); } -<span class="lineNum"> 641 </span> : -<span class="lineNum"> 642 </span> : // iterators -<span class="lineNum"> 643 </span> : /** -<span class="lineNum"> 644 </span> : * Returns a read/write iterator that points to the first element in the -<span class="lineNum"> 645 </span> : * %list. Iteration is done in ordinary element order. -<span class="lineNum"> 646 </span> : */ -<span class="lineNum"> 647 </span> : iterator -<span class="lineNum"> 648 </span><span class="lineCov"> 27 : begin()</span> -<span class="lineNum"> 649 </span><span class="lineCov"> 27 : { return iterator(this->_M_impl._M_node._M_next); }</span> -<span class="lineNum"> 650 </span> : -<span class="lineNum"> 651 </span> : /** -<span class="lineNum"> 652 </span> : * Returns a read-only (constant) iterator that points to the -<span class="lineNum"> 653 </span> : * first element in the %list. Iteration is done in ordinary -<span class="lineNum"> 654 </span> : * element order. -<span class="lineNum"> 655 </span> : */ -<span class="lineNum"> 656 </span> : const_iterator -<span class="lineNum"> 657 </span><span class="lineCov"> 21 : begin() const</span> -<span class="lineNum"> 658 </span><span class="lineCov"> 21 : { return const_iterator(this->_M_impl._M_node._M_next); }</span> -<span class="lineNum"> 659 </span> : -<span class="lineNum"> 660 </span> : /** -<span class="lineNum"> 661 </span> : * Returns a read/write iterator that points one past the last -<span class="lineNum"> 662 </span> : * element in the %list. Iteration is done in ordinary element -<span class="lineNum"> 663 </span> : * order. -<span class="lineNum"> 664 </span> : */ -<span class="lineNum"> 665 </span> : iterator -<span class="lineNum"> 666 </span><span class="lineCov"> 154 : end()</span> -<span class="lineNum"> 667 </span><span class="lineCov"> 154 : { return iterator(&this->_M_impl._M_node); }</span> -<span class="lineNum"> 668 </span> : -<span class="lineNum"> 669 </span> : /** -<span class="lineNum"> 670 </span> : * Returns a read-only (constant) iterator that points one past -<span class="lineNum"> 671 </span> : * the last element in the %list. Iteration is done in ordinary -<span class="lineNum"> 672 </span> : * element order. -<span class="lineNum"> 673 </span> : */ -<span class="lineNum"> 674 </span> : const_iterator -<span class="lineNum"> 675 </span><span class="lineCov"> 21 : end() const</span> -<span class="lineNum"> 676 </span><span class="lineCov"> 21 : { return const_iterator(&this->_M_impl._M_node); }</span> -<span class="lineNum"> 677 </span> : -<span class="lineNum"> 678 </span> : /** -<span class="lineNum"> 679 </span> : * Returns a read/write reverse iterator that points to the last -<span class="lineNum"> 680 </span> : * element in the %list. Iteration is done in reverse element -<span class="lineNum"> 681 </span> : * order. -<span class="lineNum"> 682 </span> : */ -<span class="lineNum"> 683 </span> : reverse_iterator -<span class="lineNum"> 684 </span><span class="lineCov"> 1 : rbegin()</span> -<span class="lineNum"> 685 </span><span class="lineCov"> 1 : { return reverse_iterator(end()); }</span> -<span class="lineNum"> 686 </span> : -<span class="lineNum"> 687 </span> : /** -<span class="lineNum"> 688 </span> : * Returns a read-only (constant) reverse iterator that points to -<span class="lineNum"> 689 </span> : * the last element in the %list. Iteration is done in reverse -<span class="lineNum"> 690 </span> : * element order. -<span class="lineNum"> 691 </span> : */ -<span class="lineNum"> 692 </span> : const_reverse_iterator -<span class="lineNum"> 693 </span> : rbegin() const -<span class="lineNum"> 694 </span> : { return const_reverse_iterator(end()); } -<span class="lineNum"> 695 </span> : -<span class="lineNum"> 696 </span> : /** -<span class="lineNum"> 697 </span> : * Returns a read/write reverse iterator that points to one -<span class="lineNum"> 698 </span> : * before the first element in the %list. Iteration is done in -<span class="lineNum"> 699 </span> : * reverse element order. -<span class="lineNum"> 700 </span> : */ -<span class="lineNum"> 701 </span> : reverse_iterator -<span class="lineNum"> 702 </span> : rend() -<span class="lineNum"> 703 </span> : { return reverse_iterator(begin()); } -<span class="lineNum"> 704 </span> : -<span class="lineNum"> 705 </span> : /** -<span class="lineNum"> 706 </span> : * Returns a read-only (constant) reverse iterator that points to one -<span class="lineNum"> 707 </span> : * before the first element in the %list. Iteration is done in reverse -<span class="lineNum"> 708 </span> : * element order. -<span class="lineNum"> 709 </span> : */ -<span class="lineNum"> 710 </span> : const_reverse_iterator -<span class="lineNum"> 711 </span> : rend() const -<span class="lineNum"> 712 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 713 </span> : -<span class="lineNum"> 714 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 715 </span> : /** -<span class="lineNum"> 716 </span> : * Returns a read-only (constant) iterator that points to the -<span class="lineNum"> 717 </span> : * first element in the %list. Iteration is done in ordinary -<span class="lineNum"> 718 </span> : * element order. -<span class="lineNum"> 719 </span> : */ -<span class="lineNum"> 720 </span> : const_iterator -<span class="lineNum"> 721 </span> : cbegin() const -<span class="lineNum"> 722 </span> : { return const_iterator(this->_M_impl._M_node._M_next); } -<span class="lineNum"> 723 </span> : -<span class="lineNum"> 724 </span> : /** -<span class="lineNum"> 725 </span> : * Returns a read-only (constant) iterator that points one past -<span class="lineNum"> 726 </span> : * the last element in the %list. Iteration is done in ordinary -<span class="lineNum"> 727 </span> : * element order. -<span class="lineNum"> 728 </span> : */ -<span class="lineNum"> 729 </span> : const_iterator -<span class="lineNum"> 730 </span> : cend() const -<span class="lineNum"> 731 </span> : { return const_iterator(&this->_M_impl._M_node); } -<span class="lineNum"> 732 </span> : -<span class="lineNum"> 733 </span> : /** -<span class="lineNum"> 734 </span> : * Returns a read-only (constant) reverse iterator that points to -<span class="lineNum"> 735 </span> : * the last element in the %list. Iteration is done in reverse -<span class="lineNum"> 736 </span> : * element order. -<span class="lineNum"> 737 </span> : */ -<span class="lineNum"> 738 </span> : const_reverse_iterator -<span class="lineNum"> 739 </span> : crbegin() const -<span class="lineNum"> 740 </span> : { return const_reverse_iterator(end()); } -<span class="lineNum"> 741 </span> : -<span class="lineNum"> 742 </span> : /** -<span class="lineNum"> 743 </span> : * Returns a read-only (constant) reverse iterator that points to one -<span class="lineNum"> 744 </span> : * before the first element in the %list. Iteration is done in reverse -<span class="lineNum"> 745 </span> : * element order. -<span class="lineNum"> 746 </span> : */ -<span class="lineNum"> 747 </span> : const_reverse_iterator -<span class="lineNum"> 748 </span> : crend() const -<span class="lineNum"> 749 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 750 </span> : #endif -<span class="lineNum"> 751 </span> : -<span class="lineNum"> 752 </span> : // [23.2.2.2] capacity -<span class="lineNum"> 753 </span> : /** -<span class="lineNum"> 754 </span> : * Returns true if the %list is empty. (Thus begin() would equal -<span class="lineNum"> 755 </span> : * end().) -<span class="lineNum"> 756 </span> : */ -<span class="lineNum"> 757 </span> : bool -<span class="lineNum"> 758 </span> : empty() const -<span class="lineNum"> 759 </span> : { return this->_M_impl._M_node._M_next == &this->_M_impl._M_node; } -<span class="lineNum"> 760 </span> : -<span class="lineNum"> 761 </span> : /** Returns the number of elements in the %list. */ -<span class="lineNum"> 762 </span> : size_type -<span class="lineNum"> 763 </span><span class="lineCov"> 13 : size() const</span> -<span class="lineNum"> 764 </span><span class="lineCov"> 13 : { return std::distance(begin(), end()); }</span> -<span class="lineNum"> 765 </span> : -<span class="lineNum"> 766 </span> : /** Returns the size() of the largest possible %list. */ -<span class="lineNum"> 767 </span> : size_type -<span class="lineNum"> 768 </span> : max_size() const -<span class="lineNum"> 769 </span> : { return _M_get_Tp_allocator().max_size(); } -<span class="lineNum"> 770 </span> : -<span class="lineNum"> 771 </span> : /** -<span class="lineNum"> 772 </span> : * @brief Resizes the %list to the specified number of elements. -<span class="lineNum"> 773 </span> : * @param new_size Number of elements the %list should contain. -<span class="lineNum"> 774 </span> : * @param x Data with which new elements should be populated. -<span class="lineNum"> 775 </span> : * -<span class="lineNum"> 776 </span> : * This function will %resize the %list to the specified number -<span class="lineNum"> 777 </span> : * of elements. If the number is smaller than the %list's -<span class="lineNum"> 778 </span> : * current size the %list is truncated, otherwise the %list is -<span class="lineNum"> 779 </span> : * extended and new elements are populated with given data. -<span class="lineNum"> 780 </span> : */ -<span class="lineNum"> 781 </span> : void -<span class="lineNum"> 782 </span> : resize(size_type __new_size, value_type __x = value_type()); -<span class="lineNum"> 783 </span> : -<span class="lineNum"> 784 </span> : // element access -<span class="lineNum"> 785 </span> : /** -<span class="lineNum"> 786 </span> : * Returns a read/write reference to the data at the first -<span class="lineNum"> 787 </span> : * element of the %list. -<span class="lineNum"> 788 </span> : */ -<span class="lineNum"> 789 </span> : reference -<span class="lineNum"> 790 </span> : front() -<span class="lineNum"> 791 </span> : { return *begin(); } -<span class="lineNum"> 792 </span> : -<span class="lineNum"> 793 </span> : /** -<span class="lineNum"> 794 </span> : * Returns a read-only (constant) reference to the data at the first -<span class="lineNum"> 795 </span> : * element of the %list. -<span class="lineNum"> 796 </span> : */ -<span class="lineNum"> 797 </span> : const_reference -<span class="lineNum"> 798 </span> : front() const -<span class="lineNum"> 799 </span> : { return *begin(); } -<span class="lineNum"> 800 </span> : -<span class="lineNum"> 801 </span> : /** -<span class="lineNum"> 802 </span> : * Returns a read/write reference to the data at the last element -<span class="lineNum"> 803 </span> : * of the %list. -<span class="lineNum"> 804 </span> : */ -<span class="lineNum"> 805 </span> : reference -<span class="lineNum"> 806 </span> : back() -<span class="lineNum"> 807 </span> : { -<span class="lineNum"> 808 </span> : iterator __tmp = end(); -<span class="lineNum"> 809 </span> : --__tmp; -<span class="lineNum"> 810 </span> : return *__tmp; -<span class="lineNum"> 811 </span> : } -<span class="lineNum"> 812 </span> : -<span class="lineNum"> 813 </span> : /** -<span class="lineNum"> 814 </span> : * Returns a read-only (constant) reference to the data at the last -<span class="lineNum"> 815 </span> : * element of the %list. -<span class="lineNum"> 816 </span> : */ -<span class="lineNum"> 817 </span> : const_reference -<span class="lineNum"> 818 </span> : back() const -<span class="lineNum"> 819 </span> : { -<span class="lineNum"> 820 </span> : const_iterator __tmp = end(); -<span class="lineNum"> 821 </span> : --__tmp; -<span class="lineNum"> 822 </span> : return *__tmp; -<span class="lineNum"> 823 </span> : } -<span class="lineNum"> 824 </span> : -<span class="lineNum"> 825 </span> : // [23.2.2.3] modifiers -<span class="lineNum"> 826 </span> : /** -<span class="lineNum"> 827 </span> : * @brief Add data to the front of the %list. -<span class="lineNum"> 828 </span> : * @param x Data to be added. -<span class="lineNum"> 829 </span> : * -<span class="lineNum"> 830 </span> : * This is a typical stack operation. The function creates an -<span class="lineNum"> 831 </span> : * element at the front of the %list and assigns the given data -<span class="lineNum"> 832 </span> : * to it. Due to the nature of a %list this operation can be -<span class="lineNum"> 833 </span> : * done in constant time, and does not invalidate iterators and -<span class="lineNum"> 834 </span> : * references. -<span class="lineNum"> 835 </span> : */ -<span class="lineNum"> 836 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 837 </span> : void -<span class="lineNum"> 838 </span> : push_front(const value_type& __x) -<span class="lineNum"> 839 </span> : { this->_M_insert(begin(), __x); } -<span class="lineNum"> 840 </span> : #else -<span class="lineNum"> 841 </span> : template<typename... _Args> -<span class="lineNum"> 842 </span> : void -<span class="lineNum"> 843 </span> : push_front(_Args&&... __args) -<span class="lineNum"> 844 </span> : { this->_M_insert(begin(), std::forward<_Args>(__args)...); } -<span class="lineNum"> 845 </span> : #endif -<span class="lineNum"> 846 </span> : -<span class="lineNum"> 847 </span> : /** -<span class="lineNum"> 848 </span> : * @brief Removes first element. -<span class="lineNum"> 849 </span> : * -<span class="lineNum"> 850 </span> : * This is a typical stack operation. It shrinks the %list by -<span class="lineNum"> 851 </span> : * one. Due to the nature of a %list this operation can be done -<span class="lineNum"> 852 </span> : * in constant time, and only invalidates iterators/references to -<span class="lineNum"> 853 </span> : * the element being removed. -<span class="lineNum"> 854 </span> : * -<span class="lineNum"> 855 </span> : * Note that no data is returned, and if the first element's data -<span class="lineNum"> 856 </span> : * is needed, it should be retrieved before pop_front() is -<span class="lineNum"> 857 </span> : * called. -<span class="lineNum"> 858 </span> : */ -<span class="lineNum"> 859 </span> : void -<span class="lineNum"> 860 </span> : pop_front() -<span class="lineNum"> 861 </span> : { this->_M_erase(begin()); } -<span class="lineNum"> 862 </span> : -<span class="lineNum"> 863 </span> : /** -<span class="lineNum"> 864 </span> : * @brief Add data to the end of the %list. -<span class="lineNum"> 865 </span> : * @param x Data to be added. -<span class="lineNum"> 866 </span> : * -<span class="lineNum"> 867 </span> : * This is a typical stack operation. The function creates an -<span class="lineNum"> 868 </span> : * element at the end of the %list and assigns the given data to -<span class="lineNum"> 869 </span> : * it. Due to the nature of a %list this operation can be done -<span class="lineNum"> 870 </span> : * in constant time, and does not invalidate iterators and -<span class="lineNum"> 871 </span> : * references. -<span class="lineNum"> 872 </span> : */ -<span class="lineNum"> 873 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 874 </span> : void -<span class="lineNum"> 875 </span><span class="lineCov"> 47 : push_back(const value_type& __x)</span> -<span class="lineNum"> 876 </span><span class="lineCov"> 47 : { this->_M_insert(end(), __x); }</span> -<span class="lineNum"> 877 </span> : #else -<span class="lineNum"> 878 </span> : template<typename... _Args> -<span class="lineNum"> 879 </span> : void -<span class="lineNum"> 880 </span> : push_back(_Args&&... __args) -<span class="lineNum"> 881 </span> : { this->_M_insert(end(), std::forward<_Args>(__args)...); } -<span class="lineNum"> 882 </span> : #endif -<span class="lineNum"> 883 </span> : -<span class="lineNum"> 884 </span> : /** -<span class="lineNum"> 885 </span> : * @brief Removes last element. -<span class="lineNum"> 886 </span> : * -<span class="lineNum"> 887 </span> : * This is a typical stack operation. It shrinks the %list by -<span class="lineNum"> 888 </span> : * one. Due to the nature of a %list this operation can be done -<span class="lineNum"> 889 </span> : * in constant time, and only invalidates iterators/references to -<span class="lineNum"> 890 </span> : * the element being removed. -<span class="lineNum"> 891 </span> : * -<span class="lineNum"> 892 </span> : * Note that no data is returned, and if the last element's data -<span class="lineNum"> 893 </span> : * is needed, it should be retrieved before pop_back() is called. -<span class="lineNum"> 894 </span> : */ -<span class="lineNum"> 895 </span> : void -<span class="lineNum"> 896 </span> : pop_back() -<span class="lineNum"> 897 </span> : { this->_M_erase(iterator(this->_M_impl._M_node._M_prev)); } -<span class="lineNum"> 898 </span> : -<span class="lineNum"> 899 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 900 </span> : /** -<span class="lineNum"> 901 </span> : * @brief Constructs object in %list before specified iterator. -<span class="lineNum"> 902 </span> : * @param position A const_iterator into the %list. -<span class="lineNum"> 903 </span> : * @param args Arguments. -<span class="lineNum"> 904 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 905 </span> : * -<span class="lineNum"> 906 </span> : * This function will insert an object of type T constructed -<span class="lineNum"> 907 </span> : * with T(std::forward<Args>(args)...) before the specified -<span class="lineNum"> 908 </span> : * location. Due to the nature of a %list this operation can -<span class="lineNum"> 909 </span> : * be done in constant time, and does not invalidate iterators -<span class="lineNum"> 910 </span> : * and references. -<span class="lineNum"> 911 </span> : */ -<span class="lineNum"> 912 </span> : template<typename... _Args> -<span class="lineNum"> 913 </span> : iterator -<span class="lineNum"> 914 </span> : emplace(iterator __position, _Args&&... __args); -<span class="lineNum"> 915 </span> : #endif -<span class="lineNum"> 916 </span> : -<span class="lineNum"> 917 </span> : /** -<span class="lineNum"> 918 </span> : * @brief Inserts given value into %list before specified iterator. -<span class="lineNum"> 919 </span> : * @param position An iterator into the %list. -<span class="lineNum"> 920 </span> : * @param x Data to be inserted. -<span class="lineNum"> 921 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 922 </span> : * -<span class="lineNum"> 923 </span> : * This function will insert a copy of the given value before -<span class="lineNum"> 924 </span> : * the specified location. Due to the nature of a %list this -<span class="lineNum"> 925 </span> : * operation can be done in constant time, and does not -<span class="lineNum"> 926 </span> : * invalidate iterators and references. -<span class="lineNum"> 927 </span> : */ -<span class="lineNum"> 928 </span> : iterator -<span class="lineNum"> 929 </span> : insert(iterator __position, const value_type& __x); -<span class="lineNum"> 930 </span> : -<span class="lineNum"> 931 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 932 </span> : /** -<span class="lineNum"> 933 </span> : * @brief Inserts given rvalue into %list before specified iterator. -<span class="lineNum"> 934 </span> : * @param position An iterator into the %list. -<span class="lineNum"> 935 </span> : * @param x Data to be inserted. -<span class="lineNum"> 936 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 937 </span> : * -<span class="lineNum"> 938 </span> : * This function will insert a copy of the given rvalue before -<span class="lineNum"> 939 </span> : * the specified location. Due to the nature of a %list this -<span class="lineNum"> 940 </span> : * operation can be done in constant time, and does not -<span class="lineNum"> 941 </span> : * invalidate iterators and references. -<span class="lineNum"> 942 </span> : */ -<span class="lineNum"> 943 </span> : iterator -<span class="lineNum"> 944 </span> : insert(iterator __position, value_type&& __x) -<span class="lineNum"> 945 </span> : { return emplace(__position, std::move(__x)); } -<span class="lineNum"> 946 </span> : #endif -<span class="lineNum"> 947 </span> : -<span class="lineNum"> 948 </span> : /** -<span class="lineNum"> 949 </span> : * @brief Inserts a number of copies of given data into the %list. -<span class="lineNum"> 950 </span> : * @param position An iterator into the %list. -<span class="lineNum"> 951 </span> : * @param n Number of elements to be inserted. -<span class="lineNum"> 952 </span> : * @param x Data to be inserted. -<span class="lineNum"> 953 </span> : * -<span class="lineNum"> 954 </span> : * This function will insert a specified number of copies of the -<span class="lineNum"> 955 </span> : * given data before the location specified by @a position. -<span class="lineNum"> 956 </span> : * -<span class="lineNum"> 957 </span> : * This operation is linear in the number of elements inserted and -<span class="lineNum"> 958 </span> : * does not invalidate iterators and references. -<span class="lineNum"> 959 </span> : */ -<span class="lineNum"> 960 </span> : void -<span class="lineNum"> 961 </span> : insert(iterator __position, size_type __n, const value_type& __x) -<span class="lineNum"> 962 </span> : { -<span class="lineNum"> 963 </span> : list __tmp(__n, __x, _M_get_Node_allocator()); -<span class="lineNum"> 964 </span> : splice(__position, __tmp); -<span class="lineNum"> 965 </span> : } -<span class="lineNum"> 966 </span> : -<span class="lineNum"> 967 </span> : /** -<span class="lineNum"> 968 </span> : * @brief Inserts a range into the %list. -<span class="lineNum"> 969 </span> : * @param position An iterator into the %list. -<span class="lineNum"> 970 </span> : * @param first An input iterator. -<span class="lineNum"> 971 </span> : * @param last An input iterator. -<span class="lineNum"> 972 </span> : * -<span class="lineNum"> 973 </span> : * This function will insert copies of the data in the range [@a -<span class="lineNum"> 974 </span> : * first,@a last) into the %list before the location specified by -<span class="lineNum"> 975 </span> : * @a position. -<span class="lineNum"> 976 </span> : * -<span class="lineNum"> 977 </span> : * This operation is linear in the number of elements inserted and -<span class="lineNum"> 978 </span> : * does not invalidate iterators and references. -<span class="lineNum"> 979 </span> : */ -<span class="lineNum"> 980 </span> : template<typename _InputIterator> -<span class="lineNum"> 981 </span> : void -<span class="lineNum"> 982 </span> : insert(iterator __position, _InputIterator __first, -<span class="lineNum"> 983 </span> : _InputIterator __last) -<span class="lineNum"> 984 </span> : { -<span class="lineNum"> 985 </span> : list __tmp(__first, __last, _M_get_Node_allocator()); -<span class="lineNum"> 986 </span> : splice(__position, __tmp); -<span class="lineNum"> 987 </span> : } -<span class="lineNum"> 988 </span> : -<span class="lineNum"> 989 </span> : /** -<span class="lineNum"> 990 </span> : * @brief Remove element at given position. -<span class="lineNum"> 991 </span> : * @param position Iterator pointing to element to be erased. -<span class="lineNum"> 992 </span> : * @return An iterator pointing to the next element (or end()). -<span class="lineNum"> 993 </span> : * -<span class="lineNum"> 994 </span> : * This function will erase the element at the given position and thus -<span class="lineNum"> 995 </span> : * shorten the %list by one. -<span class="lineNum"> 996 </span> : * -<span class="lineNum"> 997 </span> : * Due to the nature of a %list this operation can be done in -<span class="lineNum"> 998 </span> : * constant time, and only invalidates iterators/references to -<span class="lineNum"> 999 </span> : * the element being removed. The user is also cautioned that -<span class="lineNum"> 1000 </span> : * this function only erases the element, and that if the element -<span class="lineNum"> 1001 </span> : * is itself a pointer, the pointed-to memory is not touched in -<span class="lineNum"> 1002 </span> : * any way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 1003 </span> : */ -<span class="lineNum"> 1004 </span> : iterator -<span class="lineNum"> 1005 </span> : erase(iterator __position); -<span class="lineNum"> 1006 </span> : -<span class="lineNum"> 1007 </span> : /** -<span class="lineNum"> 1008 </span> : * @brief Remove a range of elements. -<span class="lineNum"> 1009 </span> : * @param first Iterator pointing to the first element to be erased. -<span class="lineNum"> 1010 </span> : * @param last Iterator pointing to one past the last element to be -<span class="lineNum"> 1011 </span> : * erased. -<span class="lineNum"> 1012 </span> : * @return An iterator pointing to the element pointed to by @a last -<span class="lineNum"> 1013 </span> : * prior to erasing (or end()). -<span class="lineNum"> 1014 </span> : * -<span class="lineNum"> 1015 </span> : * This function will erase the elements in the range @a -<span class="lineNum"> 1016 </span> : * [first,last) and shorten the %list accordingly. -<span class="lineNum"> 1017 </span> : * -<span class="lineNum"> 1018 </span> : * This operation is linear time in the size of the range and only -<span class="lineNum"> 1019 </span> : * invalidates iterators/references to the element being removed. -<span class="lineNum"> 1020 </span> : * The user is also cautioned that this function only erases the -<span class="lineNum"> 1021 </span> : * elements, and that if the elements themselves are pointers, the -<span class="lineNum"> 1022 </span> : * pointed-to memory is not touched in any way. Managing the pointer -<span class="lineNum"> 1023 </span> : * is the user's responsibility. -<span class="lineNum"> 1024 </span> : */ -<span class="lineNum"> 1025 </span> : iterator -<span class="lineNum"> 1026 </span> : erase(iterator __first, iterator __last) -<span class="lineNum"> 1027 </span> : { -<span class="lineNum"> 1028 </span> : while (__first != __last) -<span class="lineNum"> 1029 </span> : __first = erase(__first); -<span class="lineNum"> 1030 </span> : return __last; -<span class="lineNum"> 1031 </span> : } -<span class="lineNum"> 1032 </span> : -<span class="lineNum"> 1033 </span> : /** -<span class="lineNum"> 1034 </span> : * @brief Swaps data with another %list. -<span class="lineNum"> 1035 </span> : * @param x A %list of the same element and allocator types. -<span class="lineNum"> 1036 </span> : * -<span class="lineNum"> 1037 </span> : * This exchanges the elements between two lists in constant -<span class="lineNum"> 1038 </span> : * time. Note that the global std::swap() function is -<span class="lineNum"> 1039 </span> : * specialized such that std::swap(l1,l2) will feed to this -<span class="lineNum"> 1040 </span> : * function. -<span class="lineNum"> 1041 </span> : */ -<span class="lineNum"> 1042 </span> : void -<span class="lineNum"> 1043 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1044 </span> : swap(list&& __x) -<span class="lineNum"> 1045 </span> : #else -<span class="lineNum"> 1046 </span> : swap(list& __x) -<span class="lineNum"> 1047 </span> : #endif -<span class="lineNum"> 1048 </span> : { -<span class="lineNum"> 1049 </span> : _List_node_base::swap(this->_M_impl._M_node, __x._M_impl._M_node); -<span class="lineNum"> 1050 </span> : -<span class="lineNum"> 1051 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1052 </span> : // 431. Swapping containers with unequal allocators. -<span class="lineNum"> 1053 </span> : std::__alloc_swap<typename _Base::_Node_alloc_type>:: -<span class="lineNum"> 1054 </span> : _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator()); -<span class="lineNum"> 1055 </span> : } -<span class="lineNum"> 1056 </span> : -<span class="lineNum"> 1057 </span> : /** -<span class="lineNum"> 1058 </span> : * Erases all the elements. Note that this function only erases -<span class="lineNum"> 1059 </span> : * the elements, and that if the elements themselves are -<span class="lineNum"> 1060 </span> : * pointers, the pointed-to memory is not touched in any way. -<span class="lineNum"> 1061 </span> : * Managing the pointer is the user's responsibility. -<span class="lineNum"> 1062 </span> : */ -<span class="lineNum"> 1063 </span> : void -<span class="lineNum"> 1064 </span> : clear() -<span class="lineNum"> 1065 </span> : { -<span class="lineNum"> 1066 </span> : _Base::_M_clear(); -<span class="lineNum"> 1067 </span> : _Base::_M_init(); -<span class="lineNum"> 1068 </span> : } -<span class="lineNum"> 1069 </span> : -<span class="lineNum"> 1070 </span> : // [23.2.2.4] list operations -<span class="lineNum"> 1071 </span> : /** -<span class="lineNum"> 1072 </span> : * @brief Insert contents of another %list. -<span class="lineNum"> 1073 </span> : * @param position Iterator referencing the element to insert before. -<span class="lineNum"> 1074 </span> : * @param x Source list. -<span class="lineNum"> 1075 </span> : * -<span class="lineNum"> 1076 </span> : * The elements of @a x are inserted in constant time in front of -<span class="lineNum"> 1077 </span> : * the element referenced by @a position. @a x becomes an empty -<span class="lineNum"> 1078 </span> : * list. -<span class="lineNum"> 1079 </span> : * -<span class="lineNum"> 1080 </span> : * Requires this != @a x. -<span class="lineNum"> 1081 </span> : */ -<span class="lineNum"> 1082 </span> : void -<span class="lineNum"> 1083 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1084 </span> : splice(iterator __position, list&& __x) -<span class="lineNum"> 1085 </span> : #else -<span class="lineNum"> 1086 </span> : splice(iterator __position, list& __x) -<span class="lineNum"> 1087 </span> : #endif -<span class="lineNum"> 1088 </span> : { -<span class="lineNum"> 1089 </span> : if (!__x.empty()) -<span class="lineNum"> 1090 </span> : { -<span class="lineNum"> 1091 </span> : _M_check_equal_allocators(__x); -<span class="lineNum"> 1092 </span> : -<span class="lineNum"> 1093 </span> : this->_M_transfer(__position, __x.begin(), __x.end()); -<span class="lineNum"> 1094 </span> : } -<span class="lineNum"> 1095 </span> : } -<span class="lineNum"> 1096 </span> : -<span class="lineNum"> 1097 </span> : /** -<span class="lineNum"> 1098 </span> : * @brief Insert element from another %list. -<span class="lineNum"> 1099 </span> : * @param position Iterator referencing the element to insert before. -<span class="lineNum"> 1100 </span> : * @param x Source list. -<span class="lineNum"> 1101 </span> : * @param i Iterator referencing the element to move. -<span class="lineNum"> 1102 </span> : * -<span class="lineNum"> 1103 </span> : * Removes the element in list @a x referenced by @a i and -<span class="lineNum"> 1104 </span> : * inserts it into the current list before @a position. -<span class="lineNum"> 1105 </span> : */ -<span class="lineNum"> 1106 </span> : void -<span class="lineNum"> 1107 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1108 </span> : splice(iterator __position, list&& __x, iterator __i) -<span class="lineNum"> 1109 </span> : #else -<span class="lineNum"> 1110 </span> : splice(iterator __position, list& __x, iterator __i) -<span class="lineNum"> 1111 </span> : #endif -<span class="lineNum"> 1112 </span> : { -<span class="lineNum"> 1113 </span> : iterator __j = __i; -<span class="lineNum"> 1114 </span> : ++__j; -<span class="lineNum"> 1115 </span> : if (__position == __i || __position == __j) -<span class="lineNum"> 1116 </span> : return; -<span class="lineNum"> 1117 </span> : -<span class="lineNum"> 1118 </span> : if (this != &__x) -<span class="lineNum"> 1119 </span> : _M_check_equal_allocators(__x); -<span class="lineNum"> 1120 </span> : -<span class="lineNum"> 1121 </span> : this->_M_transfer(__position, __i, __j); -<span class="lineNum"> 1122 </span> : } -<span class="lineNum"> 1123 </span> : -<span class="lineNum"> 1124 </span> : /** -<span class="lineNum"> 1125 </span> : * @brief Insert range from another %list. -<span class="lineNum"> 1126 </span> : * @param position Iterator referencing the element to insert before. -<span class="lineNum"> 1127 </span> : * @param x Source list. -<span class="lineNum"> 1128 </span> : * @param first Iterator referencing the start of range in x. -<span class="lineNum"> 1129 </span> : * @param last Iterator referencing the end of range in x. -<span class="lineNum"> 1130 </span> : * -<span class="lineNum"> 1131 </span> : * Removes elements in the range [first,last) and inserts them -<span class="lineNum"> 1132 </span> : * before @a position in constant time. -<span class="lineNum"> 1133 </span> : * -<span class="lineNum"> 1134 </span> : * Undefined if @a position is in [first,last). -<span class="lineNum"> 1135 </span> : */ -<span class="lineNum"> 1136 </span> : void -<span class="lineNum"> 1137 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1138 </span> : splice(iterator __position, list&& __x, iterator __first, -<span class="lineNum"> 1139 </span> : iterator __last) -<span class="lineNum"> 1140 </span> : #else -<span class="lineNum"> 1141 </span> : splice(iterator __position, list& __x, iterator __first, -<span class="lineNum"> 1142 </span> : iterator __last) -<span class="lineNum"> 1143 </span> : #endif -<span class="lineNum"> 1144 </span> : { -<span class="lineNum"> 1145 </span> : if (__first != __last) -<span class="lineNum"> 1146 </span> : { -<span class="lineNum"> 1147 </span> : if (this != &__x) -<span class="lineNum"> 1148 </span> : _M_check_equal_allocators(__x); -<span class="lineNum"> 1149 </span> : -<span class="lineNum"> 1150 </span> : this->_M_transfer(__position, __first, __last); -<span class="lineNum"> 1151 </span> : } -<span class="lineNum"> 1152 </span> : } -<span class="lineNum"> 1153 </span> : -<span class="lineNum"> 1154 </span> : /** -<span class="lineNum"> 1155 </span> : * @brief Remove all elements equal to value. -<span class="lineNum"> 1156 </span> : * @param value The value to remove. -<span class="lineNum"> 1157 </span> : * -<span class="lineNum"> 1158 </span> : * Removes every element in the list equal to @a value. -<span class="lineNum"> 1159 </span> : * Remaining elements stay in list order. Note that this -<span class="lineNum"> 1160 </span> : * function only erases the elements, and that if the elements -<span class="lineNum"> 1161 </span> : * themselves are pointers, the pointed-to memory is not -<span class="lineNum"> 1162 </span> : * touched in any way. Managing the pointer is the user's -<span class="lineNum"> 1163 </span> : * responsibility. -<span class="lineNum"> 1164 </span> : */ -<span class="lineNum"> 1165 </span> : void -<span class="lineNum"> 1166 </span> : remove(const _Tp& __value); -<span class="lineNum"> 1167 </span> : -<span class="lineNum"> 1168 </span> : /** -<span class="lineNum"> 1169 </span> : * @brief Remove all elements satisfying a predicate. -<span class="lineNum"> 1170 </span> : * @param Predicate Unary predicate function or object. -<span class="lineNum"> 1171 </span> : * -<span class="lineNum"> 1172 </span> : * Removes every element in the list for which the predicate -<span class="lineNum"> 1173 </span> : * returns true. Remaining elements stay in list order. Note -<span class="lineNum"> 1174 </span> : * that this function only erases the elements, and that if the -<span class="lineNum"> 1175 </span> : * elements themselves are pointers, the pointed-to memory is -<span class="lineNum"> 1176 </span> : * not touched in any way. Managing the pointer is the user's -<span class="lineNum"> 1177 </span> : * responsibility. -<span class="lineNum"> 1178 </span> : */ -<span class="lineNum"> 1179 </span> : template<typename _Predicate> -<span class="lineNum"> 1180 </span> : void -<span class="lineNum"> 1181 </span> : remove_if(_Predicate); -<span class="lineNum"> 1182 </span> : -<span class="lineNum"> 1183 </span> : /** -<span class="lineNum"> 1184 </span> : * @brief Remove consecutive duplicate elements. -<span class="lineNum"> 1185 </span> : * -<span class="lineNum"> 1186 </span> : * For each consecutive set of elements with the same value, -<span class="lineNum"> 1187 </span> : * remove all but the first one. Remaining elements stay in -<span class="lineNum"> 1188 </span> : * list order. Note that this function only erases the -<span class="lineNum"> 1189 </span> : * elements, and that if the elements themselves are pointers, -<span class="lineNum"> 1190 </span> : * the pointed-to memory is not touched in any way. Managing -<span class="lineNum"> 1191 </span> : * the pointer is the user's responsibility. -<span class="lineNum"> 1192 </span> : */ -<span class="lineNum"> 1193 </span> : void -<span class="lineNum"> 1194 </span> : unique(); -<span class="lineNum"> 1195 </span> : -<span class="lineNum"> 1196 </span> : /** -<span class="lineNum"> 1197 </span> : * @brief Remove consecutive elements satisfying a predicate. -<span class="lineNum"> 1198 </span> : * @param BinaryPredicate Binary predicate function or object. -<span class="lineNum"> 1199 </span> : * -<span class="lineNum"> 1200 </span> : * For each consecutive set of elements [first,last) that -<span class="lineNum"> 1201 </span> : * satisfy predicate(first,i) where i is an iterator in -<span class="lineNum"> 1202 </span> : * [first,last), remove all but the first one. Remaining -<span class="lineNum"> 1203 </span> : * elements stay in list order. Note that this function only -<span class="lineNum"> 1204 </span> : * erases the elements, and that if the elements themselves are -<span class="lineNum"> 1205 </span> : * pointers, the pointed-to memory is not touched in any way. -<span class="lineNum"> 1206 </span> : * Managing the pointer is the user's responsibility. -<span class="lineNum"> 1207 </span> : */ -<span class="lineNum"> 1208 </span> : template<typename _BinaryPredicate> -<span class="lineNum"> 1209 </span> : void -<span class="lineNum"> 1210 </span> : unique(_BinaryPredicate); -<span class="lineNum"> 1211 </span> : -<span class="lineNum"> 1212 </span> : /** -<span class="lineNum"> 1213 </span> : * @brief Merge sorted lists. -<span class="lineNum"> 1214 </span> : * @param x Sorted list to merge. -<span class="lineNum"> 1215 </span> : * -<span class="lineNum"> 1216 </span> : * Assumes that both @a x and this list are sorted according to -<span class="lineNum"> 1217 </span> : * operator<(). Merges elements of @a x into this list in -<span class="lineNum"> 1218 </span> : * sorted order, leaving @a x empty when complete. Elements in -<span class="lineNum"> 1219 </span> : * this list precede elements in @a x that are equal. -<span class="lineNum"> 1220 </span> : */ -<span class="lineNum"> 1221 </span> : void -<span class="lineNum"> 1222 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1223 </span> : merge(list&& __x); -<span class="lineNum"> 1224 </span> : #else -<span class="lineNum"> 1225 </span> : merge(list& __x); -<span class="lineNum"> 1226 </span> : #endif -<span class="lineNum"> 1227 </span> : -<span class="lineNum"> 1228 </span> : /** -<span class="lineNum"> 1229 </span> : * @brief Merge sorted lists according to comparison function. -<span class="lineNum"> 1230 </span> : * @param x Sorted list to merge. -<span class="lineNum"> 1231 </span> : * @param StrictWeakOrdering Comparison function defining -<span class="lineNum"> 1232 </span> : * sort order. -<span class="lineNum"> 1233 </span> : * -<span class="lineNum"> 1234 </span> : * Assumes that both @a x and this list are sorted according to -<span class="lineNum"> 1235 </span> : * StrictWeakOrdering. Merges elements of @a x into this list -<span class="lineNum"> 1236 </span> : * in sorted order, leaving @a x empty when complete. Elements -<span class="lineNum"> 1237 </span> : * in this list precede elements in @a x that are equivalent -<span class="lineNum"> 1238 </span> : * according to StrictWeakOrdering(). -<span class="lineNum"> 1239 </span> : */ -<span class="lineNum"> 1240 </span> : template<typename _StrictWeakOrdering> -<span class="lineNum"> 1241 </span> : void -<span class="lineNum"> 1242 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1243 </span> : merge(list&&, _StrictWeakOrdering); -<span class="lineNum"> 1244 </span> : #else -<span class="lineNum"> 1245 </span> : merge(list&, _StrictWeakOrdering); -<span class="lineNum"> 1246 </span> : #endif -<span class="lineNum"> 1247 </span> : -<span class="lineNum"> 1248 </span> : /** -<span class="lineNum"> 1249 </span> : * @brief Reverse the elements in list. -<span class="lineNum"> 1250 </span> : * -<span class="lineNum"> 1251 </span> : * Reverse the order of elements in the list in linear time. -<span class="lineNum"> 1252 </span> : */ -<span class="lineNum"> 1253 </span> : void -<span class="lineNum"> 1254 </span> : reverse() -<span class="lineNum"> 1255 </span> : { this->_M_impl._M_node.reverse(); } -<span class="lineNum"> 1256 </span> : -<span class="lineNum"> 1257 </span> : /** -<span class="lineNum"> 1258 </span> : * @brief Sort the elements. -<span class="lineNum"> 1259 </span> : * -<span class="lineNum"> 1260 </span> : * Sorts the elements of this list in NlogN time. Equivalent -<span class="lineNum"> 1261 </span> : * elements remain in list order. -<span class="lineNum"> 1262 </span> : */ -<span class="lineNum"> 1263 </span> : void -<span class="lineNum"> 1264 </span> : sort(); -<span class="lineNum"> 1265 </span> : -<span class="lineNum"> 1266 </span> : /** -<span class="lineNum"> 1267 </span> : * @brief Sort the elements according to comparison function. -<span class="lineNum"> 1268 </span> : * -<span class="lineNum"> 1269 </span> : * Sorts the elements of this list in NlogN time. Equivalent -<span class="lineNum"> 1270 </span> : * elements remain in list order. -<span class="lineNum"> 1271 </span> : */ -<span class="lineNum"> 1272 </span> : template<typename _StrictWeakOrdering> -<span class="lineNum"> 1273 </span> : void -<span class="lineNum"> 1274 </span> : sort(_StrictWeakOrdering); -<span class="lineNum"> 1275 </span> : -<span class="lineNum"> 1276 </span> : protected: -<span class="lineNum"> 1277 </span> : // Internal constructor functions follow. -<span class="lineNum"> 1278 </span> : -<span class="lineNum"> 1279 </span> : // Called by the range constructor to implement [23.1.1]/9 -<span class="lineNum"> 1280 </span> : -<span class="lineNum"> 1281 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1282 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1283 </span> : template<typename _Integer> -<span class="lineNum"> 1284 </span> : void -<span class="lineNum"> 1285 </span> : _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) -<span class="lineNum"> 1286 </span> : { _M_fill_initialize(static_cast<size_type>(__n), __x); } -<span class="lineNum"> 1287 </span> : -<span class="lineNum"> 1288 </span> : // Called by the range constructor to implement [23.1.1]/9 -<span class="lineNum"> 1289 </span> : template<typename _InputIterator> -<span class="lineNum"> 1290 </span> : void -<span class="lineNum"> 1291 </span> : _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1292 </span> : __false_type) -<span class="lineNum"> 1293 </span> : { -<span class="lineNum"> 1294 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 1295 </span> : push_back(*__first); -<span class="lineNum"> 1296 </span> : } -<span class="lineNum"> 1297 </span> : -<span class="lineNum"> 1298 </span> : // Called by list(n,v,a), and the range constructor when it turns out -<span class="lineNum"> 1299 </span> : // to be the same thing. -<span class="lineNum"> 1300 </span> : void -<span class="lineNum"> 1301 </span> : _M_fill_initialize(size_type __n, const value_type& __x) -<span class="lineNum"> 1302 </span> : { -<span class="lineNum"> 1303 </span> : for (; __n > 0; --__n) -<span class="lineNum"> 1304 </span> : push_back(__x); -<span class="lineNum"> 1305 </span> : } -<span class="lineNum"> 1306 </span> : -<span class="lineNum"> 1307 </span> : -<span class="lineNum"> 1308 </span> : // Internal assign functions follow. -<span class="lineNum"> 1309 </span> : -<span class="lineNum"> 1310 </span> : // Called by the range assign to implement [23.1.1]/9 -<span class="lineNum"> 1311 </span> : -<span class="lineNum"> 1312 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1313 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1314 </span> : template<typename _Integer> -<span class="lineNum"> 1315 </span> : void -<span class="lineNum"> 1316 </span> : _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) -<span class="lineNum"> 1317 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 1318 </span> : -<span class="lineNum"> 1319 </span> : // Called by the range assign to implement [23.1.1]/9 -<span class="lineNum"> 1320 </span> : template<typename _InputIterator> -<span class="lineNum"> 1321 </span> : void -<span class="lineNum"> 1322 </span> : _M_assign_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1323 </span> : __false_type); -<span class="lineNum"> 1324 </span> : -<span class="lineNum"> 1325 </span> : // Called by assign(n,t), and the range assign when it turns out -<span class="lineNum"> 1326 </span> : // to be the same thing. -<span class="lineNum"> 1327 </span> : void -<span class="lineNum"> 1328 </span> : _M_fill_assign(size_type __n, const value_type& __val); -<span class="lineNum"> 1329 </span> : -<span class="lineNum"> 1330 </span> : -<span class="lineNum"> 1331 </span> : // Moves the elements from [first,last) before position. -<span class="lineNum"> 1332 </span> : void -<span class="lineNum"> 1333 </span> : _M_transfer(iterator __position, iterator __first, iterator __last) -<span class="lineNum"> 1334 </span> : { __position._M_node->transfer(__first._M_node, __last._M_node); } -<span class="lineNum"> 1335 </span> : -<span class="lineNum"> 1336 </span> : // Inserts new element at position given and with value given. -<span class="lineNum"> 1337 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1338 </span> : void -<span class="lineNum"> 1339 </span><span class="lineCov"> 47 : _M_insert(iterator __position, const value_type& __x)</span> -<span class="lineNum"> 1340 </span> : { -<span class="lineNum"> 1341 </span><span class="lineCov"> 47 : _Node* __tmp = _M_create_node(__x);</span> -<span class="lineNum"> 1342 </span><span class="lineCov"> 47 : __tmp->hook(__position._M_node);</span> -<span class="lineNum"> 1343 </span><span class="lineCov"> 47 : }</span> -<span class="lineNum"> 1344 </span> : #else -<span class="lineNum"> 1345 </span> : template<typename... _Args> -<span class="lineNum"> 1346 </span> : void -<span class="lineNum"> 1347 </span> : _M_insert(iterator __position, _Args&&... __args) -<span class="lineNum"> 1348 </span> : { -<span class="lineNum"> 1349 </span> : _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...); -<span class="lineNum"> 1350 </span> : __tmp->hook(__position._M_node); -<span class="lineNum"> 1351 </span> : } -<span class="lineNum"> 1352 </span> : #endif -<span class="lineNum"> 1353 </span> : -<span class="lineNum"> 1354 </span> : // Erases element at position given. -<span class="lineNum"> 1355 </span> : void -<span class="lineNum"> 1356 </span><span class="lineCov"> 25 : _M_erase(iterator __position)</span> -<span class="lineNum"> 1357 </span> : { -<span class="lineNum"> 1358 </span><span class="lineCov"> 25 : __position._M_node->unhook();</span> -<span class="lineNum"> 1359 </span><span class="lineCov"> 25 : _Node* __n = static_cast<_Node*>(__position._M_node);</span> -<span class="lineNum"> 1360 </span><span class="lineCov"> 25 : _M_get_Tp_allocator().destroy(&__n->_M_data);</span> -<span class="lineNum"> 1361 </span><span class="lineCov"> 25 : _M_put_node(__n);</span> -<span class="lineNum"> 1362 </span><span class="lineCov"> 25 : }</span> -<span class="lineNum"> 1363 </span> : -<span class="lineNum"> 1364 </span> : // To implement the splice (and merge) bits of N1599. -<span class="lineNum"> 1365 </span> : void -<span class="lineNum"> 1366 </span> : _M_check_equal_allocators(list& __x) -<span class="lineNum"> 1367 </span> : { -<span class="lineNum"> 1368 </span> : if (std::__alloc_neq<typename _Base::_Node_alloc_type>:: -<span class="lineNum"> 1369 </span> : _S_do_it(_M_get_Node_allocator(), __x._M_get_Node_allocator())) -<span class="lineNum"> 1370 </span> : __throw_runtime_error(__N("list::_M_check_equal_allocators")); -<span class="lineNum"> 1371 </span> : } -<span class="lineNum"> 1372 </span> : }; -<span class="lineNum"> 1373 </span> : -<span class="lineNum"> 1374 </span> : /** -<span class="lineNum"> 1375 </span> : * @brief List equality comparison. -<span class="lineNum"> 1376 </span> : * @param x A %list. -<span class="lineNum"> 1377 </span> : * @param y A %list of the same type as @a x. -<span class="lineNum"> 1378 </span> : * @return True iff the size and elements of the lists are equal. -<span class="lineNum"> 1379 </span> : * -<span class="lineNum"> 1380 </span> : * This is an equivalence relation. It is linear in the size of -<span class="lineNum"> 1381 </span> : * the lists. Lists are considered equivalent if their sizes are -<span class="lineNum"> 1382 </span> : * equal, and if corresponding elements compare equal. -<span class="lineNum"> 1383 </span> : */ -<span class="lineNum"> 1384 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1385 </span> : inline bool -<span class="lineNum"> 1386 </span><span class="lineCov"> 4 : operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)</span> -<span class="lineNum"> 1387 </span> : { -<span class="lineNum"> 1388 </span> : typedef typename list<_Tp, _Alloc>::const_iterator const_iterator; -<span class="lineNum"> 1389 </span><span class="lineCov"> 4 : const_iterator __end1 = __x.end();</span> -<span class="lineNum"> 1390 </span><span class="lineCov"> 4 : const_iterator __end2 = __y.end();</span> -<span class="lineNum"> 1391 </span> : -<span class="lineNum"> 1392 </span><span class="lineCov"> 4 : const_iterator __i1 = __x.begin();</span> -<span class="lineNum"> 1393 </span><span class="lineCov"> 4 : const_iterator __i2 = __y.begin();</span> -<span class="lineNum"> 1394 </span><span class="lineCov"> 12 : while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2)</span> -<span class="lineNum"> 1395 </span> : { -<span class="lineNum"> 1396 </span><span class="lineCov"> 4 : ++__i1;</span> -<span class="lineNum"> 1397 </span><span class="lineCov"> 4 : ++__i2;</span> -<span class="lineNum"> 1398 </span> : } -<span class="lineNum"> 1399 </span><span class="lineCov"> 4 : return __i1 == __end1 && __i2 == __end2;</span> -<span class="lineNum"> 1400 </span> : } -<span class="lineNum"> 1401 </span> : -<span class="lineNum"> 1402 </span> : /** -<span class="lineNum"> 1403 </span> : * @brief List ordering relation. -<span class="lineNum"> 1404 </span> : * @param x A %list. -<span class="lineNum"> 1405 </span> : * @param y A %list of the same type as @a x. -<span class="lineNum"> 1406 </span> : * @return True iff @a x is lexicographically less than @a y. -<span class="lineNum"> 1407 </span> : * -<span class="lineNum"> 1408 </span> : * This is a total ordering relation. It is linear in the size of the -<span class="lineNum"> 1409 </span> : * lists. The elements must be comparable with @c <. -<span class="lineNum"> 1410 </span> : * -<span class="lineNum"> 1411 </span> : * See std::lexicographical_compare() for how the determination is made. -<span class="lineNum"> 1412 </span> : */ -<span class="lineNum"> 1413 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1414 </span> : inline bool -<span class="lineNum"> 1415 </span> : operator<(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) -<span class="lineNum"> 1416 </span> : { return std::lexicographical_compare(__x.begin(), __x.end(), -<span class="lineNum"> 1417 </span> : __y.begin(), __y.end()); } -<span class="lineNum"> 1418 </span> : -<span class="lineNum"> 1419 </span> : /// Based on operator== -<span class="lineNum"> 1420 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1421 </span> : inline bool -<span class="lineNum"> 1422 </span><span class="lineCov"> 2 : operator!=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y)</span> -<span class="lineNum"> 1423 </span><span class="lineCov"> 2 : { return !(__x == __y); }</span> -<span class="lineNum"> 1424 </span> : -<span class="lineNum"> 1425 </span> : /// Based on operator< -<span class="lineNum"> 1426 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1427 </span> : inline bool -<span class="lineNum"> 1428 </span> : operator>(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) -<span class="lineNum"> 1429 </span> : { return __y < __x; } -<span class="lineNum"> 1430 </span> : -<span class="lineNum"> 1431 </span> : /// Based on operator< -<span class="lineNum"> 1432 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1433 </span> : inline bool -<span class="lineNum"> 1434 </span> : operator<=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) -<span class="lineNum"> 1435 </span> : { return !(__y < __x); } -<span class="lineNum"> 1436 </span> : -<span class="lineNum"> 1437 </span> : /// Based on operator< -<span class="lineNum"> 1438 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1439 </span> : inline bool -<span class="lineNum"> 1440 </span> : operator>=(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) -<span class="lineNum"> 1441 </span> : { return !(__x < __y); } -<span class="lineNum"> 1442 </span> : -<span class="lineNum"> 1443 </span> : /// See std::list::swap(). -<span class="lineNum"> 1444 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1445 </span> : inline void -<span class="lineNum"> 1446 </span> : swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>& __y) -<span class="lineNum"> 1447 </span> : { __x.swap(__y); } -<span class="lineNum"> 1448 </span> : -<span class="lineNum"> 1449 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1450 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1451 </span> : inline void -<span class="lineNum"> 1452 </span> : swap(list<_Tp, _Alloc>&& __x, list<_Tp, _Alloc>& __y) -<span class="lineNum"> 1453 </span> : { __x.swap(__y); } -<span class="lineNum"> 1454 </span> : -<span class="lineNum"> 1455 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1456 </span> : inline void -<span class="lineNum"> 1457 </span> : swap(list<_Tp, _Alloc>& __x, list<_Tp, _Alloc>&& __y) -<span class="lineNum"> 1458 </span> : { __x.swap(__y); } -<span class="lineNum"> 1459 </span> : #endif -<span class="lineNum"> 1460 </span> : -<span class="lineNum"> 1461 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 1462 </span> : -<span class="lineNum"> 1463 </span> : #endif /* _STL_LIST_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_map.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_map.h.gcov.html deleted file mode 100644 index 6a8cb4e..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_map.h.gcov.html +++ /dev/null @@ -1,894 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_map.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_map.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">41</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">41</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Map implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_map.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_MAP_H -<span class="lineNum"> 63 </span> : #define _STL_MAP_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/functexcept.h> -<span class="lineNum"> 66 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : /** -<span class="lineNum"> 71 </span> : * @brief A standard container made up of (key,value) pairs, which can be -<span class="lineNum"> 72 </span> : * retrieved based on a key, in logarithmic time. -<span class="lineNum"> 73 </span> : * -<span class="lineNum"> 74 </span> : * @ingroup Containers -<span class="lineNum"> 75 </span> : * @ingroup Assoc_containers -<span class="lineNum"> 76 </span> : * -<span class="lineNum"> 77 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a -<span class="lineNum"> 78 </span> : * <a href="tables.html#66">reversible container</a>, and an -<span class="lineNum"> 79 </span> : * <a href="tables.html#69">associative container</a> (using unique keys). -<span class="lineNum"> 80 </span> : * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the -<span class="lineNum"> 81 </span> : * value_type is std::pair<const Key,T>. -<span class="lineNum"> 82 </span> : * -<span class="lineNum"> 83 </span> : * Maps support bidirectional iterators. -<span class="lineNum"> 84 </span> : * -<span class="lineNum"> 85 </span> : * The private tree data is declared exactly the same way for map and -<span class="lineNum"> 86 </span> : * multimap; the distinction is made entirely in how the tree functions are -<span class="lineNum"> 87 </span> : * called (*_unique versus *_equal, same as the standard). -<span class="lineNum"> 88 </span> : */ -<span class="lineNum"> 89 </span> : template <typename _Key, typename _Tp, typename _Compare = std::less<_Key>, -<span class="lineNum"> 90 </span> : typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > > -<span class="lineNum"> 91 </span> : class map -<span class="lineNum"> 92 </span><span class="lineCov"> 12304 : {</span> -<span class="lineNum"> 93 </span> : public: -<span class="lineNum"> 94 </span> : typedef _Key key_type; -<span class="lineNum"> 95 </span> : typedef _Tp mapped_type; -<span class="lineNum"> 96 </span> : typedef std::pair<const _Key, _Tp> value_type; -<span class="lineNum"> 97 </span> : typedef _Compare key_compare; -<span class="lineNum"> 98 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : private: -<span class="lineNum"> 101 </span> : // concept requirements -<span class="lineNum"> 102 </span> : typedef typename _Alloc::value_type _Alloc_value_type; -<span class="lineNum"> 103 </span> : __glibcxx_class_requires(_Tp, _SGIAssignableConcept) -<span class="lineNum"> 104 </span> : __glibcxx_class_requires4(_Compare, bool, _Key, _Key, -<span class="lineNum"> 105 </span> : _BinaryFunctionConcept) -<span class="lineNum"> 106 </span> : __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept) -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : public: -<span class="lineNum"> 109 </span> : class value_compare -<span class="lineNum"> 110 </span> : : public std::binary_function<value_type, value_type, bool> -<span class="lineNum"> 111 </span> : { -<span class="lineNum"> 112 </span> : friend class map<_Key, _Tp, _Compare, _Alloc>; -<span class="lineNum"> 113 </span> : protected: -<span class="lineNum"> 114 </span> : _Compare comp; -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : value_compare(_Compare __c) -<span class="lineNum"> 117 </span> : : comp(__c) { } -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : public: -<span class="lineNum"> 120 </span> : bool operator()(const value_type& __x, const value_type& __y) const -<span class="lineNum"> 121 </span> : { return comp(__x.first, __y.first); } -<span class="lineNum"> 122 </span> : }; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : private: -<span class="lineNum"> 125 </span> : /// This turns a red-black tree into a [multi]map. -<span class="lineNum"> 126 </span> : typedef typename _Alloc::template rebind<value_type>::other -<span class="lineNum"> 127 </span> : _Pair_alloc_type; -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : typedef _Rb_tree<key_type, value_type, _Select1st<value_type>, -<span class="lineNum"> 130 </span> : key_compare, _Pair_alloc_type> _Rep_type; -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : /// The actual tree structure. -<span class="lineNum"> 133 </span> : _Rep_type _M_t; -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : public: -<span class="lineNum"> 136 </span> : // many of these are specified differently in ISO, but the following are -<span class="lineNum"> 137 </span> : // "functionally equivalent" -<span class="lineNum"> 138 </span> : typedef typename _Pair_alloc_type::pointer pointer; -<span class="lineNum"> 139 </span> : typedef typename _Pair_alloc_type::const_pointer const_pointer; -<span class="lineNum"> 140 </span> : typedef typename _Pair_alloc_type::reference reference; -<span class="lineNum"> 141 </span> : typedef typename _Pair_alloc_type::const_reference const_reference; -<span class="lineNum"> 142 </span> : typedef typename _Rep_type::iterator iterator; -<span class="lineNum"> 143 </span> : typedef typename _Rep_type::const_iterator const_iterator; -<span class="lineNum"> 144 </span> : typedef typename _Rep_type::size_type size_type; -<span class="lineNum"> 145 </span> : typedef typename _Rep_type::difference_type difference_type; -<span class="lineNum"> 146 </span> : typedef typename _Rep_type::reverse_iterator reverse_iterator; -<span class="lineNum"> 147 </span> : typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : // [23.3.1.1] construct/copy/destroy -<span class="lineNum"> 150 </span> : // (get_allocator() is normally listed in this section, but seems to have -<span class="lineNum"> 151 </span> : // been accidentally omitted in the printed standard) -<span class="lineNum"> 152 </span> : /** -<span class="lineNum"> 153 </span> : * @brief Default constructor creates no elements. -<span class="lineNum"> 154 </span> : */ -<span class="lineNum"> 155 </span><span class="lineCov"> 2859 : map()</span> -<span class="lineNum"> 156 </span><span class="lineCov"> 2859 : : _M_t() { }</span> -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : /** -<span class="lineNum"> 159 </span> : * @brief Creates a %map with no elements. -<span class="lineNum"> 160 </span> : * @param comp A comparison object. -<span class="lineNum"> 161 </span> : * @param a An allocator object. -<span class="lineNum"> 162 </span> : */ -<span class="lineNum"> 163 </span> : explicit -<span class="lineNum"> 164 </span> : map(const _Compare& __comp, -<span class="lineNum"> 165 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 166 </span> : : _M_t(__comp, __a) { } -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : /** -<span class="lineNum"> 169 </span> : * @brief %Map copy constructor. -<span class="lineNum"> 170 </span> : * @param x A %map of identical element and allocator types. -<span class="lineNum"> 171 </span> : * -<span class="lineNum"> 172 </span> : * The newly-created %map uses a copy of the allocation object -<span class="lineNum"> 173 </span> : * used by @a x. -<span class="lineNum"> 174 </span> : */ -<span class="lineNum"> 175 </span><span class="lineCov"> 9445 : map(const map& __x)</span> -<span class="lineNum"> 176 </span><span class="lineCov"> 9445 : : _M_t(__x._M_t) { }</span> -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 179 </span> : /** -<span class="lineNum"> 180 </span> : * @brief %Map move constructor. -<span class="lineNum"> 181 </span> : * @param x A %map of identical element and allocator types. -<span class="lineNum"> 182 </span> : * -<span class="lineNum"> 183 </span> : * The newly-created %map contains the exact contents of @a x. -<span class="lineNum"> 184 </span> : * The contents of @a x are a valid, but unspecified %map. -<span class="lineNum"> 185 </span> : */ -<span class="lineNum"> 186 </span> : map(map&& __x) -<span class="lineNum"> 187 </span> : : _M_t(std::forward<_Rep_type>(__x._M_t)) { } -<span class="lineNum"> 188 </span> : #endif -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : /** -<span class="lineNum"> 191 </span> : * @brief Builds a %map from a range. -<span class="lineNum"> 192 </span> : * @param first An input iterator. -<span class="lineNum"> 193 </span> : * @param last An input iterator. -<span class="lineNum"> 194 </span> : * -<span class="lineNum"> 195 </span> : * Create a %map consisting of copies of the elements from [first,last). -<span class="lineNum"> 196 </span> : * This is linear in N if the range is already sorted, and NlogN -<span class="lineNum"> 197 </span> : * otherwise (where N is distance(first,last)). -<span class="lineNum"> 198 </span> : */ -<span class="lineNum"> 199 </span> : template<typename _InputIterator> -<span class="lineNum"> 200 </span> : map(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 201 </span> : : _M_t() -<span class="lineNum"> 202 </span> : { _M_t._M_insert_unique(__first, __last); } -<span class="lineNum"> 203 </span> : -<span class="lineNum"> 204 </span> : /** -<span class="lineNum"> 205 </span> : * @brief Builds a %map from a range. -<span class="lineNum"> 206 </span> : * @param first An input iterator. -<span class="lineNum"> 207 </span> : * @param last An input iterator. -<span class="lineNum"> 208 </span> : * @param comp A comparison functor. -<span class="lineNum"> 209 </span> : * @param a An allocator object. -<span class="lineNum"> 210 </span> : * -<span class="lineNum"> 211 </span> : * Create a %map consisting of copies of the elements from [first,last). -<span class="lineNum"> 212 </span> : * This is linear in N if the range is already sorted, and NlogN -<span class="lineNum"> 213 </span> : * otherwise (where N is distance(first,last)). -<span class="lineNum"> 214 </span> : */ -<span class="lineNum"> 215 </span> : template<typename _InputIterator> -<span class="lineNum"> 216 </span> : map(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 217 </span> : const _Compare& __comp, -<span class="lineNum"> 218 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 219 </span> : : _M_t(__comp, __a) -<span class="lineNum"> 220 </span> : { _M_t._M_insert_unique(__first, __last); } -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : // FIXME There is no dtor declared, but we should have something -<span class="lineNum"> 223 </span> : // generated by Doxygen. I don't know what tags to add to this -<span class="lineNum"> 224 </span> : // paragraph to make that happen: -<span class="lineNum"> 225 </span> : /** -<span class="lineNum"> 226 </span> : * The dtor only erases the elements, and note that if the elements -<span class="lineNum"> 227 </span> : * themselves are pointers, the pointed-to memory is not touched in any -<span class="lineNum"> 228 </span> : * way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 229 </span> : */ -<span class="lineNum"> 230 </span> : -<span class="lineNum"> 231 </span> : /** -<span class="lineNum"> 232 </span> : * @brief %Map assignment operator. -<span class="lineNum"> 233 </span> : * @param x A %map of identical element and allocator types. -<span class="lineNum"> 234 </span> : * -<span class="lineNum"> 235 </span> : * All the elements of @a x are copied, but unlike the copy constructor, -<span class="lineNum"> 236 </span> : * the allocator object is not copied. -<span class="lineNum"> 237 </span> : */ -<span class="lineNum"> 238 </span> : map& -<span class="lineNum"> 239 </span><span class="lineCov"> 17 : operator=(const map& __x)</span> -<span class="lineNum"> 240 </span> : { -<span class="lineNum"> 241 </span><span class="lineCov"> 17 : _M_t = __x._M_t;</span> -<span class="lineNum"> 242 </span><span class="lineCov"> 17 : return *this;</span> -<span class="lineNum"> 243 </span> : } -<span class="lineNum"> 244 </span> : -<span class="lineNum"> 245 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 246 </span> : /** -<span class="lineNum"> 247 </span> : * @brief %Map move assignment operator. -<span class="lineNum"> 248 </span> : * @param x A %map of identical element and allocator types. -<span class="lineNum"> 249 </span> : * -<span class="lineNum"> 250 </span> : * The contents of @a x are moved into this map (without copying). -<span class="lineNum"> 251 </span> : * @a x is a valid, but unspecified %map. -<span class="lineNum"> 252 </span> : */ -<span class="lineNum"> 253 </span> : map& -<span class="lineNum"> 254 </span> : operator=(map&& __x) -<span class="lineNum"> 255 </span> : { -<span class="lineNum"> 256 </span> : // NB: DR 675. -<span class="lineNum"> 257 </span> : this->clear(); -<span class="lineNum"> 258 </span> : this->swap(__x); -<span class="lineNum"> 259 </span> : return *this; -<span class="lineNum"> 260 </span> : } -<span class="lineNum"> 261 </span> : #endif -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : /// Get a copy of the memory allocation object. -<span class="lineNum"> 264 </span> : allocator_type -<span class="lineNum"> 265 </span> : get_allocator() const -<span class="lineNum"> 266 </span> : { return _M_t.get_allocator(); } -<span class="lineNum"> 267 </span> : -<span class="lineNum"> 268 </span> : // iterators -<span class="lineNum"> 269 </span> : /** -<span class="lineNum"> 270 </span> : * Returns a read/write iterator that points to the first pair in the -<span class="lineNum"> 271 </span> : * %map. -<span class="lineNum"> 272 </span> : * Iteration is done in ascending order according to the keys. -<span class="lineNum"> 273 </span> : */ -<span class="lineNum"> 274 </span> : iterator -<span class="lineNum"> 275 </span><span class="lineCov"> 2681 : begin()</span> -<span class="lineNum"> 276 </span><span class="lineCov"> 2681 : { return _M_t.begin(); }</span> -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : /** -<span class="lineNum"> 279 </span> : * Returns a read-only (constant) iterator that points to the first pair -<span class="lineNum"> 280 </span> : * in the %map. Iteration is done in ascending order according to the -<span class="lineNum"> 281 </span> : * keys. -<span class="lineNum"> 282 </span> : */ -<span class="lineNum"> 283 </span> : const_iterator -<span class="lineNum"> 284 </span><span class="lineCov"> 154 : begin() const</span> -<span class="lineNum"> 285 </span><span class="lineCov"> 154 : { return _M_t.begin(); }</span> -<span class="lineNum"> 286 </span> : -<span class="lineNum"> 287 </span> : /** -<span class="lineNum"> 288 </span> : * Returns a read/write iterator that points one past the last -<span class="lineNum"> 289 </span> : * pair in the %map. Iteration is done in ascending order -<span class="lineNum"> 290 </span> : * according to the keys. -<span class="lineNum"> 291 </span> : */ -<span class="lineNum"> 292 </span> : iterator -<span class="lineNum"> 293 </span><span class="lineCov"> 155879 : end()</span> -<span class="lineNum"> 294 </span><span class="lineCov"> 155879 : { return _M_t.end(); }</span> -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : /** -<span class="lineNum"> 297 </span> : * Returns a read-only (constant) iterator that points one past the last -<span class="lineNum"> 298 </span> : * pair in the %map. Iteration is done in ascending order according to -<span class="lineNum"> 299 </span> : * the keys. -<span class="lineNum"> 300 </span> : */ -<span class="lineNum"> 301 </span> : const_iterator -<span class="lineNum"> 302 </span><span class="lineCov"> 441802 : end() const</span> -<span class="lineNum"> 303 </span><span class="lineCov"> 441802 : { return _M_t.end(); }</span> -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : /** -<span class="lineNum"> 306 </span> : * Returns a read/write reverse iterator that points to the last pair in -<span class="lineNum"> 307 </span> : * the %map. Iteration is done in descending order according to the -<span class="lineNum"> 308 </span> : * keys. -<span class="lineNum"> 309 </span> : */ -<span class="lineNum"> 310 </span> : reverse_iterator -<span class="lineNum"> 311 </span> : rbegin() -<span class="lineNum"> 312 </span> : { return _M_t.rbegin(); } -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : /** -<span class="lineNum"> 315 </span> : * Returns a read-only (constant) reverse iterator that points to the -<span class="lineNum"> 316 </span> : * last pair in the %map. Iteration is done in descending order -<span class="lineNum"> 317 </span> : * according to the keys. -<span class="lineNum"> 318 </span> : */ -<span class="lineNum"> 319 </span> : const_reverse_iterator -<span class="lineNum"> 320 </span><span class="lineCov"> 32 : rbegin() const</span> -<span class="lineNum"> 321 </span><span class="lineCov"> 32 : { return _M_t.rbegin(); }</span> -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : /** -<span class="lineNum"> 324 </span> : * Returns a read/write reverse iterator that points to one before the -<span class="lineNum"> 325 </span> : * first pair in the %map. Iteration is done in descending order -<span class="lineNum"> 326 </span> : * according to the keys. -<span class="lineNum"> 327 </span> : */ -<span class="lineNum"> 328 </span> : reverse_iterator -<span class="lineNum"> 329 </span> : rend() -<span class="lineNum"> 330 </span> : { return _M_t.rend(); } -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : /** -<span class="lineNum"> 333 </span> : * Returns a read-only (constant) reverse iterator that points to one -<span class="lineNum"> 334 </span> : * before the first pair in the %map. Iteration is done in descending -<span class="lineNum"> 335 </span> : * order according to the keys. -<span class="lineNum"> 336 </span> : */ -<span class="lineNum"> 337 </span> : const_reverse_iterator -<span class="lineNum"> 338 </span> : rend() const -<span class="lineNum"> 339 </span> : { return _M_t.rend(); } -<span class="lineNum"> 340 </span> : -<span class="lineNum"> 341 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 342 </span> : /** -<span class="lineNum"> 343 </span> : * Returns a read-only (constant) iterator that points to the first pair -<span class="lineNum"> 344 </span> : * in the %map. Iteration is done in ascending order according to the -<span class="lineNum"> 345 </span> : * keys. -<span class="lineNum"> 346 </span> : */ -<span class="lineNum"> 347 </span> : const_iterator -<span class="lineNum"> 348 </span> : cbegin() const -<span class="lineNum"> 349 </span> : { return _M_t.begin(); } -<span class="lineNum"> 350 </span> : -<span class="lineNum"> 351 </span> : /** -<span class="lineNum"> 352 </span> : * Returns a read-only (constant) iterator that points one past the last -<span class="lineNum"> 353 </span> : * pair in the %map. Iteration is done in ascending order according to -<span class="lineNum"> 354 </span> : * the keys. -<span class="lineNum"> 355 </span> : */ -<span class="lineNum"> 356 </span> : const_iterator -<span class="lineNum"> 357 </span> : cend() const -<span class="lineNum"> 358 </span> : { return _M_t.end(); } -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : /** -<span class="lineNum"> 361 </span> : * Returns a read-only (constant) reverse iterator that points to the -<span class="lineNum"> 362 </span> : * last pair in the %map. Iteration is done in descending order -<span class="lineNum"> 363 </span> : * according to the keys. -<span class="lineNum"> 364 </span> : */ -<span class="lineNum"> 365 </span> : const_reverse_iterator -<span class="lineNum"> 366 </span> : crbegin() const -<span class="lineNum"> 367 </span> : { return _M_t.rbegin(); } -<span class="lineNum"> 368 </span> : -<span class="lineNum"> 369 </span> : /** -<span class="lineNum"> 370 </span> : * Returns a read-only (constant) reverse iterator that points to one -<span class="lineNum"> 371 </span> : * before the first pair in the %map. Iteration is done in descending -<span class="lineNum"> 372 </span> : * order according to the keys. -<span class="lineNum"> 373 </span> : */ -<span class="lineNum"> 374 </span> : const_reverse_iterator -<span class="lineNum"> 375 </span> : crend() const -<span class="lineNum"> 376 </span> : { return _M_t.rend(); } -<span class="lineNum"> 377 </span> : #endif -<span class="lineNum"> 378 </span> : -<span class="lineNum"> 379 </span> : // capacity -<span class="lineNum"> 380 </span> : /** Returns true if the %map is empty. (Thus begin() would equal -<span class="lineNum"> 381 </span> : * end().) -<span class="lineNum"> 382 </span> : */ -<span class="lineNum"> 383 </span> : bool -<span class="lineNum"> 384 </span><span class="lineCov"> 3939 : empty() const</span> -<span class="lineNum"> 385 </span><span class="lineCov"> 3939 : { return _M_t.empty(); }</span> -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span> : /** Returns the size of the %map. */ -<span class="lineNum"> 388 </span> : size_type -<span class="lineNum"> 389 </span><span class="lineCov"> 20 : size() const</span> -<span class="lineNum"> 390 </span><span class="lineCov"> 20 : { return _M_t.size(); }</span> -<span class="lineNum"> 391 </span> : -<span class="lineNum"> 392 </span> : /** Returns the maximum size of the %map. */ -<span class="lineNum"> 393 </span> : size_type -<span class="lineNum"> 394 </span> : max_size() const -<span class="lineNum"> 395 </span> : { return _M_t.max_size(); } -<span class="lineNum"> 396 </span> : -<span class="lineNum"> 397 </span> : // [23.3.1.2] element access -<span class="lineNum"> 398 </span> : /** -<span class="lineNum"> 399 </span> : * @brief Subscript ( @c [] ) access to %map data. -<span class="lineNum"> 400 </span> : * @param k The key for which data should be retrieved. -<span class="lineNum"> 401 </span> : * @return A reference to the data of the (key,data) %pair. -<span class="lineNum"> 402 </span> : * -<span class="lineNum"> 403 </span> : * Allows for easy lookup with the subscript ( @c [] ) -<span class="lineNum"> 404 </span> : * operator. Returns data associated with the key specified in -<span class="lineNum"> 405 </span> : * subscript. If the key does not exist, a pair with that key -<span class="lineNum"> 406 </span> : * is created using default values, which is then returned. -<span class="lineNum"> 407 </span> : * -<span class="lineNum"> 408 </span> : * Lookup requires logarithmic time. -<span class="lineNum"> 409 </span> : */ -<span class="lineNum"> 410 </span> : mapped_type& -<span class="lineNum"> 411 </span><span class="lineCov"> 6297 : operator[](const key_type& __k)</span> -<span class="lineNum"> 412 </span> : { -<span class="lineNum"> 413 </span> : // concept requirements -<span class="lineNum"> 414 </span> : __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>) -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span><span class="lineCov"> 6297 : iterator __i = lower_bound(__k);</span> -<span class="lineNum"> 417 </span> : // __i->first is greater than or equivalent to __k. -<span class="lineNum"> 418 </span><span class="lineCov"> 6297 : if (__i == end() || key_comp()(__k, (*__i).first))</span> -<span class="lineNum"> 419 </span><span class="lineCov"> 4149 : __i = insert(__i, value_type(__k, mapped_type()));</span> -<span class="lineNum"> 420 </span><span class="lineCov"> 6297 : return (*__i).second;</span> -<span class="lineNum"> 421 </span> : } -<span class="lineNum"> 422 </span> : -<span class="lineNum"> 423 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 424 </span> : // DR 464. Suggestion for new member functions in standard containers. -<span class="lineNum"> 425 </span> : /** -<span class="lineNum"> 426 </span> : * @brief Access to %map data. -<span class="lineNum"> 427 </span> : * @param k The key for which data should be retrieved. -<span class="lineNum"> 428 </span> : * @return A reference to the data whose key is equivalent to @a k, if -<span class="lineNum"> 429 </span> : * such a data is present in the %map. -<span class="lineNum"> 430 </span> : * @throw std::out_of_range If no such data is present. -<span class="lineNum"> 431 </span> : */ -<span class="lineNum"> 432 </span> : mapped_type& -<span class="lineNum"> 433 </span> : at(const key_type& __k) -<span class="lineNum"> 434 </span> : { -<span class="lineNum"> 435 </span> : iterator __i = lower_bound(__k); -<span class="lineNum"> 436 </span> : if (__i == end() || key_comp()(__k, (*__i).first)) -<span class="lineNum"> 437 </span> : __throw_out_of_range(__N("map::at")); -<span class="lineNum"> 438 </span> : return (*__i).second; -<span class="lineNum"> 439 </span> : } -<span class="lineNum"> 440 </span> : -<span class="lineNum"> 441 </span> : const mapped_type& -<span class="lineNum"> 442 </span> : at(const key_type& __k) const -<span class="lineNum"> 443 </span> : { -<span class="lineNum"> 444 </span> : const_iterator __i = lower_bound(__k); -<span class="lineNum"> 445 </span> : if (__i == end() || key_comp()(__k, (*__i).first)) -<span class="lineNum"> 446 </span> : __throw_out_of_range(__N("map::at")); -<span class="lineNum"> 447 </span> : return (*__i).second; -<span class="lineNum"> 448 </span> : } -<span class="lineNum"> 449 </span> : -<span class="lineNum"> 450 </span> : // modifiers -<span class="lineNum"> 451 </span> : /** -<span class="lineNum"> 452 </span> : * @brief Attempts to insert a std::pair into the %map. -<span class="lineNum"> 453 </span> : -<span class="lineNum"> 454 </span> : * @param x Pair to be inserted (see std::make_pair for easy creation -<span class="lineNum"> 455 </span> : * of pairs). -<span class="lineNum"> 456 </span> : -<span class="lineNum"> 457 </span> : * @return A pair, of which the first element is an iterator that -<span class="lineNum"> 458 </span> : * points to the possibly inserted pair, and the second is -<span class="lineNum"> 459 </span> : * a bool that is true if the pair was actually inserted. -<span class="lineNum"> 460 </span> : * -<span class="lineNum"> 461 </span> : * This function attempts to insert a (key, value) %pair into the %map. -<span class="lineNum"> 462 </span> : * A %map relies on unique keys and thus a %pair is only inserted if its -<span class="lineNum"> 463 </span> : * first element (the key) is not already present in the %map. -<span class="lineNum"> 464 </span> : * -<span class="lineNum"> 465 </span> : * Insertion requires logarithmic time. -<span class="lineNum"> 466 </span> : */ -<span class="lineNum"> 467 </span> : std::pair<iterator, bool> -<span class="lineNum"> 468 </span><span class="lineCov"> 101375 : insert(const value_type& __x)</span> -<span class="lineNum"> 469 </span><span class="lineCov"> 101375 : { return _M_t._M_insert_unique(__x); }</span> -<span class="lineNum"> 470 </span> : -<span class="lineNum"> 471 </span> : /** -<span class="lineNum"> 472 </span> : * @brief Attempts to insert a std::pair into the %map. -<span class="lineNum"> 473 </span> : * @param position An iterator that serves as a hint as to where the -<span class="lineNum"> 474 </span> : * pair should be inserted. -<span class="lineNum"> 475 </span> : * @param x Pair to be inserted (see std::make_pair for easy creation -<span class="lineNum"> 476 </span> : * of pairs). -<span class="lineNum"> 477 </span> : * @return An iterator that points to the element with key of @a x (may -<span class="lineNum"> 478 </span> : * or may not be the %pair passed in). -<span class="lineNum"> 479 </span> : * -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : * This function is not concerned about whether the insertion -<span class="lineNum"> 482 </span> : * took place, and thus does not return a boolean like the -<span class="lineNum"> 483 </span> : * single-argument insert() does. Note that the first -<span class="lineNum"> 484 </span> : * parameter is only a hint and can potentially improve the -<span class="lineNum"> 485 </span> : * performance of the insertion process. A bad hint would -<span class="lineNum"> 486 </span> : * cause no gains in efficiency. -<span class="lineNum"> 487 </span> : * -<span class="lineNum"> 488 </span> : * See -<span class="lineNum"> 489 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 -<span class="lineNum"> 490 </span> : * for more on "hinting". -<span class="lineNum"> 491 </span> : * -<span class="lineNum"> 492 </span> : * Insertion requires logarithmic time (if the hint is not taken). -<span class="lineNum"> 493 </span> : */ -<span class="lineNum"> 494 </span> : iterator -<span class="lineNum"> 495 </span><span class="lineCov"> 4149 : insert(iterator __position, const value_type& __x)</span> -<span class="lineNum"> 496 </span><span class="lineCov"> 4149 : { return _M_t._M_insert_unique_(__position, __x); }</span> -<span class="lineNum"> 497 </span> : -<span class="lineNum"> 498 </span> : /** -<span class="lineNum"> 499 </span> : * @brief Template function that attempts to insert a range of elements. -<span class="lineNum"> 500 </span> : * @param first Iterator pointing to the start of the range to be -<span class="lineNum"> 501 </span> : * inserted. -<span class="lineNum"> 502 </span> : * @param last Iterator pointing to the end of the range. -<span class="lineNum"> 503 </span> : * -<span class="lineNum"> 504 </span> : * Complexity similar to that of the range constructor. -<span class="lineNum"> 505 </span> : */ -<span class="lineNum"> 506 </span> : template<typename _InputIterator> -<span class="lineNum"> 507 </span> : void -<span class="lineNum"> 508 </span> : insert(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 509 </span> : { _M_t._M_insert_unique(__first, __last); } -<span class="lineNum"> 510 </span> : -<span class="lineNum"> 511 </span> : /** -<span class="lineNum"> 512 </span> : * @brief Erases an element from a %map. -<span class="lineNum"> 513 </span> : * @param position An iterator pointing to the element to be erased. -<span class="lineNum"> 514 </span> : * -<span class="lineNum"> 515 </span> : * This function erases an element, pointed to by the given -<span class="lineNum"> 516 </span> : * iterator, from a %map. Note that this function only erases -<span class="lineNum"> 517 </span> : * the element, and that if the element is itself a pointer, -<span class="lineNum"> 518 </span> : * the pointed-to memory is not touched in any way. Managing -<span class="lineNum"> 519 </span> : * the pointer is the user's responsibility. -<span class="lineNum"> 520 </span> : */ -<span class="lineNum"> 521 </span> : void -<span class="lineNum"> 522 </span> : erase(iterator __position) -<span class="lineNum"> 523 </span> : { _M_t.erase(__position); } -<span class="lineNum"> 524 </span> : -<span class="lineNum"> 525 </span> : /** -<span class="lineNum"> 526 </span> : * @brief Erases elements according to the provided key. -<span class="lineNum"> 527 </span> : * @param x Key of element to be erased. -<span class="lineNum"> 528 </span> : * @return The number of elements erased. -<span class="lineNum"> 529 </span> : * -<span class="lineNum"> 530 </span> : * This function erases all the elements located by the given key from -<span class="lineNum"> 531 </span> : * a %map. -<span class="lineNum"> 532 </span> : * Note that this function only erases the element, and that if -<span class="lineNum"> 533 </span> : * the element is itself a pointer, the pointed-to memory is not touched -<span class="lineNum"> 534 </span> : * in any way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 535 </span> : */ -<span class="lineNum"> 536 </span> : size_type -<span class="lineNum"> 537 </span> : erase(const key_type& __x) -<span class="lineNum"> 538 </span> : { return _M_t.erase(__x); } -<span class="lineNum"> 539 </span> : -<span class="lineNum"> 540 </span> : /** -<span class="lineNum"> 541 </span> : * @brief Erases a [first,last) range of elements from a %map. -<span class="lineNum"> 542 </span> : * @param first Iterator pointing to the start of the range to be -<span class="lineNum"> 543 </span> : * erased. -<span class="lineNum"> 544 </span> : * @param last Iterator pointing to the end of the range to be erased. -<span class="lineNum"> 545 </span> : * -<span class="lineNum"> 546 </span> : * This function erases a sequence of elements from a %map. -<span class="lineNum"> 547 </span> : * Note that this function only erases the element, and that if -<span class="lineNum"> 548 </span> : * the element is itself a pointer, the pointed-to memory is not touched -<span class="lineNum"> 549 </span> : * in any way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 550 </span> : */ -<span class="lineNum"> 551 </span> : void -<span class="lineNum"> 552 </span> : erase(iterator __first, iterator __last) -<span class="lineNum"> 553 </span> : { _M_t.erase(__first, __last); } -<span class="lineNum"> 554 </span> : -<span class="lineNum"> 555 </span> : /** -<span class="lineNum"> 556 </span> : * @brief Swaps data with another %map. -<span class="lineNum"> 557 </span> : * @param x A %map of the same element and allocator types. -<span class="lineNum"> 558 </span> : * -<span class="lineNum"> 559 </span> : * This exchanges the elements between two maps in constant -<span class="lineNum"> 560 </span> : * time. (It is only swapping a pointer, an integer, and an -<span class="lineNum"> 561 </span> : * instance of the @c Compare type (which itself is often -<span class="lineNum"> 562 </span> : * stateless and empty), so it should be quite fast.) Note -<span class="lineNum"> 563 </span> : * that the global std::swap() function is specialized such -<span class="lineNum"> 564 </span> : * that std::swap(m1,m2) will feed to this function. -<span class="lineNum"> 565 </span> : */ -<span class="lineNum"> 566 </span> : void -<span class="lineNum"> 567 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 568 </span> : swap(map&& __x) -<span class="lineNum"> 569 </span> : #else -<span class="lineNum"> 570 </span> : swap(map& __x) -<span class="lineNum"> 571 </span> : #endif -<span class="lineNum"> 572 </span> : { _M_t.swap(__x._M_t); } -<span class="lineNum"> 573 </span> : -<span class="lineNum"> 574 </span> : /** -<span class="lineNum"> 575 </span> : * Erases all elements in a %map. Note that this function only -<span class="lineNum"> 576 </span> : * erases the elements, and that if the elements themselves are -<span class="lineNum"> 577 </span> : * pointers, the pointed-to memory is not touched in any way. -<span class="lineNum"> 578 </span> : * Managing the pointer is the user's responsibility. -<span class="lineNum"> 579 </span> : */ -<span class="lineNum"> 580 </span> : void -<span class="lineNum"> 581 </span><span class="lineCov"> 3288 : clear()</span> -<span class="lineNum"> 582 </span><span class="lineCov"> 3288 : { _M_t.clear(); }</span> -<span class="lineNum"> 583 </span> : -<span class="lineNum"> 584 </span> : // observers -<span class="lineNum"> 585 </span> : /** -<span class="lineNum"> 586 </span> : * Returns the key comparison object out of which the %map was -<span class="lineNum"> 587 </span> : * constructed. -<span class="lineNum"> 588 </span> : */ -<span class="lineNum"> 589 </span> : key_compare -<span class="lineNum"> 590 </span><span class="lineCov"> 3296 : key_comp() const</span> -<span class="lineNum"> 591 </span><span class="lineCov"> 3296 : { return _M_t.key_comp(); }</span> -<span class="lineNum"> 592 </span> : -<span class="lineNum"> 593 </span> : /** -<span class="lineNum"> 594 </span> : * Returns a value comparison object, built from the key comparison -<span class="lineNum"> 595 </span> : * object out of which the %map was constructed. -<span class="lineNum"> 596 </span> : */ -<span class="lineNum"> 597 </span> : value_compare -<span class="lineNum"> 598 </span> : value_comp() const -<span class="lineNum"> 599 </span> : { return value_compare(_M_t.key_comp()); } -<span class="lineNum"> 600 </span> : -<span class="lineNum"> 601 </span> : // [23.3.1.3] map operations -<span class="lineNum"> 602 </span> : /** -<span class="lineNum"> 603 </span> : * @brief Tries to locate an element in a %map. -<span class="lineNum"> 604 </span> : * @param x Key of (key, value) %pair to be located. -<span class="lineNum"> 605 </span> : * @return Iterator pointing to sought-after element, or end() if not -<span class="lineNum"> 606 </span> : * found. -<span class="lineNum"> 607 </span> : * -<span class="lineNum"> 608 </span> : * This function takes a key and tries to locate the element with which -<span class="lineNum"> 609 </span> : * the key matches. If successful the function returns an iterator -<span class="lineNum"> 610 </span> : * pointing to the sought after %pair. If unsuccessful it returns the -<span class="lineNum"> 611 </span> : * past-the-end ( @c end() ) iterator. -<span class="lineNum"> 612 </span> : */ -<span class="lineNum"> 613 </span> : iterator -<span class="lineNum"> 614 </span><span class="lineCov"> 50117 : find(const key_type& __x)</span> -<span class="lineNum"> 615 </span><span class="lineCov"> 50117 : { return _M_t.find(__x); }</span> -<span class="lineNum"> 616 </span> : -<span class="lineNum"> 617 </span> : /** -<span class="lineNum"> 618 </span> : * @brief Tries to locate an element in a %map. -<span class="lineNum"> 619 </span> : * @param x Key of (key, value) %pair to be located. -<span class="lineNum"> 620 </span> : * @return Read-only (constant) iterator pointing to sought-after -<span class="lineNum"> 621 </span> : * element, or end() if not found. -<span class="lineNum"> 622 </span> : * -<span class="lineNum"> 623 </span> : * This function takes a key and tries to locate the element with which -<span class="lineNum"> 624 </span> : * the key matches. If successful the function returns a constant -<span class="lineNum"> 625 </span> : * iterator pointing to the sought after %pair. If unsuccessful it -<span class="lineNum"> 626 </span> : * returns the past-the-end ( @c end() ) iterator. -<span class="lineNum"> 627 </span> : */ -<span class="lineNum"> 628 </span> : const_iterator -<span class="lineNum"> 629 </span><span class="lineCov"> 3916 : find(const key_type& __x) const</span> -<span class="lineNum"> 630 </span><span class="lineCov"> 3916 : { return _M_t.find(__x); }</span> -<span class="lineNum"> 631 </span> : -<span class="lineNum"> 632 </span> : /** -<span class="lineNum"> 633 </span> : * @brief Finds the number of elements with given key. -<span class="lineNum"> 634 </span> : * @param x Key of (key, value) pairs to be located. -<span class="lineNum"> 635 </span> : * @return Number of elements with specified key. -<span class="lineNum"> 636 </span> : * -<span class="lineNum"> 637 </span> : * This function only makes sense for multimaps; for map the result will -<span class="lineNum"> 638 </span> : * either be 0 (not present) or 1 (present). -<span class="lineNum"> 639 </span> : */ -<span class="lineNum"> 640 </span> : size_type -<span class="lineNum"> 641 </span> : count(const key_type& __x) const -<span class="lineNum"> 642 </span> : { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } -<span class="lineNum"> 643 </span> : -<span class="lineNum"> 644 </span> : /** -<span class="lineNum"> 645 </span> : * @brief Finds the beginning of a subsequence matching given key. -<span class="lineNum"> 646 </span> : * @param x Key of (key, value) pair to be located. -<span class="lineNum"> 647 </span> : * @return Iterator pointing to first element equal to or greater -<span class="lineNum"> 648 </span> : * than key, or end(). -<span class="lineNum"> 649 </span> : * -<span class="lineNum"> 650 </span> : * This function returns the first element of a subsequence of elements -<span class="lineNum"> 651 </span> : * that matches the given key. If unsuccessful it returns an iterator -<span class="lineNum"> 652 </span> : * pointing to the first element that has a greater value than given key -<span class="lineNum"> 653 </span> : * or end() if no such element exists. -<span class="lineNum"> 654 </span> : */ -<span class="lineNum"> 655 </span> : iterator -<span class="lineNum"> 656 </span><span class="lineCov"> 6297 : lower_bound(const key_type& __x)</span> -<span class="lineNum"> 657 </span><span class="lineCov"> 6297 : { return _M_t.lower_bound(__x); }</span> -<span class="lineNum"> 658 </span> : -<span class="lineNum"> 659 </span> : /** -<span class="lineNum"> 660 </span> : * @brief Finds the beginning of a subsequence matching given key. -<span class="lineNum"> 661 </span> : * @param x Key of (key, value) pair to be located. -<span class="lineNum"> 662 </span> : * @return Read-only (constant) iterator pointing to first element -<span class="lineNum"> 663 </span> : * equal to or greater than key, or end(). -<span class="lineNum"> 664 </span> : * -<span class="lineNum"> 665 </span> : * This function returns the first element of a subsequence of elements -<span class="lineNum"> 666 </span> : * that matches the given key. If unsuccessful it returns an iterator -<span class="lineNum"> 667 </span> : * pointing to the first element that has a greater value than given key -<span class="lineNum"> 668 </span> : * or end() if no such element exists. -<span class="lineNum"> 669 </span> : */ -<span class="lineNum"> 670 </span> : const_iterator -<span class="lineNum"> 671 </span> : lower_bound(const key_type& __x) const -<span class="lineNum"> 672 </span> : { return _M_t.lower_bound(__x); } -<span class="lineNum"> 673 </span> : -<span class="lineNum"> 674 </span> : /** -<span class="lineNum"> 675 </span> : * @brief Finds the end of a subsequence matching given key. -<span class="lineNum"> 676 </span> : * @param x Key of (key, value) pair to be located. -<span class="lineNum"> 677 </span> : * @return Iterator pointing to the first element -<span class="lineNum"> 678 </span> : * greater than key, or end(). -<span class="lineNum"> 679 </span> : */ -<span class="lineNum"> 680 </span> : iterator -<span class="lineNum"> 681 </span> : upper_bound(const key_type& __x) -<span class="lineNum"> 682 </span> : { return _M_t.upper_bound(__x); } -<span class="lineNum"> 683 </span> : -<span class="lineNum"> 684 </span> : /** -<span class="lineNum"> 685 </span> : * @brief Finds the end of a subsequence matching given key. -<span class="lineNum"> 686 </span> : * @param x Key of (key, value) pair to be located. -<span class="lineNum"> 687 </span> : * @return Read-only (constant) iterator pointing to first iterator -<span class="lineNum"> 688 </span> : * greater than key, or end(). -<span class="lineNum"> 689 </span> : */ -<span class="lineNum"> 690 </span> : const_iterator -<span class="lineNum"> 691 </span> : upper_bound(const key_type& __x) const -<span class="lineNum"> 692 </span> : { return _M_t.upper_bound(__x); } -<span class="lineNum"> 693 </span> : -<span class="lineNum"> 694 </span> : /** -<span class="lineNum"> 695 </span> : * @brief Finds a subsequence matching given key. -<span class="lineNum"> 696 </span> : * @param x Key of (key, value) pairs to be located. -<span class="lineNum"> 697 </span> : * @return Pair of iterators that possibly points to the subsequence -<span class="lineNum"> 698 </span> : * matching given key. -<span class="lineNum"> 699 </span> : * -<span class="lineNum"> 700 </span> : * This function is equivalent to -<span class="lineNum"> 701 </span> : * @code -<span class="lineNum"> 702 </span> : * std::make_pair(c.lower_bound(val), -<span class="lineNum"> 703 </span> : * c.upper_bound(val)) -<span class="lineNum"> 704 </span> : * @endcode -<span class="lineNum"> 705 </span> : * (but is faster than making the calls separately). -<span class="lineNum"> 706 </span> : * -<span class="lineNum"> 707 </span> : * This function probably only makes sense for multimaps. -<span class="lineNum"> 708 </span> : */ -<span class="lineNum"> 709 </span> : std::pair<iterator, iterator> -<span class="lineNum"> 710 </span> : equal_range(const key_type& __x) -<span class="lineNum"> 711 </span> : { return _M_t.equal_range(__x); } -<span class="lineNum"> 712 </span> : -<span class="lineNum"> 713 </span> : /** -<span class="lineNum"> 714 </span> : * @brief Finds a subsequence matching given key. -<span class="lineNum"> 715 </span> : * @param x Key of (key, value) pairs to be located. -<span class="lineNum"> 716 </span> : * @return Pair of read-only (constant) iterators that possibly points -<span class="lineNum"> 717 </span> : * to the subsequence matching given key. -<span class="lineNum"> 718 </span> : * -<span class="lineNum"> 719 </span> : * This function is equivalent to -<span class="lineNum"> 720 </span> : * @code -<span class="lineNum"> 721 </span> : * std::make_pair(c.lower_bound(val), -<span class="lineNum"> 722 </span> : * c.upper_bound(val)) -<span class="lineNum"> 723 </span> : * @endcode -<span class="lineNum"> 724 </span> : * (but is faster than making the calls separately). -<span class="lineNum"> 725 </span> : * -<span class="lineNum"> 726 </span> : * This function probably only makes sense for multimaps. -<span class="lineNum"> 727 </span> : */ -<span class="lineNum"> 728 </span> : std::pair<const_iterator, const_iterator> -<span class="lineNum"> 729 </span> : equal_range(const key_type& __x) const -<span class="lineNum"> 730 </span> : { return _M_t.equal_range(__x); } -<span class="lineNum"> 731 </span> : -<span class="lineNum"> 732 </span> : template<typename _K1, typename _T1, typename _C1, typename _A1> -<span class="lineNum"> 733 </span> : friend bool -<span class="lineNum"> 734 </span> : operator==(const map<_K1, _T1, _C1, _A1>&, -<span class="lineNum"> 735 </span> : const map<_K1, _T1, _C1, _A1>&); -<span class="lineNum"> 736 </span> : -<span class="lineNum"> 737 </span> : template<typename _K1, typename _T1, typename _C1, typename _A1> -<span class="lineNum"> 738 </span> : friend bool -<span class="lineNum"> 739 </span> : operator<(const map<_K1, _T1, _C1, _A1>&, -<span class="lineNum"> 740 </span> : const map<_K1, _T1, _C1, _A1>&); -<span class="lineNum"> 741 </span> : }; -<span class="lineNum"> 742 </span> : -<span class="lineNum"> 743 </span> : /** -<span class="lineNum"> 744 </span> : * @brief Map equality comparison. -<span class="lineNum"> 745 </span> : * @param x A %map. -<span class="lineNum"> 746 </span> : * @param y A %map of the same type as @a x. -<span class="lineNum"> 747 </span> : * @return True iff the size and elements of the maps are equal. -<span class="lineNum"> 748 </span> : * -<span class="lineNum"> 749 </span> : * This is an equivalence relation. It is linear in the size of the -<span class="lineNum"> 750 </span> : * maps. Maps are considered equivalent if their sizes are equal, -<span class="lineNum"> 751 </span> : * and if corresponding elements compare equal. -<span class="lineNum"> 752 </span> : */ -<span class="lineNum"> 753 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 754 </span> : inline bool -<span class="lineNum"> 755 </span> : operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 756 </span> : const map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 757 </span> : { return __x._M_t == __y._M_t; } -<span class="lineNum"> 758 </span> : -<span class="lineNum"> 759 </span> : /** -<span class="lineNum"> 760 </span> : * @brief Map ordering relation. -<span class="lineNum"> 761 </span> : * @param x A %map. -<span class="lineNum"> 762 </span> : * @param y A %map of the same type as @a x. -<span class="lineNum"> 763 </span> : * @return True iff @a x is lexicographically less than @a y. -<span class="lineNum"> 764 </span> : * -<span class="lineNum"> 765 </span> : * This is a total ordering relation. It is linear in the size of the -<span class="lineNum"> 766 </span> : * maps. The elements must be comparable with @c <. -<span class="lineNum"> 767 </span> : * -<span class="lineNum"> 768 </span> : * See std::lexicographical_compare() for how the determination is made. -<span class="lineNum"> 769 </span> : */ -<span class="lineNum"> 770 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 771 </span> : inline bool -<span class="lineNum"> 772 </span> : operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 773 </span> : const map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 774 </span> : { return __x._M_t < __y._M_t; } -<span class="lineNum"> 775 </span> : -<span class="lineNum"> 776 </span> : /// Based on operator== -<span class="lineNum"> 777 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 778 </span> : inline bool -<span class="lineNum"> 779 </span> : operator!=(const map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 780 </span> : const map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 781 </span> : { return !(__x == __y); } -<span class="lineNum"> 782 </span> : -<span class="lineNum"> 783 </span> : /// Based on operator< -<span class="lineNum"> 784 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 785 </span> : inline bool -<span class="lineNum"> 786 </span> : operator>(const map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 787 </span> : const map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 788 </span> : { return __y < __x; } -<span class="lineNum"> 789 </span> : -<span class="lineNum"> 790 </span> : /// Based on operator< -<span class="lineNum"> 791 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 792 </span> : inline bool -<span class="lineNum"> 793 </span> : operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 794 </span> : const map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 795 </span> : { return !(__y < __x); } -<span class="lineNum"> 796 </span> : -<span class="lineNum"> 797 </span> : /// Based on operator< -<span class="lineNum"> 798 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 799 </span> : inline bool -<span class="lineNum"> 800 </span> : operator>=(const map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 801 </span> : const map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 802 </span> : { return !(__x < __y); } -<span class="lineNum"> 803 </span> : -<span class="lineNum"> 804 </span> : /// See std::map::swap(). -<span class="lineNum"> 805 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 806 </span> : inline void -<span class="lineNum"> 807 </span> : swap(map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 808 </span> : map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 809 </span> : { __x.swap(__y); } -<span class="lineNum"> 810 </span> : -<span class="lineNum"> 811 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 812 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 813 </span> : inline void -<span class="lineNum"> 814 </span> : swap(map<_Key, _Tp, _Compare, _Alloc>&& __x, -<span class="lineNum"> 815 </span> : map<_Key, _Tp, _Compare, _Alloc>& __y) -<span class="lineNum"> 816 </span> : { __x.swap(__y); } -<span class="lineNum"> 817 </span> : -<span class="lineNum"> 818 </span> : template<typename _Key, typename _Tp, typename _Compare, typename _Alloc> -<span class="lineNum"> 819 </span> : inline void -<span class="lineNum"> 820 </span> : swap(map<_Key, _Tp, _Compare, _Alloc>& __x, -<span class="lineNum"> 821 </span> : map<_Key, _Tp, _Compare, _Alloc>&& __y) -<span class="lineNum"> 822 </span> : { __x.swap(__y); } -<span class="lineNum"> 823 </span> : #endif -<span class="lineNum"> 824 </span> : -<span class="lineNum"> 825 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 826 </span> : -<span class="lineNum"> 827 </span> : #endif /* _STL_MAP_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_move.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_move.h.gcov.html deleted file mode 100644 index 93e7633..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_move.h.gcov.html +++ /dev/null @@ -1,159 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_move.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_move.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">5</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">5</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Move, forward and identity for C++0x + swap -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2007 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 7 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 8 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 9 </span> : // any later version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : // GNU General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 17 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 18 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 19 </span> : // USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 22 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 23 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 24 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 25 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 26 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 27 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** @file stl_move.h -<span class="lineNum"> 31 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 32 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : #ifndef _STL_MOVE_H -<span class="lineNum"> 36 </span> : #define _STL_MOVE_H 1 -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #include <bits/c++config.h> -<span class="lineNum"> 39 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 42 </span> : #include <type_traits> -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : // 20.2.2, forward/move -<span class="lineNum"> 47 </span> : template<typename _Tp> -<span class="lineNum"> 48 </span> : struct identity -<span class="lineNum"> 49 </span> : { -<span class="lineNum"> 50 </span> : typedef _Tp type; -<span class="lineNum"> 51 </span> : }; -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : template<typename _Tp> -<span class="lineNum"> 54 </span> : inline _Tp&& -<span class="lineNum"> 55 </span> : forward(typename std::identity<_Tp>::type&& __t) -<span class="lineNum"> 56 </span> : { return __t; } -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : template<typename _Tp> -<span class="lineNum"> 59 </span> : inline typename std::remove_reference<_Tp>::type&& -<span class="lineNum"> 60 </span> : move(_Tp&& __t) -<span class="lineNum"> 61 </span> : { return __t; } -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #define _GLIBCXX_MOVE(_Tp) std::move(_Tp) -<span class="lineNum"> 66 </span> : #else -<span class="lineNum"> 67 </span> : #define _GLIBCXX_MOVE(_Tp) (_Tp) -<span class="lineNum"> 68 </span> : #endif -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : /** -<span class="lineNum"> 73 </span> : * @brief Swaps two values. -<span class="lineNum"> 74 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 75 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 76 </span> : * @return Nothing. -<span class="lineNum"> 77 </span> : */ -<span class="lineNum"> 78 </span> : template<typename _Tp> -<span class="lineNum"> 79 </span> : inline void -<span class="lineNum"> 80 </span><span class="lineCov"> 7080 : swap(_Tp& __a, _Tp& __b)</span> -<span class="lineNum"> 81 </span> : { -<span class="lineNum"> 82 </span> : // concept requirements -<span class="lineNum"> 83 </span> : __glibcxx_function_requires(_SGIAssignableConcept<_Tp>) -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span><span class="lineCov"> 7080 : _Tp __tmp = _GLIBCXX_MOVE(__a);</span> -<span class="lineNum"> 86 </span><span class="lineCov"> 7080 : __a = _GLIBCXX_MOVE(__b);</span> -<span class="lineNum"> 87 </span><span class="lineCov"> 7080 : __b = _GLIBCXX_MOVE(__tmp);</span> -<span class="lineNum"> 88 </span><span class="lineCov"> 7080 : }</span> -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : #endif /* _STL_MOVE_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_pair.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_pair.h.gcov.html deleted file mode 100644 index 455afe5..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_pair.h.gcov.html +++ /dev/null @@ -1,331 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_pair.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_pair.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">9</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">9</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Pair implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_pair.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_PAIR_H -<span class="lineNum"> 63 </span> : #define _STL_PAIR_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/stl_move.h> // for std::move / std::forward, std::decay, and -<span class="lineNum"> 66 </span> : // std::swap -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : /// pair holds two objects of arbitrary type. -<span class="lineNum"> 71 </span> : template<class _T1, class _T2> -<span class="lineNum"> 72 </span> : struct pair -<span class="lineNum"> 73 </span><span class="lineCov"> 814163 : {</span> -<span class="lineNum"> 74 </span> : typedef _T1 first_type; ///< @c first_type is the first bound type -<span class="lineNum"> 75 </span> : typedef _T2 second_type; ///< @c second_type is the second bound type -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : _T1 first; ///< @c first is a copy of the first object -<span class="lineNum"> 78 </span> : _T2 second; ///< @c second is a copy of the second object -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 81 </span> : // 265. std::pair::pair() effects overly restrictive -<span class="lineNum"> 82 </span> : /** The default constructor creates @c first and @c second using their -<span class="lineNum"> 83 </span> : * respective default constructors. */ -<span class="lineNum"> 84 </span><span class="lineCov"> 19 : pair()</span> -<span class="lineNum"> 85 </span><span class="lineCov"> 19 : : first(), second() { }</span> -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : /** Two objects may be passed to a @c pair constructor to be copied. */ -<span class="lineNum"> 88 </span><span class="lineCov"> 3562241 : pair(const _T1& __a, const _T2& __b)</span> -<span class="lineNum"> 89 </span><span class="lineCov"> 3562241 : : first(__a), second(__b) { }</span> -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 92 </span> : template<class _U1, class _U2> -<span class="lineNum"> 93 </span> : pair(_U1&& __x, _U2&& __y) -<span class="lineNum"> 94 </span> : : first(std::forward<_U1>(__x)), -<span class="lineNum"> 95 </span> : second(std::forward<_U2>(__y)) { } -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : pair(pair&& __p) -<span class="lineNum"> 98 </span> : : first(std::move(__p.first)), -<span class="lineNum"> 99 </span> : second(std::move(__p.second)) { } -<span class="lineNum"> 100 </span> : #endif -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : /** There is also a templated copy ctor for the @c pair class itself. */ -<span class="lineNum"> 103 </span> : template<class _U1, class _U2> -<span class="lineNum"> 104 </span><span class="lineCov"> 101375 : pair(const pair<_U1, _U2>& __p)</span> -<span class="lineNum"> 105 </span> : : first(__p.first), -<span class="lineNum"> 106 </span><span class="lineCov"> 101375 : second(__p.second) { }</span> -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 109 </span> : template<class _U1, class _U2> -<span class="lineNum"> 110 </span> : pair(pair<_U1, _U2>&& __p) -<span class="lineNum"> 111 </span> : : first(std::move(__p.first)), -<span class="lineNum"> 112 </span> : second(std::move(__p.second)) { } -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : // http://gcc.gnu.org/ml/libstdc++/2007-08/msg00052.html -<span class="lineNum"> 115 </span> : template<class _U1, class _Arg0, class... _Args> -<span class="lineNum"> 116 </span> : pair(_U1&& __x, _Arg0&& __arg0, _Args&&... __args) -<span class="lineNum"> 117 </span> : : first(std::forward<_U1>(__x)), -<span class="lineNum"> 118 </span> : second(std::forward<_Arg0>(__arg0), -<span class="lineNum"> 119 </span> : std::forward<_Args>(__args)...) { } -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : pair& -<span class="lineNum"> 122 </span> : operator=(pair&& __p) -<span class="lineNum"> 123 </span> : { -<span class="lineNum"> 124 </span> : first = std::move(__p.first); -<span class="lineNum"> 125 </span> : second = std::move(__p.second); -<span class="lineNum"> 126 </span> : return *this; -<span class="lineNum"> 127 </span> : } -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : template<class _U1, class _U2> -<span class="lineNum"> 130 </span> : pair& -<span class="lineNum"> 131 </span> : operator=(pair<_U1, _U2>&& __p) -<span class="lineNum"> 132 </span> : { -<span class="lineNum"> 133 </span> : first = std::move(__p.first); -<span class="lineNum"> 134 </span> : second = std::move(__p.second); -<span class="lineNum"> 135 </span> : return *this; -<span class="lineNum"> 136 </span> : } -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : void -<span class="lineNum"> 139 </span> : swap(pair&& __p) -<span class="lineNum"> 140 </span> : { -<span class="lineNum"> 141 </span> : using std::swap; -<span class="lineNum"> 142 </span> : swap(first, __p.first); -<span class="lineNum"> 143 </span> : swap(second, __p.second); -<span class="lineNum"> 144 </span> : } -<span class="lineNum"> 145 </span> : #endif -<span class="lineNum"> 146 </span> : }; -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : /// Two pairs of the same type are equal iff their members are equal. -<span class="lineNum"> 149 </span> : template<class _T1, class _T2> -<span class="lineNum"> 150 </span> : inline bool -<span class="lineNum"> 151 </span> : operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) -<span class="lineNum"> 152 </span> : { return __x.first == __y.first && __x.second == __y.second; } -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : /// <http://gcc.gnu.org/onlinedocs/libstdc++/20_util/howto.html#pairlt> -<span class="lineNum"> 155 </span> : template<class _T1, class _T2> -<span class="lineNum"> 156 </span> : inline bool -<span class="lineNum"> 157 </span> : operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) -<span class="lineNum"> 158 </span> : { return __x.first < __y.first -<span class="lineNum"> 159 </span> : || (!(__y.first < __x.first) && __x.second < __y.second); } -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : /// Uses @c operator== to find the result. -<span class="lineNum"> 162 </span> : template<class _T1, class _T2> -<span class="lineNum"> 163 </span> : inline bool -<span class="lineNum"> 164 </span> : operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) -<span class="lineNum"> 165 </span> : { return !(__x == __y); } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /// Uses @c operator< to find the result. -<span class="lineNum"> 168 </span> : template<class _T1, class _T2> -<span class="lineNum"> 169 </span> : inline bool -<span class="lineNum"> 170 </span> : operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) -<span class="lineNum"> 171 </span> : { return __y < __x; } -<span class="lineNum"> 172 </span> : -<span class="lineNum"> 173 </span> : /// Uses @c operator< to find the result. -<span class="lineNum"> 174 </span> : template<class _T1, class _T2> -<span class="lineNum"> 175 </span> : inline bool -<span class="lineNum"> 176 </span> : operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) -<span class="lineNum"> 177 </span> : { return !(__y < __x); } -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : /// Uses @c operator< to find the result. -<span class="lineNum"> 180 </span> : template<class _T1, class _T2> -<span class="lineNum"> 181 </span> : inline bool -<span class="lineNum"> 182 </span> : operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) -<span class="lineNum"> 183 </span> : { return !(__x < __y); } -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 186 </span> : /// See std::pair::swap(). -<span class="lineNum"> 187 </span> : template<class _T1, class _T2> -<span class="lineNum"> 188 </span> : inline void -<span class="lineNum"> 189 </span> : swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) -<span class="lineNum"> 190 </span> : { __x.swap(__y); } -<span class="lineNum"> 191 </span> : -<span class="lineNum"> 192 </span> : template<class _T1, class _T2> -<span class="lineNum"> 193 </span> : inline void -<span class="lineNum"> 194 </span> : swap(pair<_T1, _T2>&& __x, pair<_T1, _T2>& __y) -<span class="lineNum"> 195 </span> : { __x.swap(__y); } -<span class="lineNum"> 196 </span> : -<span class="lineNum"> 197 </span> : template<class _T1, class _T2> -<span class="lineNum"> 198 </span> : inline void -<span class="lineNum"> 199 </span> : swap(pair<_T1, _T2>& __x, pair<_T1, _T2>&& __y) -<span class="lineNum"> 200 </span> : { __x.swap(__y); } -<span class="lineNum"> 201 </span> : #endif -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : /** -<span class="lineNum"> 204 </span> : * @brief A convenience wrapper for creating a pair from two objects. -<span class="lineNum"> 205 </span> : * @param x The first object. -<span class="lineNum"> 206 </span> : * @param y The second object. -<span class="lineNum"> 207 </span> : * @return A newly-constructed pair<> object of the appropriate type. -<span class="lineNum"> 208 </span> : * -<span class="lineNum"> 209 </span> : * The standard requires that the objects be passed by reference-to-const, -<span class="lineNum"> 210 </span> : * but LWG issue #181 says they should be passed by const value. We follow -<span class="lineNum"> 211 </span> : * the LWG by default. -<span class="lineNum"> 212 </span> : */ -<span class="lineNum"> 213 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 214 </span> : // 181. make_pair() unintended behavior -<span class="lineNum"> 215 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 216 </span> : template<class _T1, class _T2> -<span class="lineNum"> 217 </span> : inline pair<_T1, _T2> -<span class="lineNum"> 218 </span><span class="lineCov"> 474889 : make_pair(_T1 __x, _T2 __y)</span> -<span class="lineNum"> 219 </span><span class="lineCov"> 474889 : { return pair<_T1, _T2>(__x, __y); }</span> -<span class="lineNum"> 220 </span> : #else -<span class="lineNum"> 221 </span> : template<typename _Tp> -<span class="lineNum"> 222 </span> : class reference_wrapper; -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : // Helper which adds a reference to a type when given a reference_wrapper -<span class="lineNum"> 225 </span> : template<typename _Tp> -<span class="lineNum"> 226 </span> : struct __strip_reference_wrapper -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span> : typedef _Tp __type; -<span class="lineNum"> 229 </span> : }; -<span class="lineNum"> 230 </span> : -<span class="lineNum"> 231 </span> : template<typename _Tp> -<span class="lineNum"> 232 </span> : struct __strip_reference_wrapper<reference_wrapper<_Tp> > -<span class="lineNum"> 233 </span> : { -<span class="lineNum"> 234 </span> : typedef _Tp& __type; -<span class="lineNum"> 235 </span> : }; -<span class="lineNum"> 236 </span> : -<span class="lineNum"> 237 </span> : template<typename _Tp> -<span class="lineNum"> 238 </span> : struct __strip_reference_wrapper<const reference_wrapper<_Tp> > -<span class="lineNum"> 239 </span> : { -<span class="lineNum"> 240 </span> : typedef _Tp& __type; -<span class="lineNum"> 241 </span> : }; -<span class="lineNum"> 242 </span> : -<span class="lineNum"> 243 </span> : template<typename _Tp> -<span class="lineNum"> 244 </span> : struct __decay_and_strip -<span class="lineNum"> 245 </span> : { -<span class="lineNum"> 246 </span> : typedef typename __strip_reference_wrapper< -<span class="lineNum"> 247 </span> : typename decay<_Tp>::type>::__type __type; -<span class="lineNum"> 248 </span> : }; -<span class="lineNum"> 249 </span> : -<span class="lineNum"> 250 </span> : // NB: DR 706. -<span class="lineNum"> 251 </span> : template<class _T1, class _T2> -<span class="lineNum"> 252 </span> : inline pair<typename __decay_and_strip<_T1>::__type, -<span class="lineNum"> 253 </span> : typename __decay_and_strip<_T2>::__type> -<span class="lineNum"> 254 </span> : make_pair(_T1&& __x, _T2&& __y) -<span class="lineNum"> 255 </span> : { -<span class="lineNum"> 256 </span> : return pair<typename __decay_and_strip<_T1>::__type, -<span class="lineNum"> 257 </span> : typename __decay_and_strip<_T2>::__type> -<span class="lineNum"> 258 </span> : (std::forward<_T1>(__x), std::forward<_T2>(__y)); -<span class="lineNum"> 259 </span> : } -<span class="lineNum"> 260 </span> : #endif -<span class="lineNum"> 261 </span> : -<span class="lineNum"> 262 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : #endif /* _STL_PAIR_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_set.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_set.h.gcov.html deleted file mode 100644 index 3398416..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_set.h.gcov.html +++ /dev/null @@ -1,731 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_set.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_set.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">33</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">33</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Set implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_set.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_SET_H -<span class="lineNum"> 63 </span> : #define _STL_SET_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : /** -<span class="lineNum"> 70 </span> : * @brief A standard container made up of unique keys, which can be -<span class="lineNum"> 71 </span> : * retrieved in logarithmic time. -<span class="lineNum"> 72 </span> : * -<span class="lineNum"> 73 </span> : * @ingroup Containers -<span class="lineNum"> 74 </span> : * @ingroup Assoc_containers -<span class="lineNum"> 75 </span> : * -<span class="lineNum"> 76 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a -<span class="lineNum"> 77 </span> : * <a href="tables.html#66">reversible container</a>, and an -<span class="lineNum"> 78 </span> : * <a href="tables.html#69">associative container</a> (using unique keys). -<span class="lineNum"> 79 </span> : * -<span class="lineNum"> 80 </span> : * Sets support bidirectional iterators. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * @param Key Type of key objects. -<span class="lineNum"> 83 </span> : * @param Compare Comparison function object type, defaults to less<Key>. -<span class="lineNum"> 84 </span> : * @param Alloc Allocator type, defaults to allocator<Key>. -<span class="lineNum"> 85 </span> : * -<span class="lineNum"> 86 </span> : * The private tree data is declared exactly the same way for set and -<span class="lineNum"> 87 </span> : * multiset; the distinction is made entirely in how the tree functions are -<span class="lineNum"> 88 </span> : * called (*_unique versus *_equal, same as the standard). -<span class="lineNum"> 89 </span> : */ -<span class="lineNum"> 90 </span> : template<typename _Key, typename _Compare = std::less<_Key>, -<span class="lineNum"> 91 </span> : typename _Alloc = std::allocator<_Key> > -<span class="lineNum"> 92 </span> : class set -<span class="lineNum"> 93 </span><span class="lineCov"> 1308625 : {</span> -<span class="lineNum"> 94 </span> : // concept requirements -<span class="lineNum"> 95 </span> : typedef typename _Alloc::value_type _Alloc_value_type; -<span class="lineNum"> 96 </span> : __glibcxx_class_requires(_Key, _SGIAssignableConcept) -<span class="lineNum"> 97 </span> : __glibcxx_class_requires4(_Compare, bool, _Key, _Key, -<span class="lineNum"> 98 </span> : _BinaryFunctionConcept) -<span class="lineNum"> 99 </span> : __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : public: -<span class="lineNum"> 102 </span> : // typedefs: -<span class="lineNum"> 103 </span> : //@{ -<span class="lineNum"> 104 </span> : /// Public typedefs. -<span class="lineNum"> 105 </span> : typedef _Key key_type; -<span class="lineNum"> 106 </span> : typedef _Key value_type; -<span class="lineNum"> 107 </span> : typedef _Compare key_compare; -<span class="lineNum"> 108 </span> : typedef _Compare value_compare; -<span class="lineNum"> 109 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 110 </span> : //@} -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : private: -<span class="lineNum"> 113 </span> : typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type; -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : typedef _Rb_tree<key_type, value_type, _Identity<value_type>, -<span class="lineNum"> 116 </span> : key_compare, _Key_alloc_type> _Rep_type; -<span class="lineNum"> 117 </span> : _Rep_type _M_t; // Red-black tree representing set. -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : public: -<span class="lineNum"> 120 </span> : //@{ -<span class="lineNum"> 121 </span> : /// Iterator-related typedefs. -<span class="lineNum"> 122 </span> : typedef typename _Key_alloc_type::pointer pointer; -<span class="lineNum"> 123 </span> : typedef typename _Key_alloc_type::const_pointer const_pointer; -<span class="lineNum"> 124 </span> : typedef typename _Key_alloc_type::reference reference; -<span class="lineNum"> 125 </span> : typedef typename _Key_alloc_type::const_reference const_reference; -<span class="lineNum"> 126 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 127 </span> : // DR 103. set::iterator is required to be modifiable, -<span class="lineNum"> 128 </span> : // but this allows modification of keys. -<span class="lineNum"> 129 </span> : typedef typename _Rep_type::const_iterator iterator; -<span class="lineNum"> 130 </span> : typedef typename _Rep_type::const_iterator const_iterator; -<span class="lineNum"> 131 </span> : typedef typename _Rep_type::const_reverse_iterator reverse_iterator; -<span class="lineNum"> 132 </span> : typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; -<span class="lineNum"> 133 </span> : typedef typename _Rep_type::size_type size_type; -<span class="lineNum"> 134 </span> : typedef typename _Rep_type::difference_type difference_type; -<span class="lineNum"> 135 </span> : //@} -<span class="lineNum"> 136 </span> : -<span class="lineNum"> 137 </span> : // allocation/deallocation -<span class="lineNum"> 138 </span> : /** -<span class="lineNum"> 139 </span> : * @brief Default constructor creates no elements. -<span class="lineNum"> 140 </span> : */ -<span class="lineNum"> 141 </span><span class="lineCov"> 277740 : set()</span> -<span class="lineNum"> 142 </span><span class="lineCov"> 277740 : : _M_t() { }</span> -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : /** -<span class="lineNum"> 145 </span> : * @brief Creates a %set with no elements. -<span class="lineNum"> 146 </span> : * @param comp Comparator to use. -<span class="lineNum"> 147 </span> : * @param a An allocator object. -<span class="lineNum"> 148 </span> : */ -<span class="lineNum"> 149 </span> : explicit -<span class="lineNum"> 150 </span> : set(const _Compare& __comp, -<span class="lineNum"> 151 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 152 </span> : : _M_t(__comp, __a) { } -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : /** -<span class="lineNum"> 155 </span> : * @brief Builds a %set from a range. -<span class="lineNum"> 156 </span> : * @param first An input iterator. -<span class="lineNum"> 157 </span> : * @param last An input iterator. -<span class="lineNum"> 158 </span> : * -<span class="lineNum"> 159 </span> : * Create a %set consisting of copies of the elements from [first,last). -<span class="lineNum"> 160 </span> : * This is linear in N if the range is already sorted, and NlogN -<span class="lineNum"> 161 </span> : * otherwise (where N is distance(first,last)). -<span class="lineNum"> 162 </span> : */ -<span class="lineNum"> 163 </span> : template<typename _InputIterator> -<span class="lineNum"> 164 </span> : set(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 165 </span> : : _M_t() -<span class="lineNum"> 166 </span> : { _M_t._M_insert_unique(__first, __last); } -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : /** -<span class="lineNum"> 169 </span> : * @brief Builds a %set from a range. -<span class="lineNum"> 170 </span> : * @param first An input iterator. -<span class="lineNum"> 171 </span> : * @param last An input iterator. -<span class="lineNum"> 172 </span> : * @param comp A comparison functor. -<span class="lineNum"> 173 </span> : * @param a An allocator object. -<span class="lineNum"> 174 </span> : * -<span class="lineNum"> 175 </span> : * Create a %set consisting of copies of the elements from [first,last). -<span class="lineNum"> 176 </span> : * This is linear in N if the range is already sorted, and NlogN -<span class="lineNum"> 177 </span> : * otherwise (where N is distance(first,last)). -<span class="lineNum"> 178 </span> : */ -<span class="lineNum"> 179 </span> : template<typename _InputIterator> -<span class="lineNum"> 180 </span> : set(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 181 </span> : const _Compare& __comp, -<span class="lineNum"> 182 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 183 </span> : : _M_t(__comp, __a) -<span class="lineNum"> 184 </span> : { _M_t._M_insert_unique(__first, __last); } -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span> : /** -<span class="lineNum"> 187 </span> : * @brief %Set copy constructor. -<span class="lineNum"> 188 </span> : * @param x A %set of identical element and allocator types. -<span class="lineNum"> 189 </span> : * -<span class="lineNum"> 190 </span> : * The newly-created %set uses a copy of the allocation object used -<span class="lineNum"> 191 </span> : * by @a x. -<span class="lineNum"> 192 </span> : */ -<span class="lineNum"> 193 </span><span class="lineCov"> 925151 : set(const set& __x)</span> -<span class="lineNum"> 194 </span><span class="lineCov"> 925151 : : _M_t(__x._M_t) { }</span> -<span class="lineNum"> 195 </span> : -<span class="lineNum"> 196 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 197 </span> : /** -<span class="lineNum"> 198 </span> : * @brief %Set move constructor -<span class="lineNum"> 199 </span> : * @param x A %set of identical element and allocator types. -<span class="lineNum"> 200 </span> : * -<span class="lineNum"> 201 </span> : * The newly-created %set contains the exact contents of @a x. -<span class="lineNum"> 202 </span> : * The contents of @a x are a valid, but unspecified %set. -<span class="lineNum"> 203 </span> : */ -<span class="lineNum"> 204 </span> : set(set&& __x) -<span class="lineNum"> 205 </span> : : _M_t(std::forward<_Rep_type>(__x._M_t)) { } -<span class="lineNum"> 206 </span> : #endif -<span class="lineNum"> 207 </span> : -<span class="lineNum"> 208 </span> : /** -<span class="lineNum"> 209 </span> : * @brief %Set assignment operator. -<span class="lineNum"> 210 </span> : * @param x A %set of identical element and allocator types. -<span class="lineNum"> 211 </span> : * -<span class="lineNum"> 212 </span> : * All the elements of @a x are copied, but unlike the copy constructor, -<span class="lineNum"> 213 </span> : * the allocator object is not copied. -<span class="lineNum"> 214 </span> : */ -<span class="lineNum"> 215 </span> : set& -<span class="lineNum"> 216 </span><span class="lineCov"> 80 : operator=(const set& __x)</span> -<span class="lineNum"> 217 </span> : { -<span class="lineNum"> 218 </span><span class="lineCov"> 80 : _M_t = __x._M_t;</span> -<span class="lineNum"> 219 </span><span class="lineCov"> 80 : return *this;</span> -<span class="lineNum"> 220 </span> : } -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 223 </span> : /** -<span class="lineNum"> 224 </span> : * @brief %Set move assignment operator. -<span class="lineNum"> 225 </span> : * @param x A %set of identical element and allocator types. -<span class="lineNum"> 226 </span> : * -<span class="lineNum"> 227 </span> : * The contents of @a x are moved into this %set (without copying). -<span class="lineNum"> 228 </span> : * @a x is a valid, but unspecified %set. -<span class="lineNum"> 229 </span> : */ -<span class="lineNum"> 230 </span> : set& -<span class="lineNum"> 231 </span> : operator=(set&& __x) -<span class="lineNum"> 232 </span> : { -<span class="lineNum"> 233 </span> : // NB: DR 675. -<span class="lineNum"> 234 </span> : this->clear(); -<span class="lineNum"> 235 </span> : this->swap(__x); -<span class="lineNum"> 236 </span> : return *this; -<span class="lineNum"> 237 </span> : } -<span class="lineNum"> 238 </span> : #endif -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : // accessors: -<span class="lineNum"> 241 </span> : -<span class="lineNum"> 242 </span> : /// Returns the comparison object with which the %set was constructed. -<span class="lineNum"> 243 </span> : key_compare -<span class="lineNum"> 244 </span> : key_comp() const -<span class="lineNum"> 245 </span> : { return _M_t.key_comp(); } -<span class="lineNum"> 246 </span> : /// Returns the comparison object with which the %set was constructed. -<span class="lineNum"> 247 </span> : value_compare -<span class="lineNum"> 248 </span> : value_comp() const -<span class="lineNum"> 249 </span> : { return _M_t.key_comp(); } -<span class="lineNum"> 250 </span> : /// Returns the allocator object with which the %set was constructed. -<span class="lineNum"> 251 </span> : allocator_type -<span class="lineNum"> 252 </span> : get_allocator() const -<span class="lineNum"> 253 </span> : { return _M_t.get_allocator(); } -<span class="lineNum"> 254 </span> : -<span class="lineNum"> 255 </span> : /** -<span class="lineNum"> 256 </span> : * Returns a read-only (constant) iterator that points to the first -<span class="lineNum"> 257 </span> : * element in the %set. Iteration is done in ascending order according -<span class="lineNum"> 258 </span> : * to the keys. -<span class="lineNum"> 259 </span> : */ -<span class="lineNum"> 260 </span> : iterator -<span class="lineNum"> 261 </span><span class="lineCov"> 468023 : begin() const</span> -<span class="lineNum"> 262 </span><span class="lineCov"> 468023 : { return _M_t.begin(); }</span> -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : /** -<span class="lineNum"> 265 </span> : * Returns a read-only (constant) iterator that points one past the last -<span class="lineNum"> 266 </span> : * element in the %set. Iteration is done in ascending order according -<span class="lineNum"> 267 </span> : * to the keys. -<span class="lineNum"> 268 </span> : */ -<span class="lineNum"> 269 </span> : iterator -<span class="lineNum"> 270 </span><span class="lineCov"> 1576796 : end() const</span> -<span class="lineNum"> 271 </span><span class="lineCov"> 1576796 : { return _M_t.end(); }</span> -<span class="lineNum"> 272 </span> : -<span class="lineNum"> 273 </span> : /** -<span class="lineNum"> 274 </span> : * Returns a read-only (constant) iterator that points to the last -<span class="lineNum"> 275 </span> : * element in the %set. Iteration is done in descending order according -<span class="lineNum"> 276 </span> : * to the keys. -<span class="lineNum"> 277 </span> : */ -<span class="lineNum"> 278 </span> : reverse_iterator -<span class="lineNum"> 279 </span> : rbegin() const -<span class="lineNum"> 280 </span> : { return _M_t.rbegin(); } -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span> : /** -<span class="lineNum"> 283 </span> : * Returns a read-only (constant) reverse iterator that points to the -<span class="lineNum"> 284 </span> : * last pair in the %set. Iteration is done in descending order -<span class="lineNum"> 285 </span> : * according to the keys. -<span class="lineNum"> 286 </span> : */ -<span class="lineNum"> 287 </span> : reverse_iterator -<span class="lineNum"> 288 </span> : rend() const -<span class="lineNum"> 289 </span> : { return _M_t.rend(); } -<span class="lineNum"> 290 </span> : -<span class="lineNum"> 291 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 292 </span> : /** -<span class="lineNum"> 293 </span> : * Returns a read-only (constant) iterator that points to the first -<span class="lineNum"> 294 </span> : * element in the %set. Iteration is done in ascending order according -<span class="lineNum"> 295 </span> : * to the keys. -<span class="lineNum"> 296 </span> : */ -<span class="lineNum"> 297 </span> : iterator -<span class="lineNum"> 298 </span> : cbegin() const -<span class="lineNum"> 299 </span> : { return _M_t.begin(); } -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span> : /** -<span class="lineNum"> 302 </span> : * Returns a read-only (constant) iterator that points one past the last -<span class="lineNum"> 303 </span> : * element in the %set. Iteration is done in ascending order according -<span class="lineNum"> 304 </span> : * to the keys. -<span class="lineNum"> 305 </span> : */ -<span class="lineNum"> 306 </span> : iterator -<span class="lineNum"> 307 </span> : cend() const -<span class="lineNum"> 308 </span> : { return _M_t.end(); } -<span class="lineNum"> 309 </span> : -<span class="lineNum"> 310 </span> : /** -<span class="lineNum"> 311 </span> : * Returns a read-only (constant) iterator that points to the last -<span class="lineNum"> 312 </span> : * element in the %set. Iteration is done in descending order according -<span class="lineNum"> 313 </span> : * to the keys. -<span class="lineNum"> 314 </span> : */ -<span class="lineNum"> 315 </span> : reverse_iterator -<span class="lineNum"> 316 </span> : crbegin() const -<span class="lineNum"> 317 </span> : { return _M_t.rbegin(); } -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : /** -<span class="lineNum"> 320 </span> : * Returns a read-only (constant) reverse iterator that points to the -<span class="lineNum"> 321 </span> : * last pair in the %set. Iteration is done in descending order -<span class="lineNum"> 322 </span> : * according to the keys. -<span class="lineNum"> 323 </span> : */ -<span class="lineNum"> 324 </span> : reverse_iterator -<span class="lineNum"> 325 </span> : crend() const -<span class="lineNum"> 326 </span> : { return _M_t.rend(); } -<span class="lineNum"> 327 </span> : #endif -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : /// Returns true if the %set is empty. -<span class="lineNum"> 330 </span> : bool -<span class="lineNum"> 331 </span><span class="lineCov"> 338386 : empty() const</span> -<span class="lineNum"> 332 </span><span class="lineCov"> 338386 : { return _M_t.empty(); }</span> -<span class="lineNum"> 333 </span> : -<span class="lineNum"> 334 </span> : /// Returns the size of the %set. -<span class="lineNum"> 335 </span> : size_type -<span class="lineNum"> 336 </span><span class="lineCov"> 84631 : size() const</span> -<span class="lineNum"> 337 </span><span class="lineCov"> 84631 : { return _M_t.size(); }</span> -<span class="lineNum"> 338 </span> : -<span class="lineNum"> 339 </span> : /// Returns the maximum size of the %set. -<span class="lineNum"> 340 </span> : size_type -<span class="lineNum"> 341 </span> : max_size() const -<span class="lineNum"> 342 </span> : { return _M_t.max_size(); } -<span class="lineNum"> 343 </span> : -<span class="lineNum"> 344 </span> : /** -<span class="lineNum"> 345 </span> : * @brief Swaps data with another %set. -<span class="lineNum"> 346 </span> : * @param x A %set of the same element and allocator types. -<span class="lineNum"> 347 </span> : * -<span class="lineNum"> 348 </span> : * This exchanges the elements between two sets in constant time. -<span class="lineNum"> 349 </span> : * (It is only swapping a pointer, an integer, and an instance of -<span class="lineNum"> 350 </span> : * the @c Compare type (which itself is often stateless and empty), so it -<span class="lineNum"> 351 </span> : * should be quite fast.) -<span class="lineNum"> 352 </span> : * Note that the global std::swap() function is specialized such that -<span class="lineNum"> 353 </span> : * std::swap(s1,s2) will feed to this function. -<span class="lineNum"> 354 </span> : */ -<span class="lineNum"> 355 </span> : void -<span class="lineNum"> 356 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 357 </span> : swap(set&& __x) -<span class="lineNum"> 358 </span> : #else -<span class="lineNum"> 359 </span> : swap(set& __x) -<span class="lineNum"> 360 </span> : #endif -<span class="lineNum"> 361 </span> : { _M_t.swap(__x._M_t); } -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : // insert/erase -<span class="lineNum"> 364 </span> : /** -<span class="lineNum"> 365 </span> : * @brief Attempts to insert an element into the %set. -<span class="lineNum"> 366 </span> : * @param x Element to be inserted. -<span class="lineNum"> 367 </span> : * @return A pair, of which the first element is an iterator that points -<span class="lineNum"> 368 </span> : * to the possibly inserted element, and the second is a bool -<span class="lineNum"> 369 </span> : * that is true if the element was actually inserted. -<span class="lineNum"> 370 </span> : * -<span class="lineNum"> 371 </span> : * This function attempts to insert an element into the %set. A %set -<span class="lineNum"> 372 </span> : * relies on unique keys and thus an element is only inserted if it is -<span class="lineNum"> 373 </span> : * not already present in the %set. -<span class="lineNum"> 374 </span> : * -<span class="lineNum"> 375 </span> : * Insertion requires logarithmic time. -<span class="lineNum"> 376 </span> : */ -<span class="lineNum"> 377 </span> : std::pair<iterator, bool> -<span class="lineNum"> 378 </span><span class="lineCov"> 1422360 : insert(const value_type& __x)</span> -<span class="lineNum"> 379 </span> : { -<span class="lineNum"> 380 </span> : std::pair<typename _Rep_type::iterator, bool> __p = -<span class="lineNum"> 381 </span><span class="lineCov"> 1422360 : _M_t._M_insert_unique(__x);</span> -<span class="lineNum"> 382 </span><span class="lineCov"> 1422360 : return std::pair<iterator, bool>(__p.first, __p.second);</span> -<span class="lineNum"> 383 </span> : } -<span class="lineNum"> 384 </span> : -<span class="lineNum"> 385 </span> : /** -<span class="lineNum"> 386 </span> : * @brief Attempts to insert an element into the %set. -<span class="lineNum"> 387 </span> : * @param position An iterator that serves as a hint as to where the -<span class="lineNum"> 388 </span> : * element should be inserted. -<span class="lineNum"> 389 </span> : * @param x Element to be inserted. -<span class="lineNum"> 390 </span> : * @return An iterator that points to the element with key of @a x (may -<span class="lineNum"> 391 </span> : * or may not be the element passed in). -<span class="lineNum"> 392 </span> : * -<span class="lineNum"> 393 </span> : * This function is not concerned about whether the insertion took place, -<span class="lineNum"> 394 </span> : * and thus does not return a boolean like the single-argument insert() -<span class="lineNum"> 395 </span> : * does. Note that the first parameter is only a hint and can -<span class="lineNum"> 396 </span> : * potentially improve the performance of the insertion process. A bad -<span class="lineNum"> 397 </span> : * hint would cause no gains in efficiency. -<span class="lineNum"> 398 </span> : * -<span class="lineNum"> 399 </span> : * See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 -<span class="lineNum"> 400 </span> : * for more on "hinting". -<span class="lineNum"> 401 </span> : * -<span class="lineNum"> 402 </span> : * Insertion requires logarithmic time (if the hint is not taken). -<span class="lineNum"> 403 </span> : */ -<span class="lineNum"> 404 </span> : iterator -<span class="lineNum"> 405 </span><span class="lineCov"> 107613 : insert(iterator __position, const value_type& __x)</span> -<span class="lineNum"> 406 </span><span class="lineCov"> 107613 : { return _M_t._M_insert_unique_(__position, __x); }</span> -<span class="lineNum"> 407 </span> : -<span class="lineNum"> 408 </span> : /** -<span class="lineNum"> 409 </span> : * @brief A template function that attempts to insert a range of elements. -<span class="lineNum"> 410 </span> : * @param first Iterator pointing to the start of the range to be -<span class="lineNum"> 411 </span> : * inserted. -<span class="lineNum"> 412 </span> : * @param last Iterator pointing to the end of the range. -<span class="lineNum"> 413 </span> : * -<span class="lineNum"> 414 </span> : * Complexity similar to that of the range constructor. -<span class="lineNum"> 415 </span> : */ -<span class="lineNum"> 416 </span> : template<typename _InputIterator> -<span class="lineNum"> 417 </span> : void -<span class="lineNum"> 418 </span> : insert(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 419 </span> : { _M_t._M_insert_unique(__first, __last); } -<span class="lineNum"> 420 </span> : -<span class="lineNum"> 421 </span> : /** -<span class="lineNum"> 422 </span> : * @brief Erases an element from a %set. -<span class="lineNum"> 423 </span> : * @param position An iterator pointing to the element to be erased. -<span class="lineNum"> 424 </span> : * -<span class="lineNum"> 425 </span> : * This function erases an element, pointed to by the given iterator, -<span class="lineNum"> 426 </span> : * from a %set. Note that this function only erases the element, and -<span class="lineNum"> 427 </span> : * that if the element is itself a pointer, the pointed-to memory is not -<span class="lineNum"> 428 </span> : * touched in any way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 429 </span> : */ -<span class="lineNum"> 430 </span> : void -<span class="lineNum"> 431 </span><span class="lineCov"> 129 : erase(iterator __position)</span> -<span class="lineNum"> 432 </span><span class="lineCov"> 129 : { _M_t.erase(__position); }</span> -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : /** -<span class="lineNum"> 435 </span> : * @brief Erases elements according to the provided key. -<span class="lineNum"> 436 </span> : * @param x Key of element to be erased. -<span class="lineNum"> 437 </span> : * @return The number of elements erased. -<span class="lineNum"> 438 </span> : * -<span class="lineNum"> 439 </span> : * This function erases all the elements located by the given key from -<span class="lineNum"> 440 </span> : * a %set. -<span class="lineNum"> 441 </span> : * Note that this function only erases the element, and that if -<span class="lineNum"> 442 </span> : * the element is itself a pointer, the pointed-to memory is not touched -<span class="lineNum"> 443 </span> : * in any way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 444 </span> : */ -<span class="lineNum"> 445 </span> : size_type -<span class="lineNum"> 446 </span><span class="lineCov"> 9 : erase(const key_type& __x)</span> -<span class="lineNum"> 447 </span><span class="lineCov"> 9 : { return _M_t.erase(__x); }</span> -<span class="lineNum"> 448 </span> : -<span class="lineNum"> 449 </span> : /** -<span class="lineNum"> 450 </span> : * @brief Erases a [first,last) range of elements from a %set. -<span class="lineNum"> 451 </span> : * @param first Iterator pointing to the start of the range to be -<span class="lineNum"> 452 </span> : * erased. -<span class="lineNum"> 453 </span> : * @param last Iterator pointing to the end of the range to be erased. -<span class="lineNum"> 454 </span> : * -<span class="lineNum"> 455 </span> : * This function erases a sequence of elements from a %set. -<span class="lineNum"> 456 </span> : * Note that this function only erases the element, and that if -<span class="lineNum"> 457 </span> : * the element is itself a pointer, the pointed-to memory is not touched -<span class="lineNum"> 458 </span> : * in any way. Managing the pointer is the user's responsibility. -<span class="lineNum"> 459 </span> : */ -<span class="lineNum"> 460 </span> : void -<span class="lineNum"> 461 </span> : erase(iterator __first, iterator __last) -<span class="lineNum"> 462 </span> : { _M_t.erase(__first, __last); } -<span class="lineNum"> 463 </span> : -<span class="lineNum"> 464 </span> : /** -<span class="lineNum"> 465 </span> : * Erases all elements in a %set. Note that this function only erases -<span class="lineNum"> 466 </span> : * the elements, and that if the elements themselves are pointers, the -<span class="lineNum"> 467 </span> : * pointed-to memory is not touched in any way. Managing the pointer is -<span class="lineNum"> 468 </span> : * the user's responsibility. -<span class="lineNum"> 469 </span> : */ -<span class="lineNum"> 470 </span> : void -<span class="lineNum"> 471 </span><span class="lineCov"> 84600 : clear()</span> -<span class="lineNum"> 472 </span><span class="lineCov"> 84600 : { _M_t.clear(); }</span> -<span class="lineNum"> 473 </span> : -<span class="lineNum"> 474 </span> : // set operations: -<span class="lineNum"> 475 </span> : -<span class="lineNum"> 476 </span> : /** -<span class="lineNum"> 477 </span> : * @brief Finds the number of elements. -<span class="lineNum"> 478 </span> : * @param x Element to located. -<span class="lineNum"> 479 </span> : * @return Number of elements with specified key. -<span class="lineNum"> 480 </span> : * -<span class="lineNum"> 481 </span> : * This function only makes sense for multisets; for set the result will -<span class="lineNum"> 482 </span> : * either be 0 (not present) or 1 (present). -<span class="lineNum"> 483 </span> : */ -<span class="lineNum"> 484 </span> : size_type -<span class="lineNum"> 485 </span> : count(const key_type& __x) const -<span class="lineNum"> 486 </span> : { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } -<span class="lineNum"> 487 </span> : -<span class="lineNum"> 488 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 489 </span> : // 214. set::find() missing const overload -<span class="lineNum"> 490 </span> : //@{ -<span class="lineNum"> 491 </span> : /** -<span class="lineNum"> 492 </span> : * @brief Tries to locate an element in a %set. -<span class="lineNum"> 493 </span> : * @param x Element to be located. -<span class="lineNum"> 494 </span> : * @return Iterator pointing to sought-after element, or end() if not -<span class="lineNum"> 495 </span> : * found. -<span class="lineNum"> 496 </span> : * -<span class="lineNum"> 497 </span> : * This function takes a key and tries to locate the element with which -<span class="lineNum"> 498 </span> : * the key matches. If successful the function returns an iterator -<span class="lineNum"> 499 </span> : * pointing to the sought after element. If unsuccessful it returns the -<span class="lineNum"> 500 </span> : * past-the-end ( @c end() ) iterator. -<span class="lineNum"> 501 </span> : */ -<span class="lineNum"> 502 </span> : iterator -<span class="lineNum"> 503 </span><span class="lineCov"> 39 : find(const key_type& __x)</span> -<span class="lineNum"> 504 </span><span class="lineCov"> 39 : { return _M_t.find(__x); }</span> -<span class="lineNum"> 505 </span> : -<span class="lineNum"> 506 </span> : const_iterator -<span class="lineNum"> 507 </span><span class="lineCov"> 16 : find(const key_type& __x) const</span> -<span class="lineNum"> 508 </span><span class="lineCov"> 16 : { return _M_t.find(__x); }</span> -<span class="lineNum"> 509 </span> : //@} -<span class="lineNum"> 510 </span> : -<span class="lineNum"> 511 </span> : //@{ -<span class="lineNum"> 512 </span> : /** -<span class="lineNum"> 513 </span> : * @brief Finds the beginning of a subsequence matching given key. -<span class="lineNum"> 514 </span> : * @param x Key to be located. -<span class="lineNum"> 515 </span> : * @return Iterator pointing to first element equal to or greater -<span class="lineNum"> 516 </span> : * than key, or end(). -<span class="lineNum"> 517 </span> : * -<span class="lineNum"> 518 </span> : * This function returns the first element of a subsequence of elements -<span class="lineNum"> 519 </span> : * that matches the given key. If unsuccessful it returns an iterator -<span class="lineNum"> 520 </span> : * pointing to the first element that has a greater value than given key -<span class="lineNum"> 521 </span> : * or end() if no such element exists. -<span class="lineNum"> 522 </span> : */ -<span class="lineNum"> 523 </span> : iterator -<span class="lineNum"> 524 </span> : lower_bound(const key_type& __x) -<span class="lineNum"> 525 </span> : { return _M_t.lower_bound(__x); } -<span class="lineNum"> 526 </span> : -<span class="lineNum"> 527 </span> : const_iterator -<span class="lineNum"> 528 </span> : lower_bound(const key_type& __x) const -<span class="lineNum"> 529 </span> : { return _M_t.lower_bound(__x); } -<span class="lineNum"> 530 </span> : //@} -<span class="lineNum"> 531 </span> : -<span class="lineNum"> 532 </span> : //@{ -<span class="lineNum"> 533 </span> : /** -<span class="lineNum"> 534 </span> : * @brief Finds the end of a subsequence matching given key. -<span class="lineNum"> 535 </span> : * @param x Key to be located. -<span class="lineNum"> 536 </span> : * @return Iterator pointing to the first element -<span class="lineNum"> 537 </span> : * greater than key, or end(). -<span class="lineNum"> 538 </span> : */ -<span class="lineNum"> 539 </span> : iterator -<span class="lineNum"> 540 </span> : upper_bound(const key_type& __x) -<span class="lineNum"> 541 </span> : { return _M_t.upper_bound(__x); } -<span class="lineNum"> 542 </span> : -<span class="lineNum"> 543 </span> : const_iterator -<span class="lineNum"> 544 </span> : upper_bound(const key_type& __x) const -<span class="lineNum"> 545 </span> : { return _M_t.upper_bound(__x); } -<span class="lineNum"> 546 </span> : //@} -<span class="lineNum"> 547 </span> : -<span class="lineNum"> 548 </span> : //@{ -<span class="lineNum"> 549 </span> : /** -<span class="lineNum"> 550 </span> : * @brief Finds a subsequence matching given key. -<span class="lineNum"> 551 </span> : * @param x Key to be located. -<span class="lineNum"> 552 </span> : * @return Pair of iterators that possibly points to the subsequence -<span class="lineNum"> 553 </span> : * matching given key. -<span class="lineNum"> 554 </span> : * -<span class="lineNum"> 555 </span> : * This function is equivalent to -<span class="lineNum"> 556 </span> : * @code -<span class="lineNum"> 557 </span> : * std::make_pair(c.lower_bound(val), -<span class="lineNum"> 558 </span> : * c.upper_bound(val)) -<span class="lineNum"> 559 </span> : * @endcode -<span class="lineNum"> 560 </span> : * (but is faster than making the calls separately). -<span class="lineNum"> 561 </span> : * -<span class="lineNum"> 562 </span> : * This function probably only makes sense for multisets. -<span class="lineNum"> 563 </span> : */ -<span class="lineNum"> 564 </span> : std::pair<iterator, iterator> -<span class="lineNum"> 565 </span> : equal_range(const key_type& __x) -<span class="lineNum"> 566 </span> : { return _M_t.equal_range(__x); } -<span class="lineNum"> 567 </span> : -<span class="lineNum"> 568 </span> : std::pair<const_iterator, const_iterator> -<span class="lineNum"> 569 </span> : equal_range(const key_type& __x) const -<span class="lineNum"> 570 </span> : { return _M_t.equal_range(__x); } -<span class="lineNum"> 571 </span> : //@} -<span class="lineNum"> 572 </span> : -<span class="lineNum"> 573 </span> : template<typename _K1, typename _C1, typename _A1> -<span class="lineNum"> 574 </span> : friend bool -<span class="lineNum"> 575 </span> : operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); -<span class="lineNum"> 576 </span> : -<span class="lineNum"> 577 </span> : template<typename _K1, typename _C1, typename _A1> -<span class="lineNum"> 578 </span> : friend bool -<span class="lineNum"> 579 </span> : operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&); -<span class="lineNum"> 580 </span> : }; -<span class="lineNum"> 581 </span> : -<span class="lineNum"> 582 </span> : -<span class="lineNum"> 583 </span> : /** -<span class="lineNum"> 584 </span> : * @brief Set equality comparison. -<span class="lineNum"> 585 </span> : * @param x A %set. -<span class="lineNum"> 586 </span> : * @param y A %set of the same type as @a x. -<span class="lineNum"> 587 </span> : * @return True iff the size and elements of the sets are equal. -<span class="lineNum"> 588 </span> : * -<span class="lineNum"> 589 </span> : * This is an equivalence relation. It is linear in the size of the sets. -<span class="lineNum"> 590 </span> : * Sets are considered equivalent if their sizes are equal, and if -<span class="lineNum"> 591 </span> : * corresponding elements compare equal. -<span class="lineNum"> 592 </span> : */ -<span class="lineNum"> 593 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 594 </span> : inline bool -<span class="lineNum"> 595 </span> : operator==(const set<_Key, _Compare, _Alloc>& __x, -<span class="lineNum"> 596 </span><span class="lineCov"> 4 : const set<_Key, _Compare, _Alloc>& __y)</span> -<span class="lineNum"> 597 </span><span class="lineCov"> 4 : { return __x._M_t == __y._M_t; }</span> -<span class="lineNum"> 598 </span> : -<span class="lineNum"> 599 </span> : /** -<span class="lineNum"> 600 </span> : * @brief Set ordering relation. -<span class="lineNum"> 601 </span> : * @param x A %set. -<span class="lineNum"> 602 </span> : * @param y A %set of the same type as @a x. -<span class="lineNum"> 603 </span> : * @return True iff @a x is lexicographically less than @a y. -<span class="lineNum"> 604 </span> : * -<span class="lineNum"> 605 </span> : * This is a total ordering relation. It is linear in the size of the -<span class="lineNum"> 606 </span> : * maps. The elements must be comparable with @c <. -<span class="lineNum"> 607 </span> : * -<span class="lineNum"> 608 </span> : * See std::lexicographical_compare() for how the determination is made. -<span class="lineNum"> 609 </span> : */ -<span class="lineNum"> 610 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 611 </span> : inline bool -<span class="lineNum"> 612 </span> : operator<(const set<_Key, _Compare, _Alloc>& __x, -<span class="lineNum"> 613 </span> : const set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 614 </span> : { return __x._M_t < __y._M_t; } -<span class="lineNum"> 615 </span> : -<span class="lineNum"> 616 </span> : /// Returns !(x == y). -<span class="lineNum"> 617 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 618 </span> : inline bool -<span class="lineNum"> 619 </span> : operator!=(const set<_Key, _Compare, _Alloc>& __x, -<span class="lineNum"> 620 </span> : const set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 621 </span> : { return !(__x == __y); } -<span class="lineNum"> 622 </span> : -<span class="lineNum"> 623 </span> : /// Returns y < x. -<span class="lineNum"> 624 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 625 </span> : inline bool -<span class="lineNum"> 626 </span> : operator>(const set<_Key, _Compare, _Alloc>& __x, -<span class="lineNum"> 627 </span> : const set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 628 </span> : { return __y < __x; } -<span class="lineNum"> 629 </span> : -<span class="lineNum"> 630 </span> : /// Returns !(y < x) -<span class="lineNum"> 631 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 632 </span> : inline bool -<span class="lineNum"> 633 </span> : operator<=(const set<_Key, _Compare, _Alloc>& __x, -<span class="lineNum"> 634 </span> : const set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 635 </span> : { return !(__y < __x); } -<span class="lineNum"> 636 </span> : -<span class="lineNum"> 637 </span> : /// Returns !(x < y) -<span class="lineNum"> 638 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 639 </span> : inline bool -<span class="lineNum"> 640 </span> : operator>=(const set<_Key, _Compare, _Alloc>& __x, -<span class="lineNum"> 641 </span> : const set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 642 </span> : { return !(__x < __y); } -<span class="lineNum"> 643 </span> : -<span class="lineNum"> 644 </span> : /// See std::set::swap(). -<span class="lineNum"> 645 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 646 </span> : inline void -<span class="lineNum"> 647 </span> : swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 648 </span> : { __x.swap(__y); } -<span class="lineNum"> 649 </span> : -<span class="lineNum"> 650 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 651 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 652 </span> : inline void -<span class="lineNum"> 653 </span> : swap(set<_Key, _Compare, _Alloc>&& __x, set<_Key, _Compare, _Alloc>& __y) -<span class="lineNum"> 654 </span> : { __x.swap(__y); } -<span class="lineNum"> 655 </span> : -<span class="lineNum"> 656 </span> : template<typename _Key, typename _Compare, typename _Alloc> -<span class="lineNum"> 657 </span> : inline void -<span class="lineNum"> 658 </span> : swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>&& __y) -<span class="lineNum"> 659 </span> : { __x.swap(__y); } -<span class="lineNum"> 660 </span> : #endif -<span class="lineNum"> 661 </span> : -<span class="lineNum"> 662 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 663 </span> : -<span class="lineNum"> 664 </span> : #endif /* _STL_SET_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_stack.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_stack.h.gcov.html deleted file mode 100644 index d033bc3..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_stack.h.gcov.html +++ /dev/null @@ -1,369 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_stack.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_stack.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Stack implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_stack.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_STACK_H -<span class="lineNum"> 63 </span> : #define _STL_STACK_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 66 </span> : #include <debug/debug.h> -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : /** -<span class="lineNum"> 71 </span> : * @brief A standard container giving FILO behavior. -<span class="lineNum"> 72 </span> : * -<span class="lineNum"> 73 </span> : * @ingroup Containers -<span class="lineNum"> 74 </span> : * @ingroup Sequences -<span class="lineNum"> 75 </span> : * -<span class="lineNum"> 76 </span> : * Meets many of the requirements of a -<span class="lineNum"> 77 </span> : * <a href="tables.html#65">container</a>, -<span class="lineNum"> 78 </span> : * but does not define anything to do with iterators. Very few of the -<span class="lineNum"> 79 </span> : * other standard container interfaces are defined. -<span class="lineNum"> 80 </span> : * -<span class="lineNum"> 81 </span> : * This is not a true container, but an @e adaptor. It holds -<span class="lineNum"> 82 </span> : * another container, and provides a wrapper interface to that -<span class="lineNum"> 83 </span> : * container. The wrapper is what enforces strict -<span class="lineNum"> 84 </span> : * first-in-last-out %stack behavior. -<span class="lineNum"> 85 </span> : * -<span class="lineNum"> 86 </span> : * The second template parameter defines the type of the underlying -<span class="lineNum"> 87 </span> : * sequence/container. It defaults to std::deque, but it can be -<span class="lineNum"> 88 </span> : * any type that supports @c back, @c push_back, and @c pop_front, -<span class="lineNum"> 89 </span> : * such as std::list, std::vector, or an appropriate user-defined -<span class="lineNum"> 90 </span> : * type. -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * Members not found in "normal" containers are @c container_type, -<span class="lineNum"> 93 </span> : * which is a typedef for the second Sequence parameter, and @c -<span class="lineNum"> 94 </span> : * push, @c pop, and @c top, which are standard %stack/FILO -<span class="lineNum"> 95 </span> : * operations. -<span class="lineNum"> 96 </span> : */ -<span class="lineNum"> 97 </span> : template<typename _Tp, typename _Sequence = deque<_Tp> > -<span class="lineNum"> 98 </span> : class stack -<span class="lineNum"> 99 </span><span class="lineCov"> 13 : {</span> -<span class="lineNum"> 100 </span> : // concept requirements -<span class="lineNum"> 101 </span> : typedef typename _Sequence::value_type _Sequence_value_type; -<span class="lineNum"> 102 </span> : __glibcxx_class_requires(_Tp, _SGIAssignableConcept) -<span class="lineNum"> 103 </span> : __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept) -<span class="lineNum"> 104 </span> : __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : template<typename _Tp1, typename _Seq1> -<span class="lineNum"> 107 </span> : friend bool -<span class="lineNum"> 108 </span> : operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : template<typename _Tp1, typename _Seq1> -<span class="lineNum"> 111 </span> : friend bool -<span class="lineNum"> 112 </span> : operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : public: -<span class="lineNum"> 115 </span> : typedef typename _Sequence::value_type value_type; -<span class="lineNum"> 116 </span> : typedef typename _Sequence::reference reference; -<span class="lineNum"> 117 </span> : typedef typename _Sequence::const_reference const_reference; -<span class="lineNum"> 118 </span> : typedef typename _Sequence::size_type size_type; -<span class="lineNum"> 119 </span> : typedef _Sequence container_type; -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : protected: -<span class="lineNum"> 122 </span> : // See queue::c for notes on this name. -<span class="lineNum"> 123 </span> : _Sequence c; -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : public: -<span class="lineNum"> 126 </span> : // XXX removed old def ctor, added def arg to this one to match 14882 -<span class="lineNum"> 127 </span> : /** -<span class="lineNum"> 128 </span> : * @brief Default constructor creates no elements. -<span class="lineNum"> 129 </span> : */ -<span class="lineNum"> 130 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 131 </span> : explicit -<span class="lineNum"> 132 </span><span class="lineCov"> 13 : stack(const _Sequence& __c = _Sequence())</span> -<span class="lineNum"> 133 </span><span class="lineCov"> 13 : : c(__c) { }</span> -<span class="lineNum"> 134 </span> : #else -<span class="lineNum"> 135 </span> : explicit -<span class="lineNum"> 136 </span> : stack(const _Sequence& __c) -<span class="lineNum"> 137 </span> : : c(__c) { } -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : explicit -<span class="lineNum"> 140 </span> : stack(_Sequence&& __c = _Sequence()) -<span class="lineNum"> 141 </span> : : c(std::move(__c)) { } -<span class="lineNum"> 142 </span> : #endif -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : /** -<span class="lineNum"> 145 </span> : * Returns true if the %stack is empty. -<span class="lineNum"> 146 </span> : */ -<span class="lineNum"> 147 </span> : bool -<span class="lineNum"> 148 </span><span class="lineCov"> 32 : empty() const</span> -<span class="lineNum"> 149 </span><span class="lineCov"> 32 : { return c.empty(); }</span> -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span> : /** Returns the number of elements in the %stack. */ -<span class="lineNum"> 152 </span> : size_type -<span class="lineNum"> 153 </span> : size() const -<span class="lineNum"> 154 </span> : { return c.size(); } -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : /** -<span class="lineNum"> 157 </span> : * Returns a read/write reference to the data at the first -<span class="lineNum"> 158 </span> : * element of the %stack. -<span class="lineNum"> 159 </span> : */ -<span class="lineNum"> 160 </span> : reference -<span class="lineNum"> 161 </span><span class="lineCov"> 39 : top()</span> -<span class="lineNum"> 162 </span> : { -<span class="lineNum"> 163 </span> : __glibcxx_requires_nonempty(); -<span class="lineNum"> 164 </span><span class="lineCov"> 39 : return c.back();</span> -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /** -<span class="lineNum"> 168 </span> : * Returns a read-only (constant) reference to the data at the first -<span class="lineNum"> 169 </span> : * element of the %stack. -<span class="lineNum"> 170 </span> : */ -<span class="lineNum"> 171 </span> : const_reference -<span class="lineNum"> 172 </span> : top() const -<span class="lineNum"> 173 </span> : { -<span class="lineNum"> 174 </span> : __glibcxx_requires_nonempty(); -<span class="lineNum"> 175 </span> : return c.back(); -<span class="lineNum"> 176 </span> : } -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : /** -<span class="lineNum"> 179 </span> : * @brief Add data to the top of the %stack. -<span class="lineNum"> 180 </span> : * @param x Data to be added. -<span class="lineNum"> 181 </span> : * -<span class="lineNum"> 182 </span> : * This is a typical %stack operation. The function creates an -<span class="lineNum"> 183 </span> : * element at the top of the %stack and assigns the given data -<span class="lineNum"> 184 </span> : * to it. The time complexity of the operation depends on the -<span class="lineNum"> 185 </span> : * underlying sequence. -<span class="lineNum"> 186 </span> : */ -<span class="lineNum"> 187 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 188 </span> : void -<span class="lineNum"> 189 </span><span class="lineCov"> 24 : push(const value_type& __x)</span> -<span class="lineNum"> 190 </span><span class="lineCov"> 24 : { c.push_back(__x); }</span> -<span class="lineNum"> 191 </span> : #else -<span class="lineNum"> 192 </span> : // NB: DR 756. -<span class="lineNum"> 193 </span> : template<typename... _Args> -<span class="lineNum"> 194 </span> : void -<span class="lineNum"> 195 </span> : push(_Args&&... __args) -<span class="lineNum"> 196 </span> : { c.push_back(std::forward<_Args>(__args)...); } -<span class="lineNum"> 197 </span> : #endif -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : /** -<span class="lineNum"> 200 </span> : * @brief Removes first element. -<span class="lineNum"> 201 </span> : * -<span class="lineNum"> 202 </span> : * This is a typical %stack operation. It shrinks the %stack -<span class="lineNum"> 203 </span> : * by one. The time complexity of the operation depends on the -<span class="lineNum"> 204 </span> : * underlying sequence. -<span class="lineNum"> 205 </span> : * -<span class="lineNum"> 206 </span> : * Note that no data is returned, and if the first element's -<span class="lineNum"> 207 </span> : * data is needed, it should be retrieved before pop() is -<span class="lineNum"> 208 </span> : * called. -<span class="lineNum"> 209 </span> : */ -<span class="lineNum"> 210 </span> : void -<span class="lineNum"> 211 </span><span class="lineCov"> 24 : pop()</span> -<span class="lineNum"> 212 </span> : { -<span class="lineNum"> 213 </span> : __glibcxx_requires_nonempty(); -<span class="lineNum"> 214 </span><span class="lineCov"> 24 : c.pop_back();</span> -<span class="lineNum"> 215 </span><span class="lineCov"> 24 : }</span> -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 218 </span> : void -<span class="lineNum"> 219 </span> : swap(stack&& __s) -<span class="lineNum"> 220 </span> : { c.swap(__s.c); } -<span class="lineNum"> 221 </span> : #endif -<span class="lineNum"> 222 </span> : }; -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : /** -<span class="lineNum"> 225 </span> : * @brief Stack equality comparison. -<span class="lineNum"> 226 </span> : * @param x A %stack. -<span class="lineNum"> 227 </span> : * @param y A %stack of the same type as @a x. -<span class="lineNum"> 228 </span> : * @return True iff the size and elements of the stacks are equal. -<span class="lineNum"> 229 </span> : * -<span class="lineNum"> 230 </span> : * This is an equivalence relation. Complexity and semantics -<span class="lineNum"> 231 </span> : * depend on the underlying sequence type, but the expected rules -<span class="lineNum"> 232 </span> : * are: this relation is linear in the size of the sequences, and -<span class="lineNum"> 233 </span> : * stacks are considered equivalent if their sequences compare -<span class="lineNum"> 234 </span> : * equal. -<span class="lineNum"> 235 </span> : */ -<span class="lineNum"> 236 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 237 </span> : inline bool -<span class="lineNum"> 238 </span> : operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) -<span class="lineNum"> 239 </span> : { return __x.c == __y.c; } -<span class="lineNum"> 240 </span> : -<span class="lineNum"> 241 </span> : /** -<span class="lineNum"> 242 </span> : * @brief Stack ordering relation. -<span class="lineNum"> 243 </span> : * @param x A %stack. -<span class="lineNum"> 244 </span> : * @param y A %stack of the same type as @a x. -<span class="lineNum"> 245 </span> : * @return True iff @a x is lexicographically less than @a y. -<span class="lineNum"> 246 </span> : * -<span class="lineNum"> 247 </span> : * This is an total ordering relation. Complexity and semantics -<span class="lineNum"> 248 </span> : * depend on the underlying sequence type, but the expected rules -<span class="lineNum"> 249 </span> : * are: this relation is linear in the size of the sequences, the -<span class="lineNum"> 250 </span> : * elements must be comparable with @c <, and -<span class="lineNum"> 251 </span> : * std::lexicographical_compare() is usually used to make the -<span class="lineNum"> 252 </span> : * determination. -<span class="lineNum"> 253 </span> : */ -<span class="lineNum"> 254 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 255 </span> : inline bool -<span class="lineNum"> 256 </span> : operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) -<span class="lineNum"> 257 </span> : { return __x.c < __y.c; } -<span class="lineNum"> 258 </span> : -<span class="lineNum"> 259 </span> : /// Based on operator== -<span class="lineNum"> 260 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 261 </span> : inline bool -<span class="lineNum"> 262 </span> : operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) -<span class="lineNum"> 263 </span> : { return !(__x == __y); } -<span class="lineNum"> 264 </span> : -<span class="lineNum"> 265 </span> : /// Based on operator< -<span class="lineNum"> 266 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 267 </span> : inline bool -<span class="lineNum"> 268 </span> : operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) -<span class="lineNum"> 269 </span> : { return __y < __x; } -<span class="lineNum"> 270 </span> : -<span class="lineNum"> 271 </span> : /// Based on operator< -<span class="lineNum"> 272 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 273 </span> : inline bool -<span class="lineNum"> 274 </span> : operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) -<span class="lineNum"> 275 </span> : { return !(__y < __x); } -<span class="lineNum"> 276 </span> : -<span class="lineNum"> 277 </span> : /// Based on operator< -<span class="lineNum"> 278 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 279 </span> : inline bool -<span class="lineNum"> 280 </span> : operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) -<span class="lineNum"> 281 </span> : { return !(__x < __y); } -<span class="lineNum"> 282 </span> : -<span class="lineNum"> 283 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 284 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 285 </span> : inline void -<span class="lineNum"> 286 </span> : swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y) -<span class="lineNum"> 287 </span> : { __x.swap(__y); } -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 290 </span> : inline void -<span class="lineNum"> 291 </span> : swap(stack<_Tp, _Seq>&& __x, stack<_Tp, _Seq>& __y) -<span class="lineNum"> 292 </span> : { __x.swap(__y); } -<span class="lineNum"> 293 </span> : -<span class="lineNum"> 294 </span> : template<typename _Tp, typename _Seq> -<span class="lineNum"> 295 </span> : inline void -<span class="lineNum"> 296 </span> : swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>&& __y) -<span class="lineNum"> 297 </span> : { __x.swap(__y); } -<span class="lineNum"> 298 </span> : #endif -<span class="lineNum"> 299 </span> : -<span class="lineNum"> 300 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 301 </span> : -<span class="lineNum"> 302 </span> : #endif /* _STL_STACK_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_tree.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_tree.h.gcov.html deleted file mode 100644 index 9827a27..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_tree.h.gcov.html +++ /dev/null @@ -1,1533 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_tree.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_tree.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">295</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">94.2 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">278</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // RB tree implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 34 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1994 -<span class="lineNum"> 46 </span> : * Hewlett-Packard Company -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : * -<span class="lineNum"> 56 </span> : * -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : /** @file stl_tree.h -<span class="lineNum"> 60 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 61 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 62 </span> : */ -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : #ifndef _STL_TREE_H -<span class="lineNum"> 65 </span> : #define _STL_TREE_H 1 -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : #include <bits/stl_algobase.h> -<span class="lineNum"> 68 </span> : #include <bits/allocator.h> -<span class="lineNum"> 69 </span> : #include <bits/stl_function.h> -<span class="lineNum"> 70 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : // Red-black tree class, designed for use in implementing STL -<span class="lineNum"> 75 </span> : // associative containers (set, multiset, map, and multimap). The -<span class="lineNum"> 76 </span> : // insertion and deletion algorithms are based on those in Cormen, -<span class="lineNum"> 77 </span> : // Leiserson, and Rivest, Introduction to Algorithms (MIT Press, -<span class="lineNum"> 78 </span> : // 1990), except that -<span class="lineNum"> 79 </span> : // -<span class="lineNum"> 80 </span> : // (1) the header cell is maintained with links not only to the root -<span class="lineNum"> 81 </span> : // but also to the leftmost node of the tree, to enable constant -<span class="lineNum"> 82 </span> : // time begin(), and to the rightmost node of the tree, to enable -<span class="lineNum"> 83 </span> : // linear time performance when used with the generic set algorithms -<span class="lineNum"> 84 </span> : // (set_union, etc.) -<span class="lineNum"> 85 </span> : // -<span class="lineNum"> 86 </span> : // (2) when a node being deleted has two children its successor node -<span class="lineNum"> 87 </span> : // is relinked into its place, rather than copied, so that the only -<span class="lineNum"> 88 </span> : // iterators invalidated are those referring to the deleted node. -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : enum _Rb_tree_color { _S_red = false, _S_black = true }; -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : struct _Rb_tree_node_base -<span class="lineNum"> 93 </span> : { -<span class="lineNum"> 94 </span> : typedef _Rb_tree_node_base* _Base_ptr; -<span class="lineNum"> 95 </span> : typedef const _Rb_tree_node_base* _Const_Base_ptr; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : _Rb_tree_color _M_color; -<span class="lineNum"> 98 </span> : _Base_ptr _M_parent; -<span class="lineNum"> 99 </span> : _Base_ptr _M_left; -<span class="lineNum"> 100 </span> : _Base_ptr _M_right; -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : static _Base_ptr -<span class="lineNum"> 103 </span><span class="lineCov"> 880633 : _S_minimum(_Base_ptr __x)</span> -<span class="lineNum"> 104 </span> : { -<span class="lineNum"> 105 </span><span class="lineCov"> 880633 : while (__x->_M_left != 0) __x = __x->_M_left;</span> -<span class="lineNum"> 106 </span><span class="lineCov"> 880633 : return __x;</span> -<span class="lineNum"> 107 </span> : } -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : static _Const_Base_ptr -<span class="lineNum"> 110 </span> : _S_minimum(_Const_Base_ptr __x) -<span class="lineNum"> 111 </span> : { -<span class="lineNum"> 112 </span> : while (__x->_M_left != 0) __x = __x->_M_left; -<span class="lineNum"> 113 </span> : return __x; -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : static _Base_ptr -<span class="lineNum"> 117 </span><span class="lineCov"> 880633 : _S_maximum(_Base_ptr __x)</span> -<span class="lineNum"> 118 </span> : { -<span class="lineNum"> 119 </span><span class="lineCov"> 880633 : while (__x->_M_right != 0) __x = __x->_M_right;</span> -<span class="lineNum"> 120 </span><span class="lineCov"> 880633 : return __x;</span> -<span class="lineNum"> 121 </span> : } -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : static _Const_Base_ptr -<span class="lineNum"> 124 </span> : _S_maximum(_Const_Base_ptr __x) -<span class="lineNum"> 125 </span> : { -<span class="lineNum"> 126 </span> : while (__x->_M_right != 0) __x = __x->_M_right; -<span class="lineNum"> 127 </span> : return __x; -<span class="lineNum"> 128 </span> : } -<span class="lineNum"> 129 </span> : }; -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : template<typename _Val> -<span class="lineNum"> 132 </span> : struct _Rb_tree_node : public _Rb_tree_node_base -<span class="lineNum"> 133 </span> : { -<span class="lineNum"> 134 </span> : typedef _Rb_tree_node<_Val>* _Link_type; -<span class="lineNum"> 135 </span> : _Val _M_value_field; -<span class="lineNum"> 136 </span> : }; -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : _Rb_tree_node_base* -<span class="lineNum"> 139 </span> : _Rb_tree_increment(_Rb_tree_node_base* __x); -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : const _Rb_tree_node_base* -<span class="lineNum"> 142 </span> : _Rb_tree_increment(const _Rb_tree_node_base* __x); -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : _Rb_tree_node_base* -<span class="lineNum"> 145 </span> : _Rb_tree_decrement(_Rb_tree_node_base* __x); -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : const _Rb_tree_node_base* -<span class="lineNum"> 148 </span> : _Rb_tree_decrement(const _Rb_tree_node_base* __x); -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : template<typename _Tp> -<span class="lineNum"> 151 </span> : struct _Rb_tree_iterator -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : typedef _Tp value_type; -<span class="lineNum"> 154 </span> : typedef _Tp& reference; -<span class="lineNum"> 155 </span> : typedef _Tp* pointer; -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : typedef bidirectional_iterator_tag iterator_category; -<span class="lineNum"> 158 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : typedef _Rb_tree_iterator<_Tp> _Self; -<span class="lineNum"> 161 </span> : typedef _Rb_tree_node_base::_Base_ptr _Base_ptr; -<span class="lineNum"> 162 </span> : typedef _Rb_tree_node<_Tp>* _Link_type; -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : _Rb_tree_iterator() -<span class="lineNum"> 165 </span> : : _M_node() { } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : explicit -<span class="lineNum"> 168 </span><span class="lineCov"> 4550329 : _Rb_tree_iterator(_Link_type __x)</span> -<span class="lineNum"> 169 </span><span class="lineCov"> 4550329 : : _M_node(__x) { }</span> -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : reference -<span class="lineNum"> 172 </span><span class="lineCov"> 9593 : operator*() const</span> -<span class="lineNum"> 173 </span><span class="lineCov"> 9593 : { return static_cast<_Link_type>(_M_node)->_M_value_field; }</span> -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : pointer -<span class="lineNum"> 176 </span><span class="lineCov"> 32985 : operator->() const</span> -<span class="lineNum"> 177 </span><span class="lineCov"> 32985 : { return &static_cast<_Link_type>(_M_node)->_M_value_field; }</span> -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : _Self& -<span class="lineNum"> 180 </span> : operator++() -<span class="lineNum"> 181 </span> : { -<span class="lineNum"> 182 </span> : _M_node = _Rb_tree_increment(_M_node); -<span class="lineNum"> 183 </span> : return *this; -<span class="lineNum"> 184 </span> : } -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span> : _Self -<span class="lineNum"> 187 </span><span class="lineCov"> 658 : operator++(int)</span> -<span class="lineNum"> 188 </span> : { -<span class="lineNum"> 189 </span><span class="lineCov"> 658 : _Self __tmp = *this;</span> -<span class="lineNum"> 190 </span><span class="lineCov"> 658 : _M_node = _Rb_tree_increment(_M_node);</span> -<span class="lineNum"> 191 </span> : return __tmp; -<span class="lineNum"> 192 </span> : } -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : _Self& -<span class="lineNum"> 195 </span><span class="lineCov"> 83333 : operator--()</span> -<span class="lineNum"> 196 </span> : { -<span class="lineNum"> 197 </span><span class="lineCov"> 83333 : _M_node = _Rb_tree_decrement(_M_node);</span> -<span class="lineNum"> 198 </span><span class="lineCov"> 83333 : return *this;</span> -<span class="lineNum"> 199 </span> : } -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : _Self -<span class="lineNum"> 202 </span> : operator--(int) -<span class="lineNum"> 203 </span> : { -<span class="lineNum"> 204 </span> : _Self __tmp = *this; -<span class="lineNum"> 205 </span> : _M_node = _Rb_tree_decrement(_M_node); -<span class="lineNum"> 206 </span> : return __tmp; -<span class="lineNum"> 207 </span> : } -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : bool -<span class="lineNum"> 210 </span><span class="lineCov"> 638793 : operator==(const _Self& __x) const</span> -<span class="lineNum"> 211 </span><span class="lineCov"> 638793 : { return _M_node == __x._M_node; }</span> -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : bool -<span class="lineNum"> 214 </span><span class="lineCov"> 749 : operator!=(const _Self& __x) const</span> -<span class="lineNum"> 215 </span><span class="lineCov"> 749 : { return _M_node != __x._M_node; }</span> -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : _Base_ptr _M_node; -<span class="lineNum"> 218 </span> : }; -<span class="lineNum"> 219 </span> : -<span class="lineNum"> 220 </span> : template<typename _Tp> -<span class="lineNum"> 221 </span> : struct _Rb_tree_const_iterator -<span class="lineNum"> 222 </span> : { -<span class="lineNum"> 223 </span> : typedef _Tp value_type; -<span class="lineNum"> 224 </span> : typedef const _Tp& reference; -<span class="lineNum"> 225 </span> : typedef const _Tp* pointer; -<span class="lineNum"> 226 </span> : -<span class="lineNum"> 227 </span> : typedef _Rb_tree_iterator<_Tp> iterator; -<span class="lineNum"> 228 </span> : -<span class="lineNum"> 229 </span> : typedef bidirectional_iterator_tag iterator_category; -<span class="lineNum"> 230 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 231 </span> : -<span class="lineNum"> 232 </span> : typedef _Rb_tree_const_iterator<_Tp> _Self; -<span class="lineNum"> 233 </span> : typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr; -<span class="lineNum"> 234 </span> : typedef const _Rb_tree_node<_Tp>* _Link_type; -<span class="lineNum"> 235 </span> : -<span class="lineNum"> 236 </span> : _Rb_tree_const_iterator() -<span class="lineNum"> 237 </span> : : _M_node() { } -<span class="lineNum"> 238 </span> : -<span class="lineNum"> 239 </span> : explicit -<span class="lineNum"> 240 </span><span class="lineCov"> 2494703 : _Rb_tree_const_iterator(_Link_type __x)</span> -<span class="lineNum"> 241 </span><span class="lineCov"> 2494703 : : _M_node(__x) { }</span> -<span class="lineNum"> 242 </span> : -<span class="lineNum"> 243 </span><span class="lineCov"> 1643427 : _Rb_tree_const_iterator(const iterator& __it)</span> -<span class="lineNum"> 244 </span><span class="lineCov"> 1643427 : : _M_node(__it._M_node) { }</span> -<span class="lineNum"> 245 </span> : -<span class="lineNum"> 246 </span> : reference -<span class="lineNum"> 247 </span><span class="lineCov"> 1553025 : operator*() const</span> -<span class="lineNum"> 248 </span><span class="lineCov"> 1553025 : { return static_cast<_Link_type>(_M_node)->_M_value_field; }</span> -<span class="lineNum"> 249 </span> : -<span class="lineNum"> 250 </span> : pointer -<span class="lineNum"> 251 </span><span class="lineCov"> 817027 : operator->() const</span> -<span class="lineNum"> 252 </span><span class="lineCov"> 817027 : { return &static_cast<_Link_type>(_M_node)->_M_value_field; }</span> -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : _Self& -<span class="lineNum"> 255 </span><span class="lineCov"> 1717591 : operator++()</span> -<span class="lineNum"> 256 </span> : { -<span class="lineNum"> 257 </span><span class="lineCov"> 1717591 : _M_node = _Rb_tree_increment(_M_node);</span> -<span class="lineNum"> 258 </span><span class="lineCov"> 1717591 : return *this;</span> -<span class="lineNum"> 259 </span> : } -<span class="lineNum"> 260 </span> : -<span class="lineNum"> 261 </span> : _Self -<span class="lineNum"> 262 </span><span class="lineCov"> 9048 : operator++(int)</span> -<span class="lineNum"> 263 </span> : { -<span class="lineNum"> 264 </span><span class="lineCov"> 9048 : _Self __tmp = *this;</span> -<span class="lineNum"> 265 </span><span class="lineCov"> 9048 : _M_node = _Rb_tree_increment(_M_node);</span> -<span class="lineNum"> 266 </span> : return __tmp; -<span class="lineNum"> 267 </span> : } -<span class="lineNum"> 268 </span> : -<span class="lineNum"> 269 </span> : _Self& -<span class="lineNum"> 270 </span><span class="lineCov"> 2000 : operator--()</span> -<span class="lineNum"> 271 </span> : { -<span class="lineNum"> 272 </span><span class="lineCov"> 2000 : _M_node = _Rb_tree_decrement(_M_node);</span> -<span class="lineNum"> 273 </span><span class="lineCov"> 2000 : return *this;</span> -<span class="lineNum"> 274 </span> : } -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : _Self -<span class="lineNum"> 277 </span> : operator--(int) -<span class="lineNum"> 278 </span> : { -<span class="lineNum"> 279 </span> : _Self __tmp = *this; -<span class="lineNum"> 280 </span> : _M_node = _Rb_tree_decrement(_M_node); -<span class="lineNum"> 281 </span> : return __tmp; -<span class="lineNum"> 282 </span> : } -<span class="lineNum"> 283 </span> : -<span class="lineNum"> 284 </span> : bool -<span class="lineNum"> 285 </span><span class="lineCov"> 177758 : operator==(const _Self& __x) const</span> -<span class="lineNum"> 286 </span><span class="lineCov"> 177758 : { return _M_node == __x._M_node; }</span> -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : bool -<span class="lineNum"> 289 </span><span class="lineCov"> 2095612 : operator!=(const _Self& __x) const</span> -<span class="lineNum"> 290 </span><span class="lineCov"> 2095612 : { return _M_node != __x._M_node; }</span> -<span class="lineNum"> 291 </span> : -<span class="lineNum"> 292 </span> : _Base_ptr _M_node; -<span class="lineNum"> 293 </span> : }; -<span class="lineNum"> 294 </span> : -<span class="lineNum"> 295 </span> : template<typename _Val> -<span class="lineNum"> 296 </span> : inline bool -<span class="lineNum"> 297 </span> : operator==(const _Rb_tree_iterator<_Val>& __x, -<span class="lineNum"> 298 </span> : const _Rb_tree_const_iterator<_Val>& __y) -<span class="lineNum"> 299 </span> : { return __x._M_node == __y._M_node; } -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span> : template<typename _Val> -<span class="lineNum"> 302 </span> : inline bool -<span class="lineNum"> 303 </span> : operator!=(const _Rb_tree_iterator<_Val>& __x, -<span class="lineNum"> 304 </span> : const _Rb_tree_const_iterator<_Val>& __y) -<span class="lineNum"> 305 </span> : { return __x._M_node != __y._M_node; } -<span class="lineNum"> 306 </span> : -<span class="lineNum"> 307 </span> : void -<span class="lineNum"> 308 </span> : _Rb_tree_insert_and_rebalance(const bool __insert_left, -<span class="lineNum"> 309 </span> : _Rb_tree_node_base* __x, -<span class="lineNum"> 310 </span> : _Rb_tree_node_base* __p, -<span class="lineNum"> 311 </span> : _Rb_tree_node_base& __header); -<span class="lineNum"> 312 </span> : -<span class="lineNum"> 313 </span> : _Rb_tree_node_base* -<span class="lineNum"> 314 </span> : _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, -<span class="lineNum"> 315 </span> : _Rb_tree_node_base& __header); -<span class="lineNum"> 316 </span> : -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 319 </span> : typename _Compare, typename _Alloc = allocator<_Val> > -<span class="lineNum"> 320 </span> : class _Rb_tree -<span class="lineNum"> 321 </span> : { -<span class="lineNum"> 322 </span> : typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other -<span class="lineNum"> 323 </span> : _Node_allocator; -<span class="lineNum"> 324 </span> : -<span class="lineNum"> 325 </span> : protected: -<span class="lineNum"> 326 </span> : typedef _Rb_tree_node_base* _Base_ptr; -<span class="lineNum"> 327 </span> : typedef const _Rb_tree_node_base* _Const_Base_ptr; -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : public: -<span class="lineNum"> 330 </span> : typedef _Key key_type; -<span class="lineNum"> 331 </span> : typedef _Val value_type; -<span class="lineNum"> 332 </span> : typedef value_type* pointer; -<span class="lineNum"> 333 </span> : typedef const value_type* const_pointer; -<span class="lineNum"> 334 </span> : typedef value_type& reference; -<span class="lineNum"> 335 </span> : typedef const value_type& const_reference; -<span class="lineNum"> 336 </span> : typedef _Rb_tree_node<_Val>* _Link_type; -<span class="lineNum"> 337 </span> : typedef const _Rb_tree_node<_Val>* _Const_Link_type; -<span class="lineNum"> 338 </span> : typedef size_t size_type; -<span class="lineNum"> 339 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 340 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 341 </span> : -<span class="lineNum"> 342 </span> : _Node_allocator& -<span class="lineNum"> 343 </span> : _M_get_Node_allocator() -<span class="lineNum"> 344 </span> : { return *static_cast<_Node_allocator*>(&this->_M_impl); } -<span class="lineNum"> 345 </span> : -<span class="lineNum"> 346 </span> : const _Node_allocator& -<span class="lineNum"> 347 </span><span class="lineCov"> 12223942 : _M_get_Node_allocator() const</span> -<span class="lineNum"> 348 </span><span class="lineCov"> 12223942 : { return *static_cast<const _Node_allocator*>(&this->_M_impl); }</span> -<span class="lineNum"> 349 </span> : -<span class="lineNum"> 350 </span> : allocator_type -<span class="lineNum"> 351 </span><span class="lineCov"> 11289346 : get_allocator() const</span> -<span class="lineNum"> 352 </span><span class="lineCov"> 11289346 : { return allocator_type(_M_get_Node_allocator()); }</span> -<span class="lineNum"> 353 </span> : -<span class="lineNum"> 354 </span> : protected: -<span class="lineNum"> 355 </span> : _Link_type -<span class="lineNum"> 356 </span><span class="lineCov"> 5644688 : _M_get_node()</span> -<span class="lineNum"> 357 </span><span class="lineCov"> 5644688 : { return _M_impl._Node_allocator::allocate(1); }</span> -<span class="lineNum"> 358 </span> : -<span class="lineNum"> 359 </span> : void -<span class="lineNum"> 360 </span><span class="lineCov"> 5644658 : _M_put_node(_Link_type __p)</span> -<span class="lineNum"> 361 </span><span class="lineCov"> 5644658 : { _M_impl._Node_allocator::deallocate(__p, 1); }</span> -<span class="lineNum"> 362 </span> : -<span class="lineNum"> 363 </span> : _Link_type -<span class="lineNum"> 364 </span><span class="lineCov"> 5644688 : _M_create_node(const value_type& __x)</span> -<span class="lineNum"> 365 </span> : { -<span class="lineNum"> 366 </span><span class="lineCov"> 5644688 : _Link_type __tmp = _M_get_node();</span> -<span class="lineNum"> 367 </span> : try -<span class="lineNum"> 368 </span><span class="lineCov"> 5644688 : { get_allocator().construct(&__tmp->_M_value_field, __x); }</span> -<span class="lineNum"> 369 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 370 </span> : { -<span class="lineNum"> 371 </span><span class="lineNoCov"> 0 : _M_put_node(__tmp);</span> -<span class="lineNum"> 372 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 373 </span> : } -<span class="lineNum"> 374 </span><span class="lineCov"> 5644688 : return __tmp;</span> -<span class="lineNum"> 375 </span> : } -<span class="lineNum"> 376 </span> : -<span class="lineNum"> 377 </span> : _Link_type -<span class="lineNum"> 378 </span><span class="lineCov"> 3573982 : _M_clone_node(_Const_Link_type __x)</span> -<span class="lineNum"> 379 </span> : { -<span class="lineNum"> 380 </span><span class="lineCov"> 3573982 : _Link_type __tmp = _M_create_node(__x->_M_value_field);</span> -<span class="lineNum"> 381 </span><span class="lineCov"> 3573982 : __tmp->_M_color = __x->_M_color;</span> -<span class="lineNum"> 382 </span><span class="lineCov"> 3573982 : __tmp->_M_left = 0;</span> -<span class="lineNum"> 383 </span><span class="lineCov"> 3573982 : __tmp->_M_right = 0;</span> -<span class="lineNum"> 384 </span><span class="lineCov"> 3573982 : return __tmp;</span> -<span class="lineNum"> 385 </span> : } -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span> : void -<span class="lineNum"> 388 </span><span class="lineCov"> 5644658 : _M_destroy_node(_Link_type __p)</span> -<span class="lineNum"> 389 </span> : { -<span class="lineNum"> 390 </span><span class="lineCov"> 5644658 : get_allocator().destroy(&__p->_M_value_field);</span> -<span class="lineNum"> 391 </span><span class="lineCov"> 5644658 : _M_put_node(__p);</span> -<span class="lineNum"> 392 </span><span class="lineCov"> 5644658 : }</span> -<span class="lineNum"> 393 </span> : -<span class="lineNum"> 394 </span> : protected: -<span class="lineNum"> 395 </span> : template<typename _Key_compare, -<span class="lineNum"> 396 </span> : bool _Is_pod_comparator = __is_pod(_Key_compare)> -<span class="lineNum"> 397 </span> : struct _Rb_tree_impl : public _Node_allocator -<span class="lineNum"> 398 </span><span class="lineCov"> 1320929 : {</span> -<span class="lineNum"> 399 </span> : _Key_compare _M_key_compare; -<span class="lineNum"> 400 </span> : _Rb_tree_node_base _M_header; -<span class="lineNum"> 401 </span> : size_type _M_node_count; // Keeps track of size of tree. -<span class="lineNum"> 402 </span> : -<span class="lineNum"> 403 </span><span class="lineCov"> 280599 : _Rb_tree_impl()</span> -<span class="lineNum"> 404 </span> : : _Node_allocator(), _M_key_compare(), _M_header(), -<span class="lineNum"> 405 </span><span class="lineCov"> 280599 : _M_node_count(0)</span> -<span class="lineNum"> 406 </span><span class="lineCov"> 280599 : { _M_initialize(); }</span> -<span class="lineNum"> 407 </span> : -<span class="lineNum"> 408 </span><span class="lineCov"> 934596 : _Rb_tree_impl(const _Key_compare& __comp, const _Node_allocator& __a)</span> -<span class="lineNum"> 409 </span> : : _Node_allocator(__a), _M_key_compare(__comp), _M_header(), -<span class="lineNum"> 410 </span><span class="lineCov"> 934596 : _M_node_count(0)</span> -<span class="lineNum"> 411 </span><span class="lineCov"> 934596 : { _M_initialize(); }</span> -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span> : private: -<span class="lineNum"> 414 </span> : void -<span class="lineNum"> 415 </span><span class="lineCov"> 1215195 : _M_initialize()</span> -<span class="lineNum"> 416 </span> : { -<span class="lineNum"> 417 </span><span class="lineCov"> 1215195 : this->_M_header._M_color = _S_red;</span> -<span class="lineNum"> 418 </span><span class="lineCov"> 1215195 : this->_M_header._M_parent = 0;</span> -<span class="lineNum"> 419 </span><span class="lineCov"> 1215195 : this->_M_header._M_left = &this->_M_header;</span> -<span class="lineNum"> 420 </span><span class="lineCov"> 1215195 : this->_M_header._M_right = &this->_M_header;</span> -<span class="lineNum"> 421 </span><span class="lineCov"> 1215195 : } </span> -<span class="lineNum"> 422 </span> : }; -<span class="lineNum"> 423 </span> : -<span class="lineNum"> 424 </span> : _Rb_tree_impl<_Compare> _M_impl; -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : protected: -<span class="lineNum"> 427 </span> : _Base_ptr& -<span class="lineNum"> 428 </span><span class="lineCov"> 2729891 : _M_root()</span> -<span class="lineNum"> 429 </span><span class="lineCov"> 2729891 : { return this->_M_impl._M_header._M_parent; }</span> -<span class="lineNum"> 430 </span> : -<span class="lineNum"> 431 </span> : _Const_Base_ptr -<span class="lineNum"> 432 </span><span class="lineCov"> 934693 : _M_root() const</span> -<span class="lineNum"> 433 </span><span class="lineCov"> 934693 : { return this->_M_impl._M_header._M_parent; }</span> -<span class="lineNum"> 434 </span> : -<span class="lineNum"> 435 </span> : _Base_ptr& -<span class="lineNum"> 436 </span><span class="lineCov"> 970809 : _M_leftmost()</span> -<span class="lineNum"> 437 </span><span class="lineCov"> 970809 : { return this->_M_impl._M_header._M_left; }</span> -<span class="lineNum"> 438 </span> : -<span class="lineNum"> 439 </span> : _Const_Base_ptr -<span class="lineNum"> 440 </span> : _M_leftmost() const -<span class="lineNum"> 441 </span> : { return this->_M_impl._M_header._M_left; } -<span class="lineNum"> 442 </span> : -<span class="lineNum"> 443 </span> : _Base_ptr& -<span class="lineNum"> 444 </span><span class="lineCov"> 2012568 : _M_rightmost()</span> -<span class="lineNum"> 445 </span><span class="lineCov"> 2012568 : { return this->_M_impl._M_header._M_right; }</span> -<span class="lineNum"> 446 </span> : -<span class="lineNum"> 447 </span> : _Const_Base_ptr -<span class="lineNum"> 448 </span> : _M_rightmost() const -<span class="lineNum"> 449 </span> : { return this->_M_impl._M_header._M_right; } -<span class="lineNum"> 450 </span> : -<span class="lineNum"> 451 </span> : _Link_type -<span class="lineNum"> 452 </span><span class="lineCov"> 3119123 : _M_begin()</span> -<span class="lineNum"> 453 </span><span class="lineCov"> 3119123 : { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }</span> -<span class="lineNum"> 454 </span> : -<span class="lineNum"> 455 </span> : _Const_Link_type -<span class="lineNum"> 456 </span><span class="lineCov"> 884565 : _M_begin() const</span> -<span class="lineNum"> 457 </span> : { -<span class="lineNum"> 458 </span> : return static_cast<_Const_Link_type> -<span class="lineNum"> 459 </span><span class="lineCov"> 884565 : (this->_M_impl._M_header._M_parent);</span> -<span class="lineNum"> 460 </span> : } -<span class="lineNum"> 461 </span> : -<span class="lineNum"> 462 </span> : _Link_type -<span class="lineNum"> 463 </span><span class="lineCov"> 5489610 : _M_end()</span> -<span class="lineNum"> 464 </span><span class="lineCov"> 5489610 : { return static_cast<_Link_type>(&this->_M_impl._M_header); }</span> -<span class="lineNum"> 465 </span> : -<span class="lineNum"> 466 </span> : _Const_Link_type -<span class="lineNum"> 467 </span><span class="lineCov"> 3932 : _M_end() const</span> -<span class="lineNum"> 468 </span><span class="lineCov"> 3932 : { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }</span> -<span class="lineNum"> 469 </span> : -<span class="lineNum"> 470 </span> : static const_reference -<span class="lineNum"> 471 </span><span class="lineCov"> 7342455 : _S_value(_Const_Link_type __x)</span> -<span class="lineNum"> 472 </span><span class="lineCov"> 7342455 : { return __x->_M_value_field; }</span> -<span class="lineNum"> 473 </span> : -<span class="lineNum"> 474 </span> : static const _Key& -<span class="lineNum"> 475 </span><span class="lineCov"> 7342455 : _S_key(_Const_Link_type __x)</span> -<span class="lineNum"> 476 </span><span class="lineCov"> 7342455 : { return _KeyOfValue()(_S_value(__x)); }</span> -<span class="lineNum"> 477 </span> : -<span class="lineNum"> 478 </span> : static _Link_type -<span class="lineNum"> 479 </span><span class="lineCov"> 6468290 : _S_left(_Base_ptr __x)</span> -<span class="lineNum"> 480 </span><span class="lineCov"> 6468290 : { return static_cast<_Link_type>(__x->_M_left); }</span> -<span class="lineNum"> 481 </span> : -<span class="lineNum"> 482 </span> : static _Const_Link_type -<span class="lineNum"> 483 </span><span class="lineCov"> 3579867 : _S_left(_Const_Base_ptr __x)</span> -<span class="lineNum"> 484 </span><span class="lineCov"> 3579867 : { return static_cast<_Const_Link_type>(__x->_M_left); }</span> -<span class="lineNum"> 485 </span> : -<span class="lineNum"> 486 </span> : static _Link_type -<span class="lineNum"> 487 </span><span class="lineCov"> 12155056 : _S_right(_Base_ptr __x)</span> -<span class="lineNum"> 488 </span><span class="lineCov"> 12155056 : { return static_cast<_Link_type>(__x->_M_right); }</span> -<span class="lineNum"> 489 </span> : -<span class="lineNum"> 490 </span> : static _Const_Link_type -<span class="lineNum"> 491 </span><span class="lineCov"> 1503831 : _S_right(_Const_Base_ptr __x)</span> -<span class="lineNum"> 492 </span><span class="lineCov"> 1503831 : { return static_cast<_Const_Link_type>(__x->_M_right); }</span> -<span class="lineNum"> 493 </span> : -<span class="lineNum"> 494 </span> : static const_reference -<span class="lineNum"> 495 </span><span class="lineCov"> 3381491 : _S_value(_Const_Base_ptr __x)</span> -<span class="lineNum"> 496 </span><span class="lineCov"> 3381491 : { return static_cast<_Const_Link_type>(__x)->_M_value_field; }</span> -<span class="lineNum"> 497 </span> : -<span class="lineNum"> 498 </span> : static const _Key& -<span class="lineNum"> 499 </span><span class="lineCov"> 3381491 : _S_key(_Const_Base_ptr __x)</span> -<span class="lineNum"> 500 </span><span class="lineCov"> 3381491 : { return _KeyOfValue()(_S_value(__x)); }</span> -<span class="lineNum"> 501 </span> : -<span class="lineNum"> 502 </span> : static _Base_ptr -<span class="lineNum"> 503 </span><span class="lineCov"> 880633 : _S_minimum(_Base_ptr __x)</span> -<span class="lineNum"> 504 </span><span class="lineCov"> 880633 : { return _Rb_tree_node_base::_S_minimum(__x); }</span> -<span class="lineNum"> 505 </span> : -<span class="lineNum"> 506 </span> : static _Const_Base_ptr -<span class="lineNum"> 507 </span> : _S_minimum(_Const_Base_ptr __x) -<span class="lineNum"> 508 </span> : { return _Rb_tree_node_base::_S_minimum(__x); } -<span class="lineNum"> 509 </span> : -<span class="lineNum"> 510 </span> : static _Base_ptr -<span class="lineNum"> 511 </span><span class="lineCov"> 880633 : _S_maximum(_Base_ptr __x)</span> -<span class="lineNum"> 512 </span><span class="lineCov"> 880633 : { return _Rb_tree_node_base::_S_maximum(__x); }</span> -<span class="lineNum"> 513 </span> : -<span class="lineNum"> 514 </span> : static _Const_Base_ptr -<span class="lineNum"> 515 </span> : _S_maximum(_Const_Base_ptr __x) -<span class="lineNum"> 516 </span> : { return _Rb_tree_node_base::_S_maximum(__x); } -<span class="lineNum"> 517 </span> : -<span class="lineNum"> 518 </span> : public: -<span class="lineNum"> 519 </span> : typedef _Rb_tree_iterator<value_type> iterator; -<span class="lineNum"> 520 </span> : typedef _Rb_tree_const_iterator<value_type> const_iterator; -<span class="lineNum"> 521 </span> : -<span class="lineNum"> 522 </span> : typedef std::reverse_iterator<iterator> reverse_iterator; -<span class="lineNum"> 523 </span> : typedef std::reverse_iterator<const_iterator> const_reverse_iterator; -<span class="lineNum"> 524 </span> : -<span class="lineNum"> 525 </span> : private: -<span class="lineNum"> 526 </span> : iterator -<span class="lineNum"> 527 </span> : _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y, -<span class="lineNum"> 528 </span> : const value_type& __v); -<span class="lineNum"> 529 </span> : -<span class="lineNum"> 530 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 531 </span> : // 233. Insertion hints in associative containers. -<span class="lineNum"> 532 </span> : iterator -<span class="lineNum"> 533 </span> : _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v); -<span class="lineNum"> 534 </span> : -<span class="lineNum"> 535 </span> : iterator -<span class="lineNum"> 536 </span> : _M_insert_equal_lower(const value_type& __x); -<span class="lineNum"> 537 </span> : -<span class="lineNum"> 538 </span> : _Link_type -<span class="lineNum"> 539 </span> : _M_copy(_Const_Link_type __x, _Link_type __p); -<span class="lineNum"> 540 </span> : -<span class="lineNum"> 541 </span> : void -<span class="lineNum"> 542 </span> : _M_erase(_Link_type __x); -<span class="lineNum"> 543 </span> : -<span class="lineNum"> 544 </span> : iterator -<span class="lineNum"> 545 </span> : _M_lower_bound(_Link_type __x, _Link_type __y, -<span class="lineNum"> 546 </span> : const _Key& __k); -<span class="lineNum"> 547 </span> : -<span class="lineNum"> 548 </span> : const_iterator -<span class="lineNum"> 549 </span> : _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y, -<span class="lineNum"> 550 </span> : const _Key& __k) const; -<span class="lineNum"> 551 </span> : -<span class="lineNum"> 552 </span> : iterator -<span class="lineNum"> 553 </span> : _M_upper_bound(_Link_type __x, _Link_type __y, -<span class="lineNum"> 554 </span> : const _Key& __k); -<span class="lineNum"> 555 </span> : -<span class="lineNum"> 556 </span> : const_iterator -<span class="lineNum"> 557 </span> : _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y, -<span class="lineNum"> 558 </span> : const _Key& __k) const; -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : public: -<span class="lineNum"> 561 </span> : // allocation/deallocation -<span class="lineNum"> 562 </span><span class="lineCov"> 280599 : _Rb_tree() { }</span> -<span class="lineNum"> 563 </span> : -<span class="lineNum"> 564 </span> : _Rb_tree(const _Compare& __comp, -<span class="lineNum"> 565 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 566 </span> : : _M_impl(__comp, __a) { } -<span class="lineNum"> 567 </span> : -<span class="lineNum"> 568 </span><span class="lineCov"> 934596 : _Rb_tree(const _Rb_tree& __x)</span> -<span class="lineNum"> 569 </span><span class="lineCov"> 934596 : : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())</span> -<span class="lineNum"> 570 </span> : { -<span class="lineNum"> 571 </span><span class="lineCov"> 934596 : if (__x._M_root() != 0)</span> -<span class="lineNum"> 572 </span> : { -<span class="lineNum"> 573 </span><span class="lineCov"> 880580 : _M_root() = _M_copy(__x._M_begin(), _M_end());</span> -<span class="lineNum"> 574 </span><span class="lineCov"> 880580 : _M_leftmost() = _S_minimum(_M_root());</span> -<span class="lineNum"> 575 </span><span class="lineCov"> 880580 : _M_rightmost() = _S_maximum(_M_root());</span> -<span class="lineNum"> 576 </span><span class="lineCov"> 880580 : _M_impl._M_node_count = __x._M_impl._M_node_count;</span> -<span class="lineNum"> 577 </span> : } -<span class="lineNum"> 578 </span><span class="lineCov"> 934596 : }</span> -<span class="lineNum"> 579 </span> : -<span class="lineNum"> 580 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 581 </span> : _Rb_tree(_Rb_tree&& __x); -<span class="lineNum"> 582 </span> : #endif -<span class="lineNum"> 583 </span> : -<span class="lineNum"> 584 </span><span class="lineCov"> 1320929 : ~_Rb_tree()</span> -<span class="lineNum"> 585 </span><span class="lineCov"> 1320929 : { _M_erase(_M_begin()); }</span> -<span class="lineNum"> 586 </span> : -<span class="lineNum"> 587 </span> : _Rb_tree& -<span class="lineNum"> 588 </span> : operator=(const _Rb_tree& __x); -<span class="lineNum"> 589 </span> : -<span class="lineNum"> 590 </span> : // Accessors. -<span class="lineNum"> 591 </span> : _Compare -<span class="lineNum"> 592 </span><span class="lineCov"> 3296 : key_comp() const</span> -<span class="lineNum"> 593 </span><span class="lineCov"> 3296 : { return _M_impl._M_key_compare; }</span> -<span class="lineNum"> 594 </span> : -<span class="lineNum"> 595 </span> : iterator -<span class="lineNum"> 596 </span><span class="lineCov"> 538878 : begin()</span> -<span class="lineNum"> 597 </span> : { -<span class="lineNum"> 598 </span> : return iterator(static_cast<_Link_type> -<span class="lineNum"> 599 </span><span class="lineCov"> 538878 : (this->_M_impl._M_header._M_left));</span> -<span class="lineNum"> 600 </span> : } -<span class="lineNum"> 601 </span> : -<span class="lineNum"> 602 </span> : const_iterator -<span class="lineNum"> 603 </span><span class="lineCov"> 468185 : begin() const</span> -<span class="lineNum"> 604 </span> : { -<span class="lineNum"> 605 </span> : return const_iterator(static_cast<_Const_Link_type> -<span class="lineNum"> 606 </span><span class="lineCov"> 468185 : (this->_M_impl._M_header._M_left));</span> -<span class="lineNum"> 607 </span> : } -<span class="lineNum"> 608 </span> : -<span class="lineNum"> 609 </span> : iterator -<span class="lineNum"> 610 </span><span class="lineCov"> 230534 : end()</span> -<span class="lineNum"> 611 </span><span class="lineCov"> 230534 : { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); }</span> -<span class="lineNum"> 612 </span> : -<span class="lineNum"> 613 </span> : const_iterator -<span class="lineNum"> 614 </span><span class="lineCov"> 2022586 : end() const</span> -<span class="lineNum"> 615 </span> : { -<span class="lineNum"> 616 </span> : return const_iterator(static_cast<_Const_Link_type> -<span class="lineNum"> 617 </span><span class="lineCov"> 2022586 : (&this->_M_impl._M_header));</span> -<span class="lineNum"> 618 </span> : } -<span class="lineNum"> 619 </span> : -<span class="lineNum"> 620 </span> : reverse_iterator -<span class="lineNum"> 621 </span> : rbegin() -<span class="lineNum"> 622 </span> : { return reverse_iterator(end()); } -<span class="lineNum"> 623 </span> : -<span class="lineNum"> 624 </span> : const_reverse_iterator -<span class="lineNum"> 625 </span><span class="lineCov"> 32 : rbegin() const</span> -<span class="lineNum"> 626 </span><span class="lineCov"> 32 : { return const_reverse_iterator(end()); }</span> -<span class="lineNum"> 627 </span> : -<span class="lineNum"> 628 </span> : reverse_iterator -<span class="lineNum"> 629 </span> : rend() -<span class="lineNum"> 630 </span> : { return reverse_iterator(begin()); } -<span class="lineNum"> 631 </span> : -<span class="lineNum"> 632 </span> : const_reverse_iterator -<span class="lineNum"> 633 </span> : rend() const -<span class="lineNum"> 634 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 635 </span> : -<span class="lineNum"> 636 </span> : bool -<span class="lineNum"> 637 </span><span class="lineCov"> 342325 : empty() const</span> -<span class="lineNum"> 638 </span><span class="lineCov"> 342325 : { return _M_impl._M_node_count == 0; }</span> -<span class="lineNum"> 639 </span> : -<span class="lineNum"> 640 </span> : size_type -<span class="lineNum"> 641 </span><span class="lineCov"> 734435 : size() const</span> -<span class="lineNum"> 642 </span><span class="lineCov"> 734435 : { return _M_impl._M_node_count; }</span> -<span class="lineNum"> 643 </span> : -<span class="lineNum"> 644 </span> : size_type -<span class="lineNum"> 645 </span> : max_size() const -<span class="lineNum"> 646 </span> : { return get_allocator().max_size(); } -<span class="lineNum"> 647 </span> : -<span class="lineNum"> 648 </span> : void -<span class="lineNum"> 649 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 650 </span> : swap(_Rb_tree&& __t); -<span class="lineNum"> 651 </span> : #else -<span class="lineNum"> 652 </span> : swap(_Rb_tree& __t); -<span class="lineNum"> 653 </span> : #endif -<span class="lineNum"> 654 </span> : -<span class="lineNum"> 655 </span> : // Insert/erase. -<span class="lineNum"> 656 </span> : pair<iterator, bool> -<span class="lineNum"> 657 </span> : _M_insert_unique(const value_type& __x); -<span class="lineNum"> 658 </span> : -<span class="lineNum"> 659 </span> : iterator -<span class="lineNum"> 660 </span> : _M_insert_equal(const value_type& __x); -<span class="lineNum"> 661 </span> : -<span class="lineNum"> 662 </span> : iterator -<span class="lineNum"> 663 </span> : _M_insert_unique_(const_iterator __position, const value_type& __x); -<span class="lineNum"> 664 </span> : -<span class="lineNum"> 665 </span> : iterator -<span class="lineNum"> 666 </span> : _M_insert_equal_(const_iterator __position, const value_type& __x); -<span class="lineNum"> 667 </span> : -<span class="lineNum"> 668 </span> : template<typename _InputIterator> -<span class="lineNum"> 669 </span> : void -<span class="lineNum"> 670 </span> : _M_insert_unique(_InputIterator __first, _InputIterator __last); -<span class="lineNum"> 671 </span> : -<span class="lineNum"> 672 </span> : template<typename _InputIterator> -<span class="lineNum"> 673 </span> : void -<span class="lineNum"> 674 </span> : _M_insert_equal(_InputIterator __first, _InputIterator __last); -<span class="lineNum"> 675 </span> : -<span class="lineNum"> 676 </span> : void -<span class="lineNum"> 677 </span> : erase(iterator __position); -<span class="lineNum"> 678 </span> : -<span class="lineNum"> 679 </span> : void -<span class="lineNum"> 680 </span> : erase(const_iterator __position); -<span class="lineNum"> 681 </span> : -<span class="lineNum"> 682 </span> : size_type -<span class="lineNum"> 683 </span> : erase(const key_type& __x); -<span class="lineNum"> 684 </span> : -<span class="lineNum"> 685 </span> : void -<span class="lineNum"> 686 </span> : erase(iterator __first, iterator __last); -<span class="lineNum"> 687 </span> : -<span class="lineNum"> 688 </span> : void -<span class="lineNum"> 689 </span> : erase(const_iterator __first, const_iterator __last); -<span class="lineNum"> 690 </span> : -<span class="lineNum"> 691 </span> : void -<span class="lineNum"> 692 </span> : erase(const key_type* __first, const key_type* __last); -<span class="lineNum"> 693 </span> : -<span class="lineNum"> 694 </span> : void -<span class="lineNum"> 695 </span><span class="lineCov"> 87992 : clear()</span> -<span class="lineNum"> 696 </span> : { -<span class="lineNum"> 697 </span><span class="lineCov"> 87992 : _M_erase(_M_begin());</span> -<span class="lineNum"> 698 </span><span class="lineCov"> 87992 : _M_leftmost() = _M_end();</span> -<span class="lineNum"> 699 </span><span class="lineCov"> 87992 : _M_root() = 0;</span> -<span class="lineNum"> 700 </span><span class="lineCov"> 87992 : _M_rightmost() = _M_end();</span> -<span class="lineNum"> 701 </span><span class="lineCov"> 87992 : _M_impl._M_node_count = 0;</span> -<span class="lineNum"> 702 </span><span class="lineCov"> 87992 : }</span> -<span class="lineNum"> 703 </span> : -<span class="lineNum"> 704 </span> : // Set operations. -<span class="lineNum"> 705 </span> : iterator -<span class="lineNum"> 706 </span> : find(const key_type& __k); -<span class="lineNum"> 707 </span> : -<span class="lineNum"> 708 </span> : const_iterator -<span class="lineNum"> 709 </span> : find(const key_type& __k) const; -<span class="lineNum"> 710 </span> : -<span class="lineNum"> 711 </span> : size_type -<span class="lineNum"> 712 </span> : count(const key_type& __k) const; -<span class="lineNum"> 713 </span> : -<span class="lineNum"> 714 </span> : iterator -<span class="lineNum"> 715 </span><span class="lineCov"> 6297 : lower_bound(const key_type& __k)</span> -<span class="lineNum"> 716 </span><span class="lineCov"> 6297 : { return _M_lower_bound(_M_begin(), _M_end(), __k); }</span> -<span class="lineNum"> 717 </span> : -<span class="lineNum"> 718 </span> : const_iterator -<span class="lineNum"> 719 </span> : lower_bound(const key_type& __k) const -<span class="lineNum"> 720 </span> : { return _M_lower_bound(_M_begin(), _M_end(), __k); } -<span class="lineNum"> 721 </span> : -<span class="lineNum"> 722 </span> : iterator -<span class="lineNum"> 723 </span> : upper_bound(const key_type& __k) -<span class="lineNum"> 724 </span> : { return _M_upper_bound(_M_begin(), _M_end(), __k); } -<span class="lineNum"> 725 </span> : -<span class="lineNum"> 726 </span> : const_iterator -<span class="lineNum"> 727 </span> : upper_bound(const key_type& __k) const -<span class="lineNum"> 728 </span> : { return _M_upper_bound(_M_begin(), _M_end(), __k); } -<span class="lineNum"> 729 </span> : -<span class="lineNum"> 730 </span> : pair<iterator, iterator> -<span class="lineNum"> 731 </span> : equal_range(const key_type& __k); -<span class="lineNum"> 732 </span> : -<span class="lineNum"> 733 </span> : pair<const_iterator, const_iterator> -<span class="lineNum"> 734 </span> : equal_range(const key_type& __k) const; -<span class="lineNum"> 735 </span> : -<span class="lineNum"> 736 </span> : // Debugging. -<span class="lineNum"> 737 </span> : bool -<span class="lineNum"> 738 </span> : __rb_verify() const; -<span class="lineNum"> 739 </span> : }; -<span class="lineNum"> 740 </span> : -<span class="lineNum"> 741 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 742 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 743 </span> : inline bool -<span class="lineNum"> 744 </span> : operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 745 </span><span class="lineCov"> 4 : const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)</span> -<span class="lineNum"> 746 </span> : { -<span class="lineNum"> 747 </span> : return __x.size() == __y.size() -<span class="lineNum"> 748 </span><span class="lineCov"> 4 : && std::equal(__x.begin(), __x.end(), __y.begin());</span> -<span class="lineNum"> 749 </span> : } -<span class="lineNum"> 750 </span> : -<span class="lineNum"> 751 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 752 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 753 </span> : inline bool -<span class="lineNum"> 754 </span> : operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 755 </span> : const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) -<span class="lineNum"> 756 </span> : { -<span class="lineNum"> 757 </span> : return std::lexicographical_compare(__x.begin(), __x.end(), -<span class="lineNum"> 758 </span> : __y.begin(), __y.end()); -<span class="lineNum"> 759 </span> : } -<span class="lineNum"> 760 </span> : -<span class="lineNum"> 761 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 762 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 763 </span> : inline bool -<span class="lineNum"> 764 </span> : operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 765 </span> : const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) -<span class="lineNum"> 766 </span> : { return !(__x == __y); } -<span class="lineNum"> 767 </span> : -<span class="lineNum"> 768 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 769 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 770 </span> : inline bool -<span class="lineNum"> 771 </span> : operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 772 </span> : const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) -<span class="lineNum"> 773 </span> : { return __y < __x; } -<span class="lineNum"> 774 </span> : -<span class="lineNum"> 775 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 776 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 777 </span> : inline bool -<span class="lineNum"> 778 </span> : operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 779 </span> : const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) -<span class="lineNum"> 780 </span> : { return !(__y < __x); } -<span class="lineNum"> 781 </span> : -<span class="lineNum"> 782 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 783 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 784 </span> : inline bool -<span class="lineNum"> 785 </span> : operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 786 </span> : const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) -<span class="lineNum"> 787 </span> : { return !(__x < __y); } -<span class="lineNum"> 788 </span> : -<span class="lineNum"> 789 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 790 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 791 </span> : inline void -<span class="lineNum"> 792 </span> : swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x, -<span class="lineNum"> 793 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y) -<span class="lineNum"> 794 </span> : { __x.swap(__y); } -<span class="lineNum"> 795 </span> : -<span class="lineNum"> 796 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 797 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 798 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 799 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 800 </span> : _Rb_tree(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&& __x) -<span class="lineNum"> 801 </span> : : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator()) -<span class="lineNum"> 802 </span> : { -<span class="lineNum"> 803 </span> : if (__x._M_root() != 0) -<span class="lineNum"> 804 </span> : { -<span class="lineNum"> 805 </span> : _M_root() = __x._M_root(); -<span class="lineNum"> 806 </span> : _M_leftmost() = __x._M_leftmost(); -<span class="lineNum"> 807 </span> : _M_rightmost() = __x._M_rightmost(); -<span class="lineNum"> 808 </span> : _M_root()->_M_parent = _M_end(); -<span class="lineNum"> 809 </span> : -<span class="lineNum"> 810 </span> : __x._M_root() = 0; -<span class="lineNum"> 811 </span> : __x._M_leftmost() = __x._M_end(); -<span class="lineNum"> 812 </span> : __x._M_rightmost() = __x._M_end(); -<span class="lineNum"> 813 </span> : -<span class="lineNum"> 814 </span> : this->_M_impl._M_node_count = __x._M_impl._M_node_count; -<span class="lineNum"> 815 </span> : __x._M_impl._M_node_count = 0; -<span class="lineNum"> 816 </span> : } -<span class="lineNum"> 817 </span> : } -<span class="lineNum"> 818 </span> : #endif -<span class="lineNum"> 819 </span> : -<span class="lineNum"> 820 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 821 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 822 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& -<span class="lineNum"> 823 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 824 </span><span class="lineCov"> 97 : operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)</span> -<span class="lineNum"> 825 </span> : { -<span class="lineNum"> 826 </span><span class="lineCov"> 97 : if (this != &__x)</span> -<span class="lineNum"> 827 </span> : { -<span class="lineNum"> 828 </span> : // Note that _Key may be a constant type. -<span class="lineNum"> 829 </span><span class="lineCov"> 97 : clear();</span> -<span class="lineNum"> 830 </span><span class="lineCov"> 97 : _M_impl._M_key_compare = __x._M_impl._M_key_compare;</span> -<span class="lineNum"> 831 </span><span class="lineCov"> 97 : if (__x._M_root() != 0)</span> -<span class="lineNum"> 832 </span> : { -<span class="lineNum"> 833 </span><span class="lineCov"> 53 : _M_root() = _M_copy(__x._M_begin(), _M_end());</span> -<span class="lineNum"> 834 </span><span class="lineCov"> 53 : _M_leftmost() = _S_minimum(_M_root());</span> -<span class="lineNum"> 835 </span><span class="lineCov"> 53 : _M_rightmost() = _S_maximum(_M_root());</span> -<span class="lineNum"> 836 </span><span class="lineCov"> 53 : _M_impl._M_node_count = __x._M_impl._M_node_count;</span> -<span class="lineNum"> 837 </span> : } -<span class="lineNum"> 838 </span> : } -<span class="lineNum"> 839 </span><span class="lineCov"> 97 : return *this;</span> -<span class="lineNum"> 840 </span> : } -<span class="lineNum"> 841 </span> : -<span class="lineNum"> 842 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 843 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 844 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator -<span class="lineNum"> 845 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 846 </span><span class="lineCov"> 2070706 : _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __p, const _Val& __v)</span> -<span class="lineNum"> 847 </span> : { -<span class="lineNum"> 848 </span> : bool __insert_left = (__x != 0 || __p == _M_end() -<span class="lineNum"> 849 </span> : || _M_impl._M_key_compare(_KeyOfValue()(__v), -<span class="lineNum"> 850 </span><span class="lineCov"> 2070706 : _S_key(__p)));</span> -<span class="lineNum"> 851 </span> : -<span class="lineNum"> 852 </span><span class="lineCov"> 2070706 : _Link_type __z = _M_create_node(__v);</span> -<span class="lineNum"> 853 </span> : -<span class="lineNum"> 854 </span><span class="lineCov"> 2070706 : _Rb_tree_insert_and_rebalance(__insert_left, __z,</span> -<span class="lineNum"> 855 </span> : const_cast<_Base_ptr>(__p), -<span class="lineNum"> 856 </span> : this->_M_impl._M_header); -<span class="lineNum"> 857 </span><span class="lineCov"> 2070706 : ++_M_impl._M_node_count;</span> -<span class="lineNum"> 858 </span><span class="lineCov"> 2070706 : return iterator(__z);</span> -<span class="lineNum"> 859 </span> : } -<span class="lineNum"> 860 </span> : -<span class="lineNum"> 861 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 862 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 863 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator -<span class="lineNum"> 864 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 865 </span> : _M_insert_lower(_Base_ptr __x, _Base_ptr __p, const _Val& __v) -<span class="lineNum"> 866 </span> : { -<span class="lineNum"> 867 </span> : bool __insert_left = (__x != 0 || __p == _M_end() -<span class="lineNum"> 868 </span> : || !_M_impl._M_key_compare(_S_key(__p), -<span class="lineNum"> 869 </span> : _KeyOfValue()(__v))); -<span class="lineNum"> 870 </span> : -<span class="lineNum"> 871 </span> : _Link_type __z = _M_create_node(__v); -<span class="lineNum"> 872 </span> : -<span class="lineNum"> 873 </span> : _Rb_tree_insert_and_rebalance(__insert_left, __z, __p, -<span class="lineNum"> 874 </span> : this->_M_impl._M_header); -<span class="lineNum"> 875 </span> : ++_M_impl._M_node_count; -<span class="lineNum"> 876 </span> : return iterator(__z); -<span class="lineNum"> 877 </span> : } -<span class="lineNum"> 878 </span> : -<span class="lineNum"> 879 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 880 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 881 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator -<span class="lineNum"> 882 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 883 </span> : _M_insert_equal_lower(const _Val& __v) -<span class="lineNum"> 884 </span> : { -<span class="lineNum"> 885 </span> : _Link_type __x = _M_begin(); -<span class="lineNum"> 886 </span> : _Link_type __y = _M_end(); -<span class="lineNum"> 887 </span> : while (__x != 0) -<span class="lineNum"> 888 </span> : { -<span class="lineNum"> 889 </span> : __y = __x; -<span class="lineNum"> 890 </span> : __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ? -<span class="lineNum"> 891 </span> : _S_left(__x) : _S_right(__x); -<span class="lineNum"> 892 </span> : } -<span class="lineNum"> 893 </span> : return _M_insert_lower(__x, __y, __v); -<span class="lineNum"> 894 </span> : } -<span class="lineNum"> 895 </span> : -<span class="lineNum"> 896 </span> : template<typename _Key, typename _Val, typename _KoV, -<span class="lineNum"> 897 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 898 </span> : typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type -<span class="lineNum"> 899 </span> : _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>:: -<span class="lineNum"> 900 </span><span class="lineCov"> 2381075 : _M_copy(_Const_Link_type __x, _Link_type __p)</span> -<span class="lineNum"> 901 </span> : { -<span class="lineNum"> 902 </span> : // Structural copy. __x and __p must be non-null. -<span class="lineNum"> 903 </span><span class="lineCov"> 2381075 : _Link_type __top = _M_clone_node(__x);</span> -<span class="lineNum"> 904 </span><span class="lineCov"> 2381075 : __top->_M_parent = __p;</span> -<span class="lineNum"> 905 </span> : -<span class="lineNum"> 906 </span> : try -<span class="lineNum"> 907 </span> : { -<span class="lineNum"> 908 </span><span class="lineCov"> 2381075 : if (__x->_M_right)</span> -<span class="lineNum"> 909 </span><span class="lineCov"> 1355924 : __top->_M_right = _M_copy(_S_right(__x), __top);</span> -<span class="lineNum"> 910 </span><span class="lineCov"> 2381075 : __p = __top;</span> -<span class="lineNum"> 911 </span><span class="lineCov"> 2381075 : __x = _S_left(__x);</span> -<span class="lineNum"> 912 </span> : -<span class="lineNum"> 913 </span><span class="lineCov"> 5955057 : while (__x != 0)</span> -<span class="lineNum"> 914 </span> : { -<span class="lineNum"> 915 </span><span class="lineCov"> 1192907 : _Link_type __y = _M_clone_node(__x);</span> -<span class="lineNum"> 916 </span><span class="lineCov"> 1192907 : __p->_M_left = __y;</span> -<span class="lineNum"> 917 </span><span class="lineCov"> 1192907 : __y->_M_parent = __p;</span> -<span class="lineNum"> 918 </span><span class="lineCov"> 1192907 : if (__x->_M_right)</span> -<span class="lineNum"> 919 </span><span class="lineCov"> 144518 : __y->_M_right = _M_copy(_S_right(__x), __y);</span> -<span class="lineNum"> 920 </span><span class="lineCov"> 1192907 : __p = __y;</span> -<span class="lineNum"> 921 </span><span class="lineCov"> 1192907 : __x = _S_left(__x);</span> -<span class="lineNum"> 922 </span> : } -<span class="lineNum"> 923 </span> : } -<span class="lineNum"> 924 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 925 </span> : { -<span class="lineNum"> 926 </span><span class="lineNoCov"> 0 : _M_erase(__top);</span> -<span class="lineNum"> 927 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 928 </span> : } -<span class="lineNum"> 929 </span><span class="lineCov"> 2381075 : return __top;</span> -<span class="lineNum"> 930 </span> : } -<span class="lineNum"> 931 </span> : -<span class="lineNum"> 932 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 933 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 934 </span> : void -<span class="lineNum"> 935 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 936 </span><span class="lineCov"> 7053477 : _M_erase(_Link_type __x)</span> -<span class="lineNum"> 937 </span> : { -<span class="lineNum"> 938 </span> : // Erase without rebalancing. -<span class="lineNum"> 939 </span><span class="lineCov"> 19751483 : while (__x != 0)</span> -<span class="lineNum"> 940 </span> : { -<span class="lineNum"> 941 </span><span class="lineCov"> 5644529 : _M_erase(_S_right(__x));</span> -<span class="lineNum"> 942 </span><span class="lineCov"> 5644529 : _Link_type __y = _S_left(__x);</span> -<span class="lineNum"> 943 </span><span class="lineCov"> 5644529 : _M_destroy_node(__x);</span> -<span class="lineNum"> 944 </span><span class="lineCov"> 5644529 : __x = __y;</span> -<span class="lineNum"> 945 </span> : } -<span class="lineNum"> 946 </span><span class="lineCov"> 7053477 : }</span> -<span class="lineNum"> 947 </span> : -<span class="lineNum"> 948 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 949 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 950 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 951 </span> : _Compare, _Alloc>::iterator -<span class="lineNum"> 952 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 953 </span> : _M_lower_bound(_Link_type __x, _Link_type __y, -<span class="lineNum"> 954 </span><span class="lineCov"> 56455 : const _Key& __k)</span> -<span class="lineNum"> 955 </span> : { -<span class="lineNum"> 956 </span><span class="lineCov"> 956283 : while (__x != 0)</span> -<span class="lineNum"> 957 </span><span class="lineCov"> 843373 : if (!_M_impl._M_key_compare(_S_key(__x), __k))</span> -<span class="lineNum"> 958 </span><span class="lineCov"> 159236 : __y = __x, __x = _S_left(__x);</span> -<span class="lineNum"> 959 </span> : else -<span class="lineNum"> 960 </span><span class="lineCov"> 684137 : __x = _S_right(__x);</span> -<span class="lineNum"> 961 </span><span class="lineCov"> 56455 : return iterator(__y);</span> -<span class="lineNum"> 962 </span> : } -<span class="lineNum"> 963 </span> : -<span class="lineNum"> 964 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 965 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 966 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 967 </span> : _Compare, _Alloc>::const_iterator -<span class="lineNum"> 968 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 969 </span> : _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y, -<span class="lineNum"> 970 </span><span class="lineCov"> 3932 : const _Key& __k) const</span> -<span class="lineNum"> 971 </span> : { -<span class="lineNum"> 972 </span><span class="lineCov"> 16029 : while (__x != 0)</span> -<span class="lineNum"> 973 </span><span class="lineCov"> 8165 : if (!_M_impl._M_key_compare(_S_key(__x), __k))</span> -<span class="lineNum"> 974 </span><span class="lineCov"> 5885 : __y = __x, __x = _S_left(__x);</span> -<span class="lineNum"> 975 </span> : else -<span class="lineNum"> 976 </span><span class="lineCov"> 2280 : __x = _S_right(__x);</span> -<span class="lineNum"> 977 </span><span class="lineCov"> 3932 : return const_iterator(__y);</span> -<span class="lineNum"> 978 </span> : } -<span class="lineNum"> 979 </span> : -<span class="lineNum"> 980 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 981 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 982 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 983 </span> : _Compare, _Alloc>::iterator -<span class="lineNum"> 984 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 985 </span> : _M_upper_bound(_Link_type __x, _Link_type __y, -<span class="lineNum"> 986 </span><span class="lineCov"> 2 : const _Key& __k)</span> -<span class="lineNum"> 987 </span> : { -<span class="lineNum"> 988 </span><span class="lineCov"> 4 : while (__x != 0)</span> -<span class="lineNum"> 989 </span><span class="lineNoCov"> 0 : if (_M_impl._M_key_compare(__k, _S_key(__x)))</span> -<span class="lineNum"> 990 </span><span class="lineNoCov"> 0 : __y = __x, __x = _S_left(__x);</span> -<span class="lineNum"> 991 </span> : else -<span class="lineNum"> 992 </span><span class="lineNoCov"> 0 : __x = _S_right(__x);</span> -<span class="lineNum"> 993 </span><span class="lineCov"> 2 : return iterator(__y);</span> -<span class="lineNum"> 994 </span> : } -<span class="lineNum"> 995 </span> : -<span class="lineNum"> 996 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 997 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 998 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 999 </span> : _Compare, _Alloc>::const_iterator -<span class="lineNum"> 1000 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1001 </span> : _M_upper_bound(_Const_Link_type __x, _Const_Link_type __y, -<span class="lineNum"> 1002 </span> : const _Key& __k) const -<span class="lineNum"> 1003 </span> : { -<span class="lineNum"> 1004 </span> : while (__x != 0) -<span class="lineNum"> 1005 </span> : if (_M_impl._M_key_compare(__k, _S_key(__x))) -<span class="lineNum"> 1006 </span> : __y = __x, __x = _S_left(__x); -<span class="lineNum"> 1007 </span> : else -<span class="lineNum"> 1008 </span> : __x = _S_right(__x); -<span class="lineNum"> 1009 </span> : return const_iterator(__y); -<span class="lineNum"> 1010 </span> : } -<span class="lineNum"> 1011 </span> : -<span class="lineNum"> 1012 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1013 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1014 </span> : pair<typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1015 </span> : _Compare, _Alloc>::iterator, -<span class="lineNum"> 1016 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1017 </span> : _Compare, _Alloc>::iterator> -<span class="lineNum"> 1018 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1019 </span><span class="lineCov"> 9 : equal_range(const _Key& __k)</span> -<span class="lineNum"> 1020 </span> : { -<span class="lineNum"> 1021 </span><span class="lineCov"> 9 : _Link_type __x = _M_begin();</span> -<span class="lineNum"> 1022 </span><span class="lineCov"> 9 : _Link_type __y = _M_end();</span> -<span class="lineNum"> 1023 </span><span class="lineCov"> 20 : while (__x != 0)</span> -<span class="lineNum"> 1024 </span> : { -<span class="lineNum"> 1025 </span><span class="lineCov"> 4 : if (_M_impl._M_key_compare(_S_key(__x), __k))</span> -<span class="lineNum"> 1026 </span><span class="lineNoCov"> 0 : __x = _S_right(__x);</span> -<span class="lineNum"> 1027 </span><span class="lineCov"> 4 : else if (_M_impl._M_key_compare(__k, _S_key(__x)))</span> -<span class="lineNum"> 1028 </span><span class="lineCov"> 2 : __y = __x, __x = _S_left(__x);</span> -<span class="lineNum"> 1029 </span> : else -<span class="lineNum"> 1030 </span> : { -<span class="lineNum"> 1031 </span><span class="lineCov"> 2 : _Link_type __xu(__x), __yu(__y);</span> -<span class="lineNum"> 1032 </span><span class="lineCov"> 2 : __y = __x, __x = _S_left(__x);</span> -<span class="lineNum"> 1033 </span><span class="lineCov"> 2 : __xu = _S_right(__xu);</span> -<span class="lineNum"> 1034 </span> : return pair<iterator, -<span class="lineNum"> 1035 </span> : iterator>(_M_lower_bound(__x, __y, __k), -<span class="lineNum"> 1036 </span><span class="lineCov"> 2 : _M_upper_bound(__xu, __yu, __k));</span> -<span class="lineNum"> 1037 </span> : } -<span class="lineNum"> 1038 </span> : } -<span class="lineNum"> 1039 </span> : return pair<iterator, iterator>(iterator(__y), -<span class="lineNum"> 1040 </span><span class="lineCov"> 7 : iterator(__y));</span> -<span class="lineNum"> 1041 </span> : } -<span class="lineNum"> 1042 </span> : -<span class="lineNum"> 1043 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1044 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1045 </span> : pair<typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1046 </span> : _Compare, _Alloc>::const_iterator, -<span class="lineNum"> 1047 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1048 </span> : _Compare, _Alloc>::const_iterator> -<span class="lineNum"> 1049 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1050 </span> : equal_range(const _Key& __k) const -<span class="lineNum"> 1051 </span> : { -<span class="lineNum"> 1052 </span> : _Const_Link_type __x = _M_begin(); -<span class="lineNum"> 1053 </span> : _Const_Link_type __y = _M_end(); -<span class="lineNum"> 1054 </span> : while (__x != 0) -<span class="lineNum"> 1055 </span> : { -<span class="lineNum"> 1056 </span> : if (_M_impl._M_key_compare(_S_key(__x), __k)) -<span class="lineNum"> 1057 </span> : __x = _S_right(__x); -<span class="lineNum"> 1058 </span> : else if (_M_impl._M_key_compare(__k, _S_key(__x))) -<span class="lineNum"> 1059 </span> : __y = __x, __x = _S_left(__x); -<span class="lineNum"> 1060 </span> : else -<span class="lineNum"> 1061 </span> : { -<span class="lineNum"> 1062 </span> : _Const_Link_type __xu(__x), __yu(__y); -<span class="lineNum"> 1063 </span> : __y = __x, __x = _S_left(__x); -<span class="lineNum"> 1064 </span> : __xu = _S_right(__xu); -<span class="lineNum"> 1065 </span> : return pair<const_iterator, -<span class="lineNum"> 1066 </span> : const_iterator>(_M_lower_bound(__x, __y, __k), -<span class="lineNum"> 1067 </span> : _M_upper_bound(__xu, __yu, __k)); -<span class="lineNum"> 1068 </span> : } -<span class="lineNum"> 1069 </span> : } -<span class="lineNum"> 1070 </span> : return pair<const_iterator, const_iterator>(const_iterator(__y), -<span class="lineNum"> 1071 </span> : const_iterator(__y)); -<span class="lineNum"> 1072 </span> : } -<span class="lineNum"> 1073 </span> : -<span class="lineNum"> 1074 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1075 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1076 </span> : void -<span class="lineNum"> 1077 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1078 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1079 </span> : swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&& __t) -<span class="lineNum"> 1080 </span> : #else -<span class="lineNum"> 1081 </span> : swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t) -<span class="lineNum"> 1082 </span> : #endif -<span class="lineNum"> 1083 </span> : { -<span class="lineNum"> 1084 </span> : if (_M_root() == 0) -<span class="lineNum"> 1085 </span> : { -<span class="lineNum"> 1086 </span> : if (__t._M_root() != 0) -<span class="lineNum"> 1087 </span> : { -<span class="lineNum"> 1088 </span> : _M_root() = __t._M_root(); -<span class="lineNum"> 1089 </span> : _M_leftmost() = __t._M_leftmost(); -<span class="lineNum"> 1090 </span> : _M_rightmost() = __t._M_rightmost(); -<span class="lineNum"> 1091 </span> : _M_root()->_M_parent = _M_end(); -<span class="lineNum"> 1092 </span> : -<span class="lineNum"> 1093 </span> : __t._M_root() = 0; -<span class="lineNum"> 1094 </span> : __t._M_leftmost() = __t._M_end(); -<span class="lineNum"> 1095 </span> : __t._M_rightmost() = __t._M_end(); -<span class="lineNum"> 1096 </span> : } -<span class="lineNum"> 1097 </span> : } -<span class="lineNum"> 1098 </span> : else if (__t._M_root() == 0) -<span class="lineNum"> 1099 </span> : { -<span class="lineNum"> 1100 </span> : __t._M_root() = _M_root(); -<span class="lineNum"> 1101 </span> : __t._M_leftmost() = _M_leftmost(); -<span class="lineNum"> 1102 </span> : __t._M_rightmost() = _M_rightmost(); -<span class="lineNum"> 1103 </span> : __t._M_root()->_M_parent = __t._M_end(); -<span class="lineNum"> 1104 </span> : -<span class="lineNum"> 1105 </span> : _M_root() = 0; -<span class="lineNum"> 1106 </span> : _M_leftmost() = _M_end(); -<span class="lineNum"> 1107 </span> : _M_rightmost() = _M_end(); -<span class="lineNum"> 1108 </span> : } -<span class="lineNum"> 1109 </span> : else -<span class="lineNum"> 1110 </span> : { -<span class="lineNum"> 1111 </span> : std::swap(_M_root(),__t._M_root()); -<span class="lineNum"> 1112 </span> : std::swap(_M_leftmost(),__t._M_leftmost()); -<span class="lineNum"> 1113 </span> : std::swap(_M_rightmost(),__t._M_rightmost()); -<span class="lineNum"> 1114 </span> : -<span class="lineNum"> 1115 </span> : _M_root()->_M_parent = _M_end(); -<span class="lineNum"> 1116 </span> : __t._M_root()->_M_parent = __t._M_end(); -<span class="lineNum"> 1117 </span> : } -<span class="lineNum"> 1118 </span> : // No need to swap header's color as it does not change. -<span class="lineNum"> 1119 </span> : std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count); -<span class="lineNum"> 1120 </span> : std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare); -<span class="lineNum"> 1121 </span> : -<span class="lineNum"> 1122 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1123 </span> : // 431. Swapping containers with unequal allocators. -<span class="lineNum"> 1124 </span> : std::__alloc_swap<_Node_allocator>:: -<span class="lineNum"> 1125 </span> : _S_do_it(_M_get_Node_allocator(), __t._M_get_Node_allocator()); -<span class="lineNum"> 1126 </span> : } -<span class="lineNum"> 1127 </span> : -<span class="lineNum"> 1128 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1129 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1130 </span> : pair<typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1131 </span> : _Compare, _Alloc>::iterator, bool> -<span class="lineNum"> 1132 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1133 </span><span class="lineCov"> 1653740 : _M_insert_unique(const _Val& __v)</span> -<span class="lineNum"> 1134 </span> : { -<span class="lineNum"> 1135 </span><span class="lineCov"> 1653740 : _Link_type __x = _M_begin();</span> -<span class="lineNum"> 1136 </span><span class="lineCov"> 1653740 : _Link_type __y = _M_end();</span> -<span class="lineNum"> 1137 </span><span class="lineCov"> 1653740 : bool __comp = true;</span> -<span class="lineNum"> 1138 </span><span class="lineCov"> 9798389 : while (__x != 0)</span> -<span class="lineNum"> 1139 </span> : { -<span class="lineNum"> 1140 </span><span class="lineCov"> 6490909 : __y = __x;</span> -<span class="lineNum"> 1141 </span><span class="lineCov"> 6490909 : __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));</span> -<span class="lineNum"> 1142 </span><span class="lineCov"> 6490909 : __x = __comp ? _S_left(__x) : _S_right(__x);</span> -<span class="lineNum"> 1143 </span> : } -<span class="lineNum"> 1144 </span><span class="lineCov"> 1653740 : iterator __j = iterator(__y);</span> -<span class="lineNum"> 1145 </span><span class="lineCov"> 1653740 : if (__comp)</span> -<span class="lineNum"> 1146 </span> : { -<span class="lineNum"> 1147 </span><span class="lineCov"> 536188 : if (__j == begin())</span> -<span class="lineNum"> 1148 </span><span class="lineCov"> 452855 : return pair<iterator, bool>(_M_insert_(__x, __y, __v), true);</span> -<span class="lineNum"> 1149 </span> : else -<span class="lineNum"> 1150 </span><span class="lineCov"> 83333 : --__j;</span> -<span class="lineNum"> 1151 </span> : } -<span class="lineNum"> 1152 </span><span class="lineCov"> 1200885 : if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))</span> -<span class="lineNum"> 1153 </span><span class="lineCov"> 1095156 : return pair<iterator, bool>(_M_insert_(__x, __y, __v), true);</span> -<span class="lineNum"> 1154 </span><span class="lineCov"> 105729 : return pair<iterator, bool>(__j, false);</span> -<span class="lineNum"> 1155 </span> : } -<span class="lineNum"> 1156 </span> : -<span class="lineNum"> 1157 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1158 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1159 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator -<span class="lineNum"> 1160 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1161 </span> : _M_insert_equal(const _Val& __v) -<span class="lineNum"> 1162 </span> : { -<span class="lineNum"> 1163 </span> : _Link_type __x = _M_begin(); -<span class="lineNum"> 1164 </span> : _Link_type __y = _M_end(); -<span class="lineNum"> 1165 </span> : while (__x != 0) -<span class="lineNum"> 1166 </span> : { -<span class="lineNum"> 1167 </span> : __y = __x; -<span class="lineNum"> 1168 </span> : __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ? -<span class="lineNum"> 1169 </span> : _S_left(__x) : _S_right(__x); -<span class="lineNum"> 1170 </span> : } -<span class="lineNum"> 1171 </span> : return _M_insert_(__x, __y, __v); -<span class="lineNum"> 1172 </span> : } -<span class="lineNum"> 1173 </span> : -<span class="lineNum"> 1174 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1175 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1176 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator -<span class="lineNum"> 1177 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1178 </span><span class="lineCov"> 652700 : _M_insert_unique_(const_iterator __position, const _Val& __v)</span> -<span class="lineNum"> 1179 </span> : { -<span class="lineNum"> 1180 </span> : // end() -<span class="lineNum"> 1181 </span><span class="lineCov"> 652700 : if (__position._M_node == _M_end())</span> -<span class="lineNum"> 1182 </span> : { -<span class="lineNum"> 1183 </span><span class="lineCov"> 649758 : if (size() > 0</span> -<span class="lineNum"> 1184 </span> : && _M_impl._M_key_compare(_S_key(_M_rightmost()), -<span class="lineNum"> 1185 </span> : _KeyOfValue()(__v))) -<span class="lineNum"> 1186 </span><span class="lineCov"> 521501 : return _M_insert_(0, _M_rightmost(), __v);</span> -<span class="lineNum"> 1187 </span> : else -<span class="lineNum"> 1188 </span><span class="lineCov"> 128257 : return _M_insert_unique(__v).first;</span> -<span class="lineNum"> 1189 </span> : } -<span class="lineNum"> 1190 </span><span class="lineCov"> 2942 : else if (_M_impl._M_key_compare(_KeyOfValue()(__v),</span> -<span class="lineNum"> 1191 </span> : _S_key(__position._M_node))) -<span class="lineNum"> 1192 </span> : { -<span class="lineNum"> 1193 </span> : // First, try before... -<span class="lineNum"> 1194 </span><span class="lineCov"> 2040 : const_iterator __before = __position;</span> -<span class="lineNum"> 1195 </span><span class="lineCov"> 2040 : if (__position._M_node == _M_leftmost()) // begin()</span> -<span class="lineNum"> 1196 </span><span class="lineCov"> 72 : return _M_insert_(_M_leftmost(), _M_leftmost(), __v);</span> -<span class="lineNum"> 1197 </span><span class="lineCov"> 1968 : else if (_M_impl._M_key_compare(_S_key((--__before)._M_node), </span> -<span class="lineNum"> 1198 </span> : _KeyOfValue()(__v))) -<span class="lineNum"> 1199 </span> : { -<span class="lineNum"> 1200 </span><span class="lineCov"> 1101 : if (_S_right(__before._M_node) == 0)</span> -<span class="lineNum"> 1201 </span><span class="lineCov"> 562 : return _M_insert_(0, __before._M_node, __v);</span> -<span class="lineNum"> 1202 </span> : else -<span class="lineNum"> 1203 </span> : return _M_insert_(__position._M_node, -<span class="lineNum"> 1204 </span><span class="lineCov"> 539 : __position._M_node, __v);</span> -<span class="lineNum"> 1205 </span> : } -<span class="lineNum"> 1206 </span> : else -<span class="lineNum"> 1207 </span><span class="lineCov"> 867 : return _M_insert_unique(__v).first;</span> -<span class="lineNum"> 1208 </span> : } -<span class="lineNum"> 1209 </span><span class="lineCov"> 902 : else if (_M_impl._M_key_compare(_S_key(__position._M_node),</span> -<span class="lineNum"> 1210 </span> : _KeyOfValue()(__v))) -<span class="lineNum"> 1211 </span> : { -<span class="lineNum"> 1212 </span> : // ... then try after. -<span class="lineNum"> 1213 </span><span class="lineCov"> 902 : const_iterator __after = __position;</span> -<span class="lineNum"> 1214 </span><span class="lineCov"> 902 : if (__position._M_node == _M_rightmost())</span> -<span class="lineNum"> 1215 </span><span class="lineCov"> 13 : return _M_insert_(0, _M_rightmost(), __v);</span> -<span class="lineNum"> 1216 </span><span class="lineCov"> 889 : else if (_M_impl._M_key_compare(_KeyOfValue()(__v),</span> -<span class="lineNum"> 1217 </span> : _S_key((++__after)._M_node))) -<span class="lineNum"> 1218 </span> : { -<span class="lineNum"> 1219 </span><span class="lineCov"> 8 : if (_S_right(__position._M_node) == 0)</span> -<span class="lineNum"> 1220 </span><span class="lineCov"> 4 : return _M_insert_(0, __position._M_node, __v);</span> -<span class="lineNum"> 1221 </span> : else -<span class="lineNum"> 1222 </span><span class="lineCov"> 4 : return _M_insert_(__after._M_node, __after._M_node, __v);</span> -<span class="lineNum"> 1223 </span> : } -<span class="lineNum"> 1224 </span> : else -<span class="lineNum"> 1225 </span><span class="lineCov"> 881 : return _M_insert_unique(__v).first;</span> -<span class="lineNum"> 1226 </span> : } -<span class="lineNum"> 1227 </span> : else -<span class="lineNum"> 1228 </span> : // Equivalent keys. -<span class="lineNum"> 1229 </span> : return iterator(static_cast<_Link_type> -<span class="lineNum"> 1230 </span><span class="lineNoCov"> 0 : (const_cast<_Base_ptr>(__position._M_node)));</span> -<span class="lineNum"> 1231 </span> : } -<span class="lineNum"> 1232 </span> : -<span class="lineNum"> 1233 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1234 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1235 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator -<span class="lineNum"> 1236 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1237 </span> : _M_insert_equal_(const_iterator __position, const _Val& __v) -<span class="lineNum"> 1238 </span> : { -<span class="lineNum"> 1239 </span> : // end() -<span class="lineNum"> 1240 </span> : if (__position._M_node == _M_end()) -<span class="lineNum"> 1241 </span> : { -<span class="lineNum"> 1242 </span> : if (size() > 0 -<span class="lineNum"> 1243 </span> : && !_M_impl._M_key_compare(_KeyOfValue()(__v), -<span class="lineNum"> 1244 </span> : _S_key(_M_rightmost()))) -<span class="lineNum"> 1245 </span> : return _M_insert_(0, _M_rightmost(), __v); -<span class="lineNum"> 1246 </span> : else -<span class="lineNum"> 1247 </span> : return _M_insert_equal(__v); -<span class="lineNum"> 1248 </span> : } -<span class="lineNum"> 1249 </span> : else if (!_M_impl._M_key_compare(_S_key(__position._M_node), -<span class="lineNum"> 1250 </span> : _KeyOfValue()(__v))) -<span class="lineNum"> 1251 </span> : { -<span class="lineNum"> 1252 </span> : // First, try before... -<span class="lineNum"> 1253 </span> : const_iterator __before = __position; -<span class="lineNum"> 1254 </span> : if (__position._M_node == _M_leftmost()) // begin() -<span class="lineNum"> 1255 </span> : return _M_insert_(_M_leftmost(), _M_leftmost(), __v); -<span class="lineNum"> 1256 </span> : else if (!_M_impl._M_key_compare(_KeyOfValue()(__v), -<span class="lineNum"> 1257 </span> : _S_key((--__before)._M_node))) -<span class="lineNum"> 1258 </span> : { -<span class="lineNum"> 1259 </span> : if (_S_right(__before._M_node) == 0) -<span class="lineNum"> 1260 </span> : return _M_insert_(0, __before._M_node, __v); -<span class="lineNum"> 1261 </span> : else -<span class="lineNum"> 1262 </span> : return _M_insert_(__position._M_node, -<span class="lineNum"> 1263 </span> : __position._M_node, __v); -<span class="lineNum"> 1264 </span> : } -<span class="lineNum"> 1265 </span> : else -<span class="lineNum"> 1266 </span> : return _M_insert_equal(__v); -<span class="lineNum"> 1267 </span> : } -<span class="lineNum"> 1268 </span> : else -<span class="lineNum"> 1269 </span> : { -<span class="lineNum"> 1270 </span> : // ... then try after. -<span class="lineNum"> 1271 </span> : const_iterator __after = __position; -<span class="lineNum"> 1272 </span> : if (__position._M_node == _M_rightmost()) -<span class="lineNum"> 1273 </span> : return _M_insert_(0, _M_rightmost(), __v); -<span class="lineNum"> 1274 </span> : else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node), -<span class="lineNum"> 1275 </span> : _KeyOfValue()(__v))) -<span class="lineNum"> 1276 </span> : { -<span class="lineNum"> 1277 </span> : if (_S_right(__position._M_node) == 0) -<span class="lineNum"> 1278 </span> : return _M_insert_(0, __position._M_node, __v); -<span class="lineNum"> 1279 </span> : else -<span class="lineNum"> 1280 </span> : return _M_insert_(__after._M_node, __after._M_node, __v); -<span class="lineNum"> 1281 </span> : } -<span class="lineNum"> 1282 </span> : else -<span class="lineNum"> 1283 </span> : return _M_insert_equal_lower(__v); -<span class="lineNum"> 1284 </span> : } -<span class="lineNum"> 1285 </span> : } -<span class="lineNum"> 1286 </span> : -<span class="lineNum"> 1287 </span> : template<typename _Key, typename _Val, typename _KoV, -<span class="lineNum"> 1288 </span> : typename _Cmp, typename _Alloc> -<span class="lineNum"> 1289 </span> : template<class _II> -<span class="lineNum"> 1290 </span> : void -<span class="lineNum"> 1291 </span> : _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>:: -<span class="lineNum"> 1292 </span> : _M_insert_unique(_II __first, _II __last) -<span class="lineNum"> 1293 </span> : { -<span class="lineNum"> 1294 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 1295 </span> : _M_insert_unique_(end(), *__first); -<span class="lineNum"> 1296 </span> : } -<span class="lineNum"> 1297 </span> : -<span class="lineNum"> 1298 </span> : template<typename _Key, typename _Val, typename _KoV, -<span class="lineNum"> 1299 </span> : typename _Cmp, typename _Alloc> -<span class="lineNum"> 1300 </span> : template<class _II> -<span class="lineNum"> 1301 </span> : void -<span class="lineNum"> 1302 </span> : _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>:: -<span class="lineNum"> 1303 </span> : _M_insert_equal(_II __first, _II __last) -<span class="lineNum"> 1304 </span> : { -<span class="lineNum"> 1305 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 1306 </span> : _M_insert_equal_(end(), *__first); -<span class="lineNum"> 1307 </span> : } -<span class="lineNum"> 1308 </span> : -<span class="lineNum"> 1309 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1310 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1311 </span> : inline void -<span class="lineNum"> 1312 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1313 </span><span class="lineNoCov"> 0 : erase(iterator __position)</span> -<span class="lineNum"> 1314 </span> : { -<span class="lineNum"> 1315 </span> : _Link_type __y = -<span class="lineNum"> 1316 </span> : static_cast<_Link_type>(_Rb_tree_rebalance_for_erase -<span class="lineNum"> 1317 </span> : (__position._M_node, -<span class="lineNum"> 1318 </span><span class="lineNoCov"> 0 : this->_M_impl._M_header));</span> -<span class="lineNum"> 1319 </span><span class="lineNoCov"> 0 : _M_destroy_node(__y);</span> -<span class="lineNum"> 1320 </span><span class="lineNoCov"> 0 : --_M_impl._M_node_count;</span> -<span class="lineNum"> 1321 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1322 </span> : -<span class="lineNum"> 1323 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1324 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1325 </span> : inline void -<span class="lineNum"> 1326 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1327 </span><span class="lineCov"> 129 : erase(const_iterator __position)</span> -<span class="lineNum"> 1328 </span> : { -<span class="lineNum"> 1329 </span> : _Link_type __y = -<span class="lineNum"> 1330 </span> : static_cast<_Link_type>(_Rb_tree_rebalance_for_erase -<span class="lineNum"> 1331 </span> : (const_cast<_Base_ptr>(__position._M_node), -<span class="lineNum"> 1332 </span><span class="lineCov"> 129 : this->_M_impl._M_header));</span> -<span class="lineNum"> 1333 </span><span class="lineCov"> 129 : _M_destroy_node(__y);</span> -<span class="lineNum"> 1334 </span><span class="lineCov"> 129 : --_M_impl._M_node_count;</span> -<span class="lineNum"> 1335 </span><span class="lineCov"> 129 : }</span> -<span class="lineNum"> 1336 </span> : -<span class="lineNum"> 1337 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1338 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1339 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type -<span class="lineNum"> 1340 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1341 </span><span class="lineCov"> 9 : erase(const _Key& __x)</span> -<span class="lineNum"> 1342 </span> : { -<span class="lineNum"> 1343 </span><span class="lineCov"> 9 : pair<iterator, iterator> __p = equal_range(__x);</span> -<span class="lineNum"> 1344 </span><span class="lineCov"> 9 : const size_type __old_size = size();</span> -<span class="lineNum"> 1345 </span><span class="lineCov"> 9 : erase(__p.first, __p.second);</span> -<span class="lineNum"> 1346 </span><span class="lineCov"> 9 : return __old_size - size();</span> -<span class="lineNum"> 1347 </span> : } -<span class="lineNum"> 1348 </span> : -<span class="lineNum"> 1349 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1350 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1351 </span> : void -<span class="lineNum"> 1352 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1353 </span><span class="lineCov"> 9 : erase(iterator __first, iterator __last)</span> -<span class="lineNum"> 1354 </span> : { -<span class="lineNum"> 1355 </span><span class="lineCov"> 9 : if (__first == begin() && __last == end())</span> -<span class="lineNum"> 1356 </span><span class="lineCov"> 7 : clear();</span> -<span class="lineNum"> 1357 </span> : else -<span class="lineNum"> 1358 </span><span class="lineCov"> 4 : while (__first != __last)</span> -<span class="lineNum"> 1359 </span><span class="lineNoCov"> 0 : erase(__first++);</span> -<span class="lineNum"> 1360 </span><span class="lineCov"> 9 : }</span> -<span class="lineNum"> 1361 </span> : -<span class="lineNum"> 1362 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1363 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1364 </span> : void -<span class="lineNum"> 1365 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1366 </span> : erase(const_iterator __first, const_iterator __last) -<span class="lineNum"> 1367 </span> : { -<span class="lineNum"> 1368 </span> : if (__first == begin() && __last == end()) -<span class="lineNum"> 1369 </span> : clear(); -<span class="lineNum"> 1370 </span> : else -<span class="lineNum"> 1371 </span> : while (__first != __last) -<span class="lineNum"> 1372 </span> : erase(__first++); -<span class="lineNum"> 1373 </span> : } -<span class="lineNum"> 1374 </span> : -<span class="lineNum"> 1375 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1376 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1377 </span> : void -<span class="lineNum"> 1378 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1379 </span> : erase(const _Key* __first, const _Key* __last) -<span class="lineNum"> 1380 </span> : { -<span class="lineNum"> 1381 </span> : while (__first != __last) -<span class="lineNum"> 1382 </span> : erase(*__first++); -<span class="lineNum"> 1383 </span> : } -<span class="lineNum"> 1384 </span> : -<span class="lineNum"> 1385 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1386 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1387 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1388 </span> : _Compare, _Alloc>::iterator -<span class="lineNum"> 1389 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1390 </span><span class="lineCov"> 50156 : find(const _Key& __k)</span> -<span class="lineNum"> 1391 </span> : { -<span class="lineNum"> 1392 </span><span class="lineCov"> 50156 : iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);</span> -<span class="lineNum"> 1393 </span> : return (__j == end() -<span class="lineNum"> 1394 </span> : || _M_impl._M_key_compare(__k, -<span class="lineNum"> 1395 </span><span class="lineCov"> 50156 : _S_key(__j._M_node))) ? end() : __j;</span> -<span class="lineNum"> 1396 </span> : } -<span class="lineNum"> 1397 </span> : -<span class="lineNum"> 1398 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1399 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1400 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, -<span class="lineNum"> 1401 </span> : _Compare, _Alloc>::const_iterator -<span class="lineNum"> 1402 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1403 </span><span class="lineCov"> 3932 : find(const _Key& __k) const</span> -<span class="lineNum"> 1404 </span> : { -<span class="lineNum"> 1405 </span><span class="lineCov"> 3932 : const_iterator __j = _M_lower_bound(_M_begin(), _M_end(), __k);</span> -<span class="lineNum"> 1406 </span> : return (__j == end() -<span class="lineNum"> 1407 </span> : || _M_impl._M_key_compare(__k, -<span class="lineNum"> 1408 </span><span class="lineCov"> 3932 : _S_key(__j._M_node))) ? end() : __j;</span> -<span class="lineNum"> 1409 </span> : } -<span class="lineNum"> 1410 </span> : -<span class="lineNum"> 1411 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1412 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1413 </span> : typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type -<span class="lineNum"> 1414 </span> : _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: -<span class="lineNum"> 1415 </span> : count(const _Key& __k) const -<span class="lineNum"> 1416 </span> : { -<span class="lineNum"> 1417 </span> : pair<const_iterator, const_iterator> __p = equal_range(__k); -<span class="lineNum"> 1418 </span> : const size_type __n = std::distance(__p.first, __p.second); -<span class="lineNum"> 1419 </span> : return __n; -<span class="lineNum"> 1420 </span> : } -<span class="lineNum"> 1421 </span> : -<span class="lineNum"> 1422 </span> : unsigned int -<span class="lineNum"> 1423 </span> : _Rb_tree_black_count(const _Rb_tree_node_base* __node, -<span class="lineNum"> 1424 </span> : const _Rb_tree_node_base* __root); -<span class="lineNum"> 1425 </span> : -<span class="lineNum"> 1426 </span> : template<typename _Key, typename _Val, typename _KeyOfValue, -<span class="lineNum"> 1427 </span> : typename _Compare, typename _Alloc> -<span class="lineNum"> 1428 </span> : bool -<span class="lineNum"> 1429 </span> : _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const -<span class="lineNum"> 1430 </span> : { -<span class="lineNum"> 1431 </span> : if (_M_impl._M_node_count == 0 || begin() == end()) -<span class="lineNum"> 1432 </span> : return _M_impl._M_node_count == 0 && begin() == end() -<span class="lineNum"> 1433 </span> : && this->_M_impl._M_header._M_left == _M_end() -<span class="lineNum"> 1434 </span> : && this->_M_impl._M_header._M_right == _M_end(); -<span class="lineNum"> 1435 </span> : -<span class="lineNum"> 1436 </span> : unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root()); -<span class="lineNum"> 1437 </span> : for (const_iterator __it = begin(); __it != end(); ++__it) -<span class="lineNum"> 1438 </span> : { -<span class="lineNum"> 1439 </span> : _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node); -<span class="lineNum"> 1440 </span> : _Const_Link_type __L = _S_left(__x); -<span class="lineNum"> 1441 </span> : _Const_Link_type __R = _S_right(__x); -<span class="lineNum"> 1442 </span> : -<span class="lineNum"> 1443 </span> : if (__x->_M_color == _S_red) -<span class="lineNum"> 1444 </span> : if ((__L && __L->_M_color == _S_red) -<span class="lineNum"> 1445 </span> : || (__R && __R->_M_color == _S_red)) -<span class="lineNum"> 1446 </span> : return false; -<span class="lineNum"> 1447 </span> : -<span class="lineNum"> 1448 </span> : if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L))) -<span class="lineNum"> 1449 </span> : return false; -<span class="lineNum"> 1450 </span> : if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x))) -<span class="lineNum"> 1451 </span> : return false; -<span class="lineNum"> 1452 </span> : -<span class="lineNum"> 1453 </span> : if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len) -<span class="lineNum"> 1454 </span> : return false; -<span class="lineNum"> 1455 </span> : } -<span class="lineNum"> 1456 </span> : -<span class="lineNum"> 1457 </span> : if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root())) -<span class="lineNum"> 1458 </span> : return false; -<span class="lineNum"> 1459 </span> : if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root())) -<span class="lineNum"> 1460 </span> : return false; -<span class="lineNum"> 1461 </span> : return true; -<span class="lineNum"> 1462 </span> : } -<span class="lineNum"> 1463 </span> : -<span class="lineNum"> 1464 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 1465 </span> : -<span class="lineNum"> 1466 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_uninitialized.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_uninitialized.h.gcov.html deleted file mode 100644 index 08dd2e7..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_uninitialized.h.gcov.html +++ /dev/null @@ -1,503 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_uninitialized.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_uninitialized.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">43</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">58.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">25</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Raw memory manipulators -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_uninitialized.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_UNINITIALIZED_H -<span class="lineNum"> 63 </span> : #define _STL_UNINITIALIZED_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : template<bool> -<span class="lineNum"> 68 </span> : struct __uninitialized_copy -<span class="lineNum"> 69 </span> : { -<span class="lineNum"> 70 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 71 </span> : static _ForwardIterator -<span class="lineNum"> 72 </span> : uninitialized_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 73 </span><span class="lineCov"> 36673 : _ForwardIterator __result)</span> -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span><span class="lineCov"> 36673 : _ForwardIterator __cur = __result;</span> -<span class="lineNum"> 76 </span> : try -<span class="lineNum"> 77 </span> : { -<span class="lineNum"> 78 </span><span class="lineCov"> 84888 : for (; __first != __last; ++__first, ++__cur)</span> -<span class="lineNum"> 79 </span><span class="lineCov"> 48215 : ::new(static_cast<void*>(&*__cur)) typename</span> -<span class="lineNum"> 80 </span> : iterator_traits<_ForwardIterator>::value_type(*__first); -<span class="lineNum"> 81 </span><span class="lineCov"> 36660 : return __cur;</span> -<span class="lineNum"> 82 </span> : } -<span class="lineNum"> 83 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 84 </span> : { -<span class="lineNum"> 85 </span><span class="lineNoCov"> 0 : std::_Destroy(__result, __cur);</span> -<span class="lineNum"> 86 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 87 </span> : } -<span class="lineNum"> 88 </span> : } -<span class="lineNum"> 89 </span> : }; -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : template<> -<span class="lineNum"> 92 </span> : struct __uninitialized_copy<true> -<span class="lineNum"> 93 </span> : { -<span class="lineNum"> 94 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 95 </span> : static _ForwardIterator -<span class="lineNum"> 96 </span> : uninitialized_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 97 </span><span class="lineCov"> 27152 : _ForwardIterator __result)</span> -<span class="lineNum"> 98 </span><span class="lineCov"> 27152 : { return std::copy(__first, __last, __result); }</span> -<span class="lineNum"> 99 </span> : }; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : /** -<span class="lineNum"> 102 </span> : * @brief Copies the range [first,last) into result. -<span class="lineNum"> 103 </span> : * @param first An input iterator. -<span class="lineNum"> 104 </span> : * @param last An input iterator. -<span class="lineNum"> 105 </span> : * @param result An output iterator. -<span class="lineNum"> 106 </span> : * @return result + (first - last) -<span class="lineNum"> 107 </span> : * -<span class="lineNum"> 108 </span> : * Like copy(), but does not require an initialized output range. -<span class="lineNum"> 109 </span> : */ -<span class="lineNum"> 110 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 111 </span> : inline _ForwardIterator -<span class="lineNum"> 112 </span> : uninitialized_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 113 </span><span class="lineCov"> 63825 : _ForwardIterator __result)</span> -<span class="lineNum"> 114 </span> : { -<span class="lineNum"> 115 </span> : typedef typename iterator_traits<_InputIterator>::value_type -<span class="lineNum"> 116 </span> : _ValueType1; -<span class="lineNum"> 117 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 118 </span> : _ValueType2; -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : return std::__uninitialized_copy<(__is_pod(_ValueType1) -<span class="lineNum"> 121 </span> : && __is_pod(_ValueType2))>:: -<span class="lineNum"> 122 </span><span class="lineCov"> 63825 : uninitialized_copy(__first, __last, __result);</span> -<span class="lineNum"> 123 </span> : } -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : template<bool> -<span class="lineNum"> 127 </span> : struct __uninitialized_fill -<span class="lineNum"> 128 </span> : { -<span class="lineNum"> 129 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 130 </span> : static void -<span class="lineNum"> 131 </span> : uninitialized_fill(_ForwardIterator __first, -<span class="lineNum"> 132 </span> : _ForwardIterator __last, const _Tp& __x) -<span class="lineNum"> 133 </span> : { -<span class="lineNum"> 134 </span> : _ForwardIterator __cur = __first; -<span class="lineNum"> 135 </span> : try -<span class="lineNum"> 136 </span> : { -<span class="lineNum"> 137 </span> : for (; __cur != __last; ++__cur) -<span class="lineNum"> 138 </span> : std::_Construct(&*__cur, __x); -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span> : catch(...) -<span class="lineNum"> 141 </span> : { -<span class="lineNum"> 142 </span> : std::_Destroy(__first, __cur); -<span class="lineNum"> 143 </span> : __throw_exception_again; -<span class="lineNum"> 144 </span> : } -<span class="lineNum"> 145 </span> : } -<span class="lineNum"> 146 </span> : }; -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : template<> -<span class="lineNum"> 149 </span> : struct __uninitialized_fill<true> -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 152 </span> : static void -<span class="lineNum"> 153 </span> : uninitialized_fill(_ForwardIterator __first, -<span class="lineNum"> 154 </span> : _ForwardIterator __last, const _Tp& __x) -<span class="lineNum"> 155 </span> : { std::fill(__first, __last, __x); } -<span class="lineNum"> 156 </span> : }; -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : /** -<span class="lineNum"> 159 </span> : * @brief Copies the value x into the range [first,last). -<span class="lineNum"> 160 </span> : * @param first An input iterator. -<span class="lineNum"> 161 </span> : * @param last An input iterator. -<span class="lineNum"> 162 </span> : * @param x The source value. -<span class="lineNum"> 163 </span> : * @return Nothing. -<span class="lineNum"> 164 </span> : * -<span class="lineNum"> 165 </span> : * Like fill(), but does not require an initialized output range. -<span class="lineNum"> 166 </span> : */ -<span class="lineNum"> 167 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 168 </span> : inline void -<span class="lineNum"> 169 </span> : uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 170 </span> : const _Tp& __x) -<span class="lineNum"> 171 </span> : { -<span class="lineNum"> 172 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 173 </span> : _ValueType; -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : std::__uninitialized_fill<__is_pod(_ValueType)>:: -<span class="lineNum"> 176 </span> : uninitialized_fill(__first, __last, __x); -<span class="lineNum"> 177 </span> : } -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : template<bool> -<span class="lineNum"> 181 </span> : struct __uninitialized_fill_n -<span class="lineNum"> 182 </span> : { -<span class="lineNum"> 183 </span> : template<typename _ForwardIterator, typename _Size, typename _Tp> -<span class="lineNum"> 184 </span> : static void -<span class="lineNum"> 185 </span> : uninitialized_fill_n(_ForwardIterator __first, _Size __n, -<span class="lineNum"> 186 </span><span class="lineCov"> 22443 : const _Tp& __x)</span> -<span class="lineNum"> 187 </span> : { -<span class="lineNum"> 188 </span><span class="lineCov"> 22443 : _ForwardIterator __cur = __first;</span> -<span class="lineNum"> 189 </span> : try -<span class="lineNum"> 190 </span> : { -<span class="lineNum"> 191 </span><span class="lineCov"> 46138 : for (; __n > 0; --__n, ++__cur)</span> -<span class="lineNum"> 192 </span><span class="lineCov"> 23695 : std::_Construct(&*__cur, __x);</span> -<span class="lineNum"> 193 </span> : } -<span class="lineNum"> 194 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 195 </span> : { -<span class="lineNum"> 196 </span><span class="lineNoCov"> 0 : std::_Destroy(__first, __cur);</span> -<span class="lineNum"> 197 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 198 </span> : } -<span class="lineNum"> 199 </span><span class="lineCov"> 22443 : }</span> -<span class="lineNum"> 200 </span> : }; -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : template<> -<span class="lineNum"> 203 </span> : struct __uninitialized_fill_n<true> -<span class="lineNum"> 204 </span> : { -<span class="lineNum"> 205 </span> : template<typename _ForwardIterator, typename _Size, typename _Tp> -<span class="lineNum"> 206 </span> : static void -<span class="lineNum"> 207 </span> : uninitialized_fill_n(_ForwardIterator __first, _Size __n, -<span class="lineNum"> 208 </span><span class="lineCov"> 9 : const _Tp& __x)</span> -<span class="lineNum"> 209 </span><span class="lineCov"> 9 : { std::fill_n(__first, __n, __x); }</span> -<span class="lineNum"> 210 </span> : }; -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : /** -<span class="lineNum"> 213 </span> : * @brief Copies the value x into the range [first,first+n). -<span class="lineNum"> 214 </span> : * @param first An input iterator. -<span class="lineNum"> 215 </span> : * @param n The number of copies to make. -<span class="lineNum"> 216 </span> : * @param x The source value. -<span class="lineNum"> 217 </span> : * @return Nothing. -<span class="lineNum"> 218 </span> : * -<span class="lineNum"> 219 </span> : * Like fill_n(), but does not require an initialized output range. -<span class="lineNum"> 220 </span> : */ -<span class="lineNum"> 221 </span> : template<typename _ForwardIterator, typename _Size, typename _Tp> -<span class="lineNum"> 222 </span> : inline void -<span class="lineNum"> 223 </span><span class="lineCov"> 22452 : uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)</span> -<span class="lineNum"> 224 </span> : { -<span class="lineNum"> 225 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 226 </span> : _ValueType; -<span class="lineNum"> 227 </span> : -<span class="lineNum"> 228 </span><span class="lineCov"> 22452 : std::__uninitialized_fill_n<__is_pod(_ValueType)>::</span> -<span class="lineNum"> 229 </span> : uninitialized_fill_n(__first, __n, __x); -<span class="lineNum"> 230 </span><span class="lineCov"> 22452 : }</span> -<span class="lineNum"> 231 </span> : -<span class="lineNum"> 232 </span> : // Extensions: versions of uninitialized_copy, uninitialized_fill, -<span class="lineNum"> 233 </span> : // and uninitialized_fill_n that take an allocator parameter. -<span class="lineNum"> 234 </span> : // We dispatch back to the standard versions when we're given the -<span class="lineNum"> 235 </span> : // default allocator. For nondefault allocators we do not use -<span class="lineNum"> 236 </span> : // any of the POD optimizations. -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : template<typename _InputIterator, typename _ForwardIterator, -<span class="lineNum"> 239 </span> : typename _Allocator> -<span class="lineNum"> 240 </span> : _ForwardIterator -<span class="lineNum"> 241 </span> : __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 242 </span> : _ForwardIterator __result, _Allocator& __alloc) -<span class="lineNum"> 243 </span> : { -<span class="lineNum"> 244 </span> : _ForwardIterator __cur = __result; -<span class="lineNum"> 245 </span> : try -<span class="lineNum"> 246 </span> : { -<span class="lineNum"> 247 </span> : for (; __first != __last; ++__first, ++__cur) -<span class="lineNum"> 248 </span> : __alloc.construct(&*__cur, *__first); -<span class="lineNum"> 249 </span> : return __cur; -<span class="lineNum"> 250 </span> : } -<span class="lineNum"> 251 </span> : catch(...) -<span class="lineNum"> 252 </span> : { -<span class="lineNum"> 253 </span> : std::_Destroy(__result, __cur, __alloc); -<span class="lineNum"> 254 </span> : __throw_exception_again; -<span class="lineNum"> 255 </span> : } -<span class="lineNum"> 256 </span> : } -<span class="lineNum"> 257 </span> : -<span class="lineNum"> 258 </span> : template<typename _InputIterator, typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 259 </span> : inline _ForwardIterator -<span class="lineNum"> 260 </span> : __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 261 </span><span class="lineCov"> 63825 : _ForwardIterator __result, allocator<_Tp>&)</span> -<span class="lineNum"> 262 </span><span class="lineCov"> 63825 : { return std::uninitialized_copy(__first, __last, __result); }</span> -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : template<typename _InputIterator, typename _ForwardIterator, -<span class="lineNum"> 265 </span> : typename _Allocator> -<span class="lineNum"> 266 </span> : inline _ForwardIterator -<span class="lineNum"> 267 </span> : __uninitialized_move_a(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 268 </span><span class="lineCov"> 63802 : _ForwardIterator __result, _Allocator& __alloc)</span> -<span class="lineNum"> 269 </span> : { -<span class="lineNum"> 270 </span> : return std::__uninitialized_copy_a(_GLIBCXX_MAKE_MOVE_ITERATOR(__first), -<span class="lineNum"> 271 </span> : _GLIBCXX_MAKE_MOVE_ITERATOR(__last), -<span class="lineNum"> 272 </span><span class="lineCov"> 63802 : __result, __alloc);</span> -<span class="lineNum"> 273 </span> : } -<span class="lineNum"> 274 </span> : -<span class="lineNum"> 275 </span> : template<typename _ForwardIterator, typename _Tp, typename _Allocator> -<span class="lineNum"> 276 </span> : void -<span class="lineNum"> 277 </span> : __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 278 </span> : const _Tp& __x, _Allocator& __alloc) -<span class="lineNum"> 279 </span> : { -<span class="lineNum"> 280 </span> : _ForwardIterator __cur = __first; -<span class="lineNum"> 281 </span> : try -<span class="lineNum"> 282 </span> : { -<span class="lineNum"> 283 </span> : for (; __cur != __last; ++__cur) -<span class="lineNum"> 284 </span> : __alloc.construct(&*__cur, __x); -<span class="lineNum"> 285 </span> : } -<span class="lineNum"> 286 </span> : catch(...) -<span class="lineNum"> 287 </span> : { -<span class="lineNum"> 288 </span> : std::_Destroy(__first, __cur, __alloc); -<span class="lineNum"> 289 </span> : __throw_exception_again; -<span class="lineNum"> 290 </span> : } -<span class="lineNum"> 291 </span> : } -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : template<typename _ForwardIterator, typename _Tp, typename _Tp2> -<span class="lineNum"> 294 </span> : inline void -<span class="lineNum"> 295 </span> : __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 296 </span> : const _Tp& __x, allocator<_Tp2>&) -<span class="lineNum"> 297 </span> : { std::uninitialized_fill(__first, __last, __x); } -<span class="lineNum"> 298 </span> : -<span class="lineNum"> 299 </span> : template<typename _ForwardIterator, typename _Size, typename _Tp, -<span class="lineNum"> 300 </span> : typename _Allocator> -<span class="lineNum"> 301 </span> : void -<span class="lineNum"> 302 </span> : __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, -<span class="lineNum"> 303 </span> : const _Tp& __x, _Allocator& __alloc) -<span class="lineNum"> 304 </span> : { -<span class="lineNum"> 305 </span> : _ForwardIterator __cur = __first; -<span class="lineNum"> 306 </span> : try -<span class="lineNum"> 307 </span> : { -<span class="lineNum"> 308 </span> : for (; __n > 0; --__n, ++__cur) -<span class="lineNum"> 309 </span> : __alloc.construct(&*__cur, __x); -<span class="lineNum"> 310 </span> : } -<span class="lineNum"> 311 </span> : catch(...) -<span class="lineNum"> 312 </span> : { -<span class="lineNum"> 313 </span> : std::_Destroy(__first, __cur, __alloc); -<span class="lineNum"> 314 </span> : __throw_exception_again; -<span class="lineNum"> 315 </span> : } -<span class="lineNum"> 316 </span> : } -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : template<typename _ForwardIterator, typename _Size, typename _Tp, -<span class="lineNum"> 319 </span> : typename _Tp2> -<span class="lineNum"> 320 </span> : inline void -<span class="lineNum"> 321 </span> : __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, -<span class="lineNum"> 322 </span><span class="lineCov"> 22452 : const _Tp& __x, allocator<_Tp2>&)</span> -<span class="lineNum"> 323 </span><span class="lineCov"> 22452 : { std::uninitialized_fill_n(__first, __n, __x); }</span> -<span class="lineNum"> 324 </span> : -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span> : // Extensions: __uninitialized_copy_move, __uninitialized_move_copy, -<span class="lineNum"> 327 </span> : // __uninitialized_fill_move, __uninitialized_move_fill. -<span class="lineNum"> 328 </span> : // All of these algorithms take a user-supplied allocator, which is used -<span class="lineNum"> 329 </span> : // for construction and destruction. -<span class="lineNum"> 330 </span> : -<span class="lineNum"> 331 </span> : // __uninitialized_copy_move -<span class="lineNum"> 332 </span> : // Copies [first1, last1) into [result, result + (last1 - first1)), and -<span class="lineNum"> 333 </span> : // move [first2, last2) into -<span class="lineNum"> 334 </span> : // [result, result + (last1 - first1) + (last2 - first2)). -<span class="lineNum"> 335 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 336 </span> : typename _ForwardIterator, typename _Allocator> -<span class="lineNum"> 337 </span> : inline _ForwardIterator -<span class="lineNum"> 338 </span> : __uninitialized_copy_move(_InputIterator1 __first1, -<span class="lineNum"> 339 </span> : _InputIterator1 __last1, -<span class="lineNum"> 340 </span> : _InputIterator2 __first2, -<span class="lineNum"> 341 </span> : _InputIterator2 __last2, -<span class="lineNum"> 342 </span> : _ForwardIterator __result, -<span class="lineNum"> 343 </span><span class="lineNoCov"> 0 : _Allocator& __alloc)</span> -<span class="lineNum"> 344 </span> : { -<span class="lineNum"> 345 </span> : _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1, -<span class="lineNum"> 346 </span> : __result, -<span class="lineNum"> 347 </span><span class="lineNoCov"> 0 : __alloc);</span> -<span class="lineNum"> 348 </span> : try -<span class="lineNum"> 349 </span> : { -<span class="lineNum"> 350 </span><span class="lineNoCov"> 0 : return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc);</span> -<span class="lineNum"> 351 </span> : } -<span class="lineNum"> 352 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 353 </span> : { -<span class="lineNum"> 354 </span><span class="lineNoCov"> 0 : std::_Destroy(__result, __mid, __alloc);</span> -<span class="lineNum"> 355 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 356 </span> : } -<span class="lineNum"> 357 </span> : } -<span class="lineNum"> 358 </span> : -<span class="lineNum"> 359 </span> : // __uninitialized_move_copy -<span class="lineNum"> 360 </span> : // Moves [first1, last1) into [result, result + (last1 - first1)), and -<span class="lineNum"> 361 </span> : // copies [first2, last2) into -<span class="lineNum"> 362 </span> : // [result, result + (last1 - first1) + (last2 - first2)). -<span class="lineNum"> 363 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 364 </span> : typename _ForwardIterator, typename _Allocator> -<span class="lineNum"> 365 </span> : inline _ForwardIterator -<span class="lineNum"> 366 </span> : __uninitialized_move_copy(_InputIterator1 __first1, -<span class="lineNum"> 367 </span> : _InputIterator1 __last1, -<span class="lineNum"> 368 </span> : _InputIterator2 __first2, -<span class="lineNum"> 369 </span> : _InputIterator2 __last2, -<span class="lineNum"> 370 </span> : _ForwardIterator __result, -<span class="lineNum"> 371 </span><span class="lineNoCov"> 0 : _Allocator& __alloc)</span> -<span class="lineNum"> 372 </span> : { -<span class="lineNum"> 373 </span> : _ForwardIterator __mid = std::__uninitialized_move_a(__first1, __last1, -<span class="lineNum"> 374 </span> : __result, -<span class="lineNum"> 375 </span><span class="lineNoCov"> 0 : __alloc);</span> -<span class="lineNum"> 376 </span> : try -<span class="lineNum"> 377 </span> : { -<span class="lineNum"> 378 </span><span class="lineNoCov"> 0 : return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc);</span> -<span class="lineNum"> 379 </span> : } -<span class="lineNum"> 380 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 381 </span> : { -<span class="lineNum"> 382 </span><span class="lineNoCov"> 0 : std::_Destroy(__result, __mid, __alloc);</span> -<span class="lineNum"> 383 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 384 </span> : } -<span class="lineNum"> 385 </span> : } -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span> : // __uninitialized_fill_move -<span class="lineNum"> 388 </span> : // Fills [result, mid) with x, and moves [first, last) into -<span class="lineNum"> 389 </span> : // [mid, mid + (last - first)). -<span class="lineNum"> 390 </span> : template<typename _ForwardIterator, typename _Tp, typename _InputIterator, -<span class="lineNum"> 391 </span> : typename _Allocator> -<span class="lineNum"> 392 </span> : inline _ForwardIterator -<span class="lineNum"> 393 </span> : __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid, -<span class="lineNum"> 394 </span> : const _Tp& __x, _InputIterator __first, -<span class="lineNum"> 395 </span> : _InputIterator __last, _Allocator& __alloc) -<span class="lineNum"> 396 </span> : { -<span class="lineNum"> 397 </span> : std::__uninitialized_fill_a(__result, __mid, __x, __alloc); -<span class="lineNum"> 398 </span> : try -<span class="lineNum"> 399 </span> : { -<span class="lineNum"> 400 </span> : return std::__uninitialized_move_a(__first, __last, __mid, __alloc); -<span class="lineNum"> 401 </span> : } -<span class="lineNum"> 402 </span> : catch(...) -<span class="lineNum"> 403 </span> : { -<span class="lineNum"> 404 </span> : std::_Destroy(__result, __mid, __alloc); -<span class="lineNum"> 405 </span> : __throw_exception_again; -<span class="lineNum"> 406 </span> : } -<span class="lineNum"> 407 </span> : } -<span class="lineNum"> 408 </span> : -<span class="lineNum"> 409 </span> : // __uninitialized_move_fill -<span class="lineNum"> 410 </span> : // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and -<span class="lineNum"> 411 </span> : // fills [first2 + (last1 - first1), last2) with x. -<span class="lineNum"> 412 </span> : template<typename _InputIterator, typename _ForwardIterator, typename _Tp, -<span class="lineNum"> 413 </span> : typename _Allocator> -<span class="lineNum"> 414 </span> : inline void -<span class="lineNum"> 415 </span> : __uninitialized_move_fill(_InputIterator __first1, _InputIterator __last1, -<span class="lineNum"> 416 </span> : _ForwardIterator __first2, -<span class="lineNum"> 417 </span> : _ForwardIterator __last2, const _Tp& __x, -<span class="lineNum"> 418 </span> : _Allocator& __alloc) -<span class="lineNum"> 419 </span> : { -<span class="lineNum"> 420 </span> : _ForwardIterator __mid2 = std::__uninitialized_move_a(__first1, __last1, -<span class="lineNum"> 421 </span> : __first2, -<span class="lineNum"> 422 </span> : __alloc); -<span class="lineNum"> 423 </span> : try -<span class="lineNum"> 424 </span> : { -<span class="lineNum"> 425 </span> : std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc); -<span class="lineNum"> 426 </span> : } -<span class="lineNum"> 427 </span> : catch(...) -<span class="lineNum"> 428 </span> : { -<span class="lineNum"> 429 </span> : std::_Destroy(__first2, __mid2, __alloc); -<span class="lineNum"> 430 </span> : __throw_exception_again; -<span class="lineNum"> 431 </span> : } -<span class="lineNum"> 432 </span> : } -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 435 </span> : -<span class="lineNum"> 436 </span> : #endif /* _STL_UNINITIALIZED_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stl_vector.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_vector.h.gcov.html deleted file mode 100644 index 847af95..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_vector.h.gcov.html +++ /dev/null @@ -1,1241 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_vector.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_vector.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">103</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">91.3 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">94</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Vector implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_vector.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_VECTOR_H -<span class="lineNum"> 63 </span> : #define _STL_VECTOR_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <bits/stl_iterator_base_funcs.h> -<span class="lineNum"> 66 </span> : #include <bits/functexcept.h> -<span class="lineNum"> 67 </span> : #include <bits/concept_check.h> -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : /// See bits/stl_deque.h's _Deque_base for an explanation. -<span class="lineNum"> 72 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 73 </span> : struct _Vector_base -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span> : typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type; -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : struct _Vector_impl -<span class="lineNum"> 78 </span> : : public _Tp_alloc_type -<span class="lineNum"> 79 </span><span class="lineCov"> 4841 : {</span> -<span class="lineNum"> 80 </span> : _Tp* _M_start; -<span class="lineNum"> 81 </span> : _Tp* _M_finish; -<span class="lineNum"> 82 </span> : _Tp* _M_end_of_storage; -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span><span class="lineCov"> 4840 : _Vector_impl()</span> -<span class="lineNum"> 85 </span><span class="lineCov"> 4840 : : _Tp_alloc_type(), _M_start(0), _M_finish(0), _M_end_of_storage(0)</span> -<span class="lineNum"> 86 </span><span class="lineCov"> 4840 : { }</span> -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span><span class="lineCov"> 9 : _Vector_impl(_Tp_alloc_type const& __a)</span> -<span class="lineNum"> 89 </span><span class="lineCov"> 9 : : _Tp_alloc_type(__a), _M_start(0), _M_finish(0), _M_end_of_storage(0)</span> -<span class="lineNum"> 90 </span><span class="lineCov"> 9 : { }</span> -<span class="lineNum"> 91 </span> : }; -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : public: -<span class="lineNum"> 94 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : _Tp_alloc_type& -<span class="lineNum"> 97 </span><span class="lineCov"> 119679 : _M_get_Tp_allocator()</span> -<span class="lineNum"> 98 </span><span class="lineCov"> 119679 : { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }</span> -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : const _Tp_alloc_type& -<span class="lineNum"> 101 </span><span class="lineCov"> 41426 : _M_get_Tp_allocator() const</span> -<span class="lineNum"> 102 </span><span class="lineCov"> 41426 : { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }</span> -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : allocator_type -<span class="lineNum"> 105 </span> : get_allocator() const -<span class="lineNum"> 106 </span> : { return allocator_type(_M_get_Tp_allocator()); } -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span><span class="lineCov"> 4840 : _Vector_base()</span> -<span class="lineNum"> 109 </span><span class="lineCov"> 4840 : : _M_impl() { }</span> -<span class="lineNum"> 110 </span> : -<span class="lineNum"> 111 </span> : _Vector_base(const allocator_type& __a) -<span class="lineNum"> 112 </span> : : _M_impl(__a) { } -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span><span class="lineCov"> 9 : _Vector_base(size_t __n, const allocator_type& __a)</span> -<span class="lineNum"> 115 </span><span class="lineCov"> 9 : : _M_impl(__a)</span> -<span class="lineNum"> 116 </span> : { -<span class="lineNum"> 117 </span><span class="lineCov"> 9 : this->_M_impl._M_start = this->_M_allocate(__n);</span> -<span class="lineNum"> 118 </span><span class="lineCov"> 9 : this->_M_impl._M_finish = this->_M_impl._M_start;</span> -<span class="lineNum"> 119 </span><span class="lineCov"> 9 : this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;</span> -<span class="lineNum"> 120 </span><span class="lineCov"> 9 : }</span> -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 123 </span> : _Vector_base(_Vector_base&& __x) -<span class="lineNum"> 124 </span> : : _M_impl(__x._M_get_Tp_allocator()) -<span class="lineNum"> 125 </span> : { -<span class="lineNum"> 126 </span> : this->_M_impl._M_start = __x._M_impl._M_start; -<span class="lineNum"> 127 </span> : this->_M_impl._M_finish = __x._M_impl._M_finish; -<span class="lineNum"> 128 </span> : this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage; -<span class="lineNum"> 129 </span> : __x._M_impl._M_start = 0; -<span class="lineNum"> 130 </span> : __x._M_impl._M_finish = 0; -<span class="lineNum"> 131 </span> : __x._M_impl._M_end_of_storage = 0; -<span class="lineNum"> 132 </span> : } -<span class="lineNum"> 133 </span> : #endif -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span><span class="lineCov"> 4841 : ~_Vector_base()</span> -<span class="lineNum"> 136 </span><span class="lineCov"> 4841 : { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage</span> -<span class="lineNum"> 137 </span><span class="lineCov"> 4841 : - this->_M_impl._M_start); }</span> -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : public: -<span class="lineNum"> 140 </span> : _Vector_impl _M_impl; -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : _Tp* -<span class="lineNum"> 143 </span><span class="lineCov"> 20727 : _M_allocate(size_t __n)</span> -<span class="lineNum"> 144 </span><span class="lineCov"> 20727 : { return __n != 0 ? _M_impl.allocate(__n) : 0; }</span> -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : void -<span class="lineNum"> 147 </span><span class="lineCov"> 25559 : _M_deallocate(_Tp* __p, size_t __n)</span> -<span class="lineNum"> 148 </span> : { -<span class="lineNum"> 149 </span><span class="lineCov"> 25559 : if (__p)</span> -<span class="lineNum"> 150 </span><span class="lineCov"> 20616 : _M_impl.deallocate(__p, __n);</span> -<span class="lineNum"> 151 </span><span class="lineCov"> 25559 : }</span> -<span class="lineNum"> 152 </span> : }; -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : /** -<span class="lineNum"> 156 </span> : * @brief A standard container which offers fixed time access to -<span class="lineNum"> 157 </span> : * individual elements in any order. -<span class="lineNum"> 158 </span> : * -<span class="lineNum"> 159 </span> : * @ingroup Containers -<span class="lineNum"> 160 </span> : * @ingroup Sequences -<span class="lineNum"> 161 </span> : * -<span class="lineNum"> 162 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a -<span class="lineNum"> 163 </span> : * <a href="tables.html#66">reversible container</a>, and a -<span class="lineNum"> 164 </span> : * <a href="tables.html#67">sequence</a>, including the -<span class="lineNum"> 165 </span> : * <a href="tables.html#68">optional sequence requirements</a> with the -<span class="lineNum"> 166 </span> : * %exception of @c push_front and @c pop_front. -<span class="lineNum"> 167 </span> : * -<span class="lineNum"> 168 </span> : * In some terminology a %vector can be described as a dynamic -<span class="lineNum"> 169 </span> : * C-style array, it offers fast and efficient access to individual -<span class="lineNum"> 170 </span> : * elements in any order and saves the user from worrying about -<span class="lineNum"> 171 </span> : * memory and size allocation. Subscripting ( @c [] ) access is -<span class="lineNum"> 172 </span> : * also provided as with C-style arrays. -<span class="lineNum"> 173 </span> : */ -<span class="lineNum"> 174 </span> : template<typename _Tp, typename _Alloc = std::allocator<_Tp> > -<span class="lineNum"> 175 </span> : class vector : protected _Vector_base<_Tp, _Alloc> -<span class="lineNum"> 176 </span> : { -<span class="lineNum"> 177 </span> : // Concept requirements. -<span class="lineNum"> 178 </span> : typedef typename _Alloc::value_type _Alloc_value_type; -<span class="lineNum"> 179 </span> : __glibcxx_class_requires(_Tp, _SGIAssignableConcept) -<span class="lineNum"> 180 </span> : __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept) -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : typedef _Vector_base<_Tp, _Alloc> _Base; -<span class="lineNum"> 183 </span> : typedef vector<_Tp, _Alloc> vector_type; -<span class="lineNum"> 184 </span> : typedef typename _Base::_Tp_alloc_type _Tp_alloc_type; -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span> : public: -<span class="lineNum"> 187 </span> : typedef _Tp value_type; -<span class="lineNum"> 188 </span> : typedef typename _Tp_alloc_type::pointer pointer; -<span class="lineNum"> 189 </span> : typedef typename _Tp_alloc_type::const_pointer const_pointer; -<span class="lineNum"> 190 </span> : typedef typename _Tp_alloc_type::reference reference; -<span class="lineNum"> 191 </span> : typedef typename _Tp_alloc_type::const_reference const_reference; -<span class="lineNum"> 192 </span> : typedef __gnu_cxx::__normal_iterator<pointer, vector_type> iterator; -<span class="lineNum"> 193 </span> : typedef __gnu_cxx::__normal_iterator<const_pointer, vector_type> -<span class="lineNum"> 194 </span> : const_iterator; -<span class="lineNum"> 195 </span> : typedef std::reverse_iterator<const_iterator> const_reverse_iterator; -<span class="lineNum"> 196 </span> : typedef std::reverse_iterator<iterator> reverse_iterator; -<span class="lineNum"> 197 </span> : typedef size_t size_type; -<span class="lineNum"> 198 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 199 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : protected: -<span class="lineNum"> 202 </span> : using _Base::_M_allocate; -<span class="lineNum"> 203 </span> : using _Base::_M_deallocate; -<span class="lineNum"> 204 </span> : using _Base::_M_impl; -<span class="lineNum"> 205 </span> : using _Base::_M_get_Tp_allocator; -<span class="lineNum"> 206 </span> : -<span class="lineNum"> 207 </span> : public: -<span class="lineNum"> 208 </span> : // [23.2.4.1] construct/copy/destroy -<span class="lineNum"> 209 </span> : // (assign() and get_allocator() are also listed in this section) -<span class="lineNum"> 210 </span> : /** -<span class="lineNum"> 211 </span> : * @brief Default constructor creates no elements. -<span class="lineNum"> 212 </span> : */ -<span class="lineNum"> 213 </span><span class="lineCov"> 4840 : vector()</span> -<span class="lineNum"> 214 </span><span class="lineCov"> 4840 : : _Base() { }</span> -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : /** -<span class="lineNum"> 217 </span> : * @brief Creates a %vector with no elements. -<span class="lineNum"> 218 </span> : * @param a An allocator object. -<span class="lineNum"> 219 </span> : */ -<span class="lineNum"> 220 </span> : explicit -<span class="lineNum"> 221 </span> : vector(const allocator_type& __a) -<span class="lineNum"> 222 </span> : : _Base(__a) { } -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : /** -<span class="lineNum"> 225 </span> : * @brief Creates a %vector with copies of an exemplar element. -<span class="lineNum"> 226 </span> : * @param n The number of elements to initially create. -<span class="lineNum"> 227 </span> : * @param value An element to copy. -<span class="lineNum"> 228 </span> : * @param a An allocator. -<span class="lineNum"> 229 </span> : * -<span class="lineNum"> 230 </span> : * This constructor fills the %vector with @a n copies of @a value. -<span class="lineNum"> 231 </span> : */ -<span class="lineNum"> 232 </span> : explicit -<span class="lineNum"> 233 </span> : vector(size_type __n, const value_type& __value = value_type(), -<span class="lineNum"> 234 </span><span class="lineCov"> 9 : const allocator_type& __a = allocator_type())</span> -<span class="lineNum"> 235 </span><span class="lineCov"> 9 : : _Base(__n, __a)</span> -<span class="lineNum"> 236 </span><span class="lineCov"> 9 : { _M_fill_initialize(__n, __value); }</span> -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : /** -<span class="lineNum"> 239 </span> : * @brief %Vector copy constructor. -<span class="lineNum"> 240 </span> : * @param x A %vector of identical element and allocator types. -<span class="lineNum"> 241 </span> : * -<span class="lineNum"> 242 </span> : * The newly-created %vector uses a copy of the allocation -<span class="lineNum"> 243 </span> : * object used by @a x. All the elements of @a x are copied, -<span class="lineNum"> 244 </span> : * but any extra memory in -<span class="lineNum"> 245 </span> : * @a x (for fast expansion) will not be copied. -<span class="lineNum"> 246 </span> : */ -<span class="lineNum"> 247 </span><span class="lineNoCov"> 0 : vector(const vector& __x)</span> -<span class="lineNum"> 248 </span><span class="lineNoCov"> 0 : : _Base(__x.size(), __x._M_get_Tp_allocator())</span> -<span class="lineNum"> 249 </span><span class="lineNoCov"> 0 : { this->_M_impl._M_finish =</span> -<span class="lineNum"> 250 </span> : std::__uninitialized_copy_a(__x.begin(), __x.end(), -<span class="lineNum"> 251 </span> : this->_M_impl._M_start, -<span class="lineNum"> 252 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 253 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 254 </span> : -<span class="lineNum"> 255 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 256 </span> : /** -<span class="lineNum"> 257 </span> : * @brief %Vector move constructor. -<span class="lineNum"> 258 </span> : * @param x A %vector of identical element and allocator types. -<span class="lineNum"> 259 </span> : * -<span class="lineNum"> 260 </span> : * The newly-created %vector contains the exact contents of @a x. -<span class="lineNum"> 261 </span> : * The contents of @a x are a valid, but unspecified %vector. -<span class="lineNum"> 262 </span> : */ -<span class="lineNum"> 263 </span> : vector(vector&& __x) -<span class="lineNum"> 264 </span> : : _Base(std::forward<_Base>(__x)) { } -<span class="lineNum"> 265 </span> : #endif -<span class="lineNum"> 266 </span> : -<span class="lineNum"> 267 </span> : /** -<span class="lineNum"> 268 </span> : * @brief Builds a %vector from a range. -<span class="lineNum"> 269 </span> : * @param first An input iterator. -<span class="lineNum"> 270 </span> : * @param last An input iterator. -<span class="lineNum"> 271 </span> : * @param a An allocator. -<span class="lineNum"> 272 </span> : * -<span class="lineNum"> 273 </span> : * Create a %vector consisting of copies of the elements from -<span class="lineNum"> 274 </span> : * [first,last). -<span class="lineNum"> 275 </span> : * -<span class="lineNum"> 276 </span> : * If the iterators are forward, bidirectional, or -<span class="lineNum"> 277 </span> : * random-access, then this will call the elements' copy -<span class="lineNum"> 278 </span> : * constructor N times (where N is distance(first,last)) and do -<span class="lineNum"> 279 </span> : * no memory reallocation. But if only input iterators are -<span class="lineNum"> 280 </span> : * used, then this will do at most 2N calls to the copy -<span class="lineNum"> 281 </span> : * constructor, and logN memory reallocations. -<span class="lineNum"> 282 </span> : */ -<span class="lineNum"> 283 </span> : template<typename _InputIterator> -<span class="lineNum"> 284 </span> : vector(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 285 </span> : const allocator_type& __a = allocator_type()) -<span class="lineNum"> 286 </span> : : _Base(__a) -<span class="lineNum"> 287 </span> : { -<span class="lineNum"> 288 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 289 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 290 </span> : _M_initialize_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 291 </span> : } -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : /** -<span class="lineNum"> 294 </span> : * The dtor only erases the elements, and note that if the -<span class="lineNum"> 295 </span> : * elements themselves are pointers, the pointed-to memory is -<span class="lineNum"> 296 </span> : * not touched in any way. Managing the pointer is the user's -<span class="lineNum"> 297 </span> : * responsibility. -<span class="lineNum"> 298 </span> : */ -<span class="lineNum"> 299 </span><span class="lineCov"> 4841 : ~vector()</span> -<span class="lineNum"> 300 </span><span class="lineCov"> 4841 : { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,</span> -<span class="lineNum"> 301 </span><span class="lineCov"> 4841 : _M_get_Tp_allocator()); }</span> -<span class="lineNum"> 302 </span> : -<span class="lineNum"> 303 </span> : /** -<span class="lineNum"> 304 </span> : * @brief %Vector assignment operator. -<span class="lineNum"> 305 </span> : * @param x A %vector of identical element and allocator types. -<span class="lineNum"> 306 </span> : * -<span class="lineNum"> 307 </span> : * All the elements of @a x are copied, but any extra memory in -<span class="lineNum"> 308 </span> : * @a x (for fast expansion) will not be copied. Unlike the -<span class="lineNum"> 309 </span> : * copy constructor, the allocator object is not copied. -<span class="lineNum"> 310 </span> : */ -<span class="lineNum"> 311 </span> : vector& -<span class="lineNum"> 312 </span> : operator=(const vector& __x); -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 315 </span> : /** -<span class="lineNum"> 316 </span> : * @brief %Vector move assignment operator. -<span class="lineNum"> 317 </span> : * @param x A %vector of identical element and allocator types. -<span class="lineNum"> 318 </span> : * -<span class="lineNum"> 319 </span> : * The contents of @a x are moved into this %vector (without copying). -<span class="lineNum"> 320 </span> : * @a x is a valid, but unspecified %vector. -<span class="lineNum"> 321 </span> : */ -<span class="lineNum"> 322 </span> : vector& -<span class="lineNum"> 323 </span> : operator=(vector&& __x) -<span class="lineNum"> 324 </span> : { -<span class="lineNum"> 325 </span> : // NB: DR 675. -<span class="lineNum"> 326 </span> : this->clear(); -<span class="lineNum"> 327 </span> : this->swap(__x); -<span class="lineNum"> 328 </span> : return *this; -<span class="lineNum"> 329 </span> : } -<span class="lineNum"> 330 </span> : #endif -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : /** -<span class="lineNum"> 333 </span> : * @brief Assigns a given value to a %vector. -<span class="lineNum"> 334 </span> : * @param n Number of elements to be assigned. -<span class="lineNum"> 335 </span> : * @param val Value to be assigned. -<span class="lineNum"> 336 </span> : * -<span class="lineNum"> 337 </span> : * This function fills a %vector with @a n copies of the given -<span class="lineNum"> 338 </span> : * value. Note that the assignment completely changes the -<span class="lineNum"> 339 </span> : * %vector and that the resulting %vector's size is the same as -<span class="lineNum"> 340 </span> : * the number of elements assigned. Old data may be lost. -<span class="lineNum"> 341 </span> : */ -<span class="lineNum"> 342 </span> : void -<span class="lineNum"> 343 </span> : assign(size_type __n, const value_type& __val) -<span class="lineNum"> 344 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 345 </span> : -<span class="lineNum"> 346 </span> : /** -<span class="lineNum"> 347 </span> : * @brief Assigns a range to a %vector. -<span class="lineNum"> 348 </span> : * @param first An input iterator. -<span class="lineNum"> 349 </span> : * @param last An input iterator. -<span class="lineNum"> 350 </span> : * -<span class="lineNum"> 351 </span> : * This function fills a %vector with copies of the elements in the -<span class="lineNum"> 352 </span> : * range [first,last). -<span class="lineNum"> 353 </span> : * -<span class="lineNum"> 354 </span> : * Note that the assignment completely changes the %vector and -<span class="lineNum"> 355 </span> : * that the resulting %vector's size is the same as the number -<span class="lineNum"> 356 </span> : * of elements assigned. Old data may be lost. -<span class="lineNum"> 357 </span> : */ -<span class="lineNum"> 358 </span> : template<typename _InputIterator> -<span class="lineNum"> 359 </span> : void -<span class="lineNum"> 360 </span> : assign(_InputIterator __first, _InputIterator __last) -<span class="lineNum"> 361 </span> : { -<span class="lineNum"> 362 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 363 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 364 </span> : _M_assign_dispatch(__first, __last, _Integral()); -<span class="lineNum"> 365 </span> : } -<span class="lineNum"> 366 </span> : -<span class="lineNum"> 367 </span> : /// Get a copy of the memory allocation object. -<span class="lineNum"> 368 </span> : using _Base::get_allocator; -<span class="lineNum"> 369 </span> : -<span class="lineNum"> 370 </span> : // iterators -<span class="lineNum"> 371 </span> : /** -<span class="lineNum"> 372 </span> : * Returns a read/write iterator that points to the first -<span class="lineNum"> 373 </span> : * element in the %vector. Iteration is done in ordinary -<span class="lineNum"> 374 </span> : * element order. -<span class="lineNum"> 375 </span> : */ -<span class="lineNum"> 376 </span> : iterator -<span class="lineNum"> 377 </span><span class="lineCov"> 4034 : begin()</span> -<span class="lineNum"> 378 </span><span class="lineCov"> 4034 : { return iterator(this->_M_impl._M_start); }</span> -<span class="lineNum"> 379 </span> : -<span class="lineNum"> 380 </span> : /** -<span class="lineNum"> 381 </span> : * Returns a read-only (constant) iterator that points to the -<span class="lineNum"> 382 </span> : * first element in the %vector. Iteration is done in ordinary -<span class="lineNum"> 383 </span> : * element order. -<span class="lineNum"> 384 </span> : */ -<span class="lineNum"> 385 </span> : const_iterator -<span class="lineNum"> 386 </span><span class="lineCov"> 91 : begin() const</span> -<span class="lineNum"> 387 </span><span class="lineCov"> 91 : { return const_iterator(this->_M_impl._M_start); }</span> -<span class="lineNum"> 388 </span> : -<span class="lineNum"> 389 </span> : /** -<span class="lineNum"> 390 </span> : * Returns a read/write iterator that points one past the last -<span class="lineNum"> 391 </span> : * element in the %vector. Iteration is done in ordinary -<span class="lineNum"> 392 </span> : * element order. -<span class="lineNum"> 393 </span> : */ -<span class="lineNum"> 394 </span> : iterator -<span class="lineNum"> 395 </span><span class="lineCov"> 69161 : end()</span> -<span class="lineNum"> 396 </span><span class="lineCov"> 69161 : { return iterator(this->_M_impl._M_finish); }</span> -<span class="lineNum"> 397 </span> : -<span class="lineNum"> 398 </span> : /** -<span class="lineNum"> 399 </span> : * Returns a read-only (constant) iterator that points one past -<span class="lineNum"> 400 </span> : * the last element in the %vector. Iteration is done in -<span class="lineNum"> 401 </span> : * ordinary element order. -<span class="lineNum"> 402 </span> : */ -<span class="lineNum"> 403 </span> : const_iterator -<span class="lineNum"> 404 </span><span class="lineCov"> 175 : end() const</span> -<span class="lineNum"> 405 </span><span class="lineCov"> 175 : { return const_iterator(this->_M_impl._M_finish); }</span> -<span class="lineNum"> 406 </span> : -<span class="lineNum"> 407 </span> : /** -<span class="lineNum"> 408 </span> : * Returns a read/write reverse iterator that points to the -<span class="lineNum"> 409 </span> : * last element in the %vector. Iteration is done in reverse -<span class="lineNum"> 410 </span> : * element order. -<span class="lineNum"> 411 </span> : */ -<span class="lineNum"> 412 </span> : reverse_iterator -<span class="lineNum"> 413 </span><span class="lineCov"> 1 : rbegin()</span> -<span class="lineNum"> 414 </span><span class="lineCov"> 1 : { return reverse_iterator(end()); }</span> -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : /** -<span class="lineNum"> 417 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 418 </span> : * to the last element in the %vector. Iteration is done in -<span class="lineNum"> 419 </span> : * reverse element order. -<span class="lineNum"> 420 </span> : */ -<span class="lineNum"> 421 </span> : const_reverse_iterator -<span class="lineNum"> 422 </span> : rbegin() const -<span class="lineNum"> 423 </span> : { return const_reverse_iterator(end()); } -<span class="lineNum"> 424 </span> : -<span class="lineNum"> 425 </span> : /** -<span class="lineNum"> 426 </span> : * Returns a read/write reverse iterator that points to one -<span class="lineNum"> 427 </span> : * before the first element in the %vector. Iteration is done -<span class="lineNum"> 428 </span> : * in reverse element order. -<span class="lineNum"> 429 </span> : */ -<span class="lineNum"> 430 </span> : reverse_iterator -<span class="lineNum"> 431 </span> : rend() -<span class="lineNum"> 432 </span> : { return reverse_iterator(begin()); } -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : /** -<span class="lineNum"> 435 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 436 </span> : * to one before the first element in the %vector. Iteration -<span class="lineNum"> 437 </span> : * is done in reverse element order. -<span class="lineNum"> 438 </span> : */ -<span class="lineNum"> 439 </span> : const_reverse_iterator -<span class="lineNum"> 440 </span> : rend() const -<span class="lineNum"> 441 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 442 </span> : -<span class="lineNum"> 443 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 444 </span> : /** -<span class="lineNum"> 445 </span> : * Returns a read-only (constant) iterator that points to the -<span class="lineNum"> 446 </span> : * first element in the %vector. Iteration is done in ordinary -<span class="lineNum"> 447 </span> : * element order. -<span class="lineNum"> 448 </span> : */ -<span class="lineNum"> 449 </span> : const_iterator -<span class="lineNum"> 450 </span> : cbegin() const -<span class="lineNum"> 451 </span> : { return const_iterator(this->_M_impl._M_start); } -<span class="lineNum"> 452 </span> : -<span class="lineNum"> 453 </span> : /** -<span class="lineNum"> 454 </span> : * Returns a read-only (constant) iterator that points one past -<span class="lineNum"> 455 </span> : * the last element in the %vector. Iteration is done in -<span class="lineNum"> 456 </span> : * ordinary element order. -<span class="lineNum"> 457 </span> : */ -<span class="lineNum"> 458 </span> : const_iterator -<span class="lineNum"> 459 </span> : cend() const -<span class="lineNum"> 460 </span> : { return const_iterator(this->_M_impl._M_finish); } -<span class="lineNum"> 461 </span> : -<span class="lineNum"> 462 </span> : /** -<span class="lineNum"> 463 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 464 </span> : * to the last element in the %vector. Iteration is done in -<span class="lineNum"> 465 </span> : * reverse element order. -<span class="lineNum"> 466 </span> : */ -<span class="lineNum"> 467 </span> : const_reverse_iterator -<span class="lineNum"> 468 </span> : crbegin() const -<span class="lineNum"> 469 </span> : { return const_reverse_iterator(end()); } -<span class="lineNum"> 470 </span> : -<span class="lineNum"> 471 </span> : /** -<span class="lineNum"> 472 </span> : * Returns a read-only (constant) reverse iterator that points -<span class="lineNum"> 473 </span> : * to one before the first element in the %vector. Iteration -<span class="lineNum"> 474 </span> : * is done in reverse element order. -<span class="lineNum"> 475 </span> : */ -<span class="lineNum"> 476 </span> : const_reverse_iterator -<span class="lineNum"> 477 </span> : crend() const -<span class="lineNum"> 478 </span> : { return const_reverse_iterator(begin()); } -<span class="lineNum"> 479 </span> : #endif -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : // [23.2.4.2] capacity -<span class="lineNum"> 482 </span> : /** Returns the number of elements in the %vector. */ -<span class="lineNum"> 483 </span> : size_type -<span class="lineNum"> 484 </span><span class="lineCov"> 1028954 : size() const</span> -<span class="lineNum"> 485 </span><span class="lineCov"> 1028954 : { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }</span> -<span class="lineNum"> 486 </span> : -<span class="lineNum"> 487 </span> : /** Returns the size() of the largest possible %vector. */ -<span class="lineNum"> 488 </span> : size_type -<span class="lineNum"> 489 </span><span class="lineCov"> 41426 : max_size() const</span> -<span class="lineNum"> 490 </span><span class="lineCov"> 41426 : { return _M_get_Tp_allocator().max_size(); }</span> -<span class="lineNum"> 491 </span> : -<span class="lineNum"> 492 </span> : /** -<span class="lineNum"> 493 </span> : * @brief Resizes the %vector to the specified number of elements. -<span class="lineNum"> 494 </span> : * @param new_size Number of elements the %vector should contain. -<span class="lineNum"> 495 </span> : * @param x Data with which new elements should be populated. -<span class="lineNum"> 496 </span> : * -<span class="lineNum"> 497 </span> : * This function will %resize the %vector to the specified -<span class="lineNum"> 498 </span> : * number of elements. If the number is smaller than the -<span class="lineNum"> 499 </span> : * %vector's current size the %vector is truncated, otherwise -<span class="lineNum"> 500 </span> : * the %vector is extended and new elements are populated with -<span class="lineNum"> 501 </span> : * given data. -<span class="lineNum"> 502 </span> : */ -<span class="lineNum"> 503 </span> : void -<span class="lineNum"> 504 </span><span class="lineCov"> 22443 : resize(size_type __new_size, value_type __x = value_type())</span> -<span class="lineNum"> 505 </span> : { -<span class="lineNum"> 506 </span><span class="lineCov"> 22443 : if (__new_size < size())</span> -<span class="lineNum"> 507 </span><span class="lineNoCov"> 0 : _M_erase_at_end(this->_M_impl._M_start + __new_size);</span> -<span class="lineNum"> 508 </span> : else -<span class="lineNum"> 509 </span><span class="lineCov"> 22443 : insert(end(), __new_size - size(), __x);</span> -<span class="lineNum"> 510 </span><span class="lineCov"> 22443 : }</span> -<span class="lineNum"> 511 </span> : -<span class="lineNum"> 512 </span> : /** -<span class="lineNum"> 513 </span> : * Returns the total number of elements that the %vector can -<span class="lineNum"> 514 </span> : * hold before needing to allocate more memory. -<span class="lineNum"> 515 </span> : */ -<span class="lineNum"> 516 </span> : size_type -<span class="lineNum"> 517 </span><span class="lineCov"> 10 : capacity() const</span> -<span class="lineNum"> 518 </span> : { return size_type(this->_M_impl._M_end_of_storage -<span class="lineNum"> 519 </span><span class="lineCov"> 10 : - this->_M_impl._M_start); }</span> -<span class="lineNum"> 520 </span> : -<span class="lineNum"> 521 </span> : /** -<span class="lineNum"> 522 </span> : * Returns true if the %vector is empty. (Thus begin() would -<span class="lineNum"> 523 </span> : * equal end().) -<span class="lineNum"> 524 </span> : */ -<span class="lineNum"> 525 </span> : bool -<span class="lineNum"> 526 </span><span class="lineCov"> 25 : empty() const</span> -<span class="lineNum"> 527 </span><span class="lineCov"> 25 : { return begin() == end(); }</span> -<span class="lineNum"> 528 </span> : -<span class="lineNum"> 529 </span> : /** -<span class="lineNum"> 530 </span> : * @brief Attempt to preallocate enough memory for specified number of -<span class="lineNum"> 531 </span> : * elements. -<span class="lineNum"> 532 </span> : * @param n Number of elements required. -<span class="lineNum"> 533 </span> : * @throw std::length_error If @a n exceeds @c max_size(). -<span class="lineNum"> 534 </span> : * -<span class="lineNum"> 535 </span> : * This function attempts to reserve enough memory for the -<span class="lineNum"> 536 </span> : * %vector to hold the specified number of elements. If the -<span class="lineNum"> 537 </span> : * number requested is more than max_size(), length_error is -<span class="lineNum"> 538 </span> : * thrown. -<span class="lineNum"> 539 </span> : * -<span class="lineNum"> 540 </span> : * The advantage of this function is that if optimal code is a -<span class="lineNum"> 541 </span> : * necessity and the user can determine the number of elements -<span class="lineNum"> 542 </span> : * that will be required, the user can reserve the memory in -<span class="lineNum"> 543 </span> : * %advance, and thus prevent a possible reallocation of memory -<span class="lineNum"> 544 </span> : * and copying of %vector data. -<span class="lineNum"> 545 </span> : */ -<span class="lineNum"> 546 </span> : void -<span class="lineNum"> 547 </span> : reserve(size_type __n); -<span class="lineNum"> 548 </span> : -<span class="lineNum"> 549 </span> : // element access -<span class="lineNum"> 550 </span> : /** -<span class="lineNum"> 551 </span> : * @brief Subscript access to the data contained in the %vector. -<span class="lineNum"> 552 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 553 </span> : * accessed. -<span class="lineNum"> 554 </span> : * @return Read/write reference to data. -<span class="lineNum"> 555 </span> : * -<span class="lineNum"> 556 </span> : * This operator allows for easy, array-style, data access. -<span class="lineNum"> 557 </span> : * Note that data access with this operator is unchecked and -<span class="lineNum"> 558 </span> : * out_of_range lookups are not defined. (For checked lookups -<span class="lineNum"> 559 </span> : * see at().) -<span class="lineNum"> 560 </span> : */ -<span class="lineNum"> 561 </span> : reference -<span class="lineNum"> 562 </span><span class="lineCov"> 256895 : operator[](size_type __n)</span> -<span class="lineNum"> 563 </span><span class="lineCov"> 256895 : { return *(this->_M_impl._M_start + __n); }</span> -<span class="lineNum"> 564 </span> : -<span class="lineNum"> 565 </span> : /** -<span class="lineNum"> 566 </span> : * @brief Subscript access to the data contained in the %vector. -<span class="lineNum"> 567 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 568 </span> : * accessed. -<span class="lineNum"> 569 </span> : * @return Read-only (constant) reference to data. -<span class="lineNum"> 570 </span> : * -<span class="lineNum"> 571 </span> : * This operator allows for easy, array-style, data access. -<span class="lineNum"> 572 </span> : * Note that data access with this operator is unchecked and -<span class="lineNum"> 573 </span> : * out_of_range lookups are not defined. (For checked lookups -<span class="lineNum"> 574 </span> : * see at().) -<span class="lineNum"> 575 </span> : */ -<span class="lineNum"> 576 </span> : const_reference -<span class="lineNum"> 577 </span><span class="lineCov"> 1925198 : operator[](size_type __n) const</span> -<span class="lineNum"> 578 </span><span class="lineCov"> 1925198 : { return *(this->_M_impl._M_start + __n); }</span> -<span class="lineNum"> 579 </span> : -<span class="lineNum"> 580 </span> : protected: -<span class="lineNum"> 581 </span> : /// Safety check used only from at(). -<span class="lineNum"> 582 </span> : void -<span class="lineNum"> 583 </span> : _M_range_check(size_type __n) const -<span class="lineNum"> 584 </span> : { -<span class="lineNum"> 585 </span> : if (__n >= this->size()) -<span class="lineNum"> 586 </span> : __throw_out_of_range(__N("vector::_M_range_check")); -<span class="lineNum"> 587 </span> : } -<span class="lineNum"> 588 </span> : -<span class="lineNum"> 589 </span> : public: -<span class="lineNum"> 590 </span> : /** -<span class="lineNum"> 591 </span> : * @brief Provides access to the data contained in the %vector. -<span class="lineNum"> 592 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 593 </span> : * accessed. -<span class="lineNum"> 594 </span> : * @return Read/write reference to data. -<span class="lineNum"> 595 </span> : * @throw std::out_of_range If @a n is an invalid index. -<span class="lineNum"> 596 </span> : * -<span class="lineNum"> 597 </span> : * This function provides for safer data access. The parameter -<span class="lineNum"> 598 </span> : * is first checked that it is in the range of the vector. The -<span class="lineNum"> 599 </span> : * function throws out_of_range if the check fails. -<span class="lineNum"> 600 </span> : */ -<span class="lineNum"> 601 </span> : reference -<span class="lineNum"> 602 </span> : at(size_type __n) -<span class="lineNum"> 603 </span> : { -<span class="lineNum"> 604 </span> : _M_range_check(__n); -<span class="lineNum"> 605 </span> : return (*this)[__n]; -<span class="lineNum"> 606 </span> : } -<span class="lineNum"> 607 </span> : -<span class="lineNum"> 608 </span> : /** -<span class="lineNum"> 609 </span> : * @brief Provides access to the data contained in the %vector. -<span class="lineNum"> 610 </span> : * @param n The index of the element for which data should be -<span class="lineNum"> 611 </span> : * accessed. -<span class="lineNum"> 612 </span> : * @return Read-only (constant) reference to data. -<span class="lineNum"> 613 </span> : * @throw std::out_of_range If @a n is an invalid index. -<span class="lineNum"> 614 </span> : * -<span class="lineNum"> 615 </span> : * This function provides for safer data access. The parameter -<span class="lineNum"> 616 </span> : * is first checked that it is in the range of the vector. The -<span class="lineNum"> 617 </span> : * function throws out_of_range if the check fails. -<span class="lineNum"> 618 </span> : */ -<span class="lineNum"> 619 </span> : const_reference -<span class="lineNum"> 620 </span> : at(size_type __n) const -<span class="lineNum"> 621 </span> : { -<span class="lineNum"> 622 </span> : _M_range_check(__n); -<span class="lineNum"> 623 </span> : return (*this)[__n]; -<span class="lineNum"> 624 </span> : } -<span class="lineNum"> 625 </span> : -<span class="lineNum"> 626 </span> : /** -<span class="lineNum"> 627 </span> : * Returns a read/write reference to the data at the first -<span class="lineNum"> 628 </span> : * element of the %vector. -<span class="lineNum"> 629 </span> : */ -<span class="lineNum"> 630 </span> : reference -<span class="lineNum"> 631 </span> : front() -<span class="lineNum"> 632 </span> : { return *begin(); } -<span class="lineNum"> 633 </span> : -<span class="lineNum"> 634 </span> : /** -<span class="lineNum"> 635 </span> : * Returns a read-only (constant) reference to the data at the first -<span class="lineNum"> 636 </span> : * element of the %vector. -<span class="lineNum"> 637 </span> : */ -<span class="lineNum"> 638 </span> : const_reference -<span class="lineNum"> 639 </span> : front() const -<span class="lineNum"> 640 </span> : { return *begin(); } -<span class="lineNum"> 641 </span> : -<span class="lineNum"> 642 </span> : /** -<span class="lineNum"> 643 </span> : * Returns a read/write reference to the data at the last -<span class="lineNum"> 644 </span> : * element of the %vector. -<span class="lineNum"> 645 </span> : */ -<span class="lineNum"> 646 </span> : reference -<span class="lineNum"> 647 </span><span class="lineCov"> 3 : back()</span> -<span class="lineNum"> 648 </span><span class="lineCov"> 3 : { return *(end() - 1); }</span> -<span class="lineNum"> 649 </span> : -<span class="lineNum"> 650 </span> : /** -<span class="lineNum"> 651 </span> : * Returns a read-only (constant) reference to the data at the -<span class="lineNum"> 652 </span> : * last element of the %vector. -<span class="lineNum"> 653 </span> : */ -<span class="lineNum"> 654 </span> : const_reference -<span class="lineNum"> 655 </span> : back() const -<span class="lineNum"> 656 </span> : { return *(end() - 1); } -<span class="lineNum"> 657 </span> : -<span class="lineNum"> 658 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 659 </span> : // DR 464. Suggestion for new member functions in standard containers. -<span class="lineNum"> 660 </span> : // data access -<span class="lineNum"> 661 </span> : /** -<span class="lineNum"> 662 </span> : * Returns a pointer such that [data(), data() + size()) is a valid -<span class="lineNum"> 663 </span> : * range. For a non-empty %vector, data() == &front(). -<span class="lineNum"> 664 </span> : */ -<span class="lineNum"> 665 </span> : pointer -<span class="lineNum"> 666 </span> : data() -<span class="lineNum"> 667 </span> : { return pointer(this->_M_impl._M_start); } -<span class="lineNum"> 668 </span> : -<span class="lineNum"> 669 </span> : const_pointer -<span class="lineNum"> 670 </span> : data() const -<span class="lineNum"> 671 </span> : { return const_pointer(this->_M_impl._M_start); } -<span class="lineNum"> 672 </span> : -<span class="lineNum"> 673 </span> : // [23.2.4.3] modifiers -<span class="lineNum"> 674 </span> : /** -<span class="lineNum"> 675 </span> : * @brief Add data to the end of the %vector. -<span class="lineNum"> 676 </span> : * @param x Data to be added. -<span class="lineNum"> 677 </span> : * -<span class="lineNum"> 678 </span> : * This is a typical stack operation. The function creates an -<span class="lineNum"> 679 </span> : * element at the end of the %vector and assigns the given data -<span class="lineNum"> 680 </span> : * to it. Due to the nature of a %vector this operation can be -<span class="lineNum"> 681 </span> : * done in constant time if the %vector has preallocated space -<span class="lineNum"> 682 </span> : * available. -<span class="lineNum"> 683 </span> : */ -<span class="lineNum"> 684 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 685 </span> : void -<span class="lineNum"> 686 </span><span class="lineCov"> 129213 : push_back(const value_type& __x)</span> -<span class="lineNum"> 687 </span> : { -<span class="lineNum"> 688 </span><span class="lineCov"> 129213 : if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</span> -<span class="lineNum"> 689 </span> : { -<span class="lineNum"> 690 </span><span class="lineCov"> 108914 : this->_M_impl.construct(this->_M_impl._M_finish, __x);</span> -<span class="lineNum"> 691 </span><span class="lineCov"> 108914 : ++this->_M_impl._M_finish;</span> -<span class="lineNum"> 692 </span> : } -<span class="lineNum"> 693 </span> : else -<span class="lineNum"> 694 </span><span class="lineCov"> 20299 : _M_insert_aux(end(), __x);</span> -<span class="lineNum"> 695 </span><span class="lineCov"> 129213 : }</span> -<span class="lineNum"> 696 </span> : #else -<span class="lineNum"> 697 </span> : template<typename... _Args> -<span class="lineNum"> 698 </span> : void -<span class="lineNum"> 699 </span> : push_back(_Args&&... __args) -<span class="lineNum"> 700 </span> : { -<span class="lineNum"> 701 </span> : if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) -<span class="lineNum"> 702 </span> : { -<span class="lineNum"> 703 </span> : this->_M_impl.construct(this->_M_impl._M_finish, -<span class="lineNum"> 704 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 705 </span> : ++this->_M_impl._M_finish; -<span class="lineNum"> 706 </span> : } -<span class="lineNum"> 707 </span> : else -<span class="lineNum"> 708 </span> : _M_insert_aux(end(), std::forward<_Args>(__args)...); -<span class="lineNum"> 709 </span> : } -<span class="lineNum"> 710 </span> : #endif -<span class="lineNum"> 711 </span> : -<span class="lineNum"> 712 </span> : /** -<span class="lineNum"> 713 </span> : * @brief Removes last element. -<span class="lineNum"> 714 </span> : * -<span class="lineNum"> 715 </span> : * This is a typical stack operation. It shrinks the %vector by one. -<span class="lineNum"> 716 </span> : * -<span class="lineNum"> 717 </span> : * Note that no data is returned, and if the last element's -<span class="lineNum"> 718 </span> : * data is needed, it should be retrieved before pop_back() is -<span class="lineNum"> 719 </span> : * called. -<span class="lineNum"> 720 </span> : */ -<span class="lineNum"> 721 </span> : void -<span class="lineNum"> 722 </span><span class="lineCov"> 3 : pop_back()</span> -<span class="lineNum"> 723 </span> : { -<span class="lineNum"> 724 </span><span class="lineCov"> 3 : --this->_M_impl._M_finish;</span> -<span class="lineNum"> 725 </span><span class="lineCov"> 3 : this->_M_impl.destroy(this->_M_impl._M_finish);</span> -<span class="lineNum"> 726 </span><span class="lineCov"> 3 : }</span> -<span class="lineNum"> 727 </span> : -<span class="lineNum"> 728 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 729 </span> : /** -<span class="lineNum"> 730 </span> : * @brief Inserts an object in %vector before specified iterator. -<span class="lineNum"> 731 </span> : * @param position An iterator into the %vector. -<span class="lineNum"> 732 </span> : * @param args Arguments. -<span class="lineNum"> 733 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 734 </span> : * -<span class="lineNum"> 735 </span> : * This function will insert an object of type T constructed -<span class="lineNum"> 736 </span> : * with T(std::forward<Args>(args)...) before the specified location. -<span class="lineNum"> 737 </span> : * Note that this kind of operation could be expensive for a %vector -<span class="lineNum"> 738 </span> : * and if it is frequently used the user should consider using -<span class="lineNum"> 739 </span> : * std::list. -<span class="lineNum"> 740 </span> : */ -<span class="lineNum"> 741 </span> : template<typename... _Args> -<span class="lineNum"> 742 </span> : iterator -<span class="lineNum"> 743 </span> : emplace(iterator __position, _Args&&... __args); -<span class="lineNum"> 744 </span> : #endif -<span class="lineNum"> 745 </span> : -<span class="lineNum"> 746 </span> : /** -<span class="lineNum"> 747 </span> : * @brief Inserts given value into %vector before specified iterator. -<span class="lineNum"> 748 </span> : * @param position An iterator into the %vector. -<span class="lineNum"> 749 </span> : * @param x Data to be inserted. -<span class="lineNum"> 750 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 751 </span> : * -<span class="lineNum"> 752 </span> : * This function will insert a copy of the given value before -<span class="lineNum"> 753 </span> : * the specified location. Note that this kind of operation -<span class="lineNum"> 754 </span> : * could be expensive for a %vector and if it is frequently -<span class="lineNum"> 755 </span> : * used the user should consider using std::list. -<span class="lineNum"> 756 </span> : */ -<span class="lineNum"> 757 </span> : iterator -<span class="lineNum"> 758 </span> : insert(iterator __position, const value_type& __x); -<span class="lineNum"> 759 </span> : -<span class="lineNum"> 760 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 761 </span> : /** -<span class="lineNum"> 762 </span> : * @brief Inserts given rvalue into %vector before specified iterator. -<span class="lineNum"> 763 </span> : * @param position An iterator into the %vector. -<span class="lineNum"> 764 </span> : * @param x Data to be inserted. -<span class="lineNum"> 765 </span> : * @return An iterator that points to the inserted data. -<span class="lineNum"> 766 </span> : * -<span class="lineNum"> 767 </span> : * This function will insert a copy of the given rvalue before -<span class="lineNum"> 768 </span> : * the specified location. Note that this kind of operation -<span class="lineNum"> 769 </span> : * could be expensive for a %vector and if it is frequently -<span class="lineNum"> 770 </span> : * used the user should consider using std::list. -<span class="lineNum"> 771 </span> : */ -<span class="lineNum"> 772 </span> : iterator -<span class="lineNum"> 773 </span> : insert(iterator __position, value_type&& __x) -<span class="lineNum"> 774 </span> : { return emplace(__position, std::move(__x)); } -<span class="lineNum"> 775 </span> : #endif -<span class="lineNum"> 776 </span> : -<span class="lineNum"> 777 </span> : /** -<span class="lineNum"> 778 </span> : * @brief Inserts a number of copies of given data into the %vector. -<span class="lineNum"> 779 </span> : * @param position An iterator into the %vector. -<span class="lineNum"> 780 </span> : * @param n Number of elements to be inserted. -<span class="lineNum"> 781 </span> : * @param x Data to be inserted. -<span class="lineNum"> 782 </span> : * -<span class="lineNum"> 783 </span> : * This function will insert a specified number of copies of -<span class="lineNum"> 784 </span> : * the given data before the location specified by @a position. -<span class="lineNum"> 785 </span> : * -<span class="lineNum"> 786 </span> : * Note that this kind of operation could be expensive for a -<span class="lineNum"> 787 </span> : * %vector and if it is frequently used the user should -<span class="lineNum"> 788 </span> : * consider using std::list. -<span class="lineNum"> 789 </span> : */ -<span class="lineNum"> 790 </span> : void -<span class="lineNum"> 791 </span><span class="lineCov"> 22443 : insert(iterator __position, size_type __n, const value_type& __x)</span> -<span class="lineNum"> 792 </span><span class="lineCov"> 22443 : { _M_fill_insert(__position, __n, __x); }</span> -<span class="lineNum"> 793 </span> : -<span class="lineNum"> 794 </span> : /** -<span class="lineNum"> 795 </span> : * @brief Inserts a range into the %vector. -<span class="lineNum"> 796 </span> : * @param position An iterator into the %vector. -<span class="lineNum"> 797 </span> : * @param first An input iterator. -<span class="lineNum"> 798 </span> : * @param last An input iterator. -<span class="lineNum"> 799 </span> : * -<span class="lineNum"> 800 </span> : * This function will insert copies of the data in the range -<span class="lineNum"> 801 </span> : * [first,last) into the %vector before the location specified -<span class="lineNum"> 802 </span> : * by @a pos. -<span class="lineNum"> 803 </span> : * -<span class="lineNum"> 804 </span> : * Note that this kind of operation could be expensive for a -<span class="lineNum"> 805 </span> : * %vector and if it is frequently used the user should -<span class="lineNum"> 806 </span> : * consider using std::list. -<span class="lineNum"> 807 </span> : */ -<span class="lineNum"> 808 </span> : template<typename _InputIterator> -<span class="lineNum"> 809 </span> : void -<span class="lineNum"> 810 </span> : insert(iterator __position, _InputIterator __first, -<span class="lineNum"> 811 </span> : _InputIterator __last) -<span class="lineNum"> 812 </span> : { -<span class="lineNum"> 813 </span> : // Check whether it's an integral type. If so, it's not an iterator. -<span class="lineNum"> 814 </span> : typedef typename std::__is_integer<_InputIterator>::__type _Integral; -<span class="lineNum"> 815 </span> : _M_insert_dispatch(__position, __first, __last, _Integral()); -<span class="lineNum"> 816 </span> : } -<span class="lineNum"> 817 </span> : -<span class="lineNum"> 818 </span> : /** -<span class="lineNum"> 819 </span> : * @brief Remove element at given position. -<span class="lineNum"> 820 </span> : * @param position Iterator pointing to element to be erased. -<span class="lineNum"> 821 </span> : * @return An iterator pointing to the next element (or end()). -<span class="lineNum"> 822 </span> : * -<span class="lineNum"> 823 </span> : * This function will erase the element at the given position and thus -<span class="lineNum"> 824 </span> : * shorten the %vector by one. -<span class="lineNum"> 825 </span> : * -<span class="lineNum"> 826 </span> : * Note This operation could be expensive and if it is -<span class="lineNum"> 827 </span> : * frequently used the user should consider using std::list. -<span class="lineNum"> 828 </span> : * The user is also cautioned that this function only erases -<span class="lineNum"> 829 </span> : * the element, and that if the element is itself a pointer, -<span class="lineNum"> 830 </span> : * the pointed-to memory is not touched in any way. Managing -<span class="lineNum"> 831 </span> : * the pointer is the user's responsibility. -<span class="lineNum"> 832 </span> : */ -<span class="lineNum"> 833 </span> : iterator -<span class="lineNum"> 834 </span> : erase(iterator __position); -<span class="lineNum"> 835 </span> : -<span class="lineNum"> 836 </span> : /** -<span class="lineNum"> 837 </span> : * @brief Remove a range of elements. -<span class="lineNum"> 838 </span> : * @param first Iterator pointing to the first element to be erased. -<span class="lineNum"> 839 </span> : * @param last Iterator pointing to one past the last element to be -<span class="lineNum"> 840 </span> : * erased. -<span class="lineNum"> 841 </span> : * @return An iterator pointing to the element pointed to by @a last -<span class="lineNum"> 842 </span> : * prior to erasing (or end()). -<span class="lineNum"> 843 </span> : * -<span class="lineNum"> 844 </span> : * This function will erase the elements in the range [first,last) and -<span class="lineNum"> 845 </span> : * shorten the %vector accordingly. -<span class="lineNum"> 846 </span> : * -<span class="lineNum"> 847 </span> : * Note This operation could be expensive and if it is -<span class="lineNum"> 848 </span> : * frequently used the user should consider using std::list. -<span class="lineNum"> 849 </span> : * The user is also cautioned that this function only erases -<span class="lineNum"> 850 </span> : * the elements, and that if the elements themselves are -<span class="lineNum"> 851 </span> : * pointers, the pointed-to memory is not touched in any way. -<span class="lineNum"> 852 </span> : * Managing the pointer is the user's responsibility. -<span class="lineNum"> 853 </span> : */ -<span class="lineNum"> 854 </span> : iterator -<span class="lineNum"> 855 </span> : erase(iterator __first, iterator __last); -<span class="lineNum"> 856 </span> : -<span class="lineNum"> 857 </span> : /** -<span class="lineNum"> 858 </span> : * @brief Swaps data with another %vector. -<span class="lineNum"> 859 </span> : * @param x A %vector of the same element and allocator types. -<span class="lineNum"> 860 </span> : * -<span class="lineNum"> 861 </span> : * This exchanges the elements between two vectors in constant time. -<span class="lineNum"> 862 </span> : * (Three pointers, so it should be quite fast.) -<span class="lineNum"> 863 </span> : * Note that the global std::swap() function is specialized such that -<span class="lineNum"> 864 </span> : * std::swap(v1,v2) will feed to this function. -<span class="lineNum"> 865 </span> : */ -<span class="lineNum"> 866 </span> : void -<span class="lineNum"> 867 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 868 </span> : swap(vector&& __x) -<span class="lineNum"> 869 </span> : #else -<span class="lineNum"> 870 </span> : swap(vector& __x) -<span class="lineNum"> 871 </span> : #endif -<span class="lineNum"> 872 </span> : { -<span class="lineNum"> 873 </span> : std::swap(this->_M_impl._M_start, __x._M_impl._M_start); -<span class="lineNum"> 874 </span> : std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish); -<span class="lineNum"> 875 </span> : std::swap(this->_M_impl._M_end_of_storage, -<span class="lineNum"> 876 </span> : __x._M_impl._M_end_of_storage); -<span class="lineNum"> 877 </span> : -<span class="lineNum"> 878 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 879 </span> : // 431. Swapping containers with unequal allocators. -<span class="lineNum"> 880 </span> : std::__alloc_swap<_Tp_alloc_type>::_S_do_it(_M_get_Tp_allocator(), -<span class="lineNum"> 881 </span> : __x._M_get_Tp_allocator()); -<span class="lineNum"> 882 </span> : } -<span class="lineNum"> 883 </span> : -<span class="lineNum"> 884 </span> : /** -<span class="lineNum"> 885 </span> : * Erases all the elements. Note that this function only erases the -<span class="lineNum"> 886 </span> : * elements, and that if the elements themselves are pointers, the -<span class="lineNum"> 887 </span> : * pointed-to memory is not touched in any way. Managing the pointer is -<span class="lineNum"> 888 </span> : * the user's responsibility. -<span class="lineNum"> 889 </span> : */ -<span class="lineNum"> 890 </span> : void -<span class="lineNum"> 891 </span><span class="lineCov"> 7856 : clear()</span> -<span class="lineNum"> 892 </span><span class="lineCov"> 7856 : { _M_erase_at_end(this->_M_impl._M_start); }</span> -<span class="lineNum"> 893 </span> : -<span class="lineNum"> 894 </span> : protected: -<span class="lineNum"> 895 </span> : /** -<span class="lineNum"> 896 </span> : * Memory expansion handler. Uses the member allocation function to -<span class="lineNum"> 897 </span> : * obtain @a n bytes of memory, and then copies [first,last) into it. -<span class="lineNum"> 898 </span> : */ -<span class="lineNum"> 899 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 900 </span> : pointer -<span class="lineNum"> 901 </span> : _M_allocate_and_copy(size_type __n, -<span class="lineNum"> 902 </span><span class="lineCov"> 10 : _ForwardIterator __first, _ForwardIterator __last)</span> -<span class="lineNum"> 903 </span> : { -<span class="lineNum"> 904 </span><span class="lineCov"> 10 : pointer __result = this->_M_allocate(__n);</span> -<span class="lineNum"> 905 </span> : try -<span class="lineNum"> 906 </span> : { -<span class="lineNum"> 907 </span><span class="lineCov"> 10 : std::__uninitialized_copy_a(__first, __last, __result,</span> -<span class="lineNum"> 908 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 909 </span><span class="lineCov"> 10 : return __result;</span> -<span class="lineNum"> 910 </span> : } -<span class="lineNum"> 911 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 912 </span> : { -<span class="lineNum"> 913 </span><span class="lineNoCov"> 0 : _M_deallocate(__result, __n);</span> -<span class="lineNum"> 914 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 915 </span> : } -<span class="lineNum"> 916 </span> : } -<span class="lineNum"> 917 </span> : -<span class="lineNum"> 918 </span> : -<span class="lineNum"> 919 </span> : // Internal constructor functions follow. -<span class="lineNum"> 920 </span> : -<span class="lineNum"> 921 </span> : // Called by the range constructor to implement [23.1.1]/9 -<span class="lineNum"> 922 </span> : -<span class="lineNum"> 923 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 924 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 925 </span> : template<typename _Integer> -<span class="lineNum"> 926 </span> : void -<span class="lineNum"> 927 </span> : _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type) -<span class="lineNum"> 928 </span> : { -<span class="lineNum"> 929 </span> : this->_M_impl._M_start = _M_allocate(static_cast<size_type>(__n)); -<span class="lineNum"> 930 </span> : this->_M_impl._M_end_of_storage = -<span class="lineNum"> 931 </span> : this->_M_impl._M_start + static_cast<size_type>(__n); -<span class="lineNum"> 932 </span> : _M_fill_initialize(static_cast<size_type>(__n), __value); -<span class="lineNum"> 933 </span> : } -<span class="lineNum"> 934 </span> : -<span class="lineNum"> 935 </span> : // Called by the range constructor to implement [23.1.1]/9 -<span class="lineNum"> 936 </span> : template<typename _InputIterator> -<span class="lineNum"> 937 </span> : void -<span class="lineNum"> 938 </span> : _M_initialize_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 939 </span> : __false_type) -<span class="lineNum"> 940 </span> : { -<span class="lineNum"> 941 </span> : typedef typename std::iterator_traits<_InputIterator>:: -<span class="lineNum"> 942 </span> : iterator_category _IterCategory; -<span class="lineNum"> 943 </span> : _M_range_initialize(__first, __last, _IterCategory()); -<span class="lineNum"> 944 </span> : } -<span class="lineNum"> 945 </span> : -<span class="lineNum"> 946 </span> : // Called by the second initialize_dispatch above -<span class="lineNum"> 947 </span> : template<typename _InputIterator> -<span class="lineNum"> 948 </span> : void -<span class="lineNum"> 949 </span> : _M_range_initialize(_InputIterator __first, -<span class="lineNum"> 950 </span> : _InputIterator __last, std::input_iterator_tag) -<span class="lineNum"> 951 </span> : { -<span class="lineNum"> 952 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 953 </span> : push_back(*__first); -<span class="lineNum"> 954 </span> : } -<span class="lineNum"> 955 </span> : -<span class="lineNum"> 956 </span> : // Called by the second initialize_dispatch above -<span class="lineNum"> 957 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 958 </span> : void -<span class="lineNum"> 959 </span> : _M_range_initialize(_ForwardIterator __first, -<span class="lineNum"> 960 </span> : _ForwardIterator __last, std::forward_iterator_tag) -<span class="lineNum"> 961 </span> : { -<span class="lineNum"> 962 </span> : const size_type __n = std::distance(__first, __last); -<span class="lineNum"> 963 </span> : this->_M_impl._M_start = this->_M_allocate(__n); -<span class="lineNum"> 964 </span> : this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; -<span class="lineNum"> 965 </span> : this->_M_impl._M_finish = -<span class="lineNum"> 966 </span> : std::__uninitialized_copy_a(__first, __last, -<span class="lineNum"> 967 </span> : this->_M_impl._M_start, -<span class="lineNum"> 968 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 969 </span> : } -<span class="lineNum"> 970 </span> : -<span class="lineNum"> 971 </span> : // Called by the first initialize_dispatch above and by the -<span class="lineNum"> 972 </span> : // vector(n,value,a) constructor. -<span class="lineNum"> 973 </span> : void -<span class="lineNum"> 974 </span><span class="lineCov"> 9 : _M_fill_initialize(size_type __n, const value_type& __value)</span> -<span class="lineNum"> 975 </span> : { -<span class="lineNum"> 976 </span><span class="lineCov"> 9 : std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value, </span> -<span class="lineNum"> 977 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 978 </span><span class="lineCov"> 9 : this->_M_impl._M_finish = this->_M_impl._M_end_of_storage;</span> -<span class="lineNum"> 979 </span><span class="lineCov"> 9 : }</span> -<span class="lineNum"> 980 </span> : -<span class="lineNum"> 981 </span> : -<span class="lineNum"> 982 </span> : // Internal assign functions follow. The *_aux functions do the actual -<span class="lineNum"> 983 </span> : // assignment work for the range versions. -<span class="lineNum"> 984 </span> : -<span class="lineNum"> 985 </span> : // Called by the range assign to implement [23.1.1]/9 -<span class="lineNum"> 986 </span> : -<span class="lineNum"> 987 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 988 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 989 </span> : template<typename _Integer> -<span class="lineNum"> 990 </span> : void -<span class="lineNum"> 991 </span> : _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) -<span class="lineNum"> 992 </span> : { _M_fill_assign(__n, __val); } -<span class="lineNum"> 993 </span> : -<span class="lineNum"> 994 </span> : // Called by the range assign to implement [23.1.1]/9 -<span class="lineNum"> 995 </span> : template<typename _InputIterator> -<span class="lineNum"> 996 </span> : void -<span class="lineNum"> 997 </span> : _M_assign_dispatch(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 998 </span> : __false_type) -<span class="lineNum"> 999 </span> : { -<span class="lineNum"> 1000 </span> : typedef typename std::iterator_traits<_InputIterator>:: -<span class="lineNum"> 1001 </span> : iterator_category _IterCategory; -<span class="lineNum"> 1002 </span> : _M_assign_aux(__first, __last, _IterCategory()); -<span class="lineNum"> 1003 </span> : } -<span class="lineNum"> 1004 </span> : -<span class="lineNum"> 1005 </span> : // Called by the second assign_dispatch above -<span class="lineNum"> 1006 </span> : template<typename _InputIterator> -<span class="lineNum"> 1007 </span> : void -<span class="lineNum"> 1008 </span> : _M_assign_aux(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1009 </span> : std::input_iterator_tag); -<span class="lineNum"> 1010 </span> : -<span class="lineNum"> 1011 </span> : // Called by the second assign_dispatch above -<span class="lineNum"> 1012 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1013 </span> : void -<span class="lineNum"> 1014 </span> : _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1015 </span> : std::forward_iterator_tag); -<span class="lineNum"> 1016 </span> : -<span class="lineNum"> 1017 </span> : // Called by assign(n,t), and the range assign when it turns out -<span class="lineNum"> 1018 </span> : // to be the same thing. -<span class="lineNum"> 1019 </span> : void -<span class="lineNum"> 1020 </span> : _M_fill_assign(size_type __n, const value_type& __val); -<span class="lineNum"> 1021 </span> : -<span class="lineNum"> 1022 </span> : -<span class="lineNum"> 1023 </span> : // Internal insert functions follow. -<span class="lineNum"> 1024 </span> : -<span class="lineNum"> 1025 </span> : // Called by the range insert to implement [23.1.1]/9 -<span class="lineNum"> 1026 </span> : -<span class="lineNum"> 1027 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 1028 </span> : // 438. Ambiguity in the "do the right thing" clause -<span class="lineNum"> 1029 </span> : template<typename _Integer> -<span class="lineNum"> 1030 </span> : void -<span class="lineNum"> 1031 </span> : _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, -<span class="lineNum"> 1032 </span> : __true_type) -<span class="lineNum"> 1033 </span> : { _M_fill_insert(__pos, __n, __val); } -<span class="lineNum"> 1034 </span> : -<span class="lineNum"> 1035 </span> : // Called by the range insert to implement [23.1.1]/9 -<span class="lineNum"> 1036 </span> : template<typename _InputIterator> -<span class="lineNum"> 1037 </span> : void -<span class="lineNum"> 1038 </span> : _M_insert_dispatch(iterator __pos, _InputIterator __first, -<span class="lineNum"> 1039 </span> : _InputIterator __last, __false_type) -<span class="lineNum"> 1040 </span> : { -<span class="lineNum"> 1041 </span> : typedef typename std::iterator_traits<_InputIterator>:: -<span class="lineNum"> 1042 </span> : iterator_category _IterCategory; -<span class="lineNum"> 1043 </span> : _M_range_insert(__pos, __first, __last, _IterCategory()); -<span class="lineNum"> 1044 </span> : } -<span class="lineNum"> 1045 </span> : -<span class="lineNum"> 1046 </span> : // Called by the second insert_dispatch above -<span class="lineNum"> 1047 </span> : template<typename _InputIterator> -<span class="lineNum"> 1048 </span> : void -<span class="lineNum"> 1049 </span> : _M_range_insert(iterator __pos, _InputIterator __first, -<span class="lineNum"> 1050 </span> : _InputIterator __last, std::input_iterator_tag); -<span class="lineNum"> 1051 </span> : -<span class="lineNum"> 1052 </span> : // Called by the second insert_dispatch above -<span class="lineNum"> 1053 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1054 </span> : void -<span class="lineNum"> 1055 </span> : _M_range_insert(iterator __pos, _ForwardIterator __first, -<span class="lineNum"> 1056 </span> : _ForwardIterator __last, std::forward_iterator_tag); -<span class="lineNum"> 1057 </span> : -<span class="lineNum"> 1058 </span> : // Called by insert(p,n,x), and the range insert when it turns out to be -<span class="lineNum"> 1059 </span> : // the same thing. -<span class="lineNum"> 1060 </span> : void -<span class="lineNum"> 1061 </span> : _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); -<span class="lineNum"> 1062 </span> : -<span class="lineNum"> 1063 </span> : // Called by insert(p,x) -<span class="lineNum"> 1064 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1065 </span> : void -<span class="lineNum"> 1066 </span> : _M_insert_aux(iterator __position, const value_type& __x); -<span class="lineNum"> 1067 </span> : #else -<span class="lineNum"> 1068 </span> : template<typename... _Args> -<span class="lineNum"> 1069 </span> : void -<span class="lineNum"> 1070 </span> : _M_insert_aux(iterator __position, _Args&&... __args); -<span class="lineNum"> 1071 </span> : #endif -<span class="lineNum"> 1072 </span> : -<span class="lineNum"> 1073 </span> : // Called by the latter. -<span class="lineNum"> 1074 </span> : size_type -<span class="lineNum"> 1075 </span><span class="lineCov"> 20708 : _M_check_len(size_type __n, const char* __s) const</span> -<span class="lineNum"> 1076 </span> : { -<span class="lineNum"> 1077 </span><span class="lineCov"> 20708 : if (max_size() - size() < __n)</span> -<span class="lineNum"> 1078 </span><span class="lineNoCov"> 0 : __throw_length_error(__N(__s));</span> -<span class="lineNum"> 1079 </span> : -<span class="lineNum"> 1080 </span><span class="lineCov"> 20708 : const size_type __len = size() + std::max(size(), __n);</span> -<span class="lineNum"> 1081 </span><span class="lineCov"> 20708 : return (__len < size() || __len > max_size()) ? max_size() : __len;</span> -<span class="lineNum"> 1082 </span> : } -<span class="lineNum"> 1083 </span> : -<span class="lineNum"> 1084 </span> : // Internal erase functions follow. -<span class="lineNum"> 1085 </span> : -<span class="lineNum"> 1086 </span> : // Called by erase(q1,q2), clear(), resize(), _M_fill_assign, -<span class="lineNum"> 1087 </span> : // _M_assign_aux. -<span class="lineNum"> 1088 </span> : void -<span class="lineNum"> 1089 </span><span class="lineCov"> 7856 : _M_erase_at_end(pointer __pos)</span> -<span class="lineNum"> 1090 </span> : { -<span class="lineNum"> 1091 </span><span class="lineCov"> 7856 : std::_Destroy(__pos, this->_M_impl._M_finish, _M_get_Tp_allocator());</span> -<span class="lineNum"> 1092 </span><span class="lineCov"> 7856 : this->_M_impl._M_finish = __pos;</span> -<span class="lineNum"> 1093 </span><span class="lineCov"> 7856 : }</span> -<span class="lineNum"> 1094 </span> : }; -<span class="lineNum"> 1095 </span> : -<span class="lineNum"> 1096 </span> : -<span class="lineNum"> 1097 </span> : /** -<span class="lineNum"> 1098 </span> : * @brief Vector equality comparison. -<span class="lineNum"> 1099 </span> : * @param x A %vector. -<span class="lineNum"> 1100 </span> : * @param y A %vector of the same type as @a x. -<span class="lineNum"> 1101 </span> : * @return True iff the size and elements of the vectors are equal. -<span class="lineNum"> 1102 </span> : * -<span class="lineNum"> 1103 </span> : * This is an equivalence relation. It is linear in the size of the -<span class="lineNum"> 1104 </span> : * vectors. Vectors are considered equivalent if their sizes are equal, -<span class="lineNum"> 1105 </span> : * and if corresponding elements compare equal. -<span class="lineNum"> 1106 </span> : */ -<span class="lineNum"> 1107 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1108 </span> : inline bool -<span class="lineNum"> 1109 </span> : operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1110 </span> : { return (__x.size() == __y.size() -<span class="lineNum"> 1111 </span> : && std::equal(__x.begin(), __x.end(), __y.begin())); } -<span class="lineNum"> 1112 </span> : -<span class="lineNum"> 1113 </span> : /** -<span class="lineNum"> 1114 </span> : * @brief Vector ordering relation. -<span class="lineNum"> 1115 </span> : * @param x A %vector. -<span class="lineNum"> 1116 </span> : * @param y A %vector of the same type as @a x. -<span class="lineNum"> 1117 </span> : * @return True iff @a x is lexicographically less than @a y. -<span class="lineNum"> 1118 </span> : * -<span class="lineNum"> 1119 </span> : * This is a total ordering relation. It is linear in the size of the -<span class="lineNum"> 1120 </span> : * vectors. The elements must be comparable with @c <. -<span class="lineNum"> 1121 </span> : * -<span class="lineNum"> 1122 </span> : * See std::lexicographical_compare() for how the determination is made. -<span class="lineNum"> 1123 </span> : */ -<span class="lineNum"> 1124 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1125 </span> : inline bool -<span class="lineNum"> 1126 </span> : operator<(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1127 </span> : { return std::lexicographical_compare(__x.begin(), __x.end(), -<span class="lineNum"> 1128 </span> : __y.begin(), __y.end()); } -<span class="lineNum"> 1129 </span> : -<span class="lineNum"> 1130 </span> : /// Based on operator== -<span class="lineNum"> 1131 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1132 </span> : inline bool -<span class="lineNum"> 1133 </span> : operator!=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1134 </span> : { return !(__x == __y); } -<span class="lineNum"> 1135 </span> : -<span class="lineNum"> 1136 </span> : /// Based on operator< -<span class="lineNum"> 1137 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1138 </span> : inline bool -<span class="lineNum"> 1139 </span> : operator>(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1140 </span> : { return __y < __x; } -<span class="lineNum"> 1141 </span> : -<span class="lineNum"> 1142 </span> : /// Based on operator< -<span class="lineNum"> 1143 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1144 </span> : inline bool -<span class="lineNum"> 1145 </span> : operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1146 </span> : { return !(__y < __x); } -<span class="lineNum"> 1147 </span> : -<span class="lineNum"> 1148 </span> : /// Based on operator< -<span class="lineNum"> 1149 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1150 </span> : inline bool -<span class="lineNum"> 1151 </span> : operator>=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1152 </span> : { return !(__x < __y); } -<span class="lineNum"> 1153 </span> : -<span class="lineNum"> 1154 </span> : /// See std::vector::swap(). -<span class="lineNum"> 1155 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1156 </span> : inline void -<span class="lineNum"> 1157 </span> : swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1158 </span> : { __x.swap(__y); } -<span class="lineNum"> 1159 </span> : -<span class="lineNum"> 1160 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 1161 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1162 </span> : inline void -<span class="lineNum"> 1163 </span> : swap(vector<_Tp, _Alloc>&& __x, vector<_Tp, _Alloc>& __y) -<span class="lineNum"> 1164 </span> : { __x.swap(__y); } -<span class="lineNum"> 1165 </span> : -<span class="lineNum"> 1166 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 1167 </span> : inline void -<span class="lineNum"> 1168 </span> : swap(vector<_Tp, _Alloc>& __x, vector<_Tp, _Alloc>&& __y) -<span class="lineNum"> 1169 </span> : { __x.swap(__y); } -<span class="lineNum"> 1170 </span> : #endif -<span class="lineNum"> 1171 </span> : -<span class="lineNum"> 1172 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 1173 </span> : -<span class="lineNum"> 1174 </span> : #endif /* _STL_VECTOR_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/stream_iterator.h.gcov.html b/rep/usr/include/c++/4.3/bits/stream_iterator.h.gcov.html deleted file mode 100644 index e74322d..0000000 --- a/rep/usr/include/c++/4.3/bits/stream_iterator.h.gcov.html +++ /dev/null @@ -1,283 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stream_iterator.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stream_iterator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">33</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">33</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Stream iterators -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2004, 2005 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 7 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 8 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 9 </span> : // any later version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : // GNU General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 17 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 18 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 19 </span> : // USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 22 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 23 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 24 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 25 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 26 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 27 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** @file stream_iterator.h -<span class="lineNum"> 31 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 32 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : #ifndef _STREAM_ITERATOR_H -<span class="lineNum"> 36 </span> : #define _STREAM_ITERATOR_H 1 -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #pragma GCC system_header -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #include <debug/debug.h> -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : /// Provides input iterator semantics for streams. -<span class="lineNum"> 45 </span> : template<typename _Tp, typename _CharT = char, -<span class="lineNum"> 46 </span> : typename _Traits = char_traits<_CharT>, typename _Dist = ptrdiff_t> -<span class="lineNum"> 47 </span> : class istream_iterator -<span class="lineNum"> 48 </span> : : public iterator<input_iterator_tag, _Tp, _Dist, const _Tp*, const _Tp&> -<span class="lineNum"> 49 </span><span class="lineCov"> 32 : {</span> -<span class="lineNum"> 50 </span> : public: -<span class="lineNum"> 51 </span> : typedef _CharT char_type; -<span class="lineNum"> 52 </span> : typedef _Traits traits_type; -<span class="lineNum"> 53 </span> : typedef basic_istream<_CharT, _Traits> istream_type; -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : private: -<span class="lineNum"> 56 </span> : istream_type* _M_stream; -<span class="lineNum"> 57 </span> : _Tp _M_value; -<span class="lineNum"> 58 </span> : bool _M_ok; -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : public: -<span class="lineNum"> 61 </span> : /// Construct end of input stream iterator. -<span class="lineNum"> 62 </span><span class="lineCov"> 16 : istream_iterator()</span> -<span class="lineNum"> 63 </span><span class="lineCov"> 16 : : _M_stream(0), _M_value(), _M_ok(false) {}</span> -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : /// Construct start of input stream iterator. -<span class="lineNum"> 66 </span><span class="lineCov"> 16 : istream_iterator(istream_type& __s)</span> -<span class="lineNum"> 67 </span><span class="lineCov"> 16 : : _M_stream(&__s)</span> -<span class="lineNum"> 68 </span><span class="lineCov"> 16 : { _M_read(); }</span> -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : istream_iterator(const istream_iterator& __obj) -<span class="lineNum"> 71 </span> : : _M_stream(__obj._M_stream), _M_value(__obj._M_value), -<span class="lineNum"> 72 </span> : _M_ok(__obj._M_ok) -<span class="lineNum"> 73 </span> : { } -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : const _Tp& -<span class="lineNum"> 76 </span><span class="lineCov"> 112 : operator*() const</span> -<span class="lineNum"> 77 </span> : { -<span class="lineNum"> 78 </span> : __glibcxx_requires_cond(_M_ok, -<span class="lineNum"> 79 </span> : _M_message(__gnu_debug::__msg_deref_istream) -<span class="lineNum"> 80 </span> : ._M_iterator(*this)); -<span class="lineNum"> 81 </span><span class="lineCov"> 112 : return _M_value;</span> -<span class="lineNum"> 82 </span> : } -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : const _Tp* -<span class="lineNum"> 85 </span> : operator->() const { return &(operator*()); } -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : istream_iterator& -<span class="lineNum"> 88 </span><span class="lineCov"> 64 : operator++()</span> -<span class="lineNum"> 89 </span> : { -<span class="lineNum"> 90 </span> : __glibcxx_requires_cond(_M_ok, -<span class="lineNum"> 91 </span> : _M_message(__gnu_debug::__msg_inc_istream) -<span class="lineNum"> 92 </span> : ._M_iterator(*this)); -<span class="lineNum"> 93 </span><span class="lineCov"> 64 : _M_read();</span> -<span class="lineNum"> 94 </span><span class="lineCov"> 64 : return *this;</span> -<span class="lineNum"> 95 </span> : } -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : istream_iterator -<span class="lineNum"> 98 </span> : operator++(int) -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span> : __glibcxx_requires_cond(_M_ok, -<span class="lineNum"> 101 </span> : _M_message(__gnu_debug::__msg_inc_istream) -<span class="lineNum"> 102 </span> : ._M_iterator(*this)); -<span class="lineNum"> 103 </span> : istream_iterator __tmp = *this; -<span class="lineNum"> 104 </span> : _M_read(); -<span class="lineNum"> 105 </span> : return __tmp; -<span class="lineNum"> 106 </span> : } -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : bool -<span class="lineNum"> 109 </span><span class="lineCov"> 80 : _M_equal(const istream_iterator& __x) const</span> -<span class="lineNum"> 110 </span><span class="lineCov"> 80 : { return (_M_ok == __x._M_ok) && (!_M_ok || _M_stream == __x._M_stream); }</span> -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : private: -<span class="lineNum"> 113 </span> : void -<span class="lineNum"> 114 </span><span class="lineCov"> 80 : _M_read()</span> -<span class="lineNum"> 115 </span> : { -<span class="lineNum"> 116 </span><span class="lineCov"> 80 : _M_ok = (_M_stream && *_M_stream) ? true : false;</span> -<span class="lineNum"> 117 </span><span class="lineCov"> 80 : if (_M_ok)</span> -<span class="lineNum"> 118 </span> : { -<span class="lineNum"> 119 </span><span class="lineCov"> 80 : *_M_stream >> _M_value;</span> -<span class="lineNum"> 120 </span><span class="lineCov"> 80 : _M_ok = *_M_stream ? true : false;</span> -<span class="lineNum"> 121 </span> : } -<span class="lineNum"> 122 </span><span class="lineCov"> 80 : }</span> -<span class="lineNum"> 123 </span> : }; -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : /// Return true if x and y are both end or not end, or x and y are the same. -<span class="lineNum"> 126 </span> : template<typename _Tp, typename _CharT, typename _Traits, typename _Dist> -<span class="lineNum"> 127 </span> : inline bool -<span class="lineNum"> 128 </span> : operator==(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, -<span class="lineNum"> 129 </span> : const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y) -<span class="lineNum"> 130 </span> : { return __x._M_equal(__y); } -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : /// Return false if x and y are both end or not end, or x and y are the same. -<span class="lineNum"> 133 </span> : template <class _Tp, class _CharT, class _Traits, class _Dist> -<span class="lineNum"> 134 </span> : inline bool -<span class="lineNum"> 135 </span> : operator!=(const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __x, -<span class="lineNum"> 136 </span><span class="lineCov"> 80 : const istream_iterator<_Tp, _CharT, _Traits, _Dist>& __y)</span> -<span class="lineNum"> 137 </span><span class="lineCov"> 80 : { return !__x._M_equal(__y); }</span> -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : /** -<span class="lineNum"> 140 </span> : * @brief Provides output iterator semantics for streams. -<span class="lineNum"> 141 </span> : * -<span class="lineNum"> 142 </span> : * This class provides an iterator to write to an ostream. The type Tp is -<span class="lineNum"> 143 </span> : * the only type written by this iterator and there must be an -<span class="lineNum"> 144 </span> : * operator<<(Tp) defined. -<span class="lineNum"> 145 </span> : * -<span class="lineNum"> 146 </span> : * @param Tp The type to write to the ostream. -<span class="lineNum"> 147 </span> : * @param CharT The ostream char_type. -<span class="lineNum"> 148 </span> : * @param Traits The ostream char_traits. -<span class="lineNum"> 149 </span> : */ -<span class="lineNum"> 150 </span> : template<typename _Tp, typename _CharT = char, -<span class="lineNum"> 151 </span> : typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 152 </span> : class ostream_iterator -<span class="lineNum"> 153 </span> : : public iterator<output_iterator_tag, void, void, void, void> -<span class="lineNum"> 154 </span> : { -<span class="lineNum"> 155 </span> : public: -<span class="lineNum"> 156 </span> : //@{ -<span class="lineNum"> 157 </span> : /// Public typedef -<span class="lineNum"> 158 </span> : typedef _CharT char_type; -<span class="lineNum"> 159 </span> : typedef _Traits traits_type; -<span class="lineNum"> 160 </span> : typedef basic_ostream<_CharT, _Traits> ostream_type; -<span class="lineNum"> 161 </span> : //@} -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : private: -<span class="lineNum"> 164 </span> : ostream_type* _M_stream; -<span class="lineNum"> 165 </span> : const _CharT* _M_string; -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : public: -<span class="lineNum"> 168 </span> : /// Construct from an ostream. -<span class="lineNum"> 169 </span> : ostream_iterator(ostream_type& __s) : _M_stream(&__s), _M_string(0) {} -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : /** -<span class="lineNum"> 172 </span> : * Construct from an ostream. -<span class="lineNum"> 173 </span> : * -<span class="lineNum"> 174 </span> : * The delimiter string @a c is written to the stream after every Tp -<span class="lineNum"> 175 </span> : * written to the stream. The delimiter is not copied, and thus must -<span class="lineNum"> 176 </span> : * not be destroyed while this iterator is in use. -<span class="lineNum"> 177 </span> : * -<span class="lineNum"> 178 </span> : * @param s Underlying ostream to write to. -<span class="lineNum"> 179 </span> : * @param c CharT delimiter string to insert. -<span class="lineNum"> 180 </span> : */ -<span class="lineNum"> 181 </span><span class="lineCov"> 5 : ostream_iterator(ostream_type& __s, const _CharT* __c)</span> -<span class="lineNum"> 182 </span><span class="lineCov"> 5 : : _M_stream(&__s), _M_string(__c) { }</span> -<span class="lineNum"> 183 </span> : -<span class="lineNum"> 184 </span> : /// Copy constructor. -<span class="lineNum"> 185 </span><span class="lineCov"> 25 : ostream_iterator(const ostream_iterator& __obj)</span> -<span class="lineNum"> 186 </span><span class="lineCov"> 25 : : _M_stream(__obj._M_stream), _M_string(__obj._M_string) { }</span> -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /// Writes @a value to underlying ostream using operator<<. If -<span class="lineNum"> 189 </span> : /// constructed with delimiter string, writes delimiter to ostream. -<span class="lineNum"> 190 </span> : ostream_iterator& -<span class="lineNum"> 191 </span><span class="lineCov"> 8 : operator=(const _Tp& __value)</span> -<span class="lineNum"> 192 </span> : { -<span class="lineNum"> 193 </span> : __glibcxx_requires_cond(_M_stream != 0, -<span class="lineNum"> 194 </span> : _M_message(__gnu_debug::__msg_output_ostream) -<span class="lineNum"> 195 </span> : ._M_iterator(*this)); -<span class="lineNum"> 196 </span><span class="lineCov"> 8 : *_M_stream << __value;</span> -<span class="lineNum"> 197 </span><span class="lineCov"> 8 : if (_M_string) *_M_stream << _M_string;</span> -<span class="lineNum"> 198 </span><span class="lineCov"> 8 : return *this;</span> -<span class="lineNum"> 199 </span> : } -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : ostream_iterator& -<span class="lineNum"> 202 </span><span class="lineCov"> 8 : operator*()</span> -<span class="lineNum"> 203 </span><span class="lineCov"> 8 : { return *this; }</span> -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span> : ostream_iterator& -<span class="lineNum"> 206 </span><span class="lineCov"> 8 : operator++()</span> -<span class="lineNum"> 207 </span><span class="lineCov"> 8 : { return *this; }</span> -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : ostream_iterator& -<span class="lineNum"> 210 </span> : operator++(int) -<span class="lineNum"> 211 </span> : { return *this; } -<span class="lineNum"> 212 </span> : }; -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/bits/vector.tcc.gcov.html b/rep/usr/include/c++/4.3/bits/vector.tcc.gcov.html deleted file mode 100644 index e0268a8..0000000 --- a/rep/usr/include/c++/4.3/bits/vector.tcc.gcov.html +++ /dev/null @@ -1,723 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/vector.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - vector.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">96</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">75.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">72</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Vector implementation (out of line) -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file vector.tcc -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _VECTOR_TCC -<span class="lineNum"> 63 </span> : #define _VECTOR_TCC 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D) -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 68 </span> : void -<span class="lineNum"> 69 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 70 </span><span class="lineCov"> 10 : reserve(size_type __n)</span> -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span><span class="lineCov"> 10 : if (__n > this->max_size())</span> -<span class="lineNum"> 73 </span><span class="lineNoCov"> 0 : __throw_length_error(__N("vector::reserve"));</span> -<span class="lineNum"> 74 </span><span class="lineCov"> 10 : if (this->capacity() < __n)</span> -<span class="lineNum"> 75 </span> : { -<span class="lineNum"> 76 </span><span class="lineCov"> 10 : const size_type __old_size = size();</span> -<span class="lineNum"> 77 </span> : pointer __tmp = _M_allocate_and_copy(__n, -<span class="lineNum"> 78 </span> : _GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_start), -<span class="lineNum"> 79 </span><span class="lineCov"> 10 : _GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_finish));</span> -<span class="lineNum"> 80 </span><span class="lineCov"> 10 : std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,</span> -<span class="lineNum"> 81 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 82 </span><span class="lineCov"> 10 : _M_deallocate(this->_M_impl._M_start,</span> -<span class="lineNum"> 83 </span> : this->_M_impl._M_end_of_storage -<span class="lineNum"> 84 </span> : - this->_M_impl._M_start); -<span class="lineNum"> 85 </span><span class="lineCov"> 10 : this->_M_impl._M_start = __tmp;</span> -<span class="lineNum"> 86 </span><span class="lineCov"> 10 : this->_M_impl._M_finish = __tmp + __old_size;</span> -<span class="lineNum"> 87 </span><span class="lineCov"> 10 : this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;</span> -<span class="lineNum"> 88 </span> : } -<span class="lineNum"> 89 </span><span class="lineCov"> 10 : }</span> -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 92 </span> : typename vector<_Tp, _Alloc>::iterator -<span class="lineNum"> 93 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 94 </span><span class="lineCov"> 19 : insert(iterator __position, const value_type& __x)</span> -<span class="lineNum"> 95 </span> : { -<span class="lineNum"> 96 </span><span class="lineCov"> 19 : const size_type __n = __position - begin();</span> -<span class="lineNum"> 97 </span><span class="lineCov"> 19 : if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage</span> -<span class="lineNum"> 98 </span> : && __position == end()) -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span><span class="lineNoCov"> 0 : this->_M_impl.construct(this->_M_impl._M_finish, __x);</span> -<span class="lineNum"> 101 </span><span class="lineNoCov"> 0 : ++this->_M_impl._M_finish;</span> -<span class="lineNum"> 102 </span> : } -<span class="lineNum"> 103 </span> : else -<span class="lineNum"> 104 </span> : { -<span class="lineNum"> 105 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 106 </span> : if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) -<span class="lineNum"> 107 </span> : { -<span class="lineNum"> 108 </span> : _Tp __x_copy = __x; -<span class="lineNum"> 109 </span> : _M_insert_aux(__position, std::move(__x_copy)); -<span class="lineNum"> 110 </span> : } -<span class="lineNum"> 111 </span> : else -<span class="lineNum"> 112 </span> : #endif -<span class="lineNum"> 113 </span><span class="lineCov"> 19 : _M_insert_aux(__position, __x);</span> -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span><span class="lineCov"> 19 : return iterator(this->_M_impl._M_start + __n);</span> -<span class="lineNum"> 116 </span> : } -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 119 </span> : typename vector<_Tp, _Alloc>::iterator -<span class="lineNum"> 120 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 121 </span><span class="lineCov"> 2 : erase(iterator __position)</span> -<span class="lineNum"> 122 </span> : { -<span class="lineNum"> 123 </span><span class="lineCov"> 2 : if (__position + 1 != end())</span> -<span class="lineNum"> 124 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE3(__position + 1, end(), __position);</span> -<span class="lineNum"> 125 </span><span class="lineCov"> 2 : --this->_M_impl._M_finish;</span> -<span class="lineNum"> 126 </span><span class="lineCov"> 2 : this->_M_impl.destroy(this->_M_impl._M_finish);</span> -<span class="lineNum"> 127 </span><span class="lineCov"> 2 : return __position;</span> -<span class="lineNum"> 128 </span> : } -<span class="lineNum"> 129 </span> : -<span class="lineNum"> 130 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 131 </span> : typename vector<_Tp, _Alloc>::iterator -<span class="lineNum"> 132 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 133 </span> : erase(iterator __first, iterator __last) -<span class="lineNum"> 134 </span> : { -<span class="lineNum"> 135 </span> : if (__last != end()) -<span class="lineNum"> 136 </span> : _GLIBCXX_MOVE3(__last, end(), __first); -<span class="lineNum"> 137 </span> : _M_erase_at_end(__first.base() + (end() - __last)); -<span class="lineNum"> 138 </span> : return __first; -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 142 </span> : vector<_Tp, _Alloc>& -<span class="lineNum"> 143 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 144 </span> : operator=(const vector<_Tp, _Alloc>& __x) -<span class="lineNum"> 145 </span> : { -<span class="lineNum"> 146 </span> : if (&__x != this) -<span class="lineNum"> 147 </span> : { -<span class="lineNum"> 148 </span> : const size_type __xlen = __x.size(); -<span class="lineNum"> 149 </span> : if (__xlen > capacity()) -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span> : pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(), -<span class="lineNum"> 152 </span> : __x.end()); -<span class="lineNum"> 153 </span> : std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, -<span class="lineNum"> 154 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 155 </span> : _M_deallocate(this->_M_impl._M_start, -<span class="lineNum"> 156 </span> : this->_M_impl._M_end_of_storage -<span class="lineNum"> 157 </span> : - this->_M_impl._M_start); -<span class="lineNum"> 158 </span> : this->_M_impl._M_start = __tmp; -<span class="lineNum"> 159 </span> : this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen; -<span class="lineNum"> 160 </span> : } -<span class="lineNum"> 161 </span> : else if (size() >= __xlen) -<span class="lineNum"> 162 </span> : { -<span class="lineNum"> 163 </span> : std::_Destroy(std::copy(__x.begin(), __x.end(), begin()), -<span class="lineNum"> 164 </span> : end(), _M_get_Tp_allocator()); -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : else -<span class="lineNum"> 167 </span> : { -<span class="lineNum"> 168 </span> : std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(), -<span class="lineNum"> 169 </span> : this->_M_impl._M_start); -<span class="lineNum"> 170 </span> : std::__uninitialized_copy_a(__x._M_impl._M_start + size(), -<span class="lineNum"> 171 </span> : __x._M_impl._M_finish, -<span class="lineNum"> 172 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 173 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 174 </span> : } -<span class="lineNum"> 175 </span> : this->_M_impl._M_finish = this->_M_impl._M_start + __xlen; -<span class="lineNum"> 176 </span> : } -<span class="lineNum"> 177 </span> : return *this; -<span class="lineNum"> 178 </span> : } -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 181 </span> : void -<span class="lineNum"> 182 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 183 </span> : _M_fill_assign(size_t __n, const value_type& __val) -<span class="lineNum"> 184 </span> : { -<span class="lineNum"> 185 </span> : if (__n > capacity()) -<span class="lineNum"> 186 </span> : { -<span class="lineNum"> 187 </span> : vector __tmp(__n, __val, _M_get_Tp_allocator()); -<span class="lineNum"> 188 </span> : __tmp.swap(*this); -<span class="lineNum"> 189 </span> : } -<span class="lineNum"> 190 </span> : else if (__n > size()) -<span class="lineNum"> 191 </span> : { -<span class="lineNum"> 192 </span> : std::fill(begin(), end(), __val); -<span class="lineNum"> 193 </span> : std::__uninitialized_fill_n_a(this->_M_impl._M_finish, -<span class="lineNum"> 194 </span> : __n - size(), __val, -<span class="lineNum"> 195 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 196 </span> : this->_M_impl._M_finish += __n - size(); -<span class="lineNum"> 197 </span> : } -<span class="lineNum"> 198 </span> : else -<span class="lineNum"> 199 </span> : _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val)); -<span class="lineNum"> 200 </span> : } -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 203 </span> : template<typename _InputIterator> -<span class="lineNum"> 204 </span> : void -<span class="lineNum"> 205 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 206 </span> : _M_assign_aux(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 207 </span> : std::input_iterator_tag) -<span class="lineNum"> 208 </span> : { -<span class="lineNum"> 209 </span> : pointer __cur(this->_M_impl._M_start); -<span class="lineNum"> 210 </span> : for (; __first != __last && __cur != this->_M_impl._M_finish; -<span class="lineNum"> 211 </span> : ++__cur, ++__first) -<span class="lineNum"> 212 </span> : *__cur = *__first; -<span class="lineNum"> 213 </span> : if (__first == __last) -<span class="lineNum"> 214 </span> : _M_erase_at_end(__cur); -<span class="lineNum"> 215 </span> : else -<span class="lineNum"> 216 </span> : insert(end(), __first, __last); -<span class="lineNum"> 217 </span> : } -<span class="lineNum"> 218 </span> : -<span class="lineNum"> 219 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 220 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 221 </span> : void -<span class="lineNum"> 222 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 223 </span> : _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 224 </span> : std::forward_iterator_tag) -<span class="lineNum"> 225 </span> : { -<span class="lineNum"> 226 </span> : const size_type __len = std::distance(__first, __last); -<span class="lineNum"> 227 </span> : -<span class="lineNum"> 228 </span> : if (__len > capacity()) -<span class="lineNum"> 229 </span> : { -<span class="lineNum"> 230 </span> : pointer __tmp(_M_allocate_and_copy(__len, __first, __last)); -<span class="lineNum"> 231 </span> : std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, -<span class="lineNum"> 232 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 233 </span> : _M_deallocate(this->_M_impl._M_start, -<span class="lineNum"> 234 </span> : this->_M_impl._M_end_of_storage -<span class="lineNum"> 235 </span> : - this->_M_impl._M_start); -<span class="lineNum"> 236 </span> : this->_M_impl._M_start = __tmp; -<span class="lineNum"> 237 </span> : this->_M_impl._M_finish = this->_M_impl._M_start + __len; -<span class="lineNum"> 238 </span> : this->_M_impl._M_end_of_storage = this->_M_impl._M_finish; -<span class="lineNum"> 239 </span> : } -<span class="lineNum"> 240 </span> : else if (size() >= __len) -<span class="lineNum"> 241 </span> : _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start)); -<span class="lineNum"> 242 </span> : else -<span class="lineNum"> 243 </span> : { -<span class="lineNum"> 244 </span> : _ForwardIterator __mid = __first; -<span class="lineNum"> 245 </span> : std::advance(__mid, size()); -<span class="lineNum"> 246 </span> : std::copy(__first, __mid, this->_M_impl._M_start); -<span class="lineNum"> 247 </span> : this->_M_impl._M_finish = -<span class="lineNum"> 248 </span> : std::__uninitialized_copy_a(__mid, __last, -<span class="lineNum"> 249 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 250 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 251 </span> : } -<span class="lineNum"> 252 </span> : } -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 255 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 256 </span> : template<typename... _Args> -<span class="lineNum"> 257 </span> : typename vector<_Tp, _Alloc>::iterator -<span class="lineNum"> 258 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 259 </span> : emplace(iterator __position, _Args&&... __args) -<span class="lineNum"> 260 </span> : { -<span class="lineNum"> 261 </span> : const size_type __n = __position - begin(); -<span class="lineNum"> 262 </span> : if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage -<span class="lineNum"> 263 </span> : && __position == end()) -<span class="lineNum"> 264 </span> : { -<span class="lineNum"> 265 </span> : this->_M_impl.construct(this->_M_impl._M_finish, -<span class="lineNum"> 266 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 267 </span> : ++this->_M_impl._M_finish; -<span class="lineNum"> 268 </span> : } -<span class="lineNum"> 269 </span> : else -<span class="lineNum"> 270 </span> : _M_insert_aux(__position, std::forward<_Args>(__args)...); -<span class="lineNum"> 271 </span> : return iterator(this->_M_impl._M_start + __n); -<span class="lineNum"> 272 </span> : } -<span class="lineNum"> 273 </span> : -<span class="lineNum"> 274 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 275 </span> : template<typename... _Args> -<span class="lineNum"> 276 </span> : void -<span class="lineNum"> 277 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 278 </span> : _M_insert_aux(iterator __position, _Args&&... __args) -<span class="lineNum"> 279 </span> : #else -<span class="lineNum"> 280 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 281 </span> : void -<span class="lineNum"> 282 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 283 </span><span class="lineCov"> 20651 : _M_insert_aux(iterator __position, const _Tp& __x)</span> -<span class="lineNum"> 284 </span> : #endif -<span class="lineNum"> 285 </span> : { -<span class="lineNum"> 286 </span><span class="lineCov"> 20651 : if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)</span> -<span class="lineNum"> 287 </span> : { -<span class="lineNum"> 288 </span><span class="lineNoCov"> 0 : this->_M_impl.construct(this->_M_impl._M_finish,</span> -<span class="lineNum"> 289 </span> : _GLIBCXX_MOVE(*(this->_M_impl._M_finish -<span class="lineNum"> 290 </span> : - 1))); -<span class="lineNum"> 291 </span><span class="lineNoCov"> 0 : ++this->_M_impl._M_finish;</span> -<span class="lineNum"> 292 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 293 </span><span class="lineNoCov"> 0 : _Tp __x_copy = __x;</span> -<span class="lineNum"> 294 </span> : #endif -<span class="lineNum"> 295 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE_BACKWARD3(__position.base(),</span> -<span class="lineNum"> 296 </span> : this->_M_impl._M_finish - 2, -<span class="lineNum"> 297 </span> : this->_M_impl._M_finish - 1); -<span class="lineNum"> 298 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 299 </span><span class="lineNoCov"> 0 : *__position = __x_copy;</span> -<span class="lineNum"> 300 </span> : #else -<span class="lineNum"> 301 </span> : *__position = _Tp(std::forward<_Args>(__args)...); -<span class="lineNum"> 302 </span> : #endif -<span class="lineNum"> 303 </span> : } -<span class="lineNum"> 304 </span> : else -<span class="lineNum"> 305 </span> : { -<span class="lineNum"> 306 </span> : const size_type __len = -<span class="lineNum"> 307 </span><span class="lineCov"> 20651 : _M_check_len(size_type(1), "vector::_M_insert_aux");</span> -<span class="lineNum"> 308 </span><span class="lineCov"> 20651 : pointer __new_start(this->_M_allocate(__len));</span> -<span class="lineNum"> 309 </span><span class="lineCov"> 20651 : pointer __new_finish(__new_start);</span> -<span class="lineNum"> 310 </span> : try -<span class="lineNum"> 311 </span> : { -<span class="lineNum"> 312 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 313 </span> : this->_M_impl.construct(__new_start + (__position - begin()), -<span class="lineNum"> 314 </span> : std::forward<_Args>(__args)...); -<span class="lineNum"> 315 </span> : #endif -<span class="lineNum"> 316 </span><span class="lineCov"> 20651 : __new_finish =</span> -<span class="lineNum"> 317 </span> : std::__uninitialized_move_a(this->_M_impl._M_start, -<span class="lineNum"> 318 </span> : __position.base(), __new_start, -<span class="lineNum"> 319 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 320 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 321 </span><span class="lineCov"> 20651 : this->_M_impl.construct(__new_finish, __x);</span> -<span class="lineNum"> 322 </span> : #endif -<span class="lineNum"> 323 </span><span class="lineCov"> 20651 : ++__new_finish;</span> -<span class="lineNum"> 324 </span><span class="lineCov"> 20651 : __new_finish =</span> -<span class="lineNum"> 325 </span> : std::__uninitialized_move_a(__position.base(), -<span class="lineNum"> 326 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 327 </span> : __new_finish, -<span class="lineNum"> 328 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 329 </span> : } -<span class="lineNum"> 330 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 331 </span> : { -<span class="lineNum"> 332 </span><span class="lineNoCov"> 0 : std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());</span> -<span class="lineNum"> 333 </span><span class="lineNoCov"> 0 : _M_deallocate(__new_start, __len);</span> -<span class="lineNum"> 334 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 335 </span> : } -<span class="lineNum"> 336 </span><span class="lineCov"> 20651 : std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,</span> -<span class="lineNum"> 337 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 338 </span><span class="lineCov"> 20651 : _M_deallocate(this->_M_impl._M_start,</span> -<span class="lineNum"> 339 </span> : this->_M_impl._M_end_of_storage -<span class="lineNum"> 340 </span> : - this->_M_impl._M_start); -<span class="lineNum"> 341 </span><span class="lineCov"> 20651 : this->_M_impl._M_start = __new_start;</span> -<span class="lineNum"> 342 </span><span class="lineCov"> 20651 : this->_M_impl._M_finish = __new_finish;</span> -<span class="lineNum"> 343 </span><span class="lineCov"> 20651 : this->_M_impl._M_end_of_storage = __new_start + __len;</span> -<span class="lineNum"> 344 </span> : } -<span class="lineNum"> 345 </span><span class="lineCov"> 20651 : }</span> -<span class="lineNum"> 346 </span> : -<span class="lineNum"> 347 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 348 </span> : void -<span class="lineNum"> 349 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 350 </span><span class="lineCov"> 22443 : _M_fill_insert(iterator __position, size_type __n, const value_type& __x)</span> -<span class="lineNum"> 351 </span> : { -<span class="lineNum"> 352 </span><span class="lineCov"> 22443 : if (__n != 0)</span> -<span class="lineNum"> 353 </span> : { -<span class="lineNum"> 354 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 355 </span> : value_type __x_copy = __x; -<span class="lineNum"> 356 </span> : #endif -<span class="lineNum"> 357 </span><span class="lineCov"> 22443 : if (size_type(this->_M_impl._M_end_of_storage</span> -<span class="lineNum"> 358 </span> : - this->_M_impl._M_finish) >= __n) -<span class="lineNum"> 359 </span> : { -<span class="lineNum"> 360 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 361 </span><span class="lineCov"> 22386 : value_type __x_copy = __x;</span> -<span class="lineNum"> 362 </span> : #endif -<span class="lineNum"> 363 </span><span class="lineCov"> 22386 : const size_type __elems_after = end() - __position;</span> -<span class="lineNum"> 364 </span><span class="lineCov"> 22386 : pointer __old_finish(this->_M_impl._M_finish);</span> -<span class="lineNum"> 365 </span><span class="lineCov"> 22386 : if (__elems_after > __n)</span> -<span class="lineNum"> 366 </span> : { -<span class="lineNum"> 367 </span><span class="lineNoCov"> 0 : std::__uninitialized_move_a(this->_M_impl._M_finish - __n,</span> -<span class="lineNum"> 368 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 369 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 370 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 371 </span><span class="lineNoCov"> 0 : this->_M_impl._M_finish += __n;</span> -<span class="lineNum"> 372 </span><span class="lineNoCov"> 0 : _GLIBCXX_MOVE_BACKWARD3(__position.base(),</span> -<span class="lineNum"> 373 </span> : __old_finish - __n, __old_finish); -<span class="lineNum"> 374 </span><span class="lineNoCov"> 0 : std::fill(__position.base(), __position.base() + __n,</span> -<span class="lineNum"> 375 </span> : __x_copy); -<span class="lineNum"> 376 </span> : } -<span class="lineNum"> 377 </span> : else -<span class="lineNum"> 378 </span> : { -<span class="lineNum"> 379 </span><span class="lineCov"> 22386 : std::__uninitialized_fill_n_a(this->_M_impl._M_finish,</span> -<span class="lineNum"> 380 </span> : __n - __elems_after, -<span class="lineNum"> 381 </span> : __x_copy, -<span class="lineNum"> 382 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 383 </span><span class="lineCov"> 22386 : this->_M_impl._M_finish += __n - __elems_after;</span> -<span class="lineNum"> 384 </span><span class="lineCov"> 22386 : std::__uninitialized_move_a(__position.base(), __old_finish,</span> -<span class="lineNum"> 385 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 386 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 387 </span><span class="lineCov"> 22386 : this->_M_impl._M_finish += __elems_after;</span> -<span class="lineNum"> 388 </span><span class="lineCov"> 22386 : std::fill(__position.base(), __old_finish, __x_copy);</span> -<span class="lineNum"> 389 </span> : } -<span class="lineNum"> 390 </span> : } -<span class="lineNum"> 391 </span> : else -<span class="lineNum"> 392 </span> : { -<span class="lineNum"> 393 </span> : const size_type __len = -<span class="lineNum"> 394 </span><span class="lineCov"> 57 : _M_check_len(__n, "vector::_M_fill_insert");</span> -<span class="lineNum"> 395 </span><span class="lineCov"> 57 : pointer __new_start(this->_M_allocate(__len));</span> -<span class="lineNum"> 396 </span><span class="lineCov"> 57 : pointer __new_finish(__new_start);</span> -<span class="lineNum"> 397 </span> : try -<span class="lineNum"> 398 </span> : { -<span class="lineNum"> 399 </span><span class="lineCov"> 57 : __new_finish =</span> -<span class="lineNum"> 400 </span> : std::__uninitialized_move_a(this->_M_impl._M_start, -<span class="lineNum"> 401 </span> : __position.base(), -<span class="lineNum"> 402 </span> : __new_start, -<span class="lineNum"> 403 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 404 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 405 </span> : std::__uninitialized_fill_n_a(__new_finish, __n, __x_copy, -<span class="lineNum"> 406 </span> : #else -<span class="lineNum"> 407 </span><span class="lineCov"> 57 : std::__uninitialized_fill_n_a(__new_finish, __n, __x,</span> -<span class="lineNum"> 408 </span> : #endif -<span class="lineNum"> 409 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 410 </span><span class="lineCov"> 57 : __new_finish += __n;</span> -<span class="lineNum"> 411 </span><span class="lineCov"> 57 : __new_finish =</span> -<span class="lineNum"> 412 </span> : std::__uninitialized_move_a(__position.base(), -<span class="lineNum"> 413 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 414 </span> : __new_finish, -<span class="lineNum"> 415 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 416 </span> : } -<span class="lineNum"> 417 </span><span class="lineNoCov"> 0 : catch(...)</span> -<span class="lineNum"> 418 </span> : { -<span class="lineNum"> 419 </span><span class="lineNoCov"> 0 : std::_Destroy(__new_start, __new_finish,</span> -<span class="lineNum"> 420 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 421 </span><span class="lineNoCov"> 0 : _M_deallocate(__new_start, __len);</span> -<span class="lineNum"> 422 </span><span class="lineNoCov"> 0 : __throw_exception_again;</span> -<span class="lineNum"> 423 </span> : } -<span class="lineNum"> 424 </span><span class="lineCov"> 57 : std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,</span> -<span class="lineNum"> 425 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 426 </span><span class="lineCov"> 57 : _M_deallocate(this->_M_impl._M_start,</span> -<span class="lineNum"> 427 </span> : this->_M_impl._M_end_of_storage -<span class="lineNum"> 428 </span> : - this->_M_impl._M_start); -<span class="lineNum"> 429 </span><span class="lineCov"> 57 : this->_M_impl._M_start = __new_start;</span> -<span class="lineNum"> 430 </span><span class="lineCov"> 57 : this->_M_impl._M_finish = __new_finish;</span> -<span class="lineNum"> 431 </span><span class="lineCov"> 57 : this->_M_impl._M_end_of_storage = __new_start + __len;</span> -<span class="lineNum"> 432 </span> : } -<span class="lineNum"> 433 </span> : } -<span class="lineNum"> 434 </span><span class="lineCov"> 22443 : }</span> -<span class="lineNum"> 435 </span> : -<span class="lineNum"> 436 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 437 </span> : template<typename _InputIterator> -<span class="lineNum"> 438 </span> : void -<span class="lineNum"> 439 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 440 </span> : _M_range_insert(iterator __pos, _InputIterator __first, -<span class="lineNum"> 441 </span> : _InputIterator __last, std::input_iterator_tag) -<span class="lineNum"> 442 </span> : { -<span class="lineNum"> 443 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 444 </span> : { -<span class="lineNum"> 445 </span> : __pos = insert(__pos, *__first); -<span class="lineNum"> 446 </span> : ++__pos; -<span class="lineNum"> 447 </span> : } -<span class="lineNum"> 448 </span> : } -<span class="lineNum"> 449 </span> : -<span class="lineNum"> 450 </span> : template<typename _Tp, typename _Alloc> -<span class="lineNum"> 451 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 452 </span> : void -<span class="lineNum"> 453 </span> : vector<_Tp, _Alloc>:: -<span class="lineNum"> 454 </span> : _M_range_insert(iterator __position, _ForwardIterator __first, -<span class="lineNum"> 455 </span> : _ForwardIterator __last, std::forward_iterator_tag) -<span class="lineNum"> 456 </span> : { -<span class="lineNum"> 457 </span> : if (__first != __last) -<span class="lineNum"> 458 </span> : { -<span class="lineNum"> 459 </span> : const size_type __n = std::distance(__first, __last); -<span class="lineNum"> 460 </span> : if (size_type(this->_M_impl._M_end_of_storage -<span class="lineNum"> 461 </span> : - this->_M_impl._M_finish) >= __n) -<span class="lineNum"> 462 </span> : { -<span class="lineNum"> 463 </span> : const size_type __elems_after = end() - __position; -<span class="lineNum"> 464 </span> : pointer __old_finish(this->_M_impl._M_finish); -<span class="lineNum"> 465 </span> : if (__elems_after > __n) -<span class="lineNum"> 466 </span> : { -<span class="lineNum"> 467 </span> : std::__uninitialized_move_a(this->_M_impl._M_finish - __n, -<span class="lineNum"> 468 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 469 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 470 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 471 </span> : this->_M_impl._M_finish += __n; -<span class="lineNum"> 472 </span> : _GLIBCXX_MOVE_BACKWARD3(__position.base(), -<span class="lineNum"> 473 </span> : __old_finish - __n, __old_finish); -<span class="lineNum"> 474 </span> : std::copy(__first, __last, __position); -<span class="lineNum"> 475 </span> : } -<span class="lineNum"> 476 </span> : else -<span class="lineNum"> 477 </span> : { -<span class="lineNum"> 478 </span> : _ForwardIterator __mid = __first; -<span class="lineNum"> 479 </span> : std::advance(__mid, __elems_after); -<span class="lineNum"> 480 </span> : std::__uninitialized_copy_a(__mid, __last, -<span class="lineNum"> 481 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 482 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 483 </span> : this->_M_impl._M_finish += __n - __elems_after; -<span class="lineNum"> 484 </span> : std::__uninitialized_move_a(__position.base(), -<span class="lineNum"> 485 </span> : __old_finish, -<span class="lineNum"> 486 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 487 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 488 </span> : this->_M_impl._M_finish += __elems_after; -<span class="lineNum"> 489 </span> : std::copy(__first, __mid, __position); -<span class="lineNum"> 490 </span> : } -<span class="lineNum"> 491 </span> : } -<span class="lineNum"> 492 </span> : else -<span class="lineNum"> 493 </span> : { -<span class="lineNum"> 494 </span> : const size_type __len = -<span class="lineNum"> 495 </span> : _M_check_len(__n, "vector::_M_range_insert"); -<span class="lineNum"> 496 </span> : pointer __new_start(this->_M_allocate(__len)); -<span class="lineNum"> 497 </span> : pointer __new_finish(__new_start); -<span class="lineNum"> 498 </span> : try -<span class="lineNum"> 499 </span> : { -<span class="lineNum"> 500 </span> : __new_finish = -<span class="lineNum"> 501 </span> : std::__uninitialized_move_a(this->_M_impl._M_start, -<span class="lineNum"> 502 </span> : __position.base(), -<span class="lineNum"> 503 </span> : __new_start, -<span class="lineNum"> 504 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 505 </span> : __new_finish = -<span class="lineNum"> 506 </span> : std::__uninitialized_copy_a(__first, __last, -<span class="lineNum"> 507 </span> : __new_finish, -<span class="lineNum"> 508 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 509 </span> : __new_finish = -<span class="lineNum"> 510 </span> : std::__uninitialized_move_a(__position.base(), -<span class="lineNum"> 511 </span> : this->_M_impl._M_finish, -<span class="lineNum"> 512 </span> : __new_finish, -<span class="lineNum"> 513 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 514 </span> : } -<span class="lineNum"> 515 </span> : catch(...) -<span class="lineNum"> 516 </span> : { -<span class="lineNum"> 517 </span> : std::_Destroy(__new_start, __new_finish, -<span class="lineNum"> 518 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 519 </span> : _M_deallocate(__new_start, __len); -<span class="lineNum"> 520 </span> : __throw_exception_again; -<span class="lineNum"> 521 </span> : } -<span class="lineNum"> 522 </span> : std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, -<span class="lineNum"> 523 </span> : _M_get_Tp_allocator()); -<span class="lineNum"> 524 </span> : _M_deallocate(this->_M_impl._M_start, -<span class="lineNum"> 525 </span> : this->_M_impl._M_end_of_storage -<span class="lineNum"> 526 </span> : - this->_M_impl._M_start); -<span class="lineNum"> 527 </span> : this->_M_impl._M_start = __new_start; -<span class="lineNum"> 528 </span> : this->_M_impl._M_finish = __new_finish; -<span class="lineNum"> 529 </span> : this->_M_impl._M_end_of_storage = __new_start + __len; -<span class="lineNum"> 530 </span> : } -<span class="lineNum"> 531 </span> : } -<span class="lineNum"> 532 </span> : } -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : -<span class="lineNum"> 535 </span> : // vector<bool> -<span class="lineNum"> 536 </span> : -<span class="lineNum"> 537 </span> : template<typename _Alloc> -<span class="lineNum"> 538 </span> : void -<span class="lineNum"> 539 </span> : vector<bool, _Alloc>:: -<span class="lineNum"> 540 </span> : reserve(size_type __n) -<span class="lineNum"> 541 </span> : { -<span class="lineNum"> 542 </span> : if (__n > this->max_size()) -<span class="lineNum"> 543 </span> : __throw_length_error(__N("vector::reserve")); -<span class="lineNum"> 544 </span> : if (this->capacity() < __n) -<span class="lineNum"> 545 </span> : { -<span class="lineNum"> 546 </span> : _Bit_type* __q = this->_M_allocate(__n); -<span class="lineNum"> 547 </span> : this->_M_impl._M_finish = _M_copy_aligned(begin(), end(), -<span class="lineNum"> 548 </span> : iterator(__q, 0)); -<span class="lineNum"> 549 </span> : this->_M_deallocate(); -<span class="lineNum"> 550 </span> : this->_M_impl._M_start = iterator(__q, 0); -<span class="lineNum"> 551 </span> : this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1) -<span class="lineNum"> 552 </span> : / int(_S_word_bit)); -<span class="lineNum"> 553 </span> : } -<span class="lineNum"> 554 </span> : } -<span class="lineNum"> 555 </span> : -<span class="lineNum"> 556 </span> : template<typename _Alloc> -<span class="lineNum"> 557 </span> : void -<span class="lineNum"> 558 </span> : vector<bool, _Alloc>:: -<span class="lineNum"> 559 </span> : _M_fill_insert(iterator __position, size_type __n, bool __x) -<span class="lineNum"> 560 </span> : { -<span class="lineNum"> 561 </span> : if (__n == 0) -<span class="lineNum"> 562 </span> : return; -<span class="lineNum"> 563 </span> : if (capacity() - size() >= __n) -<span class="lineNum"> 564 </span> : { -<span class="lineNum"> 565 </span> : std::copy_backward(__position, end(), -<span class="lineNum"> 566 </span> : this->_M_impl._M_finish + difference_type(__n)); -<span class="lineNum"> 567 </span> : std::fill(__position, __position + difference_type(__n), __x); -<span class="lineNum"> 568 </span> : this->_M_impl._M_finish += difference_type(__n); -<span class="lineNum"> 569 </span> : } -<span class="lineNum"> 570 </span> : else -<span class="lineNum"> 571 </span> : { -<span class="lineNum"> 572 </span> : const size_type __len = -<span class="lineNum"> 573 </span> : _M_check_len(__n, "vector<bool>::_M_fill_insert"); -<span class="lineNum"> 574 </span> : _Bit_type * __q = this->_M_allocate(__len); -<span class="lineNum"> 575 </span> : iterator __i = _M_copy_aligned(begin(), __position, -<span class="lineNum"> 576 </span> : iterator(__q, 0)); -<span class="lineNum"> 577 </span> : std::fill(__i, __i + difference_type(__n), __x); -<span class="lineNum"> 578 </span> : this->_M_impl._M_finish = std::copy(__position, end(), -<span class="lineNum"> 579 </span> : __i + difference_type(__n)); -<span class="lineNum"> 580 </span> : this->_M_deallocate(); -<span class="lineNum"> 581 </span> : this->_M_impl._M_end_of_storage = (__q + ((__len -<span class="lineNum"> 582 </span> : + int(_S_word_bit) - 1) -<span class="lineNum"> 583 </span> : / int(_S_word_bit))); -<span class="lineNum"> 584 </span> : this->_M_impl._M_start = iterator(__q, 0); -<span class="lineNum"> 585 </span> : } -<span class="lineNum"> 586 </span> : } -<span class="lineNum"> 587 </span> : -<span class="lineNum"> 588 </span> : template<typename _Alloc> -<span class="lineNum"> 589 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 590 </span> : void -<span class="lineNum"> 591 </span> : vector<bool, _Alloc>:: -<span class="lineNum"> 592 </span> : _M_insert_range(iterator __position, _ForwardIterator __first, -<span class="lineNum"> 593 </span> : _ForwardIterator __last, std::forward_iterator_tag) -<span class="lineNum"> 594 </span> : { -<span class="lineNum"> 595 </span> : if (__first != __last) -<span class="lineNum"> 596 </span> : { -<span class="lineNum"> 597 </span> : size_type __n = std::distance(__first, __last); -<span class="lineNum"> 598 </span> : if (capacity() - size() >= __n) -<span class="lineNum"> 599 </span> : { -<span class="lineNum"> 600 </span> : std::copy_backward(__position, end(), -<span class="lineNum"> 601 </span> : this->_M_impl._M_finish -<span class="lineNum"> 602 </span> : + difference_type(__n)); -<span class="lineNum"> 603 </span> : std::copy(__first, __last, __position); -<span class="lineNum"> 604 </span> : this->_M_impl._M_finish += difference_type(__n); -<span class="lineNum"> 605 </span> : } -<span class="lineNum"> 606 </span> : else -<span class="lineNum"> 607 </span> : { -<span class="lineNum"> 608 </span> : const size_type __len = -<span class="lineNum"> 609 </span> : _M_check_len(__n, "vector<bool>::_M_insert_range"); -<span class="lineNum"> 610 </span> : _Bit_type * __q = this->_M_allocate(__len); -<span class="lineNum"> 611 </span> : iterator __i = _M_copy_aligned(begin(), __position, -<span class="lineNum"> 612 </span> : iterator(__q, 0)); -<span class="lineNum"> 613 </span> : __i = std::copy(__first, __last, __i); -<span class="lineNum"> 614 </span> : this->_M_impl._M_finish = std::copy(__position, end(), __i); -<span class="lineNum"> 615 </span> : this->_M_deallocate(); -<span class="lineNum"> 616 </span> : this->_M_impl._M_end_of_storage = (__q -<span class="lineNum"> 617 </span> : + ((__len -<span class="lineNum"> 618 </span> : + int(_S_word_bit) - 1) -<span class="lineNum"> 619 </span> : / int(_S_word_bit))); -<span class="lineNum"> 620 </span> : this->_M_impl._M_start = iterator(__q, 0); -<span class="lineNum"> 621 </span> : } -<span class="lineNum"> 622 </span> : } -<span class="lineNum"> 623 </span> : } -<span class="lineNum"> 624 </span> : -<span class="lineNum"> 625 </span> : template<typename _Alloc> -<span class="lineNum"> 626 </span> : void -<span class="lineNum"> 627 </span> : vector<bool, _Alloc>:: -<span class="lineNum"> 628 </span><span class="lineCov"> 1 : _M_insert_aux(iterator __position, bool __x)</span> -<span class="lineNum"> 629 </span> : { -<span class="lineNum"> 630 </span><span class="lineCov"> 1 : if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)</span> -<span class="lineNum"> 631 </span> : { -<span class="lineNum"> 632 </span><span class="lineNoCov"> 0 : std::copy_backward(__position, this->_M_impl._M_finish, </span> -<span class="lineNum"> 633 </span> : this->_M_impl._M_finish + 1); -<span class="lineNum"> 634 </span><span class="lineNoCov"> 0 : *__position = __x;</span> -<span class="lineNum"> 635 </span><span class="lineNoCov"> 0 : ++this->_M_impl._M_finish;</span> -<span class="lineNum"> 636 </span> : } -<span class="lineNum"> 637 </span> : else -<span class="lineNum"> 638 </span> : { -<span class="lineNum"> 639 </span> : const size_type __len = -<span class="lineNum"> 640 </span><span class="lineCov"> 1 : _M_check_len(size_type(1), "vector<bool>::_M_insert_aux");</span> -<span class="lineNum"> 641 </span><span class="lineCov"> 1 : _Bit_type * __q = this->_M_allocate(__len);</span> -<span class="lineNum"> 642 </span> : iterator __i = _M_copy_aligned(begin(), __position, -<span class="lineNum"> 643 </span><span class="lineCov"> 1 : iterator(__q, 0));</span> -<span class="lineNum"> 644 </span><span class="lineCov"> 1 : *__i++ = __x;</span> -<span class="lineNum"> 645 </span><span class="lineCov"> 1 : this->_M_impl._M_finish = std::copy(__position, end(), __i);</span> -<span class="lineNum"> 646 </span><span class="lineCov"> 1 : this->_M_deallocate();</span> -<span class="lineNum"> 647 </span><span class="lineCov"> 1 : this->_M_impl._M_end_of_storage = (__q + ((__len</span> -<span class="lineNum"> 648 </span> : + int(_S_word_bit) - 1) -<span class="lineNum"> 649 </span> : / int(_S_word_bit))); -<span class="lineNum"> 650 </span><span class="lineCov"> 1 : this->_M_impl._M_start = iterator(__q, 0);</span> -<span class="lineNum"> 651 </span> : } -<span class="lineNum"> 652 </span><span class="lineCov"> 1 : }</span> -<span class="lineNum"> 653 </span> : -<span class="lineNum"> 654 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 655 </span> : -<span class="lineNum"> 656 </span> : #endif /* _VECTOR_TCC */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/cmath.gcov.html b/rep/usr/include/c++/4.3/cmath.gcov.html deleted file mode 100644 index cd12c31..0000000 --- a/rep/usr/include/c++/4.3/cmath.gcov.html +++ /dev/null @@ -1,710 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/cmath</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - cmath</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- C++ -*- C forwarding header. -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file include/cmath -<span class="lineNum"> 33 </span> : * This is a Standard C++ Library file. You should @c #include this file -<span class="lineNum"> 34 </span> : * in your programs, rather than any of the "*.h" implementation files. -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * This is the C++ version of the Standard C Library header @c math.h, -<span class="lineNum"> 37 </span> : * and its contents are (mostly) the same as that header, but are all -<span class="lineNum"> 38 </span> : * contained in the namespace @c std (except for names which are defined -<span class="lineNum"> 39 </span> : * as macros in C). -<span class="lineNum"> 40 </span> : */ -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : // -<span class="lineNum"> 43 </span> : // ISO C++ 14882: 26.5 C library -<span class="lineNum"> 44 </span> : // -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : #pragma GCC system_header -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : #include <bits/c++config.h> -<span class="lineNum"> 49 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 50 </span> : #include <ext/type_traits.h> -<span class="lineNum"> 51 </span> : #include_next <math.h> -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : #ifndef _GLIBCXX_CMATH -<span class="lineNum"> 54 </span> : #define _GLIBCXX_CMATH 1 -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : // Get rid of those macros defined in <math.h> in lieu of real functions. -<span class="lineNum"> 57 </span> : #undef abs -<span class="lineNum"> 58 </span> : #undef div -<span class="lineNum"> 59 </span> : #undef acos -<span class="lineNum"> 60 </span> : #undef asin -<span class="lineNum"> 61 </span> : #undef atan -<span class="lineNum"> 62 </span> : #undef atan2 -<span class="lineNum"> 63 </span> : #undef ceil -<span class="lineNum"> 64 </span> : #undef cos -<span class="lineNum"> 65 </span> : #undef cosh -<span class="lineNum"> 66 </span> : #undef exp -<span class="lineNum"> 67 </span> : #undef fabs -<span class="lineNum"> 68 </span> : #undef floor -<span class="lineNum"> 69 </span> : #undef fmod -<span class="lineNum"> 70 </span> : #undef frexp -<span class="lineNum"> 71 </span> : #undef ldexp -<span class="lineNum"> 72 </span> : #undef log -<span class="lineNum"> 73 </span> : #undef log10 -<span class="lineNum"> 74 </span> : #undef modf -<span class="lineNum"> 75 </span> : #undef pow -<span class="lineNum"> 76 </span> : #undef sin -<span class="lineNum"> 77 </span> : #undef sinh -<span class="lineNum"> 78 </span> : #undef sqrt -<span class="lineNum"> 79 </span> : #undef tan -<span class="lineNum"> 80 </span> : #undef tanh -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : // Forward declaration of a helper function. This really should be -<span class="lineNum"> 85 </span> : // an `exported' forward declaration. -<span class="lineNum"> 86 </span> : template<typename _Tp> -<span class="lineNum"> 87 </span> : _Tp __cmath_power(_Tp, unsigned int); -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : template<typename _Tp> -<span class="lineNum"> 90 </span> : inline _Tp -<span class="lineNum"> 91 </span> : __pow_helper(_Tp __x, int __n) -<span class="lineNum"> 92 </span> : { -<span class="lineNum"> 93 </span> : return __n < 0 -<span class="lineNum"> 94 </span> : ? _Tp(1)/__cmath_power(__x, -__n) -<span class="lineNum"> 95 </span> : : __cmath_power(__x, __n); -<span class="lineNum"> 96 </span> : } -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : inline double -<span class="lineNum"> 99 </span> : abs(double __x) -<span class="lineNum"> 100 </span> : { return __builtin_fabs(__x); } -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : inline float -<span class="lineNum"> 103 </span> : abs(float __x) -<span class="lineNum"> 104 </span> : { return __builtin_fabsf(__x); } -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : inline long double -<span class="lineNum"> 107 </span> : abs(long double __x) -<span class="lineNum"> 108 </span> : { return __builtin_fabsl(__x); } -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : using ::acos; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : inline float -<span class="lineNum"> 113 </span> : acos(float __x) -<span class="lineNum"> 114 </span> : { return __builtin_acosf(__x); } -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : inline long double -<span class="lineNum"> 117 </span> : acos(long double __x) -<span class="lineNum"> 118 </span> : { return __builtin_acosl(__x); } -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : template<typename _Tp> -<span class="lineNum"> 121 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 122 </span> : double>::__type -<span class="lineNum"> 123 </span> : acos(_Tp __x) -<span class="lineNum"> 124 </span> : { return __builtin_acos(__x); } -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : using ::asin; -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : inline float -<span class="lineNum"> 129 </span> : asin(float __x) -<span class="lineNum"> 130 </span> : { return __builtin_asinf(__x); } -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : inline long double -<span class="lineNum"> 133 </span> : asin(long double __x) -<span class="lineNum"> 134 </span> : { return __builtin_asinl(__x); } -<span class="lineNum"> 135 </span> : -<span class="lineNum"> 136 </span> : template<typename _Tp> -<span class="lineNum"> 137 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 138 </span> : double>::__type -<span class="lineNum"> 139 </span> : asin(_Tp __x) -<span class="lineNum"> 140 </span> : { return __builtin_asin(__x); } -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : using ::atan; -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : inline float -<span class="lineNum"> 145 </span> : atan(float __x) -<span class="lineNum"> 146 </span> : { return __builtin_atanf(__x); } -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : inline long double -<span class="lineNum"> 149 </span> : atan(long double __x) -<span class="lineNum"> 150 </span> : { return __builtin_atanl(__x); } -<span class="lineNum"> 151 </span> : -<span class="lineNum"> 152 </span> : template<typename _Tp> -<span class="lineNum"> 153 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 154 </span> : double>::__type -<span class="lineNum"> 155 </span> : atan(_Tp __x) -<span class="lineNum"> 156 </span> : { return __builtin_atan(__x); } -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : using ::atan2; -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : inline float -<span class="lineNum"> 161 </span> : atan2(float __y, float __x) -<span class="lineNum"> 162 </span> : { return __builtin_atan2f(__y, __x); } -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : inline long double -<span class="lineNum"> 165 </span> : atan2(long double __y, long double __x) -<span class="lineNum"> 166 </span> : { return __builtin_atan2l(__y, __x); } -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : template<typename _Tp, typename _Up> -<span class="lineNum"> 169 </span> : inline -<span class="lineNum"> 170 </span> : typename __gnu_cxx::__promote_2< -<span class="lineNum"> 171 </span> : typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value -<span class="lineNum"> 172 </span> : && __is_arithmetic<_Up>::__value, -<span class="lineNum"> 173 </span> : _Tp>::__type, _Up>::__type -<span class="lineNum"> 174 </span> : atan2(_Tp __y, _Up __x) -<span class="lineNum"> 175 </span> : { -<span class="lineNum"> 176 </span> : typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; -<span class="lineNum"> 177 </span> : return atan2(__type(__y), __type(__x)); -<span class="lineNum"> 178 </span> : } -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : using ::ceil; -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : inline float -<span class="lineNum"> 183 </span> : ceil(float __x) -<span class="lineNum"> 184 </span> : { return __builtin_ceilf(__x); } -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span> : inline long double -<span class="lineNum"> 187 </span> : ceil(long double __x) -<span class="lineNum"> 188 </span> : { return __builtin_ceill(__x); } -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : template<typename _Tp> -<span class="lineNum"> 191 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 192 </span> : double>::__type -<span class="lineNum"> 193 </span> : ceil(_Tp __x) -<span class="lineNum"> 194 </span> : { return __builtin_ceil(__x); } -<span class="lineNum"> 195 </span> : -<span class="lineNum"> 196 </span> : using ::cos; -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : inline float -<span class="lineNum"> 199 </span> : cos(float __x) -<span class="lineNum"> 200 </span> : { return __builtin_cosf(__x); } -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : inline long double -<span class="lineNum"> 203 </span> : cos(long double __x) -<span class="lineNum"> 204 </span> : { return __builtin_cosl(__x); } -<span class="lineNum"> 205 </span> : -<span class="lineNum"> 206 </span> : template<typename _Tp> -<span class="lineNum"> 207 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 208 </span> : double>::__type -<span class="lineNum"> 209 </span> : cos(_Tp __x) -<span class="lineNum"> 210 </span> : { return __builtin_cos(__x); } -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : using ::cosh; -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : inline float -<span class="lineNum"> 215 </span> : cosh(float __x) -<span class="lineNum"> 216 </span> : { return __builtin_coshf(__x); } -<span class="lineNum"> 217 </span> : -<span class="lineNum"> 218 </span> : inline long double -<span class="lineNum"> 219 </span> : cosh(long double __x) -<span class="lineNum"> 220 </span> : { return __builtin_coshl(__x); } -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : template<typename _Tp> -<span class="lineNum"> 223 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 224 </span> : double>::__type -<span class="lineNum"> 225 </span> : cosh(_Tp __x) -<span class="lineNum"> 226 </span> : { return __builtin_cosh(__x); } -<span class="lineNum"> 227 </span> : -<span class="lineNum"> 228 </span> : using ::exp; -<span class="lineNum"> 229 </span> : -<span class="lineNum"> 230 </span> : inline float -<span class="lineNum"> 231 </span> : exp(float __x) -<span class="lineNum"> 232 </span> : { return __builtin_expf(__x); } -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : inline long double -<span class="lineNum"> 235 </span> : exp(long double __x) -<span class="lineNum"> 236 </span> : { return __builtin_expl(__x); } -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : template<typename _Tp> -<span class="lineNum"> 239 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 240 </span> : double>::__type -<span class="lineNum"> 241 </span> : exp(_Tp __x) -<span class="lineNum"> 242 </span> : { return __builtin_exp(__x); } -<span class="lineNum"> 243 </span> : -<span class="lineNum"> 244 </span> : using ::fabs; -<span class="lineNum"> 245 </span> : -<span class="lineNum"> 246 </span> : inline float -<span class="lineNum"> 247 </span> : fabs(float __x) -<span class="lineNum"> 248 </span> : { return __builtin_fabsf(__x); } -<span class="lineNum"> 249 </span> : -<span class="lineNum"> 250 </span> : inline long double -<span class="lineNum"> 251 </span> : fabs(long double __x) -<span class="lineNum"> 252 </span> : { return __builtin_fabsl(__x); } -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : template<typename _Tp> -<span class="lineNum"> 255 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 256 </span> : double>::__type -<span class="lineNum"> 257 </span> : fabs(_Tp __x) -<span class="lineNum"> 258 </span> : { return __builtin_fabs(__x); } -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : using ::floor; -<span class="lineNum"> 261 </span> : -<span class="lineNum"> 262 </span> : inline float -<span class="lineNum"> 263 </span> : floor(float __x) -<span class="lineNum"> 264 </span> : { return __builtin_floorf(__x); } -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : inline long double -<span class="lineNum"> 267 </span> : floor(long double __x) -<span class="lineNum"> 268 </span> : { return __builtin_floorl(__x); } -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span> : template<typename _Tp> -<span class="lineNum"> 271 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 272 </span> : double>::__type -<span class="lineNum"> 273 </span> : floor(_Tp __x) -<span class="lineNum"> 274 </span> : { return __builtin_floor(__x); } -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : using ::fmod; -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : inline float -<span class="lineNum"> 279 </span> : fmod(float __x, float __y) -<span class="lineNum"> 280 </span> : { return __builtin_fmodf(__x, __y); } -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span> : inline long double -<span class="lineNum"> 283 </span> : fmod(long double __x, long double __y) -<span class="lineNum"> 284 </span> : { return __builtin_fmodl(__x, __y); } -<span class="lineNum"> 285 </span> : -<span class="lineNum"> 286 </span> : using ::frexp; -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : inline float -<span class="lineNum"> 289 </span> : frexp(float __x, int* __exp) -<span class="lineNum"> 290 </span> : { return __builtin_frexpf(__x, __exp); } -<span class="lineNum"> 291 </span> : -<span class="lineNum"> 292 </span> : inline long double -<span class="lineNum"> 293 </span> : frexp(long double __x, int* __exp) -<span class="lineNum"> 294 </span> : { return __builtin_frexpl(__x, __exp); } -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : template<typename _Tp> -<span class="lineNum"> 297 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 298 </span> : double>::__type -<span class="lineNum"> 299 </span> : frexp(_Tp __x, int* __exp) -<span class="lineNum"> 300 </span> : { return __builtin_frexp(__x, __exp); } -<span class="lineNum"> 301 </span> : -<span class="lineNum"> 302 </span> : using ::ldexp; -<span class="lineNum"> 303 </span> : -<span class="lineNum"> 304 </span> : inline float -<span class="lineNum"> 305 </span> : ldexp(float __x, int __exp) -<span class="lineNum"> 306 </span> : { return __builtin_ldexpf(__x, __exp); } -<span class="lineNum"> 307 </span> : -<span class="lineNum"> 308 </span> : inline long double -<span class="lineNum"> 309 </span> : ldexp(long double __x, int __exp) -<span class="lineNum"> 310 </span> : { return __builtin_ldexpl(__x, __exp); } -<span class="lineNum"> 311 </span> : -<span class="lineNum"> 312 </span> : template<typename _Tp> -<span class="lineNum"> 313 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 314 </span> : double>::__type -<span class="lineNum"> 315 </span> : ldexp(_Tp __x, int __exp) -<span class="lineNum"> 316 </span> : { return __builtin_ldexp(__x, __exp); } -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : using ::log; -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : inline float -<span class="lineNum"> 321 </span><span class="lineCov"> 1 : log(float __x)</span> -<span class="lineNum"> 322 </span><span class="lineCov"> 1 : { return __builtin_logf(__x); }</span> -<span class="lineNum"> 323 </span> : -<span class="lineNum"> 324 </span> : inline long double -<span class="lineNum"> 325 </span> : log(long double __x) -<span class="lineNum"> 326 </span> : { return __builtin_logl(__x); } -<span class="lineNum"> 327 </span> : -<span class="lineNum"> 328 </span> : template<typename _Tp> -<span class="lineNum"> 329 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 330 </span> : double>::__type -<span class="lineNum"> 331 </span> : log(_Tp __x) -<span class="lineNum"> 332 </span> : { return __builtin_log(__x); } -<span class="lineNum"> 333 </span> : -<span class="lineNum"> 334 </span> : using ::log10; -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : inline float -<span class="lineNum"> 337 </span> : log10(float __x) -<span class="lineNum"> 338 </span> : { return __builtin_log10f(__x); } -<span class="lineNum"> 339 </span> : -<span class="lineNum"> 340 </span> : inline long double -<span class="lineNum"> 341 </span> : log10(long double __x) -<span class="lineNum"> 342 </span> : { return __builtin_log10l(__x); } -<span class="lineNum"> 343 </span> : -<span class="lineNum"> 344 </span> : template<typename _Tp> -<span class="lineNum"> 345 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 346 </span> : double>::__type -<span class="lineNum"> 347 </span> : log10(_Tp __x) -<span class="lineNum"> 348 </span> : { return __builtin_log10(__x); } -<span class="lineNum"> 349 </span> : -<span class="lineNum"> 350 </span> : using ::modf; -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : inline float -<span class="lineNum"> 353 </span> : modf(float __x, float* __iptr) -<span class="lineNum"> 354 </span> : { return __builtin_modff(__x, __iptr); } -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : inline long double -<span class="lineNum"> 357 </span> : modf(long double __x, long double* __iptr) -<span class="lineNum"> 358 </span> : { return __builtin_modfl(__x, __iptr); } -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : using ::pow; -<span class="lineNum"> 361 </span> : -<span class="lineNum"> 362 </span> : inline float -<span class="lineNum"> 363 </span> : pow(float __x, float __y) -<span class="lineNum"> 364 </span> : { return __builtin_powf(__x, __y); } -<span class="lineNum"> 365 </span> : -<span class="lineNum"> 366 </span> : inline long double -<span class="lineNum"> 367 </span> : pow(long double __x, long double __y) -<span class="lineNum"> 368 </span> : { return __builtin_powl(__x, __y); } -<span class="lineNum"> 369 </span> : -<span class="lineNum"> 370 </span> : // DR 550. -<span class="lineNum"> 371 </span> : inline double -<span class="lineNum"> 372 </span> : pow(double __x, int __i) -<span class="lineNum"> 373 </span> : { return __builtin_powi(__x, __i); } -<span class="lineNum"> 374 </span> : -<span class="lineNum"> 375 </span> : inline float -<span class="lineNum"> 376 </span> : pow(float __x, int __n) -<span class="lineNum"> 377 </span> : { return __builtin_powif(__x, __n); } -<span class="lineNum"> 378 </span> : -<span class="lineNum"> 379 </span> : inline long double -<span class="lineNum"> 380 </span> : pow(long double __x, int __n) -<span class="lineNum"> 381 </span> : { return __builtin_powil(__x, __n); } -<span class="lineNum"> 382 </span> : -<span class="lineNum"> 383 </span> : template<typename _Tp, typename _Up> -<span class="lineNum"> 384 </span> : inline -<span class="lineNum"> 385 </span> : typename __gnu_cxx::__promote_2< -<span class="lineNum"> 386 </span> : typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value -<span class="lineNum"> 387 </span> : && __is_arithmetic<_Up>::__value, -<span class="lineNum"> 388 </span> : _Tp>::__type, _Up>::__type -<span class="lineNum"> 389 </span> : pow(_Tp __x, _Up __y) -<span class="lineNum"> 390 </span> : { -<span class="lineNum"> 391 </span> : typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; -<span class="lineNum"> 392 </span> : return pow(__type(__x), __type(__y)); -<span class="lineNum"> 393 </span> : } -<span class="lineNum"> 394 </span> : -<span class="lineNum"> 395 </span> : using ::sin; -<span class="lineNum"> 396 </span> : -<span class="lineNum"> 397 </span> : inline float -<span class="lineNum"> 398 </span> : sin(float __x) -<span class="lineNum"> 399 </span> : { return __builtin_sinf(__x); } -<span class="lineNum"> 400 </span> : -<span class="lineNum"> 401 </span> : inline long double -<span class="lineNum"> 402 </span> : sin(long double __x) -<span class="lineNum"> 403 </span> : { return __builtin_sinl(__x); } -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : template<typename _Tp> -<span class="lineNum"> 406 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 407 </span> : double>::__type -<span class="lineNum"> 408 </span> : sin(_Tp __x) -<span class="lineNum"> 409 </span> : { return __builtin_sin(__x); } -<span class="lineNum"> 410 </span> : -<span class="lineNum"> 411 </span> : using ::sinh; -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span> : inline float -<span class="lineNum"> 414 </span> : sinh(float __x) -<span class="lineNum"> 415 </span> : { return __builtin_sinhf(__x); } -<span class="lineNum"> 416 </span> : -<span class="lineNum"> 417 </span> : inline long double -<span class="lineNum"> 418 </span> : sinh(long double __x) -<span class="lineNum"> 419 </span> : { return __builtin_sinhl(__x); } -<span class="lineNum"> 420 </span> : -<span class="lineNum"> 421 </span> : template<typename _Tp> -<span class="lineNum"> 422 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 423 </span> : double>::__type -<span class="lineNum"> 424 </span> : sinh(_Tp __x) -<span class="lineNum"> 425 </span> : { return __builtin_sinh(__x); } -<span class="lineNum"> 426 </span> : -<span class="lineNum"> 427 </span> : using ::sqrt; -<span class="lineNum"> 428 </span> : -<span class="lineNum"> 429 </span> : inline float -<span class="lineNum"> 430 </span> : sqrt(float __x) -<span class="lineNum"> 431 </span> : { return __builtin_sqrtf(__x); } -<span class="lineNum"> 432 </span> : -<span class="lineNum"> 433 </span> : inline long double -<span class="lineNum"> 434 </span> : sqrt(long double __x) -<span class="lineNum"> 435 </span> : { return __builtin_sqrtl(__x); } -<span class="lineNum"> 436 </span> : -<span class="lineNum"> 437 </span> : template<typename _Tp> -<span class="lineNum"> 438 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 439 </span> : double>::__type -<span class="lineNum"> 440 </span> : sqrt(_Tp __x) -<span class="lineNum"> 441 </span> : { return __builtin_sqrt(__x); } -<span class="lineNum"> 442 </span> : -<span class="lineNum"> 443 </span> : using ::tan; -<span class="lineNum"> 444 </span> : -<span class="lineNum"> 445 </span> : inline float -<span class="lineNum"> 446 </span> : tan(float __x) -<span class="lineNum"> 447 </span> : { return __builtin_tanf(__x); } -<span class="lineNum"> 448 </span> : -<span class="lineNum"> 449 </span> : inline long double -<span class="lineNum"> 450 </span> : tan(long double __x) -<span class="lineNum"> 451 </span> : { return __builtin_tanl(__x); } -<span class="lineNum"> 452 </span> : -<span class="lineNum"> 453 </span> : template<typename _Tp> -<span class="lineNum"> 454 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 455 </span> : double>::__type -<span class="lineNum"> 456 </span> : tan(_Tp __x) -<span class="lineNum"> 457 </span> : { return __builtin_tan(__x); } -<span class="lineNum"> 458 </span> : -<span class="lineNum"> 459 </span> : using ::tanh; -<span class="lineNum"> 460 </span> : -<span class="lineNum"> 461 </span> : inline float -<span class="lineNum"> 462 </span> : tanh(float __x) -<span class="lineNum"> 463 </span> : { return __builtin_tanhf(__x); } -<span class="lineNum"> 464 </span> : -<span class="lineNum"> 465 </span> : inline long double -<span class="lineNum"> 466 </span> : tanh(long double __x) -<span class="lineNum"> 467 </span> : { return __builtin_tanhl(__x); } -<span class="lineNum"> 468 </span> : -<span class="lineNum"> 469 </span> : template<typename _Tp> -<span class="lineNum"> 470 </span> : inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, -<span class="lineNum"> 471 </span> : double>::__type -<span class="lineNum"> 472 </span> : tanh(_Tp __x) -<span class="lineNum"> 473 </span> : { return __builtin_tanh(__x); } -<span class="lineNum"> 474 </span> : -<span class="lineNum"> 475 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 476 </span> : -<span class="lineNum"> 477 </span> : #if _GLIBCXX_USE_C99_MATH -<span class="lineNum"> 478 </span> : #if !_GLIBCXX_USE_C99_FP_MACROS_DYNAMIC -<span class="lineNum"> 479 </span> : // These are possible macros imported from C99-land. For strict -<span class="lineNum"> 480 </span> : // conformance, remove possible C99-injected names from the global -<span class="lineNum"> 481 </span> : // namespace, and sequester them in the __gnu_cxx extension namespace. -<span class="lineNum"> 482 </span> : -<span class="lineNum"> 483 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 484 </span> : -<span class="lineNum"> 485 </span> : template<typename _Tp> -<span class="lineNum"> 486 </span> : inline int -<span class="lineNum"> 487 </span> : __capture_fpclassify(_Tp __f) { return fpclassify(__f); } -<span class="lineNum"> 488 </span> : -<span class="lineNum"> 489 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 490 </span> : -<span class="lineNum"> 491 </span> : // Only undefine the C99 FP macros, if actually captured for namespace movement -<span class="lineNum"> 492 </span> : #undef fpclassify -<span class="lineNum"> 493 </span> : #undef isfinite -<span class="lineNum"> 494 </span> : #undef isinf -<span class="lineNum"> 495 </span> : #undef isnan -<span class="lineNum"> 496 </span> : #undef isnormal -<span class="lineNum"> 497 </span> : #undef signbit -<span class="lineNum"> 498 </span> : #undef isgreater -<span class="lineNum"> 499 </span> : #undef isgreaterequal -<span class="lineNum"> 500 </span> : #undef isless -<span class="lineNum"> 501 </span> : #undef islessequal -<span class="lineNum"> 502 </span> : #undef islessgreater -<span class="lineNum"> 503 </span> : #undef isunordered -<span class="lineNum"> 504 </span> : -<span class="lineNum"> 505 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 506 </span> : -<span class="lineNum"> 507 </span> : template<typename _Tp> -<span class="lineNum"> 508 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 509 </span> : int>::__type -<span class="lineNum"> 510 </span> : fpclassify(_Tp __f) -<span class="lineNum"> 511 </span> : { -<span class="lineNum"> 512 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 513 </span> : return ::__gnu_cxx::__capture_fpclassify(__type(__f)); -<span class="lineNum"> 514 </span> : } -<span class="lineNum"> 515 </span> : -<span class="lineNum"> 516 </span> : template<typename _Tp> -<span class="lineNum"> 517 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 518 </span> : int>::__type -<span class="lineNum"> 519 </span> : isfinite(_Tp __f) -<span class="lineNum"> 520 </span> : { -<span class="lineNum"> 521 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 522 </span> : return __builtin_isfinite(__type(__f)); -<span class="lineNum"> 523 </span> : } -<span class="lineNum"> 524 </span> : -<span class="lineNum"> 525 </span> : template<typename _Tp> -<span class="lineNum"> 526 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 527 </span> : int>::__type -<span class="lineNum"> 528 </span> : isinf(_Tp __f) -<span class="lineNum"> 529 </span> : { -<span class="lineNum"> 530 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 531 </span> : return __builtin_isinf(__type(__f)); -<span class="lineNum"> 532 </span> : } -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : template<typename _Tp> -<span class="lineNum"> 535 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 536 </span> : int>::__type -<span class="lineNum"> 537 </span> : isnan(_Tp __f) -<span class="lineNum"> 538 </span> : { -<span class="lineNum"> 539 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 540 </span> : return __builtin_isnan(__type(__f)); -<span class="lineNum"> 541 </span> : } -<span class="lineNum"> 542 </span> : -<span class="lineNum"> 543 </span> : template<typename _Tp> -<span class="lineNum"> 544 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 545 </span> : int>::__type -<span class="lineNum"> 546 </span> : isnormal(_Tp __f) -<span class="lineNum"> 547 </span> : { -<span class="lineNum"> 548 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 549 </span> : return __builtin_isnormal(__type(__f)); -<span class="lineNum"> 550 </span> : } -<span class="lineNum"> 551 </span> : -<span class="lineNum"> 552 </span> : template<typename _Tp> -<span class="lineNum"> 553 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 554 </span> : int>::__type -<span class="lineNum"> 555 </span> : signbit(_Tp __f) -<span class="lineNum"> 556 </span> : { -<span class="lineNum"> 557 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 558 </span> : return __builtin_signbit(__type(__f)); -<span class="lineNum"> 559 </span> : } -<span class="lineNum"> 560 </span> : -<span class="lineNum"> 561 </span> : template<typename _Tp> -<span class="lineNum"> 562 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 563 </span> : int>::__type -<span class="lineNum"> 564 </span> : isgreater(_Tp __f1, _Tp __f2) -<span class="lineNum"> 565 </span> : { -<span class="lineNum"> 566 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 567 </span> : return __builtin_isgreater(__type(__f1), __type(__f2)); -<span class="lineNum"> 568 </span> : } -<span class="lineNum"> 569 </span> : -<span class="lineNum"> 570 </span> : template<typename _Tp> -<span class="lineNum"> 571 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 572 </span> : int>::__type -<span class="lineNum"> 573 </span> : isgreaterequal(_Tp __f1, _Tp __f2) -<span class="lineNum"> 574 </span> : { -<span class="lineNum"> 575 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 576 </span> : return __builtin_isgreaterequal(__type(__f1), __type(__f2)); -<span class="lineNum"> 577 </span> : } -<span class="lineNum"> 578 </span> : -<span class="lineNum"> 579 </span> : template<typename _Tp> -<span class="lineNum"> 580 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 581 </span> : int>::__type -<span class="lineNum"> 582 </span> : isless(_Tp __f1, _Tp __f2) -<span class="lineNum"> 583 </span> : { -<span class="lineNum"> 584 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 585 </span> : return __builtin_isless(__type(__f1), __type(__f2)); -<span class="lineNum"> 586 </span> : } -<span class="lineNum"> 587 </span> : -<span class="lineNum"> 588 </span> : template<typename _Tp> -<span class="lineNum"> 589 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 590 </span> : int>::__type -<span class="lineNum"> 591 </span> : islessequal(_Tp __f1, _Tp __f2) -<span class="lineNum"> 592 </span> : { -<span class="lineNum"> 593 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 594 </span> : return __builtin_islessequal(__type(__f1), __type(__f2)); -<span class="lineNum"> 595 </span> : } -<span class="lineNum"> 596 </span> : -<span class="lineNum"> 597 </span> : template<typename _Tp> -<span class="lineNum"> 598 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 599 </span> : int>::__type -<span class="lineNum"> 600 </span> : islessgreater(_Tp __f1, _Tp __f2) -<span class="lineNum"> 601 </span> : { -<span class="lineNum"> 602 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 603 </span> : return __builtin_islessgreater(__type(__f1), __type(__f2)); -<span class="lineNum"> 604 </span> : } -<span class="lineNum"> 605 </span> : -<span class="lineNum"> 606 </span> : template<typename _Tp> -<span class="lineNum"> 607 </span> : inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, -<span class="lineNum"> 608 </span> : int>::__type -<span class="lineNum"> 609 </span> : isunordered(_Tp __f1, _Tp __f2) -<span class="lineNum"> 610 </span> : { -<span class="lineNum"> 611 </span> : typedef typename __gnu_cxx::__promote<_Tp>::__type __type; -<span class="lineNum"> 612 </span> : return __builtin_isunordered(__type(__f1), __type(__f2)); -<span class="lineNum"> 613 </span> : } -<span class="lineNum"> 614 </span> : -<span class="lineNum"> 615 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 616 </span> : -<span class="lineNum"> 617 </span> : #endif /* _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC */ -<span class="lineNum"> 618 </span> : #endif -<span class="lineNum"> 619 </span> : -<span class="lineNum"> 620 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 621 </span> : # include <bits/cmath.tcc> -<span class="lineNum"> 622 </span> : #endif -<span class="lineNum"> 623 </span> : -<span class="lineNum"> 624 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 625 </span> : # if defined(_GLIBCXX_INCLUDE_AS_TR1) -<span class="lineNum"> 626 </span> : # error C++0x header cannot be included from TR1 header -<span class="lineNum"> 627 </span> : # endif -<span class="lineNum"> 628 </span> : # if defined(_GLIBCXX_INCLUDE_AS_CXX0X) -<span class="lineNum"> 629 </span> : # include <tr1_impl/cmath> -<span class="lineNum"> 630 </span> : # else -<span class="lineNum"> 631 </span> : # define _GLIBCXX_INCLUDE_AS_CXX0X -<span class="lineNum"> 632 </span> : # define _GLIBCXX_BEGIN_NAMESPACE_TR1 -<span class="lineNum"> 633 </span> : # define _GLIBCXX_END_NAMESPACE_TR1 -<span class="lineNum"> 634 </span> : # define _GLIBCXX_TR1 -<span class="lineNum"> 635 </span> : # include <tr1_impl/cmath> -<span class="lineNum"> 636 </span> : # undef _GLIBCXX_TR1 -<span class="lineNum"> 637 </span> : # undef _GLIBCXX_END_NAMESPACE_TR1 -<span class="lineNum"> 638 </span> : # undef _GLIBCXX_BEGIN_NAMESPACE_TR1 -<span class="lineNum"> 639 </span> : # undef _GLIBCXX_INCLUDE_AS_CXX0X -<span class="lineNum"> 640 </span> : # endif -<span class="lineNum"> 641 </span> : #endif -<span class="lineNum"> 642 </span> : -<span class="lineNum"> 643 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/exception.gcov.html b/rep/usr/include/c++/4.3/exception.gcov.html deleted file mode 100644 index 70fe998..0000000 --- a/rep/usr/include/c++/4.3/exception.gcov.html +++ /dev/null @@ -1,202 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/exception</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - exception</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">50.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Exception Handling support header for -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, -<span class="lineNum"> 4 </span> : // 2004, 2005, 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of GCC. -<span class="lineNum"> 8 </span> : // -<span class="lineNum"> 9 </span> : // GCC is free software; you can redistribute it and/or modify -<span class="lineNum"> 10 </span> : // it under the terms of the GNU General Public License as published by -<span class="lineNum"> 11 </span> : // the Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 12 </span> : // any later version. -<span class="lineNum"> 13 </span> : // -<span class="lineNum"> 14 </span> : // GCC is distributed in the hope that it will be useful, -<span class="lineNum"> 15 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 16 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 17 </span> : // GNU General Public License for more details. -<span class="lineNum"> 18 </span> : // -<span class="lineNum"> 19 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 20 </span> : // along with GCC; see the file COPYING. If not, write to -<span class="lineNum"> 21 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 22 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 25 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 26 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 27 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 28 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 30 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 31 </span> : // the GNU General Public License. -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /** @file exception -<span class="lineNum"> 34 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 35 </span> : */ -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : #ifndef __EXCEPTION__ -<span class="lineNum"> 38 </span> : #define __EXCEPTION__ -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #pragma GCC visibility push(default) -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #include <bits/c++config.h> -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : extern "C++" { -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : namespace std -<span class="lineNum"> 47 </span> : { -<span class="lineNum"> 48 </span> : /** -<span class="lineNum"> 49 </span> : * @brief Base class for all library exceptions. -<span class="lineNum"> 50 </span> : * -<span class="lineNum"> 51 </span> : * This is the base class for all exceptions thrown by the standard -<span class="lineNum"> 52 </span> : * library, and by certain language expressions. You are free to derive -<span class="lineNum"> 53 </span> : * your own %exception classes, or use a different hierarchy, or to -<span class="lineNum"> 54 </span> : * throw non-class data (e.g., fundamental types). -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : class exception -<span class="lineNum"> 57 </span><span class="lineNoCov"> 0 : {</span> -<span class="lineNum"> 58 </span> : public: -<span class="lineNum"> 59 </span><span class="lineCov"> 6 : exception() throw() { }</span> -<span class="lineNum"> 60 </span> : virtual ~exception() throw(); -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : /** Returns a C-style character string describing the general cause -<span class="lineNum"> 63 </span> : * of the current error. */ -<span class="lineNum"> 64 </span> : virtual const char* what() const throw(); -<span class="lineNum"> 65 </span> : }; -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : /** If an %exception is thrown which is not listed in a function's -<span class="lineNum"> 68 </span> : * %exception specification, one of these may be thrown. */ -<span class="lineNum"> 69 </span> : class bad_exception : public exception -<span class="lineNum"> 70 </span> : { -<span class="lineNum"> 71 </span> : public: -<span class="lineNum"> 72 </span> : bad_exception() throw() { } -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : // This declaration is not useless: -<span class="lineNum"> 75 </span> : // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 -<span class="lineNum"> 76 </span> : virtual ~bad_exception() throw(); -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : // See comment in eh_exception.cc. -<span class="lineNum"> 79 </span> : virtual const char* what() const throw(); -<span class="lineNum"> 80 </span> : }; -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : /// If you write a replacement %terminate handler, it must be of this type. -<span class="lineNum"> 83 </span> : typedef void (*terminate_handler) (); -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : /// If you write a replacement %unexpected handler, it must be of this type. -<span class="lineNum"> 86 </span> : typedef void (*unexpected_handler) (); -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : /// Takes a new handler function as an argument, returns the old function. -<span class="lineNum"> 89 </span> : terminate_handler set_terminate(terminate_handler) throw(); -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : /** The runtime will call this function if %exception handling must be -<span class="lineNum"> 92 </span> : * abandoned for any reason. It can also be called by the user. */ -<span class="lineNum"> 93 </span> : void terminate() __attribute__ ((__noreturn__)); -<span class="lineNum"> 94 </span> : -<span class="lineNum"> 95 </span> : /// Takes a new handler function as an argument, returns the old function. -<span class="lineNum"> 96 </span> : unexpected_handler set_unexpected(unexpected_handler) throw(); -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : /** The runtime will call this function if an %exception is thrown which -<span class="lineNum"> 99 </span> : * violates the function's %exception specification. */ -<span class="lineNum"> 100 </span> : void unexpected() __attribute__ ((__noreturn__)); -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : /** [18.6.4]/1: "Returns true after completing evaluation of a -<span class="lineNum"> 103 </span> : * throw-expression until either completing initialization of the -<span class="lineNum"> 104 </span> : * exception-declaration in the matching handler or entering @c unexpected() -<span class="lineNum"> 105 </span> : * due to the throw; or after entering @c terminate() for any reason -<span class="lineNum"> 106 </span> : * other than an explicit call to @c terminate(). [Note: This includes -<span class="lineNum"> 107 </span> : * stack unwinding [15.2]. end note]" -<span class="lineNum"> 108 </span> : * -<span class="lineNum"> 109 </span> : * 2: "When @c uncaught_exception() is true, throwing an %exception can -<span class="lineNum"> 110 </span> : * result in a call of @c terminate() (15.5.1)." -<span class="lineNum"> 111 </span> : */ -<span class="lineNum"> 112 </span> : bool uncaught_exception() throw(); -<span class="lineNum"> 113 </span> : } // namespace std -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : /** A replacement for the standard terminate_handler which prints more -<span class="lineNum"> 118 </span> : information about the terminating exception (if any) on stderr. Call -<span class="lineNum"> 119 </span> : @code -<span class="lineNum"> 120 </span> : std::set_terminate (__gnu_cxx::__verbose_terminate_handler) -<span class="lineNum"> 121 </span> : @endcode -<span class="lineNum"> 122 </span> : to use. For more info, see -<span class="lineNum"> 123 </span> : http://gcc.gnu.org/onlinedocs/libstdc++/19_diagnostics/howto.html#4 -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : In 3.4 and later, this is on by default. -<span class="lineNum"> 126 </span> : */ -<span class="lineNum"> 127 </span> : void __verbose_terminate_handler (); -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : } // extern "C++" -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : #pragma GCC visibility pop -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/ext/atomicity.h.gcov.html b/rep/usr/include/c++/4.3/ext/atomicity.h.gcov.html deleted file mode 100644 index 5ba11ee..0000000 --- a/rep/usr/include/c++/4.3/ext/atomicity.h.gcov.html +++ /dev/null @@ -1,185 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/ext/atomicity.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/ext</a> - atomicity.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Support for atomic operations -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2004, 2005, 2006 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 7 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 8 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 9 </span> : // any later version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : // GNU General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 17 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 18 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 19 </span> : // USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 22 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 23 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 24 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 25 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 26 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 27 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** @file atomicity.h -<span class="lineNum"> 31 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 32 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : #ifndef _GLIBCXX_ATOMICITY_H -<span class="lineNum"> 36 </span> : #define _GLIBCXX_ATOMICITY_H 1 -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #include <bits/c++config.h> -<span class="lineNum"> 39 </span> : #include <bits/gthr.h> -<span class="lineNum"> 40 </span> : #include <bits/atomic_word.h> -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : // Functions for portable atomic access. -<span class="lineNum"> 45 </span> : // To abstract locking primitives across all thread policies, use: -<span class="lineNum"> 46 </span> : // __exchange_and_add_dispatch -<span class="lineNum"> 47 </span> : // __atomic_add_dispatch -<span class="lineNum"> 48 </span> : #ifdef _GLIBCXX_ATOMIC_BUILTINS -<span class="lineNum"> 49 </span> : static inline _Atomic_word -<span class="lineNum"> 50 </span><span class="lineNoCov"> 0 : __exchange_and_add(volatile _Atomic_word* __mem, int __val)</span> -<span class="lineNum"> 51 </span><span class="lineNoCov"> 0 : { return __sync_fetch_and_add(__mem, __val); }</span> -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : static inline void -<span class="lineNum"> 54 </span> : __atomic_add(volatile _Atomic_word* __mem, int __val) -<span class="lineNum"> 55 </span> : { __sync_fetch_and_add(__mem, __val); } -<span class="lineNum"> 56 </span> : #else -<span class="lineNum"> 57 </span> : _Atomic_word -<span class="lineNum"> 58 </span> : __attribute__ ((__unused__)) -<span class="lineNum"> 59 </span> : __exchange_and_add(volatile _Atomic_word*, int); -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : void -<span class="lineNum"> 62 </span> : __attribute__ ((__unused__)) -<span class="lineNum"> 63 </span> : __atomic_add(volatile _Atomic_word*, int); -<span class="lineNum"> 64 </span> : #endif -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : static inline _Atomic_word -<span class="lineNum"> 67 </span><span class="lineNoCov"> 0 : __exchange_and_add_single(_Atomic_word* __mem, int __val)</span> -<span class="lineNum"> 68 </span> : { -<span class="lineNum"> 69 </span><span class="lineNoCov"> 0 : _Atomic_word __result = *__mem;</span> -<span class="lineNum"> 70 </span><span class="lineNoCov"> 0 : *__mem += __val;</span> -<span class="lineNum"> 71 </span><span class="lineNoCov"> 0 : return __result;</span> -<span class="lineNum"> 72 </span> : } -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : static inline void -<span class="lineNum"> 75 </span> : __atomic_add_single(_Atomic_word* __mem, int __val) -<span class="lineNum"> 76 </span> : { *__mem += __val; } -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : static inline _Atomic_word -<span class="lineNum"> 79 </span> : __attribute__ ((__unused__)) -<span class="lineNum"> 80 </span><span class="lineNoCov"> 0 : __exchange_and_add_dispatch(_Atomic_word* __mem, int __val)</span> -<span class="lineNum"> 81 </span> : { -<span class="lineNum"> 82 </span> : #ifdef __GTHREADS -<span class="lineNum"> 83 </span><span class="lineNoCov"> 0 : if (__gthread_active_p())</span> -<span class="lineNum"> 84 </span><span class="lineNoCov"> 0 : return __exchange_and_add(__mem, __val);</span> -<span class="lineNum"> 85 </span> : else -<span class="lineNum"> 86 </span><span class="lineNoCov"> 0 : return __exchange_and_add_single(__mem, __val);</span> -<span class="lineNum"> 87 </span> : #else -<span class="lineNum"> 88 </span> : return __exchange_and_add_single(__mem, __val); -<span class="lineNum"> 89 </span> : #endif -<span class="lineNum"> 90 </span> : } -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : static inline void -<span class="lineNum"> 93 </span> : __attribute__ ((__unused__)) -<span class="lineNum"> 94 </span> : __atomic_add_dispatch(_Atomic_word* __mem, int __val) -<span class="lineNum"> 95 </span> : { -<span class="lineNum"> 96 </span> : #ifdef __GTHREADS -<span class="lineNum"> 97 </span> : if (__gthread_active_p()) -<span class="lineNum"> 98 </span> : __atomic_add(__mem, __val); -<span class="lineNum"> 99 </span> : else -<span class="lineNum"> 100 </span> : __atomic_add_single(__mem, __val); -<span class="lineNum"> 101 </span> : #else -<span class="lineNum"> 102 </span> : __atomic_add_single(__mem, __val); -<span class="lineNum"> 103 </span> : #endif -<span class="lineNum"> 104 </span> : } -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : // Even if the CPU doesn't need a memory barrier, we need to ensure -<span class="lineNum"> 109 </span> : // that the compiler doesn't reorder memory accesses across the -<span class="lineNum"> 110 </span> : // barriers. -<span class="lineNum"> 111 </span> : #ifndef _GLIBCXX_READ_MEM_BARRIER -<span class="lineNum"> 112 </span> : #define _GLIBCXX_READ_MEM_BARRIER __asm __volatile ("":::"memory") -<span class="lineNum"> 113 </span> : #endif -<span class="lineNum"> 114 </span> : #ifndef _GLIBCXX_WRITE_MEM_BARRIER -<span class="lineNum"> 115 </span> : #define _GLIBCXX_WRITE_MEM_BARRIER __asm __volatile ("":::"memory") -<span class="lineNum"> 116 </span> : #endif -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/ext/index.html b/rep/usr/include/c++/4.3/ext/index.html deleted file mode 100644 index 3d42502..0000000 --- a/rep/usr/include/c++/4.3/ext/index.html +++ /dev/null @@ -1,101 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/ext</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/c++/4.3/ext</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">28</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">53.6 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">15</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="atomicity.h.gcov.html">atomicity.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 10 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="new_allocator.h.gcov.html">new_allocator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=93 height=10 alt="92.9%"><img src="../../../../../snow.png" width=7 height=10 alt="92.9%"></td></tr></table> - </td> - <td class="coverPerHi">92.9 %</td> - <td class="coverNumHi">13 / 14 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="type_traits.h.gcov.html">type_traits.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table> - </td> - <td class="coverPerHi">50.0 %</td> - <td class="coverNumHi">2 / 4 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/ext/new_allocator.h.gcov.html b/rep/usr/include/c++/4.3/ext/new_allocator.h.gcov.html deleted file mode 100644 index 1111116..0000000 --- a/rep/usr/include/c++/4.3/ext/new_allocator.h.gcov.html +++ /dev/null @@ -1,200 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/ext/new_allocator.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/ext</a> - new_allocator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">14</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">92.9 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">13</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Allocator that wraps operator new -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 7 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 8 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 9 </span> : // any later version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : // GNU General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 17 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 18 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 19 </span> : // USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 22 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 23 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 24 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 25 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 26 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 27 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** @file ext/new_allocator.h -<span class="lineNum"> 31 </span> : * This file is a GNU extension to the Standard C++ Library. -<span class="lineNum"> 32 </span> : */ -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : #ifndef _NEW_ALLOCATOR_H -<span class="lineNum"> 35 </span> : #define _NEW_ALLOCATOR_H 1 -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : #include <new> -<span class="lineNum"> 38 </span> : #include <bits/functexcept.h> -<span class="lineNum"> 39 </span> : #include <bits/stl_move.h> -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : using std::size_t; -<span class="lineNum"> 44 </span> : using std::ptrdiff_t; -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : /** -<span class="lineNum"> 47 </span> : * @brief An allocator that uses global new, as per [20.4]. -<span class="lineNum"> 48 </span> : * -<span class="lineNum"> 49 </span> : * This is precisely the allocator defined in the C++ Standard. -<span class="lineNum"> 50 </span> : * - all allocation calls operator new -<span class="lineNum"> 51 </span> : * - all deallocation calls operator delete -<span class="lineNum"> 52 </span> : */ -<span class="lineNum"> 53 </span> : template<typename _Tp> -<span class="lineNum"> 54 </span> : class new_allocator -<span class="lineNum"> 55 </span> : { -<span class="lineNum"> 56 </span> : public: -<span class="lineNum"> 57 </span> : typedef size_t size_type; -<span class="lineNum"> 58 </span> : typedef ptrdiff_t difference_type; -<span class="lineNum"> 59 </span> : typedef _Tp* pointer; -<span class="lineNum"> 60 </span> : typedef const _Tp* const_pointer; -<span class="lineNum"> 61 </span> : typedef _Tp& reference; -<span class="lineNum"> 62 </span> : typedef const _Tp& const_reference; -<span class="lineNum"> 63 </span> : typedef _Tp value_type; -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : template<typename _Tp1> -<span class="lineNum"> 66 </span> : struct rebind -<span class="lineNum"> 67 </span> : { typedef new_allocator<_Tp1> other; }; -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span><span class="lineCov"> 11574945 : new_allocator() throw() { }</span> -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span><span class="lineCov"> 934618 : new_allocator(const new_allocator&) throw() { }</span> -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : template<typename _Tp1> -<span class="lineNum"> 74 </span> : new_allocator(const new_allocator<_Tp1>&) throw() { } -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span><span class="lineCov"> 12615289 : ~new_allocator() throw() { }</span> -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : pointer -<span class="lineNum"> 79 </span> : address(reference __x) const { return &__x; } -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : const_pointer -<span class="lineNum"> 82 </span> : address(const_reference __x) const { return &__x; } -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : // NB: __n is permitted to be 0. The C++ standard says nothing -<span class="lineNum"> 85 </span> : // about what the return value is when __n == 0. -<span class="lineNum"> 86 </span> : pointer -<span class="lineNum"> 87 </span><span class="lineCov"> 5665535 : allocate(size_type __n, const void* = 0)</span> -<span class="lineNum"> 88 </span> : { -<span class="lineNum"> 89 </span><span class="lineCov"> 5665535 : if (__builtin_expect(__n > this->max_size(), false))</span> -<span class="lineNum"> 90 </span><span class="lineNoCov"> 0 : std::__throw_bad_alloc();</span> -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span><span class="lineCov"> 5665535 : return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));</span> -<span class="lineNum"> 93 </span> : } -<span class="lineNum"> 94 </span> : -<span class="lineNum"> 95 </span> : // __p is not permitted to be a null pointer. -<span class="lineNum"> 96 </span> : void -<span class="lineNum"> 97 </span><span class="lineCov"> 5665395 : deallocate(pointer __p, size_type)</span> -<span class="lineNum"> 98 </span><span class="lineCov"> 5665395 : { ::operator delete(__p); }</span> -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : size_type -<span class="lineNum"> 101 </span><span class="lineCov"> 5706963 : max_size() const throw() </span> -<span class="lineNum"> 102 </span><span class="lineCov"> 5706963 : { return size_t(-1) / sizeof(_Tp); }</span> -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 105 </span> : // 402. wrong new expression in [some_] allocator::construct -<span class="lineNum"> 106 </span> : void -<span class="lineNum"> 107 </span><span class="lineCov"> 5786312 : construct(pointer __p, const _Tp& __val) </span> -<span class="lineNum"> 108 </span><span class="lineCov"> 5786312 : { ::new((void *)__p) _Tp(__val); }</span> -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 111 </span> : template<typename... _Args> -<span class="lineNum"> 112 </span> : void -<span class="lineNum"> 113 </span> : construct(pointer __p, _Args&&... __args) -<span class="lineNum"> 114 </span> : { ::new((void *)__p) _Tp(std::forward<_Args>(__args)...); } -<span class="lineNum"> 115 </span> : #endif -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : void -<span class="lineNum"> 118 </span><span class="lineCov"> 5644734 : destroy(pointer __p) { __p->~_Tp(); }</span> -<span class="lineNum"> 119 </span> : }; -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : template<typename _Tp> -<span class="lineNum"> 122 </span> : inline bool -<span class="lineNum"> 123 </span> : operator==(const new_allocator<_Tp>&, const new_allocator<_Tp>&) -<span class="lineNum"> 124 </span> : { return true; } -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : template<typename _Tp> -<span class="lineNum"> 127 </span> : inline bool -<span class="lineNum"> 128 </span> : operator!=(const new_allocator<_Tp>&, const new_allocator<_Tp>&) -<span class="lineNum"> 129 </span> : { return false; } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/ext/type_traits.h.gcov.html b/rep/usr/include/c++/4.3/ext/type_traits.h.gcov.html deleted file mode 100644 index 2b9b989..0000000 --- a/rep/usr/include/c++/4.3/ext/type_traits.h.gcov.html +++ /dev/null @@ -1,277 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/ext/type_traits.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/ext</a> - type_traits.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">50.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the terms -<span class="lineNum"> 7 </span> : // of the GNU General Public License as published by the Free Software -<span class="lineNum"> 8 </span> : // Foundation; either version 2, or (at your option) any later -<span class="lineNum"> 9 </span> : // version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, but -<span class="lineNum"> 12 </span> : // WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 14 </span> : // General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 17 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 18 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 19 </span> : // USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free -<span class="lineNum"> 22 </span> : // software library without restriction. Specifically, if other files -<span class="lineNum"> 23 </span> : // instantiate templates or use macros or inline functions from this -<span class="lineNum"> 24 </span> : // file, or you compile this file and link it with other files to -<span class="lineNum"> 25 </span> : // produce an executable, this file does not by itself cause the -<span class="lineNum"> 26 </span> : // resulting executable to be covered by the GNU General Public -<span class="lineNum"> 27 </span> : // License. This exception does not however invalidate any other -<span class="lineNum"> 28 </span> : // reasons why the executable file might be covered by the GNU General -<span class="lineNum"> 29 </span> : // Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /** @file ext/type_traits.h -<span class="lineNum"> 32 </span> : * This file is a GNU extension to the Standard C++ Library. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : #ifndef _EXT_TYPE_TRAITS -<span class="lineNum"> 36 </span> : #define _EXT_TYPE_TRAITS 1 -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #pragma GCC system_header -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #include <bits/c++config.h> -<span class="lineNum"> 41 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : // Define a nested type if some predicate holds. -<span class="lineNum"> 46 </span> : template<bool, typename> -<span class="lineNum"> 47 </span> : struct __enable_if -<span class="lineNum"> 48 </span> : { }; -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : template<typename _Tp> -<span class="lineNum"> 51 </span> : struct __enable_if<true, _Tp> -<span class="lineNum"> 52 </span> : { typedef _Tp __type; }; -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : // Conditional expression for types. If true, first, if false, second. -<span class="lineNum"> 56 </span> : template<bool _Cond, typename _Iftrue, typename _Iffalse> -<span class="lineNum"> 57 </span> : struct __conditional_type -<span class="lineNum"> 58 </span> : { typedef _Iftrue __type; }; -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : template<typename _Iftrue, typename _Iffalse> -<span class="lineNum"> 61 </span> : struct __conditional_type<false, _Iftrue, _Iffalse> -<span class="lineNum"> 62 </span> : { typedef _Iffalse __type; }; -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : // Given an integral builtin type, return the corresponding unsigned type. -<span class="lineNum"> 66 </span> : template<typename _Tp> -<span class="lineNum"> 67 </span> : struct __add_unsigned -<span class="lineNum"> 68 </span> : { -<span class="lineNum"> 69 </span> : private: -<span class="lineNum"> 70 </span> : typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : public: -<span class="lineNum"> 73 </span> : typedef typename __if_type::__type __type; -<span class="lineNum"> 74 </span> : }; -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : template<> -<span class="lineNum"> 77 </span> : struct __add_unsigned<char> -<span class="lineNum"> 78 </span> : { typedef unsigned char __type; }; -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : template<> -<span class="lineNum"> 81 </span> : struct __add_unsigned<signed char> -<span class="lineNum"> 82 </span> : { typedef unsigned char __type; }; -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : template<> -<span class="lineNum"> 85 </span> : struct __add_unsigned<short> -<span class="lineNum"> 86 </span> : { typedef unsigned short __type; }; -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : template<> -<span class="lineNum"> 89 </span> : struct __add_unsigned<int> -<span class="lineNum"> 90 </span> : { typedef unsigned int __type; }; -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : template<> -<span class="lineNum"> 93 </span> : struct __add_unsigned<long> -<span class="lineNum"> 94 </span> : { typedef unsigned long __type; }; -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : template<> -<span class="lineNum"> 97 </span> : struct __add_unsigned<long long> -<span class="lineNum"> 98 </span> : { typedef unsigned long long __type; }; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : // Declare but don't define. -<span class="lineNum"> 101 </span> : template<> -<span class="lineNum"> 102 </span> : struct __add_unsigned<bool>; -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : template<> -<span class="lineNum"> 105 </span> : struct __add_unsigned<wchar_t>; -<span class="lineNum"> 106 </span> : -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : // Given an integral builtin type, return the corresponding signed type. -<span class="lineNum"> 109 </span> : template<typename _Tp> -<span class="lineNum"> 110 </span> : struct __remove_unsigned -<span class="lineNum"> 111 </span> : { -<span class="lineNum"> 112 </span> : private: -<span class="lineNum"> 113 </span> : typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : public: -<span class="lineNum"> 116 </span> : typedef typename __if_type::__type __type; -<span class="lineNum"> 117 </span> : }; -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : template<> -<span class="lineNum"> 120 </span> : struct __remove_unsigned<char> -<span class="lineNum"> 121 </span> : { typedef signed char __type; }; -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : template<> -<span class="lineNum"> 124 </span> : struct __remove_unsigned<unsigned char> -<span class="lineNum"> 125 </span> : { typedef signed char __type; }; -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : template<> -<span class="lineNum"> 128 </span> : struct __remove_unsigned<unsigned short> -<span class="lineNum"> 129 </span> : { typedef short __type; }; -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : template<> -<span class="lineNum"> 132 </span> : struct __remove_unsigned<unsigned int> -<span class="lineNum"> 133 </span> : { typedef int __type; }; -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : template<> -<span class="lineNum"> 136 </span> : struct __remove_unsigned<unsigned long> -<span class="lineNum"> 137 </span> : { typedef long __type; }; -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : template<> -<span class="lineNum"> 140 </span> : struct __remove_unsigned<unsigned long long> -<span class="lineNum"> 141 </span> : { typedef long long __type; }; -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : // Declare but don't define. -<span class="lineNum"> 144 </span> : template<> -<span class="lineNum"> 145 </span> : struct __remove_unsigned<bool>; -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : template<> -<span class="lineNum"> 148 </span> : struct __remove_unsigned<wchar_t>; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span> : // For use in string and vstring. -<span class="lineNum"> 152 </span> : template<typename _Type> -<span class="lineNum"> 153 </span> : inline bool -<span class="lineNum"> 154 </span><span class="lineNoCov"> 0 : __is_null_pointer(_Type* __ptr)</span> -<span class="lineNum"> 155 </span><span class="lineNoCov"> 0 : { return __ptr == 0; }</span> -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : template<typename _Type> -<span class="lineNum"> 158 </span> : inline bool -<span class="lineNum"> 159 </span><span class="lineCov"> 1287 : __is_null_pointer(_Type)</span> -<span class="lineNum"> 160 </span><span class="lineCov"> 1287 : { return false; }</span> -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : // For complex and cmath -<span class="lineNum"> 164 </span> : template<typename _Tp, bool = std::__is_integer<_Tp>::__value> -<span class="lineNum"> 165 </span> : struct __promote -<span class="lineNum"> 166 </span> : { typedef double __type; }; -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : template<typename _Tp> -<span class="lineNum"> 169 </span> : struct __promote<_Tp, false> -<span class="lineNum"> 170 </span> : { typedef _Tp __type; }; -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : template<typename _Tp, typename _Up> -<span class="lineNum"> 173 </span> : struct __promote_2 -<span class="lineNum"> 174 </span> : { -<span class="lineNum"> 175 </span> : private: -<span class="lineNum"> 176 </span> : typedef typename __promote<_Tp>::__type __type1; -<span class="lineNum"> 177 </span> : typedef typename __promote<_Up>::__type __type2; -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : public: -<span class="lineNum"> 180 </span> : typedef __typeof__(__type1() + __type2()) __type; -<span class="lineNum"> 181 </span> : }; -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : template<typename _Tp, typename _Up, typename _Vp> -<span class="lineNum"> 184 </span> : struct __promote_3 -<span class="lineNum"> 185 </span> : { -<span class="lineNum"> 186 </span> : private: -<span class="lineNum"> 187 </span> : typedef typename __promote<_Tp>::__type __type1; -<span class="lineNum"> 188 </span> : typedef typename __promote<_Up>::__type __type2; -<span class="lineNum"> 189 </span> : typedef typename __promote<_Vp>::__type __type3; -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : public: -<span class="lineNum"> 192 </span> : typedef __typeof__(__type1() + __type2() + __type3()) __type; -<span class="lineNum"> 193 </span> : }; -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : template<typename _Tp, typename _Up, typename _Vp, typename _Wp> -<span class="lineNum"> 196 </span> : struct __promote_4 -<span class="lineNum"> 197 </span> : { -<span class="lineNum"> 198 </span> : private: -<span class="lineNum"> 199 </span> : typedef typename __promote<_Tp>::__type __type1; -<span class="lineNum"> 200 </span> : typedef typename __promote<_Up>::__type __type2; -<span class="lineNum"> 201 </span> : typedef typename __promote<_Vp>::__type __type3; -<span class="lineNum"> 202 </span> : typedef typename __promote<_Wp>::__type __type4; -<span class="lineNum"> 203 </span> : -<span class="lineNum"> 204 </span> : public: -<span class="lineNum"> 205 </span> : typedef __typeof__(__type1() + __type2() + __type3() + __type4()) __type; -<span class="lineNum"> 206 </span> : }; -<span class="lineNum"> 207 </span> : -<span class="lineNum"> 208 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 209 </span> : -<span class="lineNum"> 210 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/fstream.gcov.html b/rep/usr/include/c++/4.3/fstream.gcov.html deleted file mode 100644 index 9432d72..0000000 --- a/rep/usr/include/c++/4.3/fstream.gcov.html +++ /dev/null @@ -1,853 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/fstream</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - fstream</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">38</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // File based streams -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file fstream -<span class="lineNum"> 33 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : // -<span class="lineNum"> 37 </span> : // ISO C++ 14882: 27.8 File-based streams -<span class="lineNum"> 38 </span> : // -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #ifndef _GLIBCXX_FSTREAM -<span class="lineNum"> 41 </span> : #define _GLIBCXX_FSTREAM 1 -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #pragma GCC system_header -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #include <istream> -<span class="lineNum"> 46 </span> : #include <ostream> -<span class="lineNum"> 47 </span> : #include <bits/codecvt.h> -<span class="lineNum"> 48 </span> : #include <cstdio> // For BUFSIZ -<span class="lineNum"> 49 </span> : #include <bits/basic_file.h> // For __basic_file, __c_lock -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : // [27.8.1.1] template class basic_filebuf -<span class="lineNum"> 54 </span> : /** -<span class="lineNum"> 55 </span> : * @brief The actual work of input and output (for files). -<span class="lineNum"> 56 </span> : * -<span class="lineNum"> 57 </span> : * This class associates both its input and output sequence with an -<span class="lineNum"> 58 </span> : * external disk file, and maintains a joint file position for both -<span class="lineNum"> 59 </span> : * sequences. Many of its semantics are described in terms of similar -<span class="lineNum"> 60 </span> : * behavior in the Standard C Library's @c FILE streams. -<span class="lineNum"> 61 </span> : */ -<span class="lineNum"> 62 </span> : // Requirements on traits_type, specific to this class: -<span class="lineNum"> 63 </span> : // traits_type::pos_type must be fpos<traits_type::state_type> -<span class="lineNum"> 64 </span> : // traits_type::off_type must be streamoff -<span class="lineNum"> 65 </span> : // traits_type::state_type must be Assignable and DefaultConstructible, -<span class="lineNum"> 66 </span> : // and traits_type::state_type() must be the initial state for codecvt. -<span class="lineNum"> 67 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 68 </span> : class basic_filebuf : public basic_streambuf<_CharT, _Traits> -<span class="lineNum"> 69 </span> : { -<span class="lineNum"> 70 </span> : public: -<span class="lineNum"> 71 </span> : // Types: -<span class="lineNum"> 72 </span> : typedef _CharT char_type; -<span class="lineNum"> 73 </span> : typedef _Traits traits_type; -<span class="lineNum"> 74 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 75 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 76 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : typedef basic_streambuf<char_type, traits_type> __streambuf_type; -<span class="lineNum"> 79 </span> : typedef basic_filebuf<char_type, traits_type> __filebuf_type; -<span class="lineNum"> 80 </span> : typedef __basic_file<char> __file_type; -<span class="lineNum"> 81 </span> : typedef typename traits_type::state_type __state_type; -<span class="lineNum"> 82 </span> : typedef codecvt<char_type, char, __state_type> __codecvt_type; -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : friend class ios_base; // For sync_with_stdio. -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : protected: -<span class="lineNum"> 87 </span> : // Data Members: -<span class="lineNum"> 88 </span> : // MT lock inherited from libio or other low-level io library. -<span class="lineNum"> 89 </span> : __c_lock _M_lock; -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : // External buffer. -<span class="lineNum"> 92 </span> : __file_type _M_file; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : /// Place to stash in || out || in | out settings for current filebuf. -<span class="lineNum"> 95 </span> : ios_base::openmode _M_mode; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : // Beginning state type for codecvt. -<span class="lineNum"> 98 </span> : __state_type _M_state_beg; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : // During output, the state that corresponds to pptr(), -<span class="lineNum"> 101 </span> : // during input, the state that corresponds to egptr() and -<span class="lineNum"> 102 </span> : // _M_ext_next. -<span class="lineNum"> 103 </span> : __state_type _M_state_cur; -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : // Not used for output. During input, the state that corresponds -<span class="lineNum"> 106 </span> : // to eback() and _M_ext_buf. -<span class="lineNum"> 107 </span> : __state_type _M_state_last; -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : /// Pointer to the beginning of internal buffer. -<span class="lineNum"> 110 </span> : char_type* _M_buf; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : /** -<span class="lineNum"> 113 </span> : * Actual size of internal buffer. This number is equal to the size -<span class="lineNum"> 114 </span> : * of the put area + 1 position, reserved for the overflow char of -<span class="lineNum"> 115 </span> : * a full area. -<span class="lineNum"> 116 </span> : */ -<span class="lineNum"> 117 </span> : size_t _M_buf_size; -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : // Set iff _M_buf is allocated memory from _M_allocate_internal_buffer. -<span class="lineNum"> 120 </span> : bool _M_buf_allocated; -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : /** -<span class="lineNum"> 123 </span> : * _M_reading == false && _M_writing == false for 'uncommitted' mode; -<span class="lineNum"> 124 </span> : * _M_reading == true for 'read' mode; -<span class="lineNum"> 125 </span> : * _M_writing == true for 'write' mode; -<span class="lineNum"> 126 </span> : * -<span class="lineNum"> 127 </span> : * NB: _M_reading == true && _M_writing == true is unused. -<span class="lineNum"> 128 </span> : */ -<span class="lineNum"> 129 </span> : bool _M_reading; -<span class="lineNum"> 130 </span> : bool _M_writing; -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : //@{ -<span class="lineNum"> 133 </span> : /** -<span class="lineNum"> 134 </span> : * Necessary bits for putback buffer management. -<span class="lineNum"> 135 </span> : * -<span class="lineNum"> 136 </span> : * @note pbacks of over one character are not currently supported. -<span class="lineNum"> 137 </span> : */ -<span class="lineNum"> 138 </span> : char_type _M_pback; -<span class="lineNum"> 139 </span> : char_type* _M_pback_cur_save; -<span class="lineNum"> 140 </span> : char_type* _M_pback_end_save; -<span class="lineNum"> 141 </span> : bool _M_pback_init; -<span class="lineNum"> 142 </span> : //@} -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : // Cached codecvt facet. -<span class="lineNum"> 145 </span> : const __codecvt_type* _M_codecvt; -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : /** -<span class="lineNum"> 148 </span> : * Buffer for external characters. Used for input when -<span class="lineNum"> 149 </span> : * codecvt::always_noconv() == false. When valid, this corresponds -<span class="lineNum"> 150 </span> : * to eback(). -<span class="lineNum"> 151 </span> : */ -<span class="lineNum"> 152 </span> : char* _M_ext_buf; -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : /** -<span class="lineNum"> 155 </span> : * Size of buffer held by _M_ext_buf. -<span class="lineNum"> 156 </span> : */ -<span class="lineNum"> 157 </span> : streamsize _M_ext_buf_size; -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : /** -<span class="lineNum"> 160 </span> : * Pointers into the buffer held by _M_ext_buf that delimit a -<span class="lineNum"> 161 </span> : * subsequence of bytes that have been read but not yet converted. -<span class="lineNum"> 162 </span> : * When valid, _M_ext_next corresponds to egptr(). -<span class="lineNum"> 163 </span> : */ -<span class="lineNum"> 164 </span> : const char* _M_ext_next; -<span class="lineNum"> 165 </span> : char* _M_ext_end; -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /** -<span class="lineNum"> 168 </span> : * Initializes pback buffers, and moves normal buffers to safety. -<span class="lineNum"> 169 </span> : * Assumptions: -<span class="lineNum"> 170 </span> : * _M_in_cur has already been moved back -<span class="lineNum"> 171 </span> : */ -<span class="lineNum"> 172 </span> : void -<span class="lineNum"> 173 </span> : _M_create_pback() -<span class="lineNum"> 174 </span> : { -<span class="lineNum"> 175 </span> : if (!_M_pback_init) -<span class="lineNum"> 176 </span> : { -<span class="lineNum"> 177 </span> : _M_pback_cur_save = this->gptr(); -<span class="lineNum"> 178 </span> : _M_pback_end_save = this->egptr(); -<span class="lineNum"> 179 </span> : this->setg(&_M_pback, &_M_pback, &_M_pback + 1); -<span class="lineNum"> 180 </span> : _M_pback_init = true; -<span class="lineNum"> 181 </span> : } -<span class="lineNum"> 182 </span> : } -<span class="lineNum"> 183 </span> : -<span class="lineNum"> 184 </span> : /** -<span class="lineNum"> 185 </span> : * Deactivates pback buffer contents, and restores normal buffer. -<span class="lineNum"> 186 </span> : * Assumptions: -<span class="lineNum"> 187 </span> : * The pback buffer has only moved forward. -<span class="lineNum"> 188 </span> : */ -<span class="lineNum"> 189 </span> : void -<span class="lineNum"> 190 </span> : _M_destroy_pback() throw() -<span class="lineNum"> 191 </span> : { -<span class="lineNum"> 192 </span> : if (_M_pback_init) -<span class="lineNum"> 193 </span> : { -<span class="lineNum"> 194 </span> : // Length _M_in_cur moved in the pback buffer. -<span class="lineNum"> 195 </span> : _M_pback_cur_save += this->gptr() != this->eback(); -<span class="lineNum"> 196 </span> : this->setg(_M_buf, _M_pback_cur_save, _M_pback_end_save); -<span class="lineNum"> 197 </span> : _M_pback_init = false; -<span class="lineNum"> 198 </span> : } -<span class="lineNum"> 199 </span> : } -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : public: -<span class="lineNum"> 202 </span> : // Constructors/destructor: -<span class="lineNum"> 203 </span> : /** -<span class="lineNum"> 204 </span> : * @brief Does not open any files. -<span class="lineNum"> 205 </span> : * -<span class="lineNum"> 206 </span> : * The default constructor initializes the parent class using its -<span class="lineNum"> 207 </span> : * own default ctor. -<span class="lineNum"> 208 </span> : */ -<span class="lineNum"> 209 </span> : basic_filebuf(); -<span class="lineNum"> 210 </span> : -<span class="lineNum"> 211 </span> : /** -<span class="lineNum"> 212 </span> : * @brief The destructor closes the file first. -<span class="lineNum"> 213 </span> : */ -<span class="lineNum"> 214 </span> : virtual -<span class="lineNum"> 215 </span><span class="lineNoCov"> 0 : ~basic_filebuf()</span> -<span class="lineNum"> 216 </span><span class="lineNoCov"> 0 : { this->close(); }</span> -<span class="lineNum"> 217 </span> : -<span class="lineNum"> 218 </span> : // Members: -<span class="lineNum"> 219 </span> : /** -<span class="lineNum"> 220 </span> : * @brief Returns true if the external file is open. -<span class="lineNum"> 221 </span> : */ -<span class="lineNum"> 222 </span> : bool -<span class="lineNum"> 223 </span><span class="lineNoCov"> 0 : is_open() const throw()</span> -<span class="lineNum"> 224 </span><span class="lineNoCov"> 0 : { return _M_file.is_open(); }</span> -<span class="lineNum"> 225 </span> : -<span class="lineNum"> 226 </span> : /** -<span class="lineNum"> 227 </span> : * @brief Opens an external file. -<span class="lineNum"> 228 </span> : * @param s The name of the file. -<span class="lineNum"> 229 </span> : * @param mode The open mode flags. -<span class="lineNum"> 230 </span> : * @return @c this on success, NULL on failure -<span class="lineNum"> 231 </span> : * -<span class="lineNum"> 232 </span> : * If a file is already open, this function immediately fails. -<span class="lineNum"> 233 </span> : * Otherwise it tries to open the file named @a s using the flags -<span class="lineNum"> 234 </span> : * given in @a mode. -<span class="lineNum"> 235 </span> : * -<span class="lineNum"> 236 </span> : * Table 92, adapted here, gives the relation between openmode -<span class="lineNum"> 237 </span> : * combinations and the equivalent fopen() flags. -<span class="lineNum"> 238 </span> : * (NB: lines app, in|out|app, in|app, binary|app, binary|in|out|app, -<span class="lineNum"> 239 </span> : * and binary|in|app per DR 596) -<span class="lineNum"> 240 </span> : * +---------------------------------------------------------+ -<span class="lineNum"> 241 </span> : * | ios_base Flag combination stdio equivalent | -<span class="lineNum"> 242 </span> : * |binary in out trunc app | -<span class="lineNum"> 243 </span> : * +---------------------------------------------------------+ -<span class="lineNum"> 244 </span> : * | + "w" | -<span class="lineNum"> 245 </span> : * | + + "a" | -<span class="lineNum"> 246 </span> : * | + "a" | -<span class="lineNum"> 247 </span> : * | + + "w" | -<span class="lineNum"> 248 </span> : * | + "r" | -<span class="lineNum"> 249 </span> : * | + + "r+" | -<span class="lineNum"> 250 </span> : * | + + + "w+" | -<span class="lineNum"> 251 </span> : * | + + + "a+" | -<span class="lineNum"> 252 </span> : * | + + "a+" | -<span class="lineNum"> 253 </span> : * +---------------------------------------------------------+ -<span class="lineNum"> 254 </span> : * | + + "wb" | -<span class="lineNum"> 255 </span> : * | + + + "ab" | -<span class="lineNum"> 256 </span> : * | + + "ab" | -<span class="lineNum"> 257 </span> : * | + + + "wb" | -<span class="lineNum"> 258 </span> : * | + + "rb" | -<span class="lineNum"> 259 </span> : * | + + + "r+b" | -<span class="lineNum"> 260 </span> : * | + + + + "w+b" | -<span class="lineNum"> 261 </span> : * | + + + + "a+b" | -<span class="lineNum"> 262 </span> : * | + + + "a+b" | -<span class="lineNum"> 263 </span> : * +---------------------------------------------------------+ -<span class="lineNum"> 264 </span> : */ -<span class="lineNum"> 265 </span> : __filebuf_type* -<span class="lineNum"> 266 </span> : open(const char* __s, ios_base::openmode __mode); -<span class="lineNum"> 267 </span> : -<span class="lineNum"> 268 </span> : /** -<span class="lineNum"> 269 </span> : * @brief Closes the currently associated file. -<span class="lineNum"> 270 </span> : * @return @c this on success, NULL on failure -<span class="lineNum"> 271 </span> : * -<span class="lineNum"> 272 </span> : * If no file is currently open, this function immediately fails. -<span class="lineNum"> 273 </span> : * -<span class="lineNum"> 274 </span> : * If a "put buffer area" exists, @c overflow(eof) is called to flush -<span class="lineNum"> 275 </span> : * all the characters. The file is then closed. -<span class="lineNum"> 276 </span> : * -<span class="lineNum"> 277 </span> : * If any operations fail, this function also fails. -<span class="lineNum"> 278 </span> : */ -<span class="lineNum"> 279 </span> : __filebuf_type* -<span class="lineNum"> 280 </span> : close(); -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span> : protected: -<span class="lineNum"> 283 </span> : void -<span class="lineNum"> 284 </span> : _M_allocate_internal_buffer(); -<span class="lineNum"> 285 </span> : -<span class="lineNum"> 286 </span> : void -<span class="lineNum"> 287 </span> : _M_destroy_internal_buffer() throw(); -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : // [27.8.1.4] overridden virtual functions -<span class="lineNum"> 290 </span> : virtual streamsize -<span class="lineNum"> 291 </span> : showmanyc(); -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : // Stroustrup, 1998, p. 628 -<span class="lineNum"> 294 </span> : // underflow() and uflow() functions are called to get the next -<span class="lineNum"> 295 </span> : // character from the real input source when the buffer is empty. -<span class="lineNum"> 296 </span> : // Buffered input uses underflow() -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : virtual int_type -<span class="lineNum"> 299 </span> : underflow(); -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span> : virtual int_type -<span class="lineNum"> 302 </span> : pbackfail(int_type __c = _Traits::eof()); -<span class="lineNum"> 303 </span> : -<span class="lineNum"> 304 </span> : // Stroustrup, 1998, p 648 -<span class="lineNum"> 305 </span> : // The overflow() function is called to transfer characters to the -<span class="lineNum"> 306 </span> : // real output destination when the buffer is full. A call to -<span class="lineNum"> 307 </span> : // overflow(c) outputs the contents of the buffer plus the -<span class="lineNum"> 308 </span> : // character c. -<span class="lineNum"> 309 </span> : // 27.5.2.4.5 -<span class="lineNum"> 310 </span> : // Consume some sequence of the characters in the pending sequence. -<span class="lineNum"> 311 </span> : virtual int_type -<span class="lineNum"> 312 </span> : overflow(int_type __c = _Traits::eof()); -<span class="lineNum"> 313 </span> : -<span class="lineNum"> 314 </span> : // Convert internal byte sequence to external, char-based -<span class="lineNum"> 315 </span> : // sequence via codecvt. -<span class="lineNum"> 316 </span> : bool -<span class="lineNum"> 317 </span> : _M_convert_to_external(char_type*, streamsize); -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : /** -<span class="lineNum"> 320 </span> : * @brief Manipulates the buffer. -<span class="lineNum"> 321 </span> : * @param s Pointer to a buffer area. -<span class="lineNum"> 322 </span> : * @param n Size of @a s. -<span class="lineNum"> 323 </span> : * @return @c this -<span class="lineNum"> 324 </span> : * -<span class="lineNum"> 325 </span> : * If no file has been opened, and both @a s and @a n are zero, then -<span class="lineNum"> 326 </span> : * the stream becomes unbuffered. Otherwise, @c s is used as a -<span class="lineNum"> 327 </span> : * buffer; see -<span class="lineNum"> 328 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 -<span class="lineNum"> 329 </span> : * for more. -<span class="lineNum"> 330 </span> : */ -<span class="lineNum"> 331 </span> : virtual __streambuf_type* -<span class="lineNum"> 332 </span> : setbuf(char_type* __s, streamsize __n); -<span class="lineNum"> 333 </span> : -<span class="lineNum"> 334 </span> : virtual pos_type -<span class="lineNum"> 335 </span> : seekoff(off_type __off, ios_base::seekdir __way, -<span class="lineNum"> 336 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out); -<span class="lineNum"> 337 </span> : -<span class="lineNum"> 338 </span> : virtual pos_type -<span class="lineNum"> 339 </span> : seekpos(pos_type __pos, -<span class="lineNum"> 340 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out); -<span class="lineNum"> 341 </span> : -<span class="lineNum"> 342 </span> : // Common code for seekoff and seekpos -<span class="lineNum"> 343 </span> : pos_type -<span class="lineNum"> 344 </span> : _M_seek(off_type __off, ios_base::seekdir __way, __state_type __state); -<span class="lineNum"> 345 </span> : -<span class="lineNum"> 346 </span> : virtual int -<span class="lineNum"> 347 </span> : sync(); -<span class="lineNum"> 348 </span> : -<span class="lineNum"> 349 </span> : virtual void -<span class="lineNum"> 350 </span> : imbue(const locale& __loc); -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : virtual streamsize -<span class="lineNum"> 353 </span> : xsgetn(char_type* __s, streamsize __n); -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : virtual streamsize -<span class="lineNum"> 356 </span> : xsputn(const char_type* __s, streamsize __n); -<span class="lineNum"> 357 </span> : -<span class="lineNum"> 358 </span> : // Flushes output buffer, then writes unshift sequence. -<span class="lineNum"> 359 </span> : bool -<span class="lineNum"> 360 </span> : _M_terminate_output(); -<span class="lineNum"> 361 </span> : -<span class="lineNum"> 362 </span> : /** -<span class="lineNum"> 363 </span> : * This function sets the pointers of the internal buffer, both get -<span class="lineNum"> 364 </span> : * and put areas. Typically: -<span class="lineNum"> 365 </span> : * -<span class="lineNum"> 366 </span> : * __off == egptr() - eback() upon underflow/uflow ('read' mode); -<span class="lineNum"> 367 </span> : * __off == 0 upon overflow ('write' mode); -<span class="lineNum"> 368 </span> : * __off == -1 upon open, setbuf, seekoff/pos ('uncommitted' mode). -<span class="lineNum"> 369 </span> : * -<span class="lineNum"> 370 </span> : * NB: epptr() - pbase() == _M_buf_size - 1, since _M_buf_size -<span class="lineNum"> 371 </span> : * reflects the actual allocated memory and the last cell is reserved -<span class="lineNum"> 372 </span> : * for the overflow char of a full put area. -<span class="lineNum"> 373 </span> : */ -<span class="lineNum"> 374 </span> : void -<span class="lineNum"> 375 </span> : _M_set_buffer(streamsize __off) -<span class="lineNum"> 376 </span> : { -<span class="lineNum"> 377 </span> : const bool __testin = _M_mode & ios_base::in; -<span class="lineNum"> 378 </span> : const bool __testout = _M_mode & ios_base::out; -<span class="lineNum"> 379 </span> : -<span class="lineNum"> 380 </span> : if (__testin && __off > 0) -<span class="lineNum"> 381 </span> : this->setg(_M_buf, _M_buf, _M_buf + __off); -<span class="lineNum"> 382 </span> : else -<span class="lineNum"> 383 </span> : this->setg(_M_buf, _M_buf, _M_buf); -<span class="lineNum"> 384 </span> : -<span class="lineNum"> 385 </span> : if (__testout && __off == 0 && _M_buf_size > 1 ) -<span class="lineNum"> 386 </span> : this->setp(_M_buf, _M_buf + _M_buf_size - 1); -<span class="lineNum"> 387 </span> : else -<span class="lineNum"> 388 </span> : this->setp(NULL, NULL); -<span class="lineNum"> 389 </span> : } -<span class="lineNum"> 390 </span> : }; -<span class="lineNum"> 391 </span> : -<span class="lineNum"> 392 </span> : // [27.8.1.5] Template class basic_ifstream -<span class="lineNum"> 393 </span> : /** -<span class="lineNum"> 394 </span> : * @brief Controlling input for files. -<span class="lineNum"> 395 </span> : * -<span class="lineNum"> 396 </span> : * This class supports reading from named files, using the inherited -<span class="lineNum"> 397 </span> : * functions from std::basic_istream. To control the associated -<span class="lineNum"> 398 </span> : * sequence, an instance of std::basic_filebuf is used, which this page -<span class="lineNum"> 399 </span> : * refers to as @c sb. -<span class="lineNum"> 400 </span> : */ -<span class="lineNum"> 401 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 402 </span> : class basic_ifstream : public basic_istream<_CharT, _Traits> -<span class="lineNum"> 403 </span> : { -<span class="lineNum"> 404 </span> : public: -<span class="lineNum"> 405 </span> : // Types: -<span class="lineNum"> 406 </span> : typedef _CharT char_type; -<span class="lineNum"> 407 </span> : typedef _Traits traits_type; -<span class="lineNum"> 408 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 409 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 410 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 411 </span> : -<span class="lineNum"> 412 </span> : // Non-standard types: -<span class="lineNum"> 413 </span> : typedef basic_filebuf<char_type, traits_type> __filebuf_type; -<span class="lineNum"> 414 </span> : typedef basic_istream<char_type, traits_type> __istream_type; -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : private: -<span class="lineNum"> 417 </span> : __filebuf_type _M_filebuf; -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : public: -<span class="lineNum"> 420 </span> : // Constructors/Destructors: -<span class="lineNum"> 421 </span> : /** -<span class="lineNum"> 422 </span> : * @brief Default constructor. -<span class="lineNum"> 423 </span> : * -<span class="lineNum"> 424 </span> : * Initializes @c sb using its default constructor, and passes -<span class="lineNum"> 425 </span> : * @c &sb to the base class initializer. Does not open any files -<span class="lineNum"> 426 </span> : * (you haven't given it a filename to open). -<span class="lineNum"> 427 </span> : */ -<span class="lineNum"> 428 </span><span class="lineNoCov"> 0 : basic_ifstream() : __istream_type(), _M_filebuf()</span> -<span class="lineNum"> 429 </span><span class="lineNoCov"> 0 : { this->init(&_M_filebuf); }</span> -<span class="lineNum"> 430 </span> : -<span class="lineNum"> 431 </span> : /** -<span class="lineNum"> 432 </span> : * @brief Create an input file stream. -<span class="lineNum"> 433 </span> : * @param s Null terminated string specifying the filename. -<span class="lineNum"> 434 </span> : * @param mode Open file in specified mode (see std::ios_base). -<span class="lineNum"> 435 </span> : * -<span class="lineNum"> 436 </span> : * @c ios_base::in is automatically included in @a mode. -<span class="lineNum"> 437 </span> : * -<span class="lineNum"> 438 </span> : * Tip: When using std::string to hold the filename, you must use -<span class="lineNum"> 439 </span> : * .c_str() before passing it to this constructor. -<span class="lineNum"> 440 </span> : */ -<span class="lineNum"> 441 </span> : explicit -<span class="lineNum"> 442 </span><span class="lineNoCov"> 0 : basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in)</span> -<span class="lineNum"> 443 </span><span class="lineNoCov"> 0 : : __istream_type(), _M_filebuf()</span> -<span class="lineNum"> 444 </span> : { -<span class="lineNum"> 445 </span><span class="lineNoCov"> 0 : this->init(&_M_filebuf);</span> -<span class="lineNum"> 446 </span><span class="lineNoCov"> 0 : this->open(__s, __mode);</span> -<span class="lineNum"> 447 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 448 </span> : -<span class="lineNum"> 449 </span> : /** -<span class="lineNum"> 450 </span> : * @brief The destructor does nothing. -<span class="lineNum"> 451 </span> : * -<span class="lineNum"> 452 </span> : * The file is closed by the filebuf object, not the formatting -<span class="lineNum"> 453 </span> : * stream. -<span class="lineNum"> 454 </span> : */ -<span class="lineNum"> 455 </span><span class="lineNoCov"> 0 : ~basic_ifstream()</span> -<span class="lineNum"> 456 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 457 </span> : -<span class="lineNum"> 458 </span> : // Members: -<span class="lineNum"> 459 </span> : /** -<span class="lineNum"> 460 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 461 </span> : * @return The current basic_filebuf buffer. -<span class="lineNum"> 462 </span> : * -<span class="lineNum"> 463 </span> : * This hides both signatures of std::basic_ios::rdbuf(). -<span class="lineNum"> 464 </span> : */ -<span class="lineNum"> 465 </span> : __filebuf_type* -<span class="lineNum"> 466 </span> : rdbuf() const -<span class="lineNum"> 467 </span> : { return const_cast<__filebuf_type*>(&_M_filebuf); } -<span class="lineNum"> 468 </span> : -<span class="lineNum"> 469 </span> : /** -<span class="lineNum"> 470 </span> : * @brief Wrapper to test for an open file. -<span class="lineNum"> 471 </span> : * @return @c rdbuf()->is_open() -<span class="lineNum"> 472 </span> : */ -<span class="lineNum"> 473 </span> : bool -<span class="lineNum"> 474 </span><span class="lineNoCov"> 0 : is_open()</span> -<span class="lineNum"> 475 </span><span class="lineNoCov"> 0 : { return _M_filebuf.is_open(); }</span> -<span class="lineNum"> 476 </span> : -<span class="lineNum"> 477 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 478 </span> : // 365. Lack of const-qualification in clause 27 -<span class="lineNum"> 479 </span> : bool -<span class="lineNum"> 480 </span> : is_open() const -<span class="lineNum"> 481 </span> : { return _M_filebuf.is_open(); } -<span class="lineNum"> 482 </span> : -<span class="lineNum"> 483 </span> : /** -<span class="lineNum"> 484 </span> : * @brief Opens an external file. -<span class="lineNum"> 485 </span> : * @param s The name of the file. -<span class="lineNum"> 486 </span> : * @param mode The open mode flags. -<span class="lineNum"> 487 </span> : * -<span class="lineNum"> 488 </span> : * Calls @c std::basic_filebuf::open(s,mode|in). If that function -<span class="lineNum"> 489 </span> : * fails, @c failbit is set in the stream's error state. -<span class="lineNum"> 490 </span> : * -<span class="lineNum"> 491 </span> : * Tip: When using std::string to hold the filename, you must use -<span class="lineNum"> 492 </span> : * .c_str() before passing it to this constructor. -<span class="lineNum"> 493 </span> : */ -<span class="lineNum"> 494 </span> : void -<span class="lineNum"> 495 </span><span class="lineNoCov"> 0 : open(const char* __s, ios_base::openmode __mode = ios_base::in)</span> -<span class="lineNum"> 496 </span> : { -<span class="lineNum"> 497 </span><span class="lineNoCov"> 0 : if (!_M_filebuf.open(__s, __mode | ios_base::in))</span> -<span class="lineNum"> 498 </span><span class="lineNoCov"> 0 : this->setstate(ios_base::failbit);</span> -<span class="lineNum"> 499 </span> : else -<span class="lineNum"> 500 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 501 </span> : // 409. Closing an fstream should clear error state -<span class="lineNum"> 502 </span><span class="lineNoCov"> 0 : this->clear();</span> -<span class="lineNum"> 503 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 504 </span> : -<span class="lineNum"> 505 </span> : /** -<span class="lineNum"> 506 </span> : * @brief Close the file. -<span class="lineNum"> 507 </span> : * -<span class="lineNum"> 508 </span> : * Calls @c std::basic_filebuf::close(). If that function -<span class="lineNum"> 509 </span> : * fails, @c failbit is set in the stream's error state. -<span class="lineNum"> 510 </span> : */ -<span class="lineNum"> 511 </span> : void -<span class="lineNum"> 512 </span><span class="lineNoCov"> 0 : close()</span> -<span class="lineNum"> 513 </span> : { -<span class="lineNum"> 514 </span><span class="lineNoCov"> 0 : if (!_M_filebuf.close())</span> -<span class="lineNum"> 515 </span><span class="lineNoCov"> 0 : this->setstate(ios_base::failbit);</span> -<span class="lineNum"> 516 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 517 </span> : }; -<span class="lineNum"> 518 </span> : -<span class="lineNum"> 519 </span> : -<span class="lineNum"> 520 </span> : // [27.8.1.8] Template class basic_ofstream -<span class="lineNum"> 521 </span> : /** -<span class="lineNum"> 522 </span> : * @brief Controlling output for files. -<span class="lineNum"> 523 </span> : * -<span class="lineNum"> 524 </span> : * This class supports reading from named files, using the inherited -<span class="lineNum"> 525 </span> : * functions from std::basic_ostream. To control the associated -<span class="lineNum"> 526 </span> : * sequence, an instance of std::basic_filebuf is used, which this page -<span class="lineNum"> 527 </span> : * refers to as @c sb. -<span class="lineNum"> 528 </span> : */ -<span class="lineNum"> 529 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 530 </span> : class basic_ofstream : public basic_ostream<_CharT,_Traits> -<span class="lineNum"> 531 </span> : { -<span class="lineNum"> 532 </span> : public: -<span class="lineNum"> 533 </span> : // Types: -<span class="lineNum"> 534 </span> : typedef _CharT char_type; -<span class="lineNum"> 535 </span> : typedef _Traits traits_type; -<span class="lineNum"> 536 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 537 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 538 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 539 </span> : -<span class="lineNum"> 540 </span> : // Non-standard types: -<span class="lineNum"> 541 </span> : typedef basic_filebuf<char_type, traits_type> __filebuf_type; -<span class="lineNum"> 542 </span> : typedef basic_ostream<char_type, traits_type> __ostream_type; -<span class="lineNum"> 543 </span> : -<span class="lineNum"> 544 </span> : private: -<span class="lineNum"> 545 </span> : __filebuf_type _M_filebuf; -<span class="lineNum"> 546 </span> : -<span class="lineNum"> 547 </span> : public: -<span class="lineNum"> 548 </span> : // Constructors: -<span class="lineNum"> 549 </span> : /** -<span class="lineNum"> 550 </span> : * @brief Default constructor. -<span class="lineNum"> 551 </span> : * -<span class="lineNum"> 552 </span> : * Initializes @c sb using its default constructor, and passes -<span class="lineNum"> 553 </span> : * @c &sb to the base class initializer. Does not open any files -<span class="lineNum"> 554 </span> : * (you haven't given it a filename to open). -<span class="lineNum"> 555 </span> : */ -<span class="lineNum"> 556 </span> : basic_ofstream(): __ostream_type(), _M_filebuf() -<span class="lineNum"> 557 </span> : { this->init(&_M_filebuf); } -<span class="lineNum"> 558 </span> : -<span class="lineNum"> 559 </span> : /** -<span class="lineNum"> 560 </span> : * @brief Create an output file stream. -<span class="lineNum"> 561 </span> : * @param s Null terminated string specifying the filename. -<span class="lineNum"> 562 </span> : * @param mode Open file in specified mode (see std::ios_base). -<span class="lineNum"> 563 </span> : * -<span class="lineNum"> 564 </span> : * @c ios_base::out|ios_base::trunc is automatically included in -<span class="lineNum"> 565 </span> : * @a mode. -<span class="lineNum"> 566 </span> : * -<span class="lineNum"> 567 </span> : * Tip: When using std::string to hold the filename, you must use -<span class="lineNum"> 568 </span> : * .c_str() before passing it to this constructor. -<span class="lineNum"> 569 </span> : */ -<span class="lineNum"> 570 </span> : explicit -<span class="lineNum"> 571 </span> : basic_ofstream(const char* __s, -<span class="lineNum"> 572 </span><span class="lineNoCov"> 0 : ios_base::openmode __mode = ios_base::out|ios_base::trunc)</span> -<span class="lineNum"> 573 </span><span class="lineNoCov"> 0 : : __ostream_type(), _M_filebuf()</span> -<span class="lineNum"> 574 </span> : { -<span class="lineNum"> 575 </span><span class="lineNoCov"> 0 : this->init(&_M_filebuf);</span> -<span class="lineNum"> 576 </span><span class="lineNoCov"> 0 : this->open(__s, __mode);</span> -<span class="lineNum"> 577 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 578 </span> : -<span class="lineNum"> 579 </span> : /** -<span class="lineNum"> 580 </span> : * @brief The destructor does nothing. -<span class="lineNum"> 581 </span> : * -<span class="lineNum"> 582 </span> : * The file is closed by the filebuf object, not the formatting -<span class="lineNum"> 583 </span> : * stream. -<span class="lineNum"> 584 </span> : */ -<span class="lineNum"> 585 </span><span class="lineNoCov"> 0 : ~basic_ofstream()</span> -<span class="lineNum"> 586 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 587 </span> : -<span class="lineNum"> 588 </span> : // Members: -<span class="lineNum"> 589 </span> : /** -<span class="lineNum"> 590 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 591 </span> : * @return The current basic_filebuf buffer. -<span class="lineNum"> 592 </span> : * -<span class="lineNum"> 593 </span> : * This hides both signatures of std::basic_ios::rdbuf(). -<span class="lineNum"> 594 </span> : */ -<span class="lineNum"> 595 </span> : __filebuf_type* -<span class="lineNum"> 596 </span> : rdbuf() const -<span class="lineNum"> 597 </span> : { return const_cast<__filebuf_type*>(&_M_filebuf); } -<span class="lineNum"> 598 </span> : -<span class="lineNum"> 599 </span> : /** -<span class="lineNum"> 600 </span> : * @brief Wrapper to test for an open file. -<span class="lineNum"> 601 </span> : * @return @c rdbuf()->is_open() -<span class="lineNum"> 602 </span> : */ -<span class="lineNum"> 603 </span> : bool -<span class="lineNum"> 604 </span><span class="lineNoCov"> 0 : is_open()</span> -<span class="lineNum"> 605 </span><span class="lineNoCov"> 0 : { return _M_filebuf.is_open(); }</span> -<span class="lineNum"> 606 </span> : -<span class="lineNum"> 607 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 608 </span> : // 365. Lack of const-qualification in clause 27 -<span class="lineNum"> 609 </span> : bool -<span class="lineNum"> 610 </span> : is_open() const -<span class="lineNum"> 611 </span> : { return _M_filebuf.is_open(); } -<span class="lineNum"> 612 </span> : -<span class="lineNum"> 613 </span> : /** -<span class="lineNum"> 614 </span> : * @brief Opens an external file. -<span class="lineNum"> 615 </span> : * @param s The name of the file. -<span class="lineNum"> 616 </span> : * @param mode The open mode flags. -<span class="lineNum"> 617 </span> : * -<span class="lineNum"> 618 </span> : * Calls @c std::basic_filebuf::open(s,mode|out|trunc). If that -<span class="lineNum"> 619 </span> : * function fails, @c failbit is set in the stream's error state. -<span class="lineNum"> 620 </span> : * -<span class="lineNum"> 621 </span> : * Tip: When using std::string to hold the filename, you must use -<span class="lineNum"> 622 </span> : * .c_str() before passing it to this constructor. -<span class="lineNum"> 623 </span> : */ -<span class="lineNum"> 624 </span> : void -<span class="lineNum"> 625 </span> : open(const char* __s, -<span class="lineNum"> 626 </span><span class="lineNoCov"> 0 : ios_base::openmode __mode = ios_base::out | ios_base::trunc)</span> -<span class="lineNum"> 627 </span> : { -<span class="lineNum"> 628 </span><span class="lineNoCov"> 0 : if (!_M_filebuf.open(__s, __mode | ios_base::out))</span> -<span class="lineNum"> 629 </span><span class="lineNoCov"> 0 : this->setstate(ios_base::failbit);</span> -<span class="lineNum"> 630 </span> : else -<span class="lineNum"> 631 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 632 </span> : // 409. Closing an fstream should clear error state -<span class="lineNum"> 633 </span><span class="lineNoCov"> 0 : this->clear();</span> -<span class="lineNum"> 634 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 635 </span> : -<span class="lineNum"> 636 </span> : /** -<span class="lineNum"> 637 </span> : * @brief Close the file. -<span class="lineNum"> 638 </span> : * -<span class="lineNum"> 639 </span> : * Calls @c std::basic_filebuf::close(). If that function -<span class="lineNum"> 640 </span> : * fails, @c failbit is set in the stream's error state. -<span class="lineNum"> 641 </span> : */ -<span class="lineNum"> 642 </span> : void -<span class="lineNum"> 643 </span> : close() -<span class="lineNum"> 644 </span> : { -<span class="lineNum"> 645 </span> : if (!_M_filebuf.close()) -<span class="lineNum"> 646 </span> : this->setstate(ios_base::failbit); -<span class="lineNum"> 647 </span> : } -<span class="lineNum"> 648 </span> : }; -<span class="lineNum"> 649 </span> : -<span class="lineNum"> 650 </span> : -<span class="lineNum"> 651 </span> : // [27.8.1.11] Template class basic_fstream -<span class="lineNum"> 652 </span> : /** -<span class="lineNum"> 653 </span> : * @brief Controlling input and output for files. -<span class="lineNum"> 654 </span> : * -<span class="lineNum"> 655 </span> : * This class supports reading from and writing to named files, using -<span class="lineNum"> 656 </span> : * the inherited functions from std::basic_iostream. To control the -<span class="lineNum"> 657 </span> : * associated sequence, an instance of std::basic_filebuf is used, which -<span class="lineNum"> 658 </span> : * this page refers to as @c sb. -<span class="lineNum"> 659 </span> : */ -<span class="lineNum"> 660 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 661 </span> : class basic_fstream : public basic_iostream<_CharT, _Traits> -<span class="lineNum"> 662 </span> : { -<span class="lineNum"> 663 </span> : public: -<span class="lineNum"> 664 </span> : // Types: -<span class="lineNum"> 665 </span> : typedef _CharT char_type; -<span class="lineNum"> 666 </span> : typedef _Traits traits_type; -<span class="lineNum"> 667 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 668 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 669 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 670 </span> : -<span class="lineNum"> 671 </span> : // Non-standard types: -<span class="lineNum"> 672 </span> : typedef basic_filebuf<char_type, traits_type> __filebuf_type; -<span class="lineNum"> 673 </span> : typedef basic_ios<char_type, traits_type> __ios_type; -<span class="lineNum"> 674 </span> : typedef basic_iostream<char_type, traits_type> __iostream_type; -<span class="lineNum"> 675 </span> : -<span class="lineNum"> 676 </span> : private: -<span class="lineNum"> 677 </span> : __filebuf_type _M_filebuf; -<span class="lineNum"> 678 </span> : -<span class="lineNum"> 679 </span> : public: -<span class="lineNum"> 680 </span> : // Constructors/destructor: -<span class="lineNum"> 681 </span> : /** -<span class="lineNum"> 682 </span> : * @brief Default constructor. -<span class="lineNum"> 683 </span> : * -<span class="lineNum"> 684 </span> : * Initializes @c sb using its default constructor, and passes -<span class="lineNum"> 685 </span> : * @c &sb to the base class initializer. Does not open any files -<span class="lineNum"> 686 </span> : * (you haven't given it a filename to open). -<span class="lineNum"> 687 </span> : */ -<span class="lineNum"> 688 </span> : basic_fstream() -<span class="lineNum"> 689 </span> : : __iostream_type(), _M_filebuf() -<span class="lineNum"> 690 </span> : { this->init(&_M_filebuf); } -<span class="lineNum"> 691 </span> : -<span class="lineNum"> 692 </span> : /** -<span class="lineNum"> 693 </span> : * @brief Create an input/output file stream. -<span class="lineNum"> 694 </span> : * @param s Null terminated string specifying the filename. -<span class="lineNum"> 695 </span> : * @param mode Open file in specified mode (see std::ios_base). -<span class="lineNum"> 696 </span> : * -<span class="lineNum"> 697 </span> : * Tip: When using std::string to hold the filename, you must use -<span class="lineNum"> 698 </span> : * .c_str() before passing it to this constructor. -<span class="lineNum"> 699 </span> : */ -<span class="lineNum"> 700 </span> : explicit -<span class="lineNum"> 701 </span> : basic_fstream(const char* __s, -<span class="lineNum"> 702 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out) -<span class="lineNum"> 703 </span> : : __iostream_type(NULL), _M_filebuf() -<span class="lineNum"> 704 </span> : { -<span class="lineNum"> 705 </span> : this->init(&_M_filebuf); -<span class="lineNum"> 706 </span> : this->open(__s, __mode); -<span class="lineNum"> 707 </span> : } -<span class="lineNum"> 708 </span> : -<span class="lineNum"> 709 </span> : /** -<span class="lineNum"> 710 </span> : * @brief The destructor does nothing. -<span class="lineNum"> 711 </span> : * -<span class="lineNum"> 712 </span> : * The file is closed by the filebuf object, not the formatting -<span class="lineNum"> 713 </span> : * stream. -<span class="lineNum"> 714 </span> : */ -<span class="lineNum"> 715 </span> : ~basic_fstream() -<span class="lineNum"> 716 </span> : { } -<span class="lineNum"> 717 </span> : -<span class="lineNum"> 718 </span> : // Members: -<span class="lineNum"> 719 </span> : /** -<span class="lineNum"> 720 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 721 </span> : * @return The current basic_filebuf buffer. -<span class="lineNum"> 722 </span> : * -<span class="lineNum"> 723 </span> : * This hides both signatures of std::basic_ios::rdbuf(). -<span class="lineNum"> 724 </span> : */ -<span class="lineNum"> 725 </span> : __filebuf_type* -<span class="lineNum"> 726 </span> : rdbuf() const -<span class="lineNum"> 727 </span> : { return const_cast<__filebuf_type*>(&_M_filebuf); } -<span class="lineNum"> 728 </span> : -<span class="lineNum"> 729 </span> : /** -<span class="lineNum"> 730 </span> : * @brief Wrapper to test for an open file. -<span class="lineNum"> 731 </span> : * @return @c rdbuf()->is_open() -<span class="lineNum"> 732 </span> : */ -<span class="lineNum"> 733 </span> : bool -<span class="lineNum"> 734 </span> : is_open() -<span class="lineNum"> 735 </span> : { return _M_filebuf.is_open(); } -<span class="lineNum"> 736 </span> : -<span class="lineNum"> 737 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 738 </span> : // 365. Lack of const-qualification in clause 27 -<span class="lineNum"> 739 </span> : bool -<span class="lineNum"> 740 </span> : is_open() const -<span class="lineNum"> 741 </span> : { return _M_filebuf.is_open(); } -<span class="lineNum"> 742 </span> : -<span class="lineNum"> 743 </span> : /** -<span class="lineNum"> 744 </span> : * @brief Opens an external file. -<span class="lineNum"> 745 </span> : * @param s The name of the file. -<span class="lineNum"> 746 </span> : * @param mode The open mode flags. -<span class="lineNum"> 747 </span> : * -<span class="lineNum"> 748 </span> : * Calls @c std::basic_filebuf::open(s,mode). If that -<span class="lineNum"> 749 </span> : * function fails, @c failbit is set in the stream's error state. -<span class="lineNum"> 750 </span> : * -<span class="lineNum"> 751 </span> : * Tip: When using std::string to hold the filename, you must use -<span class="lineNum"> 752 </span> : * .c_str() before passing it to this constructor. -<span class="lineNum"> 753 </span> : */ -<span class="lineNum"> 754 </span> : void -<span class="lineNum"> 755 </span> : open(const char* __s, -<span class="lineNum"> 756 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out) -<span class="lineNum"> 757 </span> : { -<span class="lineNum"> 758 </span> : if (!_M_filebuf.open(__s, __mode)) -<span class="lineNum"> 759 </span> : this->setstate(ios_base::failbit); -<span class="lineNum"> 760 </span> : else -<span class="lineNum"> 761 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 762 </span> : // 409. Closing an fstream should clear error state -<span class="lineNum"> 763 </span> : this->clear(); -<span class="lineNum"> 764 </span> : } -<span class="lineNum"> 765 </span> : -<span class="lineNum"> 766 </span> : /** -<span class="lineNum"> 767 </span> : * @brief Close the file. -<span class="lineNum"> 768 </span> : * -<span class="lineNum"> 769 </span> : * Calls @c std::basic_filebuf::close(). If that function -<span class="lineNum"> 770 </span> : * fails, @c failbit is set in the stream's error state. -<span class="lineNum"> 771 </span> : */ -<span class="lineNum"> 772 </span> : void -<span class="lineNum"> 773 </span> : close() -<span class="lineNum"> 774 </span> : { -<span class="lineNum"> 775 </span> : if (!_M_filebuf.close()) -<span class="lineNum"> 776 </span> : this->setstate(ios_base::failbit); -<span class="lineNum"> 777 </span> : } -<span class="lineNum"> 778 </span> : }; -<span class="lineNum"> 779 </span> : -<span class="lineNum"> 780 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 781 </span> : -<span class="lineNum"> 782 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 783 </span> : # include <bits/fstream.tcc> -<span class="lineNum"> 784 </span> : #endif -<span class="lineNum"> 785 </span> : -<span class="lineNum"> 786 </span> : #endif /* _GLIBCXX_FSTREAM */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h.gcov.html b/rep/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h.gcov.html deleted file mode 100644 index 5529fc3..0000000 --- a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h.gcov.html +++ /dev/null @@ -1,837 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/i486-linux-gnu/bits/gthr-default.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/i486-linux-gnu/bits</a> - gthr-default.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /* Threads compatibility routines for libgcc2 and libobjc. */ -<span class="lineNum"> 2 </span> : /* Compile this one with gcc. */ -<span class="lineNum"> 3 </span> : /* Copyright (C) 1997, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : -<span class="lineNum"> 6 </span> : This file is part of GCC. -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : GCC is free software; you can redistribute it and/or modify it under -<span class="lineNum"> 9 </span> : the terms of the GNU General Public License as published by the Free -<span class="lineNum"> 10 </span> : Software Foundation; either version 2, or (at your option) any later -<span class="lineNum"> 11 </span> : version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : GCC is distributed in the hope that it will be useful, but WITHOUT ANY -<span class="lineNum"> 14 </span> : WARRANTY; without even the implied warranty of MERCHANTABILITY or -<span class="lineNum"> 15 </span> : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -<span class="lineNum"> 16 </span> : for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : along with GCC; see the file COPYING. If not, write to the Free -<span class="lineNum"> 20 </span> : Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA -<span class="lineNum"> 21 </span> : 02110-1301, USA. */ -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : /* As a special exception, if you link this library with other files, -<span class="lineNum"> 24 </span> : some of which are compiled with GCC, to produce an executable, -<span class="lineNum"> 25 </span> : this library does not by itself cause the resulting executable -<span class="lineNum"> 26 </span> : to be covered by the GNU General Public License. -<span class="lineNum"> 27 </span> : This exception does not however invalidate any other reasons why -<span class="lineNum"> 28 </span> : the executable file might be covered by the GNU General Public License. */ -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : #ifndef _GLIBCXX_GCC_GTHR_POSIX_H -<span class="lineNum"> 31 </span> : #define _GLIBCXX_GCC_GTHR_POSIX_H -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /* POSIX threads specific definitions. -<span class="lineNum"> 34 </span> : Easy, since the interface is just one-to-one mapping. */ -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : #define __GTHREADS 1 -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : /* Some implementations of <pthread.h> require this to be defined. */ -<span class="lineNum"> 39 </span> : #if !defined(_REENTRANT) && defined(__osf__) -<span class="lineNum"> 40 </span> : #define _REENTRANT 1 -<span class="lineNum"> 41 </span> : #endif -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #include <pthread.h> -<span class="lineNum"> 44 </span> : #include <unistd.h> -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : typedef pthread_key_t __gthread_key_t; -<span class="lineNum"> 47 </span> : typedef pthread_once_t __gthread_once_t; -<span class="lineNum"> 48 </span> : typedef pthread_mutex_t __gthread_mutex_t; -<span class="lineNum"> 49 </span> : typedef pthread_mutex_t __gthread_recursive_mutex_t; -<span class="lineNum"> 50 </span> : typedef pthread_cond_t __gthread_cond_t; -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : /* POSIX like conditional variables are supported. Please look at comments -<span class="lineNum"> 53 </span> : in gthr.h for details. */ -<span class="lineNum"> 54 </span> : #define __GTHREAD_HAS_COND 1 -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : #define __GTHREAD_MUTEX_INIT PTHREAD_MUTEX_INITIALIZER -<span class="lineNum"> 57 </span> : #define __GTHREAD_ONCE_INIT PTHREAD_ONCE_INIT -<span class="lineNum"> 58 </span> : #if defined(PTHREAD_RECURSIVE_MUTEX_INITIALIZER) -<span class="lineNum"> 59 </span> : #define __GTHREAD_RECURSIVE_MUTEX_INIT PTHREAD_RECURSIVE_MUTEX_INITIALIZER -<span class="lineNum"> 60 </span> : #elif defined(PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP) -<span class="lineNum"> 61 </span> : #define __GTHREAD_RECURSIVE_MUTEX_INIT PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP -<span class="lineNum"> 62 </span> : #else -<span class="lineNum"> 63 </span> : #define __GTHREAD_RECURSIVE_MUTEX_INIT_FUNCTION __gthread_recursive_mutex_init_function -<span class="lineNum"> 64 </span> : #endif -<span class="lineNum"> 65 </span> : #define __GTHREAD_COND_INIT PTHREAD_COND_INITIALIZER -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : #if __GXX_WEAK__ && _GLIBCXX_GTHREAD_USE_WEAK -<span class="lineNum"> 68 </span> : # ifndef __gthrw_pragma -<span class="lineNum"> 69 </span> : # define __gthrw_pragma(pragma) -<span class="lineNum"> 70 </span> : # endif -<span class="lineNum"> 71 </span> : # define __gthrw2(name,name2,type) \ -<span class="lineNum"> 72 </span> : static __typeof(type) name __attribute__ ((__weakref__(#name2))); \ -<span class="lineNum"> 73 </span> : __gthrw_pragma(weak type) -<span class="lineNum"> 74 </span> : # define __gthrw_(name) __gthrw_ ## name -<span class="lineNum"> 75 </span> : #else -<span class="lineNum"> 76 </span> : # define __gthrw2(name,name2,type) -<span class="lineNum"> 77 </span> : # define __gthrw_(name) name -<span class="lineNum"> 78 </span> : #endif -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : /* Typically, __gthrw_foo is a weak reference to symbol foo. */ -<span class="lineNum"> 81 </span> : #define __gthrw(name) __gthrw2(__gthrw_ ## name,name,name) -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : /* On Tru64, /usr/include/pthread.h uses #pragma extern_prefix "__" to -<span class="lineNum"> 84 </span> : map a subset of the POSIX pthread API to mangled versions of their -<span class="lineNum"> 85 </span> : names. */ -<span class="lineNum"> 86 </span> : #if defined(__osf__) && defined(_PTHREAD_USE_MANGLED_NAMES_) -<span class="lineNum"> 87 </span> : #define __gthrw3(name) __gthrw2(__gthrw_ ## name, __ ## name, name) -<span class="lineNum"> 88 </span> : __gthrw3(pthread_once) -<span class="lineNum"> 89 </span> : __gthrw3(pthread_getspecific) -<span class="lineNum"> 90 </span> : __gthrw3(pthread_setspecific) -<span class="lineNum"> 91 </span> : __gthrw3(pthread_create) -<span class="lineNum"> 92 </span> : __gthrw3(pthread_cancel) -<span class="lineNum"> 93 </span> : __gthrw3(pthread_mutex_lock) -<span class="lineNum"> 94 </span> : __gthrw3(pthread_mutex_trylock) -<span class="lineNum"> 95 </span> : __gthrw3(pthread_mutex_unlock) -<span class="lineNum"> 96 </span> : __gthrw3(pthread_mutex_init) -<span class="lineNum"> 97 </span> : __gthrw3(pthread_cond_broadcast) -<span class="lineNum"> 98 </span> : __gthrw3(pthread_cond_wait) -<span class="lineNum"> 99 </span> : #else -<span class="lineNum"> 100 </span> : __gthrw(pthread_once) -<span class="lineNum"> 101 </span> : __gthrw(pthread_getspecific) -<span class="lineNum"> 102 </span> : __gthrw(pthread_setspecific) -<span class="lineNum"> 103 </span> : __gthrw(pthread_create) -<span class="lineNum"> 104 </span> : __gthrw(pthread_cancel) -<span class="lineNum"> 105 </span> : __gthrw(pthread_mutex_lock) -<span class="lineNum"> 106 </span> : __gthrw(pthread_mutex_trylock) -<span class="lineNum"> 107 </span> : __gthrw(pthread_mutex_unlock) -<span class="lineNum"> 108 </span> : __gthrw(pthread_mutex_init) -<span class="lineNum"> 109 </span> : __gthrw(pthread_cond_broadcast) -<span class="lineNum"> 110 </span> : __gthrw(pthread_cond_wait) -<span class="lineNum"> 111 </span> : #endif -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : __gthrw(pthread_key_create) -<span class="lineNum"> 114 </span> : __gthrw(pthread_key_delete) -<span class="lineNum"> 115 </span> : __gthrw(pthread_mutexattr_init) -<span class="lineNum"> 116 </span> : __gthrw(pthread_mutexattr_settype) -<span class="lineNum"> 117 </span> : __gthrw(pthread_mutexattr_destroy) -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : #if defined(_LIBOBJC) || defined(_LIBOBJC_WEAK) -<span class="lineNum"> 121 </span> : /* Objective-C. */ -<span class="lineNum"> 122 </span> : #if defined(__osf__) && defined(_PTHREAD_USE_MANGLED_NAMES_) -<span class="lineNum"> 123 </span> : __gthrw3(pthread_cond_destroy) -<span class="lineNum"> 124 </span> : __gthrw3(pthread_cond_init) -<span class="lineNum"> 125 </span> : __gthrw3(pthread_cond_signal) -<span class="lineNum"> 126 </span> : __gthrw3(pthread_exit) -<span class="lineNum"> 127 </span> : __gthrw3(pthread_mutex_destroy) -<span class="lineNum"> 128 </span> : __gthrw3(pthread_self) -<span class="lineNum"> 129 </span> : #else -<span class="lineNum"> 130 </span> : __gthrw(pthread_cond_destroy) -<span class="lineNum"> 131 </span> : __gthrw(pthread_cond_init) -<span class="lineNum"> 132 </span> : __gthrw(pthread_cond_signal) -<span class="lineNum"> 133 </span> : __gthrw(pthread_exit) -<span class="lineNum"> 134 </span> : __gthrw(pthread_mutex_destroy) -<span class="lineNum"> 135 </span> : __gthrw(pthread_self) -<span class="lineNum"> 136 </span> : #endif /* __osf__ && _PTHREAD_USE_MANGLED_NAMES_ */ -<span class="lineNum"> 137 </span> : #ifdef _POSIX_PRIORITY_SCHEDULING -<span class="lineNum"> 138 </span> : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING -<span class="lineNum"> 139 </span> : __gthrw(sched_get_priority_max) -<span class="lineNum"> 140 </span> : __gthrw(sched_get_priority_min) -<span class="lineNum"> 141 </span> : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */ -<span class="lineNum"> 142 </span> : #endif /* _POSIX_PRIORITY_SCHEDULING */ -<span class="lineNum"> 143 </span> : __gthrw(sched_yield) -<span class="lineNum"> 144 </span> : __gthrw(pthread_attr_destroy) -<span class="lineNum"> 145 </span> : __gthrw(pthread_attr_init) -<span class="lineNum"> 146 </span> : __gthrw(pthread_attr_setdetachstate) -<span class="lineNum"> 147 </span> : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING -<span class="lineNum"> 148 </span> : __gthrw(pthread_getschedparam) -<span class="lineNum"> 149 </span> : __gthrw(pthread_setschedparam) -<span class="lineNum"> 150 </span> : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */ -<span class="lineNum"> 151 </span> : #endif /* _LIBOBJC || _LIBOBJC_WEAK */ -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : #if __GXX_WEAK__ && _GLIBCXX_GTHREAD_USE_WEAK -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : /* On Solaris 2.6 up to 9, the libc exposes a POSIX threads interface even if -<span class="lineNum"> 156 </span> : -pthreads is not specified. The functions are dummies and most return an -<span class="lineNum"> 157 </span> : error value. However pthread_once returns 0 without invoking the routine -<span class="lineNum"> 158 </span> : it is passed so we cannot pretend that the interface is active if -pthreads -<span class="lineNum"> 159 </span> : is not specified. On Solaris 2.5.1, the interface is not exposed at all so -<span class="lineNum"> 160 </span> : we need to play the usual game with weak symbols. On Solaris 10 and up, a -<span class="lineNum"> 161 </span> : working interface is always exposed. On FreeBSD 6 and later, libc also -<span class="lineNum"> 162 </span> : exposes a dummy POSIX threads interface, similar to what Solaris 2.6 up -<span class="lineNum"> 163 </span> : to 9 does. FreeBSD >= 700014 even provides a pthread_cancel stub in libc, -<span class="lineNum"> 164 </span> : which means the alternate __gthread_active_p below cannot be used there. */ -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : #if defined(__FreeBSD__) || (defined(__sun) && defined(__svr4__)) -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : static volatile int __gthread_active = -1; -<span class="lineNum"> 169 </span> : -<span class="lineNum"> 170 </span> : static void -<span class="lineNum"> 171 </span> : __gthread_trigger (void) -<span class="lineNum"> 172 </span> : { -<span class="lineNum"> 173 </span> : __gthread_active = 1; -<span class="lineNum"> 174 </span> : } -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : static inline int -<span class="lineNum"> 177 </span> : __gthread_active_p (void) -<span class="lineNum"> 178 </span> : { -<span class="lineNum"> 179 </span> : static pthread_mutex_t __gthread_active_mutex = PTHREAD_MUTEX_INITIALIZER; -<span class="lineNum"> 180 </span> : static pthread_once_t __gthread_active_once = PTHREAD_ONCE_INIT; -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : /* Avoid reading __gthread_active twice on the main code path. */ -<span class="lineNum"> 183 </span> : int __gthread_active_latest_value = __gthread_active; -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : /* This test is not protected to avoid taking a lock on the main code -<span class="lineNum"> 186 </span> : path so every update of __gthread_active in a threaded program must -<span class="lineNum"> 187 </span> : be atomic with regard to the result of the test. */ -<span class="lineNum"> 188 </span> : if (__builtin_expect (__gthread_active_latest_value < 0, 0)) -<span class="lineNum"> 189 </span> : { -<span class="lineNum"> 190 </span> : if (__gthrw_(pthread_once)) -<span class="lineNum"> 191 </span> : { -<span class="lineNum"> 192 </span> : /* If this really is a threaded program, then we must ensure that -<span class="lineNum"> 193 </span> : __gthread_active has been set to 1 before exiting this block. */ -<span class="lineNum"> 194 </span> : __gthrw_(pthread_mutex_lock) (&__gthread_active_mutex); -<span class="lineNum"> 195 </span> : __gthrw_(pthread_once) (&__gthread_active_once, __gthread_trigger); -<span class="lineNum"> 196 </span> : __gthrw_(pthread_mutex_unlock) (&__gthread_active_mutex); -<span class="lineNum"> 197 </span> : } -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : /* Make sure we'll never enter this block again. */ -<span class="lineNum"> 200 </span> : if (__gthread_active < 0) -<span class="lineNum"> 201 </span> : __gthread_active = 0; -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : __gthread_active_latest_value = __gthread_active; -<span class="lineNum"> 204 </span> : } -<span class="lineNum"> 205 </span> : -<span class="lineNum"> 206 </span> : return __gthread_active_latest_value != 0; -<span class="lineNum"> 207 </span> : } -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : #else /* neither FreeBSD nor Solaris */ -<span class="lineNum"> 210 </span> : -<span class="lineNum"> 211 </span> : static inline int -<span class="lineNum"> 212 </span><span class="lineNoCov"> 0 : __gthread_active_p (void)</span> -<span class="lineNum"> 213 </span> : { -<span class="lineNum"> 214 </span> : static void *const __gthread_active_ptr -<span class="lineNum"> 215 </span> : = __extension__ (void *) &__gthrw_(pthread_cancel); -<span class="lineNum"> 216 </span><span class="lineNoCov"> 0 : return __gthread_active_ptr != 0;</span> -<span class="lineNum"> 217 </span> : } -<span class="lineNum"> 218 </span> : -<span class="lineNum"> 219 </span> : #endif /* FreeBSD or Solaris */ -<span class="lineNum"> 220 </span> : -<span class="lineNum"> 221 </span> : #else /* not __GXX_WEAK__ */ -<span class="lineNum"> 222 </span> : -<span class="lineNum"> 223 </span> : /* Similar to Solaris, HP-UX 11 for PA-RISC provides stubs for pthread -<span class="lineNum"> 224 </span> : calls in shared flavors of the HP-UX C library. Most of the stubs -<span class="lineNum"> 225 </span> : have no functionality. The details are described in the "libc cumulative -<span class="lineNum"> 226 </span> : patch" for each subversion of HP-UX 11. There are two special interfaces -<span class="lineNum"> 227 </span> : provided for checking whether an application is linked to a pthread -<span class="lineNum"> 228 </span> : library or not. However, these interfaces aren't available in early -<span class="lineNum"> 229 </span> : libc versions. We also can't use pthread_once as some libc versions -<span class="lineNum"> 230 </span> : call the init function. So, we use pthread_create to check whether it -<span class="lineNum"> 231 </span> : is possible to create a thread or not. The stub implementation returns -<span class="lineNum"> 232 </span> : the error number ENOSYS. */ -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : #if defined(__hppa__) && defined(__hpux__) -<span class="lineNum"> 235 </span> : -<span class="lineNum"> 236 </span> : #include <errno.h> -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : static volatile int __gthread_active = -1; -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : static void * -<span class="lineNum"> 241 </span> : __gthread_start (void *arg __attribute__((unused))) -<span class="lineNum"> 242 </span> : { -<span class="lineNum"> 243 </span> : return NULL; -<span class="lineNum"> 244 </span> : } -<span class="lineNum"> 245 </span> : -<span class="lineNum"> 246 </span> : static void __gthread_active_init (void) __attribute__((noinline)); -<span class="lineNum"> 247 </span> : static void -<span class="lineNum"> 248 </span> : __gthread_active_init (void) -<span class="lineNum"> 249 </span> : { -<span class="lineNum"> 250 </span> : static pthread_mutex_t __gthread_active_mutex = PTHREAD_MUTEX_INITIALIZER; -<span class="lineNum"> 251 </span> : pthread_t t; -<span class="lineNum"> 252 </span> : pthread_attr_t a; -<span class="lineNum"> 253 </span> : int result; -<span class="lineNum"> 254 </span> : -<span class="lineNum"> 255 </span> : __gthrw_(pthread_mutex_lock) (&__gthread_active_mutex); -<span class="lineNum"> 256 </span> : if (__gthread_active < 0) -<span class="lineNum"> 257 </span> : { -<span class="lineNum"> 258 </span> : __gthrw_(pthread_attr_init) (&a); -<span class="lineNum"> 259 </span> : __gthrw_(pthread_attr_setdetachstate) (&a, PTHREAD_CREATE_DETACHED); -<span class="lineNum"> 260 </span> : result = __gthrw_(pthread_create) (&t, &a, __gthread_start, NULL); -<span class="lineNum"> 261 </span> : if (result != ENOSYS) -<span class="lineNum"> 262 </span> : __gthread_active = 1; -<span class="lineNum"> 263 </span> : else -<span class="lineNum"> 264 </span> : __gthread_active = 0; -<span class="lineNum"> 265 </span> : __gthrw_(pthread_attr_destroy) (&a); -<span class="lineNum"> 266 </span> : } -<span class="lineNum"> 267 </span> : __gthrw_(pthread_mutex_unlock) (&__gthread_active_mutex); -<span class="lineNum"> 268 </span> : } -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span> : static inline int -<span class="lineNum"> 271 </span> : __gthread_active_p (void) -<span class="lineNum"> 272 </span> : { -<span class="lineNum"> 273 </span> : /* Avoid reading __gthread_active twice on the main code path. */ -<span class="lineNum"> 274 </span> : int __gthread_active_latest_value = __gthread_active; -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : /* This test is not protected to avoid taking a lock on the main code -<span class="lineNum"> 277 </span> : path so every update of __gthread_active in a threaded program must -<span class="lineNum"> 278 </span> : be atomic with regard to the result of the test. */ -<span class="lineNum"> 279 </span> : if (__builtin_expect (__gthread_active_latest_value < 0, 0)) -<span class="lineNum"> 280 </span> : { -<span class="lineNum"> 281 </span> : __gthread_active_init (); -<span class="lineNum"> 282 </span> : __gthread_active_latest_value = __gthread_active; -<span class="lineNum"> 283 </span> : } -<span class="lineNum"> 284 </span> : -<span class="lineNum"> 285 </span> : return __gthread_active_latest_value != 0; -<span class="lineNum"> 286 </span> : } -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : #else /* not hppa-hpux */ -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : static inline int -<span class="lineNum"> 291 </span> : __gthread_active_p (void) -<span class="lineNum"> 292 </span> : { -<span class="lineNum"> 293 </span> : return 1; -<span class="lineNum"> 294 </span> : } -<span class="lineNum"> 295 </span> : -<span class="lineNum"> 296 </span> : #endif /* hppa-hpux */ -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : #endif /* __GXX_WEAK__ */ -<span class="lineNum"> 299 </span> : -<span class="lineNum"> 300 </span> : #ifdef _LIBOBJC -<span class="lineNum"> 301 </span> : -<span class="lineNum"> 302 </span> : /* This is the config.h file in libobjc/ */ -<span class="lineNum"> 303 </span> : #include <config.h> -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : #ifdef HAVE_SCHED_H -<span class="lineNum"> 306 </span> : # include <sched.h> -<span class="lineNum"> 307 </span> : #endif -<span class="lineNum"> 308 </span> : -<span class="lineNum"> 309 </span> : /* Key structure for maintaining thread specific storage */ -<span class="lineNum"> 310 </span> : static pthread_key_t _objc_thread_storage; -<span class="lineNum"> 311 </span> : static pthread_attr_t _objc_thread_attribs; -<span class="lineNum"> 312 </span> : -<span class="lineNum"> 313 </span> : /* Thread local storage for a single thread */ -<span class="lineNum"> 314 </span> : static void *thread_local_storage = NULL; -<span class="lineNum"> 315 </span> : -<span class="lineNum"> 316 </span> : /* Backend initialization functions */ -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : /* Initialize the threads subsystem. */ -<span class="lineNum"> 319 </span> : static inline int -<span class="lineNum"> 320 </span> : __gthread_objc_init_thread_system (void) -<span class="lineNum"> 321 </span> : { -<span class="lineNum"> 322 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 323 </span> : { -<span class="lineNum"> 324 </span> : /* Initialize the thread storage key. */ -<span class="lineNum"> 325 </span> : if (__gthrw_(pthread_key_create) (&_objc_thread_storage, NULL) == 0) -<span class="lineNum"> 326 </span> : { -<span class="lineNum"> 327 </span> : /* The normal default detach state for threads is -<span class="lineNum"> 328 </span> : * PTHREAD_CREATE_JOINABLE which causes threads to not die -<span class="lineNum"> 329 </span> : * when you think they should. */ -<span class="lineNum"> 330 </span> : if (__gthrw_(pthread_attr_init) (&_objc_thread_attribs) == 0 -<span class="lineNum"> 331 </span> : && __gthrw_(pthread_attr_setdetachstate) (&_objc_thread_attribs, -<span class="lineNum"> 332 </span> : PTHREAD_CREATE_DETACHED) == 0) -<span class="lineNum"> 333 </span> : return 0; -<span class="lineNum"> 334 </span> : } -<span class="lineNum"> 335 </span> : } -<span class="lineNum"> 336 </span> : -<span class="lineNum"> 337 </span> : return -1; -<span class="lineNum"> 338 </span> : } -<span class="lineNum"> 339 </span> : -<span class="lineNum"> 340 </span> : /* Close the threads subsystem. */ -<span class="lineNum"> 341 </span> : static inline int -<span class="lineNum"> 342 </span> : __gthread_objc_close_thread_system (void) -<span class="lineNum"> 343 </span> : { -<span class="lineNum"> 344 </span> : if (__gthread_active_p () -<span class="lineNum"> 345 </span> : && __gthrw_(pthread_key_delete) (_objc_thread_storage) == 0 -<span class="lineNum"> 346 </span> : && __gthrw_(pthread_attr_destroy) (&_objc_thread_attribs) == 0) -<span class="lineNum"> 347 </span> : return 0; -<span class="lineNum"> 348 </span> : -<span class="lineNum"> 349 </span> : return -1; -<span class="lineNum"> 350 </span> : } -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : /* Backend thread functions */ -<span class="lineNum"> 353 </span> : -<span class="lineNum"> 354 </span> : /* Create a new thread of execution. */ -<span class="lineNum"> 355 </span> : static inline objc_thread_t -<span class="lineNum"> 356 </span> : __gthread_objc_thread_detach (void (*func)(void *), void *arg) -<span class="lineNum"> 357 </span> : { -<span class="lineNum"> 358 </span> : objc_thread_t thread_id; -<span class="lineNum"> 359 </span> : pthread_t new_thread_handle; -<span class="lineNum"> 360 </span> : -<span class="lineNum"> 361 </span> : if (!__gthread_active_p ()) -<span class="lineNum"> 362 </span> : return NULL; -<span class="lineNum"> 363 </span> : -<span class="lineNum"> 364 </span> : if (!(__gthrw_(pthread_create) (&new_thread_handle, NULL, (void *) func, arg))) -<span class="lineNum"> 365 </span> : thread_id = (objc_thread_t) new_thread_handle; -<span class="lineNum"> 366 </span> : else -<span class="lineNum"> 367 </span> : thread_id = NULL; -<span class="lineNum"> 368 </span> : -<span class="lineNum"> 369 </span> : return thread_id; -<span class="lineNum"> 370 </span> : } -<span class="lineNum"> 371 </span> : -<span class="lineNum"> 372 </span> : /* Set the current thread's priority. */ -<span class="lineNum"> 373 </span> : static inline int -<span class="lineNum"> 374 </span> : __gthread_objc_thread_set_priority (int priority) -<span class="lineNum"> 375 </span> : { -<span class="lineNum"> 376 </span> : if (!__gthread_active_p ()) -<span class="lineNum"> 377 </span> : return -1; -<span class="lineNum"> 378 </span> : else -<span class="lineNum"> 379 </span> : { -<span class="lineNum"> 380 </span> : #ifdef _POSIX_PRIORITY_SCHEDULING -<span class="lineNum"> 381 </span> : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING -<span class="lineNum"> 382 </span> : pthread_t thread_id = __gthrw_(pthread_self) (); -<span class="lineNum"> 383 </span> : int policy; -<span class="lineNum"> 384 </span> : struct sched_param params; -<span class="lineNum"> 385 </span> : int priority_min, priority_max; -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span> : if (__gthrw_(pthread_getschedparam) (thread_id, &policy, &params) == 0) -<span class="lineNum"> 388 </span> : { -<span class="lineNum"> 389 </span> : if ((priority_max = __gthrw_(sched_get_priority_max) (policy)) == -1) -<span class="lineNum"> 390 </span> : return -1; -<span class="lineNum"> 391 </span> : -<span class="lineNum"> 392 </span> : if ((priority_min = __gthrw_(sched_get_priority_min) (policy)) == -1) -<span class="lineNum"> 393 </span> : return -1; -<span class="lineNum"> 394 </span> : -<span class="lineNum"> 395 </span> : if (priority > priority_max) -<span class="lineNum"> 396 </span> : priority = priority_max; -<span class="lineNum"> 397 </span> : else if (priority < priority_min) -<span class="lineNum"> 398 </span> : priority = priority_min; -<span class="lineNum"> 399 </span> : params.sched_priority = priority; -<span class="lineNum"> 400 </span> : -<span class="lineNum"> 401 </span> : /* -<span class="lineNum"> 402 </span> : * The solaris 7 and several other man pages incorrectly state that -<span class="lineNum"> 403 </span> : * this should be a pointer to policy but pthread.h is universally -<span class="lineNum"> 404 </span> : * at odds with this. -<span class="lineNum"> 405 </span> : */ -<span class="lineNum"> 406 </span> : if (__gthrw_(pthread_setschedparam) (thread_id, policy, &params) == 0) -<span class="lineNum"> 407 </span> : return 0; -<span class="lineNum"> 408 </span> : } -<span class="lineNum"> 409 </span> : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */ -<span class="lineNum"> 410 </span> : #endif /* _POSIX_PRIORITY_SCHEDULING */ -<span class="lineNum"> 411 </span> : return -1; -<span class="lineNum"> 412 </span> : } -<span class="lineNum"> 413 </span> : } -<span class="lineNum"> 414 </span> : -<span class="lineNum"> 415 </span> : /* Return the current thread's priority. */ -<span class="lineNum"> 416 </span> : static inline int -<span class="lineNum"> 417 </span> : __gthread_objc_thread_get_priority (void) -<span class="lineNum"> 418 </span> : { -<span class="lineNum"> 419 </span> : #ifdef _POSIX_PRIORITY_SCHEDULING -<span class="lineNum"> 420 </span> : #ifdef _POSIX_THREAD_PRIORITY_SCHEDULING -<span class="lineNum"> 421 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 422 </span> : { -<span class="lineNum"> 423 </span> : int policy; -<span class="lineNum"> 424 </span> : struct sched_param params; -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : if (__gthrw_(pthread_getschedparam) (__gthrw_(pthread_self) (), &policy, &params) == 0) -<span class="lineNum"> 427 </span> : return params.sched_priority; -<span class="lineNum"> 428 </span> : else -<span class="lineNum"> 429 </span> : return -1; -<span class="lineNum"> 430 </span> : } -<span class="lineNum"> 431 </span> : else -<span class="lineNum"> 432 </span> : #endif /* _POSIX_THREAD_PRIORITY_SCHEDULING */ -<span class="lineNum"> 433 </span> : #endif /* _POSIX_PRIORITY_SCHEDULING */ -<span class="lineNum"> 434 </span> : return OBJC_THREAD_INTERACTIVE_PRIORITY; -<span class="lineNum"> 435 </span> : } -<span class="lineNum"> 436 </span> : -<span class="lineNum"> 437 </span> : /* Yield our process time to another thread. */ -<span class="lineNum"> 438 </span> : static inline void -<span class="lineNum"> 439 </span> : __gthread_objc_thread_yield (void) -<span class="lineNum"> 440 </span> : { -<span class="lineNum"> 441 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 442 </span> : __gthrw_(sched_yield) (); -<span class="lineNum"> 443 </span> : } -<span class="lineNum"> 444 </span> : -<span class="lineNum"> 445 </span> : /* Terminate the current thread. */ -<span class="lineNum"> 446 </span> : static inline int -<span class="lineNum"> 447 </span> : __gthread_objc_thread_exit (void) -<span class="lineNum"> 448 </span> : { -<span class="lineNum"> 449 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 450 </span> : /* exit the thread */ -<span class="lineNum"> 451 </span> : __gthrw_(pthread_exit) (&__objc_thread_exit_status); -<span class="lineNum"> 452 </span> : -<span class="lineNum"> 453 </span> : /* Failed if we reached here */ -<span class="lineNum"> 454 </span> : return -1; -<span class="lineNum"> 455 </span> : } -<span class="lineNum"> 456 </span> : -<span class="lineNum"> 457 </span> : /* Returns an integer value which uniquely describes a thread. */ -<span class="lineNum"> 458 </span> : static inline objc_thread_t -<span class="lineNum"> 459 </span> : __gthread_objc_thread_id (void) -<span class="lineNum"> 460 </span> : { -<span class="lineNum"> 461 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 462 </span> : return (objc_thread_t) __gthrw_(pthread_self) (); -<span class="lineNum"> 463 </span> : else -<span class="lineNum"> 464 </span> : return (objc_thread_t) 1; -<span class="lineNum"> 465 </span> : } -<span class="lineNum"> 466 </span> : -<span class="lineNum"> 467 </span> : /* Sets the thread's local storage pointer. */ -<span class="lineNum"> 468 </span> : static inline int -<span class="lineNum"> 469 </span> : __gthread_objc_thread_set_data (void *value) -<span class="lineNum"> 470 </span> : { -<span class="lineNum"> 471 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 472 </span> : return __gthrw_(pthread_setspecific) (_objc_thread_storage, value); -<span class="lineNum"> 473 </span> : else -<span class="lineNum"> 474 </span> : { -<span class="lineNum"> 475 </span> : thread_local_storage = value; -<span class="lineNum"> 476 </span> : return 0; -<span class="lineNum"> 477 </span> : } -<span class="lineNum"> 478 </span> : } -<span class="lineNum"> 479 </span> : -<span class="lineNum"> 480 </span> : /* Returns the thread's local storage pointer. */ -<span class="lineNum"> 481 </span> : static inline void * -<span class="lineNum"> 482 </span> : __gthread_objc_thread_get_data (void) -<span class="lineNum"> 483 </span> : { -<span class="lineNum"> 484 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 485 </span> : return __gthrw_(pthread_getspecific) (_objc_thread_storage); -<span class="lineNum"> 486 </span> : else -<span class="lineNum"> 487 </span> : return thread_local_storage; -<span class="lineNum"> 488 </span> : } -<span class="lineNum"> 489 </span> : -<span class="lineNum"> 490 </span> : /* Backend mutex functions */ -<span class="lineNum"> 491 </span> : -<span class="lineNum"> 492 </span> : /* Allocate a mutex. */ -<span class="lineNum"> 493 </span> : static inline int -<span class="lineNum"> 494 </span> : __gthread_objc_mutex_allocate (objc_mutex_t mutex) -<span class="lineNum"> 495 </span> : { -<span class="lineNum"> 496 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 497 </span> : { -<span class="lineNum"> 498 </span> : mutex->backend = objc_malloc (sizeof (pthread_mutex_t)); -<span class="lineNum"> 499 </span> : -<span class="lineNum"> 500 </span> : if (__gthrw_(pthread_mutex_init) ((pthread_mutex_t *) mutex->backend, NULL)) -<span class="lineNum"> 501 </span> : { -<span class="lineNum"> 502 </span> : objc_free (mutex->backend); -<span class="lineNum"> 503 </span> : mutex->backend = NULL; -<span class="lineNum"> 504 </span> : return -1; -<span class="lineNum"> 505 </span> : } -<span class="lineNum"> 506 </span> : } -<span class="lineNum"> 507 </span> : -<span class="lineNum"> 508 </span> : return 0; -<span class="lineNum"> 509 </span> : } -<span class="lineNum"> 510 </span> : -<span class="lineNum"> 511 </span> : /* Deallocate a mutex. */ -<span class="lineNum"> 512 </span> : static inline int -<span class="lineNum"> 513 </span> : __gthread_objc_mutex_deallocate (objc_mutex_t mutex) -<span class="lineNum"> 514 </span> : { -<span class="lineNum"> 515 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 516 </span> : { -<span class="lineNum"> 517 </span> : int count; -<span class="lineNum"> 518 </span> : -<span class="lineNum"> 519 </span> : /* -<span class="lineNum"> 520 </span> : * Posix Threads specifically require that the thread be unlocked -<span class="lineNum"> 521 </span> : * for __gthrw_(pthread_mutex_destroy) to work. -<span class="lineNum"> 522 </span> : */ -<span class="lineNum"> 523 </span> : -<span class="lineNum"> 524 </span> : do -<span class="lineNum"> 525 </span> : { -<span class="lineNum"> 526 </span> : count = __gthrw_(pthread_mutex_unlock) ((pthread_mutex_t *) mutex->backend); -<span class="lineNum"> 527 </span> : if (count < 0) -<span class="lineNum"> 528 </span> : return -1; -<span class="lineNum"> 529 </span> : } -<span class="lineNum"> 530 </span> : while (count); -<span class="lineNum"> 531 </span> : -<span class="lineNum"> 532 </span> : if (__gthrw_(pthread_mutex_destroy) ((pthread_mutex_t *) mutex->backend)) -<span class="lineNum"> 533 </span> : return -1; -<span class="lineNum"> 534 </span> : -<span class="lineNum"> 535 </span> : objc_free (mutex->backend); -<span class="lineNum"> 536 </span> : mutex->backend = NULL; -<span class="lineNum"> 537 </span> : } -<span class="lineNum"> 538 </span> : return 0; -<span class="lineNum"> 539 </span> : } -<span class="lineNum"> 540 </span> : -<span class="lineNum"> 541 </span> : /* Grab a lock on a mutex. */ -<span class="lineNum"> 542 </span> : static inline int -<span class="lineNum"> 543 </span> : __gthread_objc_mutex_lock (objc_mutex_t mutex) -<span class="lineNum"> 544 </span> : { -<span class="lineNum"> 545 </span> : if (__gthread_active_p () -<span class="lineNum"> 546 </span> : && __gthrw_(pthread_mutex_lock) ((pthread_mutex_t *) mutex->backend) != 0) -<span class="lineNum"> 547 </span> : { -<span class="lineNum"> 548 </span> : return -1; -<span class="lineNum"> 549 </span> : } -<span class="lineNum"> 550 </span> : -<span class="lineNum"> 551 </span> : return 0; -<span class="lineNum"> 552 </span> : } -<span class="lineNum"> 553 </span> : -<span class="lineNum"> 554 </span> : /* Try to grab a lock on a mutex. */ -<span class="lineNum"> 555 </span> : static inline int -<span class="lineNum"> 556 </span> : __gthread_objc_mutex_trylock (objc_mutex_t mutex) -<span class="lineNum"> 557 </span> : { -<span class="lineNum"> 558 </span> : if (__gthread_active_p () -<span class="lineNum"> 559 </span> : && __gthrw_(pthread_mutex_trylock) ((pthread_mutex_t *) mutex->backend) != 0) -<span class="lineNum"> 560 </span> : { -<span class="lineNum"> 561 </span> : return -1; -<span class="lineNum"> 562 </span> : } -<span class="lineNum"> 563 </span> : -<span class="lineNum"> 564 </span> : return 0; -<span class="lineNum"> 565 </span> : } -<span class="lineNum"> 566 </span> : -<span class="lineNum"> 567 </span> : /* Unlock the mutex */ -<span class="lineNum"> 568 </span> : static inline int -<span class="lineNum"> 569 </span> : __gthread_objc_mutex_unlock (objc_mutex_t mutex) -<span class="lineNum"> 570 </span> : { -<span class="lineNum"> 571 </span> : if (__gthread_active_p () -<span class="lineNum"> 572 </span> : && __gthrw_(pthread_mutex_unlock) ((pthread_mutex_t *) mutex->backend) != 0) -<span class="lineNum"> 573 </span> : { -<span class="lineNum"> 574 </span> : return -1; -<span class="lineNum"> 575 </span> : } -<span class="lineNum"> 576 </span> : -<span class="lineNum"> 577 </span> : return 0; -<span class="lineNum"> 578 </span> : } -<span class="lineNum"> 579 </span> : -<span class="lineNum"> 580 </span> : /* Backend condition mutex functions */ -<span class="lineNum"> 581 </span> : -<span class="lineNum"> 582 </span> : /* Allocate a condition. */ -<span class="lineNum"> 583 </span> : static inline int -<span class="lineNum"> 584 </span> : __gthread_objc_condition_allocate (objc_condition_t condition) -<span class="lineNum"> 585 </span> : { -<span class="lineNum"> 586 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 587 </span> : { -<span class="lineNum"> 588 </span> : condition->backend = objc_malloc (sizeof (pthread_cond_t)); -<span class="lineNum"> 589 </span> : -<span class="lineNum"> 590 </span> : if (__gthrw_(pthread_cond_init) ((pthread_cond_t *) condition->backend, NULL)) -<span class="lineNum"> 591 </span> : { -<span class="lineNum"> 592 </span> : objc_free (condition->backend); -<span class="lineNum"> 593 </span> : condition->backend = NULL; -<span class="lineNum"> 594 </span> : return -1; -<span class="lineNum"> 595 </span> : } -<span class="lineNum"> 596 </span> : } -<span class="lineNum"> 597 </span> : -<span class="lineNum"> 598 </span> : return 0; -<span class="lineNum"> 599 </span> : } -<span class="lineNum"> 600 </span> : -<span class="lineNum"> 601 </span> : /* Deallocate a condition. */ -<span class="lineNum"> 602 </span> : static inline int -<span class="lineNum"> 603 </span> : __gthread_objc_condition_deallocate (objc_condition_t condition) -<span class="lineNum"> 604 </span> : { -<span class="lineNum"> 605 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 606 </span> : { -<span class="lineNum"> 607 </span> : if (__gthrw_(pthread_cond_destroy) ((pthread_cond_t *) condition->backend)) -<span class="lineNum"> 608 </span> : return -1; -<span class="lineNum"> 609 </span> : -<span class="lineNum"> 610 </span> : objc_free (condition->backend); -<span class="lineNum"> 611 </span> : condition->backend = NULL; -<span class="lineNum"> 612 </span> : } -<span class="lineNum"> 613 </span> : return 0; -<span class="lineNum"> 614 </span> : } -<span class="lineNum"> 615 </span> : -<span class="lineNum"> 616 </span> : /* Wait on the condition */ -<span class="lineNum"> 617 </span> : static inline int -<span class="lineNum"> 618 </span> : __gthread_objc_condition_wait (objc_condition_t condition, objc_mutex_t mutex) -<span class="lineNum"> 619 </span> : { -<span class="lineNum"> 620 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 621 </span> : return __gthrw_(pthread_cond_wait) ((pthread_cond_t *) condition->backend, -<span class="lineNum"> 622 </span> : (pthread_mutex_t *) mutex->backend); -<span class="lineNum"> 623 </span> : else -<span class="lineNum"> 624 </span> : return 0; -<span class="lineNum"> 625 </span> : } -<span class="lineNum"> 626 </span> : -<span class="lineNum"> 627 </span> : /* Wake up all threads waiting on this condition. */ -<span class="lineNum"> 628 </span> : static inline int -<span class="lineNum"> 629 </span> : __gthread_objc_condition_broadcast (objc_condition_t condition) -<span class="lineNum"> 630 </span> : { -<span class="lineNum"> 631 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 632 </span> : return __gthrw_(pthread_cond_broadcast) ((pthread_cond_t *) condition->backend); -<span class="lineNum"> 633 </span> : else -<span class="lineNum"> 634 </span> : return 0; -<span class="lineNum"> 635 </span> : } -<span class="lineNum"> 636 </span> : -<span class="lineNum"> 637 </span> : /* Wake up one thread waiting on this condition. */ -<span class="lineNum"> 638 </span> : static inline int -<span class="lineNum"> 639 </span> : __gthread_objc_condition_signal (objc_condition_t condition) -<span class="lineNum"> 640 </span> : { -<span class="lineNum"> 641 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 642 </span> : return __gthrw_(pthread_cond_signal) ((pthread_cond_t *) condition->backend); -<span class="lineNum"> 643 </span> : else -<span class="lineNum"> 644 </span> : return 0; -<span class="lineNum"> 645 </span> : } -<span class="lineNum"> 646 </span> : -<span class="lineNum"> 647 </span> : #else /* _LIBOBJC */ -<span class="lineNum"> 648 </span> : -<span class="lineNum"> 649 </span> : static inline int -<span class="lineNum"> 650 </span> : __gthread_once (__gthread_once_t *once, void (*func) (void)) -<span class="lineNum"> 651 </span> : { -<span class="lineNum"> 652 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 653 </span> : return __gthrw_(pthread_once) (once, func); -<span class="lineNum"> 654 </span> : else -<span class="lineNum"> 655 </span> : return -1; -<span class="lineNum"> 656 </span> : } -<span class="lineNum"> 657 </span> : -<span class="lineNum"> 658 </span> : static inline int -<span class="lineNum"> 659 </span> : __gthread_key_create (__gthread_key_t *key, void (*dtor) (void *)) -<span class="lineNum"> 660 </span> : { -<span class="lineNum"> 661 </span> : return __gthrw_(pthread_key_create) (key, dtor); -<span class="lineNum"> 662 </span> : } -<span class="lineNum"> 663 </span> : -<span class="lineNum"> 664 </span> : static inline int -<span class="lineNum"> 665 </span> : __gthread_key_delete (__gthread_key_t key) -<span class="lineNum"> 666 </span> : { -<span class="lineNum"> 667 </span> : return __gthrw_(pthread_key_delete) (key); -<span class="lineNum"> 668 </span> : } -<span class="lineNum"> 669 </span> : -<span class="lineNum"> 670 </span> : static inline void * -<span class="lineNum"> 671 </span> : __gthread_getspecific (__gthread_key_t key) -<span class="lineNum"> 672 </span> : { -<span class="lineNum"> 673 </span> : return __gthrw_(pthread_getspecific) (key); -<span class="lineNum"> 674 </span> : } -<span class="lineNum"> 675 </span> : -<span class="lineNum"> 676 </span> : static inline int -<span class="lineNum"> 677 </span> : __gthread_setspecific (__gthread_key_t key, const void *ptr) -<span class="lineNum"> 678 </span> : { -<span class="lineNum"> 679 </span> : return __gthrw_(pthread_setspecific) (key, ptr); -<span class="lineNum"> 680 </span> : } -<span class="lineNum"> 681 </span> : -<span class="lineNum"> 682 </span> : static inline int -<span class="lineNum"> 683 </span> : __gthread_mutex_lock (__gthread_mutex_t *mutex) -<span class="lineNum"> 684 </span> : { -<span class="lineNum"> 685 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 686 </span> : return __gthrw_(pthread_mutex_lock) (mutex); -<span class="lineNum"> 687 </span> : else -<span class="lineNum"> 688 </span> : return 0; -<span class="lineNum"> 689 </span> : } -<span class="lineNum"> 690 </span> : -<span class="lineNum"> 691 </span> : static inline int -<span class="lineNum"> 692 </span> : __gthread_mutex_trylock (__gthread_mutex_t *mutex) -<span class="lineNum"> 693 </span> : { -<span class="lineNum"> 694 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 695 </span> : return __gthrw_(pthread_mutex_trylock) (mutex); -<span class="lineNum"> 696 </span> : else -<span class="lineNum"> 697 </span> : return 0; -<span class="lineNum"> 698 </span> : } -<span class="lineNum"> 699 </span> : -<span class="lineNum"> 700 </span> : static inline int -<span class="lineNum"> 701 </span> : __gthread_mutex_unlock (__gthread_mutex_t *mutex) -<span class="lineNum"> 702 </span> : { -<span class="lineNum"> 703 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 704 </span> : return __gthrw_(pthread_mutex_unlock) (mutex); -<span class="lineNum"> 705 </span> : else -<span class="lineNum"> 706 </span> : return 0; -<span class="lineNum"> 707 </span> : } -<span class="lineNum"> 708 </span> : -<span class="lineNum"> 709 </span> : #ifndef PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP -<span class="lineNum"> 710 </span> : static inline int -<span class="lineNum"> 711 </span> : __gthread_recursive_mutex_init_function (__gthread_recursive_mutex_t *mutex) -<span class="lineNum"> 712 </span> : { -<span class="lineNum"> 713 </span> : if (__gthread_active_p ()) -<span class="lineNum"> 714 </span> : { -<span class="lineNum"> 715 </span> : pthread_mutexattr_t attr; -<span class="lineNum"> 716 </span> : int r; -<span class="lineNum"> 717 </span> : -<span class="lineNum"> 718 </span> : r = __gthrw_(pthread_mutexattr_init) (&attr); -<span class="lineNum"> 719 </span> : if (!r) -<span class="lineNum"> 720 </span> : r = __gthrw_(pthread_mutexattr_settype) (&attr, PTHREAD_MUTEX_RECURSIVE); -<span class="lineNum"> 721 </span> : if (!r) -<span class="lineNum"> 722 </span> : r = __gthrw_(pthread_mutex_init) (mutex, &attr); -<span class="lineNum"> 723 </span> : if (!r) -<span class="lineNum"> 724 </span> : r = __gthrw_(pthread_mutexattr_destroy) (&attr); -<span class="lineNum"> 725 </span> : return r; -<span class="lineNum"> 726 </span> : } -<span class="lineNum"> 727 </span> : return 0; -<span class="lineNum"> 728 </span> : } -<span class="lineNum"> 729 </span> : #endif -<span class="lineNum"> 730 </span> : -<span class="lineNum"> 731 </span> : static inline int -<span class="lineNum"> 732 </span> : __gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *mutex) -<span class="lineNum"> 733 </span> : { -<span class="lineNum"> 734 </span> : return __gthread_mutex_lock (mutex); -<span class="lineNum"> 735 </span> : } -<span class="lineNum"> 736 </span> : -<span class="lineNum"> 737 </span> : static inline int -<span class="lineNum"> 738 </span> : __gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *mutex) -<span class="lineNum"> 739 </span> : { -<span class="lineNum"> 740 </span> : return __gthread_mutex_trylock (mutex); -<span class="lineNum"> 741 </span> : } -<span class="lineNum"> 742 </span> : -<span class="lineNum"> 743 </span> : static inline int -<span class="lineNum"> 744 </span> : __gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *mutex) -<span class="lineNum"> 745 </span> : { -<span class="lineNum"> 746 </span> : return __gthread_mutex_unlock (mutex); -<span class="lineNum"> 747 </span> : } -<span class="lineNum"> 748 </span> : -<span class="lineNum"> 749 </span> : static inline int -<span class="lineNum"> 750 </span> : __gthread_cond_broadcast (__gthread_cond_t *cond) -<span class="lineNum"> 751 </span> : { -<span class="lineNum"> 752 </span> : return __gthrw_(pthread_cond_broadcast) (cond); -<span class="lineNum"> 753 </span> : } -<span class="lineNum"> 754 </span> : -<span class="lineNum"> 755 </span> : static inline int -<span class="lineNum"> 756 </span> : __gthread_cond_wait (__gthread_cond_t *cond, __gthread_mutex_t *mutex) -<span class="lineNum"> 757 </span> : { -<span class="lineNum"> 758 </span> : return __gthrw_(pthread_cond_wait) (cond, mutex); -<span class="lineNum"> 759 </span> : } -<span class="lineNum"> 760 </span> : -<span class="lineNum"> 761 </span> : static inline int -<span class="lineNum"> 762 </span> : __gthread_cond_wait_recursive (__gthread_cond_t *cond, -<span class="lineNum"> 763 </span> : __gthread_recursive_mutex_t *mutex) -<span class="lineNum"> 764 </span> : { -<span class="lineNum"> 765 </span> : return __gthread_cond_wait (cond, mutex); -<span class="lineNum"> 766 </span> : } -<span class="lineNum"> 767 </span> : -<span class="lineNum"> 768 </span> : #endif /* _LIBOBJC */ -<span class="lineNum"> 769 </span> : -<span class="lineNum"> 770 </span> : #endif /* ! _GLIBCXX_GCC_GTHR_POSIX_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/index.html b/rep/usr/include/c++/4.3/i486-linux-gnu/bits/index.html deleted file mode 100644 index 14ebc63..0000000 --- a/rep/usr/include/c++/4.3/i486-linux-gnu/bits/index.html +++ /dev/null @@ -1,83 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/i486-linux-gnu/bits</title> - <link rel="stylesheet" type="text/css" href="../../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../../index.html">directory</a> - /usr/include/c++/4.3/i486-linux-gnu/bits</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="gthr-default.h.gcov.html">gthr-default.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 2 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/index.html b/rep/usr/include/c++/4.3/index.html deleted file mode 100644 index 9ddc70b..0000000 --- a/rep/usr/include/c++/4.3/index.html +++ /dev/null @@ -1,191 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - /usr/include/c++/4.3</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">181</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">6.6 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="cmath.gcov.html">cmath</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">2 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="exception.gcov.html">exception</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table> - </td> - <td class="coverPerHi">50.0 %</td> - <td class="coverNumHi">1 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="fstream.gcov.html">fstream</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 38 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="iomanip.gcov.html">iomanip</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../amber.png" width=40 height=10 alt="40.0%"><img src="../../../../snow.png" width=60 height=10 alt="40.0%"></td></tr></table> - </td> - <td class="coverPerMed">40.0 %</td> - <td class="coverNumMed">4 / 10 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="iosfwd.gcov.html">iosfwd</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 1 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="iostream.gcov.html">iostream</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="istream.gcov.html">istream</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 8 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="new.gcov.html">new</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table> - </td> - <td class="coverPerHi">50.0 %</td> - <td class="coverNumHi">1 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="ostream.gcov.html">ostream</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 33 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="sstream.gcov.html">sstream</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 43 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="stdexcept.gcov.html">stdexcept</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="streambuf.gcov.html">streambuf</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 36 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="typeinfo.gcov.html">typeinfo</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=50 height=10 alt="50.0%"><img src="../../../../snow.png" width=50 height=10 alt="50.0%"></td></tr></table> - </td> - <td class="coverPerHi">50.0 %</td> - <td class="coverNumHi">2 / 4 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/iomanip.gcov.html b/rep/usr/include/c++/4.3/iomanip.gcov.html deleted file mode 100644 index 3873f4c..0000000 --- a/rep/usr/include/c++/4.3/iomanip.gcov.html +++ /dev/null @@ -1,368 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/iomanip</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - iomanip</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">40.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Standard stream manipulators -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 -<span class="lineNum"> 4 </span> : // 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file iomanip -<span class="lineNum"> 33 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : // -<span class="lineNum"> 37 </span> : // ISO C++ 14882: 27.6.3 Standard manipulators -<span class="lineNum"> 38 </span> : // -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #ifndef _GLIBCXX_IOMANIP -<span class="lineNum"> 41 </span> : #define _GLIBCXX_IOMANIP 1 -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #pragma GCC system_header -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #include <bits/c++config.h> -<span class="lineNum"> 46 </span> : #include <iosfwd> -<span class="lineNum"> 47 </span> : #include <bits/ios_base.h> -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : // [27.6.3] standard manipulators -<span class="lineNum"> 52 </span> : // Also see DR 183. -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : struct _Resetiosflags { ios_base::fmtflags _M_mask; }; -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : /** -<span class="lineNum"> 57 </span> : * @brief Manipulator for @c setf. -<span class="lineNum"> 58 </span> : * @param mask A format flags mask. -<span class="lineNum"> 59 </span> : * -<span class="lineNum"> 60 </span> : * Sent to a stream object, this manipulator resets the specified flags, -<span class="lineNum"> 61 </span> : * via @e stream.setf(0,mask). -<span class="lineNum"> 62 </span> : */ -<span class="lineNum"> 63 </span> : inline _Resetiosflags -<span class="lineNum"> 64 </span> : resetiosflags(ios_base::fmtflags __mask) -<span class="lineNum"> 65 </span> : { -<span class="lineNum"> 66 </span> : _Resetiosflags __x; -<span class="lineNum"> 67 </span> : __x._M_mask = __mask; -<span class="lineNum"> 68 </span> : return __x; -<span class="lineNum"> 69 </span> : } -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 72 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 73 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, _Resetiosflags __f) -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span> : __is.setf(ios_base::fmtflags(0), __f._M_mask); -<span class="lineNum"> 76 </span> : return __is; -<span class="lineNum"> 77 </span> : } -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 80 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 81 </span> : operator<<(basic_ostream<_CharT, _Traits>& __os, _Resetiosflags __f) -<span class="lineNum"> 82 </span> : { -<span class="lineNum"> 83 </span> : __os.setf(ios_base::fmtflags(0), __f._M_mask); -<span class="lineNum"> 84 </span> : return __os; -<span class="lineNum"> 85 </span> : } -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : struct _Setiosflags { ios_base::fmtflags _M_mask; }; -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : /** -<span class="lineNum"> 91 </span> : * @brief Manipulator for @c setf. -<span class="lineNum"> 92 </span> : * @param mask A format flags mask. -<span class="lineNum"> 93 </span> : * -<span class="lineNum"> 94 </span> : * Sent to a stream object, this manipulator sets the format flags -<span class="lineNum"> 95 </span> : * to @a mask. -<span class="lineNum"> 96 </span> : */ -<span class="lineNum"> 97 </span> : inline _Setiosflags -<span class="lineNum"> 98 </span> : setiosflags(ios_base::fmtflags __mask) -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span> : _Setiosflags __x; -<span class="lineNum"> 101 </span> : __x._M_mask = __mask; -<span class="lineNum"> 102 </span> : return __x; -<span class="lineNum"> 103 </span> : } -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 106 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 107 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, _Setiosflags __f) -<span class="lineNum"> 108 </span> : { -<span class="lineNum"> 109 </span> : __is.setf(__f._M_mask); -<span class="lineNum"> 110 </span> : return __is; -<span class="lineNum"> 111 </span> : } -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 114 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 115 </span> : operator<<(basic_ostream<_CharT, _Traits>& __os, _Setiosflags __f) -<span class="lineNum"> 116 </span> : { -<span class="lineNum"> 117 </span> : __os.setf(__f._M_mask); -<span class="lineNum"> 118 </span> : return __os; -<span class="lineNum"> 119 </span> : } -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : struct _Setbase { int _M_base; }; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : /** -<span class="lineNum"> 125 </span> : * @brief Manipulator for @c setf. -<span class="lineNum"> 126 </span> : * @param base A numeric base. -<span class="lineNum"> 127 </span> : * -<span class="lineNum"> 128 </span> : * Sent to a stream object, this manipulator changes the -<span class="lineNum"> 129 </span> : * @c ios_base::basefield flags to @c oct, @c dec, or @c hex when @a base -<span class="lineNum"> 130 </span> : * is 8, 10, or 16, accordingly, and to 0 if @a base is any other value. -<span class="lineNum"> 131 </span> : */ -<span class="lineNum"> 132 </span> : inline _Setbase -<span class="lineNum"> 133 </span> : setbase(int __base) -<span class="lineNum"> 134 </span> : { -<span class="lineNum"> 135 </span> : _Setbase __x; -<span class="lineNum"> 136 </span> : __x._M_base = __base; -<span class="lineNum"> 137 </span> : return __x; -<span class="lineNum"> 138 </span> : } -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 141 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 142 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, _Setbase __f) -<span class="lineNum"> 143 </span> : { -<span class="lineNum"> 144 </span> : __is.setf(__f._M_base == 8 ? ios_base::oct : -<span class="lineNum"> 145 </span> : __f._M_base == 10 ? ios_base::dec : -<span class="lineNum"> 146 </span> : __f._M_base == 16 ? ios_base::hex : -<span class="lineNum"> 147 </span> : ios_base::fmtflags(0), ios_base::basefield); -<span class="lineNum"> 148 </span> : return __is; -<span class="lineNum"> 149 </span> : } -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 152 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 153 </span> : operator<<(basic_ostream<_CharT, _Traits>& __os, _Setbase __f) -<span class="lineNum"> 154 </span> : { -<span class="lineNum"> 155 </span> : __os.setf(__f._M_base == 8 ? ios_base::oct : -<span class="lineNum"> 156 </span> : __f._M_base == 10 ? ios_base::dec : -<span class="lineNum"> 157 </span> : __f._M_base == 16 ? ios_base::hex : -<span class="lineNum"> 158 </span> : ios_base::fmtflags(0), ios_base::basefield); -<span class="lineNum"> 159 </span> : return __os; -<span class="lineNum"> 160 </span> : } -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : template<typename _CharT> -<span class="lineNum"> 164 </span> : struct _Setfill { _CharT _M_c; }; -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : /** -<span class="lineNum"> 167 </span> : * @brief Manipulator for @c fill. -<span class="lineNum"> 168 </span> : * @param c The new fill character. -<span class="lineNum"> 169 </span> : * -<span class="lineNum"> 170 </span> : * Sent to a stream object, this manipulator calls @c fill(c) for that -<span class="lineNum"> 171 </span> : * object. -<span class="lineNum"> 172 </span> : */ -<span class="lineNum"> 173 </span> : template<typename _CharT> -<span class="lineNum"> 174 </span> : inline _Setfill<_CharT> -<span class="lineNum"> 175 </span><span class="lineCov"> 33 : setfill(_CharT __c)</span> -<span class="lineNum"> 176 </span> : { -<span class="lineNum"> 177 </span> : _Setfill<_CharT> __x; -<span class="lineNum"> 178 </span><span class="lineCov"> 33 : __x._M_c = __c; </span> -<span class="lineNum"> 179 </span> : return __x; -<span class="lineNum"> 180 </span> : } -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 183 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 184 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, _Setfill<_CharT> __f) -<span class="lineNum"> 185 </span> : { -<span class="lineNum"> 186 </span> : __is.fill(__f._M_c); -<span class="lineNum"> 187 </span> : return __is; -<span class="lineNum"> 188 </span> : } -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 191 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 192 </span><span class="lineNoCov"> 0 : operator<<(basic_ostream<_CharT, _Traits>& __os, _Setfill<_CharT> __f)</span> -<span class="lineNum"> 193 </span> : { -<span class="lineNum"> 194 </span><span class="lineNoCov"> 0 : __os.fill(__f._M_c); </span> -<span class="lineNum"> 195 </span><span class="lineNoCov"> 0 : return __os; </span> -<span class="lineNum"> 196 </span> : } -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : struct _Setprecision { int _M_n; }; -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : /** -<span class="lineNum"> 202 </span> : * @brief Manipulator for @c precision. -<span class="lineNum"> 203 </span> : * @param n The new precision. -<span class="lineNum"> 204 </span> : * -<span class="lineNum"> 205 </span> : * Sent to a stream object, this manipulator calls @c precision(n) for -<span class="lineNum"> 206 </span> : * that object. -<span class="lineNum"> 207 </span> : */ -<span class="lineNum"> 208 </span> : inline _Setprecision -<span class="lineNum"> 209 </span> : setprecision(int __n) -<span class="lineNum"> 210 </span> : { -<span class="lineNum"> 211 </span> : _Setprecision __x; -<span class="lineNum"> 212 </span> : __x._M_n = __n; -<span class="lineNum"> 213 </span> : return __x; -<span class="lineNum"> 214 </span> : } -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 217 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 218 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, _Setprecision __f) -<span class="lineNum"> 219 </span> : { -<span class="lineNum"> 220 </span> : __is.precision(__f._M_n); -<span class="lineNum"> 221 </span> : return __is; -<span class="lineNum"> 222 </span> : } -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 225 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 226 </span> : operator<<(basic_ostream<_CharT, _Traits>& __os, _Setprecision __f) -<span class="lineNum"> 227 </span> : { -<span class="lineNum"> 228 </span> : __os.precision(__f._M_n); -<span class="lineNum"> 229 </span> : return __os; -<span class="lineNum"> 230 </span> : } -<span class="lineNum"> 231 </span> : -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : struct _Setw { int _M_n; }; -<span class="lineNum"> 234 </span> : -<span class="lineNum"> 235 </span> : /** -<span class="lineNum"> 236 </span> : * @brief Manipulator for @c width. -<span class="lineNum"> 237 </span> : * @param n The new width. -<span class="lineNum"> 238 </span> : * -<span class="lineNum"> 239 </span> : * Sent to a stream object, this manipulator calls @c width(n) for -<span class="lineNum"> 240 </span> : * that object. -<span class="lineNum"> 241 </span> : */ -<span class="lineNum"> 242 </span> : inline _Setw -<span class="lineNum"> 243 </span><span class="lineCov"> 165 : setw(int __n)</span> -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : _Setw __x; -<span class="lineNum"> 246 </span><span class="lineCov"> 165 : __x._M_n = __n; </span> -<span class="lineNum"> 247 </span> : return __x; -<span class="lineNum"> 248 </span> : } -<span class="lineNum"> 249 </span> : -<span class="lineNum"> 250 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 251 </span> : inline basic_istream<_CharT, _Traits>& -<span class="lineNum"> 252 </span> : operator>>(basic_istream<_CharT, _Traits>& __is, _Setw __f) -<span class="lineNum"> 253 </span> : { -<span class="lineNum"> 254 </span> : __is.width(__f._M_n); -<span class="lineNum"> 255 </span> : return __is; -<span class="lineNum"> 256 </span> : } -<span class="lineNum"> 257 </span> : -<span class="lineNum"> 258 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 259 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 260 </span><span class="lineNoCov"> 0 : operator<<(basic_ostream<_CharT, _Traits>& __os, _Setw __f)</span> -<span class="lineNum"> 261 </span> : { -<span class="lineNum"> 262 </span><span class="lineNoCov"> 0 : __os.width(__f._M_n); </span> -<span class="lineNum"> 263 </span><span class="lineNoCov"> 0 : return __os; </span> -<span class="lineNum"> 264 </span> : } -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : // Inhibit implicit instantiations for required instantiations, -<span class="lineNum"> 267 </span> : // which are defined via explicit instantiations elsewhere. -<span class="lineNum"> 268 </span> : // NB: This syntax is a GNU extension. -<span class="lineNum"> 269 </span> : #if _GLIBCXX_EXTERN_TEMPLATE -<span class="lineNum"> 270 </span> : extern template ostream& operator<<(ostream&, _Setfill<char>); -<span class="lineNum"> 271 </span> : extern template ostream& operator<<(ostream&, _Setiosflags); -<span class="lineNum"> 272 </span> : extern template ostream& operator<<(ostream&, _Resetiosflags); -<span class="lineNum"> 273 </span> : extern template ostream& operator<<(ostream&, _Setbase); -<span class="lineNum"> 274 </span> : extern template ostream& operator<<(ostream&, _Setprecision); -<span class="lineNum"> 275 </span> : extern template ostream& operator<<(ostream&, _Setw); -<span class="lineNum"> 276 </span> : extern template istream& operator>>(istream&, _Setfill<char>); -<span class="lineNum"> 277 </span> : extern template istream& operator>>(istream&, _Setiosflags); -<span class="lineNum"> 278 </span> : extern template istream& operator>>(istream&, _Resetiosflags); -<span class="lineNum"> 279 </span> : extern template istream& operator>>(istream&, _Setbase); -<span class="lineNum"> 280 </span> : extern template istream& operator>>(istream&, _Setprecision); -<span class="lineNum"> 281 </span> : extern template istream& operator>>(istream&, _Setw); -<span class="lineNum"> 282 </span> : -<span class="lineNum"> 283 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 284 </span> : extern template wostream& operator<<(wostream&, _Setfill<wchar_t>); -<span class="lineNum"> 285 </span> : extern template wostream& operator<<(wostream&, _Setiosflags); -<span class="lineNum"> 286 </span> : extern template wostream& operator<<(wostream&, _Resetiosflags); -<span class="lineNum"> 287 </span> : extern template wostream& operator<<(wostream&, _Setbase); -<span class="lineNum"> 288 </span> : extern template wostream& operator<<(wostream&, _Setprecision); -<span class="lineNum"> 289 </span> : extern template wostream& operator<<(wostream&, _Setw); -<span class="lineNum"> 290 </span> : extern template wistream& operator>>(wistream&, _Setfill<wchar_t>); -<span class="lineNum"> 291 </span> : extern template wistream& operator>>(wistream&, _Setiosflags); -<span class="lineNum"> 292 </span> : extern template wistream& operator>>(wistream&, _Resetiosflags); -<span class="lineNum"> 293 </span> : extern template wistream& operator>>(wistream&, _Setbase); -<span class="lineNum"> 294 </span> : extern template wistream& operator>>(wistream&, _Setprecision); -<span class="lineNum"> 295 </span> : extern template wistream& operator>>(wistream&, _Setw); -<span class="lineNum"> 296 </span> : #endif -<span class="lineNum"> 297 </span> : #endif -<span class="lineNum"> 298 </span> : -<span class="lineNum"> 299 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span> : #endif /* _GLIBCXX_IOMANIP */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/iosfwd.gcov.html b/rep/usr/include/c++/4.3/iosfwd.gcov.html deleted file mode 100644 index 1509075..0000000 --- a/rep/usr/include/c++/4.3/iosfwd.gcov.html +++ /dev/null @@ -1,232 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/iosfwd</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - iosfwd</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Forwarding declarations -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file iosfwd -<span class="lineNum"> 33 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : // -<span class="lineNum"> 37 </span> : // ISO C++ 14882: 27.2 Forward declarations -<span class="lineNum"> 38 </span> : // -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #ifndef _GLIBCXX_IOSFWD -<span class="lineNum"> 41 </span> : #define _GLIBCXX_IOSFWD 1 -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #pragma GCC system_header -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #include <bits/c++config.h> -<span class="lineNum"> 46 </span> : #include <bits/stringfwd.h> // For string forward declarations. -<span class="lineNum"> 47 </span> : #include <bits/postypes.h> -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 52 </span> : class basic_ios; -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 55 </span> : class basic_streambuf; -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 58 </span> : class basic_istream; -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 61 </span> : class basic_ostream; -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 64 </span> : class basic_iostream; -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT>, -<span class="lineNum"> 67 </span> : typename _Alloc = allocator<_CharT> > -<span class="lineNum"> 68 </span><span class="lineNoCov"> 0 : class basic_stringbuf;</span> -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT>, -<span class="lineNum"> 71 </span> : typename _Alloc = allocator<_CharT> > -<span class="lineNum"> 72 </span> : class basic_istringstream; -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT>, -<span class="lineNum"> 75 </span> : typename _Alloc = allocator<_CharT> > -<span class="lineNum"> 76 </span> : class basic_ostringstream; -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT>, -<span class="lineNum"> 79 </span> : typename _Alloc = allocator<_CharT> > -<span class="lineNum"> 80 </span> : class basic_stringstream; -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 83 </span> : class basic_filebuf; -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 86 </span> : class basic_ifstream; -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 89 </span> : class basic_ofstream; -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 92 </span> : class basic_fstream; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 95 </span> : class istreambuf_iterator; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : template<typename _CharT, typename _Traits = char_traits<_CharT> > -<span class="lineNum"> 98 </span> : class ostreambuf_iterator; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 101 </span> : // Not included. (??? Apparently no LWG number?) -<span class="lineNum"> 102 </span> : class ios_base; -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : /** -<span class="lineNum"> 105 </span> : * @defgroup s27_2_iosfwd I/O Forward Declarations -<span class="lineNum"> 106 </span> : * -<span class="lineNum"> 107 </span> : * Nearly all of the I/O classes are parameterized on the type of -<span class="lineNum"> 108 </span> : * characters they read and write. (The major exception is ios_base at -<span class="lineNum"> 109 </span> : * the top of the hierarchy.) This is a change from pre-Standard -<span class="lineNum"> 110 </span> : * streams, which were not templates. -<span class="lineNum"> 111 </span> : * -<span class="lineNum"> 112 </span> : * For ease of use and compatibility, all of the basic_* I/O-related -<span class="lineNum"> 113 </span> : * classes are given typedef names for both of the builtin character -<span class="lineNum"> 114 </span> : * widths (wide and narrow). The typedefs are the same as the -<span class="lineNum"> 115 </span> : * pre-Standard names, for example: -<span class="lineNum"> 116 </span> : * -<span class="lineNum"> 117 </span> : * @code -<span class="lineNum"> 118 </span> : * typedef basic_ifstream<char> ifstream; -<span class="lineNum"> 119 </span> : * @endcode -<span class="lineNum"> 120 </span> : * -<span class="lineNum"> 121 </span> : * Because properly forward-declaring these classes can be difficult, you -<span class="lineNum"> 122 </span> : * should not do it yourself. Instead, include the &lt;iosfwd&gt; -<span class="lineNum"> 123 </span> : * header, which contains only declarations of all the I/O classes as -<span class="lineNum"> 124 </span> : * well as the typedefs. Trying to forward-declare the typedefs -<span class="lineNum"> 125 </span> : * themselves (e.g., "class ostream;") is not valid ISO C++. -<span class="lineNum"> 126 </span> : * -<span class="lineNum"> 127 </span> : * For more specific declarations, see -<span class="lineNum"> 128 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 -<span class="lineNum"> 129 </span> : * -<span class="lineNum"> 130 </span> : * @{ -<span class="lineNum"> 131 </span> : */ -<span class="lineNum"> 132 </span> : typedef basic_ios<char> ios; ///< @isiosfwd -<span class="lineNum"> 133 </span> : typedef basic_streambuf<char> streambuf; ///< @isiosfwd -<span class="lineNum"> 134 </span> : typedef basic_istream<char> istream; ///< @isiosfwd -<span class="lineNum"> 135 </span> : typedef basic_ostream<char> ostream; ///< @isiosfwd -<span class="lineNum"> 136 </span> : typedef basic_iostream<char> iostream; ///< @isiosfwd -<span class="lineNum"> 137 </span> : typedef basic_stringbuf<char> stringbuf; ///< @isiosfwd -<span class="lineNum"> 138 </span> : typedef basic_istringstream<char> istringstream; ///< @isiosfwd -<span class="lineNum"> 139 </span> : typedef basic_ostringstream<char> ostringstream; ///< @isiosfwd -<span class="lineNum"> 140 </span> : typedef basic_stringstream<char> stringstream; ///< @isiosfwd -<span class="lineNum"> 141 </span> : typedef basic_filebuf<char> filebuf; ///< @isiosfwd -<span class="lineNum"> 142 </span> : typedef basic_ifstream<char> ifstream; ///< @isiosfwd -<span class="lineNum"> 143 </span> : typedef basic_ofstream<char> ofstream; ///< @isiosfwd -<span class="lineNum"> 144 </span> : typedef basic_fstream<char> fstream; ///< @isiosfwd -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 147 </span> : typedef basic_ios<wchar_t> wios; ///< @isiosfwd -<span class="lineNum"> 148 </span> : typedef basic_streambuf<wchar_t> wstreambuf; ///< @isiosfwd -<span class="lineNum"> 149 </span> : typedef basic_istream<wchar_t> wistream; ///< @isiosfwd -<span class="lineNum"> 150 </span> : typedef basic_ostream<wchar_t> wostream; ///< @isiosfwd -<span class="lineNum"> 151 </span> : typedef basic_iostream<wchar_t> wiostream; ///< @isiosfwd -<span class="lineNum"> 152 </span> : typedef basic_stringbuf<wchar_t> wstringbuf; ///< @isiosfwd -<span class="lineNum"> 153 </span> : typedef basic_istringstream<wchar_t> wistringstream; ///< @isiosfwd -<span class="lineNum"> 154 </span> : typedef basic_ostringstream<wchar_t> wostringstream; ///< @isiosfwd -<span class="lineNum"> 155 </span> : typedef basic_stringstream<wchar_t> wstringstream; ///< @isiosfwd -<span class="lineNum"> 156 </span> : typedef basic_filebuf<wchar_t> wfilebuf; ///< @isiosfwd -<span class="lineNum"> 157 </span> : typedef basic_ifstream<wchar_t> wifstream; ///< @isiosfwd -<span class="lineNum"> 158 </span> : typedef basic_ofstream<wchar_t> wofstream; ///< @isiosfwd -<span class="lineNum"> 159 </span> : typedef basic_fstream<wchar_t> wfstream; ///< @isiosfwd -<span class="lineNum"> 160 </span> : #endif -<span class="lineNum"> 161 </span> : /** @} */ -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 164 </span> : -<span class="lineNum"> 165 </span> : #endif /* _GLIBCXX_IOSFWD */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/iostream.gcov.html b/rep/usr/include/c++/4.3/iostream.gcov.html deleted file mode 100644 index 26372c4..0000000 --- a/rep/usr/include/c++/4.3/iostream.gcov.html +++ /dev/null @@ -1,148 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/iostream</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - iostream</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Standard iostream objects -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2001, 2002, 2005 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 18 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 19 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 20 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /** @file iostream -<span class="lineNum"> 32 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : // -<span class="lineNum"> 36 </span> : // ISO C++ 14882: 27.3 Standard iostream objects -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : #ifndef _GLIBCXX_IOSTREAM -<span class="lineNum"> 40 </span> : #define _GLIBCXX_IOSTREAM 1 -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #pragma GCC system_header -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #include <bits/c++config.h> -<span class="lineNum"> 45 </span> : #include <ostream> -<span class="lineNum"> 46 </span> : #include <istream> -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : /** -<span class="lineNum"> 51 </span> : * @name Standard Stream Objects -<span class="lineNum"> 52 </span> : * -<span class="lineNum"> 53 </span> : * The &lt;iostream&gt; header declares the eight <em>standard stream -<span class="lineNum"> 54 </span> : * objects</em>. For other declarations, see -<span class="lineNum"> 55 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#10 and the -<span class="lineNum"> 56 </span> : * @link s27_2_iosfwd I/O forward declarations @endlink -<span class="lineNum"> 57 </span> : * -<span class="lineNum"> 58 </span> : * They are required by default to cooperate with the global C library's -<span class="lineNum"> 59 </span> : * @c FILE streams, and to be available during program startup and -<span class="lineNum"> 60 </span> : * termination. For more information, see the HOWTO linked to above. -<span class="lineNum"> 61 </span> : */ -<span class="lineNum"> 62 </span> : //@{ -<span class="lineNum"> 63 </span> : extern istream cin; ///< Linked to standard input -<span class="lineNum"> 64 </span> : extern ostream cout; ///< Linked to standard output -<span class="lineNum"> 65 </span> : extern ostream cerr; ///< Linked to standard error (unbuffered) -<span class="lineNum"> 66 </span> : extern ostream clog; ///< Linked to standard error (buffered) -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 69 </span> : extern wistream wcin; ///< Linked to standard input -<span class="lineNum"> 70 </span> : extern wostream wcout; ///< Linked to standard output -<span class="lineNum"> 71 </span> : extern wostream wcerr; ///< Linked to standard error (unbuffered) -<span class="lineNum"> 72 </span> : extern wostream wclog; ///< Linked to standard error (buffered) -<span class="lineNum"> 73 </span> : #endif -<span class="lineNum"> 74 </span> : //@} -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : // For construction of filebuffers for cout, cin, cerr, clog et. al. -<span class="lineNum"> 77 </span><span class="lineCov"> 104 : static ios_base::Init __ioinit;</span> -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : #endif /* _GLIBCXX_IOSTREAM */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/istream.gcov.html b/rep/usr/include/c++/4.3/istream.gcov.html deleted file mode 100644 index e8ffaf0..0000000 --- a/rep/usr/include/c++/4.3/istream.gcov.html +++ /dev/null @@ -1,906 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/istream</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - istream</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Input streams -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : // -<span class="lineNum"> 33 </span> : // ISO C++ 14882: 27.6.1 Input streams -<span class="lineNum"> 34 </span> : // -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : /** @file istream -<span class="lineNum"> 37 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 38 </span> : */ -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #ifndef _GLIBCXX_ISTREAM -<span class="lineNum"> 41 </span> : #define _GLIBCXX_ISTREAM 1 -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #pragma GCC system_header -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #include <ios> -<span class="lineNum"> 46 </span> : #include <ostream> -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : // [27.6.1.1] Template class basic_istream -<span class="lineNum"> 51 </span> : /** -<span class="lineNum"> 52 </span> : * @brief Controlling input. -<span class="lineNum"> 53 </span> : * -<span class="lineNum"> 54 </span> : * This is the base class for all input streams. It provides text -<span class="lineNum"> 55 </span> : * formatting of all builtin types, and communicates with any class -<span class="lineNum"> 56 </span> : * derived from basic_streambuf to do the actual input. -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 59 </span> : class basic_istream : virtual public basic_ios<_CharT, _Traits> -<span class="lineNum"> 60 </span> : { -<span class="lineNum"> 61 </span> : public: -<span class="lineNum"> 62 </span> : // Types (inherited from basic_ios (27.4.4)): -<span class="lineNum"> 63 </span> : typedef _CharT char_type; -<span class="lineNum"> 64 </span> : typedef typename _Traits::int_type int_type; -<span class="lineNum"> 65 </span> : typedef typename _Traits::pos_type pos_type; -<span class="lineNum"> 66 </span> : typedef typename _Traits::off_type off_type; -<span class="lineNum"> 67 </span> : typedef _Traits traits_type; -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : // Non-standard Types: -<span class="lineNum"> 70 </span> : typedef basic_streambuf<_CharT, _Traits> __streambuf_type; -<span class="lineNum"> 71 </span> : typedef basic_ios<_CharT, _Traits> __ios_type; -<span class="lineNum"> 72 </span> : typedef basic_istream<_CharT, _Traits> __istream_type; -<span class="lineNum"> 73 </span> : typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > -<span class="lineNum"> 74 </span> : __num_get_type; -<span class="lineNum"> 75 </span> : typedef ctype<_CharT> __ctype_type; -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : protected: -<span class="lineNum"> 78 </span> : // Data Members: -<span class="lineNum"> 79 </span> : /** -<span class="lineNum"> 80 </span> : * The number of characters extracted in the previous unformatted -<span class="lineNum"> 81 </span> : * function; see gcount(). -<span class="lineNum"> 82 </span> : */ -<span class="lineNum"> 83 </span> : streamsize _M_gcount; -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : public: -<span class="lineNum"> 86 </span> : // [27.6.1.1.1] constructor/destructor -<span class="lineNum"> 87 </span> : /** -<span class="lineNum"> 88 </span> : * @brief Base constructor. -<span class="lineNum"> 89 </span> : * -<span class="lineNum"> 90 </span> : * This ctor is almost never called by the user directly, rather from -<span class="lineNum"> 91 </span> : * derived classes' initialization lists, which pass a pointer to -<span class="lineNum"> 92 </span> : * their own stream buffer. -<span class="lineNum"> 93 </span> : */ -<span class="lineNum"> 94 </span> : explicit -<span class="lineNum"> 95 </span> : basic_istream(__streambuf_type* __sb) -<span class="lineNum"> 96 </span> : : _M_gcount(streamsize(0)) -<span class="lineNum"> 97 </span> : { this->init(__sb); } -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : /** -<span class="lineNum"> 100 </span> : * @brief Base destructor. -<span class="lineNum"> 101 </span> : * -<span class="lineNum"> 102 </span> : * This does very little apart from providing a virtual base dtor. -<span class="lineNum"> 103 </span> : */ -<span class="lineNum"> 104 </span> : virtual -<span class="lineNum"> 105 </span><span class="lineNoCov"> 0 : ~basic_istream() </span> -<span class="lineNum"> 106 </span><span class="lineNoCov"> 0 : { _M_gcount = streamsize(0); }</span> -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : // [27.6.1.1.2] prefix/suffix -<span class="lineNum"> 109 </span> : class sentry; -<span class="lineNum"> 110 </span> : friend class sentry; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : // [27.6.1.2] formatted input -<span class="lineNum"> 113 </span> : // [27.6.1.2.3] basic_istream::operator>> -<span class="lineNum"> 114 </span> : //@{ -<span class="lineNum"> 115 </span> : /** -<span class="lineNum"> 116 </span> : * @brief Interface for manipulators. -<span class="lineNum"> 117 </span> : * -<span class="lineNum"> 118 </span> : * Manipulators such as @c std::ws and @c std::dec use these -<span class="lineNum"> 119 </span> : * functions in constructs like "std::cin >> std::ws". For more -<span class="lineNum"> 120 </span> : * information, see the iomanip header. -<span class="lineNum"> 121 </span> : */ -<span class="lineNum"> 122 </span> : __istream_type& -<span class="lineNum"> 123 </span> : operator>>(__istream_type& (*__pf)(__istream_type&)) -<span class="lineNum"> 124 </span> : { return __pf(*this); } -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : __istream_type& -<span class="lineNum"> 127 </span> : operator>>(__ios_type& (*__pf)(__ios_type&)) -<span class="lineNum"> 128 </span> : { -<span class="lineNum"> 129 </span> : __pf(*this); -<span class="lineNum"> 130 </span> : return *this; -<span class="lineNum"> 131 </span> : } -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : __istream_type& -<span class="lineNum"> 134 </span> : operator>>(ios_base& (*__pf)(ios_base&)) -<span class="lineNum"> 135 </span> : { -<span class="lineNum"> 136 </span> : __pf(*this); -<span class="lineNum"> 137 </span> : return *this; -<span class="lineNum"> 138 </span> : } -<span class="lineNum"> 139 </span> : //@} -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : // [27.6.1.2.2] arithmetic extractors -<span class="lineNum"> 142 </span> : /** -<span class="lineNum"> 143 </span> : * @name Arithmetic Extractors -<span class="lineNum"> 144 </span> : * -<span class="lineNum"> 145 </span> : * All the @c operator>> functions (aka <em>formatted input -<span class="lineNum"> 146 </span> : * functions</em>) have some common behavior. Each starts by -<span class="lineNum"> 147 </span> : * constructing a temporary object of type std::basic_istream::sentry -<span class="lineNum"> 148 </span> : * with the second argument (noskipws) set to false. This has several -<span class="lineNum"> 149 </span> : * effects, concluding with the setting of a status flag; see the -<span class="lineNum"> 150 </span> : * sentry documentation for more. -<span class="lineNum"> 151 </span> : * -<span class="lineNum"> 152 </span> : * If the sentry status is good, the function tries to extract -<span class="lineNum"> 153 </span> : * whatever data is appropriate for the type of the argument. -<span class="lineNum"> 154 </span> : * -<span class="lineNum"> 155 </span> : * If an exception is thrown during extraction, ios_base::badbit -<span class="lineNum"> 156 </span> : * will be turned on in the stream's error state without causing an -<span class="lineNum"> 157 </span> : * ios_base::failure to be thrown. The original exception will then -<span class="lineNum"> 158 </span> : * be rethrown. -<span class="lineNum"> 159 </span> : */ -<span class="lineNum"> 160 </span> : //@{ -<span class="lineNum"> 161 </span> : /** -<span class="lineNum"> 162 </span> : * @brief Basic arithmetic extractors -<span class="lineNum"> 163 </span> : * @param A variable of builtin type. -<span class="lineNum"> 164 </span> : * @return @c *this if successful -<span class="lineNum"> 165 </span> : * -<span class="lineNum"> 166 </span> : * These functions use the stream's current locale (specifically, the -<span class="lineNum"> 167 </span> : * @c num_get facet) to parse the input data. -<span class="lineNum"> 168 </span> : */ -<span class="lineNum"> 169 </span> : __istream_type& -<span class="lineNum"> 170 </span> : operator>>(bool& __n) -<span class="lineNum"> 171 </span> : { return _M_extract(__n); } -<span class="lineNum"> 172 </span> : -<span class="lineNum"> 173 </span> : __istream_type& -<span class="lineNum"> 174 </span> : operator>>(short& __n); -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : __istream_type& -<span class="lineNum"> 177 </span> : operator>>(unsigned short& __n) -<span class="lineNum"> 178 </span> : { return _M_extract(__n); } -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : __istream_type& -<span class="lineNum"> 181 </span> : operator>>(int& __n); -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : __istream_type& -<span class="lineNum"> 184 </span> : operator>>(unsigned int& __n) -<span class="lineNum"> 185 </span> : { return _M_extract(__n); } -<span class="lineNum"> 186 </span> : -<span class="lineNum"> 187 </span> : __istream_type& -<span class="lineNum"> 188 </span> : operator>>(long& __n) -<span class="lineNum"> 189 </span> : { return _M_extract(__n); } -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : __istream_type& -<span class="lineNum"> 192 </span> : operator>>(unsigned long& __n) -<span class="lineNum"> 193 </span> : { return _M_extract(__n); } -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : #ifdef _GLIBCXX_USE_LONG_LONG -<span class="lineNum"> 196 </span> : __istream_type& -<span class="lineNum"> 197 </span> : operator>>(long long& __n) -<span class="lineNum"> 198 </span> : { return _M_extract(__n); } -<span class="lineNum"> 199 </span> : -<span class="lineNum"> 200 </span> : __istream_type& -<span class="lineNum"> 201 </span> : operator>>(unsigned long long& __n) -<span class="lineNum"> 202 </span> : { return _M_extract(__n); } -<span class="lineNum"> 203 </span> : #endif -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span> : __istream_type& -<span class="lineNum"> 206 </span> : operator>>(float& __f) -<span class="lineNum"> 207 </span> : { return _M_extract(__f); } -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : __istream_type& -<span class="lineNum"> 210 </span> : operator>>(double& __f) -<span class="lineNum"> 211 </span> : { return _M_extract(__f); } -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : __istream_type& -<span class="lineNum"> 214 </span> : operator>>(long double& __f) -<span class="lineNum"> 215 </span> : { return _M_extract(__f); } -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : __istream_type& -<span class="lineNum"> 218 </span> : operator>>(void*& __p) -<span class="lineNum"> 219 </span> : { return _M_extract(__p); } -<span class="lineNum"> 220 </span> : -<span class="lineNum"> 221 </span> : /** -<span class="lineNum"> 222 </span> : * @brief Extracting into another streambuf. -<span class="lineNum"> 223 </span> : * @param sb A pointer to a streambuf -<span class="lineNum"> 224 </span> : * -<span class="lineNum"> 225 </span> : * This function behaves like one of the basic arithmetic extractors, -<span class="lineNum"> 226 </span> : * in that it also constructs a sentry object and has the same error -<span class="lineNum"> 227 </span> : * handling behavior. -<span class="lineNum"> 228 </span> : * -<span class="lineNum"> 229 </span> : * If @a sb is NULL, the stream will set failbit in its error state. -<span class="lineNum"> 230 </span> : * -<span class="lineNum"> 231 </span> : * Characters are extracted from this stream and inserted into the -<span class="lineNum"> 232 </span> : * @a sb streambuf until one of the following occurs: -<span class="lineNum"> 233 </span> : * -<span class="lineNum"> 234 </span> : * - the input stream reaches end-of-file, -<span class="lineNum"> 235 </span> : * - insertion into the output buffer fails (in this case, the -<span class="lineNum"> 236 </span> : * character that would have been inserted is not extracted), or -<span class="lineNum"> 237 </span> : * - an exception occurs (and in this case is caught) -<span class="lineNum"> 238 </span> : * -<span class="lineNum"> 239 </span> : * If the function inserts no characters, failbit is set. -<span class="lineNum"> 240 </span> : */ -<span class="lineNum"> 241 </span> : __istream_type& -<span class="lineNum"> 242 </span> : operator>>(__streambuf_type* __sb); -<span class="lineNum"> 243 </span> : //@} -<span class="lineNum"> 244 </span> : -<span class="lineNum"> 245 </span> : // [27.6.1.3] unformatted input -<span class="lineNum"> 246 </span> : /** -<span class="lineNum"> 247 </span> : * @brief Character counting -<span class="lineNum"> 248 </span> : * @return The number of characters extracted by the previous -<span class="lineNum"> 249 </span> : * unformatted input function dispatched for this stream. -<span class="lineNum"> 250 </span> : */ -<span class="lineNum"> 251 </span> : streamsize -<span class="lineNum"> 252 </span> : gcount() const -<span class="lineNum"> 253 </span> : { return _M_gcount; } -<span class="lineNum"> 254 </span> : -<span class="lineNum"> 255 </span> : /** -<span class="lineNum"> 256 </span> : * @name Unformatted Input Functions -<span class="lineNum"> 257 </span> : * -<span class="lineNum"> 258 </span> : * All the unformatted input functions have some common behavior. -<span class="lineNum"> 259 </span> : * Each starts by constructing a temporary object of type -<span class="lineNum"> 260 </span> : * std::basic_istream::sentry with the second argument (noskipws) -<span class="lineNum"> 261 </span> : * set to true. This has several effects, concluding with the -<span class="lineNum"> 262 </span> : * setting of a status flag; see the sentry documentation for more. -<span class="lineNum"> 263 </span> : * -<span class="lineNum"> 264 </span> : * If the sentry status is good, the function tries to extract -<span class="lineNum"> 265 </span> : * whatever data is appropriate for the type of the argument. -<span class="lineNum"> 266 </span> : * -<span class="lineNum"> 267 </span> : * The number of characters extracted is stored for later retrieval -<span class="lineNum"> 268 </span> : * by gcount(). -<span class="lineNum"> 269 </span> : * -<span class="lineNum"> 270 </span> : * If an exception is thrown during extraction, ios_base::badbit -<span class="lineNum"> 271 </span> : * will be turned on in the stream's error state without causing an -<span class="lineNum"> 272 </span> : * ios_base::failure to be thrown. The original exception will then -<span class="lineNum"> 273 </span> : * be rethrown. -<span class="lineNum"> 274 </span> : */ -<span class="lineNum"> 275 </span> : //@{ -<span class="lineNum"> 276 </span> : /** -<span class="lineNum"> 277 </span> : * @brief Simple extraction. -<span class="lineNum"> 278 </span> : * @return A character, or eof(). -<span class="lineNum"> 279 </span> : * -<span class="lineNum"> 280 </span> : * Tries to extract a character. If none are available, sets failbit -<span class="lineNum"> 281 </span> : * and returns traits::eof(). -<span class="lineNum"> 282 </span> : */ -<span class="lineNum"> 283 </span> : int_type -<span class="lineNum"> 284 </span> : get(); -<span class="lineNum"> 285 </span> : -<span class="lineNum"> 286 </span> : /** -<span class="lineNum"> 287 </span> : * @brief Simple extraction. -<span class="lineNum"> 288 </span> : * @param c The character in which to store data. -<span class="lineNum"> 289 </span> : * @return *this -<span class="lineNum"> 290 </span> : * -<span class="lineNum"> 291 </span> : * Tries to extract a character and store it in @a c. If none are -<span class="lineNum"> 292 </span> : * available, sets failbit and returns traits::eof(). -<span class="lineNum"> 293 </span> : * -<span class="lineNum"> 294 </span> : * @note This function is not overloaded on signed char and -<span class="lineNum"> 295 </span> : * unsigned char. -<span class="lineNum"> 296 </span> : */ -<span class="lineNum"> 297 </span> : __istream_type& -<span class="lineNum"> 298 </span> : get(char_type& __c); -<span class="lineNum"> 299 </span> : -<span class="lineNum"> 300 </span> : /** -<span class="lineNum"> 301 </span> : * @brief Simple multiple-character extraction. -<span class="lineNum"> 302 </span> : * @param s Pointer to an array. -<span class="lineNum"> 303 </span> : * @param n Maximum number of characters to store in @a s. -<span class="lineNum"> 304 </span> : * @param delim A "stop" character. -<span class="lineNum"> 305 </span> : * @return *this -<span class="lineNum"> 306 </span> : * -<span class="lineNum"> 307 </span> : * Characters are extracted and stored into @a s until one of the -<span class="lineNum"> 308 </span> : * following happens: -<span class="lineNum"> 309 </span> : * -<span class="lineNum"> 310 </span> : * - @c n-1 characters are stored -<span class="lineNum"> 311 </span> : * - the input sequence reaches EOF -<span class="lineNum"> 312 </span> : * - the next character equals @a delim, in which case the character -<span class="lineNum"> 313 </span> : * is not extracted -<span class="lineNum"> 314 </span> : * -<span class="lineNum"> 315 </span> : * If no characters are stored, failbit is set in the stream's error -<span class="lineNum"> 316 </span> : * state. -<span class="lineNum"> 317 </span> : * -<span class="lineNum"> 318 </span> : * In any case, a null character is stored into the next location in -<span class="lineNum"> 319 </span> : * the array. -<span class="lineNum"> 320 </span> : * -<span class="lineNum"> 321 </span> : * @note This function is not overloaded on signed char and -<span class="lineNum"> 322 </span> : * unsigned char. -<span class="lineNum"> 323 </span> : */ -<span class="lineNum"> 324 </span> : __istream_type& -<span class="lineNum"> 325 </span> : get(char_type* __s, streamsize __n, char_type __delim); -<span class="lineNum"> 326 </span> : -<span class="lineNum"> 327 </span> : /** -<span class="lineNum"> 328 </span> : * @brief Simple multiple-character extraction. -<span class="lineNum"> 329 </span> : * @param s Pointer to an array. -<span class="lineNum"> 330 </span> : * @param n Maximum number of characters to store in @a s. -<span class="lineNum"> 331 </span> : * @return *this -<span class="lineNum"> 332 </span> : * -<span class="lineNum"> 333 </span> : * Returns @c get(s,n,widen('\n')). -<span class="lineNum"> 334 </span> : */ -<span class="lineNum"> 335 </span> : __istream_type& -<span class="lineNum"> 336 </span> : get(char_type* __s, streamsize __n) -<span class="lineNum"> 337 </span> : { return this->get(__s, __n, this->widen('\n')); } -<span class="lineNum"> 338 </span> : -<span class="lineNum"> 339 </span> : /** -<span class="lineNum"> 340 </span> : * @brief Extraction into another streambuf. -<span class="lineNum"> 341 </span> : * @param sb A streambuf in which to store data. -<span class="lineNum"> 342 </span> : * @param delim A "stop" character. -<span class="lineNum"> 343 </span> : * @return *this -<span class="lineNum"> 344 </span> : * -<span class="lineNum"> 345 </span> : * Characters are extracted and inserted into @a sb until one of the -<span class="lineNum"> 346 </span> : * following happens: -<span class="lineNum"> 347 </span> : * -<span class="lineNum"> 348 </span> : * - the input sequence reaches EOF -<span class="lineNum"> 349 </span> : * - insertion into the output buffer fails (in this case, the -<span class="lineNum"> 350 </span> : * character that would have been inserted is not extracted) -<span class="lineNum"> 351 </span> : * - the next character equals @a delim (in this case, the character -<span class="lineNum"> 352 </span> : * is not extracted) -<span class="lineNum"> 353 </span> : * - an exception occurs (and in this case is caught) -<span class="lineNum"> 354 </span> : * -<span class="lineNum"> 355 </span> : * If no characters are stored, failbit is set in the stream's error -<span class="lineNum"> 356 </span> : * state. -<span class="lineNum"> 357 </span> : */ -<span class="lineNum"> 358 </span> : __istream_type& -<span class="lineNum"> 359 </span> : get(__streambuf_type& __sb, char_type __delim); -<span class="lineNum"> 360 </span> : -<span class="lineNum"> 361 </span> : /** -<span class="lineNum"> 362 </span> : * @brief Extraction into another streambuf. -<span class="lineNum"> 363 </span> : * @param sb A streambuf in which to store data. -<span class="lineNum"> 364 </span> : * @return *this -<span class="lineNum"> 365 </span> : * -<span class="lineNum"> 366 </span> : * Returns @c get(sb,widen('\n')). -<span class="lineNum"> 367 </span> : */ -<span class="lineNum"> 368 </span> : __istream_type& -<span class="lineNum"> 369 </span> : get(__streambuf_type& __sb) -<span class="lineNum"> 370 </span> : { return this->get(__sb, this->widen('\n')); } -<span class="lineNum"> 371 </span> : -<span class="lineNum"> 372 </span> : /** -<span class="lineNum"> 373 </span> : * @brief String extraction. -<span class="lineNum"> 374 </span> : * @param s A character array in which to store the data. -<span class="lineNum"> 375 </span> : * @param n Maximum number of characters to extract. -<span class="lineNum"> 376 </span> : * @param delim A "stop" character. -<span class="lineNum"> 377 </span> : * @return *this -<span class="lineNum"> 378 </span> : * -<span class="lineNum"> 379 </span> : * Extracts and stores characters into @a s until one of the -<span class="lineNum"> 380 </span> : * following happens. Note that these criteria are required to be -<span class="lineNum"> 381 </span> : * tested in the order listed here, to allow an input line to exactly -<span class="lineNum"> 382 </span> : * fill the @a s array without setting failbit. -<span class="lineNum"> 383 </span> : * -<span class="lineNum"> 384 </span> : * -# the input sequence reaches end-of-file, in which case eofbit -<span class="lineNum"> 385 </span> : * is set in the stream error state -<span class="lineNum"> 386 </span> : * -# the next character equals @c delim, in which case the character -<span class="lineNum"> 387 </span> : * is extracted (and therefore counted in @c gcount()) but not stored -<span class="lineNum"> 388 </span> : * -# @c n-1 characters are stored, in which case failbit is set -<span class="lineNum"> 389 </span> : * in the stream error state -<span class="lineNum"> 390 </span> : * -<span class="lineNum"> 391 </span> : * If no characters are extracted, failbit is set. (An empty line of -<span class="lineNum"> 392 </span> : * input should therefore not cause failbit to be set.) -<span class="lineNum"> 393 </span> : * -<span class="lineNum"> 394 </span> : * In any case, a null character is stored in the next location in -<span class="lineNum"> 395 </span> : * the array. -<span class="lineNum"> 396 </span> : */ -<span class="lineNum"> 397 </span> : __istream_type& -<span class="lineNum"> 398 </span> : getline(char_type* __s, streamsize __n, char_type __delim); -<span class="lineNum"> 399 </span> : -<span class="lineNum"> 400 </span> : /** -<span class="lineNum"> 401 </span> : * @brief String extraction. -<span class="lineNum"> 402 </span> : * @param s A character array in which to store the data. -<span class="lineNum"> 403 </span> : * @param n Maximum number of characters to extract. -<span class="lineNum"> 404 </span> : * @return *this -<span class="lineNum"> 405 </span> : * -<span class="lineNum"> 406 </span> : * Returns @c getline(s,n,widen('\n')). -<span class="lineNum"> 407 </span> : */ -<span class="lineNum"> 408 </span> : __istream_type& -<span class="lineNum"> 409 </span> : getline(char_type* __s, streamsize __n) -<span class="lineNum"> 410 </span> : { return this->getline(__s, __n, this->widen('\n')); } -<span class="lineNum"> 411 </span> : -<span class="lineNum"> 412 </span> : /** -<span class="lineNum"> 413 </span> : * @brief Discarding characters -<span class="lineNum"> 414 </span> : * @param n Number of characters to discard. -<span class="lineNum"> 415 </span> : * @param delim A "stop" character. -<span class="lineNum"> 416 </span> : * @return *this -<span class="lineNum"> 417 </span> : * -<span class="lineNum"> 418 </span> : * Extracts characters and throws them away until one of the -<span class="lineNum"> 419 </span> : * following happens: -<span class="lineNum"> 420 </span> : * - if @a n @c != @c std::numeric_limits<int>::max(), @a n -<span class="lineNum"> 421 </span> : * characters are extracted -<span class="lineNum"> 422 </span> : * - the input sequence reaches end-of-file -<span class="lineNum"> 423 </span> : * - the next character equals @a delim (in this case, the character -<span class="lineNum"> 424 </span> : * is extracted); note that this condition will never occur if -<span class="lineNum"> 425 </span> : * @a delim equals @c traits::eof(). -<span class="lineNum"> 426 </span> : * -<span class="lineNum"> 427 </span> : * NB: Provide three overloads, instead of the single function -<span class="lineNum"> 428 </span> : * (with defaults) mandated by the Standard: this leads to a -<span class="lineNum"> 429 </span> : * better performing implementation, while still conforming to -<span class="lineNum"> 430 </span> : * the Standard. -<span class="lineNum"> 431 </span> : */ -<span class="lineNum"> 432 </span> : __istream_type& -<span class="lineNum"> 433 </span> : ignore(); -<span class="lineNum"> 434 </span> : -<span class="lineNum"> 435 </span> : __istream_type& -<span class="lineNum"> 436 </span> : ignore(streamsize __n); -<span class="lineNum"> 437 </span> : -<span class="lineNum"> 438 </span> : __istream_type& -<span class="lineNum"> 439 </span> : ignore(streamsize __n, int_type __delim); -<span class="lineNum"> 440 </span> : -<span class="lineNum"> 441 </span> : /** -<span class="lineNum"> 442 </span> : * @brief Looking ahead in the stream -<span class="lineNum"> 443 </span> : * @return The next character, or eof(). -<span class="lineNum"> 444 </span> : * -<span class="lineNum"> 445 </span> : * If, after constructing the sentry object, @c good() is false, -<span class="lineNum"> 446 </span> : * returns @c traits::eof(). Otherwise reads but does not extract -<span class="lineNum"> 447 </span> : * the next input character. -<span class="lineNum"> 448 </span> : */ -<span class="lineNum"> 449 </span> : int_type -<span class="lineNum"> 450 </span> : peek(); -<span class="lineNum"> 451 </span> : -<span class="lineNum"> 452 </span> : /** -<span class="lineNum"> 453 </span> : * @brief Extraction without delimiters. -<span class="lineNum"> 454 </span> : * @param s A character array. -<span class="lineNum"> 455 </span> : * @param n Maximum number of characters to store. -<span class="lineNum"> 456 </span> : * @return *this -<span class="lineNum"> 457 </span> : * -<span class="lineNum"> 458 </span> : * If the stream state is @c good(), extracts characters and stores -<span class="lineNum"> 459 </span> : * them into @a s until one of the following happens: -<span class="lineNum"> 460 </span> : * - @a n characters are stored -<span class="lineNum"> 461 </span> : * - the input sequence reaches end-of-file, in which case the error -<span class="lineNum"> 462 </span> : * state is set to @c failbit|eofbit. -<span class="lineNum"> 463 </span> : * -<span class="lineNum"> 464 </span> : * @note This function is not overloaded on signed char and -<span class="lineNum"> 465 </span> : * unsigned char. -<span class="lineNum"> 466 </span> : */ -<span class="lineNum"> 467 </span> : __istream_type& -<span class="lineNum"> 468 </span> : read(char_type* __s, streamsize __n); -<span class="lineNum"> 469 </span> : -<span class="lineNum"> 470 </span> : /** -<span class="lineNum"> 471 </span> : * @brief Extraction until the buffer is exhausted, but no more. -<span class="lineNum"> 472 </span> : * @param s A character array. -<span class="lineNum"> 473 </span> : * @param n Maximum number of characters to store. -<span class="lineNum"> 474 </span> : * @return The number of characters extracted. -<span class="lineNum"> 475 </span> : * -<span class="lineNum"> 476 </span> : * Extracts characters and stores them into @a s depending on the -<span class="lineNum"> 477 </span> : * number of characters remaining in the streambuf's buffer, -<span class="lineNum"> 478 </span> : * @c rdbuf()->in_avail(), called @c A here: -<span class="lineNum"> 479 </span> : * - if @c A @c == @c -1, sets eofbit and extracts no characters -<span class="lineNum"> 480 </span> : * - if @c A @c == @c 0, extracts no characters -<span class="lineNum"> 481 </span> : * - if @c A @c > @c 0, extracts @c min(A,n) -<span class="lineNum"> 482 </span> : * -<span class="lineNum"> 483 </span> : * The goal is to empty the current buffer, and to not request any -<span class="lineNum"> 484 </span> : * more from the external input sequence controlled by the streambuf. -<span class="lineNum"> 485 </span> : */ -<span class="lineNum"> 486 </span> : streamsize -<span class="lineNum"> 487 </span> : readsome(char_type* __s, streamsize __n); -<span class="lineNum"> 488 </span> : -<span class="lineNum"> 489 </span> : /** -<span class="lineNum"> 490 </span> : * @brief Unextracting a single character. -<span class="lineNum"> 491 </span> : * @param c The character to push back into the input stream. -<span class="lineNum"> 492 </span> : * @return *this -<span class="lineNum"> 493 </span> : * -<span class="lineNum"> 494 </span> : * If @c rdbuf() is not null, calls @c rdbuf()->sputbackc(c). -<span class="lineNum"> 495 </span> : * -<span class="lineNum"> 496 </span> : * If @c rdbuf() is null or if @c sputbackc() fails, sets badbit in -<span class="lineNum"> 497 </span> : * the error state. -<span class="lineNum"> 498 </span> : * -<span class="lineNum"> 499 </span> : * @note Since no characters are extracted, the next call to -<span class="lineNum"> 500 </span> : * @c gcount() will return 0, as required by DR 60. -<span class="lineNum"> 501 </span> : */ -<span class="lineNum"> 502 </span> : __istream_type& -<span class="lineNum"> 503 </span> : putback(char_type __c); -<span class="lineNum"> 504 </span> : -<span class="lineNum"> 505 </span> : /** -<span class="lineNum"> 506 </span> : * @brief Unextracting the previous character. -<span class="lineNum"> 507 </span> : * @return *this -<span class="lineNum"> 508 </span> : * -<span class="lineNum"> 509 </span> : * If @c rdbuf() is not null, calls @c rdbuf()->sungetc(c). -<span class="lineNum"> 510 </span> : * -<span class="lineNum"> 511 </span> : * If @c rdbuf() is null or if @c sungetc() fails, sets badbit in -<span class="lineNum"> 512 </span> : * the error state. -<span class="lineNum"> 513 </span> : * -<span class="lineNum"> 514 </span> : * @note Since no characters are extracted, the next call to -<span class="lineNum"> 515 </span> : * @c gcount() will return 0, as required by DR 60. -<span class="lineNum"> 516 </span> : */ -<span class="lineNum"> 517 </span> : __istream_type& -<span class="lineNum"> 518 </span> : unget(); -<span class="lineNum"> 519 </span> : -<span class="lineNum"> 520 </span> : /** -<span class="lineNum"> 521 </span> : * @brief Synchronizing the stream buffer. -<span class="lineNum"> 522 </span> : * @return 0 on success, -1 on failure -<span class="lineNum"> 523 </span> : * -<span class="lineNum"> 524 </span> : * If @c rdbuf() is a null pointer, returns -1. -<span class="lineNum"> 525 </span> : * -<span class="lineNum"> 526 </span> : * Otherwise, calls @c rdbuf()->pubsync(), and if that returns -1, -<span class="lineNum"> 527 </span> : * sets badbit and returns -1. -<span class="lineNum"> 528 </span> : * -<span class="lineNum"> 529 </span> : * Otherwise, returns 0. -<span class="lineNum"> 530 </span> : * -<span class="lineNum"> 531 </span> : * @note This function does not count the number of characters -<span class="lineNum"> 532 </span> : * extracted, if any, and therefore does not affect the next -<span class="lineNum"> 533 </span> : * call to @c gcount(). -<span class="lineNum"> 534 </span> : */ -<span class="lineNum"> 535 </span> : int -<span class="lineNum"> 536 </span> : sync(); -<span class="lineNum"> 537 </span> : -<span class="lineNum"> 538 </span> : /** -<span class="lineNum"> 539 </span> : * @brief Getting the current read position. -<span class="lineNum"> 540 </span> : * @return A file position object. -<span class="lineNum"> 541 </span> : * -<span class="lineNum"> 542 </span> : * If @c fail() is not false, returns @c pos_type(-1) to indicate -<span class="lineNum"> 543 </span> : * failure. Otherwise returns @c rdbuf()->pubseekoff(0,cur,in). -<span class="lineNum"> 544 </span> : * -<span class="lineNum"> 545 </span> : * @note This function does not count the number of characters -<span class="lineNum"> 546 </span> : * extracted, if any, and therefore does not affect the next -<span class="lineNum"> 547 </span> : * call to @c gcount(). -<span class="lineNum"> 548 </span> : */ -<span class="lineNum"> 549 </span> : pos_type -<span class="lineNum"> 550 </span> : tellg(); -<span class="lineNum"> 551 </span> : -<span class="lineNum"> 552 </span> : /** -<span class="lineNum"> 553 </span> : * @brief Changing the current read position. -<span class="lineNum"> 554 </span> : * @param pos A file position object. -<span class="lineNum"> 555 </span> : * @return *this -<span class="lineNum"> 556 </span> : * -<span class="lineNum"> 557 </span> : * If @c fail() is not true, calls @c rdbuf()->pubseekpos(pos). If -<span class="lineNum"> 558 </span> : * that function fails, sets failbit. -<span class="lineNum"> 559 </span> : * -<span class="lineNum"> 560 </span> : * @note This function does not count the number of characters -<span class="lineNum"> 561 </span> : * extracted, if any, and therefore does not affect the next -<span class="lineNum"> 562 </span> : * call to @c gcount(). -<span class="lineNum"> 563 </span> : */ -<span class="lineNum"> 564 </span> : __istream_type& -<span class="lineNum"> 565 </span> : seekg(pos_type); -<span class="lineNum"> 566 </span> : -<span class="lineNum"> 567 </span> : /** -<span class="lineNum"> 568 </span> : * @brief Changing the current read position. -<span class="lineNum"> 569 </span> : * @param off A file offset object. -<span class="lineNum"> 570 </span> : * @param dir The direction in which to seek. -<span class="lineNum"> 571 </span> : * @return *this -<span class="lineNum"> 572 </span> : * -<span class="lineNum"> 573 </span> : * If @c fail() is not true, calls @c rdbuf()->pubseekoff(off,dir). -<span class="lineNum"> 574 </span> : * If that function fails, sets failbit. -<span class="lineNum"> 575 </span> : * -<span class="lineNum"> 576 </span> : * @note This function does not count the number of characters -<span class="lineNum"> 577 </span> : * extracted, if any, and therefore does not affect the next -<span class="lineNum"> 578 </span> : * call to @c gcount(). -<span class="lineNum"> 579 </span> : */ -<span class="lineNum"> 580 </span> : __istream_type& -<span class="lineNum"> 581 </span> : seekg(off_type, ios_base::seekdir); -<span class="lineNum"> 582 </span> : //@} -<span class="lineNum"> 583 </span> : -<span class="lineNum"> 584 </span> : protected: -<span class="lineNum"> 585 </span><span class="lineNoCov"> 0 : basic_istream()</span> -<span class="lineNum"> 586 </span><span class="lineNoCov"> 0 : : _M_gcount(streamsize(0))</span> -<span class="lineNum"> 587 </span><span class="lineNoCov"> 0 : { this->init(0); }</span> -<span class="lineNum"> 588 </span> : -<span class="lineNum"> 589 </span> : template<typename _ValueT> -<span class="lineNum"> 590 </span> : __istream_type& -<span class="lineNum"> 591 </span> : _M_extract(_ValueT& __v); -<span class="lineNum"> 592 </span> : }; -<span class="lineNum"> 593 </span> : -<span class="lineNum"> 594 </span> : // Explicit specialization declarations, defined in src/istream.cc. -<span class="lineNum"> 595 </span> : template<> -<span class="lineNum"> 596 </span> : basic_istream<char>& -<span class="lineNum"> 597 </span> : basic_istream<char>:: -<span class="lineNum"> 598 </span> : getline(char_type* __s, streamsize __n, char_type __delim); -<span class="lineNum"> 599 </span> : -<span class="lineNum"> 600 </span> : template<> -<span class="lineNum"> 601 </span> : basic_istream<char>& -<span class="lineNum"> 602 </span> : basic_istream<char>:: -<span class="lineNum"> 603 </span> : ignore(streamsize __n); -<span class="lineNum"> 604 </span> : -<span class="lineNum"> 605 </span> : template<> -<span class="lineNum"> 606 </span> : basic_istream<char>& -<span class="lineNum"> 607 </span> : basic_istream<char>:: -<span class="lineNum"> 608 </span> : ignore(streamsize __n, int_type __delim); -<span class="lineNum"> 609 </span> : -<span class="lineNum"> 610 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 611 </span> : template<> -<span class="lineNum"> 612 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 613 </span> : basic_istream<wchar_t>:: -<span class="lineNum"> 614 </span> : getline(char_type* __s, streamsize __n, char_type __delim); -<span class="lineNum"> 615 </span> : -<span class="lineNum"> 616 </span> : template<> -<span class="lineNum"> 617 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 618 </span> : basic_istream<wchar_t>:: -<span class="lineNum"> 619 </span> : ignore(streamsize __n); -<span class="lineNum"> 620 </span> : -<span class="lineNum"> 621 </span> : template<> -<span class="lineNum"> 622 </span> : basic_istream<wchar_t>& -<span class="lineNum"> 623 </span> : basic_istream<wchar_t>:: -<span class="lineNum"> 624 </span> : ignore(streamsize __n, int_type __delim); -<span class="lineNum"> 625 </span> : #endif -<span class="lineNum"> 626 </span> : -<span class="lineNum"> 627 </span> : /** -<span class="lineNum"> 628 </span> : * @brief Performs setup work for input streams. -<span class="lineNum"> 629 </span> : * -<span class="lineNum"> 630 </span> : * Objects of this class are created before all of the standard -<span class="lineNum"> 631 </span> : * extractors are run. It is responsible for "exception-safe prefix and -<span class="lineNum"> 632 </span> : * suffix operations," although only prefix actions are currently required -<span class="lineNum"> 633 </span> : * by the standard. Additional actions may be added by the -<span class="lineNum"> 634 </span> : * implementation, and we list them in -<span class="lineNum"> 635 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/howto.html#5 -<span class="lineNum"> 636 </span> : * under [27.6] notes. -<span class="lineNum"> 637 </span> : */ -<span class="lineNum"> 638 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 639 </span> : class basic_istream<_CharT, _Traits>::sentry -<span class="lineNum"> 640 </span> : { -<span class="lineNum"> 641 </span> : public: -<span class="lineNum"> 642 </span> : /// Easy access to dependant types. -<span class="lineNum"> 643 </span> : typedef _Traits traits_type; -<span class="lineNum"> 644 </span> : typedef basic_streambuf<_CharT, _Traits> __streambuf_type; -<span class="lineNum"> 645 </span> : typedef basic_istream<_CharT, _Traits> __istream_type; -<span class="lineNum"> 646 </span> : typedef typename __istream_type::__ctype_type __ctype_type; -<span class="lineNum"> 647 </span> : typedef typename _Traits::int_type __int_type; -<span class="lineNum"> 648 </span> : -<span class="lineNum"> 649 </span> : /** -<span class="lineNum"> 650 </span> : * @brief The constructor performs all the work. -<span class="lineNum"> 651 </span> : * @param is The input stream to guard. -<span class="lineNum"> 652 </span> : * @param noskipws Whether to consume whitespace or not. -<span class="lineNum"> 653 </span> : * -<span class="lineNum"> 654 </span> : * If the stream state is good (@a is.good() is true), then the -<span class="lineNum"> 655 </span> : * following actions are performed, otherwise the sentry state is -<span class="lineNum"> 656 </span> : * false ("not okay") and failbit is set in the stream state. -<span class="lineNum"> 657 </span> : * -<span class="lineNum"> 658 </span> : * The sentry's preparatory actions are: -<span class="lineNum"> 659 </span> : * -<span class="lineNum"> 660 </span> : * -# if the stream is tied to an output stream, @c is.tie()->flush() -<span class="lineNum"> 661 </span> : * is called to synchronize the output sequence -<span class="lineNum"> 662 </span> : * -# if @a noskipws is false, and @c ios_base::skipws is set in -<span class="lineNum"> 663 </span> : * @c is.flags(), the sentry extracts and discards whitespace -<span class="lineNum"> 664 </span> : * characters from the stream. The currently imbued locale is -<span class="lineNum"> 665 </span> : * used to determine whether each character is whitespace. -<span class="lineNum"> 666 </span> : * -<span class="lineNum"> 667 </span> : * If the stream state is still good, then the sentry state becomes -<span class="lineNum"> 668 </span> : * true ("okay"). -<span class="lineNum"> 669 </span> : */ -<span class="lineNum"> 670 </span> : explicit -<span class="lineNum"> 671 </span> : sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false); -<span class="lineNum"> 672 </span> : -<span class="lineNum"> 673 </span> : /** -<span class="lineNum"> 674 </span> : * @brief Quick status checking. -<span class="lineNum"> 675 </span> : * @return The sentry state. -<span class="lineNum"> 676 </span> : * -<span class="lineNum"> 677 </span> : * For ease of use, sentries may be converted to booleans. The -<span class="lineNum"> 678 </span> : * return value is that of the sentry state (true == okay). -<span class="lineNum"> 679 </span> : */ -<span class="lineNum"> 680 </span> : operator bool() const -<span class="lineNum"> 681 </span> : { return _M_ok; } -<span class="lineNum"> 682 </span> : -<span class="lineNum"> 683 </span> : private: -<span class="lineNum"> 684 </span> : bool _M_ok; -<span class="lineNum"> 685 </span> : }; -<span class="lineNum"> 686 </span> : -<span class="lineNum"> 687 </span> : // [27.6.1.2.3] character extraction templates -<span class="lineNum"> 688 </span> : //@{ -<span class="lineNum"> 689 </span> : /** -<span class="lineNum"> 690 </span> : * @brief Character extractors -<span class="lineNum"> 691 </span> : * @param in An input stream. -<span class="lineNum"> 692 </span> : * @param c A character reference. -<span class="lineNum"> 693 </span> : * @return in -<span class="lineNum"> 694 </span> : * -<span class="lineNum"> 695 </span> : * Behaves like one of the formatted arithmetic extractors described in -<span class="lineNum"> 696 </span> : * std::basic_istream. After constructing a sentry object with good -<span class="lineNum"> 697 </span> : * status, this function extracts a character (if one is available) and -<span class="lineNum"> 698 </span> : * stores it in @a c. Otherwise, sets failbit in the input stream. -<span class="lineNum"> 699 </span> : */ -<span class="lineNum"> 700 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 701 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 702 </span> : operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c); -<span class="lineNum"> 703 </span> : -<span class="lineNum"> 704 </span> : template<class _Traits> -<span class="lineNum"> 705 </span> : inline basic_istream<char, _Traits>& -<span class="lineNum"> 706 </span> : operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c) -<span class="lineNum"> 707 </span> : { return (__in >> reinterpret_cast<char&>(__c)); } -<span class="lineNum"> 708 </span> : -<span class="lineNum"> 709 </span> : template<class _Traits> -<span class="lineNum"> 710 </span> : inline basic_istream<char, _Traits>& -<span class="lineNum"> 711 </span> : operator>>(basic_istream<char, _Traits>& __in, signed char& __c) -<span class="lineNum"> 712 </span> : { return (__in >> reinterpret_cast<char&>(__c)); } -<span class="lineNum"> 713 </span> : //@} -<span class="lineNum"> 714 </span> : -<span class="lineNum"> 715 </span> : //@{ -<span class="lineNum"> 716 </span> : /** -<span class="lineNum"> 717 </span> : * @brief Character string extractors -<span class="lineNum"> 718 </span> : * @param in An input stream. -<span class="lineNum"> 719 </span> : * @param s A pointer to a character array. -<span class="lineNum"> 720 </span> : * @return in -<span class="lineNum"> 721 </span> : * -<span class="lineNum"> 722 </span> : * Behaves like one of the formatted arithmetic extractors described in -<span class="lineNum"> 723 </span> : * std::basic_istream. After constructing a sentry object with good -<span class="lineNum"> 724 </span> : * status, this function extracts up to @c n characters and stores them -<span class="lineNum"> 725 </span> : * into the array starting at @a s. @c n is defined as: -<span class="lineNum"> 726 </span> : * -<span class="lineNum"> 727 </span> : * - if @c width() is greater than zero, @c n is width() -<span class="lineNum"> 728 </span> : * - otherwise @c n is "the number of elements of the largest array of -<span class="lineNum"> 729 </span> : * @c char_type that can store a terminating @c eos." [27.6.1.2.3]/6 -<span class="lineNum"> 730 </span> : * -<span class="lineNum"> 731 </span> : * Characters are extracted and stored until one of the following happens: -<span class="lineNum"> 732 </span> : * - @c n-1 characters are stored -<span class="lineNum"> 733 </span> : * - EOF is reached -<span class="lineNum"> 734 </span> : * - the next character is whitespace according to the current locale -<span class="lineNum"> 735 </span> : * - the next character is a null byte (i.e., @c charT() ) -<span class="lineNum"> 736 </span> : * -<span class="lineNum"> 737 </span> : * @c width(0) is then called for the input stream. -<span class="lineNum"> 738 </span> : * -<span class="lineNum"> 739 </span> : * If no characters are extracted, sets failbit. -<span class="lineNum"> 740 </span> : */ -<span class="lineNum"> 741 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 742 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 743 </span> : operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s); -<span class="lineNum"> 744 </span> : -<span class="lineNum"> 745 </span> : // Explicit specialization declaration, defined in src/istream.cc. -<span class="lineNum"> 746 </span> : template<> -<span class="lineNum"> 747 </span> : basic_istream<char>& -<span class="lineNum"> 748 </span> : operator>>(basic_istream<char>& __in, char* __s); -<span class="lineNum"> 749 </span> : -<span class="lineNum"> 750 </span> : template<class _Traits> -<span class="lineNum"> 751 </span> : inline basic_istream<char, _Traits>& -<span class="lineNum"> 752 </span> : operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s) -<span class="lineNum"> 753 </span> : { return (__in >> reinterpret_cast<char*>(__s)); } -<span class="lineNum"> 754 </span> : -<span class="lineNum"> 755 </span> : template<class _Traits> -<span class="lineNum"> 756 </span> : inline basic_istream<char, _Traits>& -<span class="lineNum"> 757 </span> : operator>>(basic_istream<char, _Traits>& __in, signed char* __s) -<span class="lineNum"> 758 </span> : { return (__in >> reinterpret_cast<char*>(__s)); } -<span class="lineNum"> 759 </span> : //@} -<span class="lineNum"> 760 </span> : -<span class="lineNum"> 761 </span> : // 27.6.1.5 Template class basic_iostream -<span class="lineNum"> 762 </span> : /** -<span class="lineNum"> 763 </span> : * @brief Merging istream and ostream capabilities. -<span class="lineNum"> 764 </span> : * -<span class="lineNum"> 765 </span> : * This class multiply inherits from the input and output stream classes -<span class="lineNum"> 766 </span> : * simply to provide a single interface. -<span class="lineNum"> 767 </span> : */ -<span class="lineNum"> 768 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 769 </span> : class basic_iostream -<span class="lineNum"> 770 </span> : : public basic_istream<_CharT, _Traits>, -<span class="lineNum"> 771 </span> : public basic_ostream<_CharT, _Traits> -<span class="lineNum"> 772 </span> : { -<span class="lineNum"> 773 </span> : public: -<span class="lineNum"> 774 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 775 </span> : // 271. basic_iostream missing typedefs -<span class="lineNum"> 776 </span> : // Types (inherited): -<span class="lineNum"> 777 </span> : typedef _CharT char_type; -<span class="lineNum"> 778 </span> : typedef typename _Traits::int_type int_type; -<span class="lineNum"> 779 </span> : typedef typename _Traits::pos_type pos_type; -<span class="lineNum"> 780 </span> : typedef typename _Traits::off_type off_type; -<span class="lineNum"> 781 </span> : typedef _Traits traits_type; -<span class="lineNum"> 782 </span> : -<span class="lineNum"> 783 </span> : // Non-standard Types: -<span class="lineNum"> 784 </span> : typedef basic_istream<_CharT, _Traits> __istream_type; -<span class="lineNum"> 785 </span> : typedef basic_ostream<_CharT, _Traits> __ostream_type; -<span class="lineNum"> 786 </span> : -<span class="lineNum"> 787 </span> : /** -<span class="lineNum"> 788 </span> : * @brief Constructor does nothing. -<span class="lineNum"> 789 </span> : * -<span class="lineNum"> 790 </span> : * Both of the parent classes are initialized with the same -<span class="lineNum"> 791 </span> : * streambuf pointer passed to this constructor. -<span class="lineNum"> 792 </span> : */ -<span class="lineNum"> 793 </span> : explicit -<span class="lineNum"> 794 </span> : basic_iostream(basic_streambuf<_CharT, _Traits>* __sb) -<span class="lineNum"> 795 </span> : : __istream_type(__sb), __ostream_type(__sb) { } -<span class="lineNum"> 796 </span> : -<span class="lineNum"> 797 </span> : /** -<span class="lineNum"> 798 </span> : * @brief Destructor does nothing. -<span class="lineNum"> 799 </span> : */ -<span class="lineNum"> 800 </span> : virtual -<span class="lineNum"> 801 </span><span class="lineNoCov"> 0 : ~basic_iostream() { }</span> -<span class="lineNum"> 802 </span> : -<span class="lineNum"> 803 </span> : protected: -<span class="lineNum"> 804 </span><span class="lineNoCov"> 0 : basic_iostream()</span> -<span class="lineNum"> 805 </span><span class="lineNoCov"> 0 : : __istream_type(), __ostream_type() { }</span> -<span class="lineNum"> 806 </span> : }; -<span class="lineNum"> 807 </span> : -<span class="lineNum"> 808 </span> : // [27.6.1.4] standard basic_istream manipulators -<span class="lineNum"> 809 </span> : /** -<span class="lineNum"> 810 </span> : * @brief Quick and easy way to eat whitespace -<span class="lineNum"> 811 </span> : * -<span class="lineNum"> 812 </span> : * This manipulator extracts whitespace characters, stopping when the -<span class="lineNum"> 813 </span> : * next character is non-whitespace, or when the input sequence is empty. -<span class="lineNum"> 814 </span> : * If the sequence is empty, @c eofbit is set in the stream, but not -<span class="lineNum"> 815 </span> : * @c failbit. -<span class="lineNum"> 816 </span> : * -<span class="lineNum"> 817 </span> : * The current locale is used to distinguish whitespace characters. -<span class="lineNum"> 818 </span> : * -<span class="lineNum"> 819 </span> : * Example: -<span class="lineNum"> 820 </span> : * @code -<span class="lineNum"> 821 </span> : * MyClass mc; -<span class="lineNum"> 822 </span> : * -<span class="lineNum"> 823 </span> : * std::cin >> std::ws >> mc; -<span class="lineNum"> 824 </span> : * @endcode -<span class="lineNum"> 825 </span> : * will skip leading whitespace before calling operator>> on cin and your -<span class="lineNum"> 826 </span> : * object. Note that the same effect can be achieved by creating a -<span class="lineNum"> 827 </span> : * std::basic_istream::sentry inside your definition of operator>>. -<span class="lineNum"> 828 </span> : */ -<span class="lineNum"> 829 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 830 </span> : basic_istream<_CharT, _Traits>& -<span class="lineNum"> 831 </span> : ws(basic_istream<_CharT, _Traits>& __is); -<span class="lineNum"> 832 </span> : -<span class="lineNum"> 833 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 834 </span> : -<span class="lineNum"> 835 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 836 </span> : # include <bits/istream.tcc> -<span class="lineNum"> 837 </span> : #endif -<span class="lineNum"> 838 </span> : -<span class="lineNum"> 839 </span> : #endif /* _GLIBCXX_ISTREAM */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/new.gcov.html b/rep/usr/include/c++/4.3/new.gcov.html deleted file mode 100644 index 991b58e..0000000 --- a/rep/usr/include/c++/4.3/new.gcov.html +++ /dev/null @@ -1,183 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/new</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - new</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">50.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // The -*- C++ -*- dynamic memory management header. -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, -<span class="lineNum"> 4 </span> : // 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 5 </span> : // Free Software Foundation -<span class="lineNum"> 6 </span> : -<span class="lineNum"> 7 </span> : // This file is part of GCC. -<span class="lineNum"> 8 </span> : // -<span class="lineNum"> 9 </span> : // GCC is free software; you can redistribute it and/or modify -<span class="lineNum"> 10 </span> : // it under the terms of the GNU General Public License as published by -<span class="lineNum"> 11 </span> : // the Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 12 </span> : // any later version. -<span class="lineNum"> 13 </span> : // -<span class="lineNum"> 14 </span> : // GCC is distributed in the hope that it will be useful, -<span class="lineNum"> 15 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 16 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 17 </span> : // GNU General Public License for more details. -<span class="lineNum"> 18 </span> : // -<span class="lineNum"> 19 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 20 </span> : // along with GCC; see the file COPYING. If not, write to -<span class="lineNum"> 21 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 22 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 25 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 26 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 27 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 28 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 30 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 31 </span> : // the GNU General Public License. -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /** @file new -<span class="lineNum"> 34 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * The header @c new defines several functions to manage dynamic memory and -<span class="lineNum"> 37 </span> : * handling memory allocation errors; see -<span class="lineNum"> 38 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/18_support/howto.html#4 for more. -<span class="lineNum"> 39 </span> : */ -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #ifndef _NEW -<span class="lineNum"> 42 </span> : #define _NEW -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #include <cstddef> -<span class="lineNum"> 45 </span> : #include <exception> -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : #pragma GCC visibility push(default) -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : extern "C++" { -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : namespace std -<span class="lineNum"> 52 </span> : { -<span class="lineNum"> 53 </span> : /** -<span class="lineNum"> 54 </span> : * @brief Exception possibly thrown by @c new. -<span class="lineNum"> 55 </span> : * -<span class="lineNum"> 56 </span> : * @c bad_alloc (or classes derived from it) is used to report allocation -<span class="lineNum"> 57 </span> : * errors from the throwing forms of @c new. */ -<span class="lineNum"> 58 </span> : class bad_alloc : public exception -<span class="lineNum"> 59 </span> : { -<span class="lineNum"> 60 </span> : public: -<span class="lineNum"> 61 </span> : bad_alloc() throw() { } -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : // This declaration is not useless: -<span class="lineNum"> 64 </span> : // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 -<span class="lineNum"> 65 </span> : virtual ~bad_alloc() throw(); -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : // See comment in eh_exception.cc. -<span class="lineNum"> 68 </span> : virtual const char* what() const throw(); -<span class="lineNum"> 69 </span> : }; -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : struct nothrow_t { }; -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : extern const nothrow_t nothrow; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : /** If you write your own error handler to be called by @c new, it must -<span class="lineNum"> 76 </span> : * be of this type. */ -<span class="lineNum"> 77 </span> : typedef void (*new_handler)(); -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : /// Takes a replacement handler as the argument, returns the -<span class="lineNum"> 80 </span> : /// previous handler. -<span class="lineNum"> 81 </span> : new_handler set_new_handler(new_handler) throw(); -<span class="lineNum"> 82 </span> : } // namespace std -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : //@{ -<span class="lineNum"> 85 </span> : /** These are replaceable signatures: -<span class="lineNum"> 86 </span> : * - normal single new and delete (no arguments, throw @c bad_alloc on error) -<span class="lineNum"> 87 </span> : * - normal array new and delete (same) -<span class="lineNum"> 88 </span> : * - @c nothrow single new and delete (take a @c nothrow argument, return -<span class="lineNum"> 89 </span> : * @c NULL on error) -<span class="lineNum"> 90 </span> : * - @c nothrow array new and delete (same) -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * Placement new and delete signatures (take a memory address argument, -<span class="lineNum"> 93 </span> : * does nothing) may not be replaced by a user's program. -<span class="lineNum"> 94 </span> : */ -<span class="lineNum"> 95 </span> : void* operator new(std::size_t) throw (std::bad_alloc); -<span class="lineNum"> 96 </span> : void* operator new[](std::size_t) throw (std::bad_alloc); -<span class="lineNum"> 97 </span> : void operator delete(void*) throw(); -<span class="lineNum"> 98 </span> : void operator delete[](void*) throw(); -<span class="lineNum"> 99 </span> : void* operator new(std::size_t, const std::nothrow_t&) throw(); -<span class="lineNum"> 100 </span> : void* operator new[](std::size_t, const std::nothrow_t&) throw(); -<span class="lineNum"> 101 </span> : void operator delete(void*, const std::nothrow_t&) throw(); -<span class="lineNum"> 102 </span> : void operator delete[](void*, const std::nothrow_t&) throw(); -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : // Default placement versions of operator new. -<span class="lineNum"> 105 </span><span class="lineCov"> 5858225 : inline void* operator new(std::size_t, void* __p) throw() { return __p; }</span> -<span class="lineNum"> 106 </span> : inline void* operator new[](std::size_t, void* __p) throw() { return __p; } -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : // Default placement versions of operator delete. -<span class="lineNum"> 109 </span><span class="lineNoCov"> 0 : inline void operator delete (void*, void*) throw() { }</span> -<span class="lineNum"> 110 </span> : inline void operator delete[](void*, void*) throw() { } -<span class="lineNum"> 111 </span> : //@} -<span class="lineNum"> 112 </span> : } // extern "C++" -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : #pragma GCC visibility pop -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/ostream.gcov.html b/rep/usr/include/c++/4.3/ostream.gcov.html deleted file mode 100644 index b2c2c3f..0000000 --- a/rep/usr/include/c++/4.3/ostream.gcov.html +++ /dev/null @@ -1,642 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/ostream</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - ostream</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">33</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Output streams -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 -<span class="lineNum"> 5 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 6 </span> : // -<span class="lineNum"> 7 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 8 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 9 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 10 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : -<span class="lineNum"> 13 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file ostream -<span class="lineNum"> 33 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : // -<span class="lineNum"> 37 </span> : // ISO C++ 14882: 27.6.2 Output streams -<span class="lineNum"> 38 </span> : // -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : #ifndef _GLIBCXX_OSTREAM -<span class="lineNum"> 41 </span> : #define _GLIBCXX_OSTREAM 1 -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #pragma GCC system_header -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : #include <ios> -<span class="lineNum"> 46 </span> : #include <bits/ostream_insert.h> -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : // [27.6.2.1] Template class basic_ostream -<span class="lineNum"> 51 </span> : /** -<span class="lineNum"> 52 </span> : * @brief Controlling output. -<span class="lineNum"> 53 </span> : * -<span class="lineNum"> 54 </span> : * This is the base class for all output streams. It provides text -<span class="lineNum"> 55 </span> : * formatting of all builtin types, and communicates with any class -<span class="lineNum"> 56 </span> : * derived from basic_streambuf to do the actual output. -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 59 </span> : class basic_ostream : virtual public basic_ios<_CharT, _Traits> -<span class="lineNum"> 60 </span> : { -<span class="lineNum"> 61 </span> : public: -<span class="lineNum"> 62 </span> : // Types (inherited from basic_ios (27.4.4)): -<span class="lineNum"> 63 </span> : typedef _CharT char_type; -<span class="lineNum"> 64 </span> : typedef typename _Traits::int_type int_type; -<span class="lineNum"> 65 </span> : typedef typename _Traits::pos_type pos_type; -<span class="lineNum"> 66 </span> : typedef typename _Traits::off_type off_type; -<span class="lineNum"> 67 </span> : typedef _Traits traits_type; -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : // Non-standard Types: -<span class="lineNum"> 70 </span> : typedef basic_streambuf<_CharT, _Traits> __streambuf_type; -<span class="lineNum"> 71 </span> : typedef basic_ios<_CharT, _Traits> __ios_type; -<span class="lineNum"> 72 </span> : typedef basic_ostream<_CharT, _Traits> __ostream_type; -<span class="lineNum"> 73 </span> : typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > -<span class="lineNum"> 74 </span> : __num_put_type; -<span class="lineNum"> 75 </span> : typedef ctype<_CharT> __ctype_type; -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : // [27.6.2.2] constructor/destructor -<span class="lineNum"> 78 </span> : /** -<span class="lineNum"> 79 </span> : * @brief Base constructor. -<span class="lineNum"> 80 </span> : * -<span class="lineNum"> 81 </span> : * This ctor is almost never called by the user directly, rather from -<span class="lineNum"> 82 </span> : * derived classes' initialization lists, which pass a pointer to -<span class="lineNum"> 83 </span> : * their own stream buffer. -<span class="lineNum"> 84 </span> : */ -<span class="lineNum"> 85 </span> : explicit -<span class="lineNum"> 86 </span><span class="lineNoCov"> 0 : basic_ostream(__streambuf_type* __sb)</span> -<span class="lineNum"> 87 </span><span class="lineNoCov"> 0 : { this->init(__sb); }</span> -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : /** -<span class="lineNum"> 90 </span> : * @brief Base destructor. -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * This does very little apart from providing a virtual base dtor. -<span class="lineNum"> 93 </span> : */ -<span class="lineNum"> 94 </span> : virtual -<span class="lineNum"> 95 </span><span class="lineNoCov"> 0 : ~basic_ostream() { }</span> -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : // [27.6.2.3] prefix/suffix -<span class="lineNum"> 98 </span> : class sentry; -<span class="lineNum"> 99 </span> : friend class sentry; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : // [27.6.2.5] formatted output -<span class="lineNum"> 102 </span> : // [27.6.2.5.3] basic_ostream::operator<< -<span class="lineNum"> 103 </span> : //@{ -<span class="lineNum"> 104 </span> : /** -<span class="lineNum"> 105 </span> : * @brief Interface for manipulators. -<span class="lineNum"> 106 </span> : * -<span class="lineNum"> 107 </span> : * Manipulators such as @c std::endl and @c std::hex use these -<span class="lineNum"> 108 </span> : * functions in constructs like "std::cout << std::endl". For more -<span class="lineNum"> 109 </span> : * information, see the iomanip header. -<span class="lineNum"> 110 </span> : */ -<span class="lineNum"> 111 </span> : __ostream_type& -<span class="lineNum"> 112 </span><span class="lineNoCov"> 0 : operator<<(__ostream_type& (*__pf)(__ostream_type&))</span> -<span class="lineNum"> 113 </span> : { -<span class="lineNum"> 114 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 115 </span> : // DR 60. What is a formatted input function? -<span class="lineNum"> 116 </span> : // The inserters for manipulators are *not* formatted output functions. -<span class="lineNum"> 117 </span><span class="lineNoCov"> 0 : return __pf(*this);</span> -<span class="lineNum"> 118 </span> : } -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : __ostream_type& -<span class="lineNum"> 121 </span> : operator<<(__ios_type& (*__pf)(__ios_type&)) -<span class="lineNum"> 122 </span> : { -<span class="lineNum"> 123 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 124 </span> : // DR 60. What is a formatted input function? -<span class="lineNum"> 125 </span> : // The inserters for manipulators are *not* formatted output functions. -<span class="lineNum"> 126 </span> : __pf(*this); -<span class="lineNum"> 127 </span> : return *this; -<span class="lineNum"> 128 </span> : } -<span class="lineNum"> 129 </span> : -<span class="lineNum"> 130 </span> : __ostream_type& -<span class="lineNum"> 131 </span><span class="lineNoCov"> 0 : operator<<(ios_base& (*__pf) (ios_base&))</span> -<span class="lineNum"> 132 </span> : { -<span class="lineNum"> 133 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 134 </span> : // DR 60. What is a formatted input function? -<span class="lineNum"> 135 </span> : // The inserters for manipulators are *not* formatted output functions. -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : __pf(*this);</span> -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 138 </span> : } -<span class="lineNum"> 139 </span> : //@} -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : // [27.6.2.5.2] arithmetic inserters -<span class="lineNum"> 142 </span> : /** -<span class="lineNum"> 143 </span> : * @name Arithmetic Inserters -<span class="lineNum"> 144 </span> : * -<span class="lineNum"> 145 </span> : * All the @c operator<< functions (aka <em>formatted output -<span class="lineNum"> 146 </span> : * functions</em>) have some common behavior. Each starts by -<span class="lineNum"> 147 </span> : * constructing a temporary object of type std::basic_ostream::sentry. -<span class="lineNum"> 148 </span> : * This can have several effects, concluding with the setting of a -<span class="lineNum"> 149 </span> : * status flag; see the sentry documentation for more. -<span class="lineNum"> 150 </span> : * -<span class="lineNum"> 151 </span> : * If the sentry status is good, the function tries to generate -<span class="lineNum"> 152 </span> : * whatever data is appropriate for the type of the argument. -<span class="lineNum"> 153 </span> : * -<span class="lineNum"> 154 </span> : * If an exception is thrown during insertion, ios_base::badbit -<span class="lineNum"> 155 </span> : * will be turned on in the stream's error state without causing an -<span class="lineNum"> 156 </span> : * ios_base::failure to be thrown. The original exception will then -<span class="lineNum"> 157 </span> : * be rethrown. -<span class="lineNum"> 158 </span> : */ -<span class="lineNum"> 159 </span> : //@{ -<span class="lineNum"> 160 </span> : /** -<span class="lineNum"> 161 </span> : * @brief Basic arithmetic inserters -<span class="lineNum"> 162 </span> : * @param A variable of builtin type. -<span class="lineNum"> 163 </span> : * @return @c *this if successful -<span class="lineNum"> 164 </span> : * -<span class="lineNum"> 165 </span> : * These functions use the stream's current locale (specifically, the -<span class="lineNum"> 166 </span> : * @c num_get facet) to perform numeric formatting. -<span class="lineNum"> 167 </span> : */ -<span class="lineNum"> 168 </span> : __ostream_type& -<span class="lineNum"> 169 </span><span class="lineNoCov"> 0 : operator<<(long __n)</span> -<span class="lineNum"> 170 </span><span class="lineNoCov"> 0 : { return _M_insert(__n); }</span> -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : __ostream_type& -<span class="lineNum"> 173 </span> : operator<<(unsigned long __n) -<span class="lineNum"> 174 </span> : { return _M_insert(__n); } -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : __ostream_type& -<span class="lineNum"> 177 </span><span class="lineNoCov"> 0 : operator<<(bool __n)</span> -<span class="lineNum"> 178 </span><span class="lineNoCov"> 0 : { return _M_insert(__n); }</span> -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : __ostream_type& -<span class="lineNum"> 181 </span> : operator<<(short __n); -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : __ostream_type& -<span class="lineNum"> 184 </span> : operator<<(unsigned short __n) -<span class="lineNum"> 185 </span> : { -<span class="lineNum"> 186 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 187 </span> : // 117. basic_ostream uses nonexistent num_put member functions. -<span class="lineNum"> 188 </span> : return _M_insert(static_cast<unsigned long>(__n)); -<span class="lineNum"> 189 </span> : } -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : __ostream_type& -<span class="lineNum"> 192 </span> : operator<<(int __n); -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : __ostream_type& -<span class="lineNum"> 195 </span><span class="lineNoCov"> 0 : operator<<(unsigned int __n)</span> -<span class="lineNum"> 196 </span> : { -<span class="lineNum"> 197 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 198 </span> : // 117. basic_ostream uses nonexistent num_put member functions. -<span class="lineNum"> 199 </span><span class="lineNoCov"> 0 : return _M_insert(static_cast<unsigned long>(__n));</span> -<span class="lineNum"> 200 </span> : } -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : #ifdef _GLIBCXX_USE_LONG_LONG -<span class="lineNum"> 203 </span> : __ostream_type& -<span class="lineNum"> 204 </span><span class="lineNoCov"> 0 : operator<<(long long __n)</span> -<span class="lineNum"> 205 </span><span class="lineNoCov"> 0 : { return _M_insert(__n); }</span> -<span class="lineNum"> 206 </span> : -<span class="lineNum"> 207 </span> : __ostream_type& -<span class="lineNum"> 208 </span> : operator<<(unsigned long long __n) -<span class="lineNum"> 209 </span> : { return _M_insert(__n); } -<span class="lineNum"> 210 </span> : #endif -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : __ostream_type& -<span class="lineNum"> 213 </span><span class="lineNoCov"> 0 : operator<<(double __f)</span> -<span class="lineNum"> 214 </span><span class="lineNoCov"> 0 : { return _M_insert(__f); }</span> -<span class="lineNum"> 215 </span> : -<span class="lineNum"> 216 </span> : __ostream_type& -<span class="lineNum"> 217 </span> : operator<<(float __f) -<span class="lineNum"> 218 </span> : { -<span class="lineNum"> 219 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 220 </span> : // 117. basic_ostream uses nonexistent num_put member functions. -<span class="lineNum"> 221 </span> : return _M_insert(static_cast<double>(__f)); -<span class="lineNum"> 222 </span> : } -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : __ostream_type& -<span class="lineNum"> 225 </span> : operator<<(long double __f) -<span class="lineNum"> 226 </span> : { return _M_insert(__f); } -<span class="lineNum"> 227 </span> : -<span class="lineNum"> 228 </span> : __ostream_type& -<span class="lineNum"> 229 </span><span class="lineNoCov"> 0 : operator<<(const void* __p)</span> -<span class="lineNum"> 230 </span><span class="lineNoCov"> 0 : { return _M_insert(__p); }</span> -<span class="lineNum"> 231 </span> : -<span class="lineNum"> 232 </span> : /** -<span class="lineNum"> 233 </span> : * @brief Extracting from another streambuf. -<span class="lineNum"> 234 </span> : * @param sb A pointer to a streambuf -<span class="lineNum"> 235 </span> : * -<span class="lineNum"> 236 </span> : * This function behaves like one of the basic arithmetic extractors, -<span class="lineNum"> 237 </span> : * in that it also constructs a sentry object and has the same error -<span class="lineNum"> 238 </span> : * handling behavior. -<span class="lineNum"> 239 </span> : * -<span class="lineNum"> 240 </span> : * If @a sb is NULL, the stream will set failbit in its error state. -<span class="lineNum"> 241 </span> : * -<span class="lineNum"> 242 </span> : * Characters are extracted from @a sb and inserted into @c *this -<span class="lineNum"> 243 </span> : * until one of the following occurs: -<span class="lineNum"> 244 </span> : * -<span class="lineNum"> 245 </span> : * - the input stream reaches end-of-file, -<span class="lineNum"> 246 </span> : * - insertion into the output sequence fails (in this case, the -<span class="lineNum"> 247 </span> : * character that would have been inserted is not extracted), or -<span class="lineNum"> 248 </span> : * - an exception occurs while getting a character from @a sb, which -<span class="lineNum"> 249 </span> : * sets failbit in the error state -<span class="lineNum"> 250 </span> : * -<span class="lineNum"> 251 </span> : * If the function inserts no characters, failbit is set. -<span class="lineNum"> 252 </span> : */ -<span class="lineNum"> 253 </span> : __ostream_type& -<span class="lineNum"> 254 </span> : operator<<(__streambuf_type* __sb); -<span class="lineNum"> 255 </span> : //@} -<span class="lineNum"> 256 </span> : -<span class="lineNum"> 257 </span> : // [27.6.2.6] unformatted output functions -<span class="lineNum"> 258 </span> : /** -<span class="lineNum"> 259 </span> : * @name Unformatted Output Functions -<span class="lineNum"> 260 </span> : * -<span class="lineNum"> 261 </span> : * All the unformatted output functions have some common behavior. -<span class="lineNum"> 262 </span> : * Each starts by constructing a temporary object of type -<span class="lineNum"> 263 </span> : * std::basic_ostream::sentry. This has several effects, concluding -<span class="lineNum"> 264 </span> : * with the setting of a status flag; see the sentry documentation -<span class="lineNum"> 265 </span> : * for more. -<span class="lineNum"> 266 </span> : * -<span class="lineNum"> 267 </span> : * If the sentry status is good, the function tries to generate -<span class="lineNum"> 268 </span> : * whatever data is appropriate for the type of the argument. -<span class="lineNum"> 269 </span> : * -<span class="lineNum"> 270 </span> : * If an exception is thrown during insertion, ios_base::badbit -<span class="lineNum"> 271 </span> : * will be turned on in the stream's error state. If badbit is on in -<span class="lineNum"> 272 </span> : * the stream's exceptions mask, the exception will be rethrown -<span class="lineNum"> 273 </span> : * without completing its actions. -<span class="lineNum"> 274 </span> : */ -<span class="lineNum"> 275 </span> : //@{ -<span class="lineNum"> 276 </span> : /** -<span class="lineNum"> 277 </span> : * @brief Simple insertion. -<span class="lineNum"> 278 </span> : * @param c The character to insert. -<span class="lineNum"> 279 </span> : * @return *this -<span class="lineNum"> 280 </span> : * -<span class="lineNum"> 281 </span> : * Tries to insert @a c. -<span class="lineNum"> 282 </span> : * -<span class="lineNum"> 283 </span> : * @note This function is not overloaded on signed char and -<span class="lineNum"> 284 </span> : * unsigned char. -<span class="lineNum"> 285 </span> : */ -<span class="lineNum"> 286 </span> : __ostream_type& -<span class="lineNum"> 287 </span> : put(char_type __c); -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : // Core write functionality, without sentry. -<span class="lineNum"> 290 </span> : void -<span class="lineNum"> 291 </span> : _M_write(const char_type* __s, streamsize __n) -<span class="lineNum"> 292 </span> : { -<span class="lineNum"> 293 </span> : const streamsize __put = this->rdbuf()->sputn(__s, __n); -<span class="lineNum"> 294 </span> : if (__put != __n) -<span class="lineNum"> 295 </span> : this->setstate(ios_base::badbit); -<span class="lineNum"> 296 </span> : } -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : /** -<span class="lineNum"> 299 </span> : * @brief Character string insertion. -<span class="lineNum"> 300 </span> : * @param s The array to insert. -<span class="lineNum"> 301 </span> : * @param n Maximum number of characters to insert. -<span class="lineNum"> 302 </span> : * @return *this -<span class="lineNum"> 303 </span> : * -<span class="lineNum"> 304 </span> : * Characters are copied from @a s and inserted into the stream until -<span class="lineNum"> 305 </span> : * one of the following happens: -<span class="lineNum"> 306 </span> : * -<span class="lineNum"> 307 </span> : * - @a n characters are inserted -<span class="lineNum"> 308 </span> : * - inserting into the output sequence fails (in this case, badbit -<span class="lineNum"> 309 </span> : * will be set in the stream's error state) -<span class="lineNum"> 310 </span> : * -<span class="lineNum"> 311 </span> : * @note This function is not overloaded on signed char and -<span class="lineNum"> 312 </span> : * unsigned char. -<span class="lineNum"> 313 </span> : */ -<span class="lineNum"> 314 </span> : __ostream_type& -<span class="lineNum"> 315 </span> : write(const char_type* __s, streamsize __n); -<span class="lineNum"> 316 </span> : //@} -<span class="lineNum"> 317 </span> : -<span class="lineNum"> 318 </span> : /** -<span class="lineNum"> 319 </span> : * @brief Synchronizing the stream buffer. -<span class="lineNum"> 320 </span> : * @return *this -<span class="lineNum"> 321 </span> : * -<span class="lineNum"> 322 </span> : * If @c rdbuf() is a null pointer, changes nothing. -<span class="lineNum"> 323 </span> : * -<span class="lineNum"> 324 </span> : * Otherwise, calls @c rdbuf()->pubsync(), and if that returns -1, -<span class="lineNum"> 325 </span> : * sets badbit. -<span class="lineNum"> 326 </span> : */ -<span class="lineNum"> 327 </span> : __ostream_type& -<span class="lineNum"> 328 </span> : flush(); -<span class="lineNum"> 329 </span> : -<span class="lineNum"> 330 </span> : // [27.6.2.4] seek members -<span class="lineNum"> 331 </span> : /** -<span class="lineNum"> 332 </span> : * @brief Getting the current write position. -<span class="lineNum"> 333 </span> : * @return A file position object. -<span class="lineNum"> 334 </span> : * -<span class="lineNum"> 335 </span> : * If @c fail() is not false, returns @c pos_type(-1) to indicate -<span class="lineNum"> 336 </span> : * failure. Otherwise returns @c rdbuf()->pubseekoff(0,cur,out). -<span class="lineNum"> 337 </span> : */ -<span class="lineNum"> 338 </span> : pos_type -<span class="lineNum"> 339 </span> : tellp(); -<span class="lineNum"> 340 </span> : -<span class="lineNum"> 341 </span> : /** -<span class="lineNum"> 342 </span> : * @brief Changing the current write position. -<span class="lineNum"> 343 </span> : * @param pos A file position object. -<span class="lineNum"> 344 </span> : * @return *this -<span class="lineNum"> 345 </span> : * -<span class="lineNum"> 346 </span> : * If @c fail() is not true, calls @c rdbuf()->pubseekpos(pos). If -<span class="lineNum"> 347 </span> : * that function fails, sets failbit. -<span class="lineNum"> 348 </span> : */ -<span class="lineNum"> 349 </span> : __ostream_type& -<span class="lineNum"> 350 </span> : seekp(pos_type); -<span class="lineNum"> 351 </span> : -<span class="lineNum"> 352 </span> : /** -<span class="lineNum"> 353 </span> : * @brief Changing the current write position. -<span class="lineNum"> 354 </span> : * @param off A file offset object. -<span class="lineNum"> 355 </span> : * @param dir The direction in which to seek. -<span class="lineNum"> 356 </span> : * @return *this -<span class="lineNum"> 357 </span> : * -<span class="lineNum"> 358 </span> : * If @c fail() is not true, calls @c rdbuf()->pubseekoff(off,dir). -<span class="lineNum"> 359 </span> : * If that function fails, sets failbit. -<span class="lineNum"> 360 </span> : */ -<span class="lineNum"> 361 </span> : __ostream_type& -<span class="lineNum"> 362 </span> : seekp(off_type, ios_base::seekdir); -<span class="lineNum"> 363 </span> : -<span class="lineNum"> 364 </span> : protected: -<span class="lineNum"> 365 </span><span class="lineNoCov"> 0 : basic_ostream()</span> -<span class="lineNum"> 366 </span><span class="lineNoCov"> 0 : { this->init(0); }</span> -<span class="lineNum"> 367 </span> : -<span class="lineNum"> 368 </span> : template<typename _ValueT> -<span class="lineNum"> 369 </span> : __ostream_type& -<span class="lineNum"> 370 </span> : _M_insert(_ValueT __v); -<span class="lineNum"> 371 </span> : }; -<span class="lineNum"> 372 </span> : -<span class="lineNum"> 373 </span> : /** -<span class="lineNum"> 374 </span> : * @brief Performs setup work for output streams. -<span class="lineNum"> 375 </span> : * -<span class="lineNum"> 376 </span> : * Objects of this class are created before all of the standard -<span class="lineNum"> 377 </span> : * inserters are run. It is responsible for "exception-safe prefix and -<span class="lineNum"> 378 </span> : * suffix operations." Additional actions may be added by the -<span class="lineNum"> 379 </span> : * implementation, and we list them in -<span class="lineNum"> 380 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/17_intro/howto.html#5 -<span class="lineNum"> 381 </span> : * under [27.6] notes. -<span class="lineNum"> 382 </span> : */ -<span class="lineNum"> 383 </span> : template <typename _CharT, typename _Traits> -<span class="lineNum"> 384 </span> : class basic_ostream<_CharT, _Traits>::sentry -<span class="lineNum"> 385 </span> : { -<span class="lineNum"> 386 </span> : // Data Members: -<span class="lineNum"> 387 </span> : bool _M_ok; -<span class="lineNum"> 388 </span> : basic_ostream<_CharT, _Traits>& _M_os; -<span class="lineNum"> 389 </span> : -<span class="lineNum"> 390 </span> : public: -<span class="lineNum"> 391 </span> : /** -<span class="lineNum"> 392 </span> : * @brief The constructor performs preparatory work. -<span class="lineNum"> 393 </span> : * @param os The output stream to guard. -<span class="lineNum"> 394 </span> : * -<span class="lineNum"> 395 </span> : * If the stream state is good (@a os.good() is true), then if the -<span class="lineNum"> 396 </span> : * stream is tied to another output stream, @c is.tie()->flush() -<span class="lineNum"> 397 </span> : * is called to synchronize the output sequences. -<span class="lineNum"> 398 </span> : * -<span class="lineNum"> 399 </span> : * If the stream state is still good, then the sentry state becomes -<span class="lineNum"> 400 </span> : * true ("okay"). -<span class="lineNum"> 401 </span> : */ -<span class="lineNum"> 402 </span> : explicit -<span class="lineNum"> 403 </span> : sentry(basic_ostream<_CharT, _Traits>& __os); -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : /** -<span class="lineNum"> 406 </span> : * @brief Possibly flushes the stream. -<span class="lineNum"> 407 </span> : * -<span class="lineNum"> 408 </span> : * If @c ios_base::unitbuf is set in @c os.flags(), and -<span class="lineNum"> 409 </span> : * @c std::uncaught_exception() is true, the sentry destructor calls -<span class="lineNum"> 410 </span> : * @c flush() on the output stream. -<span class="lineNum"> 411 </span> : */ -<span class="lineNum"> 412 </span> : ~sentry() -<span class="lineNum"> 413 </span> : { -<span class="lineNum"> 414 </span> : // XXX MT -<span class="lineNum"> 415 </span> : if (bool(_M_os.flags() & ios_base::unitbuf) && !uncaught_exception()) -<span class="lineNum"> 416 </span> : { -<span class="lineNum"> 417 </span> : // Can't call flush directly or else will get into recursive lock. -<span class="lineNum"> 418 </span> : if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1) -<span class="lineNum"> 419 </span> : _M_os.setstate(ios_base::badbit); -<span class="lineNum"> 420 </span> : } -<span class="lineNum"> 421 </span> : } -<span class="lineNum"> 422 </span> : -<span class="lineNum"> 423 </span> : /** -<span class="lineNum"> 424 </span> : * @brief Quick status checking. -<span class="lineNum"> 425 </span> : * @return The sentry state. -<span class="lineNum"> 426 </span> : * -<span class="lineNum"> 427 </span> : * For ease of use, sentries may be converted to booleans. The -<span class="lineNum"> 428 </span> : * return value is that of the sentry state (true == okay). -<span class="lineNum"> 429 </span> : */ -<span class="lineNum"> 430 </span> : operator bool() const -<span class="lineNum"> 431 </span> : { return _M_ok; } -<span class="lineNum"> 432 </span> : }; -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : // [27.6.2.5.4] character insertion templates -<span class="lineNum"> 435 </span> : //@{ -<span class="lineNum"> 436 </span> : /** -<span class="lineNum"> 437 </span> : * @brief Character inserters -<span class="lineNum"> 438 </span> : * @param out An output stream. -<span class="lineNum"> 439 </span> : * @param c A character. -<span class="lineNum"> 440 </span> : * @return out -<span class="lineNum"> 441 </span> : * -<span class="lineNum"> 442 </span> : * Behaves like one of the formatted arithmetic inserters described in -<span class="lineNum"> 443 </span> : * std::basic_ostream. After constructing a sentry object with good -<span class="lineNum"> 444 </span> : * status, this function inserts a single character and any required -<span class="lineNum"> 445 </span> : * padding (as determined by [22.2.2.2.2]). @c out.width(0) is then -<span class="lineNum"> 446 </span> : * called. -<span class="lineNum"> 447 </span> : * -<span class="lineNum"> 448 </span> : * If @a c is of type @c char and the character type of the stream is not -<span class="lineNum"> 449 </span> : * @c char, the character is widened before insertion. -<span class="lineNum"> 450 </span> : */ -<span class="lineNum"> 451 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 452 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 453 </span> : operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c) -<span class="lineNum"> 454 </span> : { return __ostream_insert(__out, &__c, 1); } -<span class="lineNum"> 455 </span> : -<span class="lineNum"> 456 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 457 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 458 </span> : operator<<(basic_ostream<_CharT, _Traits>& __out, char __c) -<span class="lineNum"> 459 </span> : { return (__out << __out.widen(__c)); } -<span class="lineNum"> 460 </span> : -<span class="lineNum"> 461 </span> : // Specialization -<span class="lineNum"> 462 </span> : template <class _Traits> -<span class="lineNum"> 463 </span> : inline basic_ostream<char, _Traits>& -<span class="lineNum"> 464 </span><span class="lineNoCov"> 0 : operator<<(basic_ostream<char, _Traits>& __out, char __c)</span> -<span class="lineNum"> 465 </span><span class="lineNoCov"> 0 : { return __ostream_insert(__out, &__c, 1); }</span> -<span class="lineNum"> 466 </span> : -<span class="lineNum"> 467 </span> : // Signed and unsigned -<span class="lineNum"> 468 </span> : template<class _Traits> -<span class="lineNum"> 469 </span> : inline basic_ostream<char, _Traits>& -<span class="lineNum"> 470 </span> : operator<<(basic_ostream<char, _Traits>& __out, signed char __c) -<span class="lineNum"> 471 </span> : { return (__out << static_cast<char>(__c)); } -<span class="lineNum"> 472 </span> : -<span class="lineNum"> 473 </span> : template<class _Traits> -<span class="lineNum"> 474 </span> : inline basic_ostream<char, _Traits>& -<span class="lineNum"> 475 </span> : operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c) -<span class="lineNum"> 476 </span> : { return (__out << static_cast<char>(__c)); } -<span class="lineNum"> 477 </span> : //@} -<span class="lineNum"> 478 </span> : -<span class="lineNum"> 479 </span> : //@{ -<span class="lineNum"> 480 </span> : /** -<span class="lineNum"> 481 </span> : * @brief String inserters -<span class="lineNum"> 482 </span> : * @param out An output stream. -<span class="lineNum"> 483 </span> : * @param s A character string. -<span class="lineNum"> 484 </span> : * @return out -<span class="lineNum"> 485 </span> : * @pre @a s must be a non-NULL pointer -<span class="lineNum"> 486 </span> : * -<span class="lineNum"> 487 </span> : * Behaves like one of the formatted arithmetic inserters described in -<span class="lineNum"> 488 </span> : * std::basic_ostream. After constructing a sentry object with good -<span class="lineNum"> 489 </span> : * status, this function inserts @c traits::length(s) characters starting -<span class="lineNum"> 490 </span> : * at @a s, widened if necessary, followed by any required padding (as -<span class="lineNum"> 491 </span> : * determined by [22.2.2.2.2]). @c out.width(0) is then called. -<span class="lineNum"> 492 </span> : */ -<span class="lineNum"> 493 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 494 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 495 </span> : operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) -<span class="lineNum"> 496 </span> : { -<span class="lineNum"> 497 </span> : if (!__s) -<span class="lineNum"> 498 </span> : __out.setstate(ios_base::badbit); -<span class="lineNum"> 499 </span> : else -<span class="lineNum"> 500 </span> : __ostream_insert(__out, __s, -<span class="lineNum"> 501 </span> : static_cast<streamsize>(_Traits::length(__s))); -<span class="lineNum"> 502 </span> : return __out; -<span class="lineNum"> 503 </span> : } -<span class="lineNum"> 504 </span> : -<span class="lineNum"> 505 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 506 </span> : basic_ostream<_CharT, _Traits> & -<span class="lineNum"> 507 </span> : operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s); -<span class="lineNum"> 508 </span> : -<span class="lineNum"> 509 </span> : // Partial specializations -<span class="lineNum"> 510 </span> : template<class _Traits> -<span class="lineNum"> 511 </span> : inline basic_ostream<char, _Traits>& -<span class="lineNum"> 512 </span><span class="lineNoCov"> 0 : operator<<(basic_ostream<char, _Traits>& __out, const char* __s)</span> -<span class="lineNum"> 513 </span> : { -<span class="lineNum"> 514 </span><span class="lineNoCov"> 0 : if (!__s)</span> -<span class="lineNum"> 515 </span><span class="lineNoCov"> 0 : __out.setstate(ios_base::badbit);</span> -<span class="lineNum"> 516 </span> : else -<span class="lineNum"> 517 </span><span class="lineNoCov"> 0 : __ostream_insert(__out, __s,</span> -<span class="lineNum"> 518 </span> : static_cast<streamsize>(_Traits::length(__s))); -<span class="lineNum"> 519 </span><span class="lineNoCov"> 0 : return __out;</span> -<span class="lineNum"> 520 </span> : } -<span class="lineNum"> 521 </span> : -<span class="lineNum"> 522 </span> : // Signed and unsigned -<span class="lineNum"> 523 </span> : template<class _Traits> -<span class="lineNum"> 524 </span> : inline basic_ostream<char, _Traits>& -<span class="lineNum"> 525 </span> : operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s) -<span class="lineNum"> 526 </span> : { return (__out << reinterpret_cast<const char*>(__s)); } -<span class="lineNum"> 527 </span> : -<span class="lineNum"> 528 </span> : template<class _Traits> -<span class="lineNum"> 529 </span> : inline basic_ostream<char, _Traits> & -<span class="lineNum"> 530 </span> : operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s) -<span class="lineNum"> 531 </span> : { return (__out << reinterpret_cast<const char*>(__s)); } -<span class="lineNum"> 532 </span> : //@} -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : // [27.6.2.7] standard basic_ostream manipulators -<span class="lineNum"> 535 </span> : /** -<span class="lineNum"> 536 </span> : * @brief Write a newline and flush the stream. -<span class="lineNum"> 537 </span> : * -<span class="lineNum"> 538 </span> : * This manipulator is often mistakenly used when a simple newline is -<span class="lineNum"> 539 </span> : * desired, leading to poor buffering performance. See -<span class="lineNum"> 540 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for more -<span class="lineNum"> 541 </span> : * on this subject. -<span class="lineNum"> 542 </span> : */ -<span class="lineNum"> 543 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 544 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 545 </span><span class="lineNoCov"> 0 : endl(basic_ostream<_CharT, _Traits>& __os)</span> -<span class="lineNum"> 546 </span><span class="lineNoCov"> 0 : { return flush(__os.put(__os.widen('\n'))); }</span> -<span class="lineNum"> 547 </span> : -<span class="lineNum"> 548 </span> : /** -<span class="lineNum"> 549 </span> : * @brief Write a null character into the output sequence. -<span class="lineNum"> 550 </span> : * -<span class="lineNum"> 551 </span> : * "Null character" is @c CharT() by definition. For CharT of @c char, -<span class="lineNum"> 552 </span> : * this correctly writes the ASCII @c NUL character string terminator. -<span class="lineNum"> 553 </span> : */ -<span class="lineNum"> 554 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 555 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 556 </span> : ends(basic_ostream<_CharT, _Traits>& __os) -<span class="lineNum"> 557 </span> : { return __os.put(_CharT()); } -<span class="lineNum"> 558 </span> : -<span class="lineNum"> 559 </span> : /** -<span class="lineNum"> 560 </span> : * @brief Flushes the output stream. -<span class="lineNum"> 561 </span> : * -<span class="lineNum"> 562 </span> : * This manipulator simply calls the stream's @c flush() member function. -<span class="lineNum"> 563 </span> : */ -<span class="lineNum"> 564 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 565 </span> : inline basic_ostream<_CharT, _Traits>& -<span class="lineNum"> 566 </span><span class="lineNoCov"> 0 : flush(basic_ostream<_CharT, _Traits>& __os)</span> -<span class="lineNum"> 567 </span><span class="lineNoCov"> 0 : { return __os.flush(); }</span> -<span class="lineNum"> 568 </span> : -<span class="lineNum"> 569 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 570 </span> : -<span class="lineNum"> 571 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 572 </span> : # include <bits/ostream.tcc> -<span class="lineNum"> 573 </span> : #endif -<span class="lineNum"> 574 </span> : -<span class="lineNum"> 575 </span> : #endif /* _GLIBCXX_OSTREAM */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/sstream.gcov.html b/rep/usr/include/c++/4.3/sstream.gcov.html deleted file mode 100644 index 0254a8d..0000000 --- a/rep/usr/include/c++/4.3/sstream.gcov.html +++ /dev/null @@ -1,642 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/sstream</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - sstream</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">43</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // String based streams -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2008 Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 18 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 19 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 20 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /** @file sstream -<span class="lineNum"> 32 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : // -<span class="lineNum"> 36 </span> : // ISO C++ 14882: 27.7 String-based streams -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : #ifndef _GLIBCXX_SSTREAM -<span class="lineNum"> 40 </span> : #define _GLIBCXX_SSTREAM 1 -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #pragma GCC system_header -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #include <istream> -<span class="lineNum"> 45 </span> : #include <ostream> -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : // [27.7.1] template class basic_stringbuf -<span class="lineNum"> 50 </span> : /** -<span class="lineNum"> 51 </span> : * @brief The actual work of input and output (for std::string). -<span class="lineNum"> 52 </span> : * -<span class="lineNum"> 53 </span> : * This class associates either or both of its input and output sequences -<span class="lineNum"> 54 </span> : * with a sequence of characters, which can be initialized from, or made -<span class="lineNum"> 55 </span> : * available as, a @c std::basic_string. (Paraphrased from [27.7.1]/1.) -<span class="lineNum"> 56 </span> : * -<span class="lineNum"> 57 </span> : * For this class, open modes (of type @c ios_base::openmode) have -<span class="lineNum"> 58 </span> : * @c in set if the input sequence can be read, and @c out set if the -<span class="lineNum"> 59 </span> : * output sequence can be written. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 62 </span> : class basic_stringbuf : public basic_streambuf<_CharT, _Traits> -<span class="lineNum"> 63 </span> : { -<span class="lineNum"> 64 </span> : public: -<span class="lineNum"> 65 </span> : // Types: -<span class="lineNum"> 66 </span> : typedef _CharT char_type; -<span class="lineNum"> 67 </span> : typedef _Traits traits_type; -<span class="lineNum"> 68 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 69 </span> : // 251. basic_stringbuf missing allocator_type -<span class="lineNum"> 70 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 71 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 72 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 73 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : typedef basic_streambuf<char_type, traits_type> __streambuf_type; -<span class="lineNum"> 76 </span> : typedef basic_string<char_type, _Traits, _Alloc> __string_type; -<span class="lineNum"> 77 </span> : typedef typename __string_type::size_type __size_type; -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : protected: -<span class="lineNum"> 80 </span> : /// Place to stash in || out || in | out settings for current stringbuf. -<span class="lineNum"> 81 </span> : ios_base::openmode _M_mode; -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : // Data Members: -<span class="lineNum"> 84 </span> : __string_type _M_string; -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : public: -<span class="lineNum"> 87 </span> : // Constructors: -<span class="lineNum"> 88 </span> : /** -<span class="lineNum"> 89 </span> : * @brief Starts with an empty string buffer. -<span class="lineNum"> 90 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 91 </span> : * -<span class="lineNum"> 92 </span> : * The default constructor initializes the parent class using its -<span class="lineNum"> 93 </span> : * own default ctor. -<span class="lineNum"> 94 </span> : */ -<span class="lineNum"> 95 </span> : explicit -<span class="lineNum"> 96 </span><span class="lineNoCov"> 0 : basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out)</span> -<span class="lineNum"> 97 </span><span class="lineNoCov"> 0 : : __streambuf_type(), _M_mode(__mode), _M_string()</span> -<span class="lineNum"> 98 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : /** -<span class="lineNum"> 101 </span> : * @brief Starts with an existing string buffer. -<span class="lineNum"> 102 </span> : * @param str A string to copy as a starting buffer. -<span class="lineNum"> 103 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 104 </span> : * -<span class="lineNum"> 105 </span> : * This constructor initializes the parent class using its -<span class="lineNum"> 106 </span> : * own default ctor. -<span class="lineNum"> 107 </span> : */ -<span class="lineNum"> 108 </span> : explicit -<span class="lineNum"> 109 </span> : basic_stringbuf(const __string_type& __str, -<span class="lineNum"> 110 </span><span class="lineNoCov"> 0 : ios_base::openmode __mode = ios_base::in | ios_base::out)</span> -<span class="lineNum"> 111 </span><span class="lineNoCov"> 0 : : __streambuf_type(), _M_mode(), _M_string(__str.data(), __str.size())</span> -<span class="lineNum"> 112 </span><span class="lineNoCov"> 0 : { _M_stringbuf_init(__mode); }</span> -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : // Get and set: -<span class="lineNum"> 115 </span> : /** -<span class="lineNum"> 116 </span> : * @brief Copying out the string buffer. -<span class="lineNum"> 117 </span> : * @return A copy of one of the underlying sequences. -<span class="lineNum"> 118 </span> : * -<span class="lineNum"> 119 </span> : * "If the buffer is only created in input mode, the underlying -<span class="lineNum"> 120 </span> : * character sequence is equal to the input sequence; otherwise, it -<span class="lineNum"> 121 </span> : * is equal to the output sequence." [27.7.1.2]/1 -<span class="lineNum"> 122 </span> : */ -<span class="lineNum"> 123 </span> : __string_type -<span class="lineNum"> 124 </span><span class="lineNoCov"> 0 : str() const</span> -<span class="lineNum"> 125 </span> : { -<span class="lineNum"> 126 </span><span class="lineNoCov"> 0 : __string_type __ret;</span> -<span class="lineNum"> 127 </span><span class="lineNoCov"> 0 : if (this->pptr())</span> -<span class="lineNum"> 128 </span> : { -<span class="lineNum"> 129 </span> : // The current egptr() may not be the actual string end. -<span class="lineNum"> 130 </span><span class="lineNoCov"> 0 : if (this->pptr() > this->egptr())</span> -<span class="lineNum"> 131 </span><span class="lineNoCov"> 0 : __ret = __string_type(this->pbase(), this->pptr());</span> -<span class="lineNum"> 132 </span> : else -<span class="lineNum"> 133 </span><span class="lineNoCov"> 0 : __ret = __string_type(this->pbase(), this->egptr());</span> -<span class="lineNum"> 134 </span> : } -<span class="lineNum"> 135 </span> : else -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : __ret = _M_string;</span> -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : return __ret;</span> -<span class="lineNum"> 138 </span> : } -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : /** -<span class="lineNum"> 141 </span> : * @brief Setting a new buffer. -<span class="lineNum"> 142 </span> : * @param s The string to use as a new sequence. -<span class="lineNum"> 143 </span> : * -<span class="lineNum"> 144 </span> : * Deallocates any previous stored sequence, then copies @a s to -<span class="lineNum"> 145 </span> : * use as a new one. -<span class="lineNum"> 146 </span> : */ -<span class="lineNum"> 147 </span> : void -<span class="lineNum"> 148 </span> : str(const __string_type& __s) -<span class="lineNum"> 149 </span> : { -<span class="lineNum"> 150 </span> : // Cannot use _M_string = __s, since v3 strings are COW. -<span class="lineNum"> 151 </span> : _M_string.assign(__s.data(), __s.size()); -<span class="lineNum"> 152 </span> : _M_stringbuf_init(_M_mode); -<span class="lineNum"> 153 </span> : } -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : protected: -<span class="lineNum"> 156 </span> : // Common initialization code goes here. -<span class="lineNum"> 157 </span> : void -<span class="lineNum"> 158 </span><span class="lineNoCov"> 0 : _M_stringbuf_init(ios_base::openmode __mode)</span> -<span class="lineNum"> 159 </span> : { -<span class="lineNum"> 160 </span><span class="lineNoCov"> 0 : _M_mode = __mode;</span> -<span class="lineNum"> 161 </span><span class="lineNoCov"> 0 : __size_type __len = 0;</span> -<span class="lineNum"> 162 </span><span class="lineNoCov"> 0 : if (_M_mode & (ios_base::ate | ios_base::app))</span> -<span class="lineNum"> 163 </span><span class="lineNoCov"> 0 : __len = _M_string.size();</span> -<span class="lineNum"> 164 </span><span class="lineNoCov"> 0 : _M_sync(const_cast<char_type*>(_M_string.data()), 0, __len);</span> -<span class="lineNum"> 165 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : virtual streamsize -<span class="lineNum"> 168 </span> : showmanyc() -<span class="lineNum"> 169 </span> : { -<span class="lineNum"> 170 </span> : streamsize __ret = -1; -<span class="lineNum"> 171 </span> : if (_M_mode & ios_base::in) -<span class="lineNum"> 172 </span> : { -<span class="lineNum"> 173 </span> : _M_update_egptr(); -<span class="lineNum"> 174 </span> : __ret = this->egptr() - this->gptr(); -<span class="lineNum"> 175 </span> : } -<span class="lineNum"> 176 </span> : return __ret; -<span class="lineNum"> 177 </span> : } -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : virtual int_type -<span class="lineNum"> 180 </span> : underflow(); -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : virtual int_type -<span class="lineNum"> 183 </span> : pbackfail(int_type __c = traits_type::eof()); -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : virtual int_type -<span class="lineNum"> 186 </span> : overflow(int_type __c = traits_type::eof()); -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /** -<span class="lineNum"> 189 </span> : * @brief Manipulates the buffer. -<span class="lineNum"> 190 </span> : * @param s Pointer to a buffer area. -<span class="lineNum"> 191 </span> : * @param n Size of @a s. -<span class="lineNum"> 192 </span> : * @return @c this -<span class="lineNum"> 193 </span> : * -<span class="lineNum"> 194 </span> : * If no buffer has already been created, and both @a s and @a n are -<span class="lineNum"> 195 </span> : * non-zero, then @c s is used as a buffer; see -<span class="lineNum"> 196 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 -<span class="lineNum"> 197 </span> : * for more. -<span class="lineNum"> 198 </span> : */ -<span class="lineNum"> 199 </span> : virtual __streambuf_type* -<span class="lineNum"> 200 </span> : setbuf(char_type* __s, streamsize __n) -<span class="lineNum"> 201 </span> : { -<span class="lineNum"> 202 </span> : if (__s && __n >= 0) -<span class="lineNum"> 203 </span> : { -<span class="lineNum"> 204 </span> : // This is implementation-defined behavior, and assumes -<span class="lineNum"> 205 </span> : // that an external char_type array of length __n exists -<span class="lineNum"> 206 </span> : // and has been pre-allocated. If this is not the case, -<span class="lineNum"> 207 </span> : // things will quickly blow up. -<span class="lineNum"> 208 </span> : -<span class="lineNum"> 209 </span> : // Step 1: Destroy the current internal array. -<span class="lineNum"> 210 </span> : _M_string.clear(); -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : // Step 2: Use the external array. -<span class="lineNum"> 213 </span> : _M_sync(__s, __n, 0); -<span class="lineNum"> 214 </span> : } -<span class="lineNum"> 215 </span> : return this; -<span class="lineNum"> 216 </span> : } -<span class="lineNum"> 217 </span> : -<span class="lineNum"> 218 </span> : virtual pos_type -<span class="lineNum"> 219 </span> : seekoff(off_type __off, ios_base::seekdir __way, -<span class="lineNum"> 220 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out); -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : virtual pos_type -<span class="lineNum"> 223 </span> : seekpos(pos_type __sp, -<span class="lineNum"> 224 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out); -<span class="lineNum"> 225 </span> : -<span class="lineNum"> 226 </span> : // Internal function for correctly updating the internal buffer -<span class="lineNum"> 227 </span> : // for a particular _M_string, due to initialization or re-sizing -<span class="lineNum"> 228 </span> : // of an existing _M_string. -<span class="lineNum"> 229 </span> : void -<span class="lineNum"> 230 </span> : _M_sync(char_type* __base, __size_type __i, __size_type __o); -<span class="lineNum"> 231 </span> : -<span class="lineNum"> 232 </span> : // Internal function for correctly updating egptr() to the actual -<span class="lineNum"> 233 </span> : // string end. -<span class="lineNum"> 234 </span> : void -<span class="lineNum"> 235 </span> : _M_update_egptr() -<span class="lineNum"> 236 </span> : { -<span class="lineNum"> 237 </span> : const bool __testin = _M_mode & ios_base::in; -<span class="lineNum"> 238 </span> : if (this->pptr() && this->pptr() > this->egptr()) -<span class="lineNum"> 239 </span> : if (__testin) -<span class="lineNum"> 240 </span> : this->setg(this->eback(), this->gptr(), this->pptr()); -<span class="lineNum"> 241 </span> : else -<span class="lineNum"> 242 </span> : this->setg(this->pptr(), this->pptr(), this->pptr()); -<span class="lineNum"> 243 </span> : } -<span class="lineNum"> 244 </span> : }; -<span class="lineNum"> 245 </span> : -<span class="lineNum"> 246 </span> : -<span class="lineNum"> 247 </span> : // [27.7.2] Template class basic_istringstream -<span class="lineNum"> 248 </span> : /** -<span class="lineNum"> 249 </span> : * @brief Controlling input for std::string. -<span class="lineNum"> 250 </span> : * -<span class="lineNum"> 251 </span> : * This class supports reading from objects of type std::basic_string, -<span class="lineNum"> 252 </span> : * using the inherited functions from std::basic_istream. To control -<span class="lineNum"> 253 </span> : * the associated sequence, an instance of std::basic_stringbuf is used, -<span class="lineNum"> 254 </span> : * which this page refers to as @c sb. -<span class="lineNum"> 255 </span> : */ -<span class="lineNum"> 256 </span> : template<typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 257 </span> : class basic_istringstream : public basic_istream<_CharT, _Traits> -<span class="lineNum"> 258 </span> : { -<span class="lineNum"> 259 </span> : public: -<span class="lineNum"> 260 </span> : // Types: -<span class="lineNum"> 261 </span> : typedef _CharT char_type; -<span class="lineNum"> 262 </span> : typedef _Traits traits_type; -<span class="lineNum"> 263 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 264 </span> : // 251. basic_stringbuf missing allocator_type -<span class="lineNum"> 265 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 266 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 267 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 268 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span> : // Non-standard types: -<span class="lineNum"> 271 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 272 </span> : typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; -<span class="lineNum"> 273 </span> : typedef basic_istream<char_type, traits_type> __istream_type; -<span class="lineNum"> 274 </span> : -<span class="lineNum"> 275 </span> : private: -<span class="lineNum"> 276 </span> : __stringbuf_type _M_stringbuf; -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : public: -<span class="lineNum"> 279 </span> : // Constructors: -<span class="lineNum"> 280 </span> : /** -<span class="lineNum"> 281 </span> : * @brief Default constructor starts with an empty string buffer. -<span class="lineNum"> 282 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 283 </span> : * -<span class="lineNum"> 284 </span> : * @c ios_base::in is automatically included in @a mode. -<span class="lineNum"> 285 </span> : * -<span class="lineNum"> 286 </span> : * Initializes @c sb using @c mode|in, and passes @c &sb to the base -<span class="lineNum"> 287 </span> : * class initializer. Does not allocate any buffer. -<span class="lineNum"> 288 </span> : * -<span class="lineNum"> 289 </span> : * That's a lie. We initialize the base class with NULL, because the -<span class="lineNum"> 290 </span> : * string class does its own memory management. -<span class="lineNum"> 291 </span> : */ -<span class="lineNum"> 292 </span> : explicit -<span class="lineNum"> 293 </span> : basic_istringstream(ios_base::openmode __mode = ios_base::in) -<span class="lineNum"> 294 </span> : : __istream_type(), _M_stringbuf(__mode | ios_base::in) -<span class="lineNum"> 295 </span> : { this->init(&_M_stringbuf); } -<span class="lineNum"> 296 </span> : -<span class="lineNum"> 297 </span> : /** -<span class="lineNum"> 298 </span> : * @brief Starts with an existing string buffer. -<span class="lineNum"> 299 </span> : * @param str A string to copy as a starting buffer. -<span class="lineNum"> 300 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 301 </span> : * -<span class="lineNum"> 302 </span> : * @c ios_base::in is automatically included in @a mode. -<span class="lineNum"> 303 </span> : * -<span class="lineNum"> 304 </span> : * Initializes @c sb using @a str and @c mode|in, and passes @c &sb -<span class="lineNum"> 305 </span> : * to the base class initializer. -<span class="lineNum"> 306 </span> : * -<span class="lineNum"> 307 </span> : * That's a lie. We initialize the base class with NULL, because the -<span class="lineNum"> 308 </span> : * string class does its own memory management. -<span class="lineNum"> 309 </span> : */ -<span class="lineNum"> 310 </span> : explicit -<span class="lineNum"> 311 </span> : basic_istringstream(const __string_type& __str, -<span class="lineNum"> 312 </span><span class="lineNoCov"> 0 : ios_base::openmode __mode = ios_base::in)</span> -<span class="lineNum"> 313 </span><span class="lineNoCov"> 0 : : __istream_type(), _M_stringbuf(__str, __mode | ios_base::in)</span> -<span class="lineNum"> 314 </span><span class="lineNoCov"> 0 : { this->init(&_M_stringbuf); }</span> -<span class="lineNum"> 315 </span> : -<span class="lineNum"> 316 </span> : /** -<span class="lineNum"> 317 </span> : * @brief The destructor does nothing. -<span class="lineNum"> 318 </span> : * -<span class="lineNum"> 319 </span> : * The buffer is deallocated by the stringbuf object, not the -<span class="lineNum"> 320 </span> : * formatting stream. -<span class="lineNum"> 321 </span> : */ -<span class="lineNum"> 322 </span><span class="lineNoCov"> 0 : ~basic_istringstream()</span> -<span class="lineNum"> 323 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 324 </span> : -<span class="lineNum"> 325 </span> : // Members: -<span class="lineNum"> 326 </span> : /** -<span class="lineNum"> 327 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 328 </span> : * @return The current basic_stringbuf buffer. -<span class="lineNum"> 329 </span> : * -<span class="lineNum"> 330 </span> : * This hides both signatures of std::basic_ios::rdbuf(). -<span class="lineNum"> 331 </span> : */ -<span class="lineNum"> 332 </span> : __stringbuf_type* -<span class="lineNum"> 333 </span> : rdbuf() const -<span class="lineNum"> 334 </span> : { return const_cast<__stringbuf_type*>(&_M_stringbuf); } -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : /** -<span class="lineNum"> 337 </span> : * @brief Copying out the string buffer. -<span class="lineNum"> 338 </span> : * @return @c rdbuf()->str() -<span class="lineNum"> 339 </span> : */ -<span class="lineNum"> 340 </span> : __string_type -<span class="lineNum"> 341 </span> : str() const -<span class="lineNum"> 342 </span> : { return _M_stringbuf.str(); } -<span class="lineNum"> 343 </span> : -<span class="lineNum"> 344 </span> : /** -<span class="lineNum"> 345 </span> : * @brief Setting a new buffer. -<span class="lineNum"> 346 </span> : * @param s The string to use as a new sequence. -<span class="lineNum"> 347 </span> : * -<span class="lineNum"> 348 </span> : * Calls @c rdbuf()->str(s). -<span class="lineNum"> 349 </span> : */ -<span class="lineNum"> 350 </span> : void -<span class="lineNum"> 351 </span> : str(const __string_type& __s) -<span class="lineNum"> 352 </span> : { _M_stringbuf.str(__s); } -<span class="lineNum"> 353 </span> : }; -<span class="lineNum"> 354 </span> : -<span class="lineNum"> 355 </span> : -<span class="lineNum"> 356 </span> : // [27.7.3] Template class basic_ostringstream -<span class="lineNum"> 357 </span> : /** -<span class="lineNum"> 358 </span> : * @brief Controlling output for std::string. -<span class="lineNum"> 359 </span> : * -<span class="lineNum"> 360 </span> : * This class supports writing to objects of type std::basic_string, -<span class="lineNum"> 361 </span> : * using the inherited functions from std::basic_ostream. To control -<span class="lineNum"> 362 </span> : * the associated sequence, an instance of std::basic_stringbuf is used, -<span class="lineNum"> 363 </span> : * which this page refers to as @c sb. -<span class="lineNum"> 364 </span> : */ -<span class="lineNum"> 365 </span> : template <typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 366 </span> : class basic_ostringstream : public basic_ostream<_CharT, _Traits> -<span class="lineNum"> 367 </span> : { -<span class="lineNum"> 368 </span> : public: -<span class="lineNum"> 369 </span> : // Types: -<span class="lineNum"> 370 </span> : typedef _CharT char_type; -<span class="lineNum"> 371 </span> : typedef _Traits traits_type; -<span class="lineNum"> 372 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 373 </span> : // 251. basic_stringbuf missing allocator_type -<span class="lineNum"> 374 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 375 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 376 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 377 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 378 </span> : -<span class="lineNum"> 379 </span> : // Non-standard types: -<span class="lineNum"> 380 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 381 </span> : typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; -<span class="lineNum"> 382 </span> : typedef basic_ostream<char_type, traits_type> __ostream_type; -<span class="lineNum"> 383 </span> : -<span class="lineNum"> 384 </span> : private: -<span class="lineNum"> 385 </span> : __stringbuf_type _M_stringbuf; -<span class="lineNum"> 386 </span> : -<span class="lineNum"> 387 </span> : public: -<span class="lineNum"> 388 </span> : // Constructors/destructor: -<span class="lineNum"> 389 </span> : /** -<span class="lineNum"> 390 </span> : * @brief Default constructor starts with an empty string buffer. -<span class="lineNum"> 391 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 392 </span> : * -<span class="lineNum"> 393 </span> : * @c ios_base::out is automatically included in @a mode. -<span class="lineNum"> 394 </span> : * -<span class="lineNum"> 395 </span> : * Initializes @c sb using @c mode|out, and passes @c &sb to the base -<span class="lineNum"> 396 </span> : * class initializer. Does not allocate any buffer. -<span class="lineNum"> 397 </span> : * -<span class="lineNum"> 398 </span> : * That's a lie. We initialize the base class with NULL, because the -<span class="lineNum"> 399 </span> : * string class does its own memory management. -<span class="lineNum"> 400 </span> : */ -<span class="lineNum"> 401 </span> : explicit -<span class="lineNum"> 402 </span><span class="lineNoCov"> 0 : basic_ostringstream(ios_base::openmode __mode = ios_base::out)</span> -<span class="lineNum"> 403 </span><span class="lineNoCov"> 0 : : __ostream_type(), _M_stringbuf(__mode | ios_base::out)</span> -<span class="lineNum"> 404 </span><span class="lineNoCov"> 0 : { this->init(&_M_stringbuf); }</span> -<span class="lineNum"> 405 </span> : -<span class="lineNum"> 406 </span> : /** -<span class="lineNum"> 407 </span> : * @brief Starts with an existing string buffer. -<span class="lineNum"> 408 </span> : * @param str A string to copy as a starting buffer. -<span class="lineNum"> 409 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 410 </span> : * -<span class="lineNum"> 411 </span> : * @c ios_base::out is automatically included in @a mode. -<span class="lineNum"> 412 </span> : * -<span class="lineNum"> 413 </span> : * Initializes @c sb using @a str and @c mode|out, and passes @c &sb -<span class="lineNum"> 414 </span> : * to the base class initializer. -<span class="lineNum"> 415 </span> : * -<span class="lineNum"> 416 </span> : * That's a lie. We initialize the base class with NULL, because the -<span class="lineNum"> 417 </span> : * string class does its own memory management. -<span class="lineNum"> 418 </span> : */ -<span class="lineNum"> 419 </span> : explicit -<span class="lineNum"> 420 </span> : basic_ostringstream(const __string_type& __str, -<span class="lineNum"> 421 </span> : ios_base::openmode __mode = ios_base::out) -<span class="lineNum"> 422 </span> : : __ostream_type(), _M_stringbuf(__str, __mode | ios_base::out) -<span class="lineNum"> 423 </span> : { this->init(&_M_stringbuf); } -<span class="lineNum"> 424 </span> : -<span class="lineNum"> 425 </span> : /** -<span class="lineNum"> 426 </span> : * @brief The destructor does nothing. -<span class="lineNum"> 427 </span> : * -<span class="lineNum"> 428 </span> : * The buffer is deallocated by the stringbuf object, not the -<span class="lineNum"> 429 </span> : * formatting stream. -<span class="lineNum"> 430 </span> : */ -<span class="lineNum"> 431 </span><span class="lineNoCov"> 0 : ~basic_ostringstream()</span> -<span class="lineNum"> 432 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : // Members: -<span class="lineNum"> 435 </span> : /** -<span class="lineNum"> 436 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 437 </span> : * @return The current basic_stringbuf buffer. -<span class="lineNum"> 438 </span> : * -<span class="lineNum"> 439 </span> : * This hides both signatures of std::basic_ios::rdbuf(). -<span class="lineNum"> 440 </span> : */ -<span class="lineNum"> 441 </span> : __stringbuf_type* -<span class="lineNum"> 442 </span> : rdbuf() const -<span class="lineNum"> 443 </span> : { return const_cast<__stringbuf_type*>(&_M_stringbuf); } -<span class="lineNum"> 444 </span> : -<span class="lineNum"> 445 </span> : /** -<span class="lineNum"> 446 </span> : * @brief Copying out the string buffer. -<span class="lineNum"> 447 </span> : * @return @c rdbuf()->str() -<span class="lineNum"> 448 </span> : */ -<span class="lineNum"> 449 </span> : __string_type -<span class="lineNum"> 450 </span><span class="lineNoCov"> 0 : str() const</span> -<span class="lineNum"> 451 </span><span class="lineNoCov"> 0 : { return _M_stringbuf.str(); }</span> -<span class="lineNum"> 452 </span> : -<span class="lineNum"> 453 </span> : /** -<span class="lineNum"> 454 </span> : * @brief Setting a new buffer. -<span class="lineNum"> 455 </span> : * @param s The string to use as a new sequence. -<span class="lineNum"> 456 </span> : * -<span class="lineNum"> 457 </span> : * Calls @c rdbuf()->str(s). -<span class="lineNum"> 458 </span> : */ -<span class="lineNum"> 459 </span> : void -<span class="lineNum"> 460 </span> : str(const __string_type& __s) -<span class="lineNum"> 461 </span> : { _M_stringbuf.str(__s); } -<span class="lineNum"> 462 </span> : }; -<span class="lineNum"> 463 </span> : -<span class="lineNum"> 464 </span> : -<span class="lineNum"> 465 </span> : // [27.7.4] Template class basic_stringstream -<span class="lineNum"> 466 </span> : /** -<span class="lineNum"> 467 </span> : * @brief Controlling input and output for std::string. -<span class="lineNum"> 468 </span> : * -<span class="lineNum"> 469 </span> : * This class supports reading from and writing to objects of type -<span class="lineNum"> 470 </span> : * std::basic_string, using the inherited functions from -<span class="lineNum"> 471 </span> : * std::basic_iostream. To control the associated sequence, an instance -<span class="lineNum"> 472 </span> : * of std::basic_stringbuf is used, which this page refers to as @c sb. -<span class="lineNum"> 473 </span> : */ -<span class="lineNum"> 474 </span> : template <typename _CharT, typename _Traits, typename _Alloc> -<span class="lineNum"> 475 </span> : class basic_stringstream : public basic_iostream<_CharT, _Traits> -<span class="lineNum"> 476 </span> : { -<span class="lineNum"> 477 </span> : public: -<span class="lineNum"> 478 </span> : // Types: -<span class="lineNum"> 479 </span> : typedef _CharT char_type; -<span class="lineNum"> 480 </span> : typedef _Traits traits_type; -<span class="lineNum"> 481 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 482 </span> : // 251. basic_stringbuf missing allocator_type -<span class="lineNum"> 483 </span> : typedef _Alloc allocator_type; -<span class="lineNum"> 484 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 485 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 486 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 487 </span> : -<span class="lineNum"> 488 </span> : // Non-standard Types: -<span class="lineNum"> 489 </span> : typedef basic_string<_CharT, _Traits, _Alloc> __string_type; -<span class="lineNum"> 490 </span> : typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; -<span class="lineNum"> 491 </span> : typedef basic_iostream<char_type, traits_type> __iostream_type; -<span class="lineNum"> 492 </span> : -<span class="lineNum"> 493 </span> : private: -<span class="lineNum"> 494 </span> : __stringbuf_type _M_stringbuf; -<span class="lineNum"> 495 </span> : -<span class="lineNum"> 496 </span> : public: -<span class="lineNum"> 497 </span> : // Constructors/destructors -<span class="lineNum"> 498 </span> : /** -<span class="lineNum"> 499 </span> : * @brief Default constructor starts with an empty string buffer. -<span class="lineNum"> 500 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 501 </span> : * -<span class="lineNum"> 502 </span> : * Initializes @c sb using @c mode, and passes @c &sb to the base -<span class="lineNum"> 503 </span> : * class initializer. Does not allocate any buffer. -<span class="lineNum"> 504 </span> : * -<span class="lineNum"> 505 </span> : * That's a lie. We initialize the base class with NULL, because the -<span class="lineNum"> 506 </span> : * string class does its own memory management. -<span class="lineNum"> 507 </span> : */ -<span class="lineNum"> 508 </span> : explicit -<span class="lineNum"> 509 </span><span class="lineNoCov"> 0 : basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in)</span> -<span class="lineNum"> 510 </span><span class="lineNoCov"> 0 : : __iostream_type(), _M_stringbuf(__m)</span> -<span class="lineNum"> 511 </span><span class="lineNoCov"> 0 : { this->init(&_M_stringbuf); }</span> -<span class="lineNum"> 512 </span> : -<span class="lineNum"> 513 </span> : /** -<span class="lineNum"> 514 </span> : * @brief Starts with an existing string buffer. -<span class="lineNum"> 515 </span> : * @param str A string to copy as a starting buffer. -<span class="lineNum"> 516 </span> : * @param mode Whether the buffer can read, or write, or both. -<span class="lineNum"> 517 </span> : * -<span class="lineNum"> 518 </span> : * Initializes @c sb using @a str and @c mode, and passes @c &sb -<span class="lineNum"> 519 </span> : * to the base class initializer. -<span class="lineNum"> 520 </span> : * -<span class="lineNum"> 521 </span> : * That's a lie. We initialize the base class with NULL, because the -<span class="lineNum"> 522 </span> : * string class does its own memory management. -<span class="lineNum"> 523 </span> : */ -<span class="lineNum"> 524 </span> : explicit -<span class="lineNum"> 525 </span> : basic_stringstream(const __string_type& __str, -<span class="lineNum"> 526 </span><span class="lineNoCov"> 0 : ios_base::openmode __m = ios_base::out | ios_base::in)</span> -<span class="lineNum"> 527 </span><span class="lineNoCov"> 0 : : __iostream_type(), _M_stringbuf(__str, __m)</span> -<span class="lineNum"> 528 </span><span class="lineNoCov"> 0 : { this->init(&_M_stringbuf); }</span> -<span class="lineNum"> 529 </span> : -<span class="lineNum"> 530 </span> : /** -<span class="lineNum"> 531 </span> : * @brief The destructor does nothing. -<span class="lineNum"> 532 </span> : * -<span class="lineNum"> 533 </span> : * The buffer is deallocated by the stringbuf object, not the -<span class="lineNum"> 534 </span> : * formatting stream. -<span class="lineNum"> 535 </span> : */ -<span class="lineNum"> 536 </span><span class="lineNoCov"> 0 : ~basic_stringstream()</span> -<span class="lineNum"> 537 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 538 </span> : -<span class="lineNum"> 539 </span> : // Members: -<span class="lineNum"> 540 </span> : /** -<span class="lineNum"> 541 </span> : * @brief Accessing the underlying buffer. -<span class="lineNum"> 542 </span> : * @return The current basic_stringbuf buffer. -<span class="lineNum"> 543 </span> : * -<span class="lineNum"> 544 </span> : * This hides both signatures of std::basic_ios::rdbuf(). -<span class="lineNum"> 545 </span> : */ -<span class="lineNum"> 546 </span> : __stringbuf_type* -<span class="lineNum"> 547 </span> : rdbuf() const -<span class="lineNum"> 548 </span> : { return const_cast<__stringbuf_type*>(&_M_stringbuf); } -<span class="lineNum"> 549 </span> : -<span class="lineNum"> 550 </span> : /** -<span class="lineNum"> 551 </span> : * @brief Copying out the string buffer. -<span class="lineNum"> 552 </span> : * @return @c rdbuf()->str() -<span class="lineNum"> 553 </span> : */ -<span class="lineNum"> 554 </span> : __string_type -<span class="lineNum"> 555 </span><span class="lineNoCov"> 0 : str() const</span> -<span class="lineNum"> 556 </span><span class="lineNoCov"> 0 : { return _M_stringbuf.str(); }</span> -<span class="lineNum"> 557 </span> : -<span class="lineNum"> 558 </span> : /** -<span class="lineNum"> 559 </span> : * @brief Setting a new buffer. -<span class="lineNum"> 560 </span> : * @param s The string to use as a new sequence. -<span class="lineNum"> 561 </span> : * -<span class="lineNum"> 562 </span> : * Calls @c rdbuf()->str(s). -<span class="lineNum"> 563 </span> : */ -<span class="lineNum"> 564 </span> : void -<span class="lineNum"> 565 </span> : str(const __string_type& __s) -<span class="lineNum"> 566 </span> : { _M_stringbuf.str(__s); } -<span class="lineNum"> 567 </span> : }; -<span class="lineNum"> 568 </span> : -<span class="lineNum"> 569 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 570 </span> : -<span class="lineNum"> 571 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 572 </span> : # include <bits/sstream.tcc> -<span class="lineNum"> 573 </span> : #endif -<span class="lineNum"> 574 </span> : -<span class="lineNum"> 575 </span> : #endif /* _GLIBCXX_SSTREAM */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/stdexcept.gcov.html b/rep/usr/include/c++/4.3/stdexcept.gcov.html deleted file mode 100644 index b64ecdf..0000000 --- a/rep/usr/include/c++/4.3/stdexcept.gcov.html +++ /dev/null @@ -1,215 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/stdexcept</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - stdexcept</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Standard exception classes -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2005, 2007 Free Software Foundation, Inc. -<span class="lineNum"> 4 </span> : // -<span class="lineNum"> 5 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 6 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 7 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 8 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 9 </span> : // any later version. -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : // GNU General Public License for more details. -<span class="lineNum"> 15 </span> : -<span class="lineNum"> 16 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 17 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 18 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 19 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 22 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 23 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 24 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 25 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 26 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 27 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** @file stdexcept -<span class="lineNum"> 31 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 32 </span> : */ -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : // -<span class="lineNum"> 35 </span> : // ISO C++ 19.1 Exception classes -<span class="lineNum"> 36 </span> : // -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : #ifndef _GLIBCXX_STDEXCEPT -<span class="lineNum"> 39 </span> : #define _GLIBCXX_STDEXCEPT 1 -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #pragma GCC system_header -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : #include <exception> -<span class="lineNum"> 44 </span> : #include <string> -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : /** Logic errors represent problems in the internal logic of a program; -<span class="lineNum"> 49 </span> : * in theory, these are preventable, and even detectable before the -<span class="lineNum"> 50 </span> : * program runs (e.g., violations of class invariants). -<span class="lineNum"> 51 </span> : * @brief One of two subclasses of exception. -<span class="lineNum"> 52 </span> : */ -<span class="lineNum"> 53 </span> : class logic_error : public exception -<span class="lineNum"> 54 </span> : { -<span class="lineNum"> 55 </span> : string _M_msg; -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : public: -<span class="lineNum"> 58 </span> : /** Takes a character string describing the error. */ -<span class="lineNum"> 59 </span> : explicit -<span class="lineNum"> 60 </span> : logic_error(const string& __arg); -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : virtual -<span class="lineNum"> 63 </span> : ~logic_error() throw(); -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : /** Returns a C-style character string describing the general cause of -<span class="lineNum"> 66 </span> : * the current error (the same string passed to the ctor). */ -<span class="lineNum"> 67 </span> : virtual const char* -<span class="lineNum"> 68 </span> : what() const throw(); -<span class="lineNum"> 69 </span> : }; -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : /** Thrown by the library, or by you, to report domain errors (domain in -<span class="lineNum"> 72 </span> : * the mathematical sense). */ -<span class="lineNum"> 73 </span> : class domain_error : public logic_error -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span> : public: -<span class="lineNum"> 76 </span> : explicit domain_error(const string& __arg); -<span class="lineNum"> 77 </span> : }; -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : /** Thrown to report invalid arguments to functions. */ -<span class="lineNum"> 80 </span> : class invalid_argument : public logic_error -<span class="lineNum"> 81 </span> : { -<span class="lineNum"> 82 </span> : public: -<span class="lineNum"> 83 </span> : explicit invalid_argument(const string& __arg); -<span class="lineNum"> 84 </span> : }; -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : /** Thrown when an object is constructed that would exceed its maximum -<span class="lineNum"> 87 </span> : * permitted size (e.g., a basic_string instance). */ -<span class="lineNum"> 88 </span> : class length_error : public logic_error -<span class="lineNum"> 89 </span> : { -<span class="lineNum"> 90 </span> : public: -<span class="lineNum"> 91 </span> : explicit length_error(const string& __arg); -<span class="lineNum"> 92 </span> : }; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : /** This represents an argument whose value is not within the expected -<span class="lineNum"> 95 </span> : * range (e.g., boundary checks in basic_string). */ -<span class="lineNum"> 96 </span> : class out_of_range : public logic_error -<span class="lineNum"> 97 </span><span class="lineCov"> 1 : {</span> -<span class="lineNum"> 98 </span> : public: -<span class="lineNum"> 99 </span> : explicit out_of_range(const string& __arg); -<span class="lineNum"> 100 </span> : }; -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : /** Runtime errors represent problems outside the scope of a program; -<span class="lineNum"> 103 </span> : * they cannot be easily predicted and can generally only be caught as -<span class="lineNum"> 104 </span> : * the program executes. -<span class="lineNum"> 105 </span> : * @brief One of two subclasses of exception. -<span class="lineNum"> 106 </span> : */ -<span class="lineNum"> 107 </span> : class runtime_error : public exception -<span class="lineNum"> 108 </span> : { -<span class="lineNum"> 109 </span> : string _M_msg; -<span class="lineNum"> 110 </span> : -<span class="lineNum"> 111 </span> : public: -<span class="lineNum"> 112 </span> : /** Takes a character string describing the error. */ -<span class="lineNum"> 113 </span> : explicit -<span class="lineNum"> 114 </span> : runtime_error(const string& __arg); -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : virtual -<span class="lineNum"> 117 </span> : ~runtime_error() throw(); -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : /** Returns a C-style character string describing the general cause of -<span class="lineNum"> 120 </span> : * the current error (the same string passed to the ctor). */ -<span class="lineNum"> 121 </span> : virtual const char* -<span class="lineNum"> 122 </span> : what() const throw(); -<span class="lineNum"> 123 </span> : }; -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : /** Thrown to indicate range errors in internal computations. */ -<span class="lineNum"> 126 </span> : class range_error : public runtime_error -<span class="lineNum"> 127 </span> : { -<span class="lineNum"> 128 </span> : public: -<span class="lineNum"> 129 </span> : explicit range_error(const string& __arg); -<span class="lineNum"> 130 </span> : }; -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : /** Thrown to indicate arithmetic overflow. */ -<span class="lineNum"> 133 </span> : class overflow_error : public runtime_error -<span class="lineNum"> 134 </span> : { -<span class="lineNum"> 135 </span> : public: -<span class="lineNum"> 136 </span> : explicit overflow_error(const string& __arg); -<span class="lineNum"> 137 </span> : }; -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : /** Thrown to indicate arithmetic underflow. */ -<span class="lineNum"> 140 </span> : class underflow_error : public runtime_error -<span class="lineNum"> 141 </span> : { -<span class="lineNum"> 142 </span> : public: -<span class="lineNum"> 143 </span> : explicit underflow_error(const string& __arg); -<span class="lineNum"> 144 </span> : }; -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : #endif /* _GLIBCXX_STDEXCEPT */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/streambuf.gcov.html b/rep/usr/include/c++/4.3/streambuf.gcov.html deleted file mode 100644 index f3d6dee..0000000 --- a/rep/usr/include/c++/4.3/streambuf.gcov.html +++ /dev/null @@ -1,871 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/streambuf</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - streambuf</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">36</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Stream buffer classes -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, -<span class="lineNum"> 4 </span> : // 2006, 2007, 2008 Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 18 </span> : // along with this library; see the file COPYING. If not, write to -<span class="lineNum"> 19 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 20 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /** @file streambuf -<span class="lineNum"> 32 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 33 </span> : */ -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : // -<span class="lineNum"> 36 </span> : // ISO C++ 14882: 27.5 Stream buffers -<span class="lineNum"> 37 </span> : // -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : #ifndef _GLIBXX_STREAMBUF -<span class="lineNum"> 40 </span> : #define _GLIBXX_STREAMBUF 1 -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : #pragma GCC system_header -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : #include <bits/c++config.h> -<span class="lineNum"> 45 </span> : #include <iosfwd> -<span class="lineNum"> 46 </span> : #include <bits/localefwd.h> -<span class="lineNum"> 47 </span> : #include <bits/ios_base.h> -<span class="lineNum"> 48 </span> : #include <bits/cpp_type_traits.h> -<span class="lineNum"> 49 </span> : #include <ext/type_traits.h> -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 54 </span> : streamsize -<span class="lineNum"> 55 </span> : __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*, -<span class="lineNum"> 56 </span> : basic_streambuf<_CharT, _Traits>*, bool&); -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : /** -<span class="lineNum"> 59 </span> : * @brief The actual work of input and output (interface). -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * This is a base class. Derived stream buffers each control a -<span class="lineNum"> 62 </span> : * pair of character sequences: one for input, and one for output. -<span class="lineNum"> 63 </span> : * -<span class="lineNum"> 64 </span> : * Section [27.5.1] of the standard describes the requirements and -<span class="lineNum"> 65 </span> : * behavior of stream buffer classes. That section (three paragraphs) -<span class="lineNum"> 66 </span> : * is reproduced here, for simplicity and accuracy. -<span class="lineNum"> 67 </span> : * -<span class="lineNum"> 68 </span> : * -# Stream buffers can impose various constraints on the sequences -<span class="lineNum"> 69 </span> : * they control. Some constraints are: -<span class="lineNum"> 70 </span> : * - The controlled input sequence can be not readable. -<span class="lineNum"> 71 </span> : * - The controlled output sequence can be not writable. -<span class="lineNum"> 72 </span> : * - The controlled sequences can be associated with the contents of -<span class="lineNum"> 73 </span> : * other representations for character sequences, such as external -<span class="lineNum"> 74 </span> : * files. -<span class="lineNum"> 75 </span> : * - The controlled sequences can support operations @e directly to or -<span class="lineNum"> 76 </span> : * from associated sequences. -<span class="lineNum"> 77 </span> : * - The controlled sequences can impose limitations on how the -<span class="lineNum"> 78 </span> : * program can read characters from a sequence, write characters to -<span class="lineNum"> 79 </span> : * a sequence, put characters back into an input sequence, or alter -<span class="lineNum"> 80 </span> : * the stream position. -<span class="lineNum"> 81 </span> : * . -<span class="lineNum"> 82 </span> : * -# Each sequence is characterized by three pointers which, if non-null, -<span class="lineNum"> 83 </span> : * all point into the same @c charT array object. The array object -<span class="lineNum"> 84 </span> : * represents, at any moment, a (sub)sequence of characters from the -<span class="lineNum"> 85 </span> : * sequence. Operations performed on a sequence alter the values -<span class="lineNum"> 86 </span> : * stored in these pointers, perform reads and writes directly to or -<span class="lineNum"> 87 </span> : * from associated sequences, and alter "the stream position" and -<span class="lineNum"> 88 </span> : * conversion state as needed to maintain this subsequence relationship. -<span class="lineNum"> 89 </span> : * The three pointers are: -<span class="lineNum"> 90 </span> : * - the <em>beginning pointer</em>, or lowest element address in the -<span class="lineNum"> 91 </span> : * array (called @e xbeg here); -<span class="lineNum"> 92 </span> : * - the <em>next pointer</em>, or next element address that is a -<span class="lineNum"> 93 </span> : * current candidate for reading or writing (called @e xnext here); -<span class="lineNum"> 94 </span> : * - the <em>end pointer</em>, or first element address beyond the -<span class="lineNum"> 95 </span> : * end of the array (called @e xend here). -<span class="lineNum"> 96 </span> : * . -<span class="lineNum"> 97 </span> : * -# The following semantic constraints shall always apply for any set -<span class="lineNum"> 98 </span> : * of three pointers for a sequence, using the pointer names given -<span class="lineNum"> 99 </span> : * immediately above: -<span class="lineNum"> 100 </span> : * - If @e xnext is not a null pointer, then @e xbeg and @e xend shall -<span class="lineNum"> 101 </span> : * also be non-null pointers into the same @c charT array, as -<span class="lineNum"> 102 </span> : * described above; otherwise, @e xbeg and @e xend shall also be null. -<span class="lineNum"> 103 </span> : * - If @e xnext is not a null pointer and @e xnext < @e xend for an -<span class="lineNum"> 104 </span> : * output sequence, then a <em>write position</em> is available. -<span class="lineNum"> 105 </span> : * In this case, @e *xnext shall be assignable as the next element -<span class="lineNum"> 106 </span> : * to write (to put, or to store a character value, into the sequence). -<span class="lineNum"> 107 </span> : * - If @e xnext is not a null pointer and @e xbeg < @e xnext for an -<span class="lineNum"> 108 </span> : * input sequence, then a <em>putback position</em> is available. -<span class="lineNum"> 109 </span> : * In this case, @e xnext[-1] shall have a defined value and is the -<span class="lineNum"> 110 </span> : * next (preceding) element to store a character that is put back -<span class="lineNum"> 111 </span> : * into the input sequence. -<span class="lineNum"> 112 </span> : * - If @e xnext is not a null pointer and @e xnext< @e xend for an -<span class="lineNum"> 113 </span> : * input sequence, then a <em>read position</em> is available. -<span class="lineNum"> 114 </span> : * In this case, @e *xnext shall have a defined value and is the -<span class="lineNum"> 115 </span> : * next element to read (to get, or to obtain a character value, -<span class="lineNum"> 116 </span> : * from the sequence). -<span class="lineNum"> 117 </span> : */ -<span class="lineNum"> 118 </span> : template<typename _CharT, typename _Traits> -<span class="lineNum"> 119 </span> : class basic_streambuf -<span class="lineNum"> 120 </span> : { -<span class="lineNum"> 121 </span> : public: -<span class="lineNum"> 122 </span> : //@{ -<span class="lineNum"> 123 </span> : /** -<span class="lineNum"> 124 </span> : * These are standard types. They permit a standardized way of -<span class="lineNum"> 125 </span> : * referring to names of (or names dependant on) the template -<span class="lineNum"> 126 </span> : * parameters, which are specific to the implementation. -<span class="lineNum"> 127 </span> : */ -<span class="lineNum"> 128 </span> : typedef _CharT char_type; -<span class="lineNum"> 129 </span> : typedef _Traits traits_type; -<span class="lineNum"> 130 </span> : typedef typename traits_type::int_type int_type; -<span class="lineNum"> 131 </span> : typedef typename traits_type::pos_type pos_type; -<span class="lineNum"> 132 </span> : typedef typename traits_type::off_type off_type; -<span class="lineNum"> 133 </span> : //@} -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : //@{ -<span class="lineNum"> 136 </span> : /// This is a non-standard type. -<span class="lineNum"> 137 </span> : typedef basic_streambuf<char_type, traits_type> __streambuf_type; -<span class="lineNum"> 138 </span> : //@} -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : friend class basic_ios<char_type, traits_type>; -<span class="lineNum"> 141 </span> : friend class basic_istream<char_type, traits_type>; -<span class="lineNum"> 142 </span> : friend class basic_ostream<char_type, traits_type>; -<span class="lineNum"> 143 </span> : friend class istreambuf_iterator<char_type, traits_type>; -<span class="lineNum"> 144 </span> : friend class ostreambuf_iterator<char_type, traits_type>; -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : friend streamsize -<span class="lineNum"> 147 </span> : __copy_streambufs_eof<>(__streambuf_type*, __streambuf_type*, bool&); -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : template<bool _IsMove, typename _CharT2> -<span class="lineNum"> 150 </span> : friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, -<span class="lineNum"> 151 </span> : _CharT2*>::__type -<span class="lineNum"> 152 </span> : __copy_move_a2(istreambuf_iterator<_CharT2>, -<span class="lineNum"> 153 </span> : istreambuf_iterator<_CharT2>, _CharT2*); -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : template<typename _CharT2> -<span class="lineNum"> 156 </span> : friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, -<span class="lineNum"> 157 </span> : istreambuf_iterator<_CharT2> >::__type -<span class="lineNum"> 158 </span> : find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, -<span class="lineNum"> 159 </span> : const _CharT2&); -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : template<typename _CharT2, typename _Traits2> -<span class="lineNum"> 162 </span> : friend basic_istream<_CharT2, _Traits2>& -<span class="lineNum"> 163 </span> : operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*); -<span class="lineNum"> 164 </span> : -<span class="lineNum"> 165 </span> : template<typename _CharT2, typename _Traits2, typename _Alloc> -<span class="lineNum"> 166 </span> : friend basic_istream<_CharT2, _Traits2>& -<span class="lineNum"> 167 </span> : operator>>(basic_istream<_CharT2, _Traits2>&, -<span class="lineNum"> 168 </span> : basic_string<_CharT2, _Traits2, _Alloc>&); -<span class="lineNum"> 169 </span> : -<span class="lineNum"> 170 </span> : template<typename _CharT2, typename _Traits2, typename _Alloc> -<span class="lineNum"> 171 </span> : friend basic_istream<_CharT2, _Traits2>& -<span class="lineNum"> 172 </span> : getline(basic_istream<_CharT2, _Traits2>&, -<span class="lineNum"> 173 </span> : basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2); -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : protected: -<span class="lineNum"> 176 </span> : //@{ -<span class="lineNum"> 177 </span> : /** -<span class="lineNum"> 178 </span> : * This is based on _IO_FILE, just reordered to be more consistent, -<span class="lineNum"> 179 </span> : * and is intended to be the most minimal abstraction for an -<span class="lineNum"> 180 </span> : * internal buffer. -<span class="lineNum"> 181 </span> : * - get == input == read -<span class="lineNum"> 182 </span> : * - put == output == write -<span class="lineNum"> 183 </span> : */ -<span class="lineNum"> 184 </span> : char_type* _M_in_beg; // Start of get area. -<span class="lineNum"> 185 </span> : char_type* _M_in_cur; // Current read area. -<span class="lineNum"> 186 </span> : char_type* _M_in_end; // End of get area. -<span class="lineNum"> 187 </span> : char_type* _M_out_beg; // Start of put area. -<span class="lineNum"> 188 </span> : char_type* _M_out_cur; // Current put area. -<span class="lineNum"> 189 </span> : char_type* _M_out_end; // End of put area. -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : /// Current locale setting. -<span class="lineNum"> 192 </span> : locale _M_buf_locale; -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : public: -<span class="lineNum"> 195 </span> : /// Destructor deallocates no buffer space. -<span class="lineNum"> 196 </span> : virtual -<span class="lineNum"> 197 </span><span class="lineNoCov"> 0 : ~basic_streambuf() </span> -<span class="lineNum"> 198 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 199 </span> : -<span class="lineNum"> 200 </span> : // [27.5.2.2.1] locales -<span class="lineNum"> 201 </span> : /** -<span class="lineNum"> 202 </span> : * @brief Entry point for imbue(). -<span class="lineNum"> 203 </span> : * @param loc The new locale. -<span class="lineNum"> 204 </span> : * @return The previous locale. -<span class="lineNum"> 205 </span> : * -<span class="lineNum"> 206 </span> : * Calls the derived imbue(loc). -<span class="lineNum"> 207 </span> : */ -<span class="lineNum"> 208 </span> : locale -<span class="lineNum"> 209 </span> : pubimbue(const locale &__loc) -<span class="lineNum"> 210 </span> : { -<span class="lineNum"> 211 </span> : locale __tmp(this->getloc()); -<span class="lineNum"> 212 </span> : this->imbue(__loc); -<span class="lineNum"> 213 </span> : _M_buf_locale = __loc; -<span class="lineNum"> 214 </span> : return __tmp; -<span class="lineNum"> 215 </span> : } -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : /** -<span class="lineNum"> 218 </span> : * @brief Locale access. -<span class="lineNum"> 219 </span> : * @return The current locale in effect. -<span class="lineNum"> 220 </span> : * -<span class="lineNum"> 221 </span> : * If pubimbue(loc) has been called, then the most recent @c loc -<span class="lineNum"> 222 </span> : * is returned. Otherwise the global locale in effect at the time -<span class="lineNum"> 223 </span> : * of construction is returned. -<span class="lineNum"> 224 </span> : */ -<span class="lineNum"> 225 </span> : locale -<span class="lineNum"> 226 </span> : getloc() const -<span class="lineNum"> 227 </span> : { return _M_buf_locale; } -<span class="lineNum"> 228 </span> : -<span class="lineNum"> 229 </span> : // [27.5.2.2.2] buffer management and positioning -<span class="lineNum"> 230 </span> : //@{ -<span class="lineNum"> 231 </span> : /** -<span class="lineNum"> 232 </span> : * @brief Entry points for derived buffer functions. -<span class="lineNum"> 233 </span> : * -<span class="lineNum"> 234 </span> : * The public versions of @c pubfoo dispatch to the protected -<span class="lineNum"> 235 </span> : * derived @c foo member functions, passing the arguments (if any) -<span class="lineNum"> 236 </span> : * and returning the result unchanged. -<span class="lineNum"> 237 </span> : */ -<span class="lineNum"> 238 </span> : __streambuf_type* -<span class="lineNum"> 239 </span> : pubsetbuf(char_type* __s, streamsize __n) -<span class="lineNum"> 240 </span> : { return this->setbuf(__s, __n); } -<span class="lineNum"> 241 </span> : -<span class="lineNum"> 242 </span> : pos_type -<span class="lineNum"> 243 </span> : pubseekoff(off_type __off, ios_base::seekdir __way, -<span class="lineNum"> 244 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out) -<span class="lineNum"> 245 </span> : { return this->seekoff(__off, __way, __mode); } -<span class="lineNum"> 246 </span> : -<span class="lineNum"> 247 </span> : pos_type -<span class="lineNum"> 248 </span> : pubseekpos(pos_type __sp, -<span class="lineNum"> 249 </span> : ios_base::openmode __mode = ios_base::in | ios_base::out) -<span class="lineNum"> 250 </span> : { return this->seekpos(__sp, __mode); } -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : int -<span class="lineNum"> 253 </span> : pubsync() { return this->sync(); } -<span class="lineNum"> 254 </span> : //@} -<span class="lineNum"> 255 </span> : -<span class="lineNum"> 256 </span> : // [27.5.2.2.3] get area -<span class="lineNum"> 257 </span> : /** -<span class="lineNum"> 258 </span> : * @brief Looking ahead into the stream. -<span class="lineNum"> 259 </span> : * @return The number of characters available. -<span class="lineNum"> 260 </span> : * -<span class="lineNum"> 261 </span> : * If a read position is available, returns the number of characters -<span class="lineNum"> 262 </span> : * available for reading before the buffer must be refilled. -<span class="lineNum"> 263 </span> : * Otherwise returns the derived @c showmanyc(). -<span class="lineNum"> 264 </span> : */ -<span class="lineNum"> 265 </span> : streamsize -<span class="lineNum"> 266 </span> : in_avail() -<span class="lineNum"> 267 </span> : { -<span class="lineNum"> 268 </span> : const streamsize __ret = this->egptr() - this->gptr(); -<span class="lineNum"> 269 </span> : return __ret ? __ret : this->showmanyc(); -<span class="lineNum"> 270 </span> : } -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : /** -<span class="lineNum"> 273 </span> : * @brief Getting the next character. -<span class="lineNum"> 274 </span> : * @return The next character, or eof. -<span class="lineNum"> 275 </span> : * -<span class="lineNum"> 276 </span> : * Calls @c sbumpc(), and if that function returns -<span class="lineNum"> 277 </span> : * @c traits::eof(), so does this function. Otherwise, @c sgetc(). -<span class="lineNum"> 278 </span> : */ -<span class="lineNum"> 279 </span> : int_type -<span class="lineNum"> 280 </span> : snextc() -<span class="lineNum"> 281 </span> : { -<span class="lineNum"> 282 </span> : int_type __ret = traits_type::eof(); -<span class="lineNum"> 283 </span> : if (__builtin_expect(!traits_type::eq_int_type(this->sbumpc(), -<span class="lineNum"> 284 </span> : __ret), true)) -<span class="lineNum"> 285 </span> : __ret = this->sgetc(); -<span class="lineNum"> 286 </span> : return __ret; -<span class="lineNum"> 287 </span> : } -<span class="lineNum"> 288 </span> : -<span class="lineNum"> 289 </span> : /** -<span class="lineNum"> 290 </span> : * @brief Getting the next character. -<span class="lineNum"> 291 </span> : * @return The next character, or eof. -<span class="lineNum"> 292 </span> : * -<span class="lineNum"> 293 </span> : * If the input read position is available, returns that character -<span class="lineNum"> 294 </span> : * and increments the read pointer, otherwise calls and returns -<span class="lineNum"> 295 </span> : * @c uflow(). -<span class="lineNum"> 296 </span> : */ -<span class="lineNum"> 297 </span> : int_type -<span class="lineNum"> 298 </span> : sbumpc() -<span class="lineNum"> 299 </span> : { -<span class="lineNum"> 300 </span> : int_type __ret; -<span class="lineNum"> 301 </span> : if (__builtin_expect(this->gptr() < this->egptr(), true)) -<span class="lineNum"> 302 </span> : { -<span class="lineNum"> 303 </span> : __ret = traits_type::to_int_type(*this->gptr()); -<span class="lineNum"> 304 </span> : this->gbump(1); -<span class="lineNum"> 305 </span> : } -<span class="lineNum"> 306 </span> : else -<span class="lineNum"> 307 </span> : __ret = this->uflow(); -<span class="lineNum"> 308 </span> : return __ret; -<span class="lineNum"> 309 </span> : } -<span class="lineNum"> 310 </span> : -<span class="lineNum"> 311 </span> : /** -<span class="lineNum"> 312 </span> : * @brief Getting the next character. -<span class="lineNum"> 313 </span> : * @return The next character, or eof. -<span class="lineNum"> 314 </span> : * -<span class="lineNum"> 315 </span> : * If the input read position is available, returns that character, -<span class="lineNum"> 316 </span> : * otherwise calls and returns @c underflow(). Does not move the -<span class="lineNum"> 317 </span> : * read position after fetching the character. -<span class="lineNum"> 318 </span> : */ -<span class="lineNum"> 319 </span> : int_type -<span class="lineNum"> 320 </span> : sgetc() -<span class="lineNum"> 321 </span> : { -<span class="lineNum"> 322 </span> : int_type __ret; -<span class="lineNum"> 323 </span> : if (__builtin_expect(this->gptr() < this->egptr(), true)) -<span class="lineNum"> 324 </span> : __ret = traits_type::to_int_type(*this->gptr()); -<span class="lineNum"> 325 </span> : else -<span class="lineNum"> 326 </span> : __ret = this->underflow(); -<span class="lineNum"> 327 </span> : return __ret; -<span class="lineNum"> 328 </span> : } -<span class="lineNum"> 329 </span> : -<span class="lineNum"> 330 </span> : /** -<span class="lineNum"> 331 </span> : * @brief Entry point for xsgetn. -<span class="lineNum"> 332 </span> : * @param s A buffer area. -<span class="lineNum"> 333 </span> : * @param n A count. -<span class="lineNum"> 334 </span> : * -<span class="lineNum"> 335 </span> : * Returns xsgetn(s,n). The effect is to fill @a s[0] through -<span class="lineNum"> 336 </span> : * @a s[n-1] with characters from the input sequence, if possible. -<span class="lineNum"> 337 </span> : */ -<span class="lineNum"> 338 </span> : streamsize -<span class="lineNum"> 339 </span> : sgetn(char_type* __s, streamsize __n) -<span class="lineNum"> 340 </span> : { return this->xsgetn(__s, __n); } -<span class="lineNum"> 341 </span> : -<span class="lineNum"> 342 </span> : // [27.5.2.2.4] putback -<span class="lineNum"> 343 </span> : /** -<span class="lineNum"> 344 </span> : * @brief Pushing characters back into the input stream. -<span class="lineNum"> 345 </span> : * @param c The character to push back. -<span class="lineNum"> 346 </span> : * @return The previous character, if possible. -<span class="lineNum"> 347 </span> : * -<span class="lineNum"> 348 </span> : * Similar to sungetc(), but @a c is pushed onto the stream instead -<span class="lineNum"> 349 </span> : * of "the previous character". If successful, the next character -<span class="lineNum"> 350 </span> : * fetched from the input stream will be @a c. -<span class="lineNum"> 351 </span> : */ -<span class="lineNum"> 352 </span> : int_type -<span class="lineNum"> 353 </span> : sputbackc(char_type __c) -<span class="lineNum"> 354 </span> : { -<span class="lineNum"> 355 </span> : int_type __ret; -<span class="lineNum"> 356 </span> : const bool __testpos = this->eback() < this->gptr(); -<span class="lineNum"> 357 </span> : if (__builtin_expect(!__testpos || -<span class="lineNum"> 358 </span> : !traits_type::eq(__c, this->gptr()[-1]), false)) -<span class="lineNum"> 359 </span> : __ret = this->pbackfail(traits_type::to_int_type(__c)); -<span class="lineNum"> 360 </span> : else -<span class="lineNum"> 361 </span> : { -<span class="lineNum"> 362 </span> : this->gbump(-1); -<span class="lineNum"> 363 </span> : __ret = traits_type::to_int_type(*this->gptr()); -<span class="lineNum"> 364 </span> : } -<span class="lineNum"> 365 </span> : return __ret; -<span class="lineNum"> 366 </span> : } -<span class="lineNum"> 367 </span> : -<span class="lineNum"> 368 </span> : /** -<span class="lineNum"> 369 </span> : * @brief Moving backwards in the input stream. -<span class="lineNum"> 370 </span> : * @return The previous character, if possible. -<span class="lineNum"> 371 </span> : * -<span class="lineNum"> 372 </span> : * If a putback position is available, this function decrements the -<span class="lineNum"> 373 </span> : * input pointer and returns that character. Otherwise, calls and -<span class="lineNum"> 374 </span> : * returns pbackfail(). The effect is to "unget" the last character -<span class="lineNum"> 375 </span> : * "gotten". -<span class="lineNum"> 376 </span> : */ -<span class="lineNum"> 377 </span> : int_type -<span class="lineNum"> 378 </span> : sungetc() -<span class="lineNum"> 379 </span> : { -<span class="lineNum"> 380 </span> : int_type __ret; -<span class="lineNum"> 381 </span> : if (__builtin_expect(this->eback() < this->gptr(), true)) -<span class="lineNum"> 382 </span> : { -<span class="lineNum"> 383 </span> : this->gbump(-1); -<span class="lineNum"> 384 </span> : __ret = traits_type::to_int_type(*this->gptr()); -<span class="lineNum"> 385 </span> : } -<span class="lineNum"> 386 </span> : else -<span class="lineNum"> 387 </span> : __ret = this->pbackfail(); -<span class="lineNum"> 388 </span> : return __ret; -<span class="lineNum"> 389 </span> : } -<span class="lineNum"> 390 </span> : -<span class="lineNum"> 391 </span> : // [27.5.2.2.5] put area -<span class="lineNum"> 392 </span> : /** -<span class="lineNum"> 393 </span> : * @brief Entry point for all single-character output functions. -<span class="lineNum"> 394 </span> : * @param c A character to output. -<span class="lineNum"> 395 </span> : * @return @a c, if possible. -<span class="lineNum"> 396 </span> : * -<span class="lineNum"> 397 </span> : * One of two public output functions. -<span class="lineNum"> 398 </span> : * -<span class="lineNum"> 399 </span> : * If a write position is available for the output sequence (i.e., -<span class="lineNum"> 400 </span> : * the buffer is not full), stores @a c in that position, increments -<span class="lineNum"> 401 </span> : * the position, and returns @c traits::to_int_type(c). If a write -<span class="lineNum"> 402 </span> : * position is not available, returns @c overflow(c). -<span class="lineNum"> 403 </span> : */ -<span class="lineNum"> 404 </span> : int_type -<span class="lineNum"> 405 </span> : sputc(char_type __c) -<span class="lineNum"> 406 </span> : { -<span class="lineNum"> 407 </span> : int_type __ret; -<span class="lineNum"> 408 </span> : if (__builtin_expect(this->pptr() < this->epptr(), true)) -<span class="lineNum"> 409 </span> : { -<span class="lineNum"> 410 </span> : *this->pptr() = __c; -<span class="lineNum"> 411 </span> : this->pbump(1); -<span class="lineNum"> 412 </span> : __ret = traits_type::to_int_type(__c); -<span class="lineNum"> 413 </span> : } -<span class="lineNum"> 414 </span> : else -<span class="lineNum"> 415 </span> : __ret = this->overflow(traits_type::to_int_type(__c)); -<span class="lineNum"> 416 </span> : return __ret; -<span class="lineNum"> 417 </span> : } -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : /** -<span class="lineNum"> 420 </span> : * @brief Entry point for all single-character output functions. -<span class="lineNum"> 421 </span> : * @param s A buffer read area. -<span class="lineNum"> 422 </span> : * @param n A count. -<span class="lineNum"> 423 </span> : * -<span class="lineNum"> 424 </span> : * One of two public output functions. -<span class="lineNum"> 425 </span> : * -<span class="lineNum"> 426 </span> : * -<span class="lineNum"> 427 </span> : * Returns xsputn(s,n). The effect is to write @a s[0] through -<span class="lineNum"> 428 </span> : * @a s[n-1] to the output sequence, if possible. -<span class="lineNum"> 429 </span> : */ -<span class="lineNum"> 430 </span> : streamsize -<span class="lineNum"> 431 </span> : sputn(const char_type* __s, streamsize __n) -<span class="lineNum"> 432 </span> : { return this->xsputn(__s, __n); } -<span class="lineNum"> 433 </span> : -<span class="lineNum"> 434 </span> : protected: -<span class="lineNum"> 435 </span> : /** -<span class="lineNum"> 436 </span> : * @brief Base constructor. -<span class="lineNum"> 437 </span> : * -<span class="lineNum"> 438 </span> : * Only called from derived constructors, and sets up all the -<span class="lineNum"> 439 </span> : * buffer data to zero, including the pointers described in the -<span class="lineNum"> 440 </span> : * basic_streambuf class description. Note that, as a result, -<span class="lineNum"> 441 </span> : * - the class starts with no read nor write positions available, -<span class="lineNum"> 442 </span> : * - this is not an error -<span class="lineNum"> 443 </span> : */ -<span class="lineNum"> 444 </span><span class="lineNoCov"> 0 : basic_streambuf()</span> -<span class="lineNum"> 445 </span> : : _M_in_beg(0), _M_in_cur(0), _M_in_end(0), -<span class="lineNum"> 446 </span> : _M_out_beg(0), _M_out_cur(0), _M_out_end(0), -<span class="lineNum"> 447 </span><span class="lineNoCov"> 0 : _M_buf_locale(locale()) </span> -<span class="lineNum"> 448 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 449 </span> : -<span class="lineNum"> 450 </span> : // [27.5.2.3.1] get area access -<span class="lineNum"> 451 </span> : //@{ -<span class="lineNum"> 452 </span> : /** -<span class="lineNum"> 453 </span> : * @brief Access to the get area. -<span class="lineNum"> 454 </span> : * -<span class="lineNum"> 455 </span> : * These functions are only available to other protected functions, -<span class="lineNum"> 456 </span> : * including derived classes. -<span class="lineNum"> 457 </span> : * -<span class="lineNum"> 458 </span> : * - eback() returns the beginning pointer for the input sequence -<span class="lineNum"> 459 </span> : * - gptr() returns the next pointer for the input sequence -<span class="lineNum"> 460 </span> : * - egptr() returns the end pointer for the input sequence -<span class="lineNum"> 461 </span> : */ -<span class="lineNum"> 462 </span> : char_type* -<span class="lineNum"> 463 </span> : eback() const { return _M_in_beg; } -<span class="lineNum"> 464 </span> : -<span class="lineNum"> 465 </span> : char_type* -<span class="lineNum"> 466 </span><span class="lineNoCov"> 0 : gptr() const { return _M_in_cur; }</span> -<span class="lineNum"> 467 </span> : -<span class="lineNum"> 468 </span> : char_type* -<span class="lineNum"> 469 </span><span class="lineNoCov"> 0 : egptr() const { return _M_in_end; }</span> -<span class="lineNum"> 470 </span> : //@} -<span class="lineNum"> 471 </span> : -<span class="lineNum"> 472 </span> : /** -<span class="lineNum"> 473 </span> : * @brief Moving the read position. -<span class="lineNum"> 474 </span> : * @param n The delta by which to move. -<span class="lineNum"> 475 </span> : * -<span class="lineNum"> 476 </span> : * This just advances the read position without returning any data. -<span class="lineNum"> 477 </span> : */ -<span class="lineNum"> 478 </span> : void -<span class="lineNum"> 479 </span><span class="lineNoCov"> 0 : gbump(int __n) { _M_in_cur += __n; }</span> -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : /** -<span class="lineNum"> 482 </span> : * @brief Setting the three read area pointers. -<span class="lineNum"> 483 </span> : * @param gbeg A pointer. -<span class="lineNum"> 484 </span> : * @param gnext A pointer. -<span class="lineNum"> 485 </span> : * @param gend A pointer. -<span class="lineNum"> 486 </span> : * @post @a gbeg == @c eback(), @a gnext == @c gptr(), and -<span class="lineNum"> 487 </span> : * @a gend == @c egptr() -<span class="lineNum"> 488 </span> : */ -<span class="lineNum"> 489 </span> : void -<span class="lineNum"> 490 </span> : setg(char_type* __gbeg, char_type* __gnext, char_type* __gend) -<span class="lineNum"> 491 </span> : { -<span class="lineNum"> 492 </span> : _M_in_beg = __gbeg; -<span class="lineNum"> 493 </span> : _M_in_cur = __gnext; -<span class="lineNum"> 494 </span> : _M_in_end = __gend; -<span class="lineNum"> 495 </span> : } -<span class="lineNum"> 496 </span> : -<span class="lineNum"> 497 </span> : // [27.5.2.3.2] put area access -<span class="lineNum"> 498 </span> : //@{ -<span class="lineNum"> 499 </span> : /** -<span class="lineNum"> 500 </span> : * @brief Access to the put area. -<span class="lineNum"> 501 </span> : * -<span class="lineNum"> 502 </span> : * These functions are only available to other protected functions, -<span class="lineNum"> 503 </span> : * including derived classes. -<span class="lineNum"> 504 </span> : * -<span class="lineNum"> 505 </span> : * - pbase() returns the beginning pointer for the output sequence -<span class="lineNum"> 506 </span> : * - pptr() returns the next pointer for the output sequence -<span class="lineNum"> 507 </span> : * - epptr() returns the end pointer for the output sequence -<span class="lineNum"> 508 </span> : */ -<span class="lineNum"> 509 </span> : char_type* -<span class="lineNum"> 510 </span><span class="lineNoCov"> 0 : pbase() const { return _M_out_beg; }</span> -<span class="lineNum"> 511 </span> : -<span class="lineNum"> 512 </span> : char_type* -<span class="lineNum"> 513 </span><span class="lineNoCov"> 0 : pptr() const { return _M_out_cur; }</span> -<span class="lineNum"> 514 </span> : -<span class="lineNum"> 515 </span> : char_type* -<span class="lineNum"> 516 </span> : epptr() const { return _M_out_end; } -<span class="lineNum"> 517 </span> : //@} -<span class="lineNum"> 518 </span> : -<span class="lineNum"> 519 </span> : /** -<span class="lineNum"> 520 </span> : * @brief Moving the write position. -<span class="lineNum"> 521 </span> : * @param n The delta by which to move. -<span class="lineNum"> 522 </span> : * -<span class="lineNum"> 523 </span> : * This just advances the write position without returning any data. -<span class="lineNum"> 524 </span> : */ -<span class="lineNum"> 525 </span> : void -<span class="lineNum"> 526 </span><span class="lineNoCov"> 0 : pbump(int __n) { _M_out_cur += __n; }</span> -<span class="lineNum"> 527 </span> : -<span class="lineNum"> 528 </span> : /** -<span class="lineNum"> 529 </span> : * @brief Setting the three write area pointers. -<span class="lineNum"> 530 </span> : * @param pbeg A pointer. -<span class="lineNum"> 531 </span> : * @param pend A pointer. -<span class="lineNum"> 532 </span> : * @post @a pbeg == @c pbase(), @a pbeg == @c pptr(), and -<span class="lineNum"> 533 </span> : * @a pend == @c epptr() -<span class="lineNum"> 534 </span> : */ -<span class="lineNum"> 535 </span> : void -<span class="lineNum"> 536 </span><span class="lineNoCov"> 0 : setp(char_type* __pbeg, char_type* __pend)</span> -<span class="lineNum"> 537 </span> : { -<span class="lineNum"> 538 </span><span class="lineNoCov"> 0 : _M_out_beg = _M_out_cur = __pbeg; </span> -<span class="lineNum"> 539 </span><span class="lineNoCov"> 0 : _M_out_end = __pend;</span> -<span class="lineNum"> 540 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 541 </span> : -<span class="lineNum"> 542 </span> : // [27.5.2.4] virtual functions -<span class="lineNum"> 543 </span> : // [27.5.2.4.1] locales -<span class="lineNum"> 544 </span> : /** -<span class="lineNum"> 545 </span> : * @brief Changes translations. -<span class="lineNum"> 546 </span> : * @param loc A new locale. -<span class="lineNum"> 547 </span> : * -<span class="lineNum"> 548 </span> : * Translations done during I/O which depend on the current locale -<span class="lineNum"> 549 </span> : * are changed by this call. The standard adds, "Between invocations -<span class="lineNum"> 550 </span> : * of this function a class derived from streambuf can safely cache -<span class="lineNum"> 551 </span> : * results of calls to locale functions and to members of facets -<span class="lineNum"> 552 </span> : * so obtained." -<span class="lineNum"> 553 </span> : * -<span class="lineNum"> 554 </span> : * @note Base class version does nothing. -<span class="lineNum"> 555 </span> : */ -<span class="lineNum"> 556 </span> : virtual void -<span class="lineNum"> 557 </span><span class="lineNoCov"> 0 : imbue(const locale&) </span> -<span class="lineNum"> 558 </span><span class="lineNoCov"> 0 : { }</span> -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : // [27.5.2.4.2] buffer management and positioning -<span class="lineNum"> 561 </span> : /** -<span class="lineNum"> 562 </span> : * @brief Manipulates the buffer. -<span class="lineNum"> 563 </span> : * -<span class="lineNum"> 564 </span> : * Each derived class provides its own appropriate behavior. See -<span class="lineNum"> 565 </span> : * the next-to-last paragraph of -<span class="lineNum"> 566 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#2 for -<span class="lineNum"> 567 </span> : * more on this function. -<span class="lineNum"> 568 </span> : * -<span class="lineNum"> 569 </span> : * @note Base class version does nothing, returns @c this. -<span class="lineNum"> 570 </span> : */ -<span class="lineNum"> 571 </span> : virtual basic_streambuf<char_type,_Traits>* -<span class="lineNum"> 572 </span><span class="lineNoCov"> 0 : setbuf(char_type*, streamsize)</span> -<span class="lineNum"> 573 </span><span class="lineNoCov"> 0 : { return this; }</span> -<span class="lineNum"> 574 </span> : -<span class="lineNum"> 575 </span> : /** -<span class="lineNum"> 576 </span> : * @brief Alters the stream positions. -<span class="lineNum"> 577 </span> : * -<span class="lineNum"> 578 </span> : * Each derived class provides its own appropriate behavior. -<span class="lineNum"> 579 </span> : * @note Base class version does nothing, returns a @c pos_type -<span class="lineNum"> 580 </span> : * that represents an invalid stream position. -<span class="lineNum"> 581 </span> : */ -<span class="lineNum"> 582 </span> : virtual pos_type -<span class="lineNum"> 583 </span> : seekoff(off_type, ios_base::seekdir, -<span class="lineNum"> 584 </span><span class="lineNoCov"> 0 : ios_base::openmode /*__mode*/ = ios_base::in | ios_base::out)</span> -<span class="lineNum"> 585 </span><span class="lineNoCov"> 0 : { return pos_type(off_type(-1)); } </span> -<span class="lineNum"> 586 </span> : -<span class="lineNum"> 587 </span> : /** -<span class="lineNum"> 588 </span> : * @brief Alters the stream positions. -<span class="lineNum"> 589 </span> : * -<span class="lineNum"> 590 </span> : * Each derived class provides its own appropriate behavior. -<span class="lineNum"> 591 </span> : * @note Base class version does nothing, returns a @c pos_type -<span class="lineNum"> 592 </span> : * that represents an invalid stream position. -<span class="lineNum"> 593 </span> : */ -<span class="lineNum"> 594 </span> : virtual pos_type -<span class="lineNum"> 595 </span> : seekpos(pos_type, -<span class="lineNum"> 596 </span><span class="lineNoCov"> 0 : ios_base::openmode /*__mode*/ = ios_base::in | ios_base::out)</span> -<span class="lineNum"> 597 </span><span class="lineNoCov"> 0 : { return pos_type(off_type(-1)); } </span> -<span class="lineNum"> 598 </span> : -<span class="lineNum"> 599 </span> : /** -<span class="lineNum"> 600 </span> : * @brief Synchronizes the buffer arrays with the controlled sequences. -<span class="lineNum"> 601 </span> : * @return -1 on failure. -<span class="lineNum"> 602 </span> : * -<span class="lineNum"> 603 </span> : * Each derived class provides its own appropriate behavior, -<span class="lineNum"> 604 </span> : * including the definition of "failure". -<span class="lineNum"> 605 </span> : * @note Base class version does nothing, returns zero. -<span class="lineNum"> 606 </span> : */ -<span class="lineNum"> 607 </span> : virtual int -<span class="lineNum"> 608 </span><span class="lineNoCov"> 0 : sync() { return 0; }</span> -<span class="lineNum"> 609 </span> : -<span class="lineNum"> 610 </span> : // [27.5.2.4.3] get area -<span class="lineNum"> 611 </span> : /** -<span class="lineNum"> 612 </span> : * @brief Investigating the data available. -<span class="lineNum"> 613 </span> : * @return An estimate of the number of characters available in the -<span class="lineNum"> 614 </span> : * input sequence, or -1. -<span class="lineNum"> 615 </span> : * -<span class="lineNum"> 616 </span> : * "If it returns a positive value, then successive calls to -<span class="lineNum"> 617 </span> : * @c underflow() will not return @c traits::eof() until at least that -<span class="lineNum"> 618 </span> : * number of characters have been supplied. If @c showmanyc() -<span class="lineNum"> 619 </span> : * returns -1, then calls to @c underflow() or @c uflow() will fail." -<span class="lineNum"> 620 </span> : * [27.5.2.4.3]/1 -<span class="lineNum"> 621 </span> : * -<span class="lineNum"> 622 </span> : * @note Base class version does nothing, returns zero. -<span class="lineNum"> 623 </span> : * @note The standard adds that "the intention is not only that the -<span class="lineNum"> 624 </span> : * calls [to underflow or uflow] will not return @c eof() but -<span class="lineNum"> 625 </span> : * that they will return "immediately". -<span class="lineNum"> 626 </span> : * @note The standard adds that "the morphemes of @c showmanyc are -<span class="lineNum"> 627 </span> : * "es-how-many-see", not "show-manic". -<span class="lineNum"> 628 </span> : */ -<span class="lineNum"> 629 </span> : virtual streamsize -<span class="lineNum"> 630 </span><span class="lineNoCov"> 0 : showmanyc() { return 0; }</span> -<span class="lineNum"> 631 </span> : -<span class="lineNum"> 632 </span> : /** -<span class="lineNum"> 633 </span> : * @brief Multiple character extraction. -<span class="lineNum"> 634 </span> : * @param s A buffer area. -<span class="lineNum"> 635 </span> : * @param n Maximum number of characters to assign. -<span class="lineNum"> 636 </span> : * @return The number of characters assigned. -<span class="lineNum"> 637 </span> : * -<span class="lineNum"> 638 </span> : * Fills @a s[0] through @a s[n-1] with characters from the input -<span class="lineNum"> 639 </span> : * sequence, as if by @c sbumpc(). Stops when either @a n characters -<span class="lineNum"> 640 </span> : * have been copied, or when @c traits::eof() would be copied. -<span class="lineNum"> 641 </span> : * -<span class="lineNum"> 642 </span> : * It is expected that derived classes provide a more efficient -<span class="lineNum"> 643 </span> : * implementation by overriding this definition. -<span class="lineNum"> 644 </span> : */ -<span class="lineNum"> 645 </span> : virtual streamsize -<span class="lineNum"> 646 </span> : xsgetn(char_type* __s, streamsize __n); -<span class="lineNum"> 647 </span> : -<span class="lineNum"> 648 </span> : /** -<span class="lineNum"> 649 </span> : * @brief Fetches more data from the controlled sequence. -<span class="lineNum"> 650 </span> : * @return The first character from the <em>pending sequence</em>. -<span class="lineNum"> 651 </span> : * -<span class="lineNum"> 652 </span> : * Informally, this function is called when the input buffer is -<span class="lineNum"> 653 </span> : * exhausted (or does not exist, as buffering need not actually be -<span class="lineNum"> 654 </span> : * done). If a buffer exists, it is "refilled". In either case, the -<span class="lineNum"> 655 </span> : * next available character is returned, or @c traits::eof() to -<span class="lineNum"> 656 </span> : * indicate a null pending sequence. -<span class="lineNum"> 657 </span> : * -<span class="lineNum"> 658 </span> : * For a formal definition of the pending sequence, see a good text -<span class="lineNum"> 659 </span> : * such as Langer & Kreft, or [27.5.2.4.3]/7-14. -<span class="lineNum"> 660 </span> : * -<span class="lineNum"> 661 </span> : * A functioning input streambuf can be created by overriding only -<span class="lineNum"> 662 </span> : * this function (no buffer area will be used). For an example, see -<span class="lineNum"> 663 </span> : * http://gcc.gnu.org/onlinedocs/libstdc++/27_io/howto.html#6 -<span class="lineNum"> 664 </span> : * -<span class="lineNum"> 665 </span> : * @note Base class version does nothing, returns eof(). -<span class="lineNum"> 666 </span> : */ -<span class="lineNum"> 667 </span> : virtual int_type -<span class="lineNum"> 668 </span><span class="lineNoCov"> 0 : underflow()</span> -<span class="lineNum"> 669 </span><span class="lineNoCov"> 0 : { return traits_type::eof(); }</span> -<span class="lineNum"> 670 </span> : -<span class="lineNum"> 671 </span> : /** -<span class="lineNum"> 672 </span> : * @brief Fetches more data from the controlled sequence. -<span class="lineNum"> 673 </span> : * @return The first character from the <em>pending sequence</em>. -<span class="lineNum"> 674 </span> : * -<span class="lineNum"> 675 </span> : * Informally, this function does the same thing as @c underflow(), -<span class="lineNum"> 676 </span> : * and in fact is required to call that function. It also returns -<span class="lineNum"> 677 </span> : * the new character, like @c underflow() does. However, this -<span class="lineNum"> 678 </span> : * function also moves the read position forward by one. -<span class="lineNum"> 679 </span> : */ -<span class="lineNum"> 680 </span> : virtual int_type -<span class="lineNum"> 681 </span><span class="lineNoCov"> 0 : uflow() </span> -<span class="lineNum"> 682 </span> : { -<span class="lineNum"> 683 </span><span class="lineNoCov"> 0 : int_type __ret = traits_type::eof();</span> -<span class="lineNum"> 684 </span> : const bool __testeof = traits_type::eq_int_type(this->underflow(), -<span class="lineNum"> 685 </span><span class="lineNoCov"> 0 : __ret);</span> -<span class="lineNum"> 686 </span><span class="lineNoCov"> 0 : if (!__testeof)</span> -<span class="lineNum"> 687 </span> : { -<span class="lineNum"> 688 </span><span class="lineNoCov"> 0 : __ret = traits_type::to_int_type(*this->gptr());</span> -<span class="lineNum"> 689 </span><span class="lineNoCov"> 0 : this->gbump(1);</span> -<span class="lineNum"> 690 </span> : } -<span class="lineNum"> 691 </span><span class="lineNoCov"> 0 : return __ret; </span> -<span class="lineNum"> 692 </span> : } -<span class="lineNum"> 693 </span> : -<span class="lineNum"> 694 </span> : // [27.5.2.4.4] putback -<span class="lineNum"> 695 </span> : /** -<span class="lineNum"> 696 </span> : * @brief Tries to back up the input sequence. -<span class="lineNum"> 697 </span> : * @param c The character to be inserted back into the sequence. -<span class="lineNum"> 698 </span> : * @return eof() on failure, "some other value" on success -<span class="lineNum"> 699 </span> : * @post The constraints of @c gptr(), @c eback(), and @c pptr() -<span class="lineNum"> 700 </span> : * are the same as for @c underflow(). -<span class="lineNum"> 701 </span> : * -<span class="lineNum"> 702 </span> : * @note Base class version does nothing, returns eof(). -<span class="lineNum"> 703 </span> : */ -<span class="lineNum"> 704 </span> : virtual int_type -<span class="lineNum"> 705 </span><span class="lineNoCov"> 0 : pbackfail(int_type /* __c */ = traits_type::eof())</span> -<span class="lineNum"> 706 </span><span class="lineNoCov"> 0 : { return traits_type::eof(); }</span> -<span class="lineNum"> 707 </span> : -<span class="lineNum"> 708 </span> : // Put area: -<span class="lineNum"> 709 </span> : /** -<span class="lineNum"> 710 </span> : * @brief Multiple character insertion. -<span class="lineNum"> 711 </span> : * @param s A buffer area. -<span class="lineNum"> 712 </span> : * @param n Maximum number of characters to write. -<span class="lineNum"> 713 </span> : * @return The number of characters written. -<span class="lineNum"> 714 </span> : * -<span class="lineNum"> 715 </span> : * Writes @a s[0] through @a s[n-1] to the output sequence, as if -<span class="lineNum"> 716 </span> : * by @c sputc(). Stops when either @a n characters have been -<span class="lineNum"> 717 </span> : * copied, or when @c sputc() would return @c traits::eof(). -<span class="lineNum"> 718 </span> : * -<span class="lineNum"> 719 </span> : * It is expected that derived classes provide a more efficient -<span class="lineNum"> 720 </span> : * implementation by overriding this definition. -<span class="lineNum"> 721 </span> : */ -<span class="lineNum"> 722 </span> : virtual streamsize -<span class="lineNum"> 723 </span> : xsputn(const char_type* __s, streamsize __n); -<span class="lineNum"> 724 </span> : -<span class="lineNum"> 725 </span> : /** -<span class="lineNum"> 726 </span> : * @brief Consumes data from the buffer; writes to the -<span class="lineNum"> 727 </span> : * controlled sequence. -<span class="lineNum"> 728 </span> : * @param c An additional character to consume. -<span class="lineNum"> 729 </span> : * @return eof() to indicate failure, something else (usually -<span class="lineNum"> 730 </span> : * @a c, or not_eof()) -<span class="lineNum"> 731 </span> : * -<span class="lineNum"> 732 </span> : * Informally, this function is called when the output buffer is full -<span class="lineNum"> 733 </span> : * (or does not exist, as buffering need not actually be done). If a -<span class="lineNum"> 734 </span> : * buffer exists, it is "consumed", with "some effect" on the -<span class="lineNum"> 735 </span> : * controlled sequence. (Typically, the buffer is written out to the -<span class="lineNum"> 736 </span> : * sequence verbatim.) In either case, the character @a c is also -<span class="lineNum"> 737 </span> : * written out, if @a c is not @c eof(). -<span class="lineNum"> 738 </span> : * -<span class="lineNum"> 739 </span> : * For a formal definition of this function, see a good text -<span class="lineNum"> 740 </span> : * such as Langer & Kreft, or [27.5.2.4.5]/3-7. -<span class="lineNum"> 741 </span> : * -<span class="lineNum"> 742 </span> : * A functioning output streambuf can be created by overriding only -<span class="lineNum"> 743 </span> : * this function (no buffer area will be used). -<span class="lineNum"> 744 </span> : * -<span class="lineNum"> 745 </span> : * @note Base class version does nothing, returns eof(). -<span class="lineNum"> 746 </span> : */ -<span class="lineNum"> 747 </span> : virtual int_type -<span class="lineNum"> 748 </span> : overflow(int_type /* __c */ = traits_type::eof()) -<span class="lineNum"> 749 </span> : { return traits_type::eof(); } -<span class="lineNum"> 750 </span> : -<span class="lineNum"> 751 </span> : #if _GLIBCXX_DEPRECATED -<span class="lineNum"> 752 </span> : // Annex D.6 -<span class="lineNum"> 753 </span> : public: -<span class="lineNum"> 754 </span> : /** -<span class="lineNum"> 755 </span> : * @brief Tosses a character. -<span class="lineNum"> 756 </span> : * -<span class="lineNum"> 757 </span> : * Advances the read pointer, ignoring the character that would have -<span class="lineNum"> 758 </span> : * been read. -<span class="lineNum"> 759 </span> : * -<span class="lineNum"> 760 </span> : * See http://gcc.gnu.org/ml/libstdc++/2002-05/msg00168.html -<span class="lineNum"> 761 </span> : */ -<span class="lineNum"> 762 </span> : void -<span class="lineNum"> 763 </span> : stossc() -<span class="lineNum"> 764 </span> : { -<span class="lineNum"> 765 </span> : if (this->gptr() < this->egptr()) -<span class="lineNum"> 766 </span> : this->gbump(1); -<span class="lineNum"> 767 </span> : else -<span class="lineNum"> 768 </span> : this->uflow(); -<span class="lineNum"> 769 </span> : } -<span class="lineNum"> 770 </span> : #endif -<span class="lineNum"> 771 </span> : -<span class="lineNum"> 772 </span> : private: -<span class="lineNum"> 773 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 774 </span> : // Side effect of DR 50. -<span class="lineNum"> 775 </span> : basic_streambuf(const __streambuf_type& __sb) -<span class="lineNum"> 776 </span> : : _M_in_beg(__sb._M_in_beg), _M_in_cur(__sb._M_in_cur), -<span class="lineNum"> 777 </span> : _M_in_end(__sb._M_in_end), _M_out_beg(__sb._M_out_beg), -<span class="lineNum"> 778 </span> : _M_out_cur(__sb._M_out_cur), _M_out_end(__sb._M_out_cur), -<span class="lineNum"> 779 </span> : _M_buf_locale(__sb._M_buf_locale) -<span class="lineNum"> 780 </span> : { } -<span class="lineNum"> 781 </span> : -<span class="lineNum"> 782 </span> : __streambuf_type& -<span class="lineNum"> 783 </span> : operator=(const __streambuf_type&) { return *this; }; -<span class="lineNum"> 784 </span> : }; -<span class="lineNum"> 785 </span> : -<span class="lineNum"> 786 </span> : // Explicit specialization declarations, defined in src/streambuf.cc. -<span class="lineNum"> 787 </span> : template<> -<span class="lineNum"> 788 </span> : streamsize -<span class="lineNum"> 789 </span> : __copy_streambufs_eof(basic_streambuf<char>* __sbin, -<span class="lineNum"> 790 </span> : basic_streambuf<char>* __sbout, bool& __ineof); -<span class="lineNum"> 791 </span> : #ifdef _GLIBCXX_USE_WCHAR_T -<span class="lineNum"> 792 </span> : template<> -<span class="lineNum"> 793 </span> : streamsize -<span class="lineNum"> 794 </span> : __copy_streambufs_eof(basic_streambuf<wchar_t>* __sbin, -<span class="lineNum"> 795 </span> : basic_streambuf<wchar_t>* __sbout, bool& __ineof); -<span class="lineNum"> 796 </span> : #endif -<span class="lineNum"> 797 </span> : -<span class="lineNum"> 798 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 799 </span> : -<span class="lineNum"> 800 </span> : #ifndef _GLIBCXX_EXPORT_TEMPLATE -<span class="lineNum"> 801 </span> : # include <bits/streambuf.tcc> -<span class="lineNum"> 802 </span> : #endif -<span class="lineNum"> 803 </span> : -<span class="lineNum"> 804 </span> : #endif /* _GLIBCXX_STREAMBUF */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/c++/4.3/typeinfo.gcov.html b/rep/usr/include/c++/4.3/typeinfo.gcov.html deleted file mode 100644 index de9327e..0000000 --- a/rep/usr/include/c++/4.3/typeinfo.gcov.html +++ /dev/null @@ -1,264 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/typeinfo</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3</a> - typeinfo</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">50.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // RTTI support for -*- C++ -*- -<span class="lineNum"> 2 </span> : // Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, -<span class="lineNum"> 3 </span> : // 2003, 2004, 2005, 2006, 2007 -<span class="lineNum"> 4 </span> : // Free Software Foundation -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of GCC. -<span class="lineNum"> 7 </span> : // -<span class="lineNum"> 8 </span> : // GCC is free software; you can redistribute it and/or modify -<span class="lineNum"> 9 </span> : // it under the terms of the GNU General Public License as published by -<span class="lineNum"> 10 </span> : // the Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 11 </span> : // any later version. -<span class="lineNum"> 12 </span> : // -<span class="lineNum"> 13 </span> : // GCC is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : // GNU General Public License for more details. -<span class="lineNum"> 17 </span> : // -<span class="lineNum"> 18 </span> : // You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : // along with GCC; see the file COPYING. If not, write to -<span class="lineNum"> 20 </span> : // the Free Software Foundation, 51 Franklin Street, Fifth Floor, -<span class="lineNum"> 21 </span> : // Boston, MA 02110-1301, USA. -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 24 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 25 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 26 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 27 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 28 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 29 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 30 </span> : // the GNU General Public License. -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** @file typeinfo -<span class="lineNum"> 33 </span> : * This is a Standard C++ Library header. -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : #ifndef _TYPEINFO -<span class="lineNum"> 37 </span> : #define _TYPEINFO -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : #include <exception> -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : #pragma GCC visibility push(default) -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : extern "C++" { -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : namespace __cxxabiv1 -<span class="lineNum"> 46 </span> : { -<span class="lineNum"> 47 </span> : class __class_type_info; -<span class="lineNum"> 48 </span> : } // namespace __cxxabiv1 -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : // Determine whether typeinfo names for the same type are merged (in which -<span class="lineNum"> 51 </span> : // case comparison can just compare pointers) or not (in which case -<span class="lineNum"> 52 </span> : // strings must be compared and g++.dg/abi/local1.C will fail), and -<span class="lineNum"> 53 </span> : // whether comparison is to be implemented inline or not. By default we -<span class="lineNum"> 54 </span> : // use inline pointer comparison if weak symbols are available, and -<span class="lineNum"> 55 </span> : // out-of-line strcmp if not. Out-of-line pointer comparison is used -<span class="lineNum"> 56 </span> : // where the object files are to be portable to multiple systems, some of -<span class="lineNum"> 57 </span> : // which may not be able to use pointer comparison, but the particular -<span class="lineNum"> 58 </span> : // system for which libstdc++ is being built can use pointer comparison; -<span class="lineNum"> 59 </span> : // in particular for most ARM EABI systems, where the ABI specifies -<span class="lineNum"> 60 </span> : // out-of-line comparison. Inline strcmp is not currently supported. The -<span class="lineNum"> 61 </span> : // compiler's target configuration can override the defaults by defining -<span class="lineNum"> 62 </span> : // __GXX_TYPEINFO_EQUALITY_INLINE to 1 or 0 to indicate whether or not -<span class="lineNum"> 63 </span> : // comparison is inline, and __GXX_MERGED_TYPEINFO_NAMES to 1 or 0 to -<span class="lineNum"> 64 </span> : // indicate whether or not pointer comparison can be used. -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : #ifndef __GXX_MERGED_TYPEINFO_NAMES -<span class="lineNum"> 67 </span> : #if !__GXX_WEAK__ -<span class="lineNum"> 68 </span> : // If weak symbols are not supported, typeinfo names are not merged. -<span class="lineNum"> 69 </span> : #define __GXX_MERGED_TYPEINFO_NAMES 0 -<span class="lineNum"> 70 </span> : #else -<span class="lineNum"> 71 </span> : // On platforms that support weak symbols, typeinfo names are merged. -<span class="lineNum"> 72 </span> : #define __GXX_MERGED_TYPEINFO_NAMES 1 -<span class="lineNum"> 73 </span> : #endif -<span class="lineNum"> 74 </span> : #endif -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : // By default follow the same rules as for __GXX_MERGED_TYPEINFO_NAMES. -<span class="lineNum"> 77 </span> : #ifndef __GXX_TYPEINFO_EQUALITY_INLINE -<span class="lineNum"> 78 </span> : #if !__GXX_WEAK__ -<span class="lineNum"> 79 </span> : #define __GXX_TYPEINFO_EQUALITY_INLINE 0 -<span class="lineNum"> 80 </span> : #else -<span class="lineNum"> 81 </span> : #define __GXX_TYPEINFO_EQUALITY_INLINE 1 -<span class="lineNum"> 82 </span> : #endif -<span class="lineNum"> 83 </span> : #endif -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : namespace std -<span class="lineNum"> 86 </span> : { -<span class="lineNum"> 87 </span> : /** -<span class="lineNum"> 88 </span> : * @brief Part of RTTI. -<span class="lineNum"> 89 </span> : * -<span class="lineNum"> 90 </span> : * The @c type_info class describes type information generated by -<span class="lineNum"> 91 </span> : * an implementation. -<span class="lineNum"> 92 </span> : */ -<span class="lineNum"> 93 </span> : class type_info -<span class="lineNum"> 94 </span> : { -<span class="lineNum"> 95 </span> : public: -<span class="lineNum"> 96 </span> : /** Destructor first. Being the first non-inline virtual function, this -<span class="lineNum"> 97 </span> : * controls in which translation unit the vtable is emitted. The -<span class="lineNum"> 98 </span> : * compiler makes use of that information to know where to emit -<span class="lineNum"> 99 </span> : * the runtime-mandated type_info structures in the new-abi. */ -<span class="lineNum"> 100 </span> : virtual ~type_info(); -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : /** Returns an @e implementation-defined byte string; this is not -<span class="lineNum"> 103 </span> : * portable between compilers! */ -<span class="lineNum"> 104 </span><span class="lineCov"> 2 : const char* name() const</span> -<span class="lineNum"> 105 </span><span class="lineCov"> 2 : { return __name; }</span> -<span class="lineNum"> 106 </span> : -<span class="lineNum"> 107 </span> : #if !__GXX_TYPEINFO_EQUALITY_INLINE -<span class="lineNum"> 108 </span> : bool before(const type_info& __arg) const; -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : // In old abi, or when weak symbols are not supported, there can -<span class="lineNum"> 111 </span> : // be multiple instances of a type_info object for one -<span class="lineNum"> 112 </span> : // type. Uniqueness must use the _name value, not object address. -<span class="lineNum"> 113 </span> : bool operator==(const type_info& __arg) const; -<span class="lineNum"> 114 </span> : #else -<span class="lineNum"> 115 </span> : #if !__GXX_MERGED_TYPEINFO_NAMES -<span class="lineNum"> 116 </span> : #error "Inline implementation of type_info comparision requires merging of type_info objects" -<span class="lineNum"> 117 </span> : #endif -<span class="lineNum"> 118 </span> : /** Returns true if @c *this precedes @c __arg in the implementation's -<span class="lineNum"> 119 </span> : * collation order. */ -<span class="lineNum"> 120 </span> : // In new abi we can rely on type_info's NTBS being unique, -<span class="lineNum"> 121 </span> : // and therefore address comparisons are sufficient. -<span class="lineNum"> 122 </span><span class="lineNoCov"> 0 : bool before(const type_info& __arg) const</span> -<span class="lineNum"> 123 </span><span class="lineNoCov"> 0 : { return __name < __arg.__name; }</span> -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : bool operator==(const type_info& __arg) const -<span class="lineNum"> 126 </span> : { return __name == __arg.__name; } -<span class="lineNum"> 127 </span> : #endif -<span class="lineNum"> 128 </span> : bool operator!=(const type_info& __arg) const -<span class="lineNum"> 129 </span> : { return !operator==(__arg); } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : // Return true if this is a pointer type of some kind -<span class="lineNum"> 132 </span> : virtual bool __is_pointer_p() const; -<span class="lineNum"> 133 </span> : -<span class="lineNum"> 134 </span> : // Return true if this is a function type -<span class="lineNum"> 135 </span> : virtual bool __is_function_p() const; -<span class="lineNum"> 136 </span> : -<span class="lineNum"> 137 </span> : // Try and catch a thrown type. Store an adjusted pointer to the -<span class="lineNum"> 138 </span> : // caught type in THR_OBJ. If THR_TYPE is not a pointer type, then -<span class="lineNum"> 139 </span> : // THR_OBJ points to the thrown object. If THR_TYPE is a pointer -<span class="lineNum"> 140 </span> : // type, then THR_OBJ is the pointer itself. OUTER indicates the -<span class="lineNum"> 141 </span> : // number of outer pointers, and whether they were const -<span class="lineNum"> 142 </span> : // qualified. -<span class="lineNum"> 143 </span> : virtual bool __do_catch(const type_info *__thr_type, void **__thr_obj, -<span class="lineNum"> 144 </span> : unsigned __outer) const; -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : // Internally used during catch matching -<span class="lineNum"> 147 </span> : virtual bool __do_upcast(const __cxxabiv1::__class_type_info *__target, -<span class="lineNum"> 148 </span> : void **__obj_ptr) const; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : protected: -<span class="lineNum"> 151 </span> : const char *__name; -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : explicit type_info(const char *__n): __name(__n) { } -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : private: -<span class="lineNum"> 156 </span> : /// Assigning type_info is not supported. -<span class="lineNum"> 157 </span> : type_info& operator=(const type_info&); -<span class="lineNum"> 158 </span> : type_info(const type_info&); -<span class="lineNum"> 159 </span> : }; -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : /** -<span class="lineNum"> 162 </span> : * @brief Thrown during incorrect typecasting. -<span class="lineNum"> 163 </span> : * -<span class="lineNum"> 164 </span> : * If you attempt an invalid @c dynamic_cast expression, an instance of -<span class="lineNum"> 165 </span> : * this class (or something derived from this class) is thrown. */ -<span class="lineNum"> 166 </span> : class bad_cast : public exception -<span class="lineNum"> 167 </span> : { -<span class="lineNum"> 168 </span> : public: -<span class="lineNum"> 169 </span> : bad_cast() throw() { } -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : // This declaration is not useless: -<span class="lineNum"> 172 </span> : // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 -<span class="lineNum"> 173 </span> : virtual ~bad_cast() throw(); -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : // See comment in eh_exception.cc. -<span class="lineNum"> 176 </span> : virtual const char* what() const throw(); -<span class="lineNum"> 177 </span> : }; -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : /** If you use a NULL pointer in a @c typeid expression, this is thrown. */ -<span class="lineNum"> 180 </span> : class bad_typeid : public exception -<span class="lineNum"> 181 </span> : { -<span class="lineNum"> 182 </span> : public: -<span class="lineNum"> 183 </span> : bad_typeid () throw() { } -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : // This declaration is not useless: -<span class="lineNum"> 186 </span> : // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118 -<span class="lineNum"> 187 </span> : virtual ~bad_typeid() throw(); -<span class="lineNum"> 188 </span> : -<span class="lineNum"> 189 </span> : // See comment in eh_exception.cc. -<span class="lineNum"> 190 </span> : virtual const char* what() const throw(); -<span class="lineNum"> 191 </span> : }; -<span class="lineNum"> 192 </span> : } // namespace std -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : #pragma GCC visibility pop -<span class="lineNum"> 195 </span> : -<span class="lineNum"> 196 </span> : } // extern "C++" -<span class="lineNum"> 197 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h.gcov.html deleted file mode 100644 index 040ef47..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h.gcov.html +++ /dev/null @@ -1,261 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/TextFormat.h</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - TextFormat.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">7</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">14.3 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_TEXTFORMAT_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_TEXTFORMAT_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Serialize and deserialize a tagged collection to a text file -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003--2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <wibble/mixin.h> -<span class="lineNum"> 27 </span> : #include <wibble/empty.h> -<span class="lineNum"> 28 </span> : #include <wibble/singleton.h> -<span class="lineNum"> 29 </span> : #include <tagcoll/input/base.h> -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : #include <stdio.h> -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : //#define TRACE_PARSE -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : namespace tagcoll -<span class="lineNum"> 36 </span> : { -<span class="lineNum"> 37 </span> : template<class ITEM, class TAG> -<span class="lineNum"> 38 </span> : class PatchList; -<span class="lineNum"> 39 </span> : template<class ITEM, class TAG> -<span class="lineNum"> 40 </span> : class Patch; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : namespace textformat -<span class="lineNum"> 43 </span> : { -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : /** -<span class="lineNum"> 46 </span> : * TagcollConsumer that serializes its input to an output stream -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * The format of the output is: -<span class="lineNum"> 49 </span> : * lines of "comma+space"-separated items, followed by "colon+space", -<span class="lineNum"> 50 </span> : * followed by the corresponding "comma+space"-separated tags. -<span class="lineNum"> 51 </span> : * Examples: -<span class="lineNum"> 52 </span> : * ITEM: -<span class="lineNum"> 53 </span> : * ITEM: TAG -<span class="lineNum"> 54 </span> : * ITEM: TAG1, TAG2, TAG3 -<span class="lineNum"> 55 </span> : * ITEM1, ITEM2, ITEM3: -<span class="lineNum"> 56 </span> : * ITEM1, ITEM2, ITEM3: TAG1, TAG2, TAG3 -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : class StdioWriter : public wibble::mixin::OutputIterator<StdioWriter> -<span class="lineNum"> 59 </span> : { -<span class="lineNum"> 60 </span> : protected: -<span class="lineNum"> 61 </span> : FILE* out; -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : public: -<span class="lineNum"> 64 </span><span class="lineCov"> 1 : StdioWriter(FILE* out) : out(out) {}</span> -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : template<typename Items, typename Tags> -<span class="lineNum"> 67 </span> : StdioWriter& operator=(const std::pair<Items, Tags>& data); -<span class="lineNum"> 68 </span> : }; -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : class OstreamWriter : public wibble::mixin::OutputIterator<OstreamWriter> -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span> : protected: -<span class="lineNum"> 73 </span> : std::ostream& out; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : public: -<span class="lineNum"> 76 </span> : OstreamWriter(std::ostream& out) : out(out) {} -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : template<typename Items, typename Tags> -<span class="lineNum"> 79 </span> : OstreamWriter& operator=(const std::pair<Items, Tags>& data); -<span class="lineNum"> 80 </span> : }; -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : /** -<span class="lineNum"> 83 </span> : * Parse an element from input -<span class="lineNum"> 84 </span> : * -<span class="lineNum"> 85 </span> : * @retval item -<span class="lineNum"> 86 </span> : * The item found on input -<span class="lineNum"> 87 </span> : * @return -<span class="lineNum"> 88 </span> : * the trailing separating char, that can be: -<span class="lineNum"> 89 </span> : * \li input::Input::Eof -<span class="lineNum"> 90 </span> : * \li '\n' -<span class="lineNum"> 91 </span> : * \li ':' -<span class="lineNum"> 92 </span> : * \li ',' -<span class="lineNum"> 93 </span> : */ -<span class="lineNum"> 94 </span> : int parseElement(input::Input& in, std::string& item); -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : /** -<span class="lineNum"> 98 </span> : * Serialize a patch -<span class="lineNum"> 99 </span> : */ -<span class="lineNum"> 100 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 101 </span> : void outputPatch( -<span class="lineNum"> 102 </span> : ITEMSER& itemconv, -<span class="lineNum"> 103 </span> : TAGSER& tagconv, -<span class="lineNum"> 104 </span> : const PatchList<ITEM, TAG>& patch, -<span class="lineNum"> 105 </span> : FILE* out); -<span class="lineNum"> 106 </span> : -<span class="lineNum"> 107 </span> : void outputPatch( -<span class="lineNum"> 108 </span> : const PatchList<std::string, std::string>& patch, -<span class="lineNum"> 109 </span> : FILE* out); -<span class="lineNum"> 110 </span> : -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : /* -<span class="lineNum"> 113 </span> : * Parse a tagged collection, sending the results to out. -<span class="lineNum"> 114 </span> : * -<span class="lineNum"> 115 </span> : * @param out -<span class="lineNum"> 116 </span> : * An output iterator accepting a std::pair<string, string> -<span class="lineNum"> 117 </span> : */ -<span class="lineNum"> 118 </span> : template<typename OUT> -<span class="lineNum"> 119 </span> : void parse(input::Input& in, OUT out); -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : /** -<span class="lineNum"> 122 </span> : * Assemble a patch from a stream of "item: +added, -removed" items and tags -<span class="lineNum"> 123 </span> : */ -<span class="lineNum"> 124 </span> : template<typename OUT> -<span class="lineNum"> 125 </span> : class PatchAssembler : public wibble::mixin::OutputIterator< PatchAssembler<OUT> > -<span class="lineNum"> 126 </span> : { -<span class="lineNum"> 127 </span> : OUT out; -<span class="lineNum"> 128 </span> : public: -<span class="lineNum"> 129 </span><span class="lineNoCov"> 0 : PatchAssembler(const OUT& out) : out(out) {}</span> -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 132 </span> : PatchAssembler& operator=(const std::pair<ITEMS, TAGS>& data); -<span class="lineNum"> 133 </span> : }; -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : template<typename OUT> -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : PatchAssembler<OUT> patchAssembler(const OUT& out)</span> -<span class="lineNum"> 137 </span> : { -<span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : return PatchAssembler<OUT>(out);</span> -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : template<typename OUT> -<span class="lineNum"> 142 </span><span class="lineNoCov"> 0 : void parsePatch(input::Input& in, OUT out)</span> -<span class="lineNum"> 143 </span> : { -<span class="lineNum"> 144 </span><span class="lineNoCov"> 0 : parse(in, patchAssembler(out));</span> -<span class="lineNum"> 145 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : /** -<span class="lineNum"> 148 </span> : * Parse a tagcoll patch -<span class="lineNum"> 149 </span> : */ -<span class="lineNum"> 150 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 151 </span> : PatchList<ITEM, TAG> parsePatch( -<span class="lineNum"> 152 </span> : ITEMSER& itemconv, -<span class="lineNum"> 153 </span> : TAGSER& tagconv, -<span class="lineNum"> 154 </span> : input::Input& in); -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : PatchList<std::string, std::string> parsePatch(input::Input& in); -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 161 </span> : class PatchBuilder : public wibble::mixin::OutputIterator< PatchBuilder<ITEM, TAG, ITEMSER, TAGSER> > -<span class="lineNum"> 162 </span> : { -<span class="lineNum"> 163 </span> : protected: -<span class="lineNum"> 164 </span> : PatchList<ITEM, TAG>& patch; -<span class="lineNum"> 165 </span> : const ITEMSER& itemconv; -<span class="lineNum"> 166 </span> : const TAGSER& tagconv; -<span class="lineNum"> 167 </span> : -<span class="lineNum"> 168 </span> : public: -<span class="lineNum"> 169 </span> : PatchBuilder( -<span class="lineNum"> 170 </span> : PatchList<ITEM, TAG>& patch, -<span class="lineNum"> 171 </span> : const ITEMSER& itemconv, -<span class="lineNum"> 172 </span> : const TAGSER& tagconv) -<span class="lineNum"> 173 </span> : : patch(patch), itemconv(itemconv), tagconv(tagconv) {} -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 176 </span> : PatchBuilder<ITEM, TAG, ITEMSER, TAGSER>& operator=(const std::pair<ITEMS, TAGS>& data); -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : const PatchList<ITEM, TAG>& getPatch() const throw () { return patch; } -<span class="lineNum"> 179 </span> : }; -<span class="lineNum"> 180 </span> : -<span class="lineNum"> 181 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 182 </span> : PatchBuilder<ITEM, TAG, ITEMSER, TAGSER> patchBuilder( -<span class="lineNum"> 183 </span> : PatchList<ITEM, TAG>& patch, -<span class="lineNum"> 184 </span> : const ITEMSER& itemconv, -<span class="lineNum"> 185 </span> : const TAGSER& tagconv) -<span class="lineNum"> 186 </span> : { -<span class="lineNum"> 187 </span> : return PatchBuilder<ITEM, TAG, ITEMSER, TAGSER>(patch, itemconv, tagconv); -<span class="lineNum"> 188 </span> : } -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : } -<span class="lineNum"> 191 </span> : } -<span class="lineNum"> 192 </span> : -<span class="lineNum"> 193 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 194 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc.gcov.html deleted file mode 100644 index 3b6b659..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc.gcov.html +++ /dev/null @@ -1,357 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/TextFormat.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - TextFormat.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">79</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">54.4 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">43</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /* -<span class="lineNum"> 2 </span> : * Serialize a tagged collection to a text file -<span class="lineNum"> 3 </span> : * -<span class="lineNum"> 4 </span> : * Copyright (C) 2003--2008 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 7 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 8 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 9 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 14 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 17 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef TAGCOLL_TEXTFORMAT_TCC -<span class="lineNum"> 22 </span> : #define TAGCOLL_TEXTFORMAT_TCC -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <tagcoll/TextFormat.h> -<span class="lineNum"> 25 </span> : #include <tagcoll/patch.h> -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <wibble/exception.h> -<span class="lineNum"> 28 </span> : #include <wibble/empty.h> -<span class="lineNum"> 29 </span> : #include <wibble/operators.h> -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : #include <ostream> -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : using namespace std; -<span class="lineNum"> 34 </span> : using namespace wibble; -<span class="lineNum"> 35 </span> : using namespace wibble::operators; -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span><span class="lineNoCov"> 0 : static void printTagset(const std::set<string>& ts, FILE* out)</span> -<span class="lineNum"> 38 </span> : { -<span class="lineNum"> 39 </span><span class="lineNoCov"> 0 : for (std::set<string>::const_iterator i = ts.begin();</span> -<span class="lineNum"> 40 </span> : i != ts.end(); i++) -<span class="lineNum"> 41 </span><span class="lineNoCov"> 0 : if (i == ts.begin())</span> -<span class="lineNum"> 42 </span> : { -<span class="lineNum"> 43 </span><span class="lineNoCov"> 0 : if (fprintf(out, "%s", i->c_str()) < 0)</span> -<span class="lineNum"> 44 </span><span class="lineNoCov"> 0 : throw wibble::exception::System("writing tagset");</span> -<span class="lineNum"> 45 </span> : } -<span class="lineNum"> 46 </span> : else -<span class="lineNum"> 47 </span> : { -<span class="lineNum"> 48 </span><span class="lineNoCov"> 0 : if (fprintf(out, ", %s", i->c_str()) < 0)</span> -<span class="lineNum"> 49 </span><span class="lineNoCov"> 0 : throw wibble::exception::System("writing tagset");</span> -<span class="lineNum"> 50 </span> : } -<span class="lineNum"> 51 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : namespace tagcoll { -<span class="lineNum"> 54 </span> : namespace textformat { -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span><span class="lineCov"> 126871 : inline static void outString(const std::string& str, FILE* out, const char* what)</span> -<span class="lineNum"> 57 </span> : { -<span class="lineNum"> 58 </span><span class="lineCov"> 126871 : if (fwrite(str.data(), str.size(), 1, out) != 1)</span> -<span class="lineNum"> 59 </span><span class="lineNoCov"> 0 : throw wibble::exception::System(string("writing ") + what);</span> -<span class="lineNum"> 60 </span><span class="lineCov"> 126871 : }</span> -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : template<typename Items, typename Tags> -<span class="lineNum"> 63 </span><span class="lineCov"> 21145 : StdioWriter& StdioWriter::operator=(const std::pair<Items, Tags>& data)</span> -<span class="lineNum"> 64 </span> : { -<span class="lineNum"> 65 </span><span class="lineCov"> 42290 : for (typename Items::const_iterator i = data.first.begin();</span> -<span class="lineNum"> 66 </span> : i != data.first.end(); ++i) -<span class="lineNum"> 67 </span> : { -<span class="lineNum"> 68 </span><span class="lineCov"> 21145 : if (i != data.first.begin())</span> -<span class="lineNum"> 69 </span><span class="lineNoCov"> 0 : if (fputs(", ", out) == EOF)</span> -<span class="lineNum"> 70 </span><span class="lineNoCov"> 0 : throw wibble::exception::System("writing comma after item");</span> -<span class="lineNum"> 71 </span><span class="lineCov"> 21145 : outString(*i, out, "item");</span> -<span class="lineNum"> 72 </span> : } -<span class="lineNum"> 73 </span><span class="lineCov"> 21145 : if (data.second.begin() != data.second.end())</span> -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span><span class="lineCov"> 21145 : if (fputs(": ", out) == EOF)</span> -<span class="lineNum"> 76 </span><span class="lineNoCov"> 0 : throw wibble::exception::System("writing colon after items");</span> -<span class="lineNum"> 77 </span><span class="lineCov"> 126871 : for (typename Tags::const_iterator i = data.second.begin();</span> -<span class="lineNum"> 78 </span> : i != data.second.end(); ++i) -<span class="lineNum"> 79 </span> : { -<span class="lineNum"> 80 </span><span class="lineCov"> 105726 : if (i != data.second.begin())</span> -<span class="lineNum"> 81 </span><span class="lineCov"> 84581 : if (fputs(", ", out) == EOF)</span> -<span class="lineNum"> 82 </span><span class="lineNoCov"> 0 : throw wibble::exception::System("writing comma after tag");</span> -<span class="lineNum"> 83 </span><span class="lineCov"> 105726 : outString(*i, out, "tag");</span> -<span class="lineNum"> 84 </span> : } -<span class="lineNum"> 85 </span> : } -<span class="lineNum"> 86 </span><span class="lineCov"> 21145 : if (fputc('\n', out) == EOF)</span> -<span class="lineNum"> 87 </span><span class="lineNoCov"> 0 : throw wibble::exception::System("writing newline after tagset");</span> -<span class="lineNum"> 88 </span><span class="lineCov"> 21145 : return *this;</span> -<span class="lineNum"> 89 </span> : } -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : template<typename Items, typename Tags> -<span class="lineNum"> 92 </span> : OstreamWriter& OstreamWriter::operator=(const std::pair<Items, Tags>& data) -<span class="lineNum"> 93 </span> : { -<span class="lineNum"> 94 </span> : for (typename Items::const_iterator i = data.first.begin(); -<span class="lineNum"> 95 </span> : i != data.first.end(); ++i) -<span class="lineNum"> 96 </span> : { -<span class="lineNum"> 97 </span> : if (i != data.first.begin()) -<span class="lineNum"> 98 </span> : out << ", "; -<span class="lineNum"> 99 </span> : out << *i; -<span class="lineNum"> 100 </span> : } -<span class="lineNum"> 101 </span> : if (data.second.begin() != data.second.end()) -<span class="lineNum"> 102 </span> : { -<span class="lineNum"> 103 </span> : out << ": "; -<span class="lineNum"> 104 </span> : for (typename Tags::const_iterator i = data.second.begin(); -<span class="lineNum"> 105 </span> : i != data.second.end(); ++i) -<span class="lineNum"> 106 </span> : { -<span class="lineNum"> 107 </span> : if (i != data.second.begin()) -<span class="lineNum"> 108 </span> : out << ", "; -<span class="lineNum"> 109 </span> : out << *i; -<span class="lineNum"> 110 </span> : } -<span class="lineNum"> 111 </span> : } -<span class="lineNum"> 112 </span> : out << endl; -<span class="lineNum"> 113 </span> : return *this; -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : // item1, item2, item3: tag1, tag2, tag3 -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : //#define TRACE_PARSE -<span class="lineNum"> 121 </span> : template<typename OUT> -<span class="lineNum"> 122 </span><span class="lineCov"> 2 : void parse(input::Input& in, OUT out)</span> -<span class="lineNum"> 123 </span> : { -<span class="lineNum"> 124 </span><span class="lineCov"> 2 : string item;</span> -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span><span class="lineCov"> 2 : std::set<string> itemset;</span> -<span class="lineNum"> 127 </span><span class="lineCov"> 2 : std::set<string> tagset;</span> -<span class="lineNum"> 128 </span> : int sep; -<span class="lineNum"> 129 </span><span class="lineCov"> 2 : enum {ITEMS, TAGS} state = ITEMS;</span> -<span class="lineNum"> 130 </span><span class="lineCov"> 2 : int line = 1;</span> -<span class="lineNum"> 131 </span><span class="lineCov"> 253744 : do</span> -<span class="lineNum"> 132 </span> : { -<span class="lineNum"> 133 </span> : try { -<span class="lineNum"> 134 </span><span class="lineCov"> 253744 : sep = parseElement(in, item);</span> -<span class="lineNum"> 135 </span><span class="lineNoCov"> 0 : } catch (tagcoll::exception::Parser& e) {</span> -<span class="lineNum"> 136 </span> : // Add the line number and propagate -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : e.line(line);</span> -<span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : throw e;</span> -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span><span class="lineCov"> 507488 : if (item.size() != 0)</span> -<span class="lineNum"> 142 </span> : { -<span class="lineNum"> 143 </span><span class="lineCov"> 253742 : if (state == ITEMS)</span> -<span class="lineNum"> 144 </span><span class="lineCov"> 42290 : itemset |= item;</span> -<span class="lineNum"> 145 </span> : else -<span class="lineNum"> 146 </span><span class="lineCov"> 211452 : tagset |= item;</span> -<span class="lineNum"> 147 </span> : } -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span><span class="lineCov"> 253744 : switch (sep)</span> -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span> : case '\n': -<span class="lineNum"> 152 </span><span class="lineCov"> 42290 : line++;</span> -<span class="lineNum"> 153 </span> : case input::Input::Eof: -<span class="lineNum"> 154 </span><span class="lineCov"> 42292 : if (!(itemset.empty() && tagset.empty()))</span> -<span class="lineNum"> 155 </span> : { -<span class="lineNum"> 156 </span><span class="lineCov"> 42290 : if (itemset.empty())</span> -<span class="lineNum"> 157 </span><span class="lineNoCov"> 0 : throw tagcoll::exception::Input(line, "no elements before `:' separator");</span> -<span class="lineNum"> 158 </span><span class="lineCov"> 42290 : if (tagset.empty())</span> -<span class="lineNum"> 159 </span><span class="lineNoCov"> 0 : *out = make_pair(itemset, wibble::Empty<std::string>());</span> -<span class="lineNum"> 160 </span> : else -<span class="lineNum"> 161 </span><span class="lineCov"> 42290 : *out = make_pair(itemset, tagset);</span> -<span class="lineNum"> 162 </span><span class="lineCov"> 42290 : ++out;</span> -<span class="lineNum"> 163 </span> : } -<span class="lineNum"> 164 </span><span class="lineCov"> 42292 : itemset.clear();</span> -<span class="lineNum"> 165 </span><span class="lineCov"> 42292 : tagset.clear();</span> -<span class="lineNum"> 166 </span><span class="lineCov"> 42292 : state = ITEMS;</span> -<span class="lineNum"> 167 </span><span class="lineCov"> 42292 : break;</span> -<span class="lineNum"> 168 </span> : case ':': -<span class="lineNum"> 169 </span><span class="lineCov"> 42290 : if (state == TAGS)</span> -<span class="lineNum"> 170 </span><span class="lineNoCov"> 0 : throw tagcoll::exception::Input(line, "separator `:' appears twice");</span> -<span class="lineNum"> 171 </span><span class="lineCov"> 42290 : state = TAGS;</span> -<span class="lineNum"> 172 </span> : break; -<span class="lineNum"> 173 </span> : default: -<span class="lineNum"> 174 </span><span class="lineCov"> 2 : break;</span> -<span class="lineNum"> 175 </span> : } -<span class="lineNum"> 176 </span> : } while (sep != input::Input::Eof); -<span class="lineNum"> 177 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : template<typename OUT> template<typename ITEMS, typename TAGS> -<span class="lineNum"> 180 </span><span class="lineNoCov"> 0 : PatchAssembler<OUT>& PatchAssembler<OUT>::operator=(const std::pair<ITEMS, TAGS>& data)</span> -<span class="lineNum"> 181 </span> : { -<span class="lineNum"> 182 </span><span class="lineNoCov"> 0 : std::set<std::string> added;</span> -<span class="lineNum"> 183 </span><span class="lineNoCov"> 0 : std::set<std::string> removed;</span> -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span><span class="lineNoCov"> 0 : for (typename TAGS::const_iterator i = data.second.begin();</span> -<span class="lineNum"> 186 </span> : i != data.second.end(); ++i) -<span class="lineNum"> 187 </span> : { -<span class="lineNum"> 188 </span><span class="lineNoCov"> 0 : std::string tag = i->substr(1);</span> -<span class="lineNum"> 189 </span><span class="lineNoCov"> 0 : if (!tag.empty())</span> -<span class="lineNum"> 190 </span> : { -<span class="lineNum"> 191 </span><span class="lineNoCov"> 0 : if ((*i)[0] == '-')</span> -<span class="lineNum"> 192 </span><span class="lineNoCov"> 0 : removed.insert(tag);</span> -<span class="lineNum"> 193 </span><span class="lineNoCov"> 0 : else if ((*i)[0] == '+')</span> -<span class="lineNum"> 194 </span><span class="lineNoCov"> 0 : added.insert(tag);</span> -<span class="lineNum"> 195 </span> : } -<span class="lineNum"> 196 </span> : } -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span><span class="lineNoCov"> 0 : for (typename ITEMS::const_iterator i = data.first.begin();</span> -<span class="lineNum"> 199 </span> : i != data.first.end(); ++i) -<span class="lineNum"> 200 </span> : { -<span class="lineNum"> 201 </span><span class="lineNoCov"> 0 : std::string it = *i;</span> -<span class="lineNum"> 202 </span><span class="lineNoCov"> 0 : if (!it.empty())</span> -<span class="lineNum"> 203 </span> : { -<span class="lineNum"> 204 </span><span class="lineNoCov"> 0 : *out = Patch<std::string, std::string>(it, added, removed);</span> -<span class="lineNum"> 205 </span><span class="lineNoCov"> 0 : ++out;</span> -<span class="lineNum"> 206 </span> : } -<span class="lineNum"> 207 </span> : } -<span class="lineNum"> 208 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 209 </span> : } -<span class="lineNum"> 210 </span> : -<span class="lineNum"> 211 </span> : -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 214 </span> : void outputPatch( -<span class="lineNum"> 215 </span> : ITEMSER& itemconv, -<span class="lineNum"> 216 </span> : TAGSER& tagconv, -<span class="lineNum"> 217 </span> : const PatchList<ITEM, TAG>& patch, -<span class="lineNum"> 218 </span> : FILE* out) -<span class="lineNum"> 219 </span> : { -<span class="lineNum"> 220 </span> : for (typename PatchList<ITEM, TAG>::const_iterator i = patch.begin(); -<span class="lineNum"> 221 </span> : i != patch.end(); i++) -<span class="lineNum"> 222 </span> : { -<span class="lineNum"> 223 </span> : string sitem = itemconv(i->first); -<span class="lineNum"> 224 </span> : if (fprintf(out, "%s: ", sitem.c_str()) < 0) -<span class="lineNum"> 225 </span> : throw wibble::exception::System("writing item"); -<span class="lineNum"> 226 </span> : -<span class="lineNum"> 227 </span> : std::set<string> stags; -<span class="lineNum"> 228 </span> : for (typename std::set<TAG>::const_iterator j = i->second.added.begin(); -<span class="lineNum"> 229 </span> : j != i->second.added.end(); j++) -<span class="lineNum"> 230 </span> : stags |= "+"+tagconv(*j); -<span class="lineNum"> 231 </span> : for (typename std::set<TAG>::const_iterator j = i->second.removed.begin(); -<span class="lineNum"> 232 </span> : j != i->second.removed.end(); j++) -<span class="lineNum"> 233 </span> : stags |= "-"+tagconv(*j); -<span class="lineNum"> 234 </span> : -<span class="lineNum"> 235 </span> : printTagset(stags, out); -<span class="lineNum"> 236 </span> : if (fprintf(out, "\n") < 0) -<span class="lineNum"> 237 </span> : throw wibble::exception::System("writing newline after tagset"); -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : } -<span class="lineNum"> 240 </span> : -<span class="lineNum"> 241 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 242 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 243 </span> : PatchBuilder<ITEM, TAG, ITEMSER, TAGSER>& PatchBuilder<ITEM, TAG, ITEMSER, TAGSER>::operator=(const std::pair<ITEMS, TAGS>& data) -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : std::set<TAG> added; -<span class="lineNum"> 246 </span> : std::set<TAG> removed; -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : for (typename TAGS::const_iterator i = data.second.begin(); -<span class="lineNum"> 249 </span> : i != data.second.end(); ++i) -<span class="lineNum"> 250 </span> : { -<span class="lineNum"> 251 </span> : TAG tag = tagconv(i->substr(1)); -<span class="lineNum"> 252 </span> : if (tag != TAG()) -<span class="lineNum"> 253 </span> : { -<span class="lineNum"> 254 </span> : if ((*i)[0] == '-') -<span class="lineNum"> 255 </span> : removed.insert(tag); -<span class="lineNum"> 256 </span> : else if ((*i)[0] == '+') -<span class="lineNum"> 257 </span> : added.insert(tag); -<span class="lineNum"> 258 </span> : } -<span class="lineNum"> 259 </span> : } -<span class="lineNum"> 260 </span> : -<span class="lineNum"> 261 </span> : for (typename ITEMS::const_iterator i = data.first.begin(); -<span class="lineNum"> 262 </span> : i != data.first.end(); ++i) -<span class="lineNum"> 263 </span> : { -<span class="lineNum"> 264 </span> : ITEM it = itemconv(*i); -<span class="lineNum"> 265 </span> : if (it != ITEM()) -<span class="lineNum"> 266 </span> : patch.addPatch(Patch<ITEM, TAG>(it, added, removed)); -<span class="lineNum"> 267 </span> : } -<span class="lineNum"> 268 </span> : return *this; -<span class="lineNum"> 269 </span> : } -<span class="lineNum"> 270 </span> : -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : template<typename ITEM, typename TAG, typename ITEMSER, typename TAGSER> -<span class="lineNum"> 273 </span> : PatchList<ITEM, TAG> parsePatch( -<span class="lineNum"> 274 </span> : ITEMSER& itemconv, -<span class="lineNum"> 275 </span> : TAGSER& tagconv, -<span class="lineNum"> 276 </span> : input::Input& in) -<span class="lineNum"> 277 </span> : { -<span class="lineNum"> 278 </span> : PatchList<ITEM, TAG> patch; -<span class="lineNum"> 279 </span> : parse(in, patchBuilder(patch, itemconv, tagconv)); -<span class="lineNum"> 280 </span> : return patch; -<span class="lineNum"> 281 </span> : } -<span class="lineNum"> 282 </span> : -<span class="lineNum"> 283 </span> : } -<span class="lineNum"> 284 </span><span class="lineCov"> 6 : }</span> -<span class="lineNum"> 285 </span> : -<span class="lineNum"> 286 </span> : #include <tagcoll/patch.tcc> -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : #endif -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : // vim:set ts=4 sw=4: -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h.gcov.html deleted file mode 100644 index 99bba0c..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.h.gcov.html +++ /dev/null @@ -1,400 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/base.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - base.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_COLL_BASE_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_COLL_BASE_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Base mixins for tagged collections -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <wibble/mixin.h> -<span class="lineNum"> 27 </span> : #include <vector> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace std { -<span class="lineNum"> 30 </span> : template<typename A, typename B> class pair; -<span class="lineNum"> 31 </span> : } -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : namespace tagcoll { -<span class="lineNum"> 34 </span> : namespace coll { -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : template<typename T> -<span class="lineNum"> 37 </span> : class coll_traits; -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : /** -<span class="lineNum"> 40 </span> : * Interface for all collections of tagged items. -<span class="lineNum"> 41 </span> : * -<span class="lineNum"> 42 </span> : * \note The point of a collection is to track the tags attached to items, and -<span class="lineNum"> 43 </span> : * not to store the items themselves. This means that collections are not -<span class="lineNum"> 44 </span> : * required to keep track of items with no tags. -<span class="lineNum"> 45 </span> : */ -<span class="lineNum"> 46 </span> : template<typename Self> -<span class="lineNum"> 47 </span> : class ReadonlyCollection -<span class="lineNum"> 48 </span><span class="lineCov"> 37 : {</span> -<span class="lineNum"> 49 </span><span class="lineCov"> 84611 : const Self& self() const { return *static_cast<const Self*>(this); }</span> -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : class CardinalityOrder -<span class="lineNum"> 52 </span> : { -<span class="lineNum"> 53 </span> : const Self& coll; -<span class="lineNum"> 54 </span> : public: -<span class="lineNum"> 55 </span> : CardinalityOrder(const Self& coll) : coll(coll) {} -<span class="lineNum"> 56 </span> : bool operator()(const typename coll_traits<Self>::tag_type& t1, const typename coll_traits<Self>::tag_type& t2) -<span class="lineNum"> 57 </span> : { -<span class="lineNum"> 58 </span> : // Returns true if t1 precedes t2, and false otherwise -<span class="lineNum"> 59 </span> : return coll.getCardinality(t1) < coll.getCardinality(t2); -<span class="lineNum"> 60 </span> : } -<span class="lineNum"> 61 </span> : }; -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : class DiscriminanceOrder -<span class="lineNum"> 64 </span> : { -<span class="lineNum"> 65 </span> : const Self& coll; -<span class="lineNum"> 66 </span> : public: -<span class="lineNum"> 67 </span> : DiscriminanceOrder(const Self& coll) : coll(coll) {} -<span class="lineNum"> 68 </span> : bool operator()(const typename coll_traits<Self>::tag_type& t1, const typename coll_traits<Self>::tag_type& t2) -<span class="lineNum"> 69 </span> : { -<span class="lineNum"> 70 </span> : // Returns true if t1 precedes t2, and false otherwise -<span class="lineNum"> 71 </span> : return coll.getDiscriminance(t1) < coll.getDiscriminance(t2); -<span class="lineNum"> 72 </span> : } -<span class="lineNum"> 73 </span> : }; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : template<typename COLL> -<span class="lineNum"> 76 </span> : class RelevanceOrder -<span class="lineNum"> 77 </span> : { -<span class="lineNum"> 78 </span> : const COLL& first; -<span class="lineNum"> 79 </span> : const Self& second; -<span class="lineNum"> 80 </span> : public: -<span class="lineNum"> 81 </span> : RelevanceOrder(const COLL& first, const Self& second) -<span class="lineNum"> 82 </span> : : first(first), second(second) {} -<span class="lineNum"> 83 </span> : bool operator()(const typename coll_traits<Self>::tag_type& t1, const typename coll_traits<Self>::tag_type& t2); -<span class="lineNum"> 84 </span> : }; -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : /** -<span class="lineNum"> 87 </span> : * Get the items which are tagged with at least the tag `tag' -<span class="lineNum"> 88 </span> : * -<span class="lineNum"> 89 </span> : * \return -<span class="lineNum"> 90 </span> : * The items found, or an empty set if no items have that tag -<span class="lineNum"> 91 </span> : */ -<span class="lineNum"> 92 </span> : //virtual std::set<ITEM> getItemsHavingTag(const TAG& tag) const = 0; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : /** -<span class="lineNum"> 95 </span> : * Get the tags attached to an item. -<span class="lineNum"> 96 </span> : * -<span class="lineNum"> 97 </span> : * \param item -<span class="lineNum"> 98 </span> : * The item to query -<span class="lineNum"> 99 </span> : * \return -<span class="lineNum"> 100 </span> : * The set of tags, or an empty set if the item has no tags or it does -<span class="lineNum"> 101 </span> : * not exist. -<span class="lineNum"> 102 </span> : */ -<span class="lineNum"> 103 </span> : //virtual std::set<TAG> getTagsOfItem(const ITEM& item) const = 0; -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : public: -<span class="lineNum"> 106 </span> : /** -<span class="lineNum"> 107 </span> : * Check if the collection contains a tag -<span class="lineNum"> 108 </span> : * -<span class="lineNum"> 109 </span> : * \param tag -<span class="lineNum"> 110 </span> : * The tag to look for -<span class="lineNum"> 111 </span> : * \return -<span class="lineNum"> 112 </span> : * true if the collection contains tag, false otherwise -<span class="lineNum"> 113 </span> : */ -<span class="lineNum"> 114 </span> : bool hasTag(const typename coll_traits<Self>::tag_type& tag) const; -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : /** -<span class="lineNum"> 117 </span> : * Get the tags of item `item'. Return an empty set if `item' does not exist -<span class="lineNum"> 118 </span> : */ -<span class="lineNum"> 119 </span> : //std::set<Self::tag_type> getTags(const typename Self::item_type& item) const = 0; -<span class="lineNum"> 120 </span> : -<span class="lineNum"> 121 </span> : /** -<span class="lineNum"> 122 </span> : * Get all the tags attached to the items in a set. -<span class="lineNum"> 123 </span> : * -<span class="lineNum"> 124 </span> : * \param items -<span class="lineNum"> 125 </span> : * The items to query -<span class="lineNum"> 126 </span> : * \return -<span class="lineNum"> 127 </span> : * The set of tags, or an empty set if the items have no tags or do not -<span class="lineNum"> 128 </span> : * exist. -<span class="lineNum"> 129 </span> : */ -<span class="lineNum"> 130 </span> : template<typename ITEMS> -<span class="lineNum"> 131 </span> : typename coll_traits<Self>::tagset_type getTagsOfItems(const ITEMS& items) const; -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : /** -<span class="lineNum"> 134 </span> : * Get the items with tag `tag'. Return an empty set if `tag' does not exist -<span class="lineNum"> 135 </span> : */ -<span class="lineNum"> 136 </span> : //std::set<typename Self::item_type> getItems(const TAG& tag) const { return getItemsHavingTag(tag); } -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : /** -<span class="lineNum"> 139 </span> : * Get the items which are tagged with at least the tags `tags' -<span class="lineNum"> 140 </span> : * -<span class="lineNum"> 141 </span> : * \return -<span class="lineNum"> 142 </span> : * The items found, or an empty set if no items have that tag -<span class="lineNum"> 143 </span> : */ -<span class="lineNum"> 144 </span> : template<typename TAGS> -<span class="lineNum"> 145 </span><span class="lineCov"> 2 : typename coll_traits<Self>::itemset_type getItemsHavingTags(const TAGS& tags) const;</span> -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : /** -<span class="lineNum"> 148 </span> : * Get the set of all the items that have tags according to this collection -<span class="lineNum"> 149 </span> : */ -<span class="lineNum"> 150 </span> : //virtual std::set<Self::item_type> getTaggedItems() const = 0; -<span class="lineNum"> 151 </span> : -<span class="lineNum"> 152 </span> : /** -<span class="lineNum"> 153 </span> : * Get the set of all the tags in this collection -<span class="lineNum"> 154 </span> : */ -<span class="lineNum"> 155 </span> : //virtual std::set<Self::tag_type> getAllTags() const = 0; -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : /** -<span class="lineNum"> 158 </span> : * Get all the tags in the collectin, as a vector -<span class="lineNum"> 159 </span> : */ -<span class="lineNum"> 160 </span> : std::vector<typename coll_traits<Self>::tag_type> getAllTagsAsVector() const; -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : /** -<span class="lineNum"> 163 </span> : * Get the cardinality of tag `tag' (that is, the number of items who have it) -<span class="lineNum"> 164 </span> : */ -<span class="lineNum"> 165 </span> : unsigned int getCardinality(const typename coll_traits<Self>::tag_type& tag) const; -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /** -<span class="lineNum"> 168 </span> : * Return the discriminance value for this tag, that is, the minimum number -<span class="lineNum"> 169 </span> : * of packages that would be eliminated by selecting only those tagged with -<span class="lineNum"> 170 </span> : * this tag or only those not tagged with this tag. -<span class="lineNum"> 171 </span> : */ -<span class="lineNum"> 172 </span> : unsigned int getDiscriminance(const typename coll_traits<Self>::tag_type& tag) const -<span class="lineNum"> 173 </span> : { -<span class="lineNum"> 174 </span> : return self().getCardinality(tag) < self().tagCount() - self().getCardinality(tag) ? -<span class="lineNum"> 175 </span> : self().getCardinality(tag) : -<span class="lineNum"> 176 </span> : self().tagCount() - self().getCardinality(tag); -<span class="lineNum"> 177 </span> : } -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : /** -<span class="lineNum"> 180 </span> : * Get the set of all tags in this collection that appear in tagsets -<span class="lineNum"> 181 </span> : * containing `tags' -<span class="lineNum"> 182 </span> : * -<span class="lineNum"> 183 </span> : * Example: -<span class="lineNum"> 184 </span> : * \code -<span class="lineNum"> 185 </span> : * void refineSelection(const std::set<Tag>& selection) -<span class="lineNum"> 186 </span> : * { -<span class="lineNum"> 187 </span> : * std::set<Tag> extraTags = collection.getCompanionTags(selection); -<span class="lineNum"> 188 </span> : * tagMenu.setAvailableOptions(extraTags); -<span class="lineNum"> 189 </span> : * } -<span class="lineNum"> 190 </span> : * \endcode -<span class="lineNum"> 191 </span> : */ -<span class="lineNum"> 192 </span> : template<typename TAGS> -<span class="lineNum"> 193 </span> : typename coll_traits<Self>::tagset_type getCompanionTags(const TAGS& tags) const; -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : /** -<span class="lineNum"> 196 </span> : * Get the related items at the given maximum distance -<span class="lineNum"> 197 </span> : * -<span class="lineNum"> 198 </span> : * Examples: -<span class="lineNum"> 199 </span> : * \code -<span class="lineNum"> 200 </span> : * // Get the items related to a given one, at the given distance -<span class="lineNum"> 201 </span> : * std::set<Item> getRelated(const Item& item, int distance) -<span class="lineNum"> 202 </span> : * { -<span class="lineNum"> 203 </span> : * std::set<Item> res = collection.getRelatedItems(collection.getTags(item), distance); -<span class="lineNum"> 204 </span> : * return res - item; -<span class="lineNum"> 205 </span> : * } -<span class="lineNum"> 206 </span> : * -<span class="lineNum"> 207 </span> : * // Get the items related to the given ones, at the given distance -<span class="lineNum"> 208 </span> : * std::set<Item> getRelated(const std::set<Item>& items, int distance) -<span class="lineNum"> 209 </span> : * { -<span class="lineNum"> 210 </span> : * std::set<Item> res = collection.getRelatedItems(collection.getTags(items), distance); -<span class="lineNum"> 211 </span> : * return res - items; -<span class="lineNum"> 212 </span> : * } -<span class="lineNum"> 213 </span> : * -<span class="lineNum"> 214 </span> : * // Get the related items, increasing the distance until it finds at -<span class="lineNum"> 215 </span> : * // least 'minimum' items -<span class="lineNum"> 216 </span> : * std::set<Item> getRelated(const Item& item, int minimum) -<span class="lineNum"> 217 </span> : * { -<span class="lineNum"> 218 </span> : * std::set<Tag> tags = collection.getTags(item); -<span class="lineNum"> 219 </span> : * std::set<Item> res; -<span class="lineNum"> 220 </span> : * for (int i = 0; i < tags.size() && res.size() < minimum; i++) -<span class="lineNum"> 221 </span> : * res += collection.getRelatedItems(tags, i); -<span class="lineNum"> 222 </span> : * return res - item; -<span class="lineNum"> 223 </span> : * } -<span class="lineNum"> 224 </span> : * \endcode -<span class="lineNum"> 225 </span> : */ -<span class="lineNum"> 226 </span> : template<typename TAGS> -<span class="lineNum"> 227 </span> : typename coll_traits<Self>::itemset_type getRelatedItems(const TAGS& tags, int maxdistance = 1) const; -<span class="lineNum"> 228 </span> : -<span class="lineNum"> 229 </span> : /** -<span class="lineNum"> 230 </span> : * Output all the contents of the collection to an output iterator -<span class="lineNum"> 231 </span> : */ -<span class="lineNum"> 232 </span> : template<typename OUT> -<span class="lineNum"> 233 </span><span class="lineCov"> 5 : void output(OUT out) const;</span> -<span class="lineNum"> 234 </span> : -<span class="lineNum"> 235 </span> : /** -<span class="lineNum"> 236 </span> : * Send to a consumer all the items which are tagged with at least the -<span class="lineNum"> 237 </span> : * given tags -<span class="lineNum"> 238 </span> : */ -<span class="lineNum"> 239 </span> : template<typename TAGS, typename OUT> -<span class="lineNum"> 240 </span> : void outputHavingTags(const TAGS& tags, OUT out) const; -<span class="lineNum"> 241 </span> : -<span class="lineNum"> 242 </span> : /** -<span class="lineNum"> 243 </span> : * Get a vector containing all tags in this collection, sorted by -<span class="lineNum"> 244 </span> : * increasing cardinality -<span class="lineNum"> 245 </span> : */ -<span class="lineNum"> 246 </span> : std::vector<typename coll_traits<Self>::tag_type> tagsInCardinalityOrder() const; -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : /** -<span class="lineNum"> 249 </span> : * Get a vector containing all tags in this collection, sorted by -<span class="lineNum"> 250 </span> : * increasing discriminance value (@see getDiscriminance) -<span class="lineNum"> 251 </span> : */ -<span class="lineNum"> 252 </span> : std::vector<typename coll_traits<Self>::tag_type> tagsInDiscriminanceOrder() const; -<span class="lineNum"> 253 </span> : -<span class="lineNum"> 254 </span> : /** -<span class="lineNum"> 255 </span> : * Get a vector containing all tags in this collection, sorted by -<span class="lineNum"> 256 </span> : * increasing relevance to the filtering applied between coll and this -<span class="lineNum"> 257 </span> : * collection -<span class="lineNum"> 258 </span> : */ -<span class="lineNum"> 259 </span> : template<typename COLL> -<span class="lineNum"> 260 </span> : std::vector<typename coll_traits<Self>::tag_type> tagsInRelevanceOrder(const COLL& coll) const; -<span class="lineNum"> 261 </span> : }; -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : /** -<span class="lineNum"> 265 </span> : * Interface for all collections of tagged items. -<span class="lineNum"> 266 </span> : * -<span class="lineNum"> 267 </span> : * \note The point of a collection is to track the tags attached to items, and -<span class="lineNum"> 268 </span> : * not to store the items themselves. This means that collections are not -<span class="lineNum"> 269 </span> : * required to keep track of items with no tags. -<span class="lineNum"> 270 </span> : */ -<span class="lineNum"> 271 </span> : template<typename Self> -<span class="lineNum"> 272 </span> : class Collection : public ReadonlyCollection<Self> -<span class="lineNum"> 273 </span><span class="lineCov"> 27 : {</span> -<span class="lineNum"> 274 </span> : //protected: -<span class="lineNum"> 275 </span> : /* -<span class="lineNum"> 276 </span> : * Implementation note: to avoid problems with classes implementing only -<span class="lineNum"> 277 </span> : * some of the virtual methods, they are given different names. The common -<span class="lineNum"> 278 </span> : * 'comsume' methods are just inlined calls to the right virtual functions, -<span class="lineNum"> 279 </span> : * and are a way of keeping the unoverridden methods from being hidden. -<span class="lineNum"> 280 </span> : */ -<span class="lineNum"> 281 </span> : -<span class="lineNum"> 282 </span> : //void consumeItemUntagged(const ITEM&) {} -<span class="lineNum"> 283 </span> : //void consumeItemsUntagged(const std::set<ITEM>&) {} -<span class="lineNum"> 284 </span> : -<span class="lineNum"> 285 </span> : public: -<span class="lineNum"> 286 </span> : //virtual ~Collection() {} -<span class="lineNum"> 287 </span> : -<span class="lineNum"> 288 </span> : /** -<span class="lineNum"> 289 </span> : * Apply a patch to the collection -<span class="lineNum"> 290 </span> : * -<span class="lineNum"> 291 </span> : * Example: -<span class="lineNum"> 292 </span> : * \code -<span class="lineNum"> 293 </span> : * void perform(const PatchList<ITEM, TAG>& change) -<span class="lineNum"> 294 </span> : * { -<span class="lineNum"> 295 </span> : * collection.applyChange(change); -<span class="lineNum"> 296 </span> : * undo.push_back(change.getReverse()); -<span class="lineNum"> 297 </span> : * } -<span class="lineNum"> 298 </span> : * \endcode -<span class="lineNum"> 299 </span> : */ -<span class="lineNum"> 300 </span> : // void applyChange( -<span class="lineNum"> 301 </span> : // const PatchList< -<span class="lineNum"> 302 </span> : // typename coll_traits<Self>::item_type, -<span class="lineNum"> 303 </span> : // typename coll_traits<Self>::tag_type>& change); -<span class="lineNum"> 304 </span> : }; -<span class="lineNum"> 305 </span> : -<span class="lineNum"> 306 </span> : -<span class="lineNum"> 307 </span> : template<typename COLL> -<span class="lineNum"> 308 </span> : class Inserter : public wibble::mixin::OutputIterator< Inserter<COLL> > -<span class="lineNum"> 309 </span> : { -<span class="lineNum"> 310 </span> : COLL& coll; -<span class="lineNum"> 311 </span> : -<span class="lineNum"> 312 </span> : public: -<span class="lineNum"> 313 </span><span class="lineCov"> 10 : Inserter(COLL& coll) : coll(coll) {}</span> -<span class="lineNum"> 314 </span> : -<span class="lineNum"> 315 </span> : template<typename Items, typename Tags> -<span class="lineNum"> 316 </span><span class="lineCov"> 63426 : Inserter<COLL>& operator=(const std::pair<Items, Tags>& data)</span> -<span class="lineNum"> 317 </span> : { -<span class="lineNum"> 318 </span><span class="lineCov"> 63426 : coll.insert(data.first, data.second);</span> -<span class="lineNum"> 319 </span><span class="lineCov"> 63426 : return *this;</span> -<span class="lineNum"> 320 </span> : } -<span class="lineNum"> 321 </span> : }; -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : template<typename COLL> -<span class="lineNum"> 324 </span><span class="lineCov"> 10 : Inserter<COLL> inserter(COLL& target)</span> -<span class="lineNum"> 325 </span> : { -<span class="lineNum"> 326 </span><span class="lineCov"> 10 : return Inserter<COLL>(target);</span> -<span class="lineNum"> 327 </span> : } -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : } -<span class="lineNum"> 330 </span> : } -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 333 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc.gcov.html deleted file mode 100644 index 5389355..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc.gcov.html +++ /dev/null @@ -1,258 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/base.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - base.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">18</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">88.9 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">16</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_COLL_BASE_TCC -<span class="lineNum"> 2 </span> : #define TAGCOLL_COLL_BASE_TCC -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Base mixins for tagged collections -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <tagcoll/coll/base.h> -<span class="lineNum"> 27 </span> : #include <tagcoll/utils/set.h> -<span class="lineNum"> 28 </span> : #include <algorithm> -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : namespace tagcoll { -<span class="lineNum"> 31 </span> : namespace coll { -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : template<typename T> -<span class="lineNum"> 34 </span> : class coll_traits; -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : template<typename Self> template<typename COLL> -<span class="lineNum"> 37 </span> : bool ReadonlyCollection<Self>::RelevanceOrder<COLL>::operator()( -<span class="lineNum"> 38 </span> : const typename coll_traits<Self>::tag_type& t1, -<span class="lineNum"> 39 </span> : const typename coll_traits<Self>::tag_type& t2) -<span class="lineNum"> 40 </span> : { -<span class="lineNum"> 41 </span> : // New cardinality divided by the square root of the old cardinality. -<span class="lineNum"> 42 </span> : // The square root is used to downplay the very common tags a bit -<span class="lineNum"> 43 </span> : int csub1 = second.getCardinality(t1); -<span class="lineNum"> 44 </span> : float cfull1 = first.getCardinality(t1); -<span class="lineNum"> 45 </span> : int csub2 = second.getCardinality(t2); -<span class="lineNum"> 46 </span> : float cfull2 = first.getCardinality(t2); -<span class="lineNum"> 47 </span> : float rel1 = (float)(csub1 * csub1) / cfull1; -<span class="lineNum"> 48 </span> : float rel2 = (float)(csub2 * csub2) / cfull2; -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : return rel1 < rel2; -<span class="lineNum"> 51 </span> : // return 10000 * second.getCardinality(t1) / first.getCardinality(t1) -<span class="lineNum"> 52 </span> : // < 10000 * second.getCardinality(t2) / first.getCardinality(t2); -<span class="lineNum"> 53 </span> : } -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : template<typename Self> -<span class="lineNum"> 57 </span> : bool ReadonlyCollection<Self>::hasTag(const typename coll_traits<Self>::tag_type& tag) const -<span class="lineNum"> 58 </span> : { -<span class="lineNum"> 59 </span> : return !self().getItemsHavingTag(tag).empty(); -<span class="lineNum"> 60 </span> : } -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : template<typename Self> template<typename ITEMS> -<span class="lineNum"> 63 </span><span class="lineCov"> 1 : typename coll_traits<Self>::tagset_type ReadonlyCollection<Self>::getTagsOfItems(const ITEMS& items) const</span> -<span class="lineNum"> 64 </span> : { -<span class="lineNum"> 65 </span> : using namespace wibble::operators; -<span class="lineNum"> 66 </span><span class="lineCov"> 1 : typename coll_traits<Self>::tagset_type res;</span> -<span class="lineNum"> 67 </span><span class="lineCov"> 2 : for (typename ITEMS::const_iterator i = items.begin();</span> -<span class="lineNum"> 68 </span> : i != items.end(); i++) -<span class="lineNum"> 69 </span><span class="lineCov"> 1 : res |= self().getTagsOfItem(*i);</span> -<span class="lineNum"> 70 </span><span class="lineNoCov"> 0 : return res;</span> -<span class="lineNum"> 71 </span> : } -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : template<typename Self> template<typename TAGS> -<span class="lineNum"> 74 </span> : typename coll_traits<Self>::itemset_type ReadonlyCollection<Self>::getItemsHavingTags(const TAGS& tags) const -<span class="lineNum"> 75 </span> : { -<span class="lineNum"> 76 </span> : using namespace wibble::operators; -<span class="lineNum"> 77 </span><span class="lineCov"> 2 : if (tags.empty())</span> -<span class="lineNum"> 78 </span><span class="lineNoCov"> 0 : return typename coll_traits<Self>::itemset_type();</span> -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span><span class="lineCov"> 2 : typename TAGS::const_iterator i = tags.begin();</span> -<span class="lineNum"> 81 </span><span class="lineCov"> 2 : typename coll_traits<Self>::itemset_type res = self().getItemsHavingTag(*i);</span> -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span><span class="lineCov"> 9 : for (++i ; i != tags.end(); ++i)</span> -<span class="lineNum"> 84 </span><span class="lineCov"> 7 : res &= self().getItemsHavingTag(*i);</span> -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span><span class="lineCov"> 2 : return res;</span> -<span class="lineNum"> 87 </span> : } -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : template<typename Self> -<span class="lineNum"> 90 </span> : std::vector<typename coll_traits<Self>::tag_type> ReadonlyCollection<Self>::getAllTagsAsVector() const -<span class="lineNum"> 91 </span> : { -<span class="lineNum"> 92 </span> : std::set<typename coll_traits<Self>::tag_type> asSet = self().getAllTags(); -<span class="lineNum"> 93 </span> : std::vector<typename coll_traits<Self>::tag_type> res; -<span class="lineNum"> 94 </span> : res.reserve(asSet.size()); -<span class="lineNum"> 95 </span> : std::copy(asSet.begin(), asSet.end(), back_inserter(res)); -<span class="lineNum"> 96 </span> : return res; -<span class="lineNum"> 97 </span> : } -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : template<typename Self> -<span class="lineNum"> 100 </span> : unsigned int ReadonlyCollection<Self>::getCardinality(const typename coll_traits<Self>::tag_type& tag) const -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span> : return self().getItemsHavingTag(tag).size(); -<span class="lineNum"> 103 </span> : } -<span class="lineNum"> 104 </span> : -<span class="lineNum"> 105 </span> : template<typename Self> template<typename TAGS> -<span class="lineNum"> 106 </span> : typename coll_traits<Self>::tagset_type ReadonlyCollection<Self>::getCompanionTags(const TAGS& tags) const -<span class="lineNum"> 107 </span> : { -<span class="lineNum"> 108 </span> : using namespace wibble::operators; -<span class="lineNum"> 109 </span> : return self().getTagsOfItems(self().getItemsHavingTags(tags)) - tags; -<span class="lineNum"> 110 </span> : } -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : template<typename Self> template<typename TAGS> -<span class="lineNum"> 113 </span> : typename coll_traits<Self>::itemset_type ReadonlyCollection<Self>::getRelatedItems(const TAGS& tags, int maxdistance) const -<span class="lineNum"> 114 </span> : { -<span class="lineNum"> 115 </span> : using namespace wibble::operators; -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : typename coll_traits<Self>::itemset_type packages; -<span class="lineNum"> 118 </span> : typename coll_traits<Self>::itemset_type res; -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : // First get a list of packages that have a non-empty intersection with `tags' -<span class="lineNum"> 121 </span> : for (typename TAGS::const_iterator i = tags.begin(); i != tags.end(); i++) -<span class="lineNum"> 122 </span> : packages |= self().getItemsHavingTag(*i); -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : // Then keep only those within the given distance -<span class="lineNum"> 125 </span> : for (typename coll_traits<Self>::itemset_type::const_iterator i = packages.begin(); i != packages.end(); i++) -<span class="lineNum"> 126 </span> : { -<span class="lineNum"> 127 </span> : int dist = utils::set_distance(tags, self().getTagsOfItem(*i)); -<span class="lineNum"> 128 </span> : if (dist >= 0 && dist <= maxdistance) -<span class="lineNum"> 129 </span> : res |= *i; -<span class="lineNum"> 130 </span> : } -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : return res; -<span class="lineNum"> 133 </span> : } -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : template<typename Self> template<typename OUT> -<span class="lineNum"> 136 </span><span class="lineCov"> 4 : void ReadonlyCollection<Self>::output(OUT out) const</span> -<span class="lineNum"> 137 </span> : { -<span class="lineNum"> 138 </span><span class="lineCov"> 126890 : for (typename Self::const_iterator i = self().begin();</span> -<span class="lineNum"> 139 </span> : i != self().end(); ++i) -<span class="lineNum"> 140 </span> : { -<span class="lineNum"> 141 </span><span class="lineCov"> 84583 : *out = make_pair(wibble::singleton(i->first), i->second);</span> -<span class="lineNum"> 142 </span><span class="lineCov"> 84587 : ++out;</span> -<span class="lineNum"> 143 </span> : } -<span class="lineNum"> 144 </span><span class="lineCov"> 9 : }</span> -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : template<typename Self> template<typename TAGS, typename OUT> -<span class="lineNum"> 147 </span> : void ReadonlyCollection<Self>::outputHavingTags(const TAGS& tags, OUT out) const -<span class="lineNum"> 148 </span> : { -<span class="lineNum"> 149 </span> : typename coll_traits<Self>::itemset_type items = self().getItemsHavingTags(tags); -<span class="lineNum"> 150 </span> : for (typename coll_traits<Self>::itemset_type::const_iterator i = items.begin(); -<span class="lineNum"> 151 </span> : i != items.end(); ++i) -<span class="lineNum"> 152 </span> : { -<span class="lineNum"> 153 </span> : *out = std::make_pair(wibble::singleton(*i), self().getTagsOfItem(*i)); -<span class="lineNum"> 154 </span> : ++out; -<span class="lineNum"> 155 </span> : } -<span class="lineNum"> 156 </span> : } -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : template<typename Self> -<span class="lineNum"> 159 </span> : std::vector<typename coll_traits<Self>::tag_type> ReadonlyCollection<Self>::tagsInCardinalityOrder() const -<span class="lineNum"> 160 </span> : { -<span class="lineNum"> 161 </span> : std::vector<typename coll_traits<Self>::tag_type> res = self().getAllTagsAsVector(); -<span class="lineNum"> 162 </span> : std::sort(res.begin(), res.end(), CardinalityOrder(self())); -<span class="lineNum"> 163 </span> : return res; -<span class="lineNum"> 164 </span> : } -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : template<typename Self> -<span class="lineNum"> 167 </span> : std::vector<typename coll_traits<Self>::tag_type> ReadonlyCollection<Self>::tagsInDiscriminanceOrder() const -<span class="lineNum"> 168 </span> : { -<span class="lineNum"> 169 </span> : std::vector<typename coll_traits<Self>::tag_type> res = self().getAllTagsAsVector(); -<span class="lineNum"> 170 </span> : std::sort(res.begin(), res.end(), DiscriminanceOrder(self())); -<span class="lineNum"> 171 </span> : return res; -<span class="lineNum"> 172 </span> : } -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : /** -<span class="lineNum"> 175 </span> : * Get a vector containing all tags in this collection, sorted by -<span class="lineNum"> 176 </span> : * increasing relevance to the filtering applied between coll and this -<span class="lineNum"> 177 </span> : * collection -<span class="lineNum"> 178 </span> : */ -<span class="lineNum"> 179 </span> : template<typename Self> template<typename COLL> -<span class="lineNum"> 180 </span> : std::vector<typename coll_traits<Self>::tag_type> ReadonlyCollection<Self>::tagsInRelevanceOrder(const COLL& coll) const -<span class="lineNum"> 181 </span> : { -<span class="lineNum"> 182 </span> : std::vector<typename coll_traits<Self>::tag_type> res = self().getAllTagsAsVector(); -<span class="lineNum"> 183 </span> : std::sort(res.begin(), res.end(), RelevanceOrder<COLL>(coll, self())); -<span class="lineNum"> 184 </span> : return res; -<span class="lineNum"> 185 </span> : } -<span class="lineNum"> 186 </span> : -<span class="lineNum"> 187 </span> : } -<span class="lineNum"> 188 </span><span class="lineCov"> 6 : }</span> -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 191 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/index.html deleted file mode 100644 index 0623d19..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/index.html +++ /dev/null @@ -1,137 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/coll</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">177</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">79.7 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">141</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="base.h.gcov.html">base.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">11 / 11 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="base.tcc.gcov.html">base.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=89 height=10 alt="88.9%"><img src="../../../../../snow.png" width=11 height=10 alt="88.9%"></td></tr></table> - </td> - <td class="coverPerHi">88.9 %</td> - <td class="coverNumHi">16 / 18 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="intdiskindex.h.gcov.html">intdiskindex.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=92 height=10 alt="92.1%"><img src="../../../../../snow.png" width=8 height=10 alt="92.1%"></td></tr></table> - </td> - <td class="coverPerHi">92.1 %</td> - <td class="coverNumHi">35 / 38 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="patched.h.gcov.html">patched.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=67 height=10 alt="66.7%"><img src="../../../../../snow.png" width=33 height=10 alt="66.7%"></td></tr></table> - </td> - <td class="coverPerHi">66.7 %</td> - <td class="coverNumHi">38 / 57 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="patched.tcc.gcov.html">patched.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=59 height=10 alt="59.1%"><img src="../../../../../snow.png" width=41 height=10 alt="59.1%"></td></tr></table> - </td> - <td class="coverPerHi">59.1 %</td> - <td class="coverNumHi">13 / 22 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="simple.h.gcov.html">simple.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">14 / 14 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="simple.tcc.gcov.html">simple.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=82 height=10 alt="82.4%"><img src="../../../../../snow.png" width=18 height=10 alt="82.4%"></td></tr></table> - </td> - <td class="coverPerHi">82.4 %</td> - <td class="coverNumHi">14 / 17 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h.gcov.html deleted file mode 100644 index 19678ae..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h.gcov.html +++ /dev/null @@ -1,265 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/intdiskindex.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - intdiskindex.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">38</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">92.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">35</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_COLL_INT_DISK_INDEX_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_COLL_INT_DISK_INDEX_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Fast on-disk index for tag data -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 12 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 13 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 14 </span> : * (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 19 </span> : * GNU General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 22 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <tagcoll/coll/base.h> -<span class="lineNum"> 27 </span> : #include <tagcoll/diskindex/int.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 31 </span> : class PatchList; -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : namespace coll { -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : class IntDiskIndex; -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : template<> -<span class="lineNum"> 38 </span> : struct coll_traits< IntDiskIndex > -<span class="lineNum"> 39 </span> : { -<span class="lineNum"> 40 </span> : typedef int item_type; -<span class="lineNum"> 41 </span> : typedef int tag_type; -<span class="lineNum"> 42 </span> : typedef std::set<int> tagset_type; -<span class="lineNum"> 43 </span> : typedef std::set<int> itemset_type; -<span class="lineNum"> 44 </span> : }; -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : /** -<span class="lineNum"> 47 </span> : * Full TaggedCollection implementation on top of a persistent on-disk TDB -<span class="lineNum"> 48 </span> : * database. -<span class="lineNum"> 49 </span> : * -<span class="lineNum"> 50 </span> : * It allows to efficiently query a collection without having to store it all -<span class="lineNum"> 51 </span> : * into memory. -<span class="lineNum"> 52 </span> : * -<span class="lineNum"> 53 </span> : * If used for heavy modifications, the performance is slower compared to other -<span class="lineNum"> 54 </span> : * in-memory collections. If database writes are mainly used for populating -<span class="lineNum"> 55 </span> : * the index, then TDBIndexer should be used to create the index and -<span class="lineNum"> 56 </span> : * TDBDiskIndex to access it afterwards. -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : class IntDiskIndex : public coll::ReadonlyCollection< IntDiskIndex > -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : { -<span class="lineNum"> 61 </span> : protected: -<span class="lineNum"> 62 </span> : diskindex::Int pkgidx; -<span class="lineNum"> 63 </span> : diskindex::Int tagidx; -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : public: -<span class="lineNum"> 66 </span> : class const_iterator -<span class="lineNum"> 67 </span> : { -<span class="lineNum"> 68 </span> : const IntDiskIndex& index; -<span class="lineNum"> 69 </span> : int idx; -<span class="lineNum"> 70 </span> : mutable std::pair< int, std::set<int> >* cached; -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : public: -<span class="lineNum"> 73 </span> : // Builds an iterator -<span class="lineNum"> 74 </span><span class="lineCov"> 8 : const_iterator(const IntDiskIndex& index, int idx)</span> -<span class="lineNum"> 75 </span><span class="lineCov"> 8 : : index(index), idx(idx), cached(0) {}</span> -<span class="lineNum"> 76 </span> : // Builds the end iterator -<span class="lineNum"> 77 </span><span class="lineCov"> 274893 : const_iterator(const IntDiskIndex& index)</span> -<span class="lineNum"> 78 </span><span class="lineCov"> 274893 : : index(index), idx(index.pkgidx.size()), cached(0) {}</span> -<span class="lineNum"> 79 </span><span class="lineCov"> 528661 : ~const_iterator() { if (cached) delete cached; }</span> -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span><span class="lineCov"> 105725 : std::pair< int, std::set<int> > operator*() const</span> -<span class="lineNum"> 82 </span> : { -<span class="lineNum"> 83 </span><span class="lineCov"> 105725 : return std::make_pair(idx, index.getTagsOfItem(idx));</span> -<span class="lineNum"> 84 </span> : } -<span class="lineNum"> 85 </span><span class="lineCov"> 42290 : std::pair< int, std::set<int> >* operator->() const</span> -<span class="lineNum"> 86 </span> : { -<span class="lineNum"> 87 </span><span class="lineCov"> 42290 : if (!cached)</span> -<span class="lineNum"> 88 </span><span class="lineCov"> 21145 : cached = new std::pair< int, std::set<int> >(operator*());</span> -<span class="lineNum"> 89 </span><span class="lineCov"> 42290 : return cached;</span> -<span class="lineNum"> 90 </span> : } -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span><span class="lineCov"> 105725 : const_iterator operator++()</span> -<span class="lineNum"> 93 </span> : { -<span class="lineNum"> 94 </span><span class="lineCov"> 105725 : ++idx;</span> -<span class="lineNum"> 95 </span><span class="lineCov"> 105725 : if (cached) { delete cached; cached = 0; }</span> -<span class="lineNum"> 96 </span><span class="lineCov"> 105725 : return *this;</span> -<span class="lineNum"> 97 </span> : } -<span class="lineNum"> 98 </span><span class="lineCov"> 169161 : bool operator==(const const_iterator& iter) const</span> -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span><span class="lineCov"> 169161 : return idx == iter.idx;</span> -<span class="lineNum"> 101 </span> : } -<span class="lineNum"> 102 </span><span class="lineCov"> 105732 : bool operator!=(const const_iterator& iter) const</span> -<span class="lineNum"> 103 </span> : { -<span class="lineNum"> 104 </span><span class="lineCov"> 105732 : return idx != iter.idx;</span> -<span class="lineNum"> 105 </span> : } -<span class="lineNum"> 106 </span> : }; -<span class="lineNum"> 107 </span><span class="lineCov"> 8 : const_iterator begin() const { return const_iterator(*this, 0); }</span> -<span class="lineNum"> 108 </span><span class="lineCov"> 274893 : const_iterator end() const { return const_iterator(*this); }</span> -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : /** -<span class="lineNum"> 111 </span> : * Create a new IntDiskIndex -<span class="lineNum"> 112 </span> : * -<span class="lineNum"> 113 </span> : * @param filename -<span class="lineNum"> 114 </span> : * The file name of the package index -<span class="lineNum"> 115 </span> : * @param tagidx -<span class="lineNum"> 116 </span> : * The file name of the tag index -<span class="lineNum"> 117 </span> : * @param fromitem, fromtag, toitem, totag -<span class="lineNum"> 118 </span> : * The Converter-s used to convert int and int to and from strings. -<span class="lineNum"> 119 </span> : * If 0 is passed, this TDBDiskIndex will only be able to work with -<span class="lineNum"> 120 </span> : * string items and string tags. -<span class="lineNum"> 121 </span> : * @param write -<span class="lineNum"> 122 </span> : * Set to false if the index should be opened in read-only mode. If -<span class="lineNum"> 123 </span> : * opened in read-only mode, all non-const methods of this class will -<span class="lineNum"> 124 </span> : * throw an exception if invoked. -<span class="lineNum"> 125 </span> : * It defaults to true. -<span class="lineNum"> 126 </span> : */ -<span class="lineNum"> 127 </span><span class="lineCov"> 10 : IntDiskIndex() {}</span> -<span class="lineNum"> 128 </span> : IntDiskIndex( -<span class="lineNum"> 129 </span> : const diskindex::MasterMMap& master, -<span class="lineNum"> 130 </span> : int pkgindex, int tagindex) -<span class="lineNum"> 131 </span> : : pkgidx(master, pkgindex), tagidx(master, tagindex) {} -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span><span class="lineCov"> 9 : void init(const diskindex::MasterMMap& master, int pkgindex, int tagindex)</span> -<span class="lineNum"> 134 </span> : { -<span class="lineNum"> 135 </span><span class="lineCov"> 9 : pkgidx.init(master, pkgindex);</span> -<span class="lineNum"> 136 </span><span class="lineCov"> 9 : tagidx.init(master, tagindex);</span> -<span class="lineNum"> 137 </span><span class="lineCov"> 9 : }</span> -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : std::set<int> getItemsHavingTag(const int& tag) const; -<span class="lineNum"> 140 </span> : std::set<int> getItemsHavingTags(const std::set<int>& tags) const; -<span class="lineNum"> 141 </span> : std::set<int> getTagsOfItem(const int& item) const; -<span class="lineNum"> 142 </span> : std::set<int> getTagsOfItems(const std::set<int>& items) const; -<span class="lineNum"> 143 </span> : -<span class="lineNum"> 144 </span> : bool hasTag(const int& tag) const -<span class="lineNum"> 145 </span> : { -<span class="lineNum"> 146 </span> : return tagidx.size(tag) > 0; -<span class="lineNum"> 147 </span> : } -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : std::set<int> getTaggedItems() const; -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span> : std::set<int> getAllTags() const; -<span class="lineNum"> 152 </span> : std::vector<int> getAllTagsAsVector() const; -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : unsigned int itemCount() const { return pkgidx.size(); } -<span class="lineNum"> 155 </span> : unsigned int tagCount() const { return tagidx.size(); } -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span><span class="lineNoCov"> 0 : unsigned int getCardinality(const int& tag) const</span> -<span class="lineNum"> 158 </span> : { -<span class="lineNum"> 159 </span><span class="lineNoCov"> 0 : return tagidx.size(tag);</span> -<span class="lineNum"> 160 </span> : } -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : std::set<int> getCompanionTags(const std::set<int>& tags) const; -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : //void output(Consumer<int, int>& consumer) const; -<span class="lineNum"> 165 </span> : }; -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : class IntDiskIndexer -<span class="lineNum"> 168 </span><span class="lineCov"> 2 : {</span> -<span class="lineNum"> 169 </span> : protected: -<span class="lineNum"> 170 </span> : diskindex::IntIndexer pkgidx; -<span class="lineNum"> 171 </span> : diskindex::IntIndexer tagidx; -<span class="lineNum"> 172 </span> : -<span class="lineNum"> 173 </span> : public: -<span class="lineNum"> 174 </span><span class="lineCov"> 1 : const diskindex::MMapIndexer& pkgIndexer() const { return pkgidx; }</span> -<span class="lineNum"> 175 </span><span class="lineCov"> 1 : const diskindex::MMapIndexer& tagIndexer() const { return tagidx; }</span> -<span class="lineNum"> 176 </span> : -<span class="lineNum"> 177 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 178 </span><span class="lineCov"> 21133 : void insert(const ITEMS& items, const TAGS& tags)</span> -<span class="lineNum"> 179 </span> : { -<span class="lineNum"> 180 </span><span class="lineCov"> 21133 : if (tags.empty())</span> -<span class="lineNum"> 181 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 182 </span><span class="lineCov"> 42266 : for (typename ITEMS::const_iterator it = items.begin();</span> -<span class="lineNum"> 183 </span> : it != items.end(); ++it) -<span class="lineNum"> 184 </span><span class="lineCov"> 126731 : for (typename TAGS::const_iterator ta = tags.begin();</span> -<span class="lineNum"> 185 </span> : ta != tags.end(); ++ta) -<span class="lineNum"> 186 </span> : { -<span class="lineNum"> 187 </span><span class="lineCov"> 105598 : pkgidx.map(*it, *ta);</span> -<span class="lineNum"> 188 </span><span class="lineCov"> 105598 : tagidx.map(*ta, *it);</span> -<span class="lineNum"> 189 </span> : } -<span class="lineNum"> 190 </span> : } -<span class="lineNum"> 191 </span> : }; -<span class="lineNum"> 192 </span> : -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : } -<span class="lineNum"> 195 </span> : } -<span class="lineNum"> 196 </span> : -<span class="lineNum"> 197 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 198 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h.gcov.html deleted file mode 100644 index 78a82c0..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h.gcov.html +++ /dev/null @@ -1,307 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/patched.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - patched.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">57</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">66.7 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">38</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_COLL_PATCHED_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_COLL_PATCHED_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Wrap a Collection, preserving modifications as patches -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 12 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 13 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 14 </span> : * (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 19 </span> : * GNU General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 22 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <tagcoll/coll/base.h> -<span class="lineNum"> 27 </span> : #include <tagcoll/patch.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : template<typename T1, typename T2> class PatchList; -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : namespace coll { -<span class="lineNum"> 33 </span> : template<typename ROCOLL> -<span class="lineNum"> 34 </span> : class Patched; -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : template<typename ROCOLL> -<span class="lineNum"> 37 </span> : struct coll_traits< Patched<ROCOLL> > -<span class="lineNum"> 38 </span> : { -<span class="lineNum"> 39 </span> : typedef typename coll_traits<ROCOLL>::item_type item_type; -<span class="lineNum"> 40 </span> : typedef typename coll_traits<ROCOLL>::tag_type tag_type; -<span class="lineNum"> 41 </span> : typedef typename coll_traits<ROCOLL>::tagset_type tagset_type; -<span class="lineNum"> 42 </span> : typedef typename coll_traits<ROCOLL>::itemset_type itemset_type; -<span class="lineNum"> 43 </span> : }; -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : /** -<span class="lineNum"> 46 </span> : * Wraps a collection by intercepting all changes to it and preserving them as -<span class="lineNum"> 47 </span> : * a PatchList. -<span class="lineNum"> 48 </span> : */ -<span class="lineNum"> 49 </span> : template<typename ROCOLL> -<span class="lineNum"> 50 </span> : class Patched : public coll::Collection< Patched<ROCOLL> > -<span class="lineNum"> 51 </span><span class="lineCov"> 10 : {</span> -<span class="lineNum"> 52 </span> : public: -<span class="lineNum"> 53 </span> : typedef tagcoll::Patch< -<span class="lineNum"> 54 </span> : typename coll_traits<ROCOLL>::item_type, -<span class="lineNum"> 55 </span> : typename coll_traits<ROCOLL>::tag_type> Patch; -<span class="lineNum"> 56 </span> : typedef tagcoll::PatchList< -<span class="lineNum"> 57 </span> : typename coll_traits<ROCOLL>::item_type, -<span class="lineNum"> 58 </span> : typename coll_traits<ROCOLL>::tag_type> Patches; -<span class="lineNum"> 59 </span> : typedef tagcoll::Patch< -<span class="lineNum"> 60 </span> : typename coll_traits<ROCOLL>::tag_type, -<span class="lineNum"> 61 </span> : typename coll_traits<ROCOLL>::item_type> RPatch; -<span class="lineNum"> 62 </span> : typedef tagcoll::PatchList< -<span class="lineNum"> 63 </span> : typename coll_traits<ROCOLL>::tag_type, -<span class="lineNum"> 64 </span> : typename coll_traits<ROCOLL>::item_type> RPatches; -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : protected: -<span class="lineNum"> 67 </span> : typedef typename coll_traits<ROCOLL>::item_type Item; -<span class="lineNum"> 68 </span> : typedef typename coll_traits<ROCOLL>::tag_type Tag; -<span class="lineNum"> 69 </span> : typedef typename coll_traits<ROCOLL>::itemset_type ItemSet; -<span class="lineNum"> 70 </span> : typedef typename coll_traits<ROCOLL>::tagset_type TagSet; -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : const ROCOLL& coll; -<span class="lineNum"> 73 </span> : Patches m_changes; -<span class="lineNum"> 74 </span> : RPatches m_rchanges; -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : #if 0 -<span class="lineNum"> 77 </span> : virtual void consumeItem(const ITEM& item, const std::set<TAG>& tags); -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : virtual std::set<ITEM> getItemsHavingTag(const TAG& tag) const; -<span class="lineNum"> 80 </span> : virtual std::set<TAG> getTagsOfItem(const ITEM& item) const; -<span class="lineNum"> 81 </span> : #endif -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : public: -<span class="lineNum"> 84 </span> : typedef std::pair<Item, TagSet> value_type; -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : class const_iterator -<span class="lineNum"> 87 </span> : { -<span class="lineNum"> 88 </span> : const Patched<ROCOLL>& coll; -<span class="lineNum"> 89 </span> : typename ROCOLL::const_iterator ci; -<span class="lineNum"> 90 </span> : typename Patches::const_iterator pi; -<span class="lineNum"> 91 </span> : mutable typename Patched<ROCOLL>::value_type* cached_val; -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : protected: -<span class="lineNum"> 94 </span> : const_iterator(const Patched<ROCOLL>& coll, -<span class="lineNum"> 95 </span> : const typename ROCOLL::const_iterator& ci, -<span class="lineNum"> 96 </span><span class="lineCov"> 84592 : const typename Patches::const_iterator& pi)</span> -<span class="lineNum"> 97 </span><span class="lineCov"> 84592 : : coll(coll), ci(ci), pi(pi), cached_val(0) {}</span> -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : public: -<span class="lineNum"> 100 </span><span class="lineCov"> 148035 : ~const_iterator()</span> -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span><span class="lineCov"> 148035 : if (cached_val)</span> -<span class="lineNum"> 103 </span><span class="lineNoCov"> 0 : delete cached_val;</span> -<span class="lineNum"> 104 </span><span class="lineCov"> 148035 : }</span> -<span class="lineNum"> 105 </span><span class="lineCov"> 84580 : const typename Patched<ROCOLL>::value_type operator*() const</span> -<span class="lineNum"> 106 </span> : { -<span class="lineNum"> 107 </span><span class="lineCov"> 84580 : if (cached_val)</span> -<span class="lineNum"> 108 </span><span class="lineNoCov"> 0 : return *cached_val;</span> -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span><span class="lineCov"> 84580 : if (ci == coll.coll.end() && pi == coll.m_changes.end())</span> -<span class="lineNum"> 111 </span><span class="lineNoCov"> 0 : return *(typename Patched<ROCOLL>::value_type*)0;</span> -<span class="lineNum"> 112 </span><span class="lineCov"> 84580 : else if (pi == coll.m_changes.end())</span> -<span class="lineNum"> 113 </span><span class="lineCov"> 84580 : return *ci;</span> -<span class="lineNum"> 114 </span><span class="lineNoCov"> 0 : else if (ci == coll.coll.end())</span> -<span class="lineNum"> 115 </span><span class="lineNoCov"> 0 : return make_pair(pi->first, pi->second.added);</span> -<span class="lineNum"> 116 </span><span class="lineNoCov"> 0 : else if (ci->first < pi->first)</span> -<span class="lineNum"> 117 </span><span class="lineNoCov"> 0 : return *ci;</span> -<span class="lineNum"> 118 </span><span class="lineNoCov"> 0 : else if (ci->first > pi->first)</span> -<span class="lineNum"> 119 </span><span class="lineNoCov"> 0 : return make_pair(pi->first, pi->second.added);</span> -<span class="lineNum"> 120 </span> : else -<span class="lineNum"> 121 </span><span class="lineNoCov"> 0 : return make_pair(ci->first, pi->second.apply(ci->second));</span> -<span class="lineNum"> 122 </span> : } -<span class="lineNum"> 123 </span><span class="lineCov"> 211450 : const typename Patched<ROCOLL>::value_type* operator->() const</span> -<span class="lineNum"> 124 </span> : { -<span class="lineNum"> 125 </span><span class="lineCov"> 211450 : if (cached_val)</span> -<span class="lineNum"> 126 </span><span class="lineCov"> 126870 : return cached_val;</span> -<span class="lineNum"> 127 </span><span class="lineCov"> 84580 : return cached_val = new typename Patched<ROCOLL>::value_type(*(*this));</span> -<span class="lineNum"> 128 </span> : } -<span class="lineNum"> 129 </span><span class="lineCov"> 84580 : const_iterator& operator++()</span> -<span class="lineNum"> 130 </span> : { -<span class="lineNum"> 131 </span><span class="lineCov"> 84580 : if (ci == coll.coll.end() && pi == coll.m_changes.end())</span> -<span class="lineNum"> 132 </span> : ; -<span class="lineNum"> 133 </span><span class="lineCov"> 84580 : else if (pi == coll.m_changes.end())</span> -<span class="lineNum"> 134 </span><span class="lineCov"> 84580 : ++ci;</span> -<span class="lineNum"> 135 </span><span class="lineNoCov"> 0 : else if (ci == coll.coll.end())</span> -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : ++pi;</span> -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : else if (ci->first < pi->first)</span> -<span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : ++ci;</span> -<span class="lineNum"> 139 </span><span class="lineNoCov"> 0 : else if (ci->first > pi->first)</span> -<span class="lineNum"> 140 </span><span class="lineNoCov"> 0 : ++pi;</span> -<span class="lineNum"> 141 </span> : else -<span class="lineNum"> 142 </span> : { -<span class="lineNum"> 143 </span><span class="lineNoCov"> 0 : ++ci;</span> -<span class="lineNum"> 144 </span><span class="lineNoCov"> 0 : ++pi;</span> -<span class="lineNum"> 145 </span> : } -<span class="lineNum"> 146 </span><span class="lineCov"> 84580 : if (cached_val)</span> -<span class="lineNum"> 147 </span> : { -<span class="lineNum"> 148 </span><span class="lineCov"> 84580 : delete cached_val;</span> -<span class="lineNum"> 149 </span><span class="lineCov"> 84580 : cached_val = 0;</span> -<span class="lineNum"> 150 </span> : } -<span class="lineNum"> 151 </span><span class="lineCov"> 84580 : return *this;</span> -<span class="lineNum"> 152 </span> : } -<span class="lineNum"> 153 </span><span class="lineCov"> 1 : bool operator==(const const_iterator& iter) const</span> -<span class="lineNum"> 154 </span> : { -<span class="lineNum"> 155 </span><span class="lineCov"> 1 : return ci == iter.ci && pi == iter.pi;</span> -<span class="lineNum"> 156 </span> : } -<span class="lineNum"> 157 </span><span class="lineCov"> 84585 : bool operator!=(const const_iterator& iter) const</span> -<span class="lineNum"> 158 </span> : { -<span class="lineNum"> 159 </span><span class="lineCov"> 84585 : return ci != iter.ci || pi != iter.pi;</span> -<span class="lineNum"> 160 </span> : } -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : friend class Patched<ROCOLL>; -<span class="lineNum"> 163 </span> : }; -<span class="lineNum"> 164 </span><span class="lineCov"> 6 : const_iterator begin() const { return const_iterator(*this, coll.begin(), m_changes.begin()); }</span> -<span class="lineNum"> 165 </span><span class="lineCov"> 84586 : const_iterator end() const { return const_iterator(*this, coll.end(), m_changes.end()); }</span> -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span><span class="lineCov"> 10 : Patched(const ROCOLL& coll) : coll(coll) {}</span> -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 170 </span> : void insert(const ITEMS& items, const TAGS& tags); -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : template<typename ITEMS> -<span class="lineNum"> 173 </span> : void insert(const ITEMS& items, const wibble::Empty<Tag>& tags) -<span class="lineNum"> 174 </span> : { -<span class="lineNum"> 175 </span> : // Nothing to do in this case -<span class="lineNum"> 176 </span> : } -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : /** -<span class="lineNum"> 179 </span> : * Removes all items from the collection -<span class="lineNum"> 180 </span> : */ -<span class="lineNum"> 181 </span> : void clear(); -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : /** -<span class="lineNum"> 184 </span> : * Get the changes that have been applied to this collection -<span class="lineNum"> 185 </span> : */ -<span class="lineNum"> 186 </span><span class="lineCov"> 4 : const Patches& changes() const { return m_changes; }</span> -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /** -<span class="lineNum"> 189 </span> : * Throw away all changes previously applied to this collection -<span class="lineNum"> 190 </span> : */ -<span class="lineNum"> 191 </span> : void resetChanges() { m_changes.clear(); m_rchanges.clear(); } -<span class="lineNum"> 192 </span> : -<span class="lineNum"> 193 </span> : /** -<span class="lineNum"> 194 </span> : * Set the changes list to a specific patch list -<span class="lineNum"> 195 </span> : */ -<span class="lineNum"> 196 </span><span class="lineNoCov"> 0 : void setChanges(const Patches& changes);</span> -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : /** -<span class="lineNum"> 199 </span> : * Add a specific patch list to the changes list -<span class="lineNum"> 200 </span> : */ -<span class="lineNum"> 201 </span><span class="lineCov"> 2 : void addChanges(const Patches& changes);</span> -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : bool hasTag(const Tag& tag) const; -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span><span class="lineCov"> 5 : TagSet getTagsOfItem(const Item& item) const</span> -<span class="lineNum"> 206 </span> : { -<span class="lineNum"> 207 </span><span class="lineCov"> 5 : return m_changes.patch(item, coll.getTagsOfItem(item));</span> -<span class="lineNum"> 208 </span> : } -<span class="lineNum"> 209 </span><span class="lineCov"> 9 : ItemSet getItemsHavingTag(const typename coll_traits<ROCOLL>::tag_type& tag) const</span> -<span class="lineNum"> 210 </span> : { -<span class="lineNum"> 211 </span><span class="lineCov"> 9 : return m_rchanges.patch(tag, coll.getItemsHavingTag(tag));</span> -<span class="lineNum"> 212 </span> : } -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : ItemSet getTaggedItems() const; -<span class="lineNum"> 215 </span><span class="lineCov"> 1 : TagSet getAllTags() const;</span> -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : unsigned int tagCount() const { return getAllTags().size(); } -<span class="lineNum"> 218 </span> : -<span class="lineNum"> 219 </span> : unsigned int getCardinality(const Tag& tag) const; -<span class="lineNum"> 220 </span> : -<span class="lineNum"> 221 </span><span class="lineCov"> 2 : void applyChange(const Patches& change) { this->addChanges(change); }</span> -<span class="lineNum"> 222 </span> : -<span class="lineNum"> 223 </span> : #if 0 -<span class="lineNum"> 224 </span> : template<typename OUT> -<span class="lineNum"> 225 </span> : void output(OUT out) const -<span class="lineNum"> 226 </span> : { -<span class="lineNum"> 227 </span> : for (const_iterator i = begin(); i != end(); ++i) -<span class="lineNum"> 228 </span> : { -<span class="lineNum"> 229 </span> : *out = *i; -<span class="lineNum"> 230 </span> : ++out; -<span class="lineNum"> 231 </span> : } -<span class="lineNum"> 232 </span> : } -<span class="lineNum"> 233 </span> : #endif -<span class="lineNum"> 234 </span> : }; -<span class="lineNum"> 235 </span> : -<span class="lineNum"> 236 </span> : } -<span class="lineNum"> 237 </span> : } -<span class="lineNum"> 238 </span> : -<span class="lineNum"> 239 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 240 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc.gcov.html deleted file mode 100644 index d6a3fec..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc.gcov.html +++ /dev/null @@ -1,274 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/patched.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - patched.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">22</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">59.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">13</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /* -<span class="lineNum"> 2 </span> : * Wrap a Collection, preserving modifications as patches -<span class="lineNum"> 3 </span> : * -<span class="lineNum"> 4 </span> : * Copyright (C) 2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 7 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 8 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 9 </span> : * (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : * GNU General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 17 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef TAGCOLL_COLL_PATCHED_TCC -<span class="lineNum"> 22 </span> : #define TAGCOLL_COLL_PATCHED_TCC -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <tagcoll/coll/patched.h> -<span class="lineNum"> 25 </span> : #include <tagcoll/utils/set.h> -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <wibble/operators.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : using namespace std; -<span class="lineNum"> 30 </span> : using namespace wibble::operators; -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : namespace tagcoll { -<span class="lineNum"> 33 </span> : namespace coll { -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : template<typename ROCOLL> template<typename ITEMS, typename TAGS> -<span class="lineNum"> 36 </span> : void Patched<ROCOLL>::insert(const ITEMS& items, const TAGS& tags) -<span class="lineNum"> 37 </span> : { -<span class="lineNum"> 38 </span> : Patches changes; -<span class="lineNum"> 39 </span> : for (typename ITEMS::const_iterator i = items.begin(); -<span class="lineNum"> 40 </span> : i != items.end(); ++i) -<span class="lineNum"> 41 </span> : changes.addPatch(Patch(*i, tags, TagSet())); -<span class="lineNum"> 42 </span> : addChanges(changes); -<span class="lineNum"> 43 </span> : } -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : template<typename ROCOLL> -<span class="lineNum"> 47 </span> : void Patched<ROCOLL>::clear() -<span class="lineNum"> 48 </span> : { -<span class="lineNum"> 49 </span> : // Remove all patches -<span class="lineNum"> 50 </span> : m_changes.clear(); -<span class="lineNum"> 51 </span> : m_rchanges.clear(); -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : // Add all tagsets of the underlying collection as removed tags in the patch -<span class="lineNum"> 54 </span> : for (typename ROCOLL::const_iterator i = coll.begin(); -<span class="lineNum"> 55 </span> : i != coll.end(); ++i) -<span class="lineNum"> 56 </span> : { -<span class="lineNum"> 57 </span> : m_changes.addPatch(Patch(i->first, std::set<Tag>(), i->second)); -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : for (typename TagSet::const_iterator j = i->second.begin(); -<span class="lineNum"> 60 </span> : j != i->second.end(); ++j) -<span class="lineNum"> 61 </span> : m_rchanges.addPatch(Patch(*j, wibble::Empty<Tag>(), wibble::singleton(i->first))); -<span class="lineNum"> 62 </span> : } -<span class="lineNum"> 63 </span> : } -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : template<typename ROCOLL> -<span class="lineNum"> 66 </span> : void Patched<ROCOLL>::setChanges(const Patches& changes) -<span class="lineNum"> 67 </span> : { -<span class="lineNum"> 68 </span><span class="lineNoCov"> 0 : this->m_changes.clear();</span> -<span class="lineNum"> 69 </span><span class="lineNoCov"> 0 : this->m_rchanges.clear();</span> -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span><span class="lineNoCov"> 0 : addChanges(changes);</span> -<span class="lineNum"> 72 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : template<typename ROCOLL> -<span class="lineNum"> 75 </span> : void Patched<ROCOLL>::addChanges(const Patches& changes) -<span class="lineNum"> 76 </span> : { -<span class="lineNum"> 77 </span> : // Simplify the patch against the contents of `coll' before adding it. -<span class="lineNum"> 78 </span><span class="lineCov"> 4 : for (typename Patches::const_iterator i = changes.begin(); i != changes.end(); ++i)</span> -<span class="lineNum"> 79 </span> : // Consider only valid items -<span class="lineNum"> 80 </span><span class="lineCov"> 2 : if (i->first != Item())</span> -<span class="lineNum"> 81 </span> : { -<span class="lineNum"> 82 </span> : // Merge with existing patches -<span class="lineNum"> 83 </span><span class="lineCov"> 2 : this->m_changes.addPatch(i->second);</span> -<span class="lineNum"> 84 </span> : // Simplify the result -<span class="lineNum"> 85 </span><span class="lineCov"> 2 : this->m_changes.removeRedundant(i->first, coll.getTagsOfItem(i->first));</span> -<span class="lineNum"> 86 </span> : } -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span><span class="lineCov"> 2 : RPatches rchanges;</span> -<span class="lineNum"> 89 </span><span class="lineCov"> 2 : rchanges.addPatchInverted(changes);</span> -<span class="lineNum"> 90 </span><span class="lineCov"> 4 : for (typename RPatches::const_iterator i = rchanges.begin(); i != rchanges.end(); ++i)</span> -<span class="lineNum"> 91 </span> : // Consider only valid tags -<span class="lineNum"> 92 </span><span class="lineCov"> 2 : if (i->first != Tag())</span> -<span class="lineNum"> 93 </span> : { -<span class="lineNum"> 94 </span> : // Merge with existing patches -<span class="lineNum"> 95 </span><span class="lineCov"> 2 : this->m_rchanges.addPatch(i->second);</span> -<span class="lineNum"> 96 </span> : // Simplify the result -<span class="lineNum"> 97 </span><span class="lineCov"> 4 : this->m_rchanges.removeRedundant(i->first, coll.getItemsHavingTag(i->first));</span> -<span class="lineNum"> 98 </span> : } -<span class="lineNum"> 99 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : template<typename ROCOLL> -<span class="lineNum"> 102 </span> : bool Patched<ROCOLL>::hasTag(const Tag& tag) const -<span class="lineNum"> 103 </span> : { -<span class="lineNum"> 104 </span> : typename RPatches::const_iterator i = m_rchanges.find(tag); -<span class="lineNum"> 105 </span> : if (i == m_rchanges.end()) -<span class="lineNum"> 106 </span> : return coll.hasTag(tag); -<span class="lineNum"> 107 </span> : if (! i->second.added.empty()) -<span class="lineNum"> 108 </span> : return true; -<span class="lineNum"> 109 </span> : return !this->getItemsHavingTag(tag).empty(); -<span class="lineNum"> 110 </span> : } -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : template<typename ROCOLL> -<span class="lineNum"> 113 </span> : typename coll_traits<ROCOLL>::itemset_type Patched<ROCOLL>::getTaggedItems() const -<span class="lineNum"> 114 </span> : { -<span class="lineNum"> 115 </span> : ItemSet res(coll.getTaggedItems()); -<span class="lineNum"> 116 </span> : for (typename Patches::const_iterator i = m_changes.begin(); -<span class="lineNum"> 117 </span> : i != m_changes.end(); ++i) -<span class="lineNum"> 118 </span> : if (!i->second.added.empty()) -<span class="lineNum"> 119 </span> : // Add packages for which tags are added -<span class="lineNum"> 120 </span> : res |= i->first; -<span class="lineNum"> 121 </span> : else if (getTagsOfItem(i->first).empty()) -<span class="lineNum"> 122 </span> : // Remove the packages to which the patch removes all tags -<span class="lineNum"> 123 </span> : res -= i->first; -<span class="lineNum"> 124 </span> : return res; -<span class="lineNum"> 125 </span> : } -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : template<typename ROCOLL> -<span class="lineNum"> 128 </span> : typename coll_traits<ROCOLL>::tagset_type Patched<ROCOLL>::getAllTags() const -<span class="lineNum"> 129 </span> : { -<span class="lineNum"> 130 </span><span class="lineCov"> 1 : TagSet res(coll.getAllTags());</span> -<span class="lineNum"> 131 </span><span class="lineCov"> 1 : for (typename RPatches::const_iterator i = m_rchanges.begin();</span> -<span class="lineNum"> 132 </span> : i != m_rchanges.end(); ++i) -<span class="lineNum"> 133 </span><span class="lineNoCov"> 0 : if (!i->second.added.empty())</span> -<span class="lineNum"> 134 </span> : // Add tags for which packages are added -<span class="lineNum"> 135 </span><span class="lineNoCov"> 0 : res |= i->first;</span> -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : else if (coll.getCardinality(i->first) - i->second.removed.size() <= 0)</span> -<span class="lineNum"> 137 </span> : // Remove the tags to which the patch removes all items -<span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : res -= i->first;</span> -<span class="lineNum"> 139 </span><span class="lineNoCov"> 0 : return res;</span> -<span class="lineNum"> 140 </span> : } -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : #if 0 -<span class="lineNum"> 143 </span> : template<typename ITEM, typename TAG, typename OUT> -<span class="lineNum"> 144 </span> : class UnpatchedOnly : public wibble::mixin::OutputIterator< UnpatchedOnly<ITEM, TAG, OUT> > -<span class="lineNum"> 145 </span> : { -<span class="lineNum"> 146 </span> : protected: -<span class="lineNum"> 147 </span> : OUT out; -<span class="lineNum"> 148 </span> : const PatchList<ITEM, TAG>& changes; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : public: -<span class="lineNum"> 151 </span> : UnpatchedOnly(const PatchList<ITEM, TAG>& changes, const OUT& out) : out(out), changes(changes) {} -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : UnpatchedOnly<ITEM, TAG, OUT>& operator++() { return *this; } -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : template<typename Items, typename Tags> -<span class="lineNum"> 156 </span> : UnpatchedOnly<ITEM, TAG, OUT>& operator=(const std::pair<Items, Tags>& data) -<span class="lineNum"> 157 </span> : { -<span class="lineNum"> 158 </span> : for (typename Items::const_iterator i = data.first.begin(); -<span class="lineNum"> 159 </span> : i != data.first.end(); ++i) -<span class="lineNum"> 160 </span> : if (changes.find(*i) == changes.end()) -<span class="lineNum"> 161 </span> : { -<span class="lineNum"> 162 </span> : *out = data; -<span class="lineNum"> 163 </span> : ++out; -<span class="lineNum"> 164 </span> : } -<span class="lineNum"> 165 </span> : return *this; -<span class="lineNum"> 166 </span> : } -<span class="lineNum"> 167 </span> : }; -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : template<typename ITEM, typename TAG, typename OUT> -<span class="lineNum"> 170 </span> : UnpatchedOnly<ITEM, TAG, OUT> unpatchedOnly(const PatchList<ITEM, TAG>& changes, const OUT& out) -<span class="lineNum"> 171 </span> : { -<span class="lineNum"> 172 </span> : return UnpatchedOnly<ITEM, TAG, OUT>(changes, out); -<span class="lineNum"> 173 </span> : } -<span class="lineNum"> 174 </span> : -<span class="lineNum"> 175 </span> : template<class ITEM, class TAG> -<span class="lineNum"> 176 </span> : void Patched<ITEM, TAG>::output(Consumer<ITEM, TAG>& cons) const -<span class="lineNum"> 177 </span> : { -<span class="lineNum"> 178 </span> : // First, only pass the unpatched items -<span class="lineNum"> 179 </span> : coll.outputToIterator(unpatchedOnly(changes, consumer(cons))); -<span class="lineNum"> 180 </span> : -<span class="lineNum"> 181 </span> : // Then output the items in the patch -<span class="lineNum"> 182 </span> : for (typename PatchList<ITEM, TAG>::const_iterator i = changes.begin(); -<span class="lineNum"> 183 </span> : i != changes.end(); i++) -<span class="lineNum"> 184 </span> : cons.consume(i->first, -<span class="lineNum"> 185 </span> : changes.patch(i->first, coll.getTags(i->first))); -<span class="lineNum"> 186 </span> : } -<span class="lineNum"> 187 </span> : #endif -<span class="lineNum"> 188 </span> : -<span class="lineNum"> 189 </span> : template<typename ROCOLL> -<span class="lineNum"> 190 </span> : unsigned int Patched<ROCOLL>::getCardinality(const Tag& tag) const -<span class="lineNum"> 191 </span> : { -<span class="lineNum"> 192 </span> : typename RPatches::const_iterator i = m_rchanges.find(tag); -<span class="lineNum"> 193 </span> : if (i == m_rchanges.end()) -<span class="lineNum"> 194 </span> : return coll.getCardinality(tag); -<span class="lineNum"> 195 </span> : else -<span class="lineNum"> 196 </span> : return coll.getCardinality(tag) + i->second.added.size() - i->second.removed.size(); -<span class="lineNum"> 197 </span> : } -<span class="lineNum"> 198 </span> : -<span class="lineNum"> 199 </span> : } -<span class="lineNum"> 200 </span> : } -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : #include <tagcoll/coll/base.tcc> -<span class="lineNum"> 203 </span> : #include <tagcoll/patch.tcc> -<span class="lineNum"> 204 </span> : -<span class="lineNum"> 205 </span> : #endif -<span class="lineNum"> 206 </span> : -<span class="lineNum"> 207 </span> : // vim:set ts=4 sw=4: -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h.gcov.html deleted file mode 100644 index 3ffdd0c..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h.gcov.html +++ /dev/null @@ -1,205 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/simple.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - simple.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">14</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">14</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_COLL_SIMPLE_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_COLL_SIMPLE_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Simple tagged collection. -<span class="lineNum"> 6 </span> : * -<span class="lineNum"> 7 </span> : * Also used for merging tags of items appearing multiple times in a stream of -<span class="lineNum"> 8 </span> : * tagged items -<span class="lineNum"> 9 </span> : */ -<span class="lineNum"> 10 </span> : -<span class="lineNum"> 11 </span> : /* -<span class="lineNum"> 12 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 13 </span> : * -<span class="lineNum"> 14 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 15 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 16 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 17 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 18 </span> : * -<span class="lineNum"> 19 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 20 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 21 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 22 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 23 </span> : * -<span class="lineNum"> 24 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 25 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 26 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 27 </span> : */ -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : #include <tagcoll/coll/base.h> -<span class="lineNum"> 30 </span> : #include <set> -<span class="lineNum"> 31 </span> : #include <map> -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : namespace tagcoll { -<span class="lineNum"> 34 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 35 </span> : class PatchList; -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : namespace coll { -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 40 </span> : class Simple; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 43 </span> : struct coll_traits< Simple<ITEM, TAG> > -<span class="lineNum"> 44 </span> : { -<span class="lineNum"> 45 </span> : typedef ITEM item_type; -<span class="lineNum"> 46 </span> : typedef TAG tag_type; -<span class="lineNum"> 47 </span> : typedef std::set<ITEM> tagset_type; -<span class="lineNum"> 48 </span> : typedef std::set<TAG> itemset_type; -<span class="lineNum"> 49 </span> : }; -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : /** -<span class="lineNum"> 53 </span> : * Simple Collection. -<span class="lineNum"> 54 </span> : * -<span class="lineNum"> 55 </span> : * It can be used to merge input values: if an item is added multiple times, -<span class="lineNum"> 56 </span> : * its various tagsets are merged in a single one. -<span class="lineNum"> 57 </span> : * -<span class="lineNum"> 58 </span> : * It is also a full-featured collection, although not very optimized. -<span class="lineNum"> 59 </span> : */ -<span class="lineNum"> 60 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 61 </span> : class Simple : public coll::Collection< Simple<ITEM, TAG> > -<span class="lineNum"> 62 </span><span class="lineCov"> 14 : {</span> -<span class="lineNum"> 63 </span> : protected: -<span class="lineNum"> 64 </span> : std::map< ITEM, std::set<TAG> > coll; -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : #if 0 -<span class="lineNum"> 67 </span> : virtual void consumeItem(const ITEM& item, const std::set<TAG>& tags); -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : virtual std::set<ITEM> getItemsHavingTags(const std::set<TAG>& tags) const; -<span class="lineNum"> 70 </span> : #endif -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : public: -<span class="lineNum"> 73 </span> : typedef typename std::map< ITEM, std::set<TAG> >::const_iterator const_iterator; -<span class="lineNum"> 74 </span> : typedef typename std::map< ITEM, std::set<TAG> >::iterator iterator; -<span class="lineNum"> 75 </span> : typedef typename std::map< ITEM, std::set<TAG> >::value_type value_type; -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span><span class="lineCov"> 5 : const_iterator begin() const { return coll.begin(); }</span> -<span class="lineNum"> 78 </span><span class="lineCov"> 42298 : const_iterator end() const { return coll.end(); }</span> -<span class="lineNum"> 79 </span><span class="lineCov"> 1 : iterator begin() { return coll.begin(); }</span> -<span class="lineNum"> 80 </span><span class="lineCov"> 21146 : iterator end() { return coll.end(); }</span> -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span><span class="lineCov"> 2 : bool empty() const { return coll.empty(); }</span> -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 85 </span><span class="lineCov"> 2 : void insert(const ITEMS& items, const TAGS& tags);</span> -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : bool hasItem(const ITEM& item) const { return coll.find(item) != coll.end(); } -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span><span class="lineCov"> 2 : std::set<TAG> getTagsOfItem(const ITEM& item) const;</span> -<span class="lineNum"> 90 </span> : std::set<ITEM> getItemsHavingTag(const TAG& tag) const; -<span class="lineNum"> 91 </span> : template<typename TAGS> -<span class="lineNum"> 92 </span> : std::set<ITEM> getItemsHavingTags(const TAGS& tag) const; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : template<typename TAGS, typename OUT> -<span class="lineNum"> 95 </span> : void outputHavingTags(const TAGS& tags, OUT out) const; -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : #if 0 -<span class="lineNum"> 98 </span> : void output(Consumer<ITEM, TAG>& consumer) const; -<span class="lineNum"> 99 </span> : void outputHavingTags(const std::set<TAG>& ts, Consumer<ITEM, TAG>& consumer) const; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : /** -<span class="lineNum"> 102 </span> : * Send the merged data to a consumer, but reversed: the tag become items, -<span class="lineNum"> 103 </span> : * and they are tagged with the items that had them -<span class="lineNum"> 104 </span> : */ -<span class="lineNum"> 105 </span> : void outputReversed(Consumer<TAG, ITEM>& consumer) const; -<span class="lineNum"> 106 </span> : #endif -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : void applyChange(const PatchList<ITEM, TAG>& change); -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : std::set<ITEM> getTaggedItems() const; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span><span class="lineCov"> 3 : std::set<TAG> getAllTags() const;</span> -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : std::set<TAG> getCompanionTags(const std::set<TAG>& ts) const; -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : std::set<ITEM> getRelatedItems(const std::set<TAG>& ts, int maxdistance = 1) const; -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : /** -<span class="lineNum"> 119 </span> : * Count the number of items -<span class="lineNum"> 120 </span> : */ -<span class="lineNum"> 121 </span><span class="lineCov"> 5 : unsigned int itemCount() const;</span> -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span><span class="lineCov"> 3 : unsigned int tagCount() const { return getAllTags().size(); }</span> -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : /** -<span class="lineNum"> 126 </span> : * Empty the collection -<span class="lineNum"> 127 </span> : */ -<span class="lineNum"> 128 </span><span class="lineCov"> 1 : void clear()</span> -<span class="lineNum"> 129 </span> : { -<span class="lineNum"> 130 </span><span class="lineCov"> 1 : coll.clear();</span> -<span class="lineNum"> 131 </span><span class="lineCov"> 1 : }</span> -<span class="lineNum"> 132 </span> : }; -<span class="lineNum"> 133 </span> : -<span class="lineNum"> 134 </span> : } -<span class="lineNum"> 135 </span> : } -<span class="lineNum"> 136 </span> : -<span class="lineNum"> 137 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 138 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc.gcov.html deleted file mode 100644 index ae0c51f..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc.gcov.html +++ /dev/null @@ -1,263 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/coll/simple.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/coll</a> - simple.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">17</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">82.4 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">14</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /* -<span class="lineNum"> 2 </span> : * Merge tags of items appearing multiple times in a stream of tagged items -<span class="lineNum"> 3 </span> : * -<span class="lineNum"> 4 </span> : * Copyright (C) 2003--2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 7 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 8 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 9 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 14 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 17 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef TAGCOLL_COLL_SIMPLE_TCC -<span class="lineNum"> 22 </span> : #define TAGCOLL_COLL_SIMPLE_TCC -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <tagcoll/utils/set.h> -<span class="lineNum"> 25 </span> : #include <tagcoll/coll/simple.h> -<span class="lineNum"> 26 </span> : #include <tagcoll/patch.h> -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : #include <wibble/operators.h> -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : using namespace std; -<span class="lineNum"> 31 </span> : using namespace wibble::operators; -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : namespace tagcoll { -<span class="lineNum"> 34 </span> : namespace coll { -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : template<class ITEM, class TAG> template<typename ITEMS, typename TAGS> -<span class="lineNum"> 38 </span><span class="lineCov"> 42293 : void Simple<ITEM, TAG>::insert(const ITEMS& items, const TAGS& tags)</span> -<span class="lineNum"> 39 </span> : { -<span class="lineNum"> 40 </span> : using namespace wibble::operators; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span><span class="lineCov"> 42295 : if (tags.empty())</span> -<span class="lineNum"> 43 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 44 </span><span class="lineCov"> 84590 : for (typename ITEMS::const_iterator i = items.begin();</span> -<span class="lineNum"> 45 </span> : i != items.end(); ++i) -<span class="lineNum"> 46 </span> : { -<span class="lineNum"> 47 </span><span class="lineCov"> 42295 : typename std::map< ITEM, std::set<TAG> >::iterator iter = coll.find(*i);</span> -<span class="lineNum"> 48 </span><span class="lineCov"> 42295 : if (iter == coll.end())</span> -<span class="lineNum"> 49 </span><span class="lineCov"> 21149 : coll.insert(std::make_pair(*i, std::set<TAG>() | tags));</span> -<span class="lineNum"> 50 </span> : else -<span class="lineNum"> 51 </span><span class="lineCov"> 21146 : iter->second |= tags;</span> -<span class="lineNum"> 52 </span> : } -<span class="lineNum"> 53 </span> : } -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : template<class ITEM, class TAG> -<span class="lineNum"> 56 </span> : std::set<TAG> Simple<ITEM, TAG>::getTagsOfItem(const ITEM& item) const -<span class="lineNum"> 57 </span> : { -<span class="lineNum"> 58 </span><span class="lineCov"> 2 : typename map< ITEM, std::set<TAG> >::const_iterator i = coll.find(item);</span> -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span><span class="lineCov"> 2 : if (i == coll.end())</span> -<span class="lineNum"> 61 </span><span class="lineNoCov"> 0 : return std::set<TAG>();</span> -<span class="lineNum"> 62 </span> : else -<span class="lineNum"> 63 </span><span class="lineCov"> 2 : return i->second;</span> -<span class="lineNum"> 64 </span> : } -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : template<class ITEM, class TAG> -<span class="lineNum"> 67 </span> : std::set<ITEM> Simple<ITEM, TAG>::getItemsHavingTag(const TAG& tag) const -<span class="lineNum"> 68 </span> : { -<span class="lineNum"> 69 </span> : std::set<ITEM> res; -<span class="lineNum"> 70 </span> : for (typename map< ITEM, std::set<TAG> >::const_iterator i = coll.begin(); -<span class="lineNum"> 71 </span> : i != coll.end(); i++) -<span class="lineNum"> 72 </span> : if (i->second.find(tag) != i->second.end()) -<span class="lineNum"> 73 </span> : res |= i->first; -<span class="lineNum"> 74 </span> : return res; -<span class="lineNum"> 75 </span> : } -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : template<class ITEM, class TAG> template<typename TAGS> -<span class="lineNum"> 78 </span> : std::set<ITEM> Simple<ITEM, TAG>::getItemsHavingTags(const TAGS& tags) const -<span class="lineNum"> 79 </span> : { -<span class="lineNum"> 80 </span> : std::set<ITEM> res; -<span class="lineNum"> 81 </span> : for (typename map< ITEM, std::set<TAG> >::const_iterator i = coll.begin(); -<span class="lineNum"> 82 </span> : i != coll.end(); i++) -<span class="lineNum"> 83 </span> : if (utils::set_contains(i->second, tags)) -<span class="lineNum"> 84 </span> : res |= i->first; -<span class="lineNum"> 85 </span> : return res; -<span class="lineNum"> 86 </span> : } -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : #if 0 -<span class="lineNum"> 89 </span> : template<class T, class Tag> -<span class="lineNum"> 90 </span> : void Simple<T, Tag>::outputReversed(Consumer<Tag, T>& consumer) const -<span class="lineNum"> 91 </span> : { -<span class="lineNum"> 92 </span> : for (typename map< T, std::set<Tag> >::const_iterator i = coll.begin(); -<span class="lineNum"> 93 </span> : i != coll.end(); i++) -<span class="lineNum"> 94 </span> : { -<span class="lineNum"> 95 </span> : std::set<T> items; -<span class="lineNum"> 96 </span> : items |= i->first; -<span class="lineNum"> 97 </span> : consumer.consume(i->second, items); -<span class="lineNum"> 98 </span> : } -<span class="lineNum"> 99 </span> : } -<span class="lineNum"> 100 </span> : #endif -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : template<class ITEM, class TAG> template<typename TAGS, typename OUT> -<span class="lineNum"> 103 </span> : void Simple<ITEM, TAG>::outputHavingTags(const TAGS& ts, OUT out) const -<span class="lineNum"> 104 </span> : { -<span class="lineNum"> 105 </span> : for (typename map< ITEM, std::set<TAG> >::const_iterator i = coll.begin(); -<span class="lineNum"> 106 </span> : i != coll.end(); ++i) -<span class="lineNum"> 107 </span> : if (utils::set_contains(i->second, ts)) -<span class="lineNum"> 108 </span> : { -<span class="lineNum"> 109 </span> : *out = *i; -<span class="lineNum"> 110 </span> : ++out; -<span class="lineNum"> 111 </span> : } -<span class="lineNum"> 112 </span> : } -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : template<class T, class Tag> -<span class="lineNum"> 117 </span> : void Simple<T, Tag>::applyChange(const PatchList<T, Tag>& change) -<span class="lineNum"> 118 </span> : { -<span class="lineNum"> 119 </span> : for (typename PatchList<T, Tag>::const_iterator i = change.begin(); i != change.end(); i++) -<span class="lineNum"> 120 </span> : { -<span class="lineNum"> 121 </span> : typename map< T, std::set<Tag> >::iterator it = coll.find(i->first); -<span class="lineNum"> 122 </span> : if (it == coll.end()) -<span class="lineNum"> 123 </span> : { -<span class="lineNum"> 124 </span> : // If the item doesn't exist, create it -<span class="lineNum"> 125 </span> : coll.insert(make_pair(i->first, i->second.added)); -<span class="lineNum"> 126 </span> : } else { -<span class="lineNum"> 127 </span> : it->second = i->second.apply(it->second); -<span class="lineNum"> 128 </span> : } -<span class="lineNum"> 129 </span> : } -<span class="lineNum"> 130 </span> : } -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 133 </span> : std::set<ITEM> Simple<ITEM, TAG>::getTaggedItems() const -<span class="lineNum"> 134 </span> : { -<span class="lineNum"> 135 </span> : std::set<ITEM> res; -<span class="lineNum"> 136 </span> : for (typename std::map< ITEM, std::set<TAG> >::const_iterator i = coll.begin(); -<span class="lineNum"> 137 </span> : i != coll.end(); i++) -<span class="lineNum"> 138 </span> : res.insert(i->first); -<span class="lineNum"> 139 </span> : return res; -<span class="lineNum"> 140 </span> : } -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : template<class T, class Tag> -<span class="lineNum"> 143 </span> : std::set<Tag> Simple<T, Tag>::getAllTags() const -<span class="lineNum"> 144 </span> : { -<span class="lineNum"> 145 </span><span class="lineCov"> 3 : std::set<Tag> tags;</span> -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span><span class="lineCov"> 6 : for (typename map< T, std::set<Tag> >::const_iterator i = coll.begin();</span> -<span class="lineNum"> 148 </span> : i != coll.end(); i++) -<span class="lineNum"> 149 </span><span class="lineCov"> 3 : tags |= i->second;</span> -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span><span class="lineNoCov"> 0 : return tags;</span> -<span class="lineNum"> 152 </span> : } -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : template<class T, class Tag> -<span class="lineNum"> 155 </span> : std::set<Tag> Simple<T, Tag>::getCompanionTags(const std::set<Tag>& ts) const -<span class="lineNum"> 156 </span> : { -<span class="lineNum"> 157 </span> : std::set<Tag> tags; -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : for (typename map< T, std::set<Tag> >::const_iterator i = coll.begin(); -<span class="lineNum"> 160 </span> : i != coll.end(); i++) -<span class="lineNum"> 161 </span> : if (utils::set_contains(i->second, (ts))) -<span class="lineNum"> 162 </span> : tags |= i->second - ts; -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : return tags; -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : template<class T, class Tag> -<span class="lineNum"> 168 </span> : std::set<T> Simple<T, Tag>::getRelatedItems(const std::set<Tag>& tags, int maxdistance) const -<span class="lineNum"> 169 </span> : { -<span class="lineNum"> 170 </span> : std::set<T> res; -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : for (typename map< T, std::set<Tag> >::const_iterator i = coll.begin(); -<span class="lineNum"> 173 </span> : i != coll.end(); i++) -<span class="lineNum"> 174 </span> : { -<span class="lineNum"> 175 </span> : int dist = utils::set_distance(tags, i->second); -<span class="lineNum"> 176 </span> : if (dist >= 0 && dist <= maxdistance) -<span class="lineNum"> 177 </span> : res |= i->first; -<span class="lineNum"> 178 </span> : } -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : return res; -<span class="lineNum"> 181 </span> : } -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : template<class T, class Tag> -<span class="lineNum"> 184 </span> : unsigned int Simple<T, Tag>::itemCount() const -<span class="lineNum"> 185 </span> : { -<span class="lineNum"> 186 </span><span class="lineCov"> 5 : return coll.size();</span> -<span class="lineNum"> 187 </span> : } -<span class="lineNum"> 188 </span> : -<span class="lineNum"> 189 </span> : } -<span class="lineNum"> 190 </span> : } -<span class="lineNum"> 191 </span> : -<span class="lineNum"> 192 </span> : #include <tagcoll/coll/base.tcc> -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : #endif -<span class="lineNum"> 195 </span> : -<span class="lineNum"> 196 </span> : // vim:set ts=4 sw=4: -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html deleted file mode 100644 index b47f674..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/index.html +++ /dev/null @@ -1,92 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/diskindex</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/diskindex</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">15</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">93.3 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">14</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="int.h.gcov.html">int.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=91 height=10 alt="90.9%"><img src="../../../../../snow.png" width=9 height=10 alt="90.9%"></td></tr></table> - </td> - <td class="coverPerHi">90.9 %</td> - <td class="coverNumHi">10 / 11 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="mmap.h.gcov.html">mmap.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">4 / 4 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h.gcov.html deleted file mode 100644 index 757c384..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h.gcov.html +++ /dev/null @@ -1,158 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/diskindex/int.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/diskindex</a> - int.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">90.9 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_DISKINDEX_INT_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_DISKINDEX_INT_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Fast index for tag data, based on integer indexes -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 12 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 13 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 14 </span> : * (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 19 </span> : * GNU General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 22 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <tagcoll/diskindex/mmap.h> -<span class="lineNum"> 27 </span> : #include <vector> -<span class="lineNum"> 28 </span> : #include <set> -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : namespace tagcoll { -<span class="lineNum"> 31 </span> : namespace diskindex { -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /** -<span class="lineNum"> 34 </span> : * MMap-based index of a -> [x1, x2, x3] mappings -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * The layout is: -<span class="lineNum"> 37 </span> : * -<span class="lineNum"> 38 </span> : * [offset of mapping for item 0, offset of mapping for item 1...] -<span class="lineNum"> 39 </span> : * [size of array][sorted array of ints pointed by index 0] -<span class="lineNum"> 40 </span> : * [size of array][sorted array of ints pointed by index 1] -<span class="lineNum"> 41 </span> : * [size of array][sorted array of ints pointed by index 2] -<span class="lineNum"> 42 </span> : * [...] -<span class="lineNum"> 43 </span> : * [number of items in the mapping] -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * This allows fast lookups, as well as fast lookups of unions or intersections -<span class="lineNum"> 46 </span> : * of mapped arrays. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * The number of items for an ID not present in the index is assumed to be 0. -<span class="lineNum"> 49 </span> : */ -<span class="lineNum"> 50 </span> : class Int : public MMap -<span class="lineNum"> 51 </span> : { -<span class="lineNum"> 52 </span> : protected: -<span class="lineNum"> 53 </span><span class="lineCov"> 274890 : inline int* buf() const { return (int*)m_buf; }</span> -<span class="lineNum"> 54 </span><span class="lineCov"> 274890 : inline size_t ofs(int val) const { return buf()[val]; }</span> -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : public: -<span class="lineNum"> 57 </span><span class="lineCov"> 20 : Int() {}</span> -<span class="lineNum"> 58 </span> : Int(const MasterMMap& master, int idx) : MMap(master, idx) {} -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : const int* data(int val) const { return (val >= 0 && (unsigned)val < size()) ? buf() + ofs(val) + 1 : 0; } -<span class="lineNum"> 61 </span><span class="lineNoCov"> 0 : size_t size(int val) const { return (val >= 0 && (unsigned)val < size()) ? buf()[ofs(val)] : 0; }</span> -<span class="lineNum"> 62 </span><span class="lineCov"> 274893 : size_t size() const { return m_buf ? ofs(0) : 0; }</span> -<span class="lineNum"> 63 </span> : }; -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : /** -<span class="lineNum"> 66 </span> : * Creates an on-disk index to use for IntIndex -<span class="lineNum"> 67 </span> : */ -<span class="lineNum"> 68 </span> : class IntIndexer : public MMapIndexer, public std::vector<std::set<int> > -<span class="lineNum"> 69 </span><span class="lineCov"> 4 : {</span> -<span class="lineNum"> 70 </span> : public: -<span class="lineNum"> 71 </span> : /// Store the key->val mapping into the indexer -<span class="lineNum"> 72 </span><span class="lineCov"> 211196 : void map(unsigned int key, int val)</span> -<span class="lineNum"> 73 </span> : { -<span class="lineNum"> 74 </span><span class="lineCov"> 211196 : if (size() <= key)</span> -<span class="lineNum"> 75 </span><span class="lineCov"> 21142 : resize(key + 1);</span> -<span class="lineNum"> 76 </span><span class="lineCov"> 211196 : (*this)[key].insert(val);</span> -<span class="lineNum"> 77 </span><span class="lineCov"> 211196 : }</span> -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : /// Return the size of the encoded index data -<span class="lineNum"> 80 </span> : virtual int encodedSize() const; -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : /// Write the index data in the given buffer, which should be at least -<span class="lineNum"> 83 </span> : /// encodedSize bytes -<span class="lineNum"> 84 </span> : virtual void encode(char* buf) const; -<span class="lineNum"> 85 </span> : }; -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : } -<span class="lineNum"> 88 </span> : } -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 91 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h.gcov.html deleted file mode 100644 index 8925ba5..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h.gcov.html +++ /dev/null @@ -1,196 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/diskindex/mmap.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/diskindex</a> - mmap.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_DISKINDEX_MMAP_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_DISKINDEX_MMAP_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Basic infrastructure for implementing mmapped indexes -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 12 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 13 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 14 </span> : * (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 19 </span> : * GNU General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 22 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <string> -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : namespace tagcoll { -<span class="lineNum"> 29 </span> : namespace diskindex { -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : class mmap; -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /** -<span class="lineNum"> 34 </span> : * Performs the memory management and mmapping tasks for mmapped indexes. -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * One MMap can contain many indexes. Indexes come chained one after the -<span class="lineNum"> 37 </span> : * other, prefixed by an int that specifies their length: -<span class="lineNum"> 38 </span> : * -<span class="lineNum"> 39 </span> : * [size of index 1][index1][size of index 2][index]... -<span class="lineNum"> 40 </span> : * -<span class="lineNum"> 41 </span> : * Every index must make sure that its size is int-aligned, otherwise accessing -<span class="lineNum"> 42 </span> : * it would cause a bus error in many architectures. -<span class="lineNum"> 43 </span> : */ -<span class="lineNum"> 44 </span> : class MasterMMap -<span class="lineNum"> 45 </span> : { -<span class="lineNum"> 46 </span> : protected: -<span class="lineNum"> 47 </span> : std::string m_filename; -<span class="lineNum"> 48 </span> : size_t m_size; -<span class="lineNum"> 49 </span> : int m_fd; -<span class="lineNum"> 50 </span> : const char* m_buf; -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : public: -<span class="lineNum"> 53 </span> : MasterMMap(); -<span class="lineNum"> 54 </span> : MasterMMap(const std::string& filename); -<span class="lineNum"> 55 </span> : ~MasterMMap(); -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : void init(const std::string& filename); -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : friend class MMap; -<span class="lineNum"> 60 </span> : }; -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : class MMap -<span class="lineNum"> 63 </span> : { -<span class="lineNum"> 64 </span> : protected: -<span class="lineNum"> 65 </span> : const MasterMMap* m_master; -<span class="lineNum"> 66 </span> : const char* m_buf; -<span class="lineNum"> 67 </span> : size_t m_size; -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : public: -<span class="lineNum"> 70 </span> : MMap(); -<span class="lineNum"> 71 </span> : MMap(const char* buf, int size); -<span class="lineNum"> 72 </span> : MMap(const MasterMMap& master, size_t idx); -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : void init(const char* buf, int size); -<span class="lineNum"> 75 </span> : void init(const MasterMMap& master, size_t idx); -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : /// Round a value to the next word size in the current architecture -<span class="lineNum"> 78 </span> : template<class INT> -<span class="lineNum"> 79 </span><span class="lineCov"> 12 : static inline INT align(INT val)</span> -<span class="lineNum"> 80 </span> : { -<span class="lineNum"> 81 </span><span class="lineCov"> 12 : return (val + sizeof(int) - 1) & ~(sizeof(int) - 1);</span> -<span class="lineNum"> 82 </span> : } -<span class="lineNum"> 83 </span> : }; -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : /** -<span class="lineNum"> 86 </span> : * Interface for indexers. -<span class="lineNum"> 87 </span> : */ -<span class="lineNum"> 88 </span> : class MMapIndexer -<span class="lineNum"> 89 </span><span class="lineCov"> 20 : {</span> -<span class="lineNum"> 90 </span> : public: -<span class="lineNum"> 91 </span><span class="lineCov"> 20 : virtual ~MMapIndexer() {}</span> -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : /// Return the size of the encoded index data (in bytes) -<span class="lineNum"> 94 </span> : virtual int encodedSize() const = 0; -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : /// Write the index data in the given buffer, which should be at least -<span class="lineNum"> 97 </span> : /// encodedSize bytes -<span class="lineNum"> 98 </span> : virtual void encode(char* buf) const = 0; -<span class="lineNum"> 99 </span> : }; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : /** -<span class="lineNum"> 102 </span> : * Master index writer. It allows to write many indexes in the same file, -<span class="lineNum"> 103 </span> : * atomically: the file will be created as a tempfile and atomically renamed to -<span class="lineNum"> 104 </span> : * the destination filename on class destruction. -<span class="lineNum"> 105 </span> : */ -<span class="lineNum"> 106 </span> : class MasterMMapIndexer -<span class="lineNum"> 107 </span> : { -<span class="lineNum"> 108 </span> : protected: -<span class="lineNum"> 109 </span> : std::string finalname; -<span class="lineNum"> 110 </span> : std::string tmpname; -<span class="lineNum"> 111 </span> : int fd; -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : public: -<span class="lineNum"> 114 </span> : MasterMMapIndexer(const std::string& filename); -<span class="lineNum"> 115 </span> : ~MasterMMapIndexer(); -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : /// Close the file and perform the final rename -<span class="lineNum"> 118 </span> : void commit(); -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : /// Append one subindex -<span class="lineNum"> 121 </span> : void append(const MMapIndexer& idx); -<span class="lineNum"> 122 </span> : }; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : } -<span class="lineNum"> 126 </span> : } -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 129 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/expression.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/expression.h.gcov.html deleted file mode 100644 index 128d3fb..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/expression.h.gcov.html +++ /dev/null @@ -1,249 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/expression.h</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - expression.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_EXPRESSION_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_EXPRESSION_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /* -<span class="lineNum"> 5 </span> : * Expression that can match tagsets -<span class="lineNum"> 6 </span> : * -<span class="lineNum"> 7 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 8 </span> : * -<span class="lineNum"> 9 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 10 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 11 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 12 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 13 </span> : * -<span class="lineNum"> 14 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 15 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 16 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 17 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 18 </span> : * -<span class="lineNum"> 19 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 20 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 21 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 22 </span> : */ -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <string> -<span class="lineNum"> 25 </span> : #include <set> -<span class="lineNum"> 26 </span> : #include <map> -<span class="lineNum"> 27 </span> : #include <wibble/singleton.h> -<span class="lineNum"> 28 </span> : #include <wibble/mixin.h> -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : namespace tagcoll -<span class="lineNum"> 31 </span> : { -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : class TagexprContext; -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : /** -<span class="lineNum"> 36 </span> : * Interface for parsed tag expressions -<span class="lineNum"> 37 </span> : */ -<span class="lineNum"> 38 </span> : class ExpressionImpl -<span class="lineNum"> 39 </span> : { -<span class="lineNum"> 40 </span> : protected: -<span class="lineNum"> 41 </span> : int _ref; -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : public: -<span class="lineNum"> 44 </span> : ExpressionImpl() : _ref(0) {} -<span class="lineNum"> 45 </span> : virtual ~ExpressionImpl() {} -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : /// Increment the reference count for this object -<span class="lineNum"> 48 </span><span class="lineCov"> 10 : void ref() throw () { ++_ref; }</span> -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : /// Decrement the reference count for this object, returning true when it -<span class="lineNum"> 51 </span> : /// reaches 0 -<span class="lineNum"> 52 </span><span class="lineCov"> 22 : bool unref() throw () { return --_ref == 0; }</span> -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : /** -<span class="lineNum"> 55 </span> : * Provide a string representation of this expression -<span class="lineNum"> 56 </span> : */ -<span class="lineNum"> 57 </span> : virtual std::string format() const = 0; -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : /** -<span class="lineNum"> 60 </span> : * Evaluates the expression on a recursive context -<span class="lineNum"> 61 </span> : * -<span class="lineNum"> 62 </span> : * \see TagexprContext -<span class="lineNum"> 63 </span> : */ -<span class="lineNum"> 64 </span> : virtual bool eval(const TagexprContext& context) const = 0; -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : /** -<span class="lineNum"> 67 </span> : * Evaluates the expression on a set of tags -<span class="lineNum"> 68 </span> : * -<span class="lineNum"> 69 </span> : * \return -<span class="lineNum"> 70 </span> : * true if the expression matches the tags, false otherwise -<span class="lineNum"> 71 </span> : */ -<span class="lineNum"> 72 </span> : virtual bool eval(const std::set<std::string>& tags) const = 0; -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : /** -<span class="lineNum"> 75 </span> : * Return a clone of this tag expression -<span class="lineNum"> 76 </span> : */ -<span class="lineNum"> 77 </span> : //virtual Tagexpr* clone() const = 0; -<span class="lineNum"> 78 </span> : }; -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : class Expression -<span class="lineNum"> 81 </span> : { -<span class="lineNum"> 82 </span> : protected: -<span class="lineNum"> 83 </span> : ExpressionImpl* m_impl; -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : Expression(ExpressionImpl* impl) : m_impl(impl) { m_impl->ref(); } -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : const ExpressionImpl* impl() const { return m_impl; } -<span class="lineNum"> 88 </span> : ExpressionImpl* impl() { return m_impl; } -<span class="lineNum"> 89 </span> : -<span class="lineNum"> 90 </span> : public: -<span class="lineNum"> 91 </span> : Expression(); -<span class="lineNum"> 92 </span> : Expression(const std::string& expr); -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : Expression(const Expression& e) -<span class="lineNum"> 95 </span> : { -<span class="lineNum"> 96 </span> : if (e.m_impl) -<span class="lineNum"> 97 </span> : e.m_impl->ref(); -<span class="lineNum"> 98 </span> : m_impl = e.m_impl; -<span class="lineNum"> 99 </span> : } -<span class="lineNum"> 100 </span><span class="lineCov"> 12 : ~Expression() { if (m_impl->unref()) delete m_impl; }</span> -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span><span class="lineCov"> 10 : Expression& operator=(const Expression& e)</span> -<span class="lineNum"> 103 </span> : { -<span class="lineNum"> 104 </span><span class="lineCov"> 10 : if (e.m_impl)</span> -<span class="lineNum"> 105 </span><span class="lineCov"> 10 : e.m_impl->ref(); // Do it early to correctly handle the case of x = x;</span> -<span class="lineNum"> 106 </span><span class="lineCov"> 10 : if (m_impl && m_impl->unref())</span> -<span class="lineNum"> 107 </span><span class="lineCov"> 10 : delete m_impl;</span> -<span class="lineNum"> 108 </span><span class="lineCov"> 10 : m_impl = e.m_impl;</span> -<span class="lineNum"> 109 </span><span class="lineCov"> 10 : return *this;</span> -<span class="lineNum"> 110 </span> : } -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : Expression operator and (const Expression& e); -<span class="lineNum"> 113 </span> : Expression operator or (const Expression& e); -<span class="lineNum"> 114 </span> : Expression operator not (); -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : template<typename Tags> -<span class="lineNum"> 117 </span> : bool operator()(const Tags& tags) const -<span class="lineNum"> 118 </span> : { -<span class="lineNum"> 119 </span> : std::set<std::string> stags; -<span class="lineNum"> 120 </span> : for (typename Tags::const_iterator i = tags.begin(); -<span class="lineNum"> 121 </span> : i != tags.end(); ++i) -<span class="lineNum"> 122 </span> : stags.insert(*i); -<span class="lineNum"> 123 </span> : return m_impl->eval(stags); -<span class="lineNum"> 124 </span> : } -<span class="lineNum"> 125 </span> : bool operator()(const std::set<std::string>& tags) const { return m_impl->eval(tags); } -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : bool operator()(const TagexprContext& context) const { return m_impl->eval(context); } -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : std::string format() const { return m_impl->format(); } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : static Expression matchTag(const std::string& pattern); -<span class="lineNum"> 132 </span> : }; -<span class="lineNum"> 133 </span> : -<span class="lineNum"> 134 </span> : /** -<span class="lineNum"> 135 </span> : * Context for evaluating expressions of derived tags. -<span class="lineNum"> 136 </span> : * -<span class="lineNum"> 137 </span> : * A derived tag is a tag which is automatically inferred when a tag expression -<span class="lineNum"> 138 </span> : * is matched on a tagset. -<span class="lineNum"> 139 </span> : * -<span class="lineNum"> 140 </span> : * TagexprContext allows the inference engine to distinguish between a normal -<span class="lineNum"> 141 </span> : * tag or a derived tag. -<span class="lineNum"> 142 </span> : * -<span class="lineNum"> 143 </span> : * This class is mainly used to support DerivedTags and has probably little -<span class="lineNum"> 144 </span> : * applications elsewhere. -<span class="lineNum"> 145 </span> : */ -<span class="lineNum"> 146 </span> : class TagexprContext -<span class="lineNum"> 147 </span> : { -<span class="lineNum"> 148 </span> : protected: -<span class="lineNum"> 149 </span> : const std::set<std::string>& tags; -<span class="lineNum"> 150 </span> : const std::map<std::string, Expression>& derivedTags; -<span class="lineNum"> 151 </span> : // Tags "visited" during tag evaluation: used to break circular loops -<span class="lineNum"> 152 </span> : mutable std::set<std::string> seen; -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : public: -<span class="lineNum"> 155 </span> : /** -<span class="lineNum"> 156 </span> : * Create a context for recursive tagset evaluation -<span class="lineNum"> 157 </span> : * -<span class="lineNum"> 158 </span> : * Evaluation happens using a derivation table, which can list a tag as an -<span class="lineNum"> 159 </span> : * alias for another tag expression. Whenever a tag is matched for -<span class="lineNum"> 160 </span> : * equality with a derived tag, the match is performed with the derived tag -<span class="lineNum"> 161 </span> : * expression instead. -<span class="lineNum"> 162 </span> : * -<span class="lineNum"> 163 </span> : * \param tags -<span class="lineNum"> 164 </span> : * The tags to evaluate -<span class="lineNum"> 165 </span> : * \param derivedTags -<span class="lineNum"> 166 </span> : * The table of derived tags to use in the evaluation -<span class="lineNum"> 167 </span> : */ -<span class="lineNum"> 168 </span> : TagexprContext(const std::set<std::string>& tags, const std::map<std::string, Expression>& derivedTags) -<span class="lineNum"> 169 </span> : : tags(tags), derivedTags(derivedTags) {} -<span class="lineNum"> 170 </span> : -<span class="lineNum"> 171 </span> : /** -<span class="lineNum"> 172 </span> : * Evaluates the input tags on the contents to see if they contain the -<span class="lineNum"> 173 </span> : * given tag, or if they match its associated tag expression if tag is a -<span class="lineNum"> 174 </span> : * derived tag -<span class="lineNum"> 175 </span> : */ -<span class="lineNum"> 176 </span> : bool eval(const std::string& tag) const; -<span class="lineNum"> 177 </span> : }; -<span class="lineNum"> 178 </span> : -<span class="lineNum"> 179 </span> : }; -<span class="lineNum"> 180 </span> : -<span class="lineNum"> 181 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 182 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/index.html deleted file mode 100644 index 664ae5b..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/index.html +++ /dev/null @@ -1,119 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">173</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">73.4 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">127</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="TextFormat.h.gcov.html">TextFormat.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../ruby.png" width=14 height=10 alt="14.3%"><img src="../../../../snow.png" width=86 height=10 alt="14.3%"></td></tr></table> - </td> - <td class="coverPerLo">14.3 %</td> - <td class="coverNumLo">1 / 7 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="TextFormat.tcc.gcov.html">TextFormat.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=54 height=10 alt="54.4%"><img src="../../../../snow.png" width=46 height=10 alt="54.4%"></td></tr></table> - </td> - <td class="coverPerHi">54.4 %</td> - <td class="coverNumHi">43 / 79 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="expression.h.gcov.html">expression.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">10 / 10 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="patch.h.gcov.html">patch.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">42 / 42 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="patch.tcc.gcov.html">patch.tcc</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../emerald.png" width=89 height=10 alt="88.6%"><img src="../../../../snow.png" width=11 height=10 alt="88.6%"></td></tr></table> - </td> - <td class="coverPerHi">88.6 %</td> - <td class="coverNumHi">31 / 35 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/base.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/base.h.gcov.html deleted file mode 100644 index 5fb2a07..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/base.h.gcov.html +++ /dev/null @@ -1,184 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input/base.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/input</a> - base.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">14</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">7.1 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_INPUT_BASE_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_INPUT_BASE_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Base class for parsers -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <string> -<span class="lineNum"> 27 </span> : #include <wibble/exception.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : namespace input { -<span class="lineNum"> 32 </span> : class Input; -<span class="lineNum"> 33 </span> : } -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : namespace exception { -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : /** -<span class="lineNum"> 38 </span> : * Base exception for parser errors -<span class="lineNum"> 39 </span> : */ -<span class="lineNum"> 40 </span> : class Input : public wibble::exception::Consistency -<span class="lineNum"> 41 </span><span class="lineNoCov"> 0 : {</span> -<span class="lineNum"> 42 </span> : protected: -<span class="lineNum"> 43 </span> : std::string _file; -<span class="lineNum"> 44 </span> : int _line; -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : std::string makeContext(const std::string& file, int line); -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : public: -<span class="lineNum"> 49 </span> : Input(const tagcoll::input::Input& input, const std::string& message) throw (); -<span class="lineNum"> 50 </span> : Input(const std::string& file, int line, const std::string& message) throw () -<span class="lineNum"> 51 </span> : : wibble::exception::Consistency(makeContext(file, line), message), -<span class="lineNum"> 52 </span> : _file(file), _line(line) {} -<span class="lineNum"> 53 </span><span class="lineNoCov"> 0 : Input(int line, const std::string& message) throw ()</span> -<span class="lineNum"> 54 </span><span class="lineNoCov"> 0 : : wibble::exception::Consistency(makeContext(std::string(), line), message),</span> -<span class="lineNum"> 55 </span><span class="lineNoCov"> 0 : _line(line) {}</span> -<span class="lineNum"> 56 </span> : Input(const std::string& message) throw () -<span class="lineNum"> 57 </span> : : wibble::exception::Consistency(makeContext(std::string(), -1), message), -<span class="lineNum"> 58 </span> : _line(-1) {} -<span class="lineNum"> 59 </span><span class="lineNoCov"> 0 : virtual ~Input() throw () {}</span> -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : int line() const throw () { return _line; } -<span class="lineNum"> 62 </span><span class="lineNoCov"> 0 : int line(int line) throw () { return _line = line; }</span> -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : const std::string& file() const throw () { return _file; } -<span class="lineNum"> 65 </span> : std::string file() throw () { return _file; } -<span class="lineNum"> 66 </span> : std::string file(const std::string file) throw () { return _file = file; } -<span class="lineNum"> 67 </span> : -<span class="lineNum"> 68 </span><span class="lineNoCov"> 0 : virtual const char* type() const throw () { return "Input"; }</span> -<span class="lineNum"> 69 </span> : }; -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : /** -<span class="lineNum"> 72 </span> : * Exception thrown in case of problems accessing the input of the parser -<span class="lineNum"> 73 </span> : */ -<span class="lineNum"> 74 </span> : class Parser : public Input -<span class="lineNum"> 75 </span><span class="lineNoCov"> 0 : {</span> -<span class="lineNum"> 76 </span> : public: -<span class="lineNum"> 77 </span><span class="lineNoCov"> 0 : Parser(const tagcoll::input::Input& input, const std::string& message) throw ()</span> -<span class="lineNum"> 78 </span><span class="lineNoCov"> 0 : : Input(input, message) {}</span> -<span class="lineNum"> 79 </span><span class="lineNoCov"> 0 : virtual ~Parser() throw () {}</span> -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span><span class="lineNoCov"> 0 : virtual const char* type() const throw ()</span> -<span class="lineNum"> 82 </span> : { -<span class="lineNum"> 83 </span><span class="lineNoCov"> 0 : return "Parser";</span> -<span class="lineNum"> 84 </span> : } -<span class="lineNum"> 85 </span> : }; -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : } -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : namespace input { -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : /** -<span class="lineNum"> 92 </span> : * Generic interface for parser input readers. -<span class="lineNum"> 93 </span> : * -<span class="lineNum"> 94 </span> : * It encapsulates and hides the reading machinery. It can be implemented as a -<span class="lineNum"> 95 </span> : * file read, a stream read, a decompressing file read, a network read or -<span class="lineNum"> 96 </span> : * whatever else is needed. -<span class="lineNum"> 97 </span> : */ -<span class="lineNum"> 98 </span> : class Input -<span class="lineNum"> 99 </span> : { -<span class="lineNum"> 100 </span> : public: -<span class="lineNum"> 101 </span> : static const int Eof = -1; -<span class="lineNum"> 102 </span> : -<span class="lineNum"> 103 </span> : Input() {} -<span class="lineNum"> 104 </span><span class="lineCov"> 1305 : virtual ~Input() {}</span> -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : virtual const std::string& fileName() const = 0; -<span class="lineNum"> 107 </span> : virtual int lineNumber() const = 0; -<span class="lineNum"> 108 </span> : virtual int nextChar() = 0; -<span class="lineNum"> 109 </span> : virtual void pushChar(int c) = 0; -<span class="lineNum"> 110 </span> : }; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : } -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 117 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/index.html deleted file mode 100644 index 2d2187e..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/index.html +++ /dev/null @@ -1,101 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/input</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">16</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">18.8 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="base.h.gcov.html">base.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../ruby.png" width=7 height=10 alt="7.1%"><img src="../../../../../snow.png" width=93 height=10 alt="7.1%"></td></tr></table> - </td> - <td class="coverPerLo">7.1 %</td> - <td class="coverNumLo">1 / 14 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="memory.h.gcov.html">memory.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="string.h.gcov.html">string.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h.gcov.html deleted file mode 100644 index c7d8a43..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/memory.h.gcov.html +++ /dev/null @@ -1,127 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input/memory.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/input</a> - memory.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_INPUT_MEMORY_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_INPUT_MEMORY_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Parser input using a buffer as input -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003-2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <tagcoll/input/base.h> -<span class="lineNum"> 27 </span> : #include <string> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : namespace input { -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** -<span class="lineNum"> 33 </span> : * Parser input using a std::string as input -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : class Memory : public Input -<span class="lineNum"> 36 </span> : { -<span class="lineNum"> 37 </span> : protected: -<span class="lineNum"> 38 </span> : const std::string fname; -<span class="lineNum"> 39 </span> : const char* buf; -<span class="lineNum"> 40 </span> : int pos; -<span class="lineNum"> 41 </span> : int len; -<span class="lineNum"> 42 </span> : int _line; -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span> : public: -<span class="lineNum"> 45 </span> : Memory(const std::string& fname, const char* buf, int len) throw (); -<span class="lineNum"> 46 </span> : Memory(const char* buf, int len) throw (); -<span class="lineNum"> 47 </span><span class="lineCov"> 1301 : virtual ~Memory() throw () {}</span> -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : virtual const std::string& fileName() const throw () { return fname; } -<span class="lineNum"> 50 </span> : virtual int lineNumber() const throw () { return _line; } -<span class="lineNum"> 51 </span> : -<span class="lineNum"> 52 </span> : virtual int nextChar() throw (); -<span class="lineNum"> 53 </span> : virtual void pushChar(int c) throw (); -<span class="lineNum"> 54 </span> : }; -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : } -<span class="lineNum"> 57 </span> : } -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 60 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/string.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/input/string.h.gcov.html deleted file mode 100644 index e3f330c..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/input/string.h.gcov.html +++ /dev/null @@ -1,125 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/input/string.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/input</a> - string.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_INPUT_STRING_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_INPUT_STRING_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Parser input using a std::string as input -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003--2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <tagcoll/input/base.h> -<span class="lineNum"> 27 </span> : #include <string> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : namespace input { -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** -<span class="lineNum"> 33 </span> : * Parser input using a std::string as input -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : class String : public Input -<span class="lineNum"> 36 </span> : { -<span class="lineNum"> 37 </span> : protected: -<span class="lineNum"> 38 </span> : static const std::string fname; -<span class="lineNum"> 39 </span> : std::string _str; -<span class="lineNum"> 40 </span> : std::string::const_iterator _s; -<span class="lineNum"> 41 </span> : int _line; -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : public: -<span class="lineNum"> 44 </span> : String(const std::string& str); -<span class="lineNum"> 45 </span><span class="lineCov"> 4 : virtual ~String() {}</span> -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : virtual const std::string& fileName() const throw () { return fname; } -<span class="lineNum"> 48 </span> : virtual int lineNumber() const throw () { return _line; } -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : virtual int nextChar(); -<span class="lineNum"> 51 </span> : virtual void pushChar(int c); -<span class="lineNum"> 52 </span> : }; -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : } -<span class="lineNum"> 55 </span> : } -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 58 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.h.gcov.html deleted file mode 100644 index ba07ca2..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.h.gcov.html +++ /dev/null @@ -1,271 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/patch.h</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - patch.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">42</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">42</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_PATCHES_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_PATCHES_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Classes handling tag patches -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <wibble/operators.h> -<span class="lineNum"> 27 </span> : #include <wibble/mixin.h> -<span class="lineNum"> 28 </span> : #include <map> -<span class="lineNum"> 29 </span> : #include <string> -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : namespace tagcoll -<span class="lineNum"> 32 </span> : { -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : /** -<span class="lineNum"> 35 </span> : * Patch for the tagset of a specific item -<span class="lineNum"> 36 </span> : */ -<span class="lineNum"> 37 </span> : template <typename ITEM, typename TAG> -<span class="lineNum"> 38 </span> : struct Patch -<span class="lineNum"> 39 </span> : { -<span class="lineNum"> 40 </span> : ITEM item; -<span class="lineNum"> 41 </span> : std::set<TAG> added; -<span class="lineNum"> 42 </span> : std::set<TAG> removed; -<span class="lineNum"> 43 </span> : -<span class="lineNum"> 44 </span><span class="lineCov"> 55 : Patch(const Patch<ITEM, TAG>& p) : item(p.item), added(p.added), removed(p.removed) {}</span> -<span class="lineNum"> 45 </span><span class="lineCov"> 5 : Patch(const ITEM& item) : item(item) {}</span> -<span class="lineNum"> 46 </span><span class="lineCov"> 2 : Patch(const ITEM& item, const std::set<TAG>& added, const std::set<TAG>& removed);</span> -<span class="lineNum"> 47 </span> : template<typename CONTA, typename CONTB> -<span class="lineNum"> 48 </span><span class="lineCov"> 2 : Patch(const ITEM& item, const CONTA& added, const CONTB& removed);</span> -<span class="lineNum"> 49 </span><span class="lineCov"> 66 : ~Patch() {}</span> -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span><span class="lineCov"> 5 : void add(const TAG& tag)</span> -<span class="lineNum"> 52 </span> : { -<span class="lineNum"> 53 </span> : using namespace wibble::operators; -<span class="lineNum"> 54 </span><span class="lineCov"> 5 : added |= tag; removed -= tag;</span> -<span class="lineNum"> 55 </span><span class="lineCov"> 5 : }</span> -<span class="lineNum"> 56 </span><span class="lineCov"> 2 : void add(const std::set<TAG>& tags)</span> -<span class="lineNum"> 57 </span> : { -<span class="lineNum"> 58 </span> : using namespace wibble::operators; -<span class="lineNum"> 59 </span><span class="lineCov"> 2 : added |= tags; removed -= tags;</span> -<span class="lineNum"> 60 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 61 </span><span class="lineCov"> 2 : void remove(const TAG& tag)</span> -<span class="lineNum"> 62 </span> : { -<span class="lineNum"> 63 </span> : using namespace wibble::operators; -<span class="lineNum"> 64 </span><span class="lineCov"> 2 : removed |= tag; added -= tag;</span> -<span class="lineNum"> 65 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 66 </span><span class="lineCov"> 2 : void remove(const std::set<TAG>& tags)</span> -<span class="lineNum"> 67 </span> : { -<span class="lineNum"> 68 </span> : using namespace wibble::operators; -<span class="lineNum"> 69 </span><span class="lineCov"> 2 : removed |= tags; added -= tags;</span> -<span class="lineNum"> 70 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : Patch<ITEM, TAG> getReverse() const -<span class="lineNum"> 73 </span> : { -<span class="lineNum"> 74 </span> : return Patch<ITEM, TAG>(item, removed, added); -<span class="lineNum"> 75 </span> : } -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span><span class="lineCov"> 2 : void mergeWith(const Patch<ITEM, TAG>& patch)</span> -<span class="lineNum"> 78 </span> : { -<span class="lineNum"> 79 </span><span class="lineCov"> 2 : add(patch.added);</span> -<span class="lineNum"> 80 </span><span class="lineCov"> 2 : remove(patch.removed);</span> -<span class="lineNum"> 81 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span><span class="lineCov"> 1 : std::set<TAG> apply(const std::set<TAG>& ts) const</span> -<span class="lineNum"> 84 </span> : { -<span class="lineNum"> 85 </span> : using namespace wibble::operators; -<span class="lineNum"> 86 </span><span class="lineCov"> 1 : return (ts | added) - removed;</span> -<span class="lineNum"> 87 </span> : } -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : template<typename TAGS> -<span class="lineNum"> 90 </span> : std::set<TAG> apply(const TAGS& tags) const -<span class="lineNum"> 91 </span> : { -<span class="lineNum"> 92 </span> : using namespace wibble::operators; -<span class="lineNum"> 93 </span> : std::set<TAG> ts; -<span class="lineNum"> 94 </span> : for (typename TAGS::const_iterator i = tags.begin(); -<span class="lineNum"> 95 </span> : i != tags.end(); ++i) -<span class="lineNum"> 96 </span> : ts.insert(*i); -<span class="lineNum"> 97 </span> : return (ts | added) - removed; -<span class="lineNum"> 98 </span> : } -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span><span class="lineCov"> 4 : void removeRedundant(const std::set<TAG> ts)</span> -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span> : using namespace wibble::operators; -<span class="lineNum"> 103 </span> : // Don't add what already exists -<span class="lineNum"> 104 </span><span class="lineCov"> 4 : added -= ts;</span> -<span class="lineNum"> 105 </span> : // Don't remove what does not exist -<span class="lineNum"> 106 </span><span class="lineCov"> 4 : removed -= (removed - ts);</span> -<span class="lineNum"> 107 </span><span class="lineCov"> 4 : }</span> -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : bool operator==(const Patch<ITEM, TAG>& p) const -<span class="lineNum"> 110 </span> : { -<span class="lineNum"> 111 </span> : return p.item == item && p.added == added && p.removed == removed; -<span class="lineNum"> 112 </span> : } -<span class="lineNum"> 113 </span> : bool operator!=(const Patch<ITEM, TAG>& p) const -<span class="lineNum"> 114 </span> : { -<span class="lineNum"> 115 </span> : return p.item != item || p.added != added || p.removed != removed; -<span class="lineNum"> 116 </span> : } -<span class="lineNum"> 117 </span> : }; -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : /** -<span class="lineNum"> 120 </span> : * List of patches that can be applied to a TaggedCollection -<span class="lineNum"> 121 </span> : */ -<span class="lineNum"> 122 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 123 </span> : class PatchList : public std::map<ITEM, Patch<ITEM, TAG> > -<span class="lineNum"> 124 </span><span class="lineCov"> 36 : {</span> -<span class="lineNum"> 125 </span> : public: -<span class="lineNum"> 126 </span><span class="lineCov"> 32 : PatchList() {}</span> -<span class="lineNum"> 127 </span><span class="lineCov"> 3 : PatchList(const PatchList& pl) : std::map<ITEM, Patch<ITEM, TAG> >(pl) {}</span> -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : typedef typename std::map<ITEM, Patch<ITEM, TAG> >::const_iterator const_iterator; -<span class="lineNum"> 130 </span> : typedef typename std::map<ITEM, Patch<ITEM, TAG> >::iterator iterator; -<span class="lineNum"> 131 </span> : -<span class="lineNum"> 132 </span> : /** -<span class="lineNum"> 133 </span> : * Add to this patchlist the patches needed to transform `im1' in `im2' -<span class="lineNum"> 134 </span> : */ -<span class="lineNum"> 135 </span> : template<typename COLL1, typename COLL2> -<span class="lineNum"> 136 </span> : void addPatch(const COLL1& im1, const COLL2& im2); -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : /** -<span class="lineNum"> 139 </span> : * Add `patch' to this PatchList -<span class="lineNum"> 140 </span> : */ -<span class="lineNum"> 141 </span><span class="lineCov"> 15 : void addPatch(const Patch<ITEM, TAG>& patch);</span> -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : /** -<span class="lineNum"> 144 </span> : * Add `patches' to this PatchList -<span class="lineNum"> 145 </span> : */ -<span class="lineNum"> 146 </span> : void addPatch(const PatchList<ITEM, TAG>& patches); -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : /** -<span class="lineNum"> 149 </span> : * Add 'patch' to this PatchList, as tag: +/- package rather than package -<span class="lineNum"> 150 </span> : * +/- tag -<span class="lineNum"> 151 </span> : */ -<span class="lineNum"> 152 </span><span class="lineCov"> 2 : void addPatchInverted(const Patch<TAG, ITEM>& patch);</span> -<span class="lineNum"> 153 </span> : -<span class="lineNum"> 154 </span> : /** -<span class="lineNum"> 155 </span> : * Add 'patches' to this PatchList, as tag: +/- package rather than package -<span class="lineNum"> 156 </span> : * +/- tag -<span class="lineNum"> 157 </span> : */ -<span class="lineNum"> 158 </span><span class="lineCov"> 2 : void addPatchInverted(const PatchList<TAG, ITEM>& patches);</span> -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : /** -<span class="lineNum"> 161 </span> : * If the PatchList contains the give item, invoke -<span class="lineNum"> 162 </span> : * Patch::removeRedundant(tags) on its patch -<span class="lineNum"> 163 </span> : */ -<span class="lineNum"> 164 </span><span class="lineCov"> 4 : void removeRedundant(const ITEM& item, const std::set<TAG>& tags);</span> -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : /** -<span class="lineNum"> 167 </span> : * Patch a tagged item -<span class="lineNum"> 168 </span> : * -<span class="lineNum"> 169 </span> : * @return -<span class="lineNum"> 170 </span> : * The new (patched) set of tags -<span class="lineNum"> 171 </span> : */ -<span class="lineNum"> 172 </span><span class="lineCov"> 14 : std::set<TAG> patch(const ITEM& item, const std::set<TAG>& tagset) const;</span> -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : // Output the patch list to a TagcollConsumer -<span class="lineNum"> 175 </span> : template<typename OUT> -<span class="lineNum"> 176 </span><span class="lineCov"> 3 : void output(OUT out) const;</span> -<span class="lineNum"> 177 </span> : -<span class="lineNum"> 178 </span> : PatchList<ITEM, TAG> getReverse() const; -<span class="lineNum"> 179 </span> : }; -<span class="lineNum"> 180 </span> : -<span class="lineNum"> 181 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 182 </span> : class Inserter : public wibble::mixin::OutputIterator< Inserter<ITEM, TAG> > -<span class="lineNum"> 183 </span> : { -<span class="lineNum"> 184 </span> : PatchList<ITEM, TAG>& patches; -<span class="lineNum"> 185 </span> : public: -<span class="lineNum"> 186 </span><span class="lineCov"> 3 : Inserter(PatchList<ITEM, TAG>& patches) : patches(patches) {}</span> -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span><span class="lineCov"> 3 : Inserter<ITEM, TAG>& operator=(const Patch<ITEM, TAG>& patch)</span> -<span class="lineNum"> 189 </span> : { -<span class="lineNum"> 190 </span><span class="lineCov"> 3 : patches.addPatch(patch);</span> -<span class="lineNum"> 191 </span><span class="lineCov"> 3 : return *this;</span> -<span class="lineNum"> 192 </span> : } -<span class="lineNum"> 193 </span> : }; -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : template<typename ITEM, typename TAG> -<span class="lineNum"> 196 </span><span class="lineCov"> 3 : Inserter<ITEM, TAG> inserter(PatchList<ITEM, TAG>& patches)</span> -<span class="lineNum"> 197 </span> : { -<span class="lineNum"> 198 </span><span class="lineCov"> 3 : return Inserter<ITEM, TAG>(patches);</span> -<span class="lineNum"> 199 </span> : } -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : } -<span class="lineNum"> 202 </span> : -<span class="lineNum"> 203 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 204 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc.gcov.html deleted file mode 100644 index 129ac91..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/patch.tcc.gcov.html +++ /dev/null @@ -1,231 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/patch.tcc</title> - <link rel="stylesheet" type="text/css" href="../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll</a> - patch.tcc</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">35</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">88.6 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">31</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /* -<span class="lineNum"> 2 </span> : * Classes handling tag patches -<span class="lineNum"> 3 </span> : * -<span class="lineNum"> 4 </span> : * Copyright (C) 2003--2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 7 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 8 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 9 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 14 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 17 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef TAGCOLL_PATCHES_TCC -<span class="lineNum"> 22 </span> : #define TAGCOLL_PATCHES_TCC -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <tagcoll/patch.h> -<span class="lineNum"> 25 </span> : #include <wibble/singleton.h> -<span class="lineNum"> 26 </span> : #include <wibble/empty.h> -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : using namespace std; -<span class="lineNum"> 29 </span> : using namespace wibble::operators; -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : namespace tagcoll { -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : template <typename ITEM, typename TAG> -<span class="lineNum"> 34 </span> : Patch<ITEM, TAG>::Patch(const ITEM& item, const std::set<TAG>& added, const std::set<TAG>& removed) -<span class="lineNum"> 35 </span><span class="lineCov"> 2 : : item(item), added(added-removed), removed(removed-added)</span> -<span class="lineNum"> 36 </span><span class="lineNoCov"> 0 : {</span> -<span class="lineNum"> 37 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : template <typename ITEM, typename TAG> template<typename CONTA, typename CONTB> -<span class="lineNum"> 40 </span><span class="lineCov"> 2 : Patch<ITEM, TAG>::Patch(const ITEM& item, const CONTA& added, const CONTB& removed)</span> -<span class="lineNum"> 41 </span><span class="lineCov"> 4 : : item(item)</span> -<span class="lineNum"> 42 </span> : { -<span class="lineNum"> 43 </span><span class="lineCov"> 4 : std::copy(added.begin(), added.end(), inserter(this->added, this->added.begin()));</span> -<span class="lineNum"> 44 </span><span class="lineCov"> 4 : std::copy(removed.begin(), removed.end(), inserter(this->removed, this->removed.begin()));</span> -<span class="lineNum"> 45 </span><span class="lineCov"> 4 : }</span> -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 48 </span> : void PatchList<ITEM, TAG>::addPatch(const Patch<ITEM, TAG>& patch) -<span class="lineNum"> 49 </span> : { -<span class="lineNum"> 50 </span> : // Filter out empty patches -<span class="lineNum"> 51 </span><span class="lineCov"> 15 : if (patch.added.empty() && patch.removed.empty())</span> -<span class="lineNum"> 52 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span><span class="lineCov"> 15 : iterator i = this->find(patch.item);</span> -<span class="lineNum"> 55 </span><span class="lineCov"> 15 : if (i == this->end())</span> -<span class="lineNum"> 56 </span><span class="lineCov"> 13 : insert(make_pair<ITEM, Patch<ITEM, TAG> >(patch.item, patch));</span> -<span class="lineNum"> 57 </span> : else -<span class="lineNum"> 58 </span><span class="lineCov"> 2 : i->second.mergeWith(patch);</span> -<span class="lineNum"> 59 </span> : } -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 62 </span> : void PatchList<ITEM, TAG>::addPatch(const PatchList<ITEM, TAG>& patches) -<span class="lineNum"> 63 </span> : { -<span class="lineNum"> 64 </span> : for (typename PatchList<ITEM, TAG>::const_iterator i = patches.begin(); -<span class="lineNum"> 65 </span> : i != patches.end(); i++) -<span class="lineNum"> 66 </span> : addPatch(i->second); -<span class="lineNum"> 67 </span> : } -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 70 </span> : void PatchList<ITEM, TAG>::addPatchInverted(const Patch<TAG, ITEM>& patch) -<span class="lineNum"> 71 </span> : { -<span class="lineNum"> 72 </span> : // Filter out empty patches -<span class="lineNum"> 73 </span><span class="lineCov"> 2 : if (patch.added.empty() && patch.removed.empty())</span> -<span class="lineNum"> 74 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span><span class="lineCov"> 8 : for (typename std::set<ITEM>::const_iterator i = patch.added.begin();</span> -<span class="lineNum"> 77 </span> : i != patch.added.end(); ++i) -<span class="lineNum"> 78 </span><span class="lineCov"> 2 : addPatch(Patch<ITEM, TAG>(*i, wibble::singleton(patch.item), wibble::Empty<TAG>()));</span> -<span class="lineNum"> 79 </span><span class="lineCov"> 4 : for (typename std::set<ITEM>::const_iterator i = patch.removed.begin();</span> -<span class="lineNum"> 80 </span> : i != patch.removed.end(); ++i) -<span class="lineNum"> 81 </span><span class="lineNoCov"> 0 : addPatch(Patch<ITEM, TAG>(*i, wibble::Empty<TAG>(), wibble::singleton(patch.item)));</span> -<span class="lineNum"> 82 </span> : } -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 85 </span> : void PatchList<ITEM, TAG>::addPatchInverted(const PatchList<TAG, ITEM>& patches) -<span class="lineNum"> 86 </span> : { -<span class="lineNum"> 87 </span><span class="lineCov"> 4 : for (typename PatchList<TAG, ITEM>::const_iterator i = patches.begin();</span> -<span class="lineNum"> 88 </span> : i != patches.end(); i++) -<span class="lineNum"> 89 </span><span class="lineCov"> 2 : addPatchInverted(i->second);</span> -<span class="lineNum"> 90 </span><span class="lineCov"> 2 : }</span> -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : template <class ITEM, class TAG> template<typename COLL1, typename COLL2> -<span class="lineNum"> 94 </span> : void PatchList<ITEM, TAG>::addPatch(const COLL1& im1, const COLL2& im2) -<span class="lineNum"> 95 </span> : { -<span class="lineNum"> 96 </span> : // FIXME: if I could implement the guarantee that the collection iterators -<span class="lineNum"> 97 </span> : // iterate in sorted item order, then I wouldn't need to extract all the -<span class="lineNum"> 98 </span> : // items of im2 -<span class="lineNum"> 99 </span> : std::set<ITEM> im2items = im2.getTaggedItems(); -<span class="lineNum"> 100 </span> : for (typename COLL1::const_iterator i1 = im1.begin(); -<span class="lineNum"> 101 </span> : i1 != im1.end(); ++i1) -<span class="lineNum"> 102 </span> : { -<span class="lineNum"> 103 </span> : im2items.erase(i1->first); -<span class="lineNum"> 104 </span> : std::set<TAG> ts2 = im2.getTagsOfItem(i1->first); -<span class="lineNum"> 105 </span> : std::set<TAG> added = ts2 - i1->second; -<span class="lineNum"> 106 </span> : std::set<TAG> removed = i1->second - ts2; -<span class="lineNum"> 107 </span> : if (!added.empty() || !removed.empty()) -<span class="lineNum"> 108 </span> : addPatch(Patch<ITEM, TAG>(i1->first, added, removed)); -<span class="lineNum"> 109 </span> : } -<span class="lineNum"> 110 </span> : for (typename std::set<ITEM>::const_iterator i = im2items.begin(); -<span class="lineNum"> 111 </span> : i != im2items.end(); ++i) -<span class="lineNum"> 112 </span> : { -<span class="lineNum"> 113 </span> : addPatch(Patch<ITEM, TAG>(*i, im2.getTagsOfItem(*i), wibble::Empty<TAG>())); -<span class="lineNum"> 114 </span> : } -<span class="lineNum"> 115 </span> : } -<span class="lineNum"> 116 </span> : -<span class="lineNum"> 117 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 118 </span> : void PatchList<ITEM, TAG>::removeRedundant(const ITEM& item, const std::set<TAG>& tags) -<span class="lineNum"> 119 </span> : { -<span class="lineNum"> 120 </span><span class="lineCov"> 4 : iterator i = this->find(item);</span> -<span class="lineNum"> 121 </span><span class="lineCov"> 4 : if (i == this->end()) return;</span> -<span class="lineNum"> 122 </span><span class="lineCov"> 4 : i->second.removeRedundant(tags);</span> -<span class="lineNum"> 123 </span> : } -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 126 </span> : std::set<TAG> PatchList<ITEM, TAG>::patch(const ITEM& item, const std::set<TAG>& tagset) const -<span class="lineNum"> 127 </span> : { -<span class="lineNum"> 128 </span> : // Find the patch record for this item -<span class="lineNum"> 129 </span><span class="lineCov"> 14 : const_iterator p = this->find(item);</span> -<span class="lineNum"> 130 </span><span class="lineCov"> 14 : if (p == this->end())</span> -<span class="lineNum"> 131 </span> : // If there are no patches, return the tagset unchanged -<span class="lineNum"> 132 </span><span class="lineCov"> 13 : return tagset;</span> -<span class="lineNum"> 133 </span> : -<span class="lineNum"> 134 </span> : // There are patches: apply them: -<span class="lineNum"> 135 </span><span class="lineCov"> 1 : return p->second.apply(tagset);</span> -<span class="lineNum"> 136 </span> : } -<span class="lineNum"> 137 </span> : -<span class="lineNum"> 138 </span> : template <class ITEM, class TAG> -<span class="lineNum"> 139 </span> : PatchList<ITEM, TAG> PatchList<ITEM, TAG>::getReverse() const -<span class="lineNum"> 140 </span> : { -<span class="lineNum"> 141 </span> : PatchList<ITEM, TAG> res; -<span class="lineNum"> 142 </span> : for (typename PatchList<ITEM, TAG>::const_iterator i = this->begin(); -<span class="lineNum"> 143 </span> : i != this->end(); i++) -<span class="lineNum"> 144 </span> : res.addPatch(i->second.getReverse()); -<span class="lineNum"> 145 </span> : return res; -<span class="lineNum"> 146 </span> : } -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : template<typename ITEM, typename TAG> template<typename OUT> -<span class="lineNum"> 149 </span> : void PatchList<ITEM, TAG>::output(OUT out) const -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span><span class="lineCov"> 6 : for (typename PatchList<ITEM, TAG>::const_iterator i = this->begin();</span> -<span class="lineNum"> 152 </span> : i != this->end(); ++i) -<span class="lineNum"> 153 </span> : { -<span class="lineNum"> 154 </span><span class="lineCov"> 3 : *out = i->second;</span> -<span class="lineNum"> 155 </span><span class="lineCov"> 3 : ++out;</span> -<span class="lineNum"> 156 </span> : } -<span class="lineNum"> 157 </span><span class="lineCov"> 3 : }</span> -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span><span class="lineCov"> 6 : }</span> -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : #endif -<span class="lineNum"> 163 </span> : -<span class="lineNum"> 164 </span> : // vim:set ts=4 sw=4: -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/index.html deleted file mode 100644 index fdf6159..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/index.html +++ /dev/null @@ -1,83 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/stream</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/stream</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="sink.h.gcov.html">sink.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">8 / 8 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h.gcov.html deleted file mode 100644 index 159f2ea..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h.gcov.html +++ /dev/null @@ -1,150 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/stream/sink.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/stream</a> - sink.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_STREAM_SINK_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_STREAM_SINK_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Consumer interface for a stream of tagged items -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <wibble/mixin.h> -<span class="lineNum"> 27 </span> : #include <utility> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : namespace stream { -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : /** -<span class="lineNum"> 33 </span> : * Consumer that discards its input -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : class Sink : public wibble::mixin::OutputIterator<Sink> -<span class="lineNum"> 36 </span> : { -<span class="lineNum"> 37 </span> : public: -<span class="lineNum"> 38 </span> : template<typename Data> -<span class="lineNum"> 39 </span> : const Sink& operator=(const Data&) const { return *this; } -<span class="lineNum"> 40 </span> : }; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : inline Sink sink() -<span class="lineNum"> 43 </span> : { -<span class="lineNum"> 44 </span> : return Sink(); -<span class="lineNum"> 45 </span> : } -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : -<span class="lineNum"> 48 </span> : /** -<span class="lineNum"> 49 </span> : * Consumer that discards its input -<span class="lineNum"> 50 </span> : */ -<span class="lineNum"> 51 </span> : template<typename COUNTER> -<span class="lineNum"> 52 </span> : class CountingSink : public wibble::mixin::OutputIterator< CountingSink<COUNTER> > -<span class="lineNum"> 53 </span> : { -<span class="lineNum"> 54 </span> : COUNTER& countItems; -<span class="lineNum"> 55 </span> : COUNTER& countTags; -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : public: -<span class="lineNum"> 58 </span><span class="lineCov"> 2 : CountingSink(COUNTER& countItems, COUNTER& countTags) :</span> -<span class="lineNum"> 59 </span><span class="lineCov"> 2 : countItems(countItems), countTags(countTags) {}</span> -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : // TODO: see if there's a way of implementing the count using size() when -<span class="lineNum"> 62 </span> : // the method actually exists -<span class="lineNum"> 63 </span> : template<typename ITEMS, typename TAGS> -<span class="lineNum"> 64 </span><span class="lineCov"> 42266 : CountingSink& operator=(const std::pair<ITEMS, TAGS>& data)</span> -<span class="lineNum"> 65 </span> : { -<span class="lineNum"> 66 </span><span class="lineCov"> 42266 : countItems += data.first.size();</span> -<span class="lineNum"> 67 </span><span class="lineCov"> 42266 : countTags += data.second.size();</span> -<span class="lineNum"> 68 </span><span class="lineCov"> 42266 : return *this;</span> -<span class="lineNum"> 69 </span> : } -<span class="lineNum"> 70 </span> : }; -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : template<typename COUNTER> -<span class="lineNum"> 73 </span><span class="lineCov"> 2 : inline CountingSink<COUNTER> countingSink(COUNTER& countItems, COUNTER& countTags)</span> -<span class="lineNum"> 74 </span> : { -<span class="lineNum"> 75 </span><span class="lineCov"> 2 : return CountingSink<COUNTER>(countItems, countTags);</span> -<span class="lineNum"> 76 </span> : } -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : -<span class="lineNum"> 79 </span> : } -<span class="lineNum"> 80 </span> : } -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 83 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/index.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/index.html deleted file mode 100644 index 05577be..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/index.html +++ /dev/null @@ -1,83 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/utils</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - /usr/include/tagcoll-2.0.11/tagcoll/utils</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">83.3 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="set.h.gcov.html">set.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../../../emerald.png" width=83 height=10 alt="83.3%"><img src="../../../../../snow.png" width=17 height=10 alt="83.3%"></td></tr></table> - </td> - <td class="coverPerHi">83.3 %</td> - <td class="coverNumHi">10 / 12 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h.gcov.html b/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h.gcov.html deleted file mode 100644 index 2ddbb97..0000000 --- a/rep/usr/include/tagcoll-2.0.11/tagcoll/utils/set.h.gcov.html +++ /dev/null @@ -1,155 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/tagcoll-2.0.11/tagcoll/utils/set.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/tagcoll-2.0.11/tagcoll/utils</a> - set.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">12</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">83.3 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">10</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : #ifndef TAGCOLL_UTILS_SET_H -<span class="lineNum"> 2 </span> : #define TAGCOLL_UTILS_SET_H -<span class="lineNum"> 3 </span> : -<span class="lineNum"> 4 </span> : /** \file -<span class="lineNum"> 5 </span> : * Extra useful set operations -<span class="lineNum"> 6 </span> : */ -<span class="lineNum"> 7 </span> : -<span class="lineNum"> 8 </span> : /* -<span class="lineNum"> 9 </span> : * Copyright (C) 2003,2004,2005,2006 Enrico Zini <enrico@debian.org> -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This library is free software; you can redistribute it and/or -<span class="lineNum"> 12 </span> : * modify it under the terms of the GNU Lesser General Public -<span class="lineNum"> 13 </span> : * License as published by the Free Software Foundation; either -<span class="lineNum"> 14 </span> : * version 2.1 of the License, or (at your option) any later version. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * This library is distributed in the hope that it will be useful, -<span class="lineNum"> 17 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 18 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -<span class="lineNum"> 19 </span> : * Lesser General Public License for more details. -<span class="lineNum"> 20 </span> : * -<span class="lineNum"> 21 </span> : * You should have received a copy of the GNU Lesser General Public -<span class="lineNum"> 22 </span> : * License along with this library; if not, write to the Free Software -<span class="lineNum"> 23 </span> : * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA -<span class="lineNum"> 24 </span> : */ -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <wibble/operators.h> -<span class="lineNum"> 27 </span> : #include <set> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace tagcoll { -<span class="lineNum"> 30 </span> : namespace utils { -<span class="lineNum"> 31 </span> : -<span class="lineNum"> 32 </span> : template<typename T> -<span class="lineNum"> 33 </span> : int set_distance(const std::set<T>& set1, const std::set<T>& set2) -<span class="lineNum"> 34 </span> : { -<span class="lineNum"> 35 </span> : int res = 0; -<span class="lineNum"> 36 </span> : int intCount = 0; -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : typename std::set<T>::const_iterator a = set1.begin(); -<span class="lineNum"> 39 </span> : typename std::set<T>::const_iterator b = set2.begin(); -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : while (a != set1.end() || b != set2.end()) -<span class="lineNum"> 42 </span> : if ((b == set2.end()) || (a != set1.end() && *a < *b)) -<span class="lineNum"> 43 </span> : { -<span class="lineNum"> 44 </span> : res++; -<span class="lineNum"> 45 </span> : a++; -<span class="lineNum"> 46 </span> : } -<span class="lineNum"> 47 </span> : else if ((a == set1.end()) || (b != set2.end() && *b < *a)) -<span class="lineNum"> 48 </span> : { -<span class="lineNum"> 49 </span> : res++; -<span class="lineNum"> 50 </span> : b++; -<span class="lineNum"> 51 </span> : } -<span class="lineNum"> 52 </span> : else -<span class="lineNum"> 53 </span> : { -<span class="lineNum"> 54 </span> : a++; -<span class="lineNum"> 55 </span> : b++; -<span class="lineNum"> 56 </span> : intCount++; -<span class="lineNum"> 57 </span> : } -<span class="lineNum"> 58 </span> : -<span class="lineNum"> 59 </span> : return intCount ? res : -1; -<span class="lineNum"> 60 </span> : } -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : template<typename T> -<span class="lineNum"> 63 </span><span class="lineCov"> 1 : bool set_contains(const std::set<T>& set1, const std::set<T>& set2)</span> -<span class="lineNum"> 64 </span> : { -<span class="lineNum"> 65 </span><span class="lineCov"> 1 : typename std::set<T>::const_iterator b = set2.begin();</span> -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span><span class="lineCov"> 574 : for (typename std::set<T>::const_iterator a = set1.begin(); a != set1.end(); ++a)</span> -<span class="lineNum"> 68 </span><span class="lineCov"> 574 : if (b == set2.end())</span> -<span class="lineNum"> 69 </span><span class="lineCov"> 1 : return true;</span> -<span class="lineNum"> 70 </span><span class="lineCov"> 573 : else if (*a == *b)</span> -<span class="lineNum"> 71 </span><span class="lineCov"> 31 : b++;</span> -<span class="lineNum"> 72 </span><span class="lineCov"> 542 : else if (*b < *a)</span> -<span class="lineNum"> 73 </span><span class="lineNoCov"> 0 : return false;</span> -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span><span class="lineNoCov"> 0 : return b == set2.end();</span> -<span class="lineNum"> 76 </span> : } -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : template<typename T> -<span class="lineNum"> 79 </span><span class="lineCov"> 4 : bool set_contains(const std::set<T>& set1, const T& item)</span> -<span class="lineNum"> 80 </span> : { -<span class="lineNum"> 81 </span><span class="lineCov"> 4 : return set1.find(item) != set1.end();</span> -<span class="lineNum"> 82 </span> : } -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : } -<span class="lineNum"> 85 </span> : } -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : // vim:set ts=4 sw=4: -<span class="lineNum"> 88 </span> : #endif -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/base.h.gcov.html b/rep/usr/include/xapian/base.h.gcov.html deleted file mode 100644 index 3717ae6..0000000 --- a/rep/usr/include/xapian/base.h.gcov.html +++ /dev/null @@ -1,239 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/base.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - base.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">45.5 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">5</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /* base.h: Reference-counted pointers -<span class="lineNum"> 2 </span> : * -<span class="lineNum"> 3 </span> : * Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 4 </span> : * Copyright 2002 Ananova Ltd -<span class="lineNum"> 5 </span> : * Copyright 2002,2003,2004,2007 Olly Betts -<span class="lineNum"> 6 </span> : * -<span class="lineNum"> 7 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 8 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 9 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 10 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 11 </span> : * -<span class="lineNum"> 12 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : * GNU General Public License for more details. -<span class="lineNum"> 16 </span> : * -<span class="lineNum"> 17 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 18 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 19 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 20 </span> : * USA -<span class="lineNum"> 21 </span> : */ -<span class="lineNum"> 22 </span> : -<span class="lineNum"> 23 </span> : #ifndef XAPIAN_INCLUDED_BASE_H -<span class="lineNum"> 24 </span> : #define XAPIAN_INCLUDED_BASE_H -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <xapian/deprecated.h> -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : namespace Xapian { -<span class="lineNum"> 29 </span> : namespace Internal { -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /** @internal Reference counted internal classes should inherit from RefCntBase. -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * This gives the object a reference count used by RefCntPtr. -<span class="lineNum"> 34 </span> : */ -<span class="lineNum"> 35 </span> : class RefCntBase { -<span class="lineNum"> 36 </span> : /* Note: We never delete a pointer to a subclass of RefCntBase using -<span class="lineNum"> 37 </span> : * a RefCntBase *, so we don't need a virtual destructor here. -<span class="lineNum"> 38 </span> : */ -<span class="lineNum"> 39 </span> : protected: -<span class="lineNum"> 40 </span> : /** The copy constructor. -<span class="lineNum"> 41 </span> : * -<span class="lineNum"> 42 </span> : * This is protected since it'll only be used by derived classes, -<span class="lineNum"> 43 </span> : * which should only rarely need copying (this is, after all, a -<span class="lineNum"> 44 </span> : * refcount implementation). Sometimes it's needed, though, -<span class="lineNum"> 45 </span> : * since we need to zero ref_count in the copy. -<span class="lineNum"> 46 </span> : */ -<span class="lineNum"> 47 </span> : RefCntBase(const RefCntBase &) : ref_count(0) { } -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : public: -<span class="lineNum"> 50 </span> : /// The constructor, which initialises the ref_count to 0. -<span class="lineNum"> 51 </span> : RefCntBase() : ref_count(0) { } -<span class="lineNum"> 52 </span> : -<span class="lineNum"> 53 </span> : typedef unsigned int ref_count_t; -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : /** The actual reference count. It's mutable so we can have reference -<span class="lineNum"> 56 </span> : * counting work with const pointers. -<span class="lineNum"> 57 </span> : */ -<span class="lineNum"> 58 </span> : mutable ref_count_t ref_count; -<span class="lineNum"> 59 </span> : }; -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : /** @internal A reference-counted pointer. Can be used with any -<span class="lineNum"> 62 </span> : * class derived from RefCntBase, as long as it is allocated -<span class="lineNum"> 63 </span> : * on the heap by new (not new[]!). -<span class="lineNum"> 64 </span> : */ -<span class="lineNum"> 65 </span> : template <class T> -<span class="lineNum"> 66 </span> : class RefCntPtr { -<span class="lineNum"> 67 </span> : private: -<span class="lineNum"> 68 </span> : T *dest; -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : public: -<span class="lineNum"> 71 </span> : T *operator->() const; -<span class="lineNum"> 72 </span> : T &operator*() const; -<span class="lineNum"> 73 </span> : T *get() const; -<span class="lineNum"> 74 </span> : /** Make a RefCntPtr for an object which may already -<span class="lineNum"> 75 </span> : * have reference counted pointers. -<span class="lineNum"> 76 </span> : * -<span class="lineNum"> 77 </span> : * You usually pass in a newly created object, or an object may pass -<span class="lineNum"> 78 </span> : * in "this" to get a RefCntPtr to itself to pass to other classes. -<span class="lineNum"> 79 </span> : * (e.g. a database might pass a newly created postlist a reference -<span class="lineNum"> 80 </span> : * counted pointer to itself.) -<span class="lineNum"> 81 </span> : */ -<span class="lineNum"> 82 </span> : RefCntPtr(T *dest_); -<span class="lineNum"> 83 </span> : RefCntPtr(); -<span class="lineNum"> 84 </span> : RefCntPtr(const RefCntPtr &other); -<span class="lineNum"> 85 </span> : void operator=(const RefCntPtr &other); -<span class="lineNum"> 86 </span> : void operator=(T *dest_); -<span class="lineNum"> 87 </span> : ~RefCntPtr(); -<span class="lineNum"> 88 </span> : -<span class="lineNum"> 89 </span> : template <class U> -<span class="lineNum"> 90 </span> : RefCntPtr(const RefCntPtr<U> &other); -<span class="lineNum"> 91 </span> : }; -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : template <class T> -<span class="lineNum"> 94 </span><span class="lineCov"> 19 : inline RefCntPtr<T>::RefCntPtr(T *dest_) : dest(dest_)</span> -<span class="lineNum"> 95 </span> : { -<span class="lineNum"> 96 </span><span class="lineCov"> 19 : if (dest) ++dest->ref_count;</span> -<span class="lineNum"> 97 </span><span class="lineCov"> 19 : }</span> -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : template <class T> -<span class="lineNum"> 100 </span> : inline RefCntPtr<T>::RefCntPtr() : dest(0) -<span class="lineNum"> 101 </span> : { -<span class="lineNum"> 102 </span> : } -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : template <class T> -<span class="lineNum"> 105 </span> : inline RefCntPtr<T>::RefCntPtr(const RefCntPtr &other) : dest(other.dest) -<span class="lineNum"> 106 </span> : { -<span class="lineNum"> 107 </span> : if (dest) ++dest->ref_count; -<span class="lineNum"> 108 </span> : } -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : template <class T> -<span class="lineNum"> 111 </span> : inline void RefCntPtr<T>::operator=(const RefCntPtr &other) { -<span class="lineNum"> 112 </span> : operator=(other.dest); -<span class="lineNum"> 113 </span> : } -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : template <class T> -<span class="lineNum"> 116 </span> : inline void RefCntPtr<T>::operator=(T *dest_) { -<span class="lineNum"> 117 </span> : // check if we're assigning a pointer to itself -<span class="lineNum"> 118 </span> : if (dest == dest_) return; -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : // copy the new dest in before we delete the old to avoid a small -<span class="lineNum"> 121 </span> : // window in which dest points to a deleted object -<span class="lineNum"> 122 </span> : // FIXME: if pointer assignment isn't atomic, we ought to use locking... -<span class="lineNum"> 123 </span> : T *old_dest = dest; -<span class="lineNum"> 124 </span> : dest = dest_; -<span class="lineNum"> 125 </span> : if (dest) ++dest->ref_count; -<span class="lineNum"> 126 </span> : if (old_dest && --old_dest->ref_count == 0) delete old_dest; -<span class="lineNum"> 127 </span> : } -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : template <class T> -<span class="lineNum"> 130 </span><span class="lineNoCov"> 0 : inline RefCntPtr<T>::~RefCntPtr()</span> -<span class="lineNum"> 131 </span> : { -<span class="lineNum"> 132 </span><span class="lineNoCov"> 0 : if (dest && --dest->ref_count == 0) {</span> -<span class="lineNum"> 133 </span> : // zero before we delete to avoid a small window in which dest points -<span class="lineNum"> 134 </span> : // to a deleted object -<span class="lineNum"> 135 </span> : // FIXME: if pointer assignment isn't atomic, we ought to use locking... -<span class="lineNum"> 136 </span><span class="lineNoCov"> 0 : T * condemned = dest;</span> -<span class="lineNum"> 137 </span><span class="lineNoCov"> 0 : dest = 0;</span> -<span class="lineNum"> 138 </span><span class="lineNoCov"> 0 : delete condemned;</span> -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : template <class T> -<span class="lineNum"> 143 </span> : template <class U> -<span class="lineNum"> 144 </span> : inline -<span class="lineNum"> 145 </span> : RefCntPtr<T>::RefCntPtr(const RefCntPtr<U> &other) -<span class="lineNum"> 146 </span> : : dest(other.get()) -<span class="lineNum"> 147 </span> : { -<span class="lineNum"> 148 </span> : if (dest) ++dest->ref_count; -<span class="lineNum"> 149 </span> : } -<span class="lineNum"> 150 </span> : -<span class="lineNum"> 151 </span> : template <class T> -<span class="lineNum"> 152 </span> : inline T *RefCntPtr<T>::operator->() const -<span class="lineNum"> 153 </span> : { -<span class="lineNum"> 154 </span> : return dest; -<span class="lineNum"> 155 </span> : } -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : template <class T> -<span class="lineNum"> 158 </span> : inline T &RefCntPtr<T>::operator*() const -<span class="lineNum"> 159 </span> : { -<span class="lineNum"> 160 </span> : return *dest; -<span class="lineNum"> 161 </span> : } -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : template <class T> -<span class="lineNum"> 164 </span><span class="lineCov"> 30 : inline T *RefCntPtr<T>::get() const</span> -<span class="lineNum"> 165 </span> : { -<span class="lineNum"> 166 </span><span class="lineCov"> 30 : return dest;</span> -<span class="lineNum"> 167 </span> : } -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : } -<span class="lineNum"> 170 </span> : } -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : #endif /* XAPIAN_INCLUDED_BASE_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/database.h.gcov.html b/rep/usr/include/xapian/database.h.gcov.html deleted file mode 100644 index 2a75331..0000000 --- a/rep/usr/include/xapian/database.h.gcov.html +++ /dev/null @@ -1,803 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/database.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - database.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** \file database.h -<span class="lineNum"> 2 </span> : * \brief API for working with Xapian databases -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 5 </span> : * Copyright 2002 Ananova Ltd -<span class="lineNum"> 6 </span> : * Copyright 2002,2003,2004,2005,2006,2007 Olly Betts -<span class="lineNum"> 7 </span> : * Copyright 2006 Richard Boulton -<span class="lineNum"> 8 </span> : * -<span class="lineNum"> 9 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 10 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 11 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 12 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 13 </span> : * -<span class="lineNum"> 14 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 15 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 16 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 17 </span> : * GNU General Public License for more details. -<span class="lineNum"> 18 </span> : * -<span class="lineNum"> 19 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 20 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 21 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 22 </span> : * USA -<span class="lineNum"> 23 </span> : */ -<span class="lineNum"> 24 </span> : -<span class="lineNum"> 25 </span> : #ifndef XAPIAN_INCLUDED_DATABASE_H -<span class="lineNum"> 26 </span> : #define XAPIAN_INCLUDED_DATABASE_H -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : #include <string> -<span class="lineNum"> 29 </span> : #include <vector> -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : #include <xapian/base.h> -<span class="lineNum"> 32 </span> : #include <xapian/types.h> -<span class="lineNum"> 33 </span> : #include <xapian/positioniterator.h> -<span class="lineNum"> 34 </span> : #include <xapian/postingiterator.h> -<span class="lineNum"> 35 </span> : #include <xapian/termiterator.h> -<span class="lineNum"> 36 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : /// The Xapian library lives in the Xapian namespace. -<span class="lineNum"> 39 </span> : namespace Xapian { -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : class Document; -<span class="lineNum"> 42 </span> : -<span class="lineNum"> 43 </span> : /** This class is used to access a database, or a group of databases. -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * For searching, this class is used in conjunction with an Enquire object. -<span class="lineNum"> 46 </span> : * -<span class="lineNum"> 47 </span> : * @exception InvalidArgumentError will be thrown if an invalid -<span class="lineNum"> 48 </span> : * argument is supplied, for example, an unknown database type. -<span class="lineNum"> 49 </span> : * -<span class="lineNum"> 50 </span> : * @exception DatabaseOpeningError may be thrown if the database cannot -<span class="lineNum"> 51 </span> : * be opened (for example, a required file cannot be found). -<span class="lineNum"> 52 </span> : * -<span class="lineNum"> 53 </span> : * @exception DatabaseVersionError may be thrown if the database is in an -<span class="lineNum"> 54 </span> : * unsupported format (for example, created by a newer version of Xapian -<span class="lineNum"> 55 </span> : * which uses an incompatible format). -<span class="lineNum"> 56 </span> : */ -<span class="lineNum"> 57 </span> : class XAPIAN_VISIBILITY_DEFAULT Database { -<span class="lineNum"> 58 </span> : public: -<span class="lineNum"> 59 </span> : class Internal; -<span class="lineNum"> 60 </span> : /// @private @internal Reference counted internals. -<span class="lineNum"> 61 </span> : std::vector<Xapian::Internal::RefCntPtr<Internal> > internal; -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : /** Add an existing database (or group of databases) to those -<span class="lineNum"> 64 </span> : * accessed by this object. -<span class="lineNum"> 65 </span> : * -<span class="lineNum"> 66 </span> : * @param database the database(s) to add. -<span class="lineNum"> 67 </span> : */ -<span class="lineNum"> 68 </span> : void add_database(const Database & database); -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : /** Create a Database with no databases in. -<span class="lineNum"> 71 </span> : */ -<span class="lineNum"> 72 </span> : Database(); -<span class="lineNum"> 73 </span> : -<span class="lineNum"> 74 </span> : /** Open a Database, automatically determining the database -<span class="lineNum"> 75 </span> : * backend to use. -<span class="lineNum"> 76 </span> : * -<span class="lineNum"> 77 </span> : * @param path directory that the database is stored in. -<span class="lineNum"> 78 </span> : */ -<span class="lineNum"> 79 </span> : explicit Database(const std::string &path); -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : /** @private @internal Create a Database from its internals. -<span class="lineNum"> 82 </span> : */ -<span class="lineNum"> 83 </span> : explicit Database(Internal *internal); -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : /** Destroy this handle on the database. -<span class="lineNum"> 86 </span> : * -<span class="lineNum"> 87 </span> : * If there are no copies of this object remaining, the database(s) -<span class="lineNum"> 88 </span> : * will be closed. -<span class="lineNum"> 89 </span> : */ -<span class="lineNum"> 90 </span> : virtual ~Database(); -<span class="lineNum"> 91 </span> : -<span class="lineNum"> 92 </span> : /** Copying is allowed. The internals are reference counted, so -<span class="lineNum"> 93 </span> : * copying is cheap. -<span class="lineNum"> 94 </span> : */ -<span class="lineNum"> 95 </span> : Database(const Database &other); -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : /** Assignment is allowed. The internals are reference counted, -<span class="lineNum"> 98 </span> : * so assignment is cheap. -<span class="lineNum"> 99 </span> : */ -<span class="lineNum"> 100 </span> : void operator=(const Database &other); -<span class="lineNum"> 101 </span> : -<span class="lineNum"> 102 </span> : /** Re-open the database. -<span class="lineNum"> 103 </span> : * This re-opens the database(s) to the latest available version(s). -<span class="lineNum"> 104 </span> : * It can be used either to make sure the latest results are -<span class="lineNum"> 105 </span> : * returned, or to recover from a Xapian::DatabaseModifiedError. -<span class="lineNum"> 106 </span> : */ -<span class="lineNum"> 107 </span> : void reopen(); -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : /// Return a string describing this object. -<span class="lineNum"> 110 </span> : virtual std::string get_description() const; -<span class="lineNum"> 111 </span> : -<span class="lineNum"> 112 </span> : /** An iterator pointing to the start of the postlist -<span class="lineNum"> 113 </span> : * for a given term. -<span class="lineNum"> 114 </span> : * -<span class="lineNum"> 115 </span> : * If the term name is the empty string, the iterator returned -<span class="lineNum"> 116 </span> : * will list all the documents in the database. Such an iterator -<span class="lineNum"> 117 </span> : * will always return a WDF value of 1, since there is no obvious -<span class="lineNum"> 118 </span> : * meaning for this quantity in this case. -<span class="lineNum"> 119 </span> : */ -<span class="lineNum"> 120 </span> : PostingIterator postlist_begin(const std::string &tname) const; -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : /** Corresponding end iterator to postlist_begin(). -<span class="lineNum"> 123 </span> : */ -<span class="lineNum"> 124 </span><span class="lineCov"> 10 : PostingIterator postlist_end(const std::string &) const {</span> -<span class="lineNum"> 125 </span><span class="lineCov"> 10 : return PostingIterator(NULL);</span> -<span class="lineNum"> 126 </span> : } -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : /** An iterator pointing to the start of the termlist -<span class="lineNum"> 129 </span> : * for a given document. -<span class="lineNum"> 130 </span> : */ -<span class="lineNum"> 131 </span> : TermIterator termlist_begin(Xapian::docid did) const; -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : /** Corresponding end iterator to termlist_begin(). -<span class="lineNum"> 134 </span> : */ -<span class="lineNum"> 135 </span> : TermIterator termlist_end(Xapian::docid) const { -<span class="lineNum"> 136 </span> : return TermIterator(NULL); -<span class="lineNum"> 137 </span> : } -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : /** Does this database have any positional information? */ -<span class="lineNum"> 140 </span> : bool has_positions() const; -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : /** An iterator pointing to the start of the position list -<span class="lineNum"> 143 </span> : * for a given term in a given document. -<span class="lineNum"> 144 </span> : */ -<span class="lineNum"> 145 </span> : PositionIterator positionlist_begin(Xapian::docid did, const std::string &tname) const; -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : /** Corresponding end iterator to positionlist_begin(). -<span class="lineNum"> 148 </span> : */ -<span class="lineNum"> 149 </span> : PositionIterator positionlist_end(Xapian::docid, const std::string &) const { -<span class="lineNum"> 150 </span> : return PositionIterator(NULL); -<span class="lineNum"> 151 </span> : } -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : /** An iterator which runs across all terms in the database. -<span class="lineNum"> 154 </span> : */ -<span class="lineNum"> 155 </span> : TermIterator allterms_begin() const; -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : /** Corresponding end iterator to allterms_begin(). -<span class="lineNum"> 158 </span> : */ -<span class="lineNum"> 159 </span> : TermIterator allterms_end() const { -<span class="lineNum"> 160 </span> : return TermIterator(NULL); -<span class="lineNum"> 161 </span> : } -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : /** An iterator which runs across all terms with a given prefix. -<span class="lineNum"> 164 </span> : * -<span class="lineNum"> 165 </span> : * This is functionally similar to getting an iterator with -<span class="lineNum"> 166 </span> : * allterms_begin() and then calling skip_to(prefix) on that iterator -<span class="lineNum"> 167 </span> : * to move to the start of the prefix, but is more convenient (because -<span class="lineNum"> 168 </span> : * it detects the end of the prefixed terms), and may be more -<span class="lineNum"> 169 </span> : * efficient than simply calling skip_to() after opening the iterator, -<span class="lineNum"> 170 </span> : * particularly for network databases. -<span class="lineNum"> 171 </span> : * -<span class="lineNum"> 172 </span> : * @param prefix The prefix to restrict the returned terms to. -<span class="lineNum"> 173 </span> : */ -<span class="lineNum"> 174 </span> : TermIterator allterms_begin(const std::string & prefix) const; -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span> : /** Corresponding end iterator to allterms_begin(prefix). -<span class="lineNum"> 177 </span> : */ -<span class="lineNum"> 178 </span><span class="lineCov"> 1 : TermIterator allterms_end(const std::string &) const {</span> -<span class="lineNum"> 179 </span><span class="lineCov"> 1 : return TermIterator(NULL);</span> -<span class="lineNum"> 180 </span> : } -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : /// Get the number of documents in the database. -<span class="lineNum"> 183 </span> : Xapian::doccount get_doccount() const; -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : /// Get the highest document id which has been used in the database. -<span class="lineNum"> 186 </span> : Xapian::docid get_lastdocid() const; -<span class="lineNum"> 187 </span> : -<span class="lineNum"> 188 </span> : /// Get the average length of the documents in the database. -<span class="lineNum"> 189 </span> : Xapian::doclength get_avlength() const; -<span class="lineNum"> 190 </span> : -<span class="lineNum"> 191 </span> : /// Get the number of documents in the database indexed by a given term. -<span class="lineNum"> 192 </span> : Xapian::doccount get_termfreq(const std::string & tname) const; -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : /** Check if a given term exists in the database. -<span class="lineNum"> 195 </span> : * -<span class="lineNum"> 196 </span> : * Return true if and only if the term exists in the database. -<span class="lineNum"> 197 </span> : * This is the same as (get_termfreq(tname) != 0), but will often be -<span class="lineNum"> 198 </span> : * more efficient. -<span class="lineNum"> 199 </span> : */ -<span class="lineNum"> 200 </span> : bool term_exists(const std::string & tname) const; -<span class="lineNum"> 201 </span> : -<span class="lineNum"> 202 </span> : /** Return the total number of occurrences of the given term. -<span class="lineNum"> 203 </span> : * -<span class="lineNum"> 204 </span> : * This is the sum of the number of occurrences of the term in each -<span class="lineNum"> 205 </span> : * document it indexes: i.e., the sum of the within document -<span class="lineNum"> 206 </span> : * frequencies of the term. -<span class="lineNum"> 207 </span> : * -<span class="lineNum"> 208 </span> : * @param tname The term whose collection frequency is being -<span class="lineNum"> 209 </span> : * requested. -<span class="lineNum"> 210 </span> : */ -<span class="lineNum"> 211 </span> : Xapian::termcount get_collection_freq(const std::string & tname) const; -<span class="lineNum"> 212 </span> : -<span class="lineNum"> 213 </span> : /** Get the length of a document. -<span class="lineNum"> 214 </span> : */ -<span class="lineNum"> 215 </span> : Xapian::doclength get_doclength(Xapian::docid did) const; -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : /** Send a "keep-alive" to remote databases to stop them timing -<span class="lineNum"> 218 </span> : * out. -<span class="lineNum"> 219 </span> : */ -<span class="lineNum"> 220 </span> : void keep_alive(); -<span class="lineNum"> 221 </span> : -<span class="lineNum"> 222 </span> : /** Get a document from the database, given its document id. -<span class="lineNum"> 223 </span> : * -<span class="lineNum"> 224 </span> : * This method returns a Xapian::Document object which provides the -<span class="lineNum"> 225 </span> : * information about a document. -<span class="lineNum"> 226 </span> : * -<span class="lineNum"> 227 </span> : * @param did The document id for which to retrieve the data. -<span class="lineNum"> 228 </span> : * -<span class="lineNum"> 229 </span> : * @return A Xapian::Document object containing the document data -<span class="lineNum"> 230 </span> : * -<span class="lineNum"> 231 </span> : * @exception Xapian::DocNotFoundError The document specified -<span class="lineNum"> 232 </span> : * could not be found in the database. -<span class="lineNum"> 233 </span> : */ -<span class="lineNum"> 234 </span> : Xapian::Document get_document(Xapian::docid did) const; -<span class="lineNum"> 235 </span> : -<span class="lineNum"> 236 </span> : /** Suggest a spelling correction. -<span class="lineNum"> 237 </span> : * -<span class="lineNum"> 238 </span> : * @param word The potentially misspelled word. -<span class="lineNum"> 239 </span> : * @param max_edit_distance Only consider words which are at most -<span class="lineNum"> 240 </span> : * @a max_edit_distance edits from @a word. An edit is a -<span class="lineNum"> 241 </span> : * character insertion, deletion, or the transposition of two -<span class="lineNum"> 242 </span> : * adjacent characters (default is 2). -<span class="lineNum"> 243 </span> : */ -<span class="lineNum"> 244 </span> : std::string get_spelling_suggestion(const std::string &word, -<span class="lineNum"> 245 </span> : unsigned max_edit_distance = 2) const; -<span class="lineNum"> 246 </span> : -<span class="lineNum"> 247 </span> : /** An iterator which returns all the spelling correction targets. -<span class="lineNum"> 248 </span> : * -<span class="lineNum"> 249 </span> : * This returns all the words which are considered as targets for the -<span class="lineNum"> 250 </span> : * spelling correction algorithm. The frequency of each word is -<span class="lineNum"> 251 </span> : * available as the term frequency of each entry in the returned -<span class="lineNum"> 252 </span> : * iterator. -<span class="lineNum"> 253 </span> : */ -<span class="lineNum"> 254 </span> : Xapian::TermIterator spellings_begin() const; -<span class="lineNum"> 255 </span> : -<span class="lineNum"> 256 </span> : /// Corresponding end iterator to spellings_begin(). -<span class="lineNum"> 257 </span> : Xapian::TermIterator spellings_end() const { -<span class="lineNum"> 258 </span> : return Xapian::TermIterator(NULL); -<span class="lineNum"> 259 </span> : } -<span class="lineNum"> 260 </span> : -<span class="lineNum"> 261 </span> : /** An iterator which returns all the synonyms for a given term. -<span class="lineNum"> 262 </span> : * -<span class="lineNum"> 263 </span> : * @param term The term to return synonyms for. -<span class="lineNum"> 264 </span> : */ -<span class="lineNum"> 265 </span> : Xapian::TermIterator synonyms_begin(const std::string &term) const; -<span class="lineNum"> 266 </span> : -<span class="lineNum"> 267 </span> : /// Corresponding end iterator to synonyms_begin(term). -<span class="lineNum"> 268 </span> : Xapian::TermIterator synonyms_end(const std::string &) const { -<span class="lineNum"> 269 </span> : return Xapian::TermIterator(NULL); -<span class="lineNum"> 270 </span> : } -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : /** An iterator which returns all terms which have synonyms. -<span class="lineNum"> 273 </span> : * -<span class="lineNum"> 274 </span> : * @param prefix If non-empty, only terms with this prefix are -<span class="lineNum"> 275 </span> : * returned. -<span class="lineNum"> 276 </span> : */ -<span class="lineNum"> 277 </span> : Xapian::TermIterator synonym_keys_begin(const std::string &prefix = "") const; -<span class="lineNum"> 278 </span> : -<span class="lineNum"> 279 </span> : /// Corresponding end iterator to synonym_keys_begin(prefix). -<span class="lineNum"> 280 </span> : Xapian::TermIterator synonym_keys_end(const std::string & = "") const { -<span class="lineNum"> 281 </span> : return Xapian::TermIterator(NULL); -<span class="lineNum"> 282 </span> : } -<span class="lineNum"> 283 </span> : -<span class="lineNum"> 284 </span> : /** Get the user-specified metadata associated with a given key. -<span class="lineNum"> 285 </span> : * -<span class="lineNum"> 286 </span> : * User-specified metadata allows you to store arbitrary information -<span class="lineNum"> 287 </span> : * in the form of (key,tag) pairs. See @a -<span class="lineNum"> 288 </span> : * WritableDatabase::set_metadata() for more information. -<span class="lineNum"> 289 </span> : * -<span class="lineNum"> 290 </span> : * When invoked on a Xapian::Database object representing multiple -<span class="lineNum"> 291 </span> : * databases, currently only the metadata for the first is considered -<span class="lineNum"> 292 </span> : * but this behaviour may change in the future. -<span class="lineNum"> 293 </span> : * -<span class="lineNum"> 294 </span> : * If there is no piece of metadata associated with the specified -<span class="lineNum"> 295 </span> : * key, an empty string is returned (this applies even for backends -<span class="lineNum"> 296 </span> : * which don't support metadata). -<span class="lineNum"> 297 </span> : * -<span class="lineNum"> 298 </span> : * Empty keys are not valid, and specifying one will cause an -<span class="lineNum"> 299 </span> : * exception. -<span class="lineNum"> 300 </span> : * -<span class="lineNum"> 301 </span> : * @param key The key of the metadata item to access. -<span class="lineNum"> 302 </span> : * -<span class="lineNum"> 303 </span> : * @return The retrieved metadata item's value. -<span class="lineNum"> 304 </span> : * -<span class="lineNum"> 305 </span> : * @exception Xapian::InvalidArgumentError will be thrown if the -<span class="lineNum"> 306 </span> : * key supplied is empty. -<span class="lineNum"> 307 </span> : * -<span class="lineNum"> 308 </span> : * @exception Xapian::UnimplementedError will be thrown if the -<span class="lineNum"> 309 </span> : * database backend in use doesn't support user-specified -<span class="lineNum"> 310 </span> : * metadata. -<span class="lineNum"> 311 </span> : */ -<span class="lineNum"> 312 </span> : std::string get_metadata(const std::string & key) const; -<span class="lineNum"> 313 </span> : }; -<span class="lineNum"> 314 </span> : -<span class="lineNum"> 315 </span> : /** This class provides read/write access to a database. -<span class="lineNum"> 316 </span> : */ -<span class="lineNum"> 317 </span> : class XAPIAN_VISIBILITY_DEFAULT WritableDatabase : public Database { -<span class="lineNum"> 318 </span> : public: -<span class="lineNum"> 319 </span> : /** Destroy this handle on the database. -<span class="lineNum"> 320 </span> : * -<span class="lineNum"> 321 </span> : * If there are no copies of this object remaining, the database -<span class="lineNum"> 322 </span> : * will be closed. If there are any transactions in progress -<span class="lineNum"> 323 </span> : * these will be aborted as if cancel_transaction had been called. -<span class="lineNum"> 324 </span> : */ -<span class="lineNum"> 325 </span> : virtual ~WritableDatabase(); -<span class="lineNum"> 326 </span> : -<span class="lineNum"> 327 </span> : /** Create an empty WritableDatabase. -<span class="lineNum"> 328 </span> : */ -<span class="lineNum"> 329 </span> : WritableDatabase(); -<span class="lineNum"> 330 </span> : -<span class="lineNum"> 331 </span> : /** Open a database for update, automatically determining the database -<span class="lineNum"> 332 </span> : * backend to use. -<span class="lineNum"> 333 </span> : * -<span class="lineNum"> 334 </span> : * If the database is to be created, Xapian will try -<span class="lineNum"> 335 </span> : * to create the directory indicated by path if it doesn't already -<span class="lineNum"> 336 </span> : * exist (but only the leaf directory, not recursively). -<span class="lineNum"> 337 </span> : * -<span class="lineNum"> 338 </span> : * @param path directory that the database is stored in. -<span class="lineNum"> 339 </span> : * @param action one of: -<span class="lineNum"> 340 </span> : * - Xapian::DB_CREATE_OR_OPEN open for read/write; create if no db -<span class="lineNum"> 341 </span> : * exists -<span class="lineNum"> 342 </span> : * - Xapian::DB_CREATE create new database; fail if db exists -<span class="lineNum"> 343 </span> : * - Xapian::DB_CREATE_OR_OVERWRITE overwrite existing db; create if -<span class="lineNum"> 344 </span> : * none exists -<span class="lineNum"> 345 </span> : * - Xapian::DB_OPEN open for read/write; fail if no db exists -<span class="lineNum"> 346 </span> : */ -<span class="lineNum"> 347 </span> : WritableDatabase(const std::string &path, int action); -<span class="lineNum"> 348 </span> : -<span class="lineNum"> 349 </span> : /** @private @internal Create an WritableDatabase given its internals. -<span class="lineNum"> 350 </span> : */ -<span class="lineNum"> 351 </span> : explicit WritableDatabase(Database::Internal *internal); -<span class="lineNum"> 352 </span> : -<span class="lineNum"> 353 </span> : /** Copying is allowed. The internals are reference counted, so -<span class="lineNum"> 354 </span> : * copying is cheap. -<span class="lineNum"> 355 </span> : */ -<span class="lineNum"> 356 </span> : WritableDatabase(const WritableDatabase &other); -<span class="lineNum"> 357 </span> : -<span class="lineNum"> 358 </span> : /** Assignment is allowed. The internals are reference counted, -<span class="lineNum"> 359 </span> : * so assignment is cheap. -<span class="lineNum"> 360 </span> : * -<span class="lineNum"> 361 </span> : * Note that only an WritableDatabase may be assigned to an -<span class="lineNum"> 362 </span> : * WritableDatabase: an attempt to assign a Database is caught -<span class="lineNum"> 363 </span> : * at compile-time. -<span class="lineNum"> 364 </span> : */ -<span class="lineNum"> 365 </span> : void operator=(const WritableDatabase &other); -<span class="lineNum"> 366 </span> : -<span class="lineNum"> 367 </span> : /** Flush to disk any modifications made to the database. -<span class="lineNum"> 368 </span> : * -<span class="lineNum"> 369 </span> : * For efficiency reasons, when performing multiple updates to a -<span class="lineNum"> 370 </span> : * database it is best (indeed, almost essential) to make as many -<span class="lineNum"> 371 </span> : * modifications as memory will permit in a single pass through -<span class="lineNum"> 372 </span> : * the database. To ensure this, Xapian batches up modifications. -<span class="lineNum"> 373 </span> : * -<span class="lineNum"> 374 </span> : * Flush may be called at any time to -<span class="lineNum"> 375 </span> : * ensure that the modifications which have been made are written to -<span class="lineNum"> 376 </span> : * disk: if the flush succeeds, all the preceding modifications will -<span class="lineNum"> 377 </span> : * have been written to disk. -<span class="lineNum"> 378 </span> : * -<span class="lineNum"> 379 </span> : * If any of the modifications fail, an exception will be thrown and -<span class="lineNum"> 380 </span> : * the database will be left in a state in which each separate -<span class="lineNum"> 381 </span> : * addition, replacement or deletion operation has either been fully -<span class="lineNum"> 382 </span> : * performed or not performed at all: it is then up to the -<span class="lineNum"> 383 </span> : * application to work out which operations need to be repeated. -<span class="lineNum"> 384 </span> : * -<span class="lineNum"> 385 </span> : * It's not valid to call flush within a transaction. -<span class="lineNum"> 386 </span> : * -<span class="lineNum"> 387 </span> : * Beware of calling flush too frequently: this will have a severe -<span class="lineNum"> 388 </span> : * performance cost. -<span class="lineNum"> 389 </span> : * -<span class="lineNum"> 390 </span> : * Note that flush need not be called explicitly: it will be called -<span class="lineNum"> 391 </span> : * automatically when the database is closed, or when a sufficient -<span class="lineNum"> 392 </span> : * number of modifications have been made. -<span class="lineNum"> 393 </span> : * -<span class="lineNum"> 394 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 395 </span> : * while modifying the database. -<span class="lineNum"> 396 </span> : * -<span class="lineNum"> 397 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 398 </span> : * database is in a corrupt state. -<span class="lineNum"> 399 </span> : * -<span class="lineNum"> 400 </span> : * @exception Xapian::DatabaseLockError will be thrown if a lock -<span class="lineNum"> 401 </span> : * couldn't be acquired on the database. -<span class="lineNum"> 402 </span> : */ -<span class="lineNum"> 403 </span> : void flush(); -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : /** Begin a transaction. -<span class="lineNum"> 406 </span> : * -<span class="lineNum"> 407 </span> : * In Xapian a transaction is a group of modifications to the database -<span class="lineNum"> 408 </span> : * which are linked such that either all will be applied -<span class="lineNum"> 409 </span> : * simultaneously or none will be applied at all. Even in the case of -<span class="lineNum"> 410 </span> : * a power failure, this characteristic should be preserved (as long -<span class="lineNum"> 411 </span> : * as the filesystem isn't corrupted, etc). -<span class="lineNum"> 412 </span> : * -<span class="lineNum"> 413 </span> : * A transaction is started with begin_transaction() and can -<span class="lineNum"> 414 </span> : * either be committed by calling commit_transaction() or aborted -<span class="lineNum"> 415 </span> : * by calling cancel_transaction(). -<span class="lineNum"> 416 </span> : * -<span class="lineNum"> 417 </span> : * By default, a transaction implicitly calls flush before and after -<span class="lineNum"> 418 </span> : * so that the modifications stand and fall without affecting -<span class="lineNum"> 419 </span> : * modifications before or after. -<span class="lineNum"> 420 </span> : * -<span class="lineNum"> 421 </span> : * The downside of this flushing is that small transactions cause -<span class="lineNum"> 422 </span> : * modifications to be frequently flushed which can harm indexing -<span class="lineNum"> 423 </span> : * performance in the same way that explicitly calling flush -<span class="lineNum"> 424 </span> : * frequently can. -<span class="lineNum"> 425 </span> : * -<span class="lineNum"> 426 </span> : * If you're applying atomic groups of changes and only wish to -<span class="lineNum"> 427 </span> : * ensure that each group is either applied or not applied, then -<span class="lineNum"> 428 </span> : * you can prevent the automatic flush before and after the -<span class="lineNum"> 429 </span> : * transaction by starting the transaction with -<span class="lineNum"> 430 </span> : * begin_transaction(false). However, if cancel_transaction is -<span class="lineNum"> 431 </span> : * called (or if commit_transaction isn't called before the -<span class="lineNum"> 432 </span> : * WritableDatabase object is destroyed) then any changes which -<span class="lineNum"> 433 </span> : * were pending before the transaction began will also be discarded. -<span class="lineNum"> 434 </span> : * -<span class="lineNum"> 435 </span> : * Transactions aren't currently supported by the InMemory backend. -<span class="lineNum"> 436 </span> : * -<span class="lineNum"> 437 </span> : * @exception Xapian::UnimplementedError will be thrown if transactions -<span class="lineNum"> 438 </span> : * are not available for this database type. -<span class="lineNum"> 439 </span> : * -<span class="lineNum"> 440 </span> : * @exception Xapian::InvalidOperationError will be thrown if this is -<span class="lineNum"> 441 </span> : * called at an invalid time, such as when a transaction -<span class="lineNum"> 442 </span> : * is already in progress. -<span class="lineNum"> 443 </span> : */ -<span class="lineNum"> 444 </span> : void begin_transaction(bool flushed=true); -<span class="lineNum"> 445 </span> : -<span class="lineNum"> 446 </span> : /** Complete the transaction currently in progress. -<span class="lineNum"> 447 </span> : * -<span class="lineNum"> 448 </span> : * If this method completes successfully and this is a flushed -<span class="lineNum"> 449 </span> : * transaction, all the database modifications -<span class="lineNum"> 450 </span> : * made during the transaction will have been committed to the -<span class="lineNum"> 451 </span> : * database. -<span class="lineNum"> 452 </span> : * -<span class="lineNum"> 453 </span> : * If an error occurs, an exception will be thrown, and none of -<span class="lineNum"> 454 </span> : * the modifications made to the database during the transaction -<span class="lineNum"> 455 </span> : * will have been applied to the database. -<span class="lineNum"> 456 </span> : * -<span class="lineNum"> 457 </span> : * In all cases the transaction will no longer be in progress. -<span class="lineNum"> 458 </span> : * -<span class="lineNum"> 459 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 460 </span> : * while modifying the database. -<span class="lineNum"> 461 </span> : * -<span class="lineNum"> 462 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 463 </span> : * database is in a corrupt state. -<span class="lineNum"> 464 </span> : * -<span class="lineNum"> 465 </span> : * @exception Xapian::InvalidOperationError will be thrown if a -<span class="lineNum"> 466 </span> : * transaction is not currently in progress. -<span class="lineNum"> 467 </span> : * -<span class="lineNum"> 468 </span> : * @exception Xapian::UnimplementedError will be thrown if transactions -<span class="lineNum"> 469 </span> : * are not available for this database type. -<span class="lineNum"> 470 </span> : */ -<span class="lineNum"> 471 </span> : void commit_transaction(); -<span class="lineNum"> 472 </span> : -<span class="lineNum"> 473 </span> : /** Abort the transaction currently in progress, discarding the -<span class="lineNum"> 474 </span> : * potential modifications made to the database. -<span class="lineNum"> 475 </span> : * -<span class="lineNum"> 476 </span> : * If an error occurs in this method, an exception will be thrown, -<span class="lineNum"> 477 </span> : * but the transaction will be cancelled anyway. -<span class="lineNum"> 478 </span> : * -<span class="lineNum"> 479 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 480 </span> : * while modifying the database. -<span class="lineNum"> 481 </span> : * -<span class="lineNum"> 482 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 483 </span> : * database is in a corrupt state. -<span class="lineNum"> 484 </span> : * -<span class="lineNum"> 485 </span> : * @exception Xapian::InvalidOperationError will be thrown if a -<span class="lineNum"> 486 </span> : * transaction is not currently in progress. -<span class="lineNum"> 487 </span> : * -<span class="lineNum"> 488 </span> : * @exception Xapian::UnimplementedError will be thrown if transactions -<span class="lineNum"> 489 </span> : * are not available for this database type. -<span class="lineNum"> 490 </span> : */ -<span class="lineNum"> 491 </span> : void cancel_transaction(); -<span class="lineNum"> 492 </span> : -<span class="lineNum"> 493 </span> : /** Add a new document to the database. -<span class="lineNum"> 494 </span> : * -<span class="lineNum"> 495 </span> : * This method adds the specified document to the database, -<span class="lineNum"> 496 </span> : * returning a newly allocated document ID. Automatically allocated -<span class="lineNum"> 497 </span> : * document IDs come from a per-database monotonically increasing -<span class="lineNum"> 498 </span> : * counter, so IDs from deleted documents won't be reused. -<span class="lineNum"> 499 </span> : * -<span class="lineNum"> 500 </span> : * If you want to specify the document ID to be used, you should -<span class="lineNum"> 501 </span> : * call replace_document() instead. -<span class="lineNum"> 502 </span> : * -<span class="lineNum"> 503 </span> : * Note that changes to the database won't be immediately committed to -<span class="lineNum"> 504 </span> : * disk; see flush() for more details. -<span class="lineNum"> 505 </span> : * -<span class="lineNum"> 506 </span> : * As with all database modification operations, the effect is -<span class="lineNum"> 507 </span> : * atomic: the document will either be fully added, or the document -<span class="lineNum"> 508 </span> : * fails to be added and an exception is thrown (possibly at a -<span class="lineNum"> 509 </span> : * later time when flush is called or the database is closed). -<span class="lineNum"> 510 </span> : * -<span class="lineNum"> 511 </span> : * @param document The new document to be added. -<span class="lineNum"> 512 </span> : * -<span class="lineNum"> 513 </span> : * @return The document ID of the newly added document. -<span class="lineNum"> 514 </span> : * -<span class="lineNum"> 515 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 516 </span> : * while writing to the database. -<span class="lineNum"> 517 </span> : * -<span class="lineNum"> 518 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 519 </span> : * database is in a corrupt state. -<span class="lineNum"> 520 </span> : */ -<span class="lineNum"> 521 </span> : Xapian::docid add_document(const Xapian::Document & document); -<span class="lineNum"> 522 </span> : -<span class="lineNum"> 523 </span> : /** Delete a document from the database. -<span class="lineNum"> 524 </span> : * -<span class="lineNum"> 525 </span> : * This method removes the document with the specified document ID -<span class="lineNum"> 526 </span> : * from the database. -<span class="lineNum"> 527 </span> : * -<span class="lineNum"> 528 </span> : * Note that changes to the database won't be immediately committed to -<span class="lineNum"> 529 </span> : * disk; see flush() for more details. -<span class="lineNum"> 530 </span> : * -<span class="lineNum"> 531 </span> : * As with all database modification operations, the effect is -<span class="lineNum"> 532 </span> : * atomic: the document will either be fully removed, or the document -<span class="lineNum"> 533 </span> : * fails to be removed and an exception is thrown (possibly at a -<span class="lineNum"> 534 </span> : * later time when flush is called or the database is closed). -<span class="lineNum"> 535 </span> : * -<span class="lineNum"> 536 </span> : * @param did The document ID of the document to be removed. -<span class="lineNum"> 537 </span> : * -<span class="lineNum"> 538 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 539 </span> : * while writing to the database. -<span class="lineNum"> 540 </span> : * -<span class="lineNum"> 541 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 542 </span> : * database is in a corrupt state. -<span class="lineNum"> 543 </span> : */ -<span class="lineNum"> 544 </span> : void delete_document(Xapian::docid did); -<span class="lineNum"> 545 </span> : -<span class="lineNum"> 546 </span> : /** Delete any documents indexed by a term from the database. -<span class="lineNum"> 547 </span> : * -<span class="lineNum"> 548 </span> : * This method removes any documents indexed by the specified term -<span class="lineNum"> 549 </span> : * from the database. -<span class="lineNum"> 550 </span> : * -<span class="lineNum"> 551 </span> : * A major use is for convenience when UIDs from another system are -<span class="lineNum"> 552 </span> : * mapped to terms in Xapian, although this method has other uses -<span class="lineNum"> 553 </span> : * (for example, you could add a "deletion date" term to documents at -<span class="lineNum"> 554 </span> : * index time and use this method to delete all documents due for -<span class="lineNum"> 555 </span> : * deletion on a particular date). -<span class="lineNum"> 556 </span> : * -<span class="lineNum"> 557 </span> : * @param unique_term The term to remove references to. -<span class="lineNum"> 558 </span> : * -<span class="lineNum"> 559 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 560 </span> : * while writing to the database. -<span class="lineNum"> 561 </span> : * -<span class="lineNum"> 562 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 563 </span> : * database is in a corrupt state. -<span class="lineNum"> 564 </span> : */ -<span class="lineNum"> 565 </span> : void delete_document(const std::string & unique_term); -<span class="lineNum"> 566 </span> : -<span class="lineNum"> 567 </span> : /** Replace a given document in the database. -<span class="lineNum"> 568 </span> : * -<span class="lineNum"> 569 </span> : * This method replaces the document with the specified document ID. -<span class="lineNum"> 570 </span> : * If document ID @a did isn't currently used, the document will be -<span class="lineNum"> 571 </span> : * added with document ID @a did. -<span class="lineNum"> 572 </span> : * -<span class="lineNum"> 573 </span> : * The monotonic counter used for automatically allocating document -<span class="lineNum"> 574 </span> : * IDs is increased so that the next automatically allocated document -<span class="lineNum"> 575 </span> : * ID will be did + 1. Be aware that if you use this method to -<span class="lineNum"> 576 </span> : * specify a high document ID for a new document, and also use -<span class="lineNum"> 577 </span> : * WritableDatabase::add_document(), Xapian may get to a state where -<span class="lineNum"> 578 </span> : * this counter wraps around and will be unable to automatically -<span class="lineNum"> 579 </span> : * allocate document IDs! -<span class="lineNum"> 580 </span> : * -<span class="lineNum"> 581 </span> : * Note that changes to the database won't be immediately committed to -<span class="lineNum"> 582 </span> : * disk; see flush() for more details. -<span class="lineNum"> 583 </span> : * -<span class="lineNum"> 584 </span> : * As with all database modification operations, the effect is -<span class="lineNum"> 585 </span> : * atomic: the document will either be fully replaced, or the document -<span class="lineNum"> 586 </span> : * fails to be replaced and an exception is thrown (possibly at a -<span class="lineNum"> 587 </span> : * later time when flush is called or the database is closed). -<span class="lineNum"> 588 </span> : * -<span class="lineNum"> 589 </span> : * @param did The document ID of the document to be replaced. -<span class="lineNum"> 590 </span> : * @param document The new document. -<span class="lineNum"> 591 </span> : * -<span class="lineNum"> 592 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 593 </span> : * while writing to the database. -<span class="lineNum"> 594 </span> : * -<span class="lineNum"> 595 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 596 </span> : * database is in a corrupt state. -<span class="lineNum"> 597 </span> : */ -<span class="lineNum"> 598 </span> : void replace_document(Xapian::docid did, -<span class="lineNum"> 599 </span> : const Xapian::Document & document); -<span class="lineNum"> 600 </span> : -<span class="lineNum"> 601 </span> : /** Replace any documents matching a term. -<span class="lineNum"> 602 </span> : * -<span class="lineNum"> 603 </span> : * This method replaces any documents indexed by the specified term -<span class="lineNum"> 604 </span> : * with the specified document. If any documents are indexed by the -<span class="lineNum"> 605 </span> : * term, the lowest document ID will be used for the document, -<span class="lineNum"> 606 </span> : * otherwise a new document ID will be generated as for add_document. -<span class="lineNum"> 607 </span> : * -<span class="lineNum"> 608 </span> : * The intended use is to allow UIDs from another system to easily -<span class="lineNum"> 609 </span> : * be mapped to terms in Xapian, although this method probably has -<span class="lineNum"> 610 </span> : * other uses. -<span class="lineNum"> 611 </span> : * -<span class="lineNum"> 612 </span> : * Note that changes to the database won't be immediately committed to -<span class="lineNum"> 613 </span> : * disk; see flush() for more details. -<span class="lineNum"> 614 </span> : * -<span class="lineNum"> 615 </span> : * As with all database modification operations, the effect is -<span class="lineNum"> 616 </span> : * atomic: the document(s) will either be fully replaced, or the -<span class="lineNum"> 617 </span> : * document(s) fail to be replaced and an exception is thrown -<span class="lineNum"> 618 </span> : * (possibly at a -<span class="lineNum"> 619 </span> : * later time when flush is called or the database is closed). -<span class="lineNum"> 620 </span> : * -<span class="lineNum"> 621 </span> : * @param unique_term The "unique" term. -<span class="lineNum"> 622 </span> : * @param document The new document. -<span class="lineNum"> 623 </span> : * -<span class="lineNum"> 624 </span> : * @return The document ID that document was given. -<span class="lineNum"> 625 </span> : * -<span class="lineNum"> 626 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 627 </span> : * while writing to the database. -<span class="lineNum"> 628 </span> : * -<span class="lineNum"> 629 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 630 </span> : * database is in a corrupt state. -<span class="lineNum"> 631 </span> : */ -<span class="lineNum"> 632 </span> : Xapian::docid replace_document(const std::string & unique_term, -<span class="lineNum"> 633 </span> : const Xapian::Document & document); -<span class="lineNum"> 634 </span> : -<span class="lineNum"> 635 </span> : /** Add a word to the spelling dictionary. -<span class="lineNum"> 636 </span> : * -<span class="lineNum"> 637 </span> : * If the word is already present, its frequency is increased. -<span class="lineNum"> 638 </span> : * -<span class="lineNum"> 639 </span> : * @param word The word to add. -<span class="lineNum"> 640 </span> : * @param freqinc How much to increase its frequency by (default 1). -<span class="lineNum"> 641 </span> : */ -<span class="lineNum"> 642 </span> : void add_spelling(const std::string & word, -<span class="lineNum"> 643 </span> : Xapian::termcount freqinc = 1) const; -<span class="lineNum"> 644 </span> : -<span class="lineNum"> 645 </span> : /** Remove a word from the spelling dictionary. -<span class="lineNum"> 646 </span> : * -<span class="lineNum"> 647 </span> : * The word's frequency is decreased, and if would become zero or less -<span class="lineNum"> 648 </span> : * then the word is removed completely. -<span class="lineNum"> 649 </span> : * -<span class="lineNum"> 650 </span> : * @param word The word to remove. -<span class="lineNum"> 651 </span> : * @param freqdec How much to decrease its frequency by (default 1). -<span class="lineNum"> 652 </span> : */ -<span class="lineNum"> 653 </span> : void remove_spelling(const std::string & word, -<span class="lineNum"> 654 </span> : Xapian::termcount freqdec = 1) const; -<span class="lineNum"> 655 </span> : -<span class="lineNum"> 656 </span> : /** Add a synonym for a term. -<span class="lineNum"> 657 </span> : * -<span class="lineNum"> 658 </span> : * If @a synonym is already a synonym for @a term, then no action is -<span class="lineNum"> 659 </span> : * taken. -<span class="lineNum"> 660 </span> : */ -<span class="lineNum"> 661 </span> : void add_synonym(const std::string & term, -<span class="lineNum"> 662 </span> : const std::string & synonym) const; -<span class="lineNum"> 663 </span> : -<span class="lineNum"> 664 </span> : /** Remove a synonym for a term. -<span class="lineNum"> 665 </span> : * -<span class="lineNum"> 666 </span> : * If @a synonym isn't a synonym for @a term, then no action is taken. -<span class="lineNum"> 667 </span> : */ -<span class="lineNum"> 668 </span> : void remove_synonym(const std::string & term, -<span class="lineNum"> 669 </span> : const std::string & synonym) const; -<span class="lineNum"> 670 </span> : -<span class="lineNum"> 671 </span> : /** Remove all synonyms for a term. -<span class="lineNum"> 672 </span> : * -<span class="lineNum"> 673 </span> : * If @a term has no synonyms, no action is taken. -<span class="lineNum"> 674 </span> : */ -<span class="lineNum"> 675 </span> : void clear_synonyms(const std::string & term) const; -<span class="lineNum"> 676 </span> : -<span class="lineNum"> 677 </span> : /** Set the user-specified metadata associated with a given key. -<span class="lineNum"> 678 </span> : * -<span class="lineNum"> 679 </span> : * This method sets the metadata value associated with a given key. -<span class="lineNum"> 680 </span> : * If there is already a metadata value stored in the database with -<span class="lineNum"> 681 </span> : * the same key, the old value is replaced. If you want to delete an -<span class="lineNum"> 682 </span> : * existing item of metadata, just set its value to the empty string. -<span class="lineNum"> 683 </span> : * -<span class="lineNum"> 684 </span> : * User-specified metadata allows you to store arbitrary information -<span class="lineNum"> 685 </span> : * in the form of (key,tag) pairs. -<span class="lineNum"> 686 </span> : * -<span class="lineNum"> 687 </span> : * There's no hard limit on the number of metadata items, or the size -<span class="lineNum"> 688 </span> : * of the metadata values. Metadata keys have a limited length, which -<span class="lineNum"> 689 </span> : * depends on the backend. We recommend limiting them to 200 bytes. -<span class="lineNum"> 690 </span> : * Empty keys are not valid, and specifying one will cause an -<span class="lineNum"> 691 </span> : * exception. -<span class="lineNum"> 692 </span> : * -<span class="lineNum"> 693 </span> : * Metadata modifications are committed to disk in the same way as -<span class="lineNum"> 694 </span> : * modifications to the documents in the database are: i.e., -<span class="lineNum"> 695 </span> : * modifications are atomic, and won't be committed to disk -<span class="lineNum"> 696 </span> : * immediately (see flush() for more details). This allows metadata -<span class="lineNum"> 697 </span> : * to be used to link databases with versioned external resources -<span class="lineNum"> 698 </span> : * by storing the appropriate version number in a metadata item. -<span class="lineNum"> 699 </span> : * -<span class="lineNum"> 700 </span> : * You can also use the metadata to store arbitrary extra information -<span class="lineNum"> 701 </span> : * associated with terms, documents, or postings by encoding the -<span class="lineNum"> 702 </span> : * termname and/or document id into the metadata key. -<span class="lineNum"> 703 </span> : * -<span class="lineNum"> 704 </span> : * @param key The key of the metadata item to set. -<span class="lineNum"> 705 </span> : * -<span class="lineNum"> 706 </span> : * @param value The value of the metadata item to set. -<span class="lineNum"> 707 </span> : * -<span class="lineNum"> 708 </span> : * @exception Xapian::DatabaseError will be thrown if a problem occurs -<span class="lineNum"> 709 </span> : * while writing to the database. -<span class="lineNum"> 710 </span> : * -<span class="lineNum"> 711 </span> : * @exception Xapian::DatabaseCorruptError will be thrown if the -<span class="lineNum"> 712 </span> : * database is in a corrupt state. -<span class="lineNum"> 713 </span> : * -<span class="lineNum"> 714 </span> : * @exception Xapian::InvalidArgumentError will be thrown if the -<span class="lineNum"> 715 </span> : * key supplied is empty. -<span class="lineNum"> 716 </span> : */ -<span class="lineNum"> 717 </span> : void set_metadata(const std::string & key, const std::string & value); -<span class="lineNum"> 718 </span> : -<span class="lineNum"> 719 </span> : /// Return a string describing this object. -<span class="lineNum"> 720 </span> : std::string get_description() const; -<span class="lineNum"> 721 </span> : }; -<span class="lineNum"> 722 </span> : -<span class="lineNum"> 723 </span> : /** Open for read/write; create if no db exists. */ -<span class="lineNum"> 724 </span> : const int DB_CREATE_OR_OPEN = 1; -<span class="lineNum"> 725 </span> : /** Create a new database; fail if db exists. */ -<span class="lineNum"> 726 </span> : const int DB_CREATE = 2; -<span class="lineNum"> 727 </span> : /** Overwrite existing db; create if none exists. */ -<span class="lineNum"> 728 </span> : const int DB_CREATE_OR_OVERWRITE = 3; -<span class="lineNum"> 729 </span> : /** Open for read/write; fail if no db exists. */ -<span class="lineNum"> 730 </span> : const int DB_OPEN = 4; -<span class="lineNum"> 731 </span> : // Can't see any sensible use for this one -<span class="lineNum"> 732 </span> : // const int DB_OVERWRITE = XXX; -<span class="lineNum"> 733 </span> : -<span class="lineNum"> 734 </span> : } -<span class="lineNum"> 735 </span> : -<span class="lineNum"> 736 </span> : #endif /* XAPIAN_INCLUDED_DATABASE_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/document.h.gcov.html b/rep/usr/include/xapian/document.h.gcov.html deleted file mode 100644 index dace408..0000000 --- a/rep/usr/include/xapian/document.h.gcov.html +++ /dev/null @@ -1,267 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/document.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - document.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** \file document.h -<span class="lineNum"> 2 </span> : * \brief API for working with documents -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 5 </span> : * Copyright 2002 Ananova Ltd -<span class="lineNum"> 6 </span> : * Copyright 2002,2003,2004,2006,2007 Olly Betts -<span class="lineNum"> 7 </span> : * -<span class="lineNum"> 8 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 9 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 10 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 11 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 12 </span> : * -<span class="lineNum"> 13 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : * GNU General Public License for more details. -<span class="lineNum"> 17 </span> : * -<span class="lineNum"> 18 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 20 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 21 </span> : * USA -<span class="lineNum"> 22 </span> : */ -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #ifndef XAPIAN_INCLUDED_DOCUMENT_H -<span class="lineNum"> 25 </span> : #define XAPIAN_INCLUDED_DOCUMENT_H -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <string> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : #include <xapian/base.h> -<span class="lineNum"> 30 </span> : #include <xapian/types.h> -<span class="lineNum"> 31 </span> : #include <xapian/termiterator.h> -<span class="lineNum"> 32 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 33 </span> : -<span class="lineNum"> 34 </span> : namespace Xapian { -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : class ValueIterator; -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : /// A document in the database - holds data, values, terms, and postings -<span class="lineNum"> 39 </span> : class XAPIAN_VISIBILITY_DEFAULT Document { -<span class="lineNum"> 40 </span> : public: -<span class="lineNum"> 41 </span> : class Internal; -<span class="lineNum"> 42 </span> : /// @private @internal Reference counted internals. -<span class="lineNum"> 43 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : /** @private @internal Constructor is only used by internal classes. -<span class="lineNum"> 46 </span> : * -<span class="lineNum"> 47 </span> : * @param internal_ pointer to internal opaque class -<span class="lineNum"> 48 </span> : */ -<span class="lineNum"> 49 </span> : explicit Document(Internal *internal_); -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : /** Copying is allowed. The internals are reference counted, so -<span class="lineNum"> 52 </span> : * copying is cheap. -<span class="lineNum"> 53 </span> : */ -<span class="lineNum"> 54 </span> : Document(const Document &other); -<span class="lineNum"> 55 </span> : -<span class="lineNum"> 56 </span> : /** Assignment is allowed. The internals are reference counted, -<span class="lineNum"> 57 </span> : * so assignment is cheap. -<span class="lineNum"> 58 </span> : */ -<span class="lineNum"> 59 </span> : void operator=(const Document &other); -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : /// Make a new empty Document -<span class="lineNum"> 62 </span> : Document(); -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : /// Destructor -<span class="lineNum"> 65 </span> : ~Document(); -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : /** Get value by number. -<span class="lineNum"> 68 </span> : * -<span class="lineNum"> 69 </span> : * Returns an empty string if no value with the given number is present -<span class="lineNum"> 70 </span> : * in the document. -<span class="lineNum"> 71 </span> : * -<span class="lineNum"> 72 </span> : * @param valueno The number of the value. -<span class="lineNum"> 73 </span> : */ -<span class="lineNum"> 74 </span> : std::string get_value(Xapian::valueno valueno) const; -<span class="lineNum"> 75 </span> : -<span class="lineNum"> 76 </span> : /** Add a new value. It will replace any existing value with the -<span class="lineNum"> 77 </span> : * same number. -<span class="lineNum"> 78 </span> : */ -<span class="lineNum"> 79 </span> : void add_value(Xapian::valueno valueno, const std::string &value); -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : /// Remove any value with the given number. -<span class="lineNum"> 82 </span> : void remove_value(Xapian::valueno valueno); -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : /// Remove all values associated with the document. -<span class="lineNum"> 85 </span> : void clear_values(); -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : /** Get data stored in the document. -<span class="lineNum"> 88 </span> : * This is a potentially expensive operation, and shouldn't normally -<span class="lineNum"> 89 </span> : * be used in a match decider functor. Put data for use by match -<span class="lineNum"> 90 </span> : * deciders in a value instead. -<span class="lineNum"> 91 </span> : */ -<span class="lineNum"> 92 </span> : std::string get_data() const; -<span class="lineNum"> 93 </span> : -<span class="lineNum"> 94 </span> : /// Set data stored in the document. -<span class="lineNum"> 95 </span> : void set_data(const std::string &data); -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : /** Add an occurrence of a term at a particular position. -<span class="lineNum"> 98 </span> : * -<span class="lineNum"> 99 </span> : * Multiple occurrences of the term at the same position are -<span class="lineNum"> 100 </span> : * represented only once in the positional information, but do -<span class="lineNum"> 101 </span> : * increase the wdf. -<span class="lineNum"> 102 </span> : * -<span class="lineNum"> 103 </span> : * If the term is not already in the document, it will be added to -<span class="lineNum"> 104 </span> : * it. -<span class="lineNum"> 105 </span> : * -<span class="lineNum"> 106 </span> : * @param tname The name of the term. -<span class="lineNum"> 107 </span> : * @param tpos The position of the term. -<span class="lineNum"> 108 </span> : * @param wdfinc The increment that will be applied to the wdf -<span class="lineNum"> 109 </span> : * for this term. -<span class="lineNum"> 110 </span> : */ -<span class="lineNum"> 111 </span> : void add_posting(const std::string & tname, -<span class="lineNum"> 112 </span> : Xapian::termpos tpos, -<span class="lineNum"> 113 </span> : Xapian::termcount wdfinc = 1); -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : /** Add a term to the document, without positional information. -<span class="lineNum"> 116 </span> : * -<span class="lineNum"> 117 </span> : * Any existing positional information for the term will be left -<span class="lineNum"> 118 </span> : * unmodified. -<span class="lineNum"> 119 </span> : * -<span class="lineNum"> 120 </span> : * @param tname The name of the term. -<span class="lineNum"> 121 </span> : * @param wdfinc The increment that will be applied to the wdf -<span class="lineNum"> 122 </span> : * for this term. -<span class="lineNum"> 123 </span> : */ -<span class="lineNum"> 124 </span> : void add_term(const std::string & tname, Xapian::termcount wdfinc = 1); -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : /** Remove a posting of a term from the document. -<span class="lineNum"> 127 </span> : * -<span class="lineNum"> 128 </span> : * Note that the term will still index the document even if all -<span class="lineNum"> 129 </span> : * occurrences are removed. To remove a term from a document -<span class="lineNum"> 130 </span> : * completely, use remove_term(). -<span class="lineNum"> 131 </span> : * -<span class="lineNum"> 132 </span> : * @param tname The name of the term. -<span class="lineNum"> 133 </span> : * @param tpos The position of the term. -<span class="lineNum"> 134 </span> : * @param wdfdec The decrement that will be applied to the wdf -<span class="lineNum"> 135 </span> : * when removing this posting. The wdf will not go -<span class="lineNum"> 136 </span> : * below the value of 0. -<span class="lineNum"> 137 </span> : * -<span class="lineNum"> 138 </span> : * @exception Xapian::InvalidArgumentError will be thrown if the term -<span class="lineNum"> 139 </span> : * is not at the position specified in the position list for this term -<span class="lineNum"> 140 </span> : * in this document. -<span class="lineNum"> 141 </span> : * -<span class="lineNum"> 142 </span> : * @exception Xapian::InvalidArgumentError will be thrown if the term -<span class="lineNum"> 143 </span> : * is not in the document -<span class="lineNum"> 144 </span> : */ -<span class="lineNum"> 145 </span> : void remove_posting(const std::string & tname, -<span class="lineNum"> 146 </span> : Xapian::termpos tpos, -<span class="lineNum"> 147 </span> : Xapian::termcount wdfdec = 1); -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : /** Remove a term and all postings associated with it. -<span class="lineNum"> 150 </span> : * -<span class="lineNum"> 151 </span> : * @param tname The name of the term. -<span class="lineNum"> 152 </span> : * -<span class="lineNum"> 153 </span> : * @exception Xapian::InvalidArgumentError will be thrown if the term -<span class="lineNum"> 154 </span> : * is not in the document -<span class="lineNum"> 155 </span> : */ -<span class="lineNum"> 156 </span> : void remove_term(const std::string & tname); -<span class="lineNum"> 157 </span> : -<span class="lineNum"> 158 </span> : /// Remove all terms (and postings) from the document. -<span class="lineNum"> 159 </span> : void clear_terms(); -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : /** The length of the termlist - i.e. the number of different terms -<span class="lineNum"> 162 </span> : * which index this document. -<span class="lineNum"> 163 </span> : */ -<span class="lineNum"> 164 </span> : Xapian::termcount termlist_count() const; -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : /// Iterator for the terms in this document. -<span class="lineNum"> 167 </span> : TermIterator termlist_begin() const; -<span class="lineNum"> 168 </span> : -<span class="lineNum"> 169 </span> : /// Equivalent end iterator for termlist_begin(). -<span class="lineNum"> 170 </span><span class="lineNoCov"> 0 : TermIterator termlist_end() const {</span> -<span class="lineNum"> 171 </span><span class="lineNoCov"> 0 : return TermIterator(NULL);</span> -<span class="lineNum"> 172 </span> : } -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : /// Count the values in this document. -<span class="lineNum"> 175 </span> : Xapian::termcount values_count() const; -<span class="lineNum"> 176 </span> : -<span class="lineNum"> 177 </span> : /// Iterator for the values in this document. -<span class="lineNum"> 178 </span> : ValueIterator values_begin() const; -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : /// Equivalent end iterator for values_begin(). -<span class="lineNum"> 181 </span> : ValueIterator values_end() const; -<span class="lineNum"> 182 </span> : -<span class="lineNum"> 183 </span> : /** Get the document id which is associated with this document (if any). -<span class="lineNum"> 184 </span> : * -<span class="lineNum"> 185 </span> : * NB If multiple databases are being searched together, then this -<span class="lineNum"> 186 </span> : * will be the document id in the individual database, not the merged -<span class="lineNum"> 187 </span> : * database! -<span class="lineNum"> 188 </span> : * -<span class="lineNum"> 189 </span> : * @return If this document came from a database, return the document -<span class="lineNum"> 190 </span> : * id in that database. Otherwise, return 0. -<span class="lineNum"> 191 </span> : */ -<span class="lineNum"> 192 </span> : docid get_docid() const; -<span class="lineNum"> 193 </span> : -<span class="lineNum"> 194 </span> : /// Return a string describing this object. -<span class="lineNum"> 195 </span> : std::string get_description() const; -<span class="lineNum"> 196 </span> : }; -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : } -<span class="lineNum"> 199 </span> : -<span class="lineNum"> 200 </span> : #endif // XAPIAN_INCLUDED_DOCUMENT_H -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/enquire.h.gcov.html b/rep/usr/include/xapian/enquire.h.gcov.html deleted file mode 100644 index 15ca5f0..0000000 --- a/rep/usr/include/xapian/enquire.h.gcov.html +++ /dev/null @@ -1,1361 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/enquire.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - enquire.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">29</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">89.7 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">26</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** \file enquire.h -<span class="lineNum"> 2 </span> : * \brief API for running queries -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 5 </span> : * Copyright 2001,2002 Ananova Ltd -<span class="lineNum"> 6 </span> : * Copyright 2002,2003,2004,2005,2006,2007 Olly Betts -<span class="lineNum"> 7 </span> : * -<span class="lineNum"> 8 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 9 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 10 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 11 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 12 </span> : * -<span class="lineNum"> 13 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : * GNU General Public License for more details. -<span class="lineNum"> 17 </span> : * -<span class="lineNum"> 18 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 20 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 21 </span> : * USA -<span class="lineNum"> 22 </span> : */ -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #ifndef XAPIAN_INCLUDED_ENQUIRE_H -<span class="lineNum"> 25 </span> : #define XAPIAN_INCLUDED_ENQUIRE_H -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <string> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : #include <xapian/base.h> -<span class="lineNum"> 30 </span> : #include <xapian/deprecated.h> -<span class="lineNum"> 31 </span> : #include <xapian/sorter.h> -<span class="lineNum"> 32 </span> : #include <xapian/types.h> -<span class="lineNum"> 33 </span> : #include <xapian/termiterator.h> -<span class="lineNum"> 34 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 35 </span> : -<span class="lineNum"> 36 </span> : namespace Xapian { -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : class Database; -<span class="lineNum"> 39 </span> : class Document; -<span class="lineNum"> 40 </span> : class ErrorHandler; -<span class="lineNum"> 41 </span> : class ExpandDecider; -<span class="lineNum"> 42 </span> : class MSetIterator; -<span class="lineNum"> 43 </span> : class Query; -<span class="lineNum"> 44 </span> : class Weight; -<span class="lineNum"> 45 </span> : -<span class="lineNum"> 46 </span> : /** A match set (MSet). -<span class="lineNum"> 47 </span> : * This class represents (a portion of) the results of a query. -<span class="lineNum"> 48 </span> : */ -<span class="lineNum"> 49 </span> : class XAPIAN_VISIBILITY_DEFAULT MSet { -<span class="lineNum"> 50 </span> : public: -<span class="lineNum"> 51 </span> : class Internal; -<span class="lineNum"> 52 </span> : /// @internal Reference counted internals. -<span class="lineNum"> 53 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 54 </span> : -<span class="lineNum"> 55 </span> : /// @internal Constructor for internal use. -<span class="lineNum"> 56 </span> : explicit MSet(MSet::Internal * internal_); -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : /// Create an empty Xapian::MSet. -<span class="lineNum"> 59 </span> : MSet(); -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : /// Destroy a Xapian::MSet. -<span class="lineNum"> 62 </span> : ~MSet(); -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : /// Copying is allowed (and is cheap). -<span class="lineNum"> 65 </span> : MSet(const MSet & other); -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : /// Assignment is allowed (and is cheap). -<span class="lineNum"> 68 </span> : void operator=(const MSet &other); -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : /** Fetch the document info for a set of items in the MSet. -<span class="lineNum"> 71 </span> : * -<span class="lineNum"> 72 </span> : * This method causes the documents in the range specified by the -<span class="lineNum"> 73 </span> : * iterators to be fetched from the database, and cached in the -<span class="lineNum"> 74 </span> : * Xapian::MSet object. This has little effect when performing a -<span class="lineNum"> 75 </span> : * search across a local database, but will greatly speed up -<span class="lineNum"> 76 </span> : * subsequent access to the document contents when the documents are -<span class="lineNum"> 77 </span> : * stored in a remote database. -<span class="lineNum"> 78 </span> : * -<span class="lineNum"> 79 </span> : * The iterators must be over this Xapian::MSet - undefined behaviour -<span class="lineNum"> 80 </span> : * will result otherwise. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * @param begin MSetIterator for first item to fetch. -<span class="lineNum"> 83 </span> : * @param end MSetIterator for item after last item to fetch. -<span class="lineNum"> 84 </span> : */ -<span class="lineNum"> 85 </span> : void fetch(const MSetIterator &begin, const MSetIterator &end) const; -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : /** Fetch the single item specified. -<span class="lineNum"> 88 </span> : */ -<span class="lineNum"> 89 </span> : void fetch(const MSetIterator &item) const; -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : /** Fetch all the items in the MSet. -<span class="lineNum"> 92 </span> : */ -<span class="lineNum"> 93 </span> : void fetch() const; -<span class="lineNum"> 94 </span> : -<span class="lineNum"> 95 </span> : /** This converts the weight supplied to a percentage score. -<span class="lineNum"> 96 </span> : * The return value will be in the range 0 to 100, and will be 0 if -<span class="lineNum"> 97 </span> : * and only if the item did not match the query at all. -<span class="lineNum"> 98 </span> : */ -<span class="lineNum"> 99 </span> : Xapian::percent convert_to_percent(Xapian::weight wt) const; -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : /// Return the percentage score for a particular item. -<span class="lineNum"> 102 </span> : Xapian::percent convert_to_percent(const MSetIterator &it) const; -<span class="lineNum"> 103 </span> : -<span class="lineNum"> 104 </span> : /** Return the term frequency of the given query term. -<span class="lineNum"> 105 </span> : * -<span class="lineNum"> 106 </span> : * @param tname The term to look for. -<span class="lineNum"> 107 </span> : * -<span class="lineNum"> 108 </span> : * @exception Xapian::InvalidArgumentError is thrown if the term was -<span class="lineNum"> 109 </span> : * not in the query. -<span class="lineNum"> 110 </span> : */ -<span class="lineNum"> 111 </span> : Xapian::doccount get_termfreq(const std::string &tname) const; -<span class="lineNum"> 112 </span> : -<span class="lineNum"> 113 </span> : /** Return the term weight of the given query term. -<span class="lineNum"> 114 </span> : * -<span class="lineNum"> 115 </span> : * @param tname The term to look for. -<span class="lineNum"> 116 </span> : * -<span class="lineNum"> 117 </span> : * @exception Xapian::InvalidArgumentError is thrown if the term was -<span class="lineNum"> 118 </span> : * not in the query. -<span class="lineNum"> 119 </span> : */ -<span class="lineNum"> 120 </span> : Xapian::weight get_termweight(const std::string &tname) const; -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : /** The index of the first item in the result which was put into the -<span class="lineNum"> 123 </span> : * MSet. -<span class="lineNum"> 124 </span> : * -<span class="lineNum"> 125 </span> : * This corresponds to the parameter "first" specified in -<span class="lineNum"> 126 </span> : * Xapian::Enquire::get_mset(). A value of 0 corresponds to the -<span class="lineNum"> 127 </span> : * highest result being the first item in the MSet. -<span class="lineNum"> 128 </span> : */ -<span class="lineNum"> 129 </span> : Xapian::doccount get_firstitem() const; -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : /** A lower bound on the number of documents in the database which -<span class="lineNum"> 132 </span> : * match the query. -<span class="lineNum"> 133 </span> : * -<span class="lineNum"> 134 </span> : * This figure takes into account collapsing of duplicates, -<span class="lineNum"> 135 </span> : * and weighting cutoff values. -<span class="lineNum"> 136 </span> : * -<span class="lineNum"> 137 </span> : * This number is usually considerably less than the actual number -<span class="lineNum"> 138 </span> : * of documents which match the query. -<span class="lineNum"> 139 </span> : */ -<span class="lineNum"> 140 </span> : Xapian::doccount get_matches_lower_bound() const; -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : /** An estimate for the number of documents in the database which -<span class="lineNum"> 143 </span> : * match the query. -<span class="lineNum"> 144 </span> : * -<span class="lineNum"> 145 </span> : * This figure takes into account collapsing of duplicates, -<span class="lineNum"> 146 </span> : * and weighting cutoff values. -<span class="lineNum"> 147 </span> : * -<span class="lineNum"> 148 </span> : * This value is returned because there is sometimes a request to -<span class="lineNum"> 149 </span> : * display such information. However, our experience is that -<span class="lineNum"> 150 </span> : * presenting this value to users causes them to worry about the -<span class="lineNum"> 151 </span> : * large number of results, rather than how useful those at the top -<span class="lineNum"> 152 </span> : * of the result set are, and is thus undesirable. -<span class="lineNum"> 153 </span> : */ -<span class="lineNum"> 154 </span> : Xapian::doccount get_matches_estimated() const; -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : /** An upper bound on the number of documents in the database which -<span class="lineNum"> 157 </span> : * match the query. -<span class="lineNum"> 158 </span> : * -<span class="lineNum"> 159 </span> : * This figure takes into account collapsing of duplicates, -<span class="lineNum"> 160 </span> : * and weighting cutoff values. -<span class="lineNum"> 161 </span> : * -<span class="lineNum"> 162 </span> : * This number is usually considerably greater than the actual -<span class="lineNum"> 163 </span> : * number of documents which match the query. -<span class="lineNum"> 164 </span> : */ -<span class="lineNum"> 165 </span> : Xapian::doccount get_matches_upper_bound() const; -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /** The maximum possible weight in the MSet. -<span class="lineNum"> 168 </span> : * This weight is likely not to be attained in the set of results, -<span class="lineNum"> 169 </span> : * but represents an upper bound on the weight which a document -<span class="lineNum"> 170 </span> : * could attain for the given query. -<span class="lineNum"> 171 </span> : */ -<span class="lineNum"> 172 </span> : Xapian::weight get_max_possible() const; -<span class="lineNum"> 173 </span> : -<span class="lineNum"> 174 </span> : /** The greatest weight which is attained by any document in the -<span class="lineNum"> 175 </span> : * database. -<span class="lineNum"> 176 </span> : * -<span class="lineNum"> 177 </span> : * If firstitem == 0, this is the weight of the first entry in -<span class="lineNum"> 178 </span> : * items. -<span class="lineNum"> 179 </span> : * -<span class="lineNum"> 180 </span> : * If no documents are found by the query, this will be 0. -<span class="lineNum"> 181 </span> : * -<span class="lineNum"> 182 </span> : * Note that calculation of max_attained requires calculation -<span class="lineNum"> 183 </span> : * of at least one result item - therefore, if no items were -<span class="lineNum"> 184 </span> : * requested when the query was performed (by specifying -<span class="lineNum"> 185 </span> : * maxitems = 0 in Xapian::Enquire::get_mset()), this value will be 0. -<span class="lineNum"> 186 </span> : */ -<span class="lineNum"> 187 </span> : Xapian::weight get_max_attained() const; -<span class="lineNum"> 188 </span> : -<span class="lineNum"> 189 </span> : /** The number of items in this MSet */ -<span class="lineNum"> 190 </span> : Xapian::doccount size() const; -<span class="lineNum"> 191 </span> : -<span class="lineNum"> 192 </span> : /** Required to allow use as an STL container. */ -<span class="lineNum"> 193 </span> : Xapian::doccount max_size() const { return size(); } -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span> : /** Test if this MSet is empty */ -<span class="lineNum"> 196 </span> : bool empty() const; -<span class="lineNum"> 197 </span> : -<span class="lineNum"> 198 </span> : /** Swap the MSet we point to with another */ -<span class="lineNum"> 199 </span> : void swap(MSet & other); -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : /** Iterator for the terms in this MSet */ -<span class="lineNum"> 202 </span> : MSetIterator begin() const; -<span class="lineNum"> 203 </span> : -<span class="lineNum"> 204 </span> : /** End iterator corresponding to begin() */ -<span class="lineNum"> 205 </span> : MSetIterator end() const; -<span class="lineNum"> 206 </span> : -<span class="lineNum"> 207 </span> : /** Iterator pointing to the last element of this MSet */ -<span class="lineNum"> 208 </span> : MSetIterator back() const; -<span class="lineNum"> 209 </span> : -<span class="lineNum"> 210 </span> : /** This returns the document at position i in this MSet object. -<span class="lineNum"> 211 </span> : * -<span class="lineNum"> 212 </span> : * Note that this is not the same as the document at rank i in the -<span class="lineNum"> 213 </span> : * query, unless the "first" parameter to Xapian::Enquire::get_mset -<span class="lineNum"> 214 </span> : * was 0. Rather, it is the document at rank i + first. -<span class="lineNum"> 215 </span> : * -<span class="lineNum"> 216 </span> : * In other words, the offset is into the documents represented by -<span class="lineNum"> 217 </span> : * this object, not into the set of documents matching the query. -<span class="lineNum"> 218 </span> : */ -<span class="lineNum"> 219 </span> : MSetIterator operator[](Xapian::doccount i) const; -<span class="lineNum"> 220 </span> : -<span class="lineNum"> 221 </span> : /// Allow use as an STL container -<span class="lineNum"> 222 </span> : //@{ -<span class="lineNum"> 223 </span> : typedef MSetIterator value_type; // FIXME: not assignable... -<span class="lineNum"> 224 </span> : typedef MSetIterator iterator; -<span class="lineNum"> 225 </span> : typedef MSetIterator const_iterator; -<span class="lineNum"> 226 </span> : typedef MSetIterator & reference; // Hmm -<span class="lineNum"> 227 </span> : typedef MSetIterator & const_reference; -<span class="lineNum"> 228 </span> : typedef MSetIterator * pointer; // Hmm -<span class="lineNum"> 229 </span> : typedef Xapian::doccount_diff difference_type; -<span class="lineNum"> 230 </span> : typedef Xapian::doccount size_type; -<span class="lineNum"> 231 </span> : //@} -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : /// Return a string describing this object. -<span class="lineNum"> 234 </span> : std::string get_description() const; -<span class="lineNum"> 235 </span> : }; -<span class="lineNum"> 236 </span> : -<span class="lineNum"> 237 </span> : /** An iterator pointing to items in an MSet. -<span class="lineNum"> 238 </span> : * This is used for access to individual results of a match. -<span class="lineNum"> 239 </span> : */ -<span class="lineNum"> 240 </span> : class XAPIAN_VISIBILITY_DEFAULT MSetIterator { -<span class="lineNum"> 241 </span> : private: -<span class="lineNum"> 242 </span> : friend class MSet; -<span class="lineNum"> 243 </span> : friend bool operator==(const MSetIterator &a, const MSetIterator &b); -<span class="lineNum"> 244 </span> : friend bool operator!=(const MSetIterator &a, const MSetIterator &b); -<span class="lineNum"> 245 </span> : -<span class="lineNum"> 246 </span> : MSetIterator(Xapian::doccount index_, const MSet & mset_) -<span class="lineNum"> 247 </span> : : index(index_), mset(mset_) { } -<span class="lineNum"> 248 </span> : -<span class="lineNum"> 249 </span> : Xapian::doccount index; -<span class="lineNum"> 250 </span> : MSet mset; -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : public: -<span class="lineNum"> 253 </span> : /** Create an uninitialised iterator; this cannot be used, but is -<span class="lineNum"> 254 </span> : * convenient syntactically. -<span class="lineNum"> 255 </span> : */ -<span class="lineNum"> 256 </span><span class="lineCov"> 3 : MSetIterator() : index(0), mset() { }</span> -<span class="lineNum"> 257 </span> : -<span class="lineNum"> 258 </span><span class="lineCov"> 165 : ~MSetIterator() { }</span> -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : /// Copying is allowed (and is cheap). -<span class="lineNum"> 261 </span><span class="lineCov"> 58 : MSetIterator(const MSetIterator &other) {</span> -<span class="lineNum"> 262 </span><span class="lineCov"> 58 : index = other.index;</span> -<span class="lineNum"> 263 </span><span class="lineCov"> 58 : mset = other.mset;</span> -<span class="lineNum"> 264 </span><span class="lineCov"> 58 : }</span> -<span class="lineNum"> 265 </span> : -<span class="lineNum"> 266 </span> : /// Assignment is allowed (and is cheap). -<span class="lineNum"> 267 </span><span class="lineCov"> 31 : void operator=(const MSetIterator &other) {</span> -<span class="lineNum"> 268 </span><span class="lineCov"> 31 : index = other.index;</span> -<span class="lineNum"> 269 </span><span class="lineCov"> 31 : mset = other.mset;</span> -<span class="lineNum"> 270 </span><span class="lineCov"> 31 : }</span> -<span class="lineNum"> 271 </span> : -<span class="lineNum"> 272 </span> : /// Advance the iterator. -<span class="lineNum"> 273 </span><span class="lineCov"> 61 : MSetIterator & operator++() {</span> -<span class="lineNum"> 274 </span><span class="lineCov"> 61 : ++index;</span> -<span class="lineNum"> 275 </span><span class="lineCov"> 61 : return *this;</span> -<span class="lineNum"> 276 </span> : } -<span class="lineNum"> 277 </span> : -<span class="lineNum"> 278 </span> : /// Advance the iterator (postfix variant). -<span class="lineNum"> 279 </span><span class="lineCov"> 28 : MSetIterator operator++(int) {</span> -<span class="lineNum"> 280 </span><span class="lineCov"> 28 : MSetIterator tmp = *this;</span> -<span class="lineNum"> 281 </span><span class="lineCov"> 28 : ++index;</span> -<span class="lineNum"> 282 </span> : return tmp; -<span class="lineNum"> 283 </span> : } -<span class="lineNum"> 284 </span> : -<span class="lineNum"> 285 </span> : /// Decrement the iterator. -<span class="lineNum"> 286 </span> : MSetIterator & operator--() { -<span class="lineNum"> 287 </span> : --index; -<span class="lineNum"> 288 </span> : return *this; -<span class="lineNum"> 289 </span> : } -<span class="lineNum"> 290 </span> : -<span class="lineNum"> 291 </span> : /// Decrement the iterator (postfix variant). -<span class="lineNum"> 292 </span> : MSetIterator operator--(int) { -<span class="lineNum"> 293 </span> : MSetIterator tmp = *this; -<span class="lineNum"> 294 </span> : --index; -<span class="lineNum"> 295 </span> : return tmp; -<span class="lineNum"> 296 </span> : } -<span class="lineNum"> 297 </span> : -<span class="lineNum"> 298 </span> : /// Get the document ID for the current position. -<span class="lineNum"> 299 </span> : Xapian::docid operator*() const; -<span class="lineNum"> 300 </span> : -<span class="lineNum"> 301 </span> : /** Get a Xapian::Document object for the current position. -<span class="lineNum"> 302 </span> : * -<span class="lineNum"> 303 </span> : * This method returns a Xapian::Document object which provides the -<span class="lineNum"> 304 </span> : * information about the document pointed to by the MSetIterator. -<span class="lineNum"> 305 </span> : * -<span class="lineNum"> 306 </span> : * If the underlying database has suitable support, using this call -<span class="lineNum"> 307 </span> : * (rather than asking the database for a document based on its -<span class="lineNum"> 308 </span> : * document ID) will enable the system to ensure that the correct -<span class="lineNum"> 309 </span> : * data is returned, and that the document has not been deleted -<span class="lineNum"> 310 </span> : * or changed since the query was performed. -<span class="lineNum"> 311 </span> : * -<span class="lineNum"> 312 </span> : * @return A Xapian::Document object containing the document data. -<span class="lineNum"> 313 </span> : * -<span class="lineNum"> 314 </span> : * @exception Xapian::DocNotFoundError The document specified could not -<span class="lineNum"> 315 </span> : * be found in the database. -<span class="lineNum"> 316 </span> : */ -<span class="lineNum"> 317 </span> : Xapian::Document get_document() const; -<span class="lineNum"> 318 </span> : -<span class="lineNum"> 319 </span> : /** Get the rank of the document at the current position. -<span class="lineNum"> 320 </span> : * -<span class="lineNum"> 321 </span> : * The rank is the position that this document is at in the ordered -<span class="lineNum"> 322 </span> : * list of results of the query. The result is 0-based - i.e. the -<span class="lineNum"> 323 </span> : * top-ranked document has a rank of 0. -<span class="lineNum"> 324 </span> : */ -<span class="lineNum"> 325 </span> : Xapian::doccount get_rank() const { -<span class="lineNum"> 326 </span> : return mset.get_firstitem() + index; -<span class="lineNum"> 327 </span> : } -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : /// Get the weight of the document at the current position -<span class="lineNum"> 330 </span> : Xapian::weight get_weight() const; -<span class="lineNum"> 331 </span> : -<span class="lineNum"> 332 </span> : /** Get the collapse key for this document. -<span class="lineNum"> 333 </span> : */ -<span class="lineNum"> 334 </span> : std::string get_collapse_key() const; -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : /** Get an estimate of the number of documents that have been collapsed -<span class="lineNum"> 337 </span> : * into this one. -<span class="lineNum"> 338 </span> : * -<span class="lineNum"> 339 </span> : * The estimate will always be less than or equal to the actual -<span class="lineNum"> 340 </span> : * number of other documents satisfying the match criteria with the -<span class="lineNum"> 341 </span> : * same collapse key as this document. -<span class="lineNum"> 342 </span> : * -<span class="lineNum"> 343 </span> : * This method may return 0 even though there are other documents with -<span class="lineNum"> 344 </span> : * the same collapse key which satisfying the match criteria. However -<span class="lineNum"> 345 </span> : * if this method returns non-zero, there definitely are other such -<span class="lineNum"> 346 </span> : * documents. So this method may be used to inform the user that -<span class="lineNum"> 347 </span> : * there are "at least N other matches in this group", or to control -<span class="lineNum"> 348 </span> : * whether to offer a "show other documents in this group" feature -<span class="lineNum"> 349 </span> : * (but note that it may not offer it in every case where it would -<span class="lineNum"> 350 </span> : * show other documents). -<span class="lineNum"> 351 </span> : */ -<span class="lineNum"> 352 </span> : Xapian::doccount get_collapse_count() const; -<span class="lineNum"> 353 </span> : -<span class="lineNum"> 354 </span> : /** This returns the weight of the document as a percentage score. -<span class="lineNum"> 355 </span> : * -<span class="lineNum"> 356 </span> : * The return value will be in the range 0 to 100: 0 meaning -<span class="lineNum"> 357 </span> : * that the item did not match the query at all. -<span class="lineNum"> 358 </span> : */ -<span class="lineNum"> 359 </span> : Xapian::percent get_percent() const; -<span class="lineNum"> 360 </span> : -<span class="lineNum"> 361 </span> : /// Return a string describing this object. -<span class="lineNum"> 362 </span> : std::string get_description() const; -<span class="lineNum"> 363 </span> : -<span class="lineNum"> 364 </span> : /// Allow use as an STL iterator -<span class="lineNum"> 365 </span> : //@{ -<span class="lineNum"> 366 </span> : typedef std::bidirectional_iterator_tag iterator_category; // FIXME: could enhance to be a randomaccess_iterator -<span class="lineNum"> 367 </span> : typedef Xapian::docid value_type; -<span class="lineNum"> 368 </span> : typedef Xapian::doccount_diff difference_type; -<span class="lineNum"> 369 </span> : typedef Xapian::docid * pointer; -<span class="lineNum"> 370 </span> : typedef Xapian::docid & reference; -<span class="lineNum"> 371 </span> : //@} -<span class="lineNum"> 372 </span> : }; -<span class="lineNum"> 373 </span> : -<span class="lineNum"> 374 </span><span class="lineCov"> 30 : inline bool operator==(const MSetIterator &a, const MSetIterator &b)</span> -<span class="lineNum"> 375 </span> : { -<span class="lineNum"> 376 </span><span class="lineCov"> 30 : return (a.index == b.index);</span> -<span class="lineNum"> 377 </span> : } -<span class="lineNum"> 378 </span> : -<span class="lineNum"> 379 </span><span class="lineCov"> 58 : inline bool operator!=(const MSetIterator &a, const MSetIterator &b)</span> -<span class="lineNum"> 380 </span> : { -<span class="lineNum"> 381 </span><span class="lineCov"> 58 : return (a.index != b.index);</span> -<span class="lineNum"> 382 </span> : } -<span class="lineNum"> 383 </span> : -<span class="lineNum"> 384 </span> : class ESetIterator; -<span class="lineNum"> 385 </span> : -<span class="lineNum"> 386 </span> : /** Class representing an ordered set of expand terms (an ESet). -<span class="lineNum"> 387 </span> : * This set represents the results of an expand operation, which is -<span class="lineNum"> 388 </span> : * performed by Xapian::Enquire::get_eset(). -<span class="lineNum"> 389 </span> : */ -<span class="lineNum"> 390 </span> : class XAPIAN_VISIBILITY_DEFAULT ESet { -<span class="lineNum"> 391 </span> : public: -<span class="lineNum"> 392 </span> : class Internal; -<span class="lineNum"> 393 </span> : /// @internal Reference counted internals. -<span class="lineNum"> 394 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 395 </span> : -<span class="lineNum"> 396 </span> : /// Construct an empty ESet -<span class="lineNum"> 397 </span> : ESet(); -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : /// Destructor. -<span class="lineNum"> 400 </span> : ~ESet(); -<span class="lineNum"> 401 </span> : -<span class="lineNum"> 402 </span> : /// Copying is allowed (and is cheap). -<span class="lineNum"> 403 </span> : ESet(const ESet & other); -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : /// Assignment is allowed (and is cheap). -<span class="lineNum"> 406 </span> : void operator=(const ESet &other); -<span class="lineNum"> 407 </span> : -<span class="lineNum"> 408 </span> : /** A lower bound on the number of terms which are in the full -<span class="lineNum"> 409 </span> : * set of results of the expand. This will be greater than or -<span class="lineNum"> 410 </span> : * equal to size() -<span class="lineNum"> 411 </span> : */ -<span class="lineNum"> 412 </span> : Xapian::termcount get_ebound() const; -<span class="lineNum"> 413 </span> : -<span class="lineNum"> 414 </span> : /** The number of terms in this E-Set */ -<span class="lineNum"> 415 </span> : Xapian::termcount size() const; -<span class="lineNum"> 416 </span> : -<span class="lineNum"> 417 </span> : /** Required to allow use as an STL container. */ -<span class="lineNum"> 418 </span> : Xapian::termcount max_size() const { return size(); } -<span class="lineNum"> 419 </span> : -<span class="lineNum"> 420 </span> : /** Test if this E-Set is empty */ -<span class="lineNum"> 421 </span> : bool empty() const; -<span class="lineNum"> 422 </span> : -<span class="lineNum"> 423 </span> : /** Swap the E-Set we point to with another */ -<span class="lineNum"> 424 </span> : void swap(ESet & other); -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : /** Iterator for the terms in this E-Set */ -<span class="lineNum"> 427 </span> : ESetIterator begin() const; -<span class="lineNum"> 428 </span> : -<span class="lineNum"> 429 </span> : /** End iterator corresponding to begin() */ -<span class="lineNum"> 430 </span> : ESetIterator end() const; -<span class="lineNum"> 431 </span> : -<span class="lineNum"> 432 </span> : /** Iterator pointing to the last element of this E-Set */ -<span class="lineNum"> 433 </span> : ESetIterator back() const; -<span class="lineNum"> 434 </span> : -<span class="lineNum"> 435 </span> : /** This returns the term at position i in this E-Set. */ -<span class="lineNum"> 436 </span> : ESetIterator operator[](Xapian::termcount i) const; -<span class="lineNum"> 437 </span> : -<span class="lineNum"> 438 </span> : /// Return a string describing this object. -<span class="lineNum"> 439 </span> : std::string get_description() const; -<span class="lineNum"> 440 </span> : }; -<span class="lineNum"> 441 </span> : -<span class="lineNum"> 442 </span> : /** Iterate through terms in the ESet */ -<span class="lineNum"> 443 </span> : class XAPIAN_VISIBILITY_DEFAULT ESetIterator { -<span class="lineNum"> 444 </span> : private: -<span class="lineNum"> 445 </span> : friend class ESet; -<span class="lineNum"> 446 </span> : friend bool operator==(const ESetIterator &a, const ESetIterator &b); -<span class="lineNum"> 447 </span> : friend bool operator!=(const ESetIterator &a, const ESetIterator &b); -<span class="lineNum"> 448 </span> : -<span class="lineNum"> 449 </span> : ESetIterator(Xapian::termcount index_, const ESet & eset_) -<span class="lineNum"> 450 </span> : : index(index_), eset(eset_) { } -<span class="lineNum"> 451 </span> : -<span class="lineNum"> 452 </span> : Xapian::termcount index; -<span class="lineNum"> 453 </span> : ESet eset; -<span class="lineNum"> 454 </span> : -<span class="lineNum"> 455 </span> : public: -<span class="lineNum"> 456 </span> : /** Create an uninitialised iterator; this cannot be used, but is -<span class="lineNum"> 457 </span> : * convenient syntactically. -<span class="lineNum"> 458 </span> : */ -<span class="lineNum"> 459 </span> : ESetIterator() : index(0), eset() { } -<span class="lineNum"> 460 </span> : -<span class="lineNum"> 461 </span><span class="lineCov"> 8 : ~ESetIterator() { }</span> -<span class="lineNum"> 462 </span> : -<span class="lineNum"> 463 </span> : /// Copying is allowed (and is cheap). -<span class="lineNum"> 464 </span> : ESetIterator(const ESetIterator &other) { -<span class="lineNum"> 465 </span> : index = other.index; -<span class="lineNum"> 466 </span> : eset = other.eset; -<span class="lineNum"> 467 </span> : } -<span class="lineNum"> 468 </span> : -<span class="lineNum"> 469 </span> : /// Assignment is allowed (and is cheap). -<span class="lineNum"> 470 </span> : void operator=(const ESetIterator &other) { -<span class="lineNum"> 471 </span> : index = other.index; -<span class="lineNum"> 472 </span> : eset = other.eset; -<span class="lineNum"> 473 </span> : } -<span class="lineNum"> 474 </span> : -<span class="lineNum"> 475 </span> : /// Advance the iterator. -<span class="lineNum"> 476 </span><span class="lineNoCov"> 0 : ESetIterator & operator++() {</span> -<span class="lineNum"> 477 </span><span class="lineNoCov"> 0 : ++index;</span> -<span class="lineNum"> 478 </span><span class="lineNoCov"> 0 : return *this;</span> -<span class="lineNum"> 479 </span> : } -<span class="lineNum"> 480 </span> : -<span class="lineNum"> 481 </span> : /// Advance the iterator (postfix variant). -<span class="lineNum"> 482 </span> : ESetIterator operator++(int) { -<span class="lineNum"> 483 </span> : ESetIterator tmp = *this; -<span class="lineNum"> 484 </span> : ++index; -<span class="lineNum"> 485 </span> : return tmp; -<span class="lineNum"> 486 </span> : } -<span class="lineNum"> 487 </span> : -<span class="lineNum"> 488 </span> : /// Decrement the iterator. -<span class="lineNum"> 489 </span> : ESetIterator & operator--() { -<span class="lineNum"> 490 </span> : --index; -<span class="lineNum"> 491 </span> : return *this; -<span class="lineNum"> 492 </span> : } -<span class="lineNum"> 493 </span> : -<span class="lineNum"> 494 </span> : /// Decrement the iterator (postfix variant). -<span class="lineNum"> 495 </span> : ESetIterator operator--(int) { -<span class="lineNum"> 496 </span> : ESetIterator tmp = *this; -<span class="lineNum"> 497 </span> : --index; -<span class="lineNum"> 498 </span> : return tmp; -<span class="lineNum"> 499 </span> : } -<span class="lineNum"> 500 </span> : -<span class="lineNum"> 501 </span> : /// Get the term for the current position -<span class="lineNum"> 502 </span> : const std::string & operator *() const; -<span class="lineNum"> 503 </span> : -<span class="lineNum"> 504 </span> : /// Get the weight of the term at the current position -<span class="lineNum"> 505 </span> : Xapian::weight get_weight() const; -<span class="lineNum"> 506 </span> : -<span class="lineNum"> 507 </span> : /// Return a string describing this object. -<span class="lineNum"> 508 </span> : std::string get_description() const; -<span class="lineNum"> 509 </span> : -<span class="lineNum"> 510 </span> : /// Allow use as an STL iterator -<span class="lineNum"> 511 </span> : //@{ -<span class="lineNum"> 512 </span> : typedef std::bidirectional_iterator_tag iterator_category; // FIXME: go for randomaccess_iterator! -<span class="lineNum"> 513 </span> : typedef std::string value_type; -<span class="lineNum"> 514 </span> : typedef Xapian::termcount_diff difference_type; -<span class="lineNum"> 515 </span> : typedef std::string * pointer; -<span class="lineNum"> 516 </span> : typedef std::string & reference; -<span class="lineNum"> 517 </span> : //@} -<span class="lineNum"> 518 </span> : }; -<span class="lineNum"> 519 </span> : -<span class="lineNum"> 520 </span> : inline bool operator==(const ESetIterator &a, const ESetIterator &b) -<span class="lineNum"> 521 </span> : { -<span class="lineNum"> 522 </span> : return (a.index == b.index); -<span class="lineNum"> 523 </span> : } -<span class="lineNum"> 524 </span> : -<span class="lineNum"> 525 </span><span class="lineCov"> 4 : inline bool operator!=(const ESetIterator &a, const ESetIterator &b)</span> -<span class="lineNum"> 526 </span> : { -<span class="lineNum"> 527 </span><span class="lineCov"> 4 : return (a.index != b.index);</span> -<span class="lineNum"> 528 </span> : } -<span class="lineNum"> 529 </span> : -<span class="lineNum"> 530 </span> : /** A relevance set (R-Set). -<span class="lineNum"> 531 </span> : * This is the set of documents which are marked as relevant, for use -<span class="lineNum"> 532 </span> : * in modifying the term weights, and in performing query expansion. -<span class="lineNum"> 533 </span> : */ -<span class="lineNum"> 534 </span> : class XAPIAN_VISIBILITY_DEFAULT RSet { -<span class="lineNum"> 535 </span> : public: -<span class="lineNum"> 536 </span> : /// Class holding details of RSet -<span class="lineNum"> 537 </span> : class Internal; -<span class="lineNum"> 538 </span> : -<span class="lineNum"> 539 </span> : /// @internal Reference counted internals. -<span class="lineNum"> 540 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 541 </span> : -<span class="lineNum"> 542 </span> : /// Copy constructor -<span class="lineNum"> 543 </span> : RSet(const RSet &rset); -<span class="lineNum"> 544 </span> : -<span class="lineNum"> 545 </span> : /// Assignment operator -<span class="lineNum"> 546 </span> : void operator=(const RSet &rset); -<span class="lineNum"> 547 </span> : -<span class="lineNum"> 548 </span> : /// Default constructor -<span class="lineNum"> 549 </span> : RSet(); -<span class="lineNum"> 550 </span> : -<span class="lineNum"> 551 </span> : /// Destructor -<span class="lineNum"> 552 </span> : ~RSet(); -<span class="lineNum"> 553 </span> : -<span class="lineNum"> 554 </span> : /** The number of documents in this R-Set */ -<span class="lineNum"> 555 </span> : Xapian::doccount size() const; -<span class="lineNum"> 556 </span> : -<span class="lineNum"> 557 </span> : /** Test if this R-Set is empty */ -<span class="lineNum"> 558 </span> : bool empty() const; -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : /// Add a document to the relevance set. -<span class="lineNum"> 561 </span> : void add_document(Xapian::docid did); -<span class="lineNum"> 562 </span> : -<span class="lineNum"> 563 </span> : /// Add a document to the relevance set. -<span class="lineNum"> 564 </span><span class="lineCov"> 20 : void add_document(const Xapian::MSetIterator & i) { add_document(*i); }</span> -<span class="lineNum"> 565 </span> : -<span class="lineNum"> 566 </span> : /// Remove a document from the relevance set. -<span class="lineNum"> 567 </span> : void remove_document(Xapian::docid did); -<span class="lineNum"> 568 </span> : -<span class="lineNum"> 569 </span> : /// Remove a document from the relevance set. -<span class="lineNum"> 570 </span> : void remove_document(const Xapian::MSetIterator & i) { remove_document(*i); } -<span class="lineNum"> 571 </span> : -<span class="lineNum"> 572 </span> : /// Test if a given document in the relevance set. -<span class="lineNum"> 573 </span> : bool contains(Xapian::docid did) const; -<span class="lineNum"> 574 </span> : -<span class="lineNum"> 575 </span> : /// Test if a given document in the relevance set. -<span class="lineNum"> 576 </span> : bool contains(const Xapian::MSetIterator & i) const { return contains(*i); } -<span class="lineNum"> 577 </span> : -<span class="lineNum"> 578 </span> : /// Return a string describing this object. -<span class="lineNum"> 579 </span> : std::string get_description() const; -<span class="lineNum"> 580 </span> : }; -<span class="lineNum"> 581 </span> : -<span class="lineNum"> 582 </span> : /** Base class for matcher decision functor. -<span class="lineNum"> 583 </span> : */ -<span class="lineNum"> 584 </span> : class XAPIAN_VISIBILITY_DEFAULT MatchDecider { -<span class="lineNum"> 585 </span> : public: -<span class="lineNum"> 586 </span> : /** Decide whether we want this document to be in the MSet. -<span class="lineNum"> 587 </span> : * -<span class="lineNum"> 588 </span> : * Return true if the document is acceptable, or false if the document -<span class="lineNum"> 589 </span> : * should be excluded from the MSet. -<span class="lineNum"> 590 </span> : */ -<span class="lineNum"> 591 </span> : virtual bool operator()(const Xapian::Document &doc) const = 0; -<span class="lineNum"> 592 </span> : -<span class="lineNum"> 593 </span> : /// Destructor. -<span class="lineNum"> 594 </span> : virtual ~MatchDecider(); -<span class="lineNum"> 595 </span> : }; -<span class="lineNum"> 596 </span> : -<span class="lineNum"> 597 </span> : /** This class provides an interface to the information retrieval -<span class="lineNum"> 598 </span> : * system for the purpose of searching. -<span class="lineNum"> 599 </span> : * -<span class="lineNum"> 600 </span> : * Databases are usually opened lazily, so exceptions may not be -<span class="lineNum"> 601 </span> : * thrown where you would expect them to be. You should catch -<span class="lineNum"> 602 </span> : * Xapian::Error exceptions when calling any method in Xapian::Enquire. -<span class="lineNum"> 603 </span> : * -<span class="lineNum"> 604 </span> : * @exception Xapian::InvalidArgumentError will be thrown if an invalid -<span class="lineNum"> 605 </span> : * argument is supplied, for example, an unknown database type. -<span class="lineNum"> 606 </span> : */ -<span class="lineNum"> 607 </span> : class XAPIAN_VISIBILITY_DEFAULT Enquire { -<span class="lineNum"> 608 </span> : public: -<span class="lineNum"> 609 </span> : /// Copying is allowed (and is cheap). -<span class="lineNum"> 610 </span> : Enquire(const Enquire & other); -<span class="lineNum"> 611 </span> : -<span class="lineNum"> 612 </span> : /// Assignment is allowed (and is cheap). -<span class="lineNum"> 613 </span> : void operator=(const Enquire & other); -<span class="lineNum"> 614 </span> : -<span class="lineNum"> 615 </span> : class Internal; -<span class="lineNum"> 616 </span> : /// @internal Reference counted internals. -<span class="lineNum"> 617 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 618 </span> : -<span class="lineNum"> 619 </span> : /** Create a Xapian::Enquire object. -<span class="lineNum"> 620 </span> : * -<span class="lineNum"> 621 </span> : * This specification cannot be changed once the Xapian::Enquire is -<span class="lineNum"> 622 </span> : * opened: you must create a new Xapian::Enquire object to access a -<span class="lineNum"> 623 </span> : * different database, or set of databases. -<span class="lineNum"> 624 </span> : * -<span class="lineNum"> 625 </span> : * The database supplied must have been initialised (ie, must not be -<span class="lineNum"> 626 </span> : * the result of calling the Database::Database() constructor). If -<span class="lineNum"> 627 </span> : * you need to handle a situation where you have no index gracefully, -<span class="lineNum"> 628 </span> : * a database created with InMemory::open() can be passed here, -<span class="lineNum"> 629 </span> : * which represents a completely empty database. -<span class="lineNum"> 630 </span> : * -<span class="lineNum"> 631 </span> : * @param database Specification of the database or databases to -<span class="lineNum"> 632 </span> : * use. -<span class="lineNum"> 633 </span> : * @param errorhandler_ A pointer to the error handler to use. -<span class="lineNum"> 634 </span> : * Ownership of the object pointed to is not assumed by the -<span class="lineNum"> 635 </span> : * Xapian::Enquire object - the user should delete the -<span class="lineNum"> 636 </span> : * Xapian::ErrorHandler object after the Xapian::Enquire object -<span class="lineNum"> 637 </span> : * is deleted. To use no error handler, this parameter -<span class="lineNum"> 638 </span> : * should be 0. -<span class="lineNum"> 639 </span> : * -<span class="lineNum"> 640 </span> : * @exception Xapian::InvalidArgumentError will be thrown if an -<span class="lineNum"> 641 </span> : * initialised Database object is supplied. -<span class="lineNum"> 642 </span> : */ -<span class="lineNum"> 643 </span> : explicit Enquire(const Database &database, ErrorHandler * errorhandler_ = 0); -<span class="lineNum"> 644 </span> : -<span class="lineNum"> 645 </span> : /** Close the Xapian::Enquire object. -<span class="lineNum"> 646 </span> : */ -<span class="lineNum"> 647 </span> : ~Enquire(); -<span class="lineNum"> 648 </span> : -<span class="lineNum"> 649 </span> : /** Set the query to run. -<span class="lineNum"> 650 </span> : * -<span class="lineNum"> 651 </span> : * @param query the new query to run. -<span class="lineNum"> 652 </span> : * @param qlen the query length to use in weight calculations - -<span class="lineNum"> 653 </span> : * by default the sum of the wqf of all terms is used. -<span class="lineNum"> 654 </span> : */ -<span class="lineNum"> 655 </span> : void set_query(const Xapian::Query & query, Xapian::termcount qlen = 0); -<span class="lineNum"> 656 </span> : -<span class="lineNum"> 657 </span> : /** Get the query which has been set. -<span class="lineNum"> 658 </span> : * This is only valid after set_query() has been called. -<span class="lineNum"> 659 </span> : * -<span class="lineNum"> 660 </span> : * @exception Xapian::InvalidArgumentError will be thrown if query has -<span class="lineNum"> 661 </span> : * not yet been set. -<span class="lineNum"> 662 </span> : */ -<span class="lineNum"> 663 </span> : const Xapian::Query & get_query() const; -<span class="lineNum"> 664 </span> : -<span class="lineNum"> 665 </span> : /** Set the weighting scheme to use for queries. -<span class="lineNum"> 666 </span> : * -<span class="lineNum"> 667 </span> : * @param weight_ the new weighting scheme. If no weighting scheme -<span class="lineNum"> 668 </span> : * is specified, the default is BM25 with the -<span class="lineNum"> 669 </span> : * default parameters. -<span class="lineNum"> 670 </span> : */ -<span class="lineNum"> 671 </span> : void set_weighting_scheme(const Weight &weight_); -<span class="lineNum"> 672 </span> : -<span class="lineNum"> 673 </span> : /** Set the collapse key to use for queries. -<span class="lineNum"> 674 </span> : * -<span class="lineNum"> 675 </span> : * @param collapse_key value number to collapse on - at most one MSet -<span class="lineNum"> 676 </span> : * entry with each particular value will be returned. -<span class="lineNum"> 677 </span> : * -<span class="lineNum"> 678 </span> : * The entry returned will be the best entry with that particular -<span class="lineNum"> 679 </span> : * value (highest weight or highest sorting key). -<span class="lineNum"> 680 </span> : * -<span class="lineNum"> 681 </span> : * An example use might be to create a value for each document -<span class="lineNum"> 682 </span> : * containing an MD5 hash of the document contents. Then -<span class="lineNum"> 683 </span> : * duplicate documents from different sources can be eliminated at -<span class="lineNum"> 684 </span> : * search time (it's better to eliminate duplicates at index time, -<span class="lineNum"> 685 </span> : * but this may not be always be possible - for example the search -<span class="lineNum"> 686 </span> : * may be over more than one Xapian database). -<span class="lineNum"> 687 </span> : * -<span class="lineNum"> 688 </span> : * Another use is to group matches in a particular category (e.g. -<span class="lineNum"> 689 </span> : * you might collapse a mailing list search on the Subject: so -<span class="lineNum"> 690 </span> : * that there's only one result per discussion thread). In this -<span class="lineNum"> 691 </span> : * case you can use get_collapse_count() to give the user some -<span class="lineNum"> 692 </span> : * idea how many other results there are. And if you index the -<span class="lineNum"> 693 </span> : * Subject: as a boolean term as well as putting it in a value, -<span class="lineNum"> 694 </span> : * you can offer a link to a non-collapsed search restricted to -<span class="lineNum"> 695 </span> : * that thread using a boolean filter. -<span class="lineNum"> 696 </span> : * -<span class="lineNum"> 697 </span> : * (default is Xapian::BAD_VALUENO which means no collapsing). -<span class="lineNum"> 698 </span> : */ -<span class="lineNum"> 699 </span> : void set_collapse_key(Xapian::valueno collapse_key); -<span class="lineNum"> 700 </span> : -<span class="lineNum"> 701 </span> : typedef enum { -<span class="lineNum"> 702 </span> : ASCENDING = 1, -<span class="lineNum"> 703 </span> : DESCENDING = 0, -<span class="lineNum"> 704 </span> : DONT_CARE = 2 -<span class="lineNum"> 705 </span> : } docid_order; -<span class="lineNum"> 706 </span> : -<span class="lineNum"> 707 </span> : /** Set the direction in which documents are ordered by document id -<span class="lineNum"> 708 </span> : * in the returned MSet. -<span class="lineNum"> 709 </span> : * -<span class="lineNum"> 710 </span> : * This order only has an effect on documents which would otherwise -<span class="lineNum"> 711 </span> : * have equal rank. For a weighted probabilistic match with no sort -<span class="lineNum"> 712 </span> : * value, this means documents with equal weight. For a boolean match, -<span class="lineNum"> 713 </span> : * with no sort value, this means all documents. And if a sort value -<span class="lineNum"> 714 </span> : * is used, this means documents with equal sort value (and also equal -<span class="lineNum"> 715 </span> : * weight if ordering on relevance after the sort). -<span class="lineNum"> 716 </span> : * -<span class="lineNum"> 717 </span> : * @param order This can be: -<span class="lineNum"> 718 </span> : * - Xapian::Enquire::ASCENDING -<span class="lineNum"> 719 </span> : * docids sort in ascending order (default) -<span class="lineNum"> 720 </span> : * - Xapian::Enquire::DESCENDING -<span class="lineNum"> 721 </span> : * docids sort in descending order -<span class="lineNum"> 722 </span> : * - Xapian::Enquire::DONT_CARE -<span class="lineNum"> 723 </span> : * docids sort in whatever order is most efficient for the backend -<span class="lineNum"> 724 </span> : * -<span class="lineNum"> 725 </span> : * Note: If you add documents in strict date order, then a boolean -<span class="lineNum"> 726 </span> : * search - i.e. set_weighting_scheme(Xapian::BoolWeight()) - with -<span class="lineNum"> 727 </span> : * set_docid_order(Xapian::Enquire::DESCENDING) is a very efficient -<span class="lineNum"> 728 </span> : * way to perform "sort by date, newest first". -<span class="lineNum"> 729 </span> : */ -<span class="lineNum"> 730 </span> : void set_docid_order(docid_order order); -<span class="lineNum"> 731 </span> : -<span class="lineNum"> 732 </span> : /** Set the percentage and/or weight cutoffs. -<span class="lineNum"> 733 </span> : * -<span class="lineNum"> 734 </span> : * @param percent_cutoff Minimum percentage score for returned -<span class="lineNum"> 735 </span> : * documents. If a document has a lower percentage score than this, -<span class="lineNum"> 736 </span> : * it will not appear in the MSet. If your intention is to return -<span class="lineNum"> 737 </span> : * only matches which contain all the terms in the query, then -<span class="lineNum"> 738 </span> : * it's more efficient to use Xapian::Query::OP_AND instead of -<span class="lineNum"> 739 </span> : * Xapian::Query::OP_OR in the query than to use set_cutoff(100). -<span class="lineNum"> 740 </span> : * (default 0 => no percentage cut-off). -<span class="lineNum"> 741 </span> : * @param weight_cutoff Minimum weight for a document to be returned. -<span class="lineNum"> 742 </span> : * If a document has a lower score that this, it will not appear -<span class="lineNum"> 743 </span> : * in the MSet. It is usually only possible to choose an -<span class="lineNum"> 744 </span> : * appropriate weight for cutoff based on the results of a -<span class="lineNum"> 745 </span> : * previous run of the same query; this is thus mainly useful for -<span class="lineNum"> 746 </span> : * alerting operations. The other potential use is with a user -<span class="lineNum"> 747 </span> : * specified weighting scheme. -<span class="lineNum"> 748 </span> : * (default 0 => no weight cut-off). -<span class="lineNum"> 749 </span> : */ -<span class="lineNum"> 750 </span> : void set_cutoff(Xapian::percent percent_cutoff, Xapian::weight weight_cutoff = 0); -<span class="lineNum"> 751 </span> : -<span class="lineNum"> 752 </span> : /** Set the sorting to be by relevance only. -<span class="lineNum"> 753 </span> : * -<span class="lineNum"> 754 </span> : * This is the default. -<span class="lineNum"> 755 </span> : */ -<span class="lineNum"> 756 </span> : void set_sort_by_relevance(); -<span class="lineNum"> 757 </span> : -<span class="lineNum"> 758 </span> : /** Set the sorting to be by value only. -<span class="lineNum"> 759 </span> : * -<span class="lineNum"> 760 </span> : * NB sorting of values uses a string comparison, so you'll need to -<span class="lineNum"> 761 </span> : * store numbers padded with leading zeros or spaces, or with the -<span class="lineNum"> 762 </span> : * number of digits prepended. -<span class="lineNum"> 763 </span> : * -<span class="lineNum"> 764 </span> : * @param sort_key value number to sort on. -<span class="lineNum"> 765 </span> : * -<span class="lineNum"> 766 </span> : * @param ascending If true, documents values which sort higher by -<span class="lineNum"> 767 </span> : * string compare are better. If false, the sort order -<span class="lineNum"> 768 </span> : * is reversed. (default true) -<span class="lineNum"> 769 </span> : */ -<span class="lineNum"> 770 </span> : void set_sort_by_value(Xapian::valueno sort_key, bool ascending = true); -<span class="lineNum"> 771 </span> : -<span class="lineNum"> 772 </span> : /** Set the sorting to be by key generated from values only. -<span class="lineNum"> 773 </span> : * -<span class="lineNum"> 774 </span> : * @param sorter The functor to use for generating keys. -<span class="lineNum"> 775 </span> : * -<span class="lineNum"> 776 </span> : * @param ascending If true, documents values which sort higher by -<span class="lineNum"> 777 </span> : * string compare are better. If false, the sort order -<span class="lineNum"> 778 </span> : * is reversed. (default true) -<span class="lineNum"> 779 </span> : */ -<span class="lineNum"> 780 </span> : void set_sort_by_key(Xapian::Sorter * sorter, bool ascending = true); -<span class="lineNum"> 781 </span> : -<span class="lineNum"> 782 </span> : /** Set the sorting to be by value, then by relevance for documents -<span class="lineNum"> 783 </span> : * with the same value. -<span class="lineNum"> 784 </span> : * -<span class="lineNum"> 785 </span> : * NB sorting of values uses a string comparison, so you'll need to -<span class="lineNum"> 786 </span> : * store numbers padded with leading zeros or spaces, or with the -<span class="lineNum"> 787 </span> : * number of digits prepended. -<span class="lineNum"> 788 </span> : * -<span class="lineNum"> 789 </span> : * @param sort_key value number to sort on. -<span class="lineNum"> 790 </span> : * -<span class="lineNum"> 791 </span> : * @param ascending If true, documents values which sort higher by -<span class="lineNum"> 792 </span> : * string compare are better. If false, the sort order -<span class="lineNum"> 793 </span> : * is reversed. (default true) -<span class="lineNum"> 794 </span> : */ -<span class="lineNum"> 795 </span> : void set_sort_by_value_then_relevance(Xapian::valueno sort_key, -<span class="lineNum"> 796 </span> : bool ascending = true); -<span class="lineNum"> 797 </span> : -<span class="lineNum"> 798 </span> : /** Set the sorting to be by keys generated from values, then by -<span class="lineNum"> 799 </span> : * relevance for documents with identical keys. -<span class="lineNum"> 800 </span> : * -<span class="lineNum"> 801 </span> : * @param sorter The functor to use for generating keys. -<span class="lineNum"> 802 </span> : * -<span class="lineNum"> 803 </span> : * @param ascending If true, keys which sort higher by -<span class="lineNum"> 804 </span> : * string compare are better. If false, the sort order -<span class="lineNum"> 805 </span> : * is reversed. (default true) -<span class="lineNum"> 806 </span> : */ -<span class="lineNum"> 807 </span> : void set_sort_by_key_then_relevance(Xapian::Sorter * sorter, -<span class="lineNum"> 808 </span> : bool ascending = true); -<span class="lineNum"> 809 </span> : -<span class="lineNum"> 810 </span> : /** Set the sorting to be by relevance then value. -<span class="lineNum"> 811 </span> : * -<span class="lineNum"> 812 </span> : * NB sorting of values uses a string comparison, so you'll need to -<span class="lineNum"> 813 </span> : * store numbers padded with leading zeros or spaces, or with the -<span class="lineNum"> 814 </span> : * number of digits prepended. -<span class="lineNum"> 815 </span> : * -<span class="lineNum"> 816 </span> : * Note that with the default BM25 weighting scheme parameters, -<span class="lineNum"> 817 </span> : * non-identical documents will rarely have the same weight, so -<span class="lineNum"> 818 </span> : * this setting will give very similar results to -<span class="lineNum"> 819 </span> : * set_sort_by_relevance(). It becomes more useful with particular -<span class="lineNum"> 820 </span> : * BM25 parameter settings (e.g. BM25Weight(1,0,1,0,0)) or custom -<span class="lineNum"> 821 </span> : * weighting schemes. -<span class="lineNum"> 822 </span> : * -<span class="lineNum"> 823 </span> : * @param sort_key value number to sort on. -<span class="lineNum"> 824 </span> : * -<span class="lineNum"> 825 </span> : * @param ascending If true, documents values which sort higher by -<span class="lineNum"> 826 </span> : * string compare are better. If false, the sort order -<span class="lineNum"> 827 </span> : * is reversed. (default true) -<span class="lineNum"> 828 </span> : */ -<span class="lineNum"> 829 </span> : void set_sort_by_relevance_then_value(Xapian::valueno sort_key, -<span class="lineNum"> 830 </span> : bool ascending = true); -<span class="lineNum"> 831 </span> : -<span class="lineNum"> 832 </span> : /** Set the sorting to be by relevance, then by keys generated from -<span class="lineNum"> 833 </span> : * values. -<span class="lineNum"> 834 </span> : * -<span class="lineNum"> 835 </span> : * Note that with the default BM25 weighting scheme parameters, -<span class="lineNum"> 836 </span> : * non-identical documents will rarely have the same weight, so -<span class="lineNum"> 837 </span> : * this setting will give very similar results to -<span class="lineNum"> 838 </span> : * set_sort_by_relevance(). It becomes more useful with particular -<span class="lineNum"> 839 </span> : * BM25 parameter settings (e.g. BM25Weight(1,0,1,0,0)) or custom -<span class="lineNum"> 840 </span> : * weighting schemes. -<span class="lineNum"> 841 </span> : * -<span class="lineNum"> 842 </span> : * @param sorter The functor to use for generating keys. -<span class="lineNum"> 843 </span> : * -<span class="lineNum"> 844 </span> : * @param ascending If true, keys which sort higher by -<span class="lineNum"> 845 </span> : * string compare are better. If false, the sort order -<span class="lineNum"> 846 </span> : * is reversed. (default true) -<span class="lineNum"> 847 </span> : */ -<span class="lineNum"> 848 </span> : void set_sort_by_relevance_then_key(Xapian::Sorter * sorter, -<span class="lineNum"> 849 </span> : bool ascending = true); -<span class="lineNum"> 850 </span> : -<span class="lineNum"> 851 </span> : /** Get (a portion of) the match set for the current query. -<span class="lineNum"> 852 </span> : * -<span class="lineNum"> 853 </span> : * @param first the first item in the result set to return. -<span class="lineNum"> 854 </span> : * A value of zero corresponds to the first item -<span class="lineNum"> 855 </span> : * returned being that with the highest score. -<span class="lineNum"> 856 </span> : * A value of 10 corresponds to the first 10 items -<span class="lineNum"> 857 </span> : * being ignored, and the returned items starting -<span class="lineNum"> 858 </span> : * at the eleventh. -<span class="lineNum"> 859 </span> : * @param maxitems the maximum number of items to return. -<span class="lineNum"> 860 </span> : * @param checkatleast the minimum number of items to check. Because -<span class="lineNum"> 861 </span> : * the matcher optimises, it won't consider every -<span class="lineNum"> 862 </span> : * document which might match, so the total number -<span class="lineNum"> 863 </span> : * of matches is estimated. Setting checkatleast -<span class="lineNum"> 864 </span> : * forces it to consider at least this many matches -<span class="lineNum"> 865 </span> : * and so allows for reliable paging links. -<span class="lineNum"> 866 </span> : * @param omrset the relevance set to use when performing the query. -<span class="lineNum"> 867 </span> : * @param mdecider a decision functor to use to decide whether a -<span class="lineNum"> 868 </span> : * given document should be put in the MSet. -<span class="lineNum"> 869 </span> : * @param matchspy a decision functor to use to decide whether a -<span class="lineNum"> 870 </span> : * given document should be put in the MSet. The -<span class="lineNum"> 871 </span> : * matchspy is applied to every document which is -<span class="lineNum"> 872 </span> : * a potential candidate for the MSet, so if there are -<span class="lineNum"> 873 </span> : * checkatleast or more such documents, the matchspy -<span class="lineNum"> 874 </span> : * will see at least checkatleast. The mdecider is -<span class="lineNum"> 875 </span> : * assumed to be a relatively expensive test so may -<span class="lineNum"> 876 </span> : * be applied in a lazier fashion. -<span class="lineNum"> 877 </span> : * -<span class="lineNum"> 878 </span> : * @return A Xapian::MSet object containing the results of the -<span class="lineNum"> 879 </span> : * query. -<span class="lineNum"> 880 </span> : * -<span class="lineNum"> 881 </span> : * @exception Xapian::InvalidArgumentError See class documentation. -<span class="lineNum"> 882 </span> : */ -<span class="lineNum"> 883 </span> : MSet get_mset(Xapian::doccount first, Xapian::doccount maxitems, -<span class="lineNum"> 884 </span> : Xapian::doccount checkatleast = 0, -<span class="lineNum"> 885 </span> : const RSet * omrset = 0, -<span class="lineNum"> 886 </span> : const MatchDecider * mdecider = 0) const; -<span class="lineNum"> 887 </span> : MSet get_mset(Xapian::doccount first, Xapian::doccount maxitems, -<span class="lineNum"> 888 </span> : Xapian::doccount checkatleast, -<span class="lineNum"> 889 </span> : const RSet * omrset, -<span class="lineNum"> 890 </span> : const MatchDecider * mdecider, -<span class="lineNum"> 891 </span> : const MatchDecider * matchspy) const; -<span class="lineNum"> 892 </span> : MSet get_mset(Xapian::doccount first, Xapian::doccount maxitems, -<span class="lineNum"> 893 </span> : const RSet * omrset, -<span class="lineNum"> 894 </span> : const MatchDecider * mdecider = 0) const { -<span class="lineNum"> 895 </span> : return get_mset(first, maxitems, 0, omrset, mdecider); -<span class="lineNum"> 896 </span> : } -<span class="lineNum"> 897 </span> : -<span class="lineNum"> 898 </span> : static const int INCLUDE_QUERY_TERMS = 1; -<span class="lineNum"> 899 </span> : static const int USE_EXACT_TERMFREQ = 2; -<span class="lineNum"> 900 </span> : #ifndef _MSC_VER -<span class="lineNum"> 901 </span> : /// Deprecated in Xapian 1.0.0, use INCLUDE_QUERY_TERMS instead. -<span class="lineNum"> 902 </span> : XAPIAN_DEPRECATED(static const int include_query_terms) = 1; -<span class="lineNum"> 903 </span> : /// Deprecated in Xapian 1.0.0, use USE_EXACT_TERMFREQ instead. -<span class="lineNum"> 904 </span> : XAPIAN_DEPRECATED(static const int use_exact_termfreq) = 2; -<span class="lineNum"> 905 </span> : #else -<span class="lineNum"> 906 </span> : // Work around MSVC stupidity (you get a warning for deprecating a -<span class="lineNum"> 907 </span> : // declaration). -<span class="lineNum"> 908 </span> : static const int include_query_terms = 1; -<span class="lineNum"> 909 </span> : static const int use_exact_termfreq = 2; -<span class="lineNum"> 910 </span> : #pragma deprecated("Xapian::Enquire::include_query_terms", "Xapian::Enquire::use_exact_termfreq") -<span class="lineNum"> 911 </span> : #endif -<span class="lineNum"> 912 </span> : -<span class="lineNum"> 913 </span> : /** Get the expand set for the given rset. -<span class="lineNum"> 914 </span> : * -<span class="lineNum"> 915 </span> : * @param maxitems the maximum number of items to return. -<span class="lineNum"> 916 </span> : * @param omrset the relevance set to use when performing -<span class="lineNum"> 917 </span> : * the expand operation. -<span class="lineNum"> 918 </span> : * @param flags zero or more of these values |-ed together: -<span class="lineNum"> 919 </span> : * - Xapian::Enquire::INCLUDE_QUERY_TERMS query -<span class="lineNum"> 920 </span> : * terms may be returned from expand -<span class="lineNum"> 921 </span> : * - Xapian::Enquire::USE_EXACT_TERMFREQ for multi -<span class="lineNum"> 922 </span> : * dbs, calculate the exact termfreq; otherwise an -<span class="lineNum"> 923 </span> : * approximation is used which can greatly improve -<span class="lineNum"> 924 </span> : * efficiency, but still returns good results. -<span class="lineNum"> 925 </span> : * @param k the parameter k in the query expansion algorithm -<span class="lineNum"> 926 </span> : * (default is 1.0) -<span class="lineNum"> 927 </span> : * @param edecider a decision functor to use to decide whether a -<span class="lineNum"> 928 </span> : * given term should be put in the ESet -<span class="lineNum"> 929 </span> : * -<span class="lineNum"> 930 </span> : * @return An ESet object containing the results of the -<span class="lineNum"> 931 </span> : * expand. -<span class="lineNum"> 932 </span> : * -<span class="lineNum"> 933 </span> : * @exception Xapian::InvalidArgumentError See class documentation. -<span class="lineNum"> 934 </span> : */ -<span class="lineNum"> 935 </span> : ESet get_eset(Xapian::termcount maxitems, -<span class="lineNum"> 936 </span> : const RSet & omrset, -<span class="lineNum"> 937 </span> : int flags = 0, -<span class="lineNum"> 938 </span> : double k = 1.0, -<span class="lineNum"> 939 </span> : const Xapian::ExpandDecider * edecider = 0) const; -<span class="lineNum"> 940 </span> : -<span class="lineNum"> 941 </span> : /** Get the expand set for the given rset. -<span class="lineNum"> 942 </span> : * -<span class="lineNum"> 943 </span> : * @param maxitems the maximum number of items to return. -<span class="lineNum"> 944 </span> : * @param omrset the relevance set to use when performing -<span class="lineNum"> 945 </span> : * the expand operation. -<span class="lineNum"> 946 </span> : * @param edecider a decision functor to use to decide whether a -<span class="lineNum"> 947 </span> : * given term should be put in the ESet -<span class="lineNum"> 948 </span> : * -<span class="lineNum"> 949 </span> : * @return An ESet object containing the results of the -<span class="lineNum"> 950 </span> : * expand. -<span class="lineNum"> 951 </span> : * -<span class="lineNum"> 952 </span> : * @exception Xapian::InvalidArgumentError See class documentation. -<span class="lineNum"> 953 </span> : */ -<span class="lineNum"> 954 </span> : inline ESet get_eset(Xapian::termcount maxitems, const RSet & omrset, -<span class="lineNum"> 955 </span><span class="lineCov"> 4 : const Xapian::ExpandDecider * edecider) const {</span> -<span class="lineNum"> 956 </span><span class="lineCov"> 4 : return get_eset(maxitems, omrset, 0, 1.0, edecider);</span> -<span class="lineNum"> 957 </span> : } -<span class="lineNum"> 958 </span> : -<span class="lineNum"> 959 </span> : /** Get terms which match a given document, by document id. -<span class="lineNum"> 960 </span> : * -<span class="lineNum"> 961 </span> : * This method returns the terms in the current query which match -<span class="lineNum"> 962 </span> : * the given document. -<span class="lineNum"> 963 </span> : * -<span class="lineNum"> 964 </span> : * It is possible for the document to have been removed from the -<span class="lineNum"> 965 </span> : * database between the time it is returned in an MSet, and the -<span class="lineNum"> 966 </span> : * time that this call is made. If possible, you should specify -<span class="lineNum"> 967 </span> : * an MSetIterator instead of a Xapian::docid, since this will enable -<span class="lineNum"> 968 </span> : * database backends with suitable support to prevent this -<span class="lineNum"> 969 </span> : * occurring. -<span class="lineNum"> 970 </span> : * -<span class="lineNum"> 971 </span> : * Note that a query does not need to have been run in order to -<span class="lineNum"> 972 </span> : * make this call. -<span class="lineNum"> 973 </span> : * -<span class="lineNum"> 974 </span> : * @param did The document id for which to retrieve the matching -<span class="lineNum"> 975 </span> : * terms. -<span class="lineNum"> 976 </span> : * -<span class="lineNum"> 977 </span> : * @return An iterator returning the terms which match the -<span class="lineNum"> 978 </span> : * document. The terms will be returned (as far as this -<span class="lineNum"> 979 </span> : * makes any sense) in the same order as the terms -<span class="lineNum"> 980 </span> : * in the query. Terms will not occur more than once, -<span class="lineNum"> 981 </span> : * even if they do in the query. -<span class="lineNum"> 982 </span> : * -<span class="lineNum"> 983 </span> : * @exception Xapian::InvalidArgumentError See class documentation. -<span class="lineNum"> 984 </span> : * @exception Xapian::DocNotFoundError The document specified -<span class="lineNum"> 985 </span> : * could not be found in the database. -<span class="lineNum"> 986 </span> : */ -<span class="lineNum"> 987 </span> : TermIterator get_matching_terms_begin(Xapian::docid did) const; -<span class="lineNum"> 988 </span> : -<span class="lineNum"> 989 </span> : /** End iterator corresponding to get_matching_terms_begin() */ -<span class="lineNum"> 990 </span> : TermIterator get_matching_terms_end(Xapian::docid /*did*/) const { -<span class="lineNum"> 991 </span> : return TermIterator(NULL); -<span class="lineNum"> 992 </span> : } -<span class="lineNum"> 993 </span> : -<span class="lineNum"> 994 </span> : /** Get terms which match a given document, by match set item. -<span class="lineNum"> 995 </span> : * -<span class="lineNum"> 996 </span> : * This method returns the terms in the current query which match -<span class="lineNum"> 997 </span> : * the given document. -<span class="lineNum"> 998 </span> : * -<span class="lineNum"> 999 </span> : * If the underlying database has suitable support, using this call -<span class="lineNum"> 1000 </span> : * (rather than passing a Xapian::docid) will enable the system to -<span class="lineNum"> 1001 </span> : * ensure that the correct data is returned, and that the document -<span class="lineNum"> 1002 </span> : * has not been deleted or changed since the query was performed. -<span class="lineNum"> 1003 </span> : * -<span class="lineNum"> 1004 </span> : * @param it The iterator for which to retrieve the matching terms. -<span class="lineNum"> 1005 </span> : * -<span class="lineNum"> 1006 </span> : * @return An iterator returning the terms which match the -<span class="lineNum"> 1007 </span> : * document. The terms will be returned (as far as this -<span class="lineNum"> 1008 </span> : * makes any sense) in the same order as the terms -<span class="lineNum"> 1009 </span> : * in the query. Terms will not occur more than once, -<span class="lineNum"> 1010 </span> : * even if they do in the query. -<span class="lineNum"> 1011 </span> : * -<span class="lineNum"> 1012 </span> : * @exception Xapian::InvalidArgumentError See class documentation. -<span class="lineNum"> 1013 </span> : * @exception Xapian::DocNotFoundError The document specified -<span class="lineNum"> 1014 </span> : * could not be found in the database. -<span class="lineNum"> 1015 </span> : */ -<span class="lineNum"> 1016 </span> : TermIterator get_matching_terms_begin(const MSetIterator &it) const; -<span class="lineNum"> 1017 </span> : -<span class="lineNum"> 1018 </span> : /** End iterator corresponding to get_matching_terms_begin() */ -<span class="lineNum"> 1019 </span> : TermIterator get_matching_terms_end(const MSetIterator &/*it*/) const { -<span class="lineNum"> 1020 </span> : return TermIterator(NULL); -<span class="lineNum"> 1021 </span> : } -<span class="lineNum"> 1022 </span> : -<span class="lineNum"> 1023 </span> : /** Register a MatchDecider. -<span class="lineNum"> 1024 </span> : * -<span class="lineNum"> 1025 </span> : * This is used to associate a name with a matchdecider. -<span class="lineNum"> 1026 </span> : * -<span class="lineNum"> 1027 </span> : * @deprecated This method is deprecated. It was added long ago with -<span class="lineNum"> 1028 </span> : * the intention that it would allow the remote backend to support -<span class="lineNum"> 1029 </span> : * use of MatchDecider objects, but there's a better approach. -<span class="lineNum"> 1030 </span> : * -<span class="lineNum"> 1031 </span> : * @param name The name to register this matchdecider as. -<span class="lineNum"> 1032 </span> : * @param mdecider The matchdecider. If omitted, then remove -<span class="lineNum"> 1033 </span> : * any matchdecider registered with this name. -<span class="lineNum"> 1034 </span> : */ -<span class="lineNum"> 1035 </span> : XAPIAN_DEPRECATED( -<span class="lineNum"> 1036 </span> : void register_match_decider(const std::string &name, -<span class="lineNum"> 1037 </span> : const MatchDecider *mdecider = NULL)); -<span class="lineNum"> 1038 </span> : -<span class="lineNum"> 1039 </span> : /// Return a string describing this object. -<span class="lineNum"> 1040 </span> : std::string get_description() const; -<span class="lineNum"> 1041 </span> : }; -<span class="lineNum"> 1042 </span> : -<span class="lineNum"> 1043 </span> : } -<span class="lineNum"> 1044 </span> : -<span class="lineNum"> 1045 </span> : class RemoteServer; -<span class="lineNum"> 1046 </span> : class ScaleWeight; -<span class="lineNum"> 1047 </span> : -<span class="lineNum"> 1048 </span> : namespace Xapian { -<span class="lineNum"> 1049 </span> : -<span class="lineNum"> 1050 </span> : /// Abstract base class for weighting schemes -<span class="lineNum"> 1051 </span> : class XAPIAN_VISIBILITY_DEFAULT Weight { -<span class="lineNum"> 1052 </span> : friend class Enquire; // So Enquire can clone us -<span class="lineNum"> 1053 </span> : friend class ::RemoteServer; // So RemoteServer can clone us - FIXME -<span class="lineNum"> 1054 </span> : friend class ::ScaleWeight; -<span class="lineNum"> 1055 </span> : public: -<span class="lineNum"> 1056 </span> : class Internal; -<span class="lineNum"> 1057 </span> : protected: -<span class="lineNum"> 1058 </span> : Weight(const Weight &); -<span class="lineNum"> 1059 </span> : private: -<span class="lineNum"> 1060 </span> : void operator=(Weight &); -<span class="lineNum"> 1061 </span> : -<span class="lineNum"> 1062 </span> : /** Return a new weight object of this type. -<span class="lineNum"> 1063 </span> : * -<span class="lineNum"> 1064 </span> : * A subclass called FooWeight taking parameters param1 and param2 -<span class="lineNum"> 1065 </span> : * should implement this as: -<span class="lineNum"> 1066 </span> : * -<span class="lineNum"> 1067 </span> : * virtual FooWeight * clone() const { -<span class="lineNum"> 1068 </span> : * return new FooWeight(param1, param2); -<span class="lineNum"> 1069 </span> : * } -<span class="lineNum"> 1070 </span> : */ -<span class="lineNum"> 1071 </span> : virtual Weight * clone() const = 0; -<span class="lineNum"> 1072 </span> : -<span class="lineNum"> 1073 </span> : protected: -<span class="lineNum"> 1074 </span> : const Internal * internal; // Weight::Internal == Stats -<span class="lineNum"> 1075 </span> : Xapian::doclength querysize; -<span class="lineNum"> 1076 </span> : Xapian::termcount wqf; -<span class="lineNum"> 1077 </span> : std::string tname; -<span class="lineNum"> 1078 </span> : -<span class="lineNum"> 1079 </span> : public: -<span class="lineNum"> 1080 </span> : // FIXME:1.1: initialise internal to NULL here -<span class="lineNum"> 1081 </span> : Weight() { } -<span class="lineNum"> 1082 </span> : virtual ~Weight(); -<span class="lineNum"> 1083 </span> : -<span class="lineNum"> 1084 </span> : /** Create a new weight object of the same type as this and initialise -<span class="lineNum"> 1085 </span> : * it with the specified statistics. -<span class="lineNum"> 1086 </span> : * -<span class="lineNum"> 1087 </span> : * You shouldn't call this method yourself - it's called by -<span class="lineNum"> 1088 </span> : * Enquire. -<span class="lineNum"> 1089 </span> : * -<span class="lineNum"> 1090 </span> : * @param internal_ Object to ask for collection statistics. -<span class="lineNum"> 1091 </span> : * @param querysize_ Query size. -<span class="lineNum"> 1092 </span> : * @param wqf_ Within query frequency of term this object is -<span class="lineNum"> 1093 </span> : * associated with. -<span class="lineNum"> 1094 </span> : * @param tname_ Term which this object is associated with. -<span class="lineNum"> 1095 </span> : */ -<span class="lineNum"> 1096 </span> : Weight * create(const Internal * internal_, Xapian::doclength querysize_, -<span class="lineNum"> 1097 </span> : Xapian::termcount wqf_, const std::string & tname_) const; -<span class="lineNum"> 1098 </span> : -<span class="lineNum"> 1099 </span> : /** Name of the weighting scheme. -<span class="lineNum"> 1100 </span> : * -<span class="lineNum"> 1101 </span> : * If the subclass is called FooWeight, this should return "Foo". -<span class="lineNum"> 1102 </span> : */ -<span class="lineNum"> 1103 </span> : virtual std::string name() const = 0; -<span class="lineNum"> 1104 </span> : -<span class="lineNum"> 1105 </span> : /// Serialise object parameters into a string. -<span class="lineNum"> 1106 </span> : virtual std::string serialise() const = 0; -<span class="lineNum"> 1107 </span> : -<span class="lineNum"> 1108 </span> : /// Create object given string serialisation returned by serialise(). -<span class="lineNum"> 1109 </span> : virtual Weight * unserialise(const std::string &s) const = 0; -<span class="lineNum"> 1110 </span> : -<span class="lineNum"> 1111 </span> : /** Get a weight which is part of the sum over terms being performed. -<span class="lineNum"> 1112 </span> : * This returns a weight for a given term and document. These -<span class="lineNum"> 1113 </span> : * weights are summed to give a total weight for the document. -<span class="lineNum"> 1114 </span> : * -<span class="lineNum"> 1115 </span> : * @param wdf the within document frequency of the term. -<span class="lineNum"> 1116 </span> : * @param len the (unnormalised) document length. -<span class="lineNum"> 1117 </span> : */ -<span class="lineNum"> 1118 </span> : virtual Xapian::weight get_sumpart(Xapian::termcount wdf, -<span class="lineNum"> 1119 </span> : Xapian::doclength len) const = 0; -<span class="lineNum"> 1120 </span> : -<span class="lineNum"> 1121 </span> : /** Gets the maximum value that get_sumpart() may return. This -<span class="lineNum"> 1122 </span> : * is used in optimising searches, by having the postlist tree -<span class="lineNum"> 1123 </span> : * decay appropriately when parts of it can have limited, or no, -<span class="lineNum"> 1124 </span> : * further effect. -<span class="lineNum"> 1125 </span> : */ -<span class="lineNum"> 1126 </span> : virtual Xapian::weight get_maxpart() const = 0; -<span class="lineNum"> 1127 </span> : -<span class="lineNum"> 1128 </span> : /** Get an extra weight for a document to add to the sum calculated -<span class="lineNum"> 1129 </span> : * over the query terms. -<span class="lineNum"> 1130 </span> : * This returns a weight for a given document, and is used by some -<span class="lineNum"> 1131 </span> : * weighting schemes to account for influence such as document -<span class="lineNum"> 1132 </span> : * length. -<span class="lineNum"> 1133 </span> : * -<span class="lineNum"> 1134 </span> : * @param len the (unnormalised) document length. -<span class="lineNum"> 1135 </span> : */ -<span class="lineNum"> 1136 </span> : virtual Xapian::weight get_sumextra(Xapian::doclength len) const = 0; -<span class="lineNum"> 1137 </span> : -<span class="lineNum"> 1138 </span> : /** Gets the maximum value that get_sumextra() may return. This -<span class="lineNum"> 1139 </span> : * is used in optimising searches. -<span class="lineNum"> 1140 </span> : */ -<span class="lineNum"> 1141 </span> : virtual Xapian::weight get_maxextra() const = 0; -<span class="lineNum"> 1142 </span> : -<span class="lineNum"> 1143 </span> : /// return false if the weight object doesn't need doclength -<span class="lineNum"> 1144 </span> : virtual bool get_sumpart_needs_doclength() const; /* { return true; } */ -<span class="lineNum"> 1145 </span> : }; -<span class="lineNum"> 1146 </span> : -<span class="lineNum"> 1147 </span> : /// Boolean weighting scheme (everything gets 0) -<span class="lineNum"> 1148 </span> : class XAPIAN_VISIBILITY_DEFAULT BoolWeight : public Weight { -<span class="lineNum"> 1149 </span> : public: -<span class="lineNum"> 1150 </span> : BoolWeight * clone() const; -<span class="lineNum"> 1151 </span> : BoolWeight() { } -<span class="lineNum"> 1152 </span> : ~BoolWeight(); -<span class="lineNum"> 1153 </span> : std::string name() const; -<span class="lineNum"> 1154 </span> : std::string serialise() const; -<span class="lineNum"> 1155 </span> : BoolWeight * unserialise(const std::string & s) const; -<span class="lineNum"> 1156 </span> : Xapian::weight get_sumpart(Xapian::termcount wdf, Xapian::doclength len) const; -<span class="lineNum"> 1157 </span> : Xapian::weight get_maxpart() const; -<span class="lineNum"> 1158 </span> : -<span class="lineNum"> 1159 </span> : Xapian::weight get_sumextra(Xapian::doclength len) const; -<span class="lineNum"> 1160 </span> : Xapian::weight get_maxextra() const; -<span class="lineNum"> 1161 </span> : -<span class="lineNum"> 1162 </span> : bool get_sumpart_needs_doclength() const; -<span class="lineNum"> 1163 </span> : }; -<span class="lineNum"> 1164 </span> : -<span class="lineNum"> 1165 </span> : /** BM25 weighting scheme -<span class="lineNum"> 1166 </span> : * -<span class="lineNum"> 1167 </span> : * BM25 weighting options : The BM25 formula is \f[ -<span class="lineNum"> 1168 </span> : * \frac{k_{2}.n_{q}}{1+L_{d}}+\sum_{t}\frac{(k_{3}+1)q_{t}}{k_{3}+q_{t}}.\frac{(k_{1}+1)f_{t,d}}{k_{1}((1-b)+bL_{d})+f_{t,d}}.w_{t} -<span class="lineNum"> 1169 </span> : * \f] where -<span class="lineNum"> 1170 </span> : * - \f$w_{t}\f$ is the termweight of term t -<span class="lineNum"> 1171 </span> : * - \f$f_{t,d}\f$ is the within document frequency of term t in document d -<span class="lineNum"> 1172 </span> : * - \f$q_{t}\f$ is the within query frequency of term t -<span class="lineNum"> 1173 </span> : * - \f$L_{d}\f$ is the normalised length of document d -<span class="lineNum"> 1174 </span> : * - \f$n_{q}\f$ is the size of the query -<span class="lineNum"> 1175 </span> : * - \f$k_{1}\f$, \f$k_{2}\f$, \f$k_{3}\f$ and \f$b\f$ are user specified parameters -<span class="lineNum"> 1176 </span> : */ -<span class="lineNum"> 1177 </span> : class XAPIAN_VISIBILITY_DEFAULT BM25Weight : public Weight { -<span class="lineNum"> 1178 </span> : private: -<span class="lineNum"> 1179 </span> : mutable Xapian::weight termweight; -<span class="lineNum"> 1180 </span> : mutable Xapian::doclength lenpart; -<span class="lineNum"> 1181 </span> : -<span class="lineNum"> 1182 </span> : double k1, k2, k3, b; -<span class="lineNum"> 1183 </span> : Xapian::doclength min_normlen; -<span class="lineNum"> 1184 </span> : -<span class="lineNum"> 1185 </span> : mutable bool weight_calculated; -<span class="lineNum"> 1186 </span> : -<span class="lineNum"> 1187 </span> : void calc_termweight() const; -<span class="lineNum"> 1188 </span> : -<span class="lineNum"> 1189 </span> : public: -<span class="lineNum"> 1190 </span> : /** Construct a BM25 weight. -<span class="lineNum"> 1191 </span> : * -<span class="lineNum"> 1192 </span> : * @param k1 governs the importance of within document frequency. -<span class="lineNum"> 1193 </span> : * Must be >= 0. 0 means ignore wdf. Default is 1. -<span class="lineNum"> 1194 </span> : * @param k2 compensation factor for the high wdf values in -<span class="lineNum"> 1195 </span> : * large documents. Must be >= 0. 0 means no -<span class="lineNum"> 1196 </span> : * compensation. Default is 0. -<span class="lineNum"> 1197 </span> : * @param k3 governs the importance of within query frequency. -<span class="lineNum"> 1198 </span> : * Must be >= 0. 0 means ignore wqf. Default is 1. -<span class="lineNum"> 1199 </span> : * @param b Relative importance of within document frequency and -<span class="lineNum"> 1200 </span> : * document length. Must be >= 0 and <= 1. Default -<span class="lineNum"> 1201 </span> : * is 0.5. -<span class="lineNum"> 1202 </span> : * @param min_normlen specifies a cutoff on the minimum value that -<span class="lineNum"> 1203 </span> : * can be used for a normalised document length - -<span class="lineNum"> 1204 </span> : * smaller values will be forced up to this cutoff. -<span class="lineNum"> 1205 </span> : * This prevents very small documents getting a huge -<span class="lineNum"> 1206 </span> : * bonus weight. Default is 0.5. -<span class="lineNum"> 1207 </span> : */ -<span class="lineNum"> 1208 </span> : BM25Weight(double k1_, double k2_, double k3_, double b_, -<span class="lineNum"> 1209 </span> : double min_normlen_) -<span class="lineNum"> 1210 </span> : : k1(k1_), k2(k2_), k3(k3_), b(b_), min_normlen(min_normlen_), -<span class="lineNum"> 1211 </span> : weight_calculated(false) -<span class="lineNum"> 1212 </span> : { -<span class="lineNum"> 1213 </span> : if (k1 < 0) k1 = 0; -<span class="lineNum"> 1214 </span> : if (k2 < 0) k2 = 0; -<span class="lineNum"> 1215 </span> : if (k3 < 0) k3 = 0; -<span class="lineNum"> 1216 </span> : if (b < 0) b = 0; else if (b > 1) b = 1; -<span class="lineNum"> 1217 </span> : } -<span class="lineNum"> 1218 </span> : BM25Weight() : k1(1), k2(0), k3(1), b(0.5), min_normlen(0.5), -<span class="lineNum"> 1219 </span> : weight_calculated(false) { } -<span class="lineNum"> 1220 </span> : -<span class="lineNum"> 1221 </span> : BM25Weight * clone() const; -<span class="lineNum"> 1222 </span> : ~BM25Weight() { } -<span class="lineNum"> 1223 </span> : std::string name() const; -<span class="lineNum"> 1224 </span> : std::string serialise() const; -<span class="lineNum"> 1225 </span> : BM25Weight * unserialise(const std::string & s) const; -<span class="lineNum"> 1226 </span> : Xapian::weight get_sumpart(Xapian::termcount wdf, Xapian::doclength len) const; -<span class="lineNum"> 1227 </span> : Xapian::weight get_maxpart() const; -<span class="lineNum"> 1228 </span> : -<span class="lineNum"> 1229 </span> : Xapian::weight get_sumextra(Xapian::doclength len) const; -<span class="lineNum"> 1230 </span> : Xapian::weight get_maxextra() const; -<span class="lineNum"> 1231 </span> : -<span class="lineNum"> 1232 </span> : bool get_sumpart_needs_doclength() const; -<span class="lineNum"> 1233 </span> : }; -<span class="lineNum"> 1234 </span> : -<span class="lineNum"> 1235 </span> : /** Traditional probabilistic weighting scheme. -<span class="lineNum"> 1236 </span> : * -<span class="lineNum"> 1237 </span> : * This class implements the Traditional Probabilistic Weighting scheme, as -<span class="lineNum"> 1238 </span> : * described by the early papers on Probabilistic Retrieval. BM25 generally -<span class="lineNum"> 1239 </span> : * gives better results. -<span class="lineNum"> 1240 </span> : * -<span class="lineNum"> 1241 </span> : * The Traditional weighting scheme formula is \f[ -<span class="lineNum"> 1242 </span> : * \sum_{t}\frac{f_{t,d}}{k.L_{d}+f_{t,d}}.w_{t} -<span class="lineNum"> 1243 </span> : * \f] where -<span class="lineNum"> 1244 </span> : * - \f$w_{t}\f$ is the termweight of term t -<span class="lineNum"> 1245 </span> : * - \f$f_{t,d}\f$ is the within document frequency of term t in document d -<span class="lineNum"> 1246 </span> : * - \f$L_{d}\f$ is the normalised length of document d -<span class="lineNum"> 1247 </span> : * - \f$k\f$ is a user specifiable parameter -<span class="lineNum"> 1248 </span> : * -<span class="lineNum"> 1249 </span> : * TradWeight(k) is equivalent to BM25Weight(k, 0, 0, 1, 0), except that -<span class="lineNum"> 1250 </span> : * the latter returns weights (k+1) times larger. -<span class="lineNum"> 1251 </span> : */ -<span class="lineNum"> 1252 </span> : class XAPIAN_VISIBILITY_DEFAULT TradWeight : public Weight { -<span class="lineNum"> 1253 </span> : private: -<span class="lineNum"> 1254 </span> : mutable Xapian::weight termweight; -<span class="lineNum"> 1255 </span> : mutable Xapian::doclength lenpart; -<span class="lineNum"> 1256 </span> : -<span class="lineNum"> 1257 </span> : double param_k; -<span class="lineNum"> 1258 </span> : -<span class="lineNum"> 1259 </span> : mutable bool weight_calculated; -<span class="lineNum"> 1260 </span> : -<span class="lineNum"> 1261 </span> : void calc_termweight() const; -<span class="lineNum"> 1262 </span> : -<span class="lineNum"> 1263 </span> : public: -<span class="lineNum"> 1264 </span> : /** Construct a TradWeight -<span class="lineNum"> 1265 </span> : * -<span class="lineNum"> 1266 </span> : * @param k parameter governing the importance of within -<span class="lineNum"> 1267 </span> : * document frequency and document length - any non-negative -<span class="lineNum"> 1268 </span> : * number (0 meaning to ignore wdf and doc length when -<span class="lineNum"> 1269 </span> : * calculating weights). Default is 1. -<span class="lineNum"> 1270 </span> : */ -<span class="lineNum"> 1271 </span> : explicit TradWeight(double k) : param_k(k), weight_calculated(false) { -<span class="lineNum"> 1272 </span> : if (param_k < 0) param_k = 0; -<span class="lineNum"> 1273 </span> : } -<span class="lineNum"> 1274 </span> : -<span class="lineNum"> 1275 </span> : TradWeight() : param_k(1.0), weight_calculated(false) { } -<span class="lineNum"> 1276 </span> : -<span class="lineNum"> 1277 </span> : TradWeight * clone() const; -<span class="lineNum"> 1278 </span> : ~TradWeight() { } -<span class="lineNum"> 1279 </span> : std::string name() const; -<span class="lineNum"> 1280 </span> : std::string serialise() const; -<span class="lineNum"> 1281 </span> : TradWeight * unserialise(const std::string & s) const; -<span class="lineNum"> 1282 </span> : -<span class="lineNum"> 1283 </span> : Xapian::weight get_sumpart(Xapian::termcount wdf, Xapian::doclength len) const; -<span class="lineNum"> 1284 </span> : Xapian::weight get_maxpart() const; -<span class="lineNum"> 1285 </span> : -<span class="lineNum"> 1286 </span> : Xapian::weight get_sumextra(Xapian::doclength len) const; -<span class="lineNum"> 1287 </span> : Xapian::weight get_maxextra() const; -<span class="lineNum"> 1288 </span> : -<span class="lineNum"> 1289 </span> : bool get_sumpart_needs_doclength() const; -<span class="lineNum"> 1290 </span> : }; -<span class="lineNum"> 1291 </span> : -<span class="lineNum"> 1292 </span> : } -<span class="lineNum"> 1293 </span> : -<span class="lineNum"> 1294 </span> : #endif /* XAPIAN_INCLUDED_ENQUIRE_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/error.h.gcov.html b/rep/usr/include/xapian/error.h.gcov.html deleted file mode 100644 index 62fba9b..0000000 --- a/rep/usr/include/xapian/error.h.gcov.html +++ /dev/null @@ -1,822 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/error.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - error.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">3</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">0.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">0</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** @file error.h -<span class="lineNum"> 2 </span> : * @brief Hierarchy of classes which Xapian can throw as exceptions. -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Warning: This file is generated by ./generate-exceptions - do not modify directly! */ -<span class="lineNum"> 5 </span> : /* Copyright (C) 2003,2004,2006,2007 Olly Betts -<span class="lineNum"> 6 </span> : * -<span class="lineNum"> 7 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 8 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 9 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 10 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 11 </span> : * -<span class="lineNum"> 12 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : * GNU General Public License for more details. -<span class="lineNum"> 16 </span> : * -<span class="lineNum"> 17 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 18 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 19 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA -<span class="lineNum"> 20 </span> : */ -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : #ifndef XAPIAN_INCLUDED_ERROR_H -<span class="lineNum"> 23 </span> : #define XAPIAN_INCLUDED_ERROR_H -<span class="lineNum"> 24 </span> : -<span class="lineNum"> 25 </span> : #include <string> -<span class="lineNum"> 26 </span> : #include <xapian/deprecated.h> -<span class="lineNum"> 27 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace Xapian { -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : class ErrorHandler; -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : /** All exceptions thrown by Xapian are subclasses of Xapian::Error. -<span class="lineNum"> 34 </span> : * -<span class="lineNum"> 35 </span> : * This class can not be instantiated directly - instead a subclass should -<span class="lineNum"> 36 </span> : * be used. -<span class="lineNum"> 37 </span> : */ -<span class="lineNum"> 38 </span> : class XAPIAN_VISIBILITY_DEFAULT Error { -<span class="lineNum"> 39 </span> : // ErrorHandler needs to be able to access Error::already_handled. -<span class="lineNum"> 40 </span> : friend class ErrorHandler; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : /// Message giving details of the error, intended for human consumption. -<span class="lineNum"> 43 </span> : std::string msg; -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : /** Optional context information. -<span class="lineNum"> 46 </span> : * -<span class="lineNum"> 47 </span> : * This context is intended for use by Xapian::ErrorHandler (for example -<span class="lineNum"> 48 </span> : * so it can know which remote server is unreliable and report the problem -<span class="lineNum"> 49 </span> : * and remove that server from those being searched). But it's typically -<span class="lineNum"> 50 </span> : * a plain-text string, and so also fit for human consumption. -<span class="lineNum"> 51 </span> : */ -<span class="lineNum"> 52 </span> : std::string context; -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : /// The type of this error (e.g. DocNotFoundError.) -<span class="lineNum"> 55 </span> : const char * type; -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** Optional value of 'errno' associated with this error. -<span class="lineNum"> 58 </span> : * -<span class="lineNum"> 59 </span> : * If no value is associated, this member variable will be 0. -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * On UNIX, if this value is < 0, it's a negated h_errno value (giving -<span class="lineNum"> 62 </span> : * an error from gethostbyname() or similar). -<span class="lineNum"> 63 </span> : * -<span class="lineNum"> 64 </span> : * On Windows, if this value is < 0, it's a negated Windows error code -<span class="lineNum"> 65 </span> : * (as given by GetLastError() or WSAGetLastError()). -<span class="lineNum"> 66 </span> : * -<span class="lineNum"> 67 </span> : * NB We don't just call this member "errno" to avoid problems on -<span class="lineNum"> 68 </span> : * platforms where errno is a preprocessor macro. -<span class="lineNum"> 69 </span> : */ -<span class="lineNum"> 70 </span> : int my_errno; -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : /** The error string derived from my_errno. -<span class="lineNum"> 73 </span> : * -<span class="lineNum"> 74 </span> : * This string is generated from my_errno lazily. -<span class="lineNum"> 75 </span> : */ -<span class="lineNum"> 76 </span> : mutable std::string error_string; -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : /// True if this error has already been passed to an ErrorHandler. -<span class="lineNum"> 79 </span> : bool already_handled; -<span class="lineNum"> 80 </span> : -<span class="lineNum"> 81 </span> : /// Don't allow assignment of the base class. -<span class="lineNum"> 82 </span> : void operator=(const Error &o); -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : protected: -<span class="lineNum"> 85 </span> : /** @private @internal -<span class="lineNum"> 86 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 87 </span> : */ -<span class="lineNum"> 88 </span> : Error(const std::string &msg_, const std::string &context_, -<span class="lineNum"> 89 </span> : const char * type_, const char * error_string_); -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : /** @private @internal -<span class="lineNum"> 92 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 93 </span> : */ -<span class="lineNum"> 94 </span> : Error(const std::string &msg_, const std::string &context_, -<span class="lineNum"> 95 </span> : const char * type_, int errno_) -<span class="lineNum"> 96 </span> : : msg(msg_), context(context_), type(type_), my_errno(errno_), -<span class="lineNum"> 97 </span> : error_string(), already_handled(false) { } -<span class="lineNum"> 98 </span> : -<span class="lineNum"> 99 </span> : public: -<span class="lineNum"> 100 </span> : /// The type of this error (e.g. "DocNotFoundError".) -<span class="lineNum"> 101 </span><span class="lineNoCov"> 0 : const char * get_type() const { return type; }</span> -<span class="lineNum"> 102 </span> : -<span class="lineNum"> 103 </span> : /// Message giving details of the error, intended for human consumption. -<span class="lineNum"> 104 </span><span class="lineNoCov"> 0 : const std::string & get_msg() const { return msg; }</span> -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : /** Optional context information. -<span class="lineNum"> 107 </span> : * -<span class="lineNum"> 108 </span> : * This context is intended for use by Xapian::ErrorHandler (for example -<span class="lineNum"> 109 </span> : * so it can know which remote server is unreliable and report the problem -<span class="lineNum"> 110 </span> : * and remove that server from those being searched). But it's typically -<span class="lineNum"> 111 </span> : * a plain-text string, and so also fit for human consumption. -<span class="lineNum"> 112 </span> : */ -<span class="lineNum"> 113 </span><span class="lineNoCov"> 0 : const std::string & get_context() const { return context; }</span> -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : /** Returns any system error string associated with this exception. -<span class="lineNum"> 116 </span> : * -<span class="lineNum"> 117 </span> : * The system error string may come from errno, h_errno (on UNIX), or -<span class="lineNum"> 118 </span> : * GetLastError() (on MS Windows). If there is no associated system -<span class="lineNum"> 119 </span> : * error string, NULL is returned. -<span class="lineNum"> 120 </span> : */ -<span class="lineNum"> 121 </span> : const char * get_error_string() const; -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : /** Optional value of 'errno' associated with this error. -<span class="lineNum"> 124 </span> : * -<span class="lineNum"> 125 </span> : * If no 'errno' value is associated, returns 0. If the returned value -<span class="lineNum"> 126 </span> : * is negative, it's a platform-specific error code (on UNIX, -h_errno; -<span class="lineNum"> 127 </span> : * on MS Windows, -GetLastError()). -<span class="lineNum"> 128 </span> : * -<span class="lineNum"> 129 </span> : * @deprecated This method is deprecated, because errno values aren't -<span class="lineNum"> 130 </span> : * portable between platforms, so we can't serialise them when passing -<span class="lineNum"> 131 </span> : * exceptions from a remote server to a client. Use the -<span class="lineNum"> 132 </span> : * get_error_string() method instead. -<span class="lineNum"> 133 </span> : */ -<span class="lineNum"> 134 </span> : XAPIAN_DEPRECATED(int get_errno() const); -<span class="lineNum"> 135 </span> : -<span class="lineNum"> 136 </span> : /// Return a string describing this object. -<span class="lineNum"> 137 </span> : std::string get_description() const; -<span class="lineNum"> 138 </span> : }; -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : inline int Xapian::Error::get_errno() const { return my_errno; } -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : /** The base class for exceptions indicating errors in the program logic. -<span class="lineNum"> 143 </span> : * -<span class="lineNum"> 144 </span> : * A subclass of LogicError will be thrown if Xapian detects a violation -<span class="lineNum"> 145 </span> : * of a class invariant or a logical precondition or postcondition, etc. -<span class="lineNum"> 146 </span> : */ -<span class="lineNum"> 147 </span> : class XAPIAN_VISIBILITY_DEFAULT LogicError : public Error { -<span class="lineNum"> 148 </span> : protected: -<span class="lineNum"> 149 </span> : /** @private @internal -<span class="lineNum"> 150 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 151 </span> : */ -<span class="lineNum"> 152 </span> : LogicError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 153 </span> : : Error(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : /** @private @internal -<span class="lineNum"> 156 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 157 </span> : */ -<span class="lineNum"> 158 </span> : LogicError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 159 </span> : : Error(msg_, context_, type_, errno_) {} -<span class="lineNum"> 160 </span> : }; -<span class="lineNum"> 161 </span> : -<span class="lineNum"> 162 </span> : /** The base class for exceptions indicating errors only detectable at runtime. -<span class="lineNum"> 163 </span> : * -<span class="lineNum"> 164 </span> : * A subclass of RuntimeError will be thrown if Xapian detects an error -<span class="lineNum"> 165 </span> : * which is exception derived from RuntimeError is thrown when an -<span class="lineNum"> 166 </span> : * error is caused by problems with the data or environment rather -<span class="lineNum"> 167 </span> : * than a programming mistake. -<span class="lineNum"> 168 </span> : */ -<span class="lineNum"> 169 </span> : class XAPIAN_VISIBILITY_DEFAULT RuntimeError : public Error { -<span class="lineNum"> 170 </span> : protected: -<span class="lineNum"> 171 </span> : /** @private @internal -<span class="lineNum"> 172 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 173 </span> : */ -<span class="lineNum"> 174 </span> : RuntimeError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 175 </span> : : Error(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 176 </span> : -<span class="lineNum"> 177 </span> : /** @private @internal -<span class="lineNum"> 178 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 179 </span> : */ -<span class="lineNum"> 180 </span> : RuntimeError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 181 </span> : : Error(msg_, context_, type_, errno_) {} -<span class="lineNum"> 182 </span> : }; -<span class="lineNum"> 183 </span> : -<span class="lineNum"> 184 </span> : /** AssertionError is thrown if a logical assertion inside Xapian fails. -<span class="lineNum"> 185 </span> : * -<span class="lineNum"> 186 </span> : * In a debug build of Xapian, a failed assertion in the core library code -<span class="lineNum"> 187 </span> : * will cause AssertionError to be thrown. -<span class="lineNum"> 188 </span> : * -<span class="lineNum"> 189 </span> : * This represents a bug in Xapian (either an invariant, precondition, etc -<span class="lineNum"> 190 </span> : * has been violated, or the assertion is incorrect!) -<span class="lineNum"> 191 </span> : */ -<span class="lineNum"> 192 </span> : class XAPIAN_VISIBILITY_DEFAULT AssertionError : public LogicError { -<span class="lineNum"> 193 </span> : public: -<span class="lineNum"> 194 </span> : /** @private @internal -<span class="lineNum"> 195 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 196 </span> : * -<span class="lineNum"> 197 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 198 </span> : */ -<span class="lineNum"> 199 </span> : AssertionError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 200 </span> : : LogicError(msg_, context_, "AssertionError", error_string_) {} -<span class="lineNum"> 201 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 202 </span> : explicit AssertionError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 203 </span> : : LogicError(msg_, context_, "AssertionError", errno_) {} -<span class="lineNum"> 204 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 205 </span> : AssertionError(const std::string &msg_, int errno_) -<span class="lineNum"> 206 </span> : : LogicError(msg_, "", "AssertionError", errno_) {} -<span class="lineNum"> 207 </span> : protected: -<span class="lineNum"> 208 </span> : /** @private @internal -<span class="lineNum"> 209 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 210 </span> : */ -<span class="lineNum"> 211 </span> : AssertionError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 212 </span> : : LogicError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : /** @private @internal -<span class="lineNum"> 215 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 216 </span> : */ -<span class="lineNum"> 217 </span> : AssertionError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 218 </span> : : LogicError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 219 </span> : }; -<span class="lineNum"> 220 </span> : -<span class="lineNum"> 221 </span> : /** InvalidArgumentError indicates an invalid parameter value was passed to the API. -<span class="lineNum"> 222 </span> : */ -<span class="lineNum"> 223 </span> : class XAPIAN_VISIBILITY_DEFAULT InvalidArgumentError : public LogicError { -<span class="lineNum"> 224 </span> : public: -<span class="lineNum"> 225 </span> : /** @private @internal -<span class="lineNum"> 226 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 227 </span> : * -<span class="lineNum"> 228 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 229 </span> : */ -<span class="lineNum"> 230 </span> : InvalidArgumentError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 231 </span> : : LogicError(msg_, context_, "InvalidArgumentError", error_string_) {} -<span class="lineNum"> 232 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 233 </span> : explicit InvalidArgumentError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 234 </span> : : LogicError(msg_, context_, "InvalidArgumentError", errno_) {} -<span class="lineNum"> 235 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 236 </span> : InvalidArgumentError(const std::string &msg_, int errno_) -<span class="lineNum"> 237 </span> : : LogicError(msg_, "", "InvalidArgumentError", errno_) {} -<span class="lineNum"> 238 </span> : protected: -<span class="lineNum"> 239 </span> : /** @private @internal -<span class="lineNum"> 240 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 241 </span> : */ -<span class="lineNum"> 242 </span> : InvalidArgumentError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 243 </span> : : LogicError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 244 </span> : -<span class="lineNum"> 245 </span> : /** @private @internal -<span class="lineNum"> 246 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 247 </span> : */ -<span class="lineNum"> 248 </span> : InvalidArgumentError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 249 </span> : : LogicError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 250 </span> : }; -<span class="lineNum"> 251 </span> : -<span class="lineNum"> 252 </span> : /** InvalidOperationError indicates the API was used in an invalid way. -<span class="lineNum"> 253 </span> : */ -<span class="lineNum"> 254 </span> : class XAPIAN_VISIBILITY_DEFAULT InvalidOperationError : public LogicError { -<span class="lineNum"> 255 </span> : public: -<span class="lineNum"> 256 </span> : /** @private @internal -<span class="lineNum"> 257 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 258 </span> : * -<span class="lineNum"> 259 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 260 </span> : */ -<span class="lineNum"> 261 </span> : InvalidOperationError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 262 </span> : : LogicError(msg_, context_, "InvalidOperationError", error_string_) {} -<span class="lineNum"> 263 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 264 </span> : explicit InvalidOperationError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 265 </span> : : LogicError(msg_, context_, "InvalidOperationError", errno_) {} -<span class="lineNum"> 266 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 267 </span> : InvalidOperationError(const std::string &msg_, int errno_) -<span class="lineNum"> 268 </span> : : LogicError(msg_, "", "InvalidOperationError", errno_) {} -<span class="lineNum"> 269 </span> : protected: -<span class="lineNum"> 270 </span> : /** @private @internal -<span class="lineNum"> 271 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 272 </span> : */ -<span class="lineNum"> 273 </span> : InvalidOperationError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 274 </span> : : LogicError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : /** @private @internal -<span class="lineNum"> 277 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 278 </span> : */ -<span class="lineNum"> 279 </span> : InvalidOperationError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 280 </span> : : LogicError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 281 </span> : }; -<span class="lineNum"> 282 </span> : -<span class="lineNum"> 283 </span> : /** UnimplementedError indicates an attempt to use an unimplemented feature. */ -<span class="lineNum"> 284 </span> : class XAPIAN_VISIBILITY_DEFAULT UnimplementedError : public LogicError { -<span class="lineNum"> 285 </span> : public: -<span class="lineNum"> 286 </span> : /** @private @internal -<span class="lineNum"> 287 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 288 </span> : * -<span class="lineNum"> 289 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 290 </span> : */ -<span class="lineNum"> 291 </span> : UnimplementedError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 292 </span> : : LogicError(msg_, context_, "UnimplementedError", error_string_) {} -<span class="lineNum"> 293 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 294 </span> : explicit UnimplementedError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 295 </span> : : LogicError(msg_, context_, "UnimplementedError", errno_) {} -<span class="lineNum"> 296 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 297 </span> : UnimplementedError(const std::string &msg_, int errno_) -<span class="lineNum"> 298 </span> : : LogicError(msg_, "", "UnimplementedError", errno_) {} -<span class="lineNum"> 299 </span> : protected: -<span class="lineNum"> 300 </span> : /** @private @internal -<span class="lineNum"> 301 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 302 </span> : */ -<span class="lineNum"> 303 </span> : UnimplementedError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 304 </span> : : LogicError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 305 </span> : -<span class="lineNum"> 306 </span> : /** @private @internal -<span class="lineNum"> 307 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 308 </span> : */ -<span class="lineNum"> 309 </span> : UnimplementedError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 310 </span> : : LogicError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 311 </span> : }; -<span class="lineNum"> 312 </span> : -<span class="lineNum"> 313 </span> : /** DatabaseError indicates some sort of database related error. */ -<span class="lineNum"> 314 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseError : public RuntimeError { -<span class="lineNum"> 315 </span> : public: -<span class="lineNum"> 316 </span> : /** @private @internal -<span class="lineNum"> 317 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 318 </span> : * -<span class="lineNum"> 319 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 320 </span> : */ -<span class="lineNum"> 321 </span> : DatabaseError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 322 </span> : : RuntimeError(msg_, context_, "DatabaseError", error_string_) {} -<span class="lineNum"> 323 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 324 </span> : explicit DatabaseError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 325 </span> : : RuntimeError(msg_, context_, "DatabaseError", errno_) {} -<span class="lineNum"> 326 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 327 </span> : DatabaseError(const std::string &msg_, int errno_) -<span class="lineNum"> 328 </span> : : RuntimeError(msg_, "", "DatabaseError", errno_) {} -<span class="lineNum"> 329 </span> : protected: -<span class="lineNum"> 330 </span> : /** @private @internal -<span class="lineNum"> 331 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 332 </span> : */ -<span class="lineNum"> 333 </span> : DatabaseError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 334 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 335 </span> : -<span class="lineNum"> 336 </span> : /** @private @internal -<span class="lineNum"> 337 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 338 </span> : */ -<span class="lineNum"> 339 </span> : DatabaseError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 340 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 341 </span> : }; -<span class="lineNum"> 342 </span> : -<span class="lineNum"> 343 </span> : /** DatabaseCorruptError indicates database corruption was detected. */ -<span class="lineNum"> 344 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseCorruptError : public DatabaseError { -<span class="lineNum"> 345 </span> : public: -<span class="lineNum"> 346 </span> : /** @private @internal -<span class="lineNum"> 347 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 348 </span> : * -<span class="lineNum"> 349 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 350 </span> : */ -<span class="lineNum"> 351 </span> : DatabaseCorruptError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 352 </span> : : DatabaseError(msg_, context_, "DatabaseCorruptError", error_string_) {} -<span class="lineNum"> 353 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 354 </span> : explicit DatabaseCorruptError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 355 </span> : : DatabaseError(msg_, context_, "DatabaseCorruptError", errno_) {} -<span class="lineNum"> 356 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 357 </span> : DatabaseCorruptError(const std::string &msg_, int errno_) -<span class="lineNum"> 358 </span> : : DatabaseError(msg_, "", "DatabaseCorruptError", errno_) {} -<span class="lineNum"> 359 </span> : protected: -<span class="lineNum"> 360 </span> : /** @private @internal -<span class="lineNum"> 361 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 362 </span> : */ -<span class="lineNum"> 363 </span> : DatabaseCorruptError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 364 </span> : : DatabaseError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 365 </span> : -<span class="lineNum"> 366 </span> : /** @private @internal -<span class="lineNum"> 367 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 368 </span> : */ -<span class="lineNum"> 369 </span> : DatabaseCorruptError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 370 </span> : : DatabaseError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 371 </span> : }; -<span class="lineNum"> 372 </span> : -<span class="lineNum"> 373 </span> : /** DatabaseCreateError indicates a failure to create a database. */ -<span class="lineNum"> 374 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseCreateError : public DatabaseError { -<span class="lineNum"> 375 </span> : public: -<span class="lineNum"> 376 </span> : /** @private @internal -<span class="lineNum"> 377 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 378 </span> : * -<span class="lineNum"> 379 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 380 </span> : */ -<span class="lineNum"> 381 </span> : DatabaseCreateError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 382 </span> : : DatabaseError(msg_, context_, "DatabaseCreateError", error_string_) {} -<span class="lineNum"> 383 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 384 </span> : explicit DatabaseCreateError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 385 </span> : : DatabaseError(msg_, context_, "DatabaseCreateError", errno_) {} -<span class="lineNum"> 386 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 387 </span> : DatabaseCreateError(const std::string &msg_, int errno_) -<span class="lineNum"> 388 </span> : : DatabaseError(msg_, "", "DatabaseCreateError", errno_) {} -<span class="lineNum"> 389 </span> : protected: -<span class="lineNum"> 390 </span> : /** @private @internal -<span class="lineNum"> 391 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 392 </span> : */ -<span class="lineNum"> 393 </span> : DatabaseCreateError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 394 </span> : : DatabaseError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 395 </span> : -<span class="lineNum"> 396 </span> : /** @private @internal -<span class="lineNum"> 397 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 398 </span> : */ -<span class="lineNum"> 399 </span> : DatabaseCreateError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 400 </span> : : DatabaseError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 401 </span> : }; -<span class="lineNum"> 402 </span> : -<span class="lineNum"> 403 </span> : /** DatabaseLockError indicates failure to lock a database. */ -<span class="lineNum"> 404 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseLockError : public DatabaseError { -<span class="lineNum"> 405 </span> : public: -<span class="lineNum"> 406 </span> : /** @private @internal -<span class="lineNum"> 407 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 408 </span> : * -<span class="lineNum"> 409 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 410 </span> : */ -<span class="lineNum"> 411 </span> : DatabaseLockError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 412 </span> : : DatabaseError(msg_, context_, "DatabaseLockError", error_string_) {} -<span class="lineNum"> 413 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 414 </span> : explicit DatabaseLockError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 415 </span> : : DatabaseError(msg_, context_, "DatabaseLockError", errno_) {} -<span class="lineNum"> 416 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 417 </span> : DatabaseLockError(const std::string &msg_, int errno_) -<span class="lineNum"> 418 </span> : : DatabaseError(msg_, "", "DatabaseLockError", errno_) {} -<span class="lineNum"> 419 </span> : protected: -<span class="lineNum"> 420 </span> : /** @private @internal -<span class="lineNum"> 421 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 422 </span> : */ -<span class="lineNum"> 423 </span> : DatabaseLockError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 424 </span> : : DatabaseError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : /** @private @internal -<span class="lineNum"> 427 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 428 </span> : */ -<span class="lineNum"> 429 </span> : DatabaseLockError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 430 </span> : : DatabaseError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 431 </span> : }; -<span class="lineNum"> 432 </span> : -<span class="lineNum"> 433 </span> : /** DatabaseModifiedError indicates a database was modified. -<span class="lineNum"> 434 </span> : * -<span class="lineNum"> 435 </span> : * To recover after catching this error, you need to call -<span class="lineNum"> 436 </span> : * Xapian::Database::reopen() on the Database and repeat the operation -<span class="lineNum"> 437 </span> : * which failed. -<span class="lineNum"> 438 </span> : */ -<span class="lineNum"> 439 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseModifiedError : public DatabaseError { -<span class="lineNum"> 440 </span> : public: -<span class="lineNum"> 441 </span> : /** @private @internal -<span class="lineNum"> 442 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 443 </span> : * -<span class="lineNum"> 444 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 445 </span> : */ -<span class="lineNum"> 446 </span> : DatabaseModifiedError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 447 </span> : : DatabaseError(msg_, context_, "DatabaseModifiedError", error_string_) {} -<span class="lineNum"> 448 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 449 </span> : explicit DatabaseModifiedError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 450 </span> : : DatabaseError(msg_, context_, "DatabaseModifiedError", errno_) {} -<span class="lineNum"> 451 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 452 </span> : DatabaseModifiedError(const std::string &msg_, int errno_) -<span class="lineNum"> 453 </span> : : DatabaseError(msg_, "", "DatabaseModifiedError", errno_) {} -<span class="lineNum"> 454 </span> : protected: -<span class="lineNum"> 455 </span> : /** @private @internal -<span class="lineNum"> 456 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 457 </span> : */ -<span class="lineNum"> 458 </span> : DatabaseModifiedError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 459 </span> : : DatabaseError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 460 </span> : -<span class="lineNum"> 461 </span> : /** @private @internal -<span class="lineNum"> 462 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 463 </span> : */ -<span class="lineNum"> 464 </span> : DatabaseModifiedError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 465 </span> : : DatabaseError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 466 </span> : }; -<span class="lineNum"> 467 </span> : -<span class="lineNum"> 468 </span> : /** DatabaseOpeningError indicates failure to open a database. */ -<span class="lineNum"> 469 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseOpeningError : public DatabaseError { -<span class="lineNum"> 470 </span> : public: -<span class="lineNum"> 471 </span> : /** @private @internal -<span class="lineNum"> 472 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 473 </span> : * -<span class="lineNum"> 474 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 475 </span> : */ -<span class="lineNum"> 476 </span> : DatabaseOpeningError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 477 </span> : : DatabaseError(msg_, context_, "DatabaseOpeningError", error_string_) {} -<span class="lineNum"> 478 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 479 </span> : explicit DatabaseOpeningError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 480 </span> : : DatabaseError(msg_, context_, "DatabaseOpeningError", errno_) {} -<span class="lineNum"> 481 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 482 </span> : DatabaseOpeningError(const std::string &msg_, int errno_) -<span class="lineNum"> 483 </span> : : DatabaseError(msg_, "", "DatabaseOpeningError", errno_) {} -<span class="lineNum"> 484 </span> : protected: -<span class="lineNum"> 485 </span> : /** @private @internal -<span class="lineNum"> 486 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 487 </span> : */ -<span class="lineNum"> 488 </span> : DatabaseOpeningError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 489 </span> : : DatabaseError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 490 </span> : -<span class="lineNum"> 491 </span> : /** @private @internal -<span class="lineNum"> 492 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 493 </span> : */ -<span class="lineNum"> 494 </span> : DatabaseOpeningError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 495 </span> : : DatabaseError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 496 </span> : }; -<span class="lineNum"> 497 </span> : -<span class="lineNum"> 498 </span> : /** DatabaseVersionError indicates that a database is in an unsupported format. -<span class="lineNum"> 499 </span> : * -<span class="lineNum"> 500 </span> : * From time to time, new versions of Xapian will require the database format -<span class="lineNum"> 501 </span> : * to be changed, to allow new information to be stored or new optimisations -<span class="lineNum"> 502 </span> : * to be performed. Backwards compatibility will sometimes be maintained, so -<span class="lineNum"> 503 </span> : * that new versions of Xapian can open old databases, but in some cases -<span class="lineNum"> 504 </span> : * Xapian will be unable to open a database because it is in too old (or new) -<span class="lineNum"> 505 </span> : * a format. This can be resolved either be upgrading or downgrading the -<span class="lineNum"> 506 </span> : * version of Xapian in use, or by rebuilding the database from scratch with -<span class="lineNum"> 507 </span> : * the current version of Xapian. -<span class="lineNum"> 508 </span> : */ -<span class="lineNum"> 509 </span> : class XAPIAN_VISIBILITY_DEFAULT DatabaseVersionError : public DatabaseOpeningError { -<span class="lineNum"> 510 </span> : public: -<span class="lineNum"> 511 </span> : /** @private @internal -<span class="lineNum"> 512 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 513 </span> : * -<span class="lineNum"> 514 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 515 </span> : */ -<span class="lineNum"> 516 </span> : DatabaseVersionError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 517 </span> : : DatabaseOpeningError(msg_, context_, "DatabaseVersionError", error_string_) {} -<span class="lineNum"> 518 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 519 </span> : explicit DatabaseVersionError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 520 </span> : : DatabaseOpeningError(msg_, context_, "DatabaseVersionError", errno_) {} -<span class="lineNum"> 521 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 522 </span> : DatabaseVersionError(const std::string &msg_, int errno_) -<span class="lineNum"> 523 </span> : : DatabaseOpeningError(msg_, "", "DatabaseVersionError", errno_) {} -<span class="lineNum"> 524 </span> : protected: -<span class="lineNum"> 525 </span> : /** @private @internal -<span class="lineNum"> 526 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 527 </span> : */ -<span class="lineNum"> 528 </span> : DatabaseVersionError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 529 </span> : : DatabaseOpeningError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 530 </span> : -<span class="lineNum"> 531 </span> : /** @private @internal -<span class="lineNum"> 532 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 533 </span> : */ -<span class="lineNum"> 534 </span> : DatabaseVersionError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 535 </span> : : DatabaseOpeningError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 536 </span> : }; -<span class="lineNum"> 537 </span> : -<span class="lineNum"> 538 </span> : /** Indicates an attempt to access a document not present in the database. */ -<span class="lineNum"> 539 </span> : class XAPIAN_VISIBILITY_DEFAULT DocNotFoundError : public RuntimeError { -<span class="lineNum"> 540 </span> : public: -<span class="lineNum"> 541 </span> : /** @private @internal -<span class="lineNum"> 542 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 543 </span> : * -<span class="lineNum"> 544 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 545 </span> : */ -<span class="lineNum"> 546 </span> : DocNotFoundError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 547 </span> : : RuntimeError(msg_, context_, "DocNotFoundError", error_string_) {} -<span class="lineNum"> 548 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 549 </span> : explicit DocNotFoundError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 550 </span> : : RuntimeError(msg_, context_, "DocNotFoundError", errno_) {} -<span class="lineNum"> 551 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 552 </span> : DocNotFoundError(const std::string &msg_, int errno_) -<span class="lineNum"> 553 </span> : : RuntimeError(msg_, "", "DocNotFoundError", errno_) {} -<span class="lineNum"> 554 </span> : protected: -<span class="lineNum"> 555 </span> : /** @private @internal -<span class="lineNum"> 556 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 557 </span> : */ -<span class="lineNum"> 558 </span> : DocNotFoundError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 559 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 560 </span> : -<span class="lineNum"> 561 </span> : /** @private @internal -<span class="lineNum"> 562 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 563 </span> : */ -<span class="lineNum"> 564 </span> : DocNotFoundError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 565 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 566 </span> : }; -<span class="lineNum"> 567 </span> : -<span class="lineNum"> 568 </span> : /** Indicates an attempt to use a feature which is unavailable. -<span class="lineNum"> 569 </span> : * -<span class="lineNum"> 570 </span> : * Typically a feature is unavailable because it wasn't compiled in, or -<span class="lineNum"> 571 </span> : * because it requires other software or facilities which aren't available. -<span class="lineNum"> 572 </span> : */ -<span class="lineNum"> 573 </span> : class XAPIAN_VISIBILITY_DEFAULT FeatureUnavailableError : public RuntimeError { -<span class="lineNum"> 574 </span> : public: -<span class="lineNum"> 575 </span> : /** @private @internal -<span class="lineNum"> 576 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 577 </span> : * -<span class="lineNum"> 578 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 579 </span> : */ -<span class="lineNum"> 580 </span> : FeatureUnavailableError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 581 </span> : : RuntimeError(msg_, context_, "FeatureUnavailableError", error_string_) {} -<span class="lineNum"> 582 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 583 </span> : explicit FeatureUnavailableError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 584 </span> : : RuntimeError(msg_, context_, "FeatureUnavailableError", errno_) {} -<span class="lineNum"> 585 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 586 </span> : FeatureUnavailableError(const std::string &msg_, int errno_) -<span class="lineNum"> 587 </span> : : RuntimeError(msg_, "", "FeatureUnavailableError", errno_) {} -<span class="lineNum"> 588 </span> : protected: -<span class="lineNum"> 589 </span> : /** @private @internal -<span class="lineNum"> 590 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 591 </span> : */ -<span class="lineNum"> 592 </span> : FeatureUnavailableError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 593 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 594 </span> : -<span class="lineNum"> 595 </span> : /** @private @internal -<span class="lineNum"> 596 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 597 </span> : */ -<span class="lineNum"> 598 </span> : FeatureUnavailableError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 599 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 600 </span> : }; -<span class="lineNum"> 601 </span> : -<span class="lineNum"> 602 </span> : /** InternalError indicates a runtime problem of some sort. */ -<span class="lineNum"> 603 </span> : class XAPIAN_VISIBILITY_DEFAULT InternalError : public RuntimeError { -<span class="lineNum"> 604 </span> : public: -<span class="lineNum"> 605 </span> : /** @private @internal -<span class="lineNum"> 606 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 607 </span> : * -<span class="lineNum"> 608 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 609 </span> : */ -<span class="lineNum"> 610 </span> : InternalError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 611 </span> : : RuntimeError(msg_, context_, "InternalError", error_string_) {} -<span class="lineNum"> 612 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 613 </span> : explicit InternalError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 614 </span> : : RuntimeError(msg_, context_, "InternalError", errno_) {} -<span class="lineNum"> 615 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 616 </span> : InternalError(const std::string &msg_, int errno_) -<span class="lineNum"> 617 </span> : : RuntimeError(msg_, "", "InternalError", errno_) {} -<span class="lineNum"> 618 </span> : protected: -<span class="lineNum"> 619 </span> : /** @private @internal -<span class="lineNum"> 620 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 621 </span> : */ -<span class="lineNum"> 622 </span> : InternalError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 623 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 624 </span> : -<span class="lineNum"> 625 </span> : /** @private @internal -<span class="lineNum"> 626 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 627 </span> : */ -<span class="lineNum"> 628 </span> : InternalError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 629 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 630 </span> : }; -<span class="lineNum"> 631 </span> : -<span class="lineNum"> 632 </span> : /** Indicates a problem communicating with a remote database. */ -<span class="lineNum"> 633 </span> : class XAPIAN_VISIBILITY_DEFAULT NetworkError : public RuntimeError { -<span class="lineNum"> 634 </span> : public: -<span class="lineNum"> 635 </span> : /** @private @internal -<span class="lineNum"> 636 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 637 </span> : * -<span class="lineNum"> 638 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 639 </span> : */ -<span class="lineNum"> 640 </span> : NetworkError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 641 </span> : : RuntimeError(msg_, context_, "NetworkError", error_string_) {} -<span class="lineNum"> 642 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 643 </span> : explicit NetworkError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 644 </span> : : RuntimeError(msg_, context_, "NetworkError", errno_) {} -<span class="lineNum"> 645 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 646 </span> : NetworkError(const std::string &msg_, int errno_) -<span class="lineNum"> 647 </span> : : RuntimeError(msg_, "", "NetworkError", errno_) {} -<span class="lineNum"> 648 </span> : protected: -<span class="lineNum"> 649 </span> : /** @private @internal -<span class="lineNum"> 650 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 651 </span> : */ -<span class="lineNum"> 652 </span> : NetworkError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 653 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 654 </span> : -<span class="lineNum"> 655 </span> : /** @private @internal -<span class="lineNum"> 656 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 657 </span> : */ -<span class="lineNum"> 658 </span> : NetworkError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 659 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 660 </span> : }; -<span class="lineNum"> 661 </span> : -<span class="lineNum"> 662 </span> : /** Indicates a timeout expired while communicating with a remote database. */ -<span class="lineNum"> 663 </span> : class XAPIAN_VISIBILITY_DEFAULT NetworkTimeoutError : public NetworkError { -<span class="lineNum"> 664 </span> : public: -<span class="lineNum"> 665 </span> : /** @private @internal -<span class="lineNum"> 666 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 667 </span> : * -<span class="lineNum"> 668 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 669 </span> : */ -<span class="lineNum"> 670 </span> : NetworkTimeoutError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 671 </span> : : NetworkError(msg_, context_, "NetworkTimeoutError", error_string_) {} -<span class="lineNum"> 672 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 673 </span> : explicit NetworkTimeoutError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 674 </span> : : NetworkError(msg_, context_, "NetworkTimeoutError", errno_) {} -<span class="lineNum"> 675 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 676 </span> : NetworkTimeoutError(const std::string &msg_, int errno_) -<span class="lineNum"> 677 </span> : : NetworkError(msg_, "", "NetworkTimeoutError", errno_) {} -<span class="lineNum"> 678 </span> : protected: -<span class="lineNum"> 679 </span> : /** @private @internal -<span class="lineNum"> 680 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 681 </span> : */ -<span class="lineNum"> 682 </span> : NetworkTimeoutError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 683 </span> : : NetworkError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 684 </span> : -<span class="lineNum"> 685 </span> : /** @private @internal -<span class="lineNum"> 686 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 687 </span> : */ -<span class="lineNum"> 688 </span> : NetworkTimeoutError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 689 </span> : : NetworkError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 690 </span> : }; -<span class="lineNum"> 691 </span> : -<span class="lineNum"> 692 </span> : /** Indicates a query string can't be parsed. */ -<span class="lineNum"> 693 </span> : class XAPIAN_VISIBILITY_DEFAULT QueryParserError : public RuntimeError { -<span class="lineNum"> 694 </span> : public: -<span class="lineNum"> 695 </span> : /** @private @internal -<span class="lineNum"> 696 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 697 </span> : * -<span class="lineNum"> 698 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 699 </span> : */ -<span class="lineNum"> 700 </span> : QueryParserError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 701 </span> : : RuntimeError(msg_, context_, "QueryParserError", error_string_) {} -<span class="lineNum"> 702 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 703 </span> : explicit QueryParserError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 704 </span> : : RuntimeError(msg_, context_, "QueryParserError", errno_) {} -<span class="lineNum"> 705 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 706 </span> : QueryParserError(const std::string &msg_, int errno_) -<span class="lineNum"> 707 </span> : : RuntimeError(msg_, "", "QueryParserError", errno_) {} -<span class="lineNum"> 708 </span> : protected: -<span class="lineNum"> 709 </span> : /** @private @internal -<span class="lineNum"> 710 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 711 </span> : */ -<span class="lineNum"> 712 </span> : QueryParserError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 713 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 714 </span> : -<span class="lineNum"> 715 </span> : /** @private @internal -<span class="lineNum"> 716 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 717 </span> : */ -<span class="lineNum"> 718 </span> : QueryParserError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 719 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 720 </span> : }; -<span class="lineNum"> 721 </span> : -<span class="lineNum"> 722 </span> : /** RangeError indicates an attempt to access outside the bounds of a container. -<span class="lineNum"> 723 </span> : */ -<span class="lineNum"> 724 </span> : class XAPIAN_VISIBILITY_DEFAULT RangeError : public RuntimeError { -<span class="lineNum"> 725 </span> : public: -<span class="lineNum"> 726 </span> : /** @private @internal -<span class="lineNum"> 727 </span> : * @brief Private constructor for use by remote backend. -<span class="lineNum"> 728 </span> : * -<span class="lineNum"> 729 </span> : * @param error_string_ Optional string describing error. May be NULL. -<span class="lineNum"> 730 </span> : */ -<span class="lineNum"> 731 </span> : RangeError(const std::string &msg_, const std::string &context_, const char * error_string_) -<span class="lineNum"> 732 </span> : : RuntimeError(msg_, context_, "RangeError", error_string_) {} -<span class="lineNum"> 733 </span> : /** General purpose constructor which allows setting errno. */ -<span class="lineNum"> 734 </span> : explicit RangeError(const std::string &msg_, const std::string &context_ = "", int errno_ = 0) -<span class="lineNum"> 735 </span> : : RuntimeError(msg_, context_, "RangeError", errno_) {} -<span class="lineNum"> 736 </span> : /** Construct from message and errno value. */ -<span class="lineNum"> 737 </span> : RangeError(const std::string &msg_, int errno_) -<span class="lineNum"> 738 </span> : : RuntimeError(msg_, "", "RangeError", errno_) {} -<span class="lineNum"> 739 </span> : protected: -<span class="lineNum"> 740 </span> : /** @private @internal -<span class="lineNum"> 741 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 742 </span> : */ -<span class="lineNum"> 743 </span> : RangeError(const std::string &msg_, const std::string &context_, const char * type_, const char * error_string_) -<span class="lineNum"> 744 </span> : : RuntimeError(msg_, context_, type_, error_string_) {} -<span class="lineNum"> 745 </span> : -<span class="lineNum"> 746 </span> : /** @private @internal -<span class="lineNum"> 747 </span> : * @brief Constructor for use by constructors of derived classes. -<span class="lineNum"> 748 </span> : */ -<span class="lineNum"> 749 </span> : RangeError(const std::string &msg_, const std::string &context_, const char * type_, int errno_) -<span class="lineNum"> 750 </span> : : RuntimeError(msg_, context_, type_, errno_) {} -<span class="lineNum"> 751 </span> : }; -<span class="lineNum"> 752 </span> : -<span class="lineNum"> 753 </span> : } -<span class="lineNum"> 754 </span> : -<span class="lineNum"> 755 </span> : #endif /* XAPIAN_INCLUDED_ERROR_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/expanddecider.h.gcov.html b/rep/usr/include/xapian/expanddecider.h.gcov.html deleted file mode 100644 index fabaa14..0000000 --- a/rep/usr/include/xapian/expanddecider.h.gcov.html +++ /dev/null @@ -1,155 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/expanddecider.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - expanddecider.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">1</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** @file expanddecider.h -<span class="lineNum"> 2 </span> : * @brief Allow rejection of terms during ESet generation. -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright (C) 2007 Olly Betts -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 7 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 8 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 9 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : * GNU General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 17 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef XAPIAN_INCLUDED_EXPANDDECIDER_H -<span class="lineNum"> 22 </span> : #define XAPIAN_INCLUDED_EXPANDDECIDER_H -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <set> -<span class="lineNum"> 25 </span> : #include <string> -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : namespace Xapian { -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /** Virtual base class for expand decider functor. */ -<span class="lineNum"> 32 </span><span class="lineCov"> 5 : class XAPIAN_VISIBILITY_DEFAULT ExpandDecider {</span> -<span class="lineNum"> 33 </span> : public: -<span class="lineNum"> 34 </span> : /** Do we want this term in the ESet? */ -<span class="lineNum"> 35 </span> : virtual bool operator()(const std::string &term) const = 0; -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : /** Virtual destructor, because we have virtual methods. */ -<span class="lineNum"> 38 </span> : virtual ~ExpandDecider(); -<span class="lineNum"> 39 </span> : }; -<span class="lineNum"> 40 </span> : -<span class="lineNum"> 41 </span> : /** ExpandDecider subclass which rejects terms using two ExpandDeciders. -<span class="lineNum"> 42 </span> : * -<span class="lineNum"> 43 </span> : * Terms are only accepted if they are accepted by both of the specified -<span class="lineNum"> 44 </span> : * ExpandDecider objects. -<span class="lineNum"> 45 </span> : */ -<span class="lineNum"> 46 </span> : class XAPIAN_VISIBILITY_DEFAULT ExpandDeciderAnd : public ExpandDecider { -<span class="lineNum"> 47 </span> : const ExpandDecider &first, &second; -<span class="lineNum"> 48 </span> : -<span class="lineNum"> 49 </span> : public: -<span class="lineNum"> 50 </span> : /** Terms will be checked with @a first, and if accepted, then checked -<span class="lineNum"> 51 </span> : * with @a second. -<span class="lineNum"> 52 </span> : */ -<span class="lineNum"> 53 </span> : ExpandDeciderAnd(const ExpandDecider &first_, -<span class="lineNum"> 54 </span> : const ExpandDecider &second_) -<span class="lineNum"> 55 </span> : : first(first_), second(second_) { } -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** Compatibility method. */ -<span class="lineNum"> 58 </span> : ExpandDeciderAnd(const ExpandDecider *first_, -<span class="lineNum"> 59 </span> : const ExpandDecider *second_) -<span class="lineNum"> 60 </span> : : first(*first_), second(*second_) { } -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : virtual bool operator()(const std::string &term) const; -<span class="lineNum"> 63 </span> : }; -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : /** ExpandDecider subclass which rejects terms in a specified list. -<span class="lineNum"> 66 </span> : * -<span class="lineNum"> 67 </span> : * ExpandDeciderFilterTerms provides an easy way to filter out terms from -<span class="lineNum"> 68 </span> : * a fixed list when generating an ESet. -<span class="lineNum"> 69 </span> : */ -<span class="lineNum"> 70 </span> : class XAPIAN_VISIBILITY_DEFAULT ExpandDeciderFilterTerms : public ExpandDecider { -<span class="lineNum"> 71 </span> : std::set<std::string> rejects; -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : public: -<span class="lineNum"> 74 </span> : /** The two iterators specify a list of terms to be rejected. -<span class="lineNum"> 75 </span> : * -<span class="lineNum"> 76 </span> : * @a reject_begin and @a reject_end can be any input_iterator type -<span class="lineNum"> 77 </span> : * which returns std::string or char * (e.g. TermIterator or char **). -<span class="lineNum"> 78 </span> : */ -<span class="lineNum"> 79 </span> : template <class Iterator> -<span class="lineNum"> 80 </span> : ExpandDeciderFilterTerms(Iterator reject_begin, Iterator reject_end) -<span class="lineNum"> 81 </span> : : rejects(reject_begin, reject_end) { } -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : virtual bool operator()(const std::string &term) const; -<span class="lineNum"> 84 </span> : }; -<span class="lineNum"> 85 </span> : -<span class="lineNum"> 86 </span> : } -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : #endif // XAPIAN_INCLUDED_EXPANDDECIDER_H -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/index.html b/rep/usr/include/xapian/index.html deleted file mode 100644 index fbdbd2c..0000000 --- a/rep/usr/include/xapian/index.html +++ /dev/null @@ -1,173 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - /usr/include/xapian</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">77</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">76.6 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">59</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <center> - <table width="80%" cellpadding=2 cellspacing=1 border=0> - - <tr> - <td width="50%"><br></td> - <td width="15%"></td> - <td width="15%"></td> - <td width="20%"></td> - </tr> - - <tr> - <td class="tableHead">Filename</td> - <td class="tableHead" colspan=3>Coverage</td> - </tr> - - <tr> - <td class="coverFile"><a href="base.h.gcov.html">base.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../amber.png" width=45 height=10 alt="45.5%"><img src="../../../snow.png" width=55 height=10 alt="45.5%"></td></tr></table> - </td> - <td class="coverPerMed">45.5 %</td> - <td class="coverNumMed">5 / 11 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="database.h.gcov.html">database.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">4 / 4 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="document.h.gcov.html">document.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="enquire.h.gcov.html">enquire.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=90 height=10 alt="89.7%"><img src="../../../snow.png" width=10 height=10 alt="89.7%"></td></tr></table> - </td> - <td class="coverPerHi">89.7 %</td> - <td class="coverNumHi">26 / 29 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="error.h.gcov.html">error.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../snow.png" width=100 height=10 alt="0.0%"></td></tr></table> - </td> - <td class="coverPerLo">0.0 %</td> - <td class="coverNumLo">0 / 3 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="expanddecider.h.gcov.html">expanddecider.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">1 / 1 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="postingiterator.h.gcov.html">postingiterator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">2 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="query.h.gcov.html">query.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=73 height=10 alt="72.7%"><img src="../../../snow.png" width=27 height=10 alt="72.7%"></td></tr></table> - </td> - <td class="coverPerHi">72.7 %</td> - <td class="coverNumHi">8 / 11 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="termgenerator.h.gcov.html">termgenerator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">2 / 2 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="termiterator.h.gcov.html">termiterator.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=100 height=10 alt="100.0%"></td></tr></table> - </td> - <td class="coverPerHi">100.0 %</td> - <td class="coverNumHi">4 / 4 lines</td> - </tr> - - <tr> - <td class="coverFile"><a href="unicode.h.gcov.html">unicode.h</a></td> - <td class="coverBar" align="center"> - <table border=0 cellspacing=0 cellpadding=1><tr><td class="coverBarOutline"><img src="../../../emerald.png" width=88 height=10 alt="87.5%"><img src="../../../snow.png" width=12 height=10 alt="87.5%"></td></tr></table> - </td> - <td class="coverPerHi">87.5 %</td> - <td class="coverNumHi">7 / 8 lines</td> - </tr> - - </table> - </center> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/postingiterator.h.gcov.html b/rep/usr/include/xapian/postingiterator.h.gcov.html deleted file mode 100644 index 7137a28..0000000 --- a/rep/usr/include/xapian/postingiterator.h.gcov.html +++ /dev/null @@ -1,230 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/postingiterator.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - postingiterator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** \file postingiterator.h -<span class="lineNum"> 2 </span> : * \brief Classes for iterating through posting lists -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 5 </span> : * Copyright 2002 Ananova Ltd -<span class="lineNum"> 6 </span> : * Copyright 2003,2004,2005,2007 Olly Betts -<span class="lineNum"> 7 </span> : * -<span class="lineNum"> 8 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 9 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 10 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 11 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 12 </span> : * -<span class="lineNum"> 13 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : * GNU General Public License for more details. -<span class="lineNum"> 17 </span> : * -<span class="lineNum"> 18 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 20 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 21 </span> : * USA -<span class="lineNum"> 22 </span> : */ -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #ifndef XAPIAN_INCLUDED_POSTINGITERATOR_H -<span class="lineNum"> 25 </span> : #define XAPIAN_INCLUDED_POSTINGITERATOR_H -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <iterator> -<span class="lineNum"> 28 </span> : #include <string> -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : #include <xapian/base.h> -<span class="lineNum"> 31 </span> : #include <xapian/types.h> -<span class="lineNum"> 32 </span> : #include <xapian/positioniterator.h> -<span class="lineNum"> 33 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : namespace Xapian { -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : class Database; -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : /** @internal A wrapper class for a docid which returns the docid if -<span class="lineNum"> 40 </span> : * dereferenced with *. We need this to implement input_iterator semantics. -<span class="lineNum"> 41 </span> : */ -<span class="lineNum"> 42 </span> : class DocIDWrapper { -<span class="lineNum"> 43 </span> : private: -<span class="lineNum"> 44 </span> : docid did; -<span class="lineNum"> 45 </span> : public: -<span class="lineNum"> 46 </span> : explicit DocIDWrapper(docid did_) : did(did_) { } -<span class="lineNum"> 47 </span> : docid operator*() const { return did; } -<span class="lineNum"> 48 </span> : }; -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : /** An iterator pointing to items in a list of postings. -<span class="lineNum"> 51 </span> : */ -<span class="lineNum"> 52 </span> : class XAPIAN_VISIBILITY_DEFAULT PostingIterator { -<span class="lineNum"> 53 </span> : public: -<span class="lineNum"> 54 </span> : class Internal; -<span class="lineNum"> 55 </span> : /// @private @internal Reference counted internals. -<span class="lineNum"> 56 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : private: -<span class="lineNum"> 59 </span> : friend class Database; // So Database can construct us -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : explicit PostingIterator(Internal *internal_); -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : public: -<span class="lineNum"> 64 </span> : friend bool operator==(const PostingIterator &a, -<span class="lineNum"> 65 </span> : const PostingIterator &b); -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : /// Default constructor - for declaring an uninitialised iterator -<span class="lineNum"> 68 </span> : PostingIterator(); -<span class="lineNum"> 69 </span> : -<span class="lineNum"> 70 </span> : /// Destructor -<span class="lineNum"> 71 </span> : ~PostingIterator(); -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : /** Copying is allowed. The internals are reference counted, so -<span class="lineNum"> 74 </span> : * copying is also cheap. -<span class="lineNum"> 75 </span> : */ -<span class="lineNum"> 76 </span> : PostingIterator(const PostingIterator &other); -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : /** Assignment is allowed. The internals are reference counted, -<span class="lineNum"> 79 </span> : * so assignment is also cheap. -<span class="lineNum"> 80 </span> : */ -<span class="lineNum"> 81 </span> : void operator=(const PostingIterator &other); -<span class="lineNum"> 82 </span> : -<span class="lineNum"> 83 </span> : PostingIterator & operator++(); -<span class="lineNum"> 84 </span> : -<span class="lineNum"> 85 </span> : DocIDWrapper operator++(int) { -<span class="lineNum"> 86 </span> : Xapian::docid tmp = **this; -<span class="lineNum"> 87 </span> : operator++(); -<span class="lineNum"> 88 </span> : return DocIDWrapper(tmp); -<span class="lineNum"> 89 </span> : } -<span class="lineNum"> 90 </span> : -<span class="lineNum"> 91 </span> : /** Skip the iterator to document did, or the first document after did -<span class="lineNum"> 92 </span> : * if did isn't in the list of documents being iterated. -<span class="lineNum"> 93 </span> : */ -<span class="lineNum"> 94 </span> : void skip_to(Xapian::docid did); -<span class="lineNum"> 95 </span> : -<span class="lineNum"> 96 </span> : // Get the weight of the posting at the current position: will -<span class="lineNum"> 97 </span> : // need to set a weight object for this to work. -<span class="lineNum"> 98 </span> : // Xapian::weight get_weight() const; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : /// Get the document id at the current position in the postlist. -<span class="lineNum"> 101 </span> : Xapian::docid operator *() const; -<span class="lineNum"> 102 </span> : -<span class="lineNum"> 103 </span> : /** Get the length of the document at the current position in the -<span class="lineNum"> 104 </span> : * postlist. -<span class="lineNum"> 105 </span> : * -<span class="lineNum"> 106 </span> : * This information may be stored in the postlist, in which case -<span class="lineNum"> 107 </span> : * this lookup should be extremely fast (indeed, not require further -<span class="lineNum"> 108 </span> : * disk access). If the information is not present in the postlist, -<span class="lineNum"> 109 </span> : * it will be retrieved from the database, at a greater performance -<span class="lineNum"> 110 </span> : * cost. -<span class="lineNum"> 111 </span> : */ -<span class="lineNum"> 112 </span> : Xapian::doclength get_doclength() const; -<span class="lineNum"> 113 </span> : -<span class="lineNum"> 114 </span> : /** Get the within document frequency of the document at the -<span class="lineNum"> 115 </span> : * current position in the postlist. -<span class="lineNum"> 116 </span> : */ -<span class="lineNum"> 117 </span> : Xapian::termcount get_wdf() const; -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : /** Return PositionIterator pointing to start of positionlist for -<span class="lineNum"> 120 </span> : * current document. -<span class="lineNum"> 121 </span> : */ -<span class="lineNum"> 122 </span> : PositionIterator positionlist_begin() const; -<span class="lineNum"> 123 </span> : -<span class="lineNum"> 124 </span> : /** Return PositionIterator pointing to end of positionlist for -<span class="lineNum"> 125 </span> : * current document. -<span class="lineNum"> 126 </span> : */ -<span class="lineNum"> 127 </span> : PositionIterator positionlist_end() const { -<span class="lineNum"> 128 </span> : return PositionIterator(NULL); -<span class="lineNum"> 129 </span> : } -<span class="lineNum"> 130 </span> : -<span class="lineNum"> 131 </span> : // Don't expose these methods here. A container iterator doesn't -<span class="lineNum"> 132 </span> : // provide a method to find the size of the container... -<span class="lineNum"> 133 </span> : // Xapian::doccount get_termfreq() const; -<span class="lineNum"> 134 </span> : // Xapian::termcount get_collection_freq() const; -<span class="lineNum"> 135 </span> : -<span class="lineNum"> 136 </span> : /// Return a string describing this object. -<span class="lineNum"> 137 </span> : std::string get_description() const; -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : /// Allow use as an STL iterator -<span class="lineNum"> 140 </span> : //@{ -<span class="lineNum"> 141 </span> : typedef std::input_iterator_tag iterator_category; -<span class="lineNum"> 142 </span> : typedef Xapian::docid value_type; -<span class="lineNum"> 143 </span> : typedef Xapian::doccount_diff difference_type; -<span class="lineNum"> 144 </span> : typedef Xapian::docid * pointer; -<span class="lineNum"> 145 </span> : typedef Xapian::docid & reference; -<span class="lineNum"> 146 </span> : //@} -<span class="lineNum"> 147 </span> : }; -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : /// Test equality of two PostingIterators -<span class="lineNum"> 150 </span><span class="lineCov"> 10 : inline bool operator==(const PostingIterator &a, const PostingIterator &b)</span> -<span class="lineNum"> 151 </span> : { -<span class="lineNum"> 152 </span><span class="lineCov"> 10 : return (a.internal.get() == b.internal.get());</span> -<span class="lineNum"> 153 </span> : } -<span class="lineNum"> 154 </span> : -<span class="lineNum"> 155 </span> : /// Test inequality of two PostingIterators -<span class="lineNum"> 156 </span> : inline bool operator!=(const PostingIterator &a, const PostingIterator &b) -<span class="lineNum"> 157 </span> : { -<span class="lineNum"> 158 </span> : return !(a == b); -<span class="lineNum"> 159 </span> : } -<span class="lineNum"> 160 </span> : -<span class="lineNum"> 161 </span> : } -<span class="lineNum"> 162 </span> : -<span class="lineNum"> 163 </span> : #endif /* XAPIAN_INCLUDED_POSTINGITERATOR_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/query.h.gcov.html b/rep/usr/include/xapian/query.h.gcov.html deleted file mode 100644 index da0ec8e..0000000 --- a/rep/usr/include/xapian/query.h.gcov.html +++ /dev/null @@ -1,520 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/query.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - query.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">11</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">72.7 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** \file query.h -<span class="lineNum"> 2 </span> : * \brief Classes for representing a query -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 5 </span> : * Copyright 2002 Ananova Ltd -<span class="lineNum"> 6 </span> : * Copyright 2003,2004,2005,2006,2007 Olly Betts -<span class="lineNum"> 7 </span> : * Copyright 2006,2007,2008 Lemur Consulting Ltd -<span class="lineNum"> 8 </span> : * -<span class="lineNum"> 9 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 10 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 11 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 12 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 13 </span> : * -<span class="lineNum"> 14 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 15 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 16 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 17 </span> : * GNU General Public License for more details. -<span class="lineNum"> 18 </span> : * -<span class="lineNum"> 19 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 20 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 21 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 22 </span> : * USA -<span class="lineNum"> 23 </span> : */ -<span class="lineNum"> 24 </span> : -<span class="lineNum"> 25 </span> : #ifndef XAPIAN_INCLUDED_QUERY_H -<span class="lineNum"> 26 </span> : #define XAPIAN_INCLUDED_QUERY_H -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : #include <string> -<span class="lineNum"> 29 </span> : #include <vector> -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : #include <xapian/base.h> -<span class="lineNum"> 32 </span> : #include <xapian/deprecated.h> -<span class="lineNum"> 33 </span> : #include <xapian/types.h> -<span class="lineNum"> 34 </span> : #include <xapian/termiterator.h> -<span class="lineNum"> 35 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : // FIXME: sort this out so we avoid exposing Xapian::Query::Internal -<span class="lineNum"> 38 </span> : // - we need to at present so that the Xapian::Query's template ctors -<span class="lineNum"> 39 </span> : // compile. -<span class="lineNum"> 40 </span> : class LocalSubMatch; -<span class="lineNum"> 41 </span> : class MultiMatch; -<span class="lineNum"> 42 </span> : class QueryOptimiser; -<span class="lineNum"> 43 </span> : struct SortPosName; -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : namespace Xapian { -<span class="lineNum"> 46 </span> : -<span class="lineNum"> 47 </span> : /** Class representing a query. -<span class="lineNum"> 48 </span> : * -<span class="lineNum"> 49 </span> : * Queries are represented as a tree of objects. -<span class="lineNum"> 50 </span> : */ -<span class="lineNum"> 51 </span> : class XAPIAN_VISIBILITY_DEFAULT Query { -<span class="lineNum"> 52 </span> : public: -<span class="lineNum"> 53 </span> : /// Class holding details of the query -<span class="lineNum"> 54 </span> : class Internal; -<span class="lineNum"> 55 </span> : /// @private @internal Reference counted internals. -<span class="lineNum"> 56 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : /// Enum of possible query operations -<span class="lineNum"> 59 </span> : typedef enum { -<span class="lineNum"> 60 </span> : /// Return iff both subqueries are satisfied -<span class="lineNum"> 61 </span> : OP_AND, -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : /// Return if either subquery is satisfied -<span class="lineNum"> 64 </span> : OP_OR, -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : /// Return if left but not right satisfied -<span class="lineNum"> 67 </span> : OP_AND_NOT, -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : /// Return if one query satisfied, but not both -<span class="lineNum"> 70 </span> : OP_XOR, -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : /// Return iff left satisfied, but use weights from both -<span class="lineNum"> 73 </span> : OP_AND_MAYBE, -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : /// As AND, but use only weights from left subquery -<span class="lineNum"> 76 </span> : OP_FILTER, -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : /** Find occurrences of a list of terms with all the terms -<span class="lineNum"> 79 </span> : * occurring within a specified window of positions. -<span class="lineNum"> 80 </span> : * Each occurrence of a term must be at a different position, -<span class="lineNum"> 81 </span> : * but the order they appear in is irrelevant. -<span class="lineNum"> 82 </span> : * -<span class="lineNum"> 83 </span> : * The window parameter should be specified for this operation, -<span class="lineNum"> 84 </span> : * but will default to the number of terms in the list. -<span class="lineNum"> 85 </span> : */ -<span class="lineNum"> 86 </span> : OP_NEAR, -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : /** Find occurrences of a list of terms with all the terms -<span class="lineNum"> 89 </span> : * occurring within a specified window of positions, and all -<span class="lineNum"> 90 </span> : * the terms appearing in the order specified. Each occurrence -<span class="lineNum"> 91 </span> : * of a term must be at a different position. -<span class="lineNum"> 92 </span> : * -<span class="lineNum"> 93 </span> : * The window parameter should be specified for this operation, -<span class="lineNum"> 94 </span> : * but will default to the number of terms in the list. -<span class="lineNum"> 95 </span> : */ -<span class="lineNum"> 96 </span> : OP_PHRASE, -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : /** Filter by a range test on a document value. */ -<span class="lineNum"> 99 </span> : OP_VALUE_RANGE, -<span class="lineNum"> 100 </span> : -<span class="lineNum"> 101 </span> : /** Scale the weight of a subquery by the specified factor. -<span class="lineNum"> 102 </span> : * -<span class="lineNum"> 103 </span> : * A factor of 0 means this subquery will contribute no weight to -<span class="lineNum"> 104 </span> : * the query - it will act as a purely boolean subquery. -<span class="lineNum"> 105 </span> : * -<span class="lineNum"> 106 </span> : * If the factor is negative, Xapian::InvalidArgumentError will -<span class="lineNum"> 107 </span> : * be thrown. -<span class="lineNum"> 108 </span> : */ -<span class="lineNum"> 109 </span> : OP_SCALE_WEIGHT, -<span class="lineNum"> 110 </span> : -<span class="lineNum"> 111 </span> : /** Select an elite set from the subqueries, and perform -<span class="lineNum"> 112 </span> : * a query with these combined as an OR query. -<span class="lineNum"> 113 </span> : */ -<span class="lineNum"> 114 </span> : OP_ELITE_SET, -<span class="lineNum"> 115 </span> : -<span class="lineNum"> 116 </span> : /** Filter by a greater-than-or-equal test on a document value. */ -<span class="lineNum"> 117 </span> : OP_VALUE_GE, -<span class="lineNum"> 118 </span> : -<span class="lineNum"> 119 </span> : /** Filter by a less-than-or-equal test on a document value. */ -<span class="lineNum"> 120 </span> : OP_VALUE_LE -<span class="lineNum"> 121 </span> : } op; -<span class="lineNum"> 122 </span> : -<span class="lineNum"> 123 </span> : /** Copy constructor. */ -<span class="lineNum"> 124 </span> : Query(const Query & copyme); -<span class="lineNum"> 125 </span> : -<span class="lineNum"> 126 </span> : /** Assignment. */ -<span class="lineNum"> 127 </span> : Query & operator=(const Query & copyme); -<span class="lineNum"> 128 </span> : -<span class="lineNum"> 129 </span> : /** Default constructor: makes an empty query which matches no -<span class="lineNum"> 130 </span> : * documents. -<span class="lineNum"> 131 </span> : * -<span class="lineNum"> 132 </span> : * Also useful for defining a Query object to be assigned to later. -<span class="lineNum"> 133 </span> : * -<span class="lineNum"> 134 </span> : * An exception will be thrown if an attempt is made to use an -<span class="lineNum"> 135 </span> : * undefined query when building up a composite query. -<span class="lineNum"> 136 </span> : */ -<span class="lineNum"> 137 </span> : Query(); -<span class="lineNum"> 138 </span> : -<span class="lineNum"> 139 </span> : /** Destructor. */ -<span class="lineNum"> 140 </span> : ~Query(); -<span class="lineNum"> 141 </span> : -<span class="lineNum"> 142 </span> : /** A query consisting of a single term. */ -<span class="lineNum"> 143 </span> : Query(const std::string & tname_, Xapian::termcount wqf_ = 1, -<span class="lineNum"> 144 </span> : Xapian::termpos pos_ = 0); -<span class="lineNum"> 145 </span> : -<span class="lineNum"> 146 </span> : /** A query consisting of two subqueries, opp-ed together. */ -<span class="lineNum"> 147 </span> : Query(Query::op op_, const Query & left, const Query & right); -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : /** A query consisting of two termnames opp-ed together. */ -<span class="lineNum"> 150 </span> : Query(Query::op op_, -<span class="lineNum"> 151 </span> : const std::string & left, const std::string & right); -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : /** Combine a number of Xapian::Query-s with the specified operator. -<span class="lineNum"> 154 </span> : * -<span class="lineNum"> 155 </span> : * The Xapian::Query objects are specified with begin and end -<span class="lineNum"> 156 </span> : * iterators. -<span class="lineNum"> 157 </span> : * -<span class="lineNum"> 158 </span> : * AND, OR, NEAR and PHRASE can take any number of subqueries. -<span class="lineNum"> 159 </span> : * Other operators take exactly two subqueries. -<span class="lineNum"> 160 </span> : * -<span class="lineNum"> 161 </span> : * The iterators may be to Xapian::Query objects, pointers to -<span class="lineNum"> 162 </span> : * Xapian::Query objects, or termnames (std::string-s). -<span class="lineNum"> 163 </span> : * -<span class="lineNum"> 164 </span> : * For NEAR and PHRASE, a window size can be specified in parameter. -<span class="lineNum"> 165 </span> : * -<span class="lineNum"> 166 </span> : * For ELITE_SET, the elite set size can be specified in parameter. -<span class="lineNum"> 167 </span> : */ -<span class="lineNum"> 168 </span> : template <class Iterator> -<span class="lineNum"> 169 </span> : Query(Query::op op_, Iterator qbegin, Iterator qend, -<span class="lineNum"> 170 </span> : Xapian::termcount parameter = 0); -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : /** Apply the specified operator to a single Xapian::Query object. -<span class="lineNum"> 173 </span> : * -<span class="lineNum"> 174 </span> : * @deprecated This method is deprecated because it isn't useful, -<span class="lineNum"> 175 </span> : * since none of the current query operators can be usefully -<span class="lineNum"> 176 </span> : * applied to a single subquery with a parameter value. -<span class="lineNum"> 177 </span> : */ -<span class="lineNum"> 178 </span> : XAPIAN_DEPRECATED(Query(Query::op op_, Xapian::Query q)); -<span class="lineNum"> 179 </span> : -<span class="lineNum"> 180 </span> : /** Apply the specified operator to a single Xapian::Query object, with -<span class="lineNum"> 181 </span> : * a double parameter. -<span class="lineNum"> 182 </span> : */ -<span class="lineNum"> 183 </span> : Query(Query::op op_, Xapian::Query q, double parameter); -<span class="lineNum"> 184 </span> : -<span class="lineNum"> 185 </span> : /** Construct a value range query on a document value. -<span class="lineNum"> 186 </span> : * -<span class="lineNum"> 187 </span> : * A value range query matches those documents which have a value -<span class="lineNum"> 188 </span> : * stored in the slot given by @a valno which is in the range -<span class="lineNum"> 189 </span> : * specified by @a begin and @a end (in lexicographical -<span class="lineNum"> 190 </span> : * order), including the endpoints. -<span class="lineNum"> 191 </span> : * -<span class="lineNum"> 192 </span> : * @param op_ The operator to use for the query. Currently, must -<span class="lineNum"> 193 </span> : * be OP_VALUE_RANGE. -<span class="lineNum"> 194 </span> : * @param valno The slot number to get the value from. -<span class="lineNum"> 195 </span> : * @param begin The start of the range. -<span class="lineNum"> 196 </span> : * @param end The end of the range. -<span class="lineNum"> 197 </span> : */ -<span class="lineNum"> 198 </span> : Query(Query::op op_, Xapian::valueno valno, -<span class="lineNum"> 199 </span> : const std::string &begin, const std::string &end); -<span class="lineNum"> 200 </span> : -<span class="lineNum"> 201 </span> : /** Construct a value comparison query on a document value. -<span class="lineNum"> 202 </span> : * -<span class="lineNum"> 203 </span> : * This query matches those documents which have a value stored in the -<span class="lineNum"> 204 </span> : * slot given by @a valno which compares, as specified by the -<span class="lineNum"> 205 </span> : * operator, to @a value. -<span class="lineNum"> 206 </span> : * -<span class="lineNum"> 207 </span> : * @param op_ The operator to use for the query. Currently, must -<span class="lineNum"> 208 </span> : * be OP_VALUE_GE or OP_VALUE_LE. -<span class="lineNum"> 209 </span> : * @param valno The slot number to get the value from. -<span class="lineNum"> 210 </span> : * @param value The value to compare. -<span class="lineNum"> 211 </span> : */ -<span class="lineNum"> 212 </span> : Query(Query::op op_, Xapian::valueno valno, const std::string &value); -<span class="lineNum"> 213 </span> : -<span class="lineNum"> 214 </span> : /** A query which matches all documents in the database. */ -<span class="lineNum"> 215 </span> : static Xapian::Query MatchAll; -<span class="lineNum"> 216 </span> : -<span class="lineNum"> 217 </span> : /** A query which matches no documents. */ -<span class="lineNum"> 218 </span> : static Xapian::Query MatchNothing; -<span class="lineNum"> 219 </span> : -<span class="lineNum"> 220 </span> : /** Get the length of the query, used by some ranking formulae. -<span class="lineNum"> 221 </span> : * This value is calculated automatically - if you want to override -<span class="lineNum"> 222 </span> : * it you can pass a different value to Enquire::set_query(). -<span class="lineNum"> 223 </span> : */ -<span class="lineNum"> 224 </span> : Xapian::termcount get_length() const; -<span class="lineNum"> 225 </span> : -<span class="lineNum"> 226 </span> : /** Return a Xapian::TermIterator returning all the terms in the query, -<span class="lineNum"> 227 </span> : * in order of termpos. If multiple terms have the same term -<span class="lineNum"> 228 </span> : * position, their order is unspecified. Duplicates (same term and -<span class="lineNum"> 229 </span> : * termpos) will be removed. -<span class="lineNum"> 230 </span> : */ -<span class="lineNum"> 231 </span> : TermIterator get_terms_begin() const; -<span class="lineNum"> 232 </span> : -<span class="lineNum"> 233 </span> : /** Return a Xapian::TermIterator to the end of the list of terms in the -<span class="lineNum"> 234 </span> : * query. -<span class="lineNum"> 235 </span> : */ -<span class="lineNum"> 236 </span> : TermIterator get_terms_end() const { -<span class="lineNum"> 237 </span> : return TermIterator(NULL); -<span class="lineNum"> 238 </span> : } -<span class="lineNum"> 239 </span> : -<span class="lineNum"> 240 </span> : /** Test if the query is empty (i.e. was constructed using -<span class="lineNum"> 241 </span> : * the default ctor or with an empty iterator ctor). -<span class="lineNum"> 242 </span> : */ -<span class="lineNum"> 243 </span> : bool empty() const; -<span class="lineNum"> 244 </span> : -<span class="lineNum"> 245 </span> : /// Return a string describing this object. -<span class="lineNum"> 246 </span> : std::string get_description() const; -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : private: -<span class="lineNum"> 249 </span> : void add_subquery(const Query & subq); -<span class="lineNum"> 250 </span> : void add_subquery(const Query * subq); -<span class="lineNum"> 251 </span> : void add_subquery(const std::string & tname); -<span class="lineNum"> 252 </span> : void start_construction(Query::op op_, Xapian::termcount parameter); -<span class="lineNum"> 253 </span> : void end_construction(); -<span class="lineNum"> 254 </span> : void abort_construction(); -<span class="lineNum"> 255 </span> : }; -<span class="lineNum"> 256 </span> : -<span class="lineNum"> 257 </span> : template <class Iterator> -<span class="lineNum"> 258 </span><span class="lineCov"> 19 : Query::Query(Query::op op_, Iterator qbegin, Iterator qend, termcount parameter)</span> -<span class="lineNum"> 259 </span><span class="lineCov"> 19 : : internal(0)</span> -<span class="lineNum"> 260 </span> : { -<span class="lineNum"> 261 </span> : try { -<span class="lineNum"> 262 </span><span class="lineCov"> 19 : start_construction(op_, parameter);</span> -<span class="lineNum"> 263 </span> : -<span class="lineNum"> 264 </span> : /* Add all the elements */ -<span class="lineNum"> 265 </span><span class="lineCov"> 61 : while (qbegin != qend) {</span> -<span class="lineNum"> 266 </span><span class="lineCov"> 23 : add_subquery(*qbegin);</span> -<span class="lineNum"> 267 </span><span class="lineCov"> 23 : ++qbegin;</span> -<span class="lineNum"> 268 </span> : } -<span class="lineNum"> 269 </span> : -<span class="lineNum"> 270 </span><span class="lineCov"> 19 : end_construction();</span> -<span class="lineNum"> 271 </span><span class="lineNoCov"> 0 : } catch (...) {</span> -<span class="lineNum"> 272 </span><span class="lineNoCov"> 0 : abort_construction();</span> -<span class="lineNum"> 273 </span><span class="lineNoCov"> 0 : throw;</span> -<span class="lineNum"> 274 </span> : } -<span class="lineNum"> 275 </span><span class="lineCov"> 19 : }</span> -<span class="lineNum"> 276 </span> : -<span class="lineNum"> 277 </span> : /// @internal Internal class, implementing most of Xapian::Query. -<span class="lineNum"> 278 </span> : class XAPIAN_VISIBILITY_DEFAULT Query::Internal : public Xapian::Internal::RefCntBase { -<span class="lineNum"> 279 </span> : friend class ::LocalSubMatch; -<span class="lineNum"> 280 </span> : friend class ::MultiMatch; -<span class="lineNum"> 281 </span> : friend class ::QueryOptimiser; -<span class="lineNum"> 282 </span> : friend struct ::SortPosName; -<span class="lineNum"> 283 </span> : friend class Query; -<span class="lineNum"> 284 </span> : public: -<span class="lineNum"> 285 </span> : static const int OP_LEAF = -1; -<span class="lineNum"> 286 </span> : -<span class="lineNum"> 287 </span> : /// The container type for storing pointers to subqueries -<span class="lineNum"> 288 </span> : typedef std::vector<Internal *> subquery_list; -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : /// Type storing the operation -<span class="lineNum"> 291 </span> : typedef int op_t; -<span class="lineNum"> 292 </span> : -<span class="lineNum"> 293 </span> : private: -<span class="lineNum"> 294 </span> : /// Operation to be performed at this node -<span class="lineNum"> 295 </span> : Xapian::Query::Internal::op_t op; -<span class="lineNum"> 296 </span> : -<span class="lineNum"> 297 </span> : /// Sub queries on which to perform operation -<span class="lineNum"> 298 </span> : subquery_list subqs; -<span class="lineNum"> 299 </span> : -<span class="lineNum"> 300 </span> : /** For NEAR or PHRASE, how close terms must be to match: all terms -<span class="lineNum"> 301 </span> : * within the operation must occur in a window of this size. -<span class="lineNum"> 302 </span> : * -<span class="lineNum"> 303 </span> : * For ELITE_SET, the number of terms to select from those specified. -<span class="lineNum"> 304 </span> : * -<span class="lineNum"> 305 </span> : * For RANGE, the value number to apply the range test to. -<span class="lineNum"> 306 </span> : */ -<span class="lineNum"> 307 </span> : Xapian::termcount parameter; -<span class="lineNum"> 308 </span> : -<span class="lineNum"> 309 </span> : /** Term that this node represents, or start of a range query. -<span class="lineNum"> 310 </span> : * -<span class="lineNum"> 311 </span> : * For a leaf node, this holds the term name. For an OP_VALUE_RANGE -<span class="lineNum"> 312 </span> : * query this holds the start of the range. For an OP_VALUE_GE or -<span class="lineNum"> 313 </span> : * OP_VALUE_LE query this holds the value to compare against. -<span class="lineNum"> 314 </span> : */ -<span class="lineNum"> 315 </span> : std::string tname; -<span class="lineNum"> 316 </span> : -<span class="lineNum"> 317 </span> : /** Used to store the end of a range query. */ -<span class="lineNum"> 318 </span> : std::string str_parameter; -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : /// Position in query of this term - leaf node only -<span class="lineNum"> 321 </span> : Xapian::termpos term_pos; -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : /// Within query frequency of this term - leaf node only -<span class="lineNum"> 324 </span> : Xapian::termcount wqf; -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span> : /** swap the contents of this with another Xapian::Query::Internal, -<span class="lineNum"> 327 </span> : * in a way which is guaranteed not to throw. This is -<span class="lineNum"> 328 </span> : * used with the assignment operator to make it exception -<span class="lineNum"> 329 </span> : * safe. -<span class="lineNum"> 330 </span> : * It's important to adjust swap with any addition of -<span class="lineNum"> 331 </span> : * member variables! -<span class="lineNum"> 332 </span> : */ -<span class="lineNum"> 333 </span> : void swap(Query::Internal &other); -<span class="lineNum"> 334 </span> : -<span class="lineNum"> 335 </span> : /// Copy another Xapian::Query::Internal into self. -<span class="lineNum"> 336 </span> : void initialise_from_copy(const Query::Internal & copyme); -<span class="lineNum"> 337 </span> : -<span class="lineNum"> 338 </span> : void accumulate_terms( -<span class="lineNum"> 339 </span> : std::vector<std::pair<std::string, Xapian::termpos> > &terms) const; -<span class="lineNum"> 340 </span> : -<span class="lineNum"> 341 </span> : /** Simplify the query. -<span class="lineNum"> 342 </span> : * For example, an AND query with only one subquery would become the -<span class="lineNum"> 343 </span> : * subquery itself. -<span class="lineNum"> 344 </span> : */ -<span class="lineNum"> 345 </span> : Internal * simplify_query(); -<span class="lineNum"> 346 </span> : -<span class="lineNum"> 347 </span> : /** Perform checks that query is valid. (eg, has correct number of -<span class="lineNum"> 348 </span> : * sub queries.) Throw an exception if not. This is initially called -<span class="lineNum"> 349 </span> : * on the query before any simplifications have been made, and after -<span class="lineNum"> 350 </span> : * simplications. -<span class="lineNum"> 351 </span> : */ -<span class="lineNum"> 352 </span> : void validate_query() const; -<span class="lineNum"> 353 </span> : -<span class="lineNum"> 354 </span> : /** Simplify any matchnothing subqueries, either eliminating them, -<span class="lineNum"> 355 </span> : * or setting this query to matchnothing, depending on the query -<span class="lineNum"> 356 </span> : * operator. Returns true if simplification resulted in a -<span class="lineNum"> 357 </span> : * matchnothing query. -<span class="lineNum"> 358 </span> : */ -<span class="lineNum"> 359 </span> : bool simplify_matchnothing(); -<span class="lineNum"> 360 </span> : -<span class="lineNum"> 361 </span> : /** Get a string describing the given query type. -<span class="lineNum"> 362 </span> : */ -<span class="lineNum"> 363 </span> : static std::string get_op_name(Xapian::Query::Internal::op_t op); -<span class="lineNum"> 364 </span> : -<span class="lineNum"> 365 </span> : /** Collapse the subqueries together if appropriate. -<span class="lineNum"> 366 </span> : */ -<span class="lineNum"> 367 </span> : void collapse_subqs(); -<span class="lineNum"> 368 </span> : -<span class="lineNum"> 369 </span> : /** Flatten a query structure, by changing, for example, -<span class="lineNum"> 370 </span> : * "A NEAR (B AND C)" to "(A NEAR B) AND (A NEAR C)" -<span class="lineNum"> 371 </span> : */ -<span class="lineNum"> 372 </span> : void flatten_subqs(); -<span class="lineNum"> 373 </span> : -<span class="lineNum"> 374 </span> : /** Implementation of serialisation; called recursively. -<span class="lineNum"> 375 </span> : */ -<span class="lineNum"> 376 </span> : std::string serialise(Xapian::termpos & curpos) const; -<span class="lineNum"> 377 </span> : -<span class="lineNum"> 378 </span> : public: -<span class="lineNum"> 379 </span> : /** Copy constructor. */ -<span class="lineNum"> 380 </span> : Internal(const Query::Internal & copyme); -<span class="lineNum"> 381 </span> : -<span class="lineNum"> 382 </span> : /** Assignment. */ -<span class="lineNum"> 383 </span> : void operator=(const Query::Internal & copyme); -<span class="lineNum"> 384 </span> : -<span class="lineNum"> 385 </span> : /** A query consisting of a single term. */ -<span class="lineNum"> 386 </span> : explicit Internal(const std::string & tname_, Xapian::termcount wqf_ = 1, -<span class="lineNum"> 387 </span> : Xapian::termpos term_pos_ = 0); -<span class="lineNum"> 388 </span> : -<span class="lineNum"> 389 </span> : /** Create internals given only the operator and a parameter. */ -<span class="lineNum"> 390 </span> : Internal(op_t op_, Xapian::termcount parameter); -<span class="lineNum"> 391 </span> : -<span class="lineNum"> 392 </span> : /** Construct a range query on a document value. */ -<span class="lineNum"> 393 </span> : Internal(op_t op_, Xapian::valueno valno, -<span class="lineNum"> 394 </span> : const std::string &begin, const std::string &end); -<span class="lineNum"> 395 </span> : -<span class="lineNum"> 396 </span> : /** Construct a value greater-than-or-equal query on a document value. -<span class="lineNum"> 397 </span> : */ -<span class="lineNum"> 398 </span> : Internal(op_t op_, Xapian::valueno valno, const std::string &value); -<span class="lineNum"> 399 </span> : -<span class="lineNum"> 400 </span> : /** Destructor. */ -<span class="lineNum"> 401 </span> : ~Internal(); -<span class="lineNum"> 402 </span> : -<span class="lineNum"> 403 </span> : static Xapian::Query::Internal * unserialise(const std::string &s); -<span class="lineNum"> 404 </span> : -<span class="lineNum"> 405 </span> : /** Add a subquery. -<span class="lineNum"> 406 </span> : */ -<span class="lineNum"> 407 </span> : void add_subquery(const Query::Internal * subq); -<span class="lineNum"> 408 </span> : -<span class="lineNum"> 409 </span> : void set_dbl_parameter(double dbl_parameter_); -<span class="lineNum"> 410 </span> : -<span class="lineNum"> 411 </span> : double get_dbl_parameter() const; -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span> : /** Finish off the construction. -<span class="lineNum"> 414 </span> : */ -<span class="lineNum"> 415 </span> : Query::Internal * end_construction(); -<span class="lineNum"> 416 </span> : -<span class="lineNum"> 417 </span> : /** Return a string in an easily parsed form -<span class="lineNum"> 418 </span> : * which contains all the information in a query. -<span class="lineNum"> 419 </span> : */ -<span class="lineNum"> 420 </span> : std::string serialise() const { -<span class="lineNum"> 421 </span> : Xapian::termpos curpos = 1; -<span class="lineNum"> 422 </span> : return serialise(curpos); -<span class="lineNum"> 423 </span> : } -<span class="lineNum"> 424 </span> : -<span class="lineNum"> 425 </span> : /// Return a string describing this object. -<span class="lineNum"> 426 </span> : std::string get_description() const; -<span class="lineNum"> 427 </span> : -<span class="lineNum"> 428 </span> : /** Get the numeric parameter used in this query. -<span class="lineNum"> 429 </span> : * -<span class="lineNum"> 430 </span> : * This is used by the QueryParser to get the value number for -<span class="lineNum"> 431 </span> : * VALUE_RANGE queries. It should be replaced by a public method on -<span class="lineNum"> 432 </span> : * the Query class at some point, but the API which should be used for -<span class="lineNum"> 433 </span> : * that is unclear, so this is a temporary workaround. -<span class="lineNum"> 434 </span> : */ -<span class="lineNum"> 435 </span> : Xapian::termcount get_parameter() const { return parameter; } -<span class="lineNum"> 436 </span> : -<span class="lineNum"> 437 </span> : /** Get the length of the query, used by some ranking formulae. -<span class="lineNum"> 438 </span> : * This value is calculated automatically - if you want to override -<span class="lineNum"> 439 </span> : * it you can pass a different value to Enquire::set_query(). -<span class="lineNum"> 440 </span> : */ -<span class="lineNum"> 441 </span> : Xapian::termcount get_length() const; -<span class="lineNum"> 442 </span> : -<span class="lineNum"> 443 </span> : /** Return an iterator over all the terms in the query, -<span class="lineNum"> 444 </span> : * in order of termpos. If multiple terms have the same term -<span class="lineNum"> 445 </span> : * position, their order is unspecified. Duplicates (same term and -<span class="lineNum"> 446 </span> : * termpos) will be removed. -<span class="lineNum"> 447 </span> : */ -<span class="lineNum"> 448 </span> : TermIterator get_terms() const; -<span class="lineNum"> 449 </span> : }; -<span class="lineNum"> 450 </span> : -<span class="lineNum"> 451 </span> : } -<span class="lineNum"> 452 </span> : -<span class="lineNum"> 453 </span> : #endif /* XAPIAN_INCLUDED_QUERY_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/termgenerator.h.gcov.html b/rep/usr/include/xapian/termgenerator.h.gcov.html deleted file mode 100644 index dc59577..0000000 --- a/rep/usr/include/xapian/termgenerator.h.gcov.html +++ /dev/null @@ -1,226 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/termgenerator.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - termgenerator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">2</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** @file termgenerator.h -<span class="lineNum"> 2 </span> : * @brief parse free text and generate terms -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright (C) 2007 Olly Betts -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 7 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 8 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 9 </span> : * (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : * GNU General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 17 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef XAPIAN_INCLUDED_TERMGENERATOR_H -<span class="lineNum"> 22 </span> : #define XAPIAN_INCLUDED_TERMGENERATOR_H -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <xapian/base.h> -<span class="lineNum"> 25 </span> : #include <xapian/types.h> -<span class="lineNum"> 26 </span> : #include <xapian/unicode.h> -<span class="lineNum"> 27 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 28 </span> : -<span class="lineNum"> 29 </span> : #include <string> -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : namespace Xapian { -<span class="lineNum"> 32 </span> : -<span class="lineNum"> 33 </span> : class Document; -<span class="lineNum"> 34 </span> : class Stem; -<span class="lineNum"> 35 </span> : class Stopper; -<span class="lineNum"> 36 </span> : class WritableDatabase; -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : /** Parses a piece of text and generate terms. -<span class="lineNum"> 39 </span> : * -<span class="lineNum"> 40 </span> : * This module takes a piece of text and parses it to produce words which are -<span class="lineNum"> 41 </span> : * then used to generate suitable terms for indexing. The terms generated are -<span class="lineNum"> 42 </span> : * suitable for use with Query objects produced by the QueryParser class. -<span class="lineNum"> 43 </span> : */ -<span class="lineNum"> 44 </span> : class XAPIAN_VISIBILITY_DEFAULT TermGenerator { -<span class="lineNum"> 45 </span> : public: -<span class="lineNum"> 46 </span> : /// @private @internal Class representing the TermGenerator internals. -<span class="lineNum"> 47 </span> : class Internal; -<span class="lineNum"> 48 </span> : /// @private @internal Reference counted internals. -<span class="lineNum"> 49 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : /// Copy constructor. -<span class="lineNum"> 52 </span> : TermGenerator(const TermGenerator & o); -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : /// Assignment. -<span class="lineNum"> 55 </span> : TermGenerator & operator=(const TermGenerator & o); -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /// Default constructor. -<span class="lineNum"> 58 </span> : TermGenerator(); -<span class="lineNum"> 59 </span> : -<span class="lineNum"> 60 </span> : /// Destructor. -<span class="lineNum"> 61 </span> : ~TermGenerator(); -<span class="lineNum"> 62 </span> : -<span class="lineNum"> 63 </span> : /// Set the Xapian::Stem object to be used for generating stemmed terms. -<span class="lineNum"> 64 </span> : void set_stemmer(const Xapian::Stem & stemmer); -<span class="lineNum"> 65 </span> : -<span class="lineNum"> 66 </span> : /// Set the Xapian::Stopper object to be used for identifying stopwords. -<span class="lineNum"> 67 </span> : void set_stopper(const Xapian::Stopper *stop = NULL); -<span class="lineNum"> 68 </span> : -<span class="lineNum"> 69 </span> : /// Set the current document. -<span class="lineNum"> 70 </span> : void set_document(const Xapian::Document & doc); -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : /// Get the current document. -<span class="lineNum"> 73 </span> : const Xapian::Document & get_document() const; -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : /// Set the database to index spelling data to. -<span class="lineNum"> 76 </span> : void set_database(const Xapian::WritableDatabase &db); -<span class="lineNum"> 77 </span> : -<span class="lineNum"> 78 </span> : /// Flags to OR together and pass to TermGenerator::set_flags(). -<span class="lineNum"> 79 </span> : enum flags { -<span class="lineNum"> 80 </span> : /// Index data required for spelling correction. -<span class="lineNum"> 81 </span> : FLAG_SPELLING = 128 // Value matches QueryParser flag. -<span class="lineNum"> 82 </span> : }; -<span class="lineNum"> 83 </span> : -<span class="lineNum"> 84 </span> : /** Set flags. -<span class="lineNum"> 85 </span> : * -<span class="lineNum"> 86 </span> : * The new value of flags is: (flags & mask) ^ toggle -<span class="lineNum"> 87 </span> : * -<span class="lineNum"> 88 </span> : * To just set the flags, pass the new flags in toggle and the -<span class="lineNum"> 89 </span> : * default value for mask. -<span class="lineNum"> 90 </span> : * -<span class="lineNum"> 91 </span> : * @param toggle Flags to XOR. -<span class="lineNum"> 92 </span> : * @param mask Flags to AND with first. -<span class="lineNum"> 93 </span> : * -<span class="lineNum"> 94 </span> : * @return The old flags setting. -<span class="lineNum"> 95 </span> : */ -<span class="lineNum"> 96 </span> : flags set_flags(flags toggle, flags mask = flags(0)); -<span class="lineNum"> 97 </span> : -<span class="lineNum"> 98 </span> : /** Index some text. -<span class="lineNum"> 99 </span> : * -<span class="lineNum"> 100 </span> : * @param weight The wdf increment (default 1). -<span class="lineNum"> 101 </span> : * @param prefix The term prefix to use (default is no prefix). -<span class="lineNum"> 102 </span> : */ -<span class="lineNum"> 103 </span> : void index_text(const Xapian::Utf8Iterator & itor, -<span class="lineNum"> 104 </span> : Xapian::termcount weight = 1, -<span class="lineNum"> 105 </span> : const std::string & prefix = ""); -<span class="lineNum"> 106 </span> : -<span class="lineNum"> 107 </span> : /** Index some text in a std::string. -<span class="lineNum"> 108 </span> : * -<span class="lineNum"> 109 </span> : * @param weight The wdf increment (default 1). -<span class="lineNum"> 110 </span> : * @param prefix The term prefix to use (default is no prefix). -<span class="lineNum"> 111 </span> : */ -<span class="lineNum"> 112 </span> : void index_text(const std::string & text, -<span class="lineNum"> 113 </span> : Xapian::termcount weight = 1, -<span class="lineNum"> 114 </span> : const std::string & prefix = "") { -<span class="lineNum"> 115 </span> : return index_text(Utf8Iterator(text), weight, prefix); -<span class="lineNum"> 116 </span> : } -<span class="lineNum"> 117 </span> : -<span class="lineNum"> 118 </span> : /** Index some text without positional information. -<span class="lineNum"> 119 </span> : * -<span class="lineNum"> 120 </span> : * Just like index_text, but no positional information is generated. This -<span class="lineNum"> 121 </span> : * means that the database will be significantly smaller, but that phrase -<span class="lineNum"> 122 </span> : * searching and NEAR won't be supported. -<span class="lineNum"> 123 </span> : */ -<span class="lineNum"> 124 </span> : void index_text_without_positions(const Xapian::Utf8Iterator & itor, -<span class="lineNum"> 125 </span> : Xapian::termcount weight = 1, -<span class="lineNum"> 126 </span> : const std::string & prefix = ""); -<span class="lineNum"> 127 </span> : -<span class="lineNum"> 128 </span> : /** Index some text in a std::string without positional information. -<span class="lineNum"> 129 </span> : * -<span class="lineNum"> 130 </span> : * Just like index_text, but no positional information is generated. This -<span class="lineNum"> 131 </span> : * means that the database will be significantly smaller, but that phrase -<span class="lineNum"> 132 </span> : * searching and NEAR won't be supported. -<span class="lineNum"> 133 </span> : */ -<span class="lineNum"> 134 </span> : void index_text_without_positions(const std::string & text, -<span class="lineNum"> 135 </span> : Xapian::termcount weight = 1, -<span class="lineNum"> 136 </span><span class="lineCov"> 5208 : const std::string & prefix = "") {</span> -<span class="lineNum"> 137 </span><span class="lineCov"> 5208 : return index_text_without_positions(Utf8Iterator(text), weight, prefix);</span> -<span class="lineNum"> 138 </span> : } -<span class="lineNum"> 139 </span> : -<span class="lineNum"> 140 </span> : /** Increase the termpos used by index_text by @a delta. -<span class="lineNum"> 141 </span> : * -<span class="lineNum"> 142 </span> : * This can be used to prevent phrase searches from spanning two -<span class="lineNum"> 143 </span> : * unconnected blocks of text (e.g. the title and body text). -<span class="lineNum"> 144 </span> : */ -<span class="lineNum"> 145 </span> : void increase_termpos(Xapian::termcount delta = 100); -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : /// Get the current term position. -<span class="lineNum"> 148 </span> : Xapian::termcount get_termpos() const; -<span class="lineNum"> 149 </span> : -<span class="lineNum"> 150 </span> : /// Set the current term position. -<span class="lineNum"> 151 </span> : void set_termpos(Xapian::termcount termpos); -<span class="lineNum"> 152 </span> : -<span class="lineNum"> 153 </span> : /// Return a string describing this object. -<span class="lineNum"> 154 </span> : std::string get_description() const; -<span class="lineNum"> 155 </span> : }; -<span class="lineNum"> 156 </span> : -<span class="lineNum"> 157 </span> : } -<span class="lineNum"> 158 </span> : -<span class="lineNum"> 159 </span> : #endif // XAPIAN_INCLUDED_TERMGENERATOR_H -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/termiterator.h.gcov.html b/rep/usr/include/xapian/termiterator.h.gcov.html deleted file mode 100644 index fbdbc0b..0000000 --- a/rep/usr/include/xapian/termiterator.h.gcov.html +++ /dev/null @@ -1,216 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/termiterator.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - termiterator.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">100.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">4</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** \file termiterator.h -<span class="lineNum"> 2 </span> : * \brief Classes for iterating through term lists -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright 1999,2000,2001 BrightStation PLC -<span class="lineNum"> 5 </span> : * Copyright 2002 Ananova Ltd -<span class="lineNum"> 6 </span> : * Copyright 2003,2004,2005,2006,2007 Olly Betts -<span class="lineNum"> 7 </span> : * -<span class="lineNum"> 8 </span> : * This program is free software; you can redistribute it and/or -<span class="lineNum"> 9 </span> : * modify it under the terms of the GNU General Public License as -<span class="lineNum"> 10 </span> : * published by the Free Software Foundation; either version 2 of the -<span class="lineNum"> 11 </span> : * License, or (at your option) any later version. -<span class="lineNum"> 12 </span> : * -<span class="lineNum"> 13 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 14 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 15 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 16 </span> : * GNU General Public License for more details. -<span class="lineNum"> 17 </span> : * -<span class="lineNum"> 18 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 19 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 20 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 -<span class="lineNum"> 21 </span> : * USA -<span class="lineNum"> 22 </span> : */ -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #ifndef XAPIAN_INCLUDED_TERMITERATOR_H -<span class="lineNum"> 25 </span> : #define XAPIAN_INCLUDED_TERMITERATOR_H -<span class="lineNum"> 26 </span> : -<span class="lineNum"> 27 </span> : #include <iterator> -<span class="lineNum"> 28 </span> : #include <string> -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : #include <xapian/base.h> -<span class="lineNum"> 31 </span> : #include <xapian/types.h> -<span class="lineNum"> 32 </span> : #include <xapian/positioniterator.h> -<span class="lineNum"> 33 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 34 </span> : -<span class="lineNum"> 35 </span> : namespace Xapian { -<span class="lineNum"> 36 </span> : -<span class="lineNum"> 37 </span> : class Database; -<span class="lineNum"> 38 </span> : -<span class="lineNum"> 39 </span> : /** @internal A wrapper class for a termname which returns the termname if -<span class="lineNum"> 40 </span> : * dereferenced with *. We need this to implement input_iterator semantics. -<span class="lineNum"> 41 </span> : */ -<span class="lineNum"> 42 </span> : class TermNameWrapper { -<span class="lineNum"> 43 </span> : private: -<span class="lineNum"> 44 </span> : std::string tname; -<span class="lineNum"> 45 </span> : public: -<span class="lineNum"> 46 </span> : explicit TermNameWrapper(const std::string & tname_) : tname(tname_) { } -<span class="lineNum"> 47 </span> : const std::string & operator*() const { return tname; } -<span class="lineNum"> 48 </span> : }; -<span class="lineNum"> 49 </span> : -<span class="lineNum"> 50 </span> : /** An iterator pointing to items in a list of terms. -<span class="lineNum"> 51 </span> : */ -<span class="lineNum"> 52 </span> : class XAPIAN_VISIBILITY_DEFAULT TermIterator { -<span class="lineNum"> 53 </span> : public: -<span class="lineNum"> 54 </span> : class Internal; -<span class="lineNum"> 55 </span> : /// @internal Reference counted internals. -<span class="lineNum"> 56 </span> : Xapian::Internal::RefCntPtr<Internal> internal; -<span class="lineNum"> 57 </span> : -<span class="lineNum"> 58 </span> : /// @internal Reference counted internals. -<span class="lineNum"> 59 </span> : explicit TermIterator(Internal *internal_); -<span class="lineNum"> 60 </span> : -<span class="lineNum"> 61 </span> : /// Default constructor - for declaring an uninitialised iterator. -<span class="lineNum"> 62 </span> : TermIterator(); -<span class="lineNum"> 63 </span> : -<span class="lineNum"> 64 </span> : /// Destructor. -<span class="lineNum"> 65 </span> : ~TermIterator(); -<span class="lineNum"> 66 </span> : -<span class="lineNum"> 67 </span> : /** Copying is allowed. The internals are reference counted, so -<span class="lineNum"> 68 </span> : * copying is also cheap. -<span class="lineNum"> 69 </span> : */ -<span class="lineNum"> 70 </span> : TermIterator(const TermIterator &other); -<span class="lineNum"> 71 </span> : -<span class="lineNum"> 72 </span> : /** Assignment is allowed. The internals are reference counted, -<span class="lineNum"> 73 </span> : * so assignment is also cheap. -<span class="lineNum"> 74 </span> : */ -<span class="lineNum"> 75 </span> : void operator=(const TermIterator &other); -<span class="lineNum"> 76 </span> : -<span class="lineNum"> 77 </span> : /// Return the current term. -<span class="lineNum"> 78 </span> : std::string operator *() const; -<span class="lineNum"> 79 </span> : -<span class="lineNum"> 80 </span> : TermIterator & operator++(); -<span class="lineNum"> 81 </span> : -<span class="lineNum"> 82 </span> : TermNameWrapper operator++(int) { -<span class="lineNum"> 83 </span> : std::string tmp = **this; -<span class="lineNum"> 84 </span> : operator++(); -<span class="lineNum"> 85 </span> : return TermNameWrapper(tmp); -<span class="lineNum"> 86 </span> : } -<span class="lineNum"> 87 </span> : -<span class="lineNum"> 88 </span> : /** Skip the iterator to term tname, or the first term after tname -<span class="lineNum"> 89 </span> : * if tname isn't in the list of terms being iterated. -<span class="lineNum"> 90 </span> : */ -<span class="lineNum"> 91 </span> : void skip_to(const std::string & tname); -<span class="lineNum"> 92 </span> : -<span class="lineNum"> 93 </span> : /** Return the wdf of the current term (if meaningful). -<span class="lineNum"> 94 </span> : * -<span class="lineNum"> 95 </span> : * The wdf (within document frequency) is the number of occurences -<span class="lineNum"> 96 </span> : * of a term in a particular document. -<span class="lineNum"> 97 </span> : */ -<span class="lineNum"> 98 </span> : Xapian::termcount get_wdf() const; -<span class="lineNum"> 99 </span> : -<span class="lineNum"> 100 </span> : /** Return the term frequency of the current term (if meaningful). -<span class="lineNum"> 101 </span> : * -<span class="lineNum"> 102 </span> : * The term frequency is the number of documents which a term indexes. -<span class="lineNum"> 103 </span> : */ -<span class="lineNum"> 104 </span> : Xapian::doccount get_termfreq() const; -<span class="lineNum"> 105 </span> : -<span class="lineNum"> 106 </span> : /** Return length of positionlist for current term. -<span class="lineNum"> 107 </span> : */ -<span class="lineNum"> 108 </span> : Xapian::termcount positionlist_count() const; -<span class="lineNum"> 109 </span> : -<span class="lineNum"> 110 </span> : /** Return PositionIterator pointing to start of positionlist for -<span class="lineNum"> 111 </span> : * current term. -<span class="lineNum"> 112 </span> : */ -<span class="lineNum"> 113 </span> : PositionIterator positionlist_begin() const; -<span class="lineNum"> 114 </span> : -<span class="lineNum"> 115 </span> : /** Return PositionIterator pointing to end of positionlist for -<span class="lineNum"> 116 </span> : * current term. -<span class="lineNum"> 117 </span> : */ -<span class="lineNum"> 118 </span> : PositionIterator positionlist_end() const { -<span class="lineNum"> 119 </span> : return PositionIterator(NULL); -<span class="lineNum"> 120 </span> : } -<span class="lineNum"> 121 </span> : -<span class="lineNum"> 122 </span> : /// Return a string describing this object. -<span class="lineNum"> 123 </span> : std::string get_description() const; -<span class="lineNum"> 124 </span> : -<span class="lineNum"> 125 </span> : /// Allow use as an STL iterator -<span class="lineNum"> 126 </span> : //@{ -<span class="lineNum"> 127 </span> : typedef std::input_iterator_tag iterator_category; -<span class="lineNum"> 128 </span> : typedef std::string value_type; -<span class="lineNum"> 129 </span> : typedef Xapian::termcount_diff difference_type; -<span class="lineNum"> 130 </span> : typedef std::string * pointer; -<span class="lineNum"> 131 </span> : typedef std::string & reference; -<span class="lineNum"> 132 </span> : //@} -<span class="lineNum"> 133 </span> : }; -<span class="lineNum"> 134 </span> : -<span class="lineNum"> 135 </span> : inline bool -<span class="lineNum"> 136 </span><span class="lineCov"> 5 : operator==(const TermIterator &a, const TermIterator &b)</span> -<span class="lineNum"> 137 </span> : { -<span class="lineNum"> 138 </span><span class="lineCov"> 5 : return (a.internal.get() == b.internal.get());</span> -<span class="lineNum"> 139 </span> : } -<span class="lineNum"> 140 </span> : -<span class="lineNum"> 141 </span> : inline bool -<span class="lineNum"> 142 </span><span class="lineCov"> 5 : operator!=(const TermIterator &a, const TermIterator &b)</span> -<span class="lineNum"> 143 </span> : { -<span class="lineNum"> 144 </span><span class="lineCov"> 5 : return !(a == b);</span> -<span class="lineNum"> 145 </span> : } -<span class="lineNum"> 146 </span> : -<span class="lineNum"> 147 </span> : } -<span class="lineNum"> 148 </span> : -<span class="lineNum"> 149 </span> : #endif /* XAPIAN_INCLUDED_TERMITERATOR_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> diff --git a/rep/usr/include/xapian/unicode.h.gcov.html b/rep/usr/include/xapian/unicode.h.gcov.html deleted file mode 100644 index 72c1ad3..0000000 --- a/rep/usr/include/xapian/unicode.h.gcov.html +++ /dev/null @@ -1,433 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/xapian/unicode.h</title> - <link rel="stylesheet" type="text/css" href="../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../index.html">directory</a> - <a href="index.html">usr/include/xapian</a> - unicode.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">8</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">87.5 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">7</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : /** @file unicode.h -<span class="lineNum"> 2 </span> : * @brief Unicode and UTF-8 related classes and functions. -<span class="lineNum"> 3 </span> : */ -<span class="lineNum"> 4 </span> : /* Copyright (C) 2006,2007,2008 Olly Betts -<span class="lineNum"> 5 </span> : * -<span class="lineNum"> 6 </span> : * This program is free software; you can redistribute it and/or modify -<span class="lineNum"> 7 </span> : * it under the terms of the GNU General Public License as published by -<span class="lineNum"> 8 </span> : * the Free Software Foundation; either version 2 of the License, or -<span class="lineNum"> 9 </span> : * (at your option) any later version. -<span class="lineNum"> 10 </span> : * -<span class="lineNum"> 11 </span> : * This program is distributed in the hope that it will be useful, -<span class="lineNum"> 12 </span> : * but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 13 </span> : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 14 </span> : * GNU General Public License for more details. -<span class="lineNum"> 15 </span> : * -<span class="lineNum"> 16 </span> : * You should have received a copy of the GNU General Public License -<span class="lineNum"> 17 </span> : * along with this program; if not, write to the Free Software -<span class="lineNum"> 18 </span> : * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA -<span class="lineNum"> 19 </span> : */ -<span class="lineNum"> 20 </span> : -<span class="lineNum"> 21 </span> : #ifndef XAPIAN_INCLUDED_UNICODE_H -<span class="lineNum"> 22 </span> : #define XAPIAN_INCLUDED_UNICODE_H -<span class="lineNum"> 23 </span> : -<span class="lineNum"> 24 </span> : #include <xapian/visibility.h> -<span class="lineNum"> 25 </span> : -<span class="lineNum"> 26 </span> : #include <string> -<span class="lineNum"> 27 </span> : -<span class="lineNum"> 28 </span> : namespace Xapian { -<span class="lineNum"> 29 </span> : -<span class="lineNum"> 30 </span> : /** An iterator which returns unicode character values from a UTF-8 encoded -<span class="lineNum"> 31 </span> : * string. -<span class="lineNum"> 32 </span> : */ -<span class="lineNum"> 33 </span> : class XAPIAN_VISIBILITY_DEFAULT Utf8Iterator { -<span class="lineNum"> 34 </span> : const unsigned char *p; -<span class="lineNum"> 35 </span> : const unsigned char *end; -<span class="lineNum"> 36 </span> : mutable unsigned seqlen; -<span class="lineNum"> 37 </span> : -<span class="lineNum"> 38 </span> : void calculate_sequence_length() const; -<span class="lineNum"> 39 </span> : -<span class="lineNum"> 40 </span> : unsigned get_char() const; -<span class="lineNum"> 41 </span> : -<span class="lineNum"> 42 </span> : Utf8Iterator(const unsigned char *p_, const unsigned char *end_, unsigned seqlen_) -<span class="lineNum"> 43 </span> : : p(p_), end(end_), seqlen(seqlen_) { } -<span class="lineNum"> 44 </span> : -<span class="lineNum"> 45 </span> : public: -<span class="lineNum"> 46 </span> : /** Return the raw const char * pointer for the current position. */ -<span class="lineNum"> 47 </span> : const char * raw() const { -<span class="lineNum"> 48 </span> : return reinterpret_cast<const char *>(p ? p : end); -<span class="lineNum"> 49 </span> : } -<span class="lineNum"> 50 </span> : -<span class="lineNum"> 51 </span> : /** Return the number of bytes left in the iterator's buffer. */ -<span class="lineNum"> 52 </span> : size_t left() const { return p ? end - p : 0; } -<span class="lineNum"> 53 </span> : -<span class="lineNum"> 54 </span> : /** Assign a new string to the iterator. -<span class="lineNum"> 55 </span> : * -<span class="lineNum"> 56 </span> : * The iterator will forget the string it was iterating through, and -<span class="lineNum"> 57 </span> : * return characters from the start of the new string when next called. -<span class="lineNum"> 58 </span> : * The string is not copied into the iterator, so it must remain valid -<span class="lineNum"> 59 </span> : * while the iteration is in progress. -<span class="lineNum"> 60 </span> : * -<span class="lineNum"> 61 </span> : * @param p A pointer to the start of the string to read. -<span class="lineNum"> 62 </span> : * -<span class="lineNum"> 63 </span> : * @param len The length of the string to read. -<span class="lineNum"> 64 </span> : */ -<span class="lineNum"> 65 </span><span class="lineCov"> 5208 : void assign(const char *p_, size_t len) {</span> -<span class="lineNum"> 66 </span><span class="lineCov"> 5208 : if (len) {</span> -<span class="lineNum"> 67 </span><span class="lineCov"> 5208 : p = reinterpret_cast<const unsigned char*>(p_);</span> -<span class="lineNum"> 68 </span><span class="lineCov"> 5208 : end = p + len;</span> -<span class="lineNum"> 69 </span><span class="lineCov"> 5208 : seqlen = 0;</span> -<span class="lineNum"> 70 </span> : } else { -<span class="lineNum"> 71 </span><span class="lineNoCov"> 0 : p = NULL;</span> -<span class="lineNum"> 72 </span> : } -<span class="lineNum"> 73 </span><span class="lineCov"> 5208 : }</span> -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : /** Assign a new string to the iterator. -<span class="lineNum"> 76 </span> : * -<span class="lineNum"> 77 </span> : * The iterator will forget the string it was iterating through, and -<span class="lineNum"> 78 </span> : * return characters from the start of the new string when next called. -<span class="lineNum"> 79 </span> : * The string is not copied into the iterator, so it must remain valid -<span class="lineNum"> 80 </span> : * while the iteration is in progress. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * @param s The string to read. Must not be modified while the iteration -<span class="lineNum"> 83 </span> : * is in progress. -<span class="lineNum"> 84 </span> : */ -<span class="lineNum"> 85 </span> : void assign(const std::string &s) { assign(s.data(), s.size()); } -<span class="lineNum"> 86 </span> : -<span class="lineNum"> 87 </span> : /** Create an iterator given a pointer to a null terminated string. -<span class="lineNum"> 88 </span> : * -<span class="lineNum"> 89 </span> : * The iterator will return characters from the start of the string when -<span class="lineNum"> 90 </span> : * next called. The string is not copied into the iterator, so it must -<span class="lineNum"> 91 </span> : * remain valid while the iteration is in progress. -<span class="lineNum"> 92 </span> : * -<span class="lineNum"> 93 </span> : * @param p A pointer to the start of the null terminated string to read. -<span class="lineNum"> 94 </span> : */ -<span class="lineNum"> 95 </span> : explicit Utf8Iterator(const char *p_); -<span class="lineNum"> 96 </span> : -<span class="lineNum"> 97 </span> : /** Create an iterator given a pointer and a length. -<span class="lineNum"> 98 </span> : * -<span class="lineNum"> 99 </span> : * The iterator will return characters from the start of the string when -<span class="lineNum"> 100 </span> : * next called. The string is not copied into the iterator, so it must -<span class="lineNum"> 101 </span> : * remain valid while the iteration is in progress. -<span class="lineNum"> 102 </span> : * -<span class="lineNum"> 103 </span> : * @param p A pointer to the start of the string to read. -<span class="lineNum"> 104 </span> : * -<span class="lineNum"> 105 </span> : * @param len The length of the string to read. -<span class="lineNum"> 106 </span> : */ -<span class="lineNum"> 107 </span> : Utf8Iterator(const char *p_, size_t len) { assign(p_, len); } -<span class="lineNum"> 108 </span> : -<span class="lineNum"> 109 </span> : /** Create an iterator given a string. -<span class="lineNum"> 110 </span> : * -<span class="lineNum"> 111 </span> : * The iterator will return characters from the start of the string when -<span class="lineNum"> 112 </span> : * next called. The string is not copied into the iterator, so it must -<span class="lineNum"> 113 </span> : * remain valid while the iteration is in progress. -<span class="lineNum"> 114 </span> : * -<span class="lineNum"> 115 </span> : * @param s The string to read. Must not be modified while the iteration -<span class="lineNum"> 116 </span> : * is in progress. -<span class="lineNum"> 117 </span> : */ -<span class="lineNum"> 118 </span><span class="lineCov"> 5208 : Utf8Iterator(const std::string &s) { assign(s.data(), s.size()); }</span> -<span class="lineNum"> 119 </span> : -<span class="lineNum"> 120 </span> : /** Create an iterator which is at the end of its iteration. -<span class="lineNum"> 121 </span> : * -<span class="lineNum"> 122 </span> : * This can be compared to another iterator to check if the other iterator -<span class="lineNum"> 123 </span> : * has reached its end. -<span class="lineNum"> 124 </span> : */ -<span class="lineNum"> 125 </span> : Utf8Iterator() : p(NULL), end(0), seqlen(0) { } -<span class="lineNum"> 126 </span> : -<span class="lineNum"> 127 </span> : /** Get the current unicode character value pointed to by the iterator. -<span class="lineNum"> 128 </span> : * -<span class="lineNum"> 129 </span> : * Returns unsigned(-1) if the iterator has reached the end of its buffer. -<span class="lineNum"> 130 </span> : */ -<span class="lineNum"> 131 </span> : unsigned operator*() const; -<span class="lineNum"> 132 </span> : -<span class="lineNum"> 133 </span> : /** Move forward to the next unicode character. -<span class="lineNum"> 134 </span> : * -<span class="lineNum"> 135 </span> : * @return An iterator pointing to the position before the move. -<span class="lineNum"> 136 </span> : */ -<span class="lineNum"> 137 </span> : Utf8Iterator operator++(int) { -<span class="lineNum"> 138 </span> : // If we've not calculated seqlen yet, do so. -<span class="lineNum"> 139 </span> : if (seqlen == 0) calculate_sequence_length(); -<span class="lineNum"> 140 </span> : const unsigned char *old_p = p; -<span class="lineNum"> 141 </span> : unsigned old_seqlen = seqlen; -<span class="lineNum"> 142 </span> : p += seqlen; -<span class="lineNum"> 143 </span> : if (p == end) p = NULL; -<span class="lineNum"> 144 </span> : seqlen = 0; -<span class="lineNum"> 145 </span> : return Utf8Iterator(old_p, end, old_seqlen); -<span class="lineNum"> 146 </span> : } -<span class="lineNum"> 147 </span> : -<span class="lineNum"> 148 </span> : /** Move forward to the next unicode character. -<span class="lineNum"> 149 </span> : * -<span class="lineNum"> 150 </span> : * @return A reference to this object. -<span class="lineNum"> 151 </span> : */ -<span class="lineNum"> 152 </span> : Utf8Iterator & operator++() { -<span class="lineNum"> 153 </span> : if (seqlen == 0) calculate_sequence_length(); -<span class="lineNum"> 154 </span> : p += seqlen; -<span class="lineNum"> 155 </span> : if (p == end) p = NULL; -<span class="lineNum"> 156 </span> : seqlen = 0; -<span class="lineNum"> 157 </span> : return *this; -<span class="lineNum"> 158 </span> : } -<span class="lineNum"> 159 </span> : -<span class="lineNum"> 160 </span> : /** Test two Utf8Iterators for equality. -<span class="lineNum"> 161 </span> : * -<span class="lineNum"> 162 </span> : * @return true iff the iterators point to the same position. -<span class="lineNum"> 163 </span> : */ -<span class="lineNum"> 164 </span> : bool operator==(const Utf8Iterator &other) const { return p == other.p; } -<span class="lineNum"> 165 </span> : -<span class="lineNum"> 166 </span> : /** Test two Utf8Iterators for inequality. -<span class="lineNum"> 167 </span> : * -<span class="lineNum"> 168 </span> : * @return true iff the iterators do not point to the same position. -<span class="lineNum"> 169 </span> : */ -<span class="lineNum"> 170 </span> : bool operator!=(const Utf8Iterator &other) const { return p != other.p; } -<span class="lineNum"> 171 </span> : -<span class="lineNum"> 172 </span> : /// We implement the semantics of an STL input_iterator. -<span class="lineNum"> 173 </span> : //@{ -<span class="lineNum"> 174 </span> : typedef std::input_iterator_tag iterator_category; -<span class="lineNum"> 175 </span> : typedef unsigned value_type; -<span class="lineNum"> 176 </span> : typedef size_t difference_type; -<span class="lineNum"> 177 </span> : typedef const unsigned * pointer; -<span class="lineNum"> 178 </span> : typedef const unsigned & reference; -<span class="lineNum"> 179 </span> : //@} -<span class="lineNum"> 180 </span> : }; -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span> : namespace Unicode { -<span class="lineNum"> 183 </span> : -<span class="lineNum"> 184 </span> : /** Each unicode character is in one of these categories. */ -<span class="lineNum"> 185 </span> : typedef enum { -<span class="lineNum"> 186 </span> : UNASSIGNED, -<span class="lineNum"> 187 </span> : UPPERCASE_LETTER, -<span class="lineNum"> 188 </span> : LOWERCASE_LETTER, -<span class="lineNum"> 189 </span> : TITLECASE_LETTER, -<span class="lineNum"> 190 </span> : MODIFIER_LETTER, -<span class="lineNum"> 191 </span> : OTHER_LETTER, -<span class="lineNum"> 192 </span> : NON_SPACING_MARK, -<span class="lineNum"> 193 </span> : ENCLOSING_MARK, -<span class="lineNum"> 194 </span> : COMBINING_SPACING_MARK, -<span class="lineNum"> 195 </span> : DECIMAL_DIGIT_NUMBER, -<span class="lineNum"> 196 </span> : LETTER_NUMBER, -<span class="lineNum"> 197 </span> : OTHER_NUMBER, -<span class="lineNum"> 198 </span> : SPACE_SEPARATOR, -<span class="lineNum"> 199 </span> : LINE_SEPARATOR, -<span class="lineNum"> 200 </span> : PARAGRAPH_SEPARATOR, -<span class="lineNum"> 201 </span> : CONTROL, -<span class="lineNum"> 202 </span> : FORMAT, -<span class="lineNum"> 203 </span> : PRIVATE_USE, -<span class="lineNum"> 204 </span> : SURROGATE, -<span class="lineNum"> 205 </span> : CONNECTOR_PUNCTUATION, -<span class="lineNum"> 206 </span> : DASH_PUNCTUATION, -<span class="lineNum"> 207 </span> : OPEN_PUNCTUATION, -<span class="lineNum"> 208 </span> : CLOSE_PUNCTUATION, -<span class="lineNum"> 209 </span> : INITIAL_QUOTE_PUNCTUATION, -<span class="lineNum"> 210 </span> : FINAL_QUOTE_PUNCTUATION, -<span class="lineNum"> 211 </span> : OTHER_PUNCTUATION, -<span class="lineNum"> 212 </span> : MATH_SYMBOL, -<span class="lineNum"> 213 </span> : CURRENCY_SYMBOL, -<span class="lineNum"> 214 </span> : MODIFIER_SYMBOL, -<span class="lineNum"> 215 </span> : OTHER_SYMBOL -<span class="lineNum"> 216 </span> : } category; -<span class="lineNum"> 217 </span> : -<span class="lineNum"> 218 </span> : namespace Internal { -<span class="lineNum"> 219 </span> : /** @internal Extract the information about a character from the Unicode -<span class="lineNum"> 220 </span> : * character tables. -<span class="lineNum"> 221 </span> : * -<span class="lineNum"> 222 </span> : * ch must be a valid Unicode character value (i.e. < 0x110000) -<span class="lineNum"> 223 </span> : */ -<span class="lineNum"> 224 </span> : XAPIAN_VISIBILITY_DEFAULT -<span class="lineNum"> 225 </span> : int get_character_info(unsigned ch); -<span class="lineNum"> 226 </span> : -<span class="lineNum"> 227 </span> : /** @internal Extract how to convert the case of a unicode character from -<span class="lineNum"> 228 </span> : * its info. -<span class="lineNum"> 229 </span> : */ -<span class="lineNum"> 230 </span> : inline int get_case_type(int info) { return ((info & 0xe0) >> 5); } -<span class="lineNum"> 231 </span> : -<span class="lineNum"> 232 </span> : /// @internal Extract the category of a unicode character from its info. -<span class="lineNum"> 233 </span> : inline category get_category(int info) { return static_cast<category>(info & 0x1f); } -<span class="lineNum"> 234 </span> : -<span class="lineNum"> 235 </span> : /** @internal Extract the delta to use for case conversion of a character -<span class="lineNum"> 236 </span> : * from its info. -<span class="lineNum"> 237 </span> : */ -<span class="lineNum"> 238 </span> : inline int get_delta(int info) { -<span class="lineNum"> 239 </span> : /* It's implementation defined if sign extension happens on right shift -<span class="lineNum"> 240 </span> : * of a signed int, hence the conditional (hopefully the compiler will -<span class="lineNum"> 241 </span> : * spot this and optimise it to a sign-extending shift on architectures -<span class="lineNum"> 242 </span> : * with a suitable instruction). -<span class="lineNum"> 243 </span> : */ -<span class="lineNum"> 244 </span> : return (info >= 0) ? (info >> 15) : (~(~info >> 15)); -<span class="lineNum"> 245 </span> : } -<span class="lineNum"> 246 </span> : } -<span class="lineNum"> 247 </span> : -<span class="lineNum"> 248 </span> : /** Convert a single non-ASCII unicode character to UTF-8. -<span class="lineNum"> 249 </span> : * -<span class="lineNum"> 250 </span> : * This is intended mainly as a helper method for to_utf8(). -<span class="lineNum"> 251 </span> : * -<span class="lineNum"> 252 </span> : * The character @a ch (which must be > 128) is written to the buffer @a buf -<span class="lineNum"> 253 </span> : * and the length of the resultant UTF-8 character is returned. -<span class="lineNum"> 254 </span> : * -<span class="lineNum"> 255 </span> : * NB buf must have space for (at least) 4 bytes. -<span class="lineNum"> 256 </span> : */ -<span class="lineNum"> 257 </span> : XAPIAN_VISIBILITY_DEFAULT -<span class="lineNum"> 258 </span> : unsigned nonascii_to_utf8(unsigned ch, char * buf); -<span class="lineNum"> 259 </span> : -<span class="lineNum"> 260 </span> : /** Convert a single unicode character to UTF-8. -<span class="lineNum"> 261 </span> : * -<span class="lineNum"> 262 </span> : * The character @a ch is written to the buffer @a buf and the length of the -<span class="lineNum"> 263 </span> : * resultant UTF-8 character is returned. -<span class="lineNum"> 264 </span> : * -<span class="lineNum"> 265 </span> : * NB buf must have space for (at least) 4 bytes. -<span class="lineNum"> 266 </span> : */ -<span class="lineNum"> 267 </span> : inline unsigned to_utf8(unsigned ch, char *buf) { -<span class="lineNum"> 268 </span> : if (ch < 128) { -<span class="lineNum"> 269 </span> : *buf = static_cast<unsigned char>(ch); -<span class="lineNum"> 270 </span> : return 1; -<span class="lineNum"> 271 </span> : } -<span class="lineNum"> 272 </span> : return Xapian::Unicode::nonascii_to_utf8(ch, buf); -<span class="lineNum"> 273 </span> : } -<span class="lineNum"> 274 </span> : -<span class="lineNum"> 275 </span> : /** Append the UTF-8 representation of a single unicode character to a -<span class="lineNum"> 276 </span> : * std::string. -<span class="lineNum"> 277 </span> : */ -<span class="lineNum"> 278 </span> : inline void append_utf8(std::string &s, unsigned ch) { -<span class="lineNum"> 279 </span> : char buf[4]; -<span class="lineNum"> 280 </span> : s.append(buf, to_utf8(ch, buf)); -<span class="lineNum"> 281 </span> : } -<span class="lineNum"> 282 </span> : -<span class="lineNum"> 283 </span> : /// Return the category which a given unicode character falls into. -<span class="lineNum"> 284 </span> : inline category get_category(unsigned ch) { -<span class="lineNum"> 285 </span> : // Categorise non-Unicode values as UNASSIGNED. -<span class="lineNum"> 286 </span> : if (ch >= 0x110000) return Xapian::Unicode::UNASSIGNED; -<span class="lineNum"> 287 </span> : return Internal::get_category(Internal::get_character_info(ch)); -<span class="lineNum"> 288 </span> : } -<span class="lineNum"> 289 </span> : -<span class="lineNum"> 290 </span> : /// Test is a given unicode character is a letter or number. -<span class="lineNum"> 291 </span> : inline bool is_wordchar(unsigned ch) { -<span class="lineNum"> 292 </span> : const unsigned int WORDCHAR_MASK = -<span class="lineNum"> 293 </span> : (1 << Xapian::Unicode::UPPERCASE_LETTER) | -<span class="lineNum"> 294 </span> : (1 << Xapian::Unicode::LOWERCASE_LETTER) | -<span class="lineNum"> 295 </span> : (1 << Xapian::Unicode::TITLECASE_LETTER) | -<span class="lineNum"> 296 </span> : (1 << Xapian::Unicode::MODIFIER_LETTER) | -<span class="lineNum"> 297 </span> : (1 << Xapian::Unicode::OTHER_LETTER) | -<span class="lineNum"> 298 </span> : (1 << Xapian::Unicode::DECIMAL_DIGIT_NUMBER) | -<span class="lineNum"> 299 </span> : (1 << Xapian::Unicode::LETTER_NUMBER) | -<span class="lineNum"> 300 </span> : (1 << Xapian::Unicode::OTHER_NUMBER) | -<span class="lineNum"> 301 </span> : (1 << Xapian::Unicode::CONNECTOR_PUNCTUATION); -<span class="lineNum"> 302 </span> : return ((WORDCHAR_MASK >> get_category(ch)) & 1); -<span class="lineNum"> 303 </span> : } -<span class="lineNum"> 304 </span> : -<span class="lineNum"> 305 </span> : /// Test is a given unicode character is a whitespace character. -<span class="lineNum"> 306 </span> : inline bool is_whitespace(unsigned ch) { -<span class="lineNum"> 307 </span> : const unsigned int WHITESPACE_MASK = -<span class="lineNum"> 308 </span> : (1 << Xapian::Unicode::CONTROL) | // For TAB, CR, LF, FF. -<span class="lineNum"> 309 </span> : (1 << Xapian::Unicode::SPACE_SEPARATOR) | -<span class="lineNum"> 310 </span> : (1 << Xapian::Unicode::LINE_SEPARATOR) | -<span class="lineNum"> 311 </span> : (1 << Xapian::Unicode::PARAGRAPH_SEPARATOR); -<span class="lineNum"> 312 </span> : return ((WHITESPACE_MASK >> get_category(ch)) & 1); -<span class="lineNum"> 313 </span> : } -<span class="lineNum"> 314 </span> : -<span class="lineNum"> 315 </span> : /// Test is a given unicode character is a currency symbol. -<span class="lineNum"> 316 </span> : inline bool is_currency(unsigned ch) { -<span class="lineNum"> 317 </span> : return (get_category(ch) == Xapian::Unicode::CURRENCY_SYMBOL); -<span class="lineNum"> 318 </span> : } -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : /// Convert a unicode character to lowercase. -<span class="lineNum"> 321 </span> : inline unsigned tolower(unsigned ch) { -<span class="lineNum"> 322 </span> : int info; -<span class="lineNum"> 323 </span> : // Leave non-Unicode values unchanged. -<span class="lineNum"> 324 </span> : if (ch >= 0x110000 || !(Internal::get_case_type((info = Xapian::Unicode::Internal::get_character_info(ch))) & 2)) -<span class="lineNum"> 325 </span> : return ch; -<span class="lineNum"> 326 </span> : return ch + Internal::get_delta(info); -<span class="lineNum"> 327 </span> : } -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : /// Convert a unicode character to uppercase. -<span class="lineNum"> 330 </span> : inline unsigned toupper(unsigned ch) { -<span class="lineNum"> 331 </span> : int info; -<span class="lineNum"> 332 </span> : // Leave non-Unicode values unchanged. -<span class="lineNum"> 333 </span> : if (ch >= 0x110000 || !(Internal::get_case_type((info = Xapian::Unicode::Internal::get_character_info(ch))) & 4)) -<span class="lineNum"> 334 </span> : return ch; -<span class="lineNum"> 335 </span> : return ch - Internal::get_delta(info); -<span class="lineNum"> 336 </span> : } -<span class="lineNum"> 337 </span> : -<span class="lineNum"> 338 </span> : /// Convert a UTF-8 std::string to lowercase. -<span class="lineNum"> 339 </span> : inline std::string -<span class="lineNum"> 340 </span> : tolower(const std::string &term) -<span class="lineNum"> 341 </span> : { -<span class="lineNum"> 342 </span> : std::string result; -<span class="lineNum"> 343 </span> : result.reserve(term.size()); -<span class="lineNum"> 344 </span> : for (Utf8Iterator i(term); i != Utf8Iterator(); ++i) { -<span class="lineNum"> 345 </span> : append_utf8(result, tolower(*i)); -<span class="lineNum"> 346 </span> : } -<span class="lineNum"> 347 </span> : return result; -<span class="lineNum"> 348 </span> : } -<span class="lineNum"> 349 </span> : -<span class="lineNum"> 350 </span> : /// Convert a UTF-8 std::string to uppercase. -<span class="lineNum"> 351 </span> : inline std::string -<span class="lineNum"> 352 </span> : toupper(const std::string &term) -<span class="lineNum"> 353 </span> : { -<span class="lineNum"> 354 </span> : std::string result; -<span class="lineNum"> 355 </span> : result.reserve(term.size()); -<span class="lineNum"> 356 </span> : for (Utf8Iterator i(term); i != Utf8Iterator(); ++i) { -<span class="lineNum"> 357 </span> : append_utf8(result, toupper(*i)); -<span class="lineNum"> 358 </span> : } -<span class="lineNum"> 359 </span> : return result; -<span class="lineNum"> 360 </span> : } -<span class="lineNum"> 361 </span> : -<span class="lineNum"> 362 </span> : } -<span class="lineNum"> 363 </span> : -<span class="lineNum"> 364 </span> : } -<span class="lineNum"> 365 </span> : -<span class="lineNum"> 366 </span> : #endif // XAPIAN_INCLUDED_UNICODE_H -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> |