~ubuntu-branches/debian/sid/boost1.49/sid

<a name="boost_regex.ref.regex_search.description"></a><a class="link" href="regex_search.html#boost_regex.ref.regex_search.description">Description</a>

</h5>

<pre class="programlisting">template <class BidirectionalIterator, class Allocator, class charT, class traits>

match_flag_type flags = match_default);

</pre>

Requires: Type BidirectionalIterator meets

the requirements of a Bidirectional Iterator (24.1.4).

Effects: Determines whether there is some

sub-sequence within [first,last) that matches the regular expression e,

parameter flags is used to control how the expression

is matched against the character sequence. Returns true if such a sequence

exists, false otherwise.

Throws: <code class="computeroutput">std::runtime_error</code>

if the complexity of matching the expression against an N character string

begins to exceed O(N2), or if the program runs out of stack space while matching

100

the expression (if Boost.Regex is configured in recursive mode), or if the

101

matcher exhausts its permitted memory allocation (if Boost.Regex is configured

102

in non-recursive mode).

103

104

105

Postconditions: If the function returns

106

false, then the effect on parameter m is undefined,

107

otherwise the effects on parameter m are given in the

108

table:

109

110

111

112

<col>

113

<col>

114

</colgroup>

115

116

<th>

117

118

Element

119

120

</th>

121

<th>

122

123

Value

124

125

</th>

126

</tr></thead>

127

<tbody>

128

<tr>

129

<td>

130

131

132

133

</td>

134

<td>

135

136

<code class="computeroutput">e.mark_count()</code>

137

138

</td>

139

</tr>

140

<tr>

141

<td>

142

143

<code class="computeroutput">m.empty()</code>

144

145

</td>

146

<td>

147

148

<code class="computeroutput">false</code>

149

150

</td>

151

</tr>

152

<tr>

153

<td>

154

155

<code class="computeroutput">m.prefix().first</code>

156

157

</td>

158

<td>

159

160

<code class="computeroutput">first</code>

161

162

</td>

163

</tr>

164

<tr>

165

<td>

166

167

168

169

</td>

170

<td>

171

172

<code class="computeroutput">m[0].first</code>

173

174

</td>

175

</tr>

176

<tr>

177

<td>

178

179

180

181

</td>

182

<td>

183

184

185

m.prefix().second</code>

186

187

</td>

188

</tr>

189

<tr>

190

<td>

191

192

<code class="computeroutput">m.suffix().first</code>

193

194

</td>

195

<td>

196

197

<code class="computeroutput">m[0].second</code>

198

199

</td>

200

</tr>

201

<tr>

202

<td>

203

204

205

206

</td>

207

<td>

208

209

210

211

</td>

212

</tr>

213

<tr>

214

<td>

215

216

217

218

</td>

219

<td>

220

221

222

m.suffix().second</code>

223

224

</td>

225

</tr>

226

<tr>

227

<td>

228

229

<code class="computeroutput">m[0].first</code>

230

231

</td>

232

<td>

233

234

The start of the sequence of characters that matched the regular

235

expression

236

237

</td>

238

</tr>

239

<tr>

240

<td>

241

242

<code class="computeroutput">m[0].second</code>

243

244

</td>

245

<td>

246

247

The end of the sequence of characters that matched the regular

248

expression

249

250

</td>

251

</tr>

252

<tr>

253

<td>

254

255

<code class="computeroutput">m[0].matched</code>

256

257

</td>

258

<td>

259

260

true if a full match was found, and false if it was a partial match

261

(found as a result of the match_partial flag being set).

262

263

</td>

264

</tr>

265

<tr>

266

<td>

267

268

<code class="computeroutput">m[n].first</code>

269

270

</td>

271

<td>

272

273

For all integers <code class="computeroutput">n < m.size()</code>, the start of the sequence that

274

matched sub-expression n. Alternatively, if

275

sub-expression n did not participate in the

276

match, then last.

277

278

</td>

279

</tr>

280

<tr>

281

<td>

282

283

284

285

</td>

286

<td>

287

288

289

matched sub-expression n. Alternatively, if

290

sub-expression n did not participate in the

291

match, then <code class="computeroutput">last</code>.

292

293

</td>

294

</tr>

295

<tr>

296

<td>

297

298

299

300

</td>

301

<td>

302

303

304

participated in the match, false otherwise.

305

306

</td>

307

</tr>

308

</tbody>

309

</table></div>

310

<pre class="programlisting">template <class charT, class Allocator, class traits>

311

bool regex_search(const charT* str, match_results<const charT*, Allocator>& m,

312

313

match_flag_type flags = match_default);

314

</pre>

315

316

317

+ char_traits<charT>::length(str),

318

m, e, flags)</code>.

319

320

<pre class="programlisting">template <class ST, class SA, class Allocator, class charT,

321

class traits>

322

323

match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,

324

325

match_flag_type flags = match_default);

326

</pre>

327

328

Effects: Returns the result of <code class="computeroutput">regex_search(s.begin(), s.end(), m, e, flags)</code>.

329

330

<pre class="programlisting">template <class iterator, class charT, class traits>

331

bool regex_search(iterator first, iterator last,

332

333

match_flag_type flags = match_default);

334

</pre>

335

336

Effects: Behaves "as if" by constructing

337

an instance of <code class="computeroutput">match_results<BidirectionalIterator> what</code>,

338

and then returning the result of <code class="computeroutput">regex_search(first, last, what, e,

339

flags)</code>.

340

341

342

343

344

match_flag_type flags = match_default);

345

</pre>

346

347

348

349

e, flags)</code>.

350

351

<pre class="programlisting">template <class ST, class SA, class charT, class traits>

352

353

354

match_flag_type flags = match_default);

355

</pre>

356

357

Effects: Returns the result of <code class="computeroutput">regex_search(s.begin(), s.end(), e, flags)</code>.

358

359

<h5>

360

361

<a name="boost_regex.ref.regex_search.examples"></a><a class="link" href="regex_search.html#boost_regex.ref.regex_search.examples">Examples</a>

362

</h5>

363

364

The following example, takes the contents of a file in the form of a string,

365

and searches for all the C++ class declarations in the file. The code will

366

work regardless of the way that <code class="computeroutput">std::string</code>

367

is implemented, for example it could easily be modified to work with the

368

SGI rope class, which uses a non-contiguous storage strategy.

369

370

<pre class="programlisting">#include <string>

371

#include <map>

372

#include <boost/regex.hpp>

373

374

// purpose:

375

// takes the contents of a file in the form of a string

376

// and searches for all the C++ class definitions, storing

377

// their locations in a map of strings/int's

378

typedef std::map<std::string, int, std::less<std::string> > map_type;

379

380

boost::regex expression(

381

"^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?"

382

"(class|struct)[[:space:]]*"

383

"(\\<\\w+\\>([[:blank:]]*\\([^)]*\\))?"

384

"[[:space:]]*)*(\\<\\w*\\>)[[:space:]]*"

385

"(<[^;:{]+>[[:space:]]*)?(\\{|:[^;\\{()]*\\{)");

386

387

void IndexClasses(map_type& m, const std::string& file)

388

{

389

std::string::const_iterator start, end;

390

start = file.begin();

391

end = file.end();

392

boost::match_results<std::string::const_iterator> what;

393

boost::match_flag_type flags = boost::match_default;

394

while(regex_search(start, end, what, expression, flags))

395

{

396

// what[0] contains the whole string

397

// what[5] contains the class name.

398

// what[6] contains the template specialisation if any.

399

// add class name and position to map:

400

m[std::string(what[5].first, what[5].second)

401

+ std::string(what[6].first, what[6].second)]

402

= what[5].first - file.begin();

403

// update search position:

404

start = what[0].second;

405

// update flags:

406

flags |= boost::match_prev_avail;

407

408

}

409

}

410

</pre>

411

</div>

412

413

414

415

Distributed under the Boost Software License, Version 1.0. (See accompanying

416

file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)

417

418

</div></td>

419

</tr></table>

420

<hr>

421

422

423

</div>

424

</body>

425

</html>

Older »