headers/cpp/algo.h

48

using __STD::replace;

headers/cpp/std/bastring.cc

131

return replace (pos1, n1, _str.data () + pos2, n2);

headers/cpp/std/bastring.h

211

{ return replace (length (), 0, _str, pos, n); }

headers/cpp/std/bastring.h

213

{ return replace (length (), 0, s, n); }

headers/cpp/std/bastring.h

217

{ return replace (length (), 0, n, c); }

headers/cpp/std/bastring.h

224

{ return replace (iend (), iend (), first, last); }

headers/cpp/std/bastring.h

231

{ return replace (0, npos, str, pos, n); }

headers/cpp/std/bastring.h

233

{ return replace (0, npos, s, n); }

headers/cpp/std/bastring.h

237

{ return replace (0, npos, n, c); }

headers/cpp/std/bastring.h

244

{ return replace (ibegin (), iend (), first, last); }

headers/cpp/std/bastring.h

260

{ return replace (pos1, 0, str, pos2, n); }

headers/cpp/std/bastring.h

262

{ return replace (pos, 0, s, n); }

headers/cpp/std/bastring.h

266

{ return replace (pos, 0, n, c); }

headers/cpp/std/bastring.h

281

{ replace (p, p, first, last); }

headers/cpp/std/bastring.h

284

{ return replace (pos, n, (size_type)0, (charT)0); }

headers/cpp/std/bastring.h

287

replace (__o, 1, (size_type)0, (charT)0); selfish ();

headers/cpp/std/bastring.h

291

replace (__o, l-f, (size_type)0, (charT)0);selfish ();

headers/cpp/std/bastring.h

296

basic_string& replace (size_type pos1, size_type n1, const basic_string& str,

headers/cpp/std/bastring.h

298

basic_string& replace (size_type pos, size_type n1, const charT* s,

headers/cpp/std/bastring.h

300

basic_string& replace (size_type pos, size_type n1, const charT* s)

headers/cpp/std/bastring.h

301

{ return replace (pos, n1, s, traits::length (s)); }

headers/cpp/std/bastring.h

302

basic_string& replace (size_type pos, size_type n1, size_type n2, charT c);

headers/cpp/std/bastring.h

303

basic_string& replace (size_type pos, size_type n, charT c)

headers/cpp/std/bastring.h

304

{ return replace (pos, n, 1, c); }

headers/cpp/std/bastring.h

305

basic_string& replace (iterator i1, iterator i2, const basic_string& str)

headers/cpp/std/bastring.h

306

{ return replace (i1 - ibegin (), i2 - i1, str); }

headers/cpp/std/bastring.h

307

basic_string& replace (iterator i1, iterator i2, const charT* s, size_type n)

headers/cpp/std/bastring.h

308

{ return replace (i1 - ibegin (), i2 - i1, s, n); }

headers/cpp/std/bastring.h

309

basic_string& replace (iterator i1, iterator i2, const charT* s)

headers/cpp/std/bastring.h

310

{ return replace (i1 - ibegin (), i2 - i1, s); }

headers/cpp/std/bastring.h

311

basic_string& replace (iterator i1, iterator i2, size_type n, charT c)

headers/cpp/std/bastring.h

312

{ return replace (i1 - ibegin (), i2 - i1, n, c); }

headers/cpp/std/bastring.h

315

basic_string& replace(iterator i1, iterator i2,

headers/cpp/std/bastring.h

318

basic_string& replace(iterator i1, iterator i2,

headers/cpp/std/bastring.h

463

replace (iterator i1, iterator i2, const_iterator j1, const_iterator j2)

headers/cpp/stl_rope.h

1952

static _RopeRep* replace(_RopeRep* __old, size_t __pos1,

headers/cpp/stl_rope.h

1976

replace(_M_tree_ptr, __p, __p, __r._M_tree_ptr);

headers/cpp/stl_rope.h

2031

void replace(size_t __p, size_t __n, const rope& __r) {

headers/cpp/stl_rope.h

2033

replace(_M_tree_ptr, __p, __p + __n, __r._M_tree_ptr);

headers/cpp/stl_rope.h

2038

void replace(size_t __p, size_t __n,

headers/cpp/stl_rope.h

2041

replace(__p, __n, __r);

headers/cpp/stl_rope.h

2044

void replace(size_t __p, size_t __n, _CharT __c) {

headers/cpp/stl_rope.h

2046

replace(__p, __n, __r);

headers/cpp/stl_rope.h

2049

void replace(size_t __p, size_t __n, const _CharT* __c_string) {

headers/cpp/stl_rope.h

2051

replace(__p, __n, __r);

headers/cpp/stl_rope.h

2054

void replace(size_t __p, size_t __n,

headers/cpp/stl_rope.h

2057

replace(__p, __n, __r);

headers/cpp/stl_rope.h

2060

void replace(size_t __p, size_t __n,

headers/cpp/stl_rope.h

2063

replace(__p, __n, __r);

headers/cpp/stl_rope.h

2066

void replace(size_t __p, size_t __n,

headers/cpp/stl_rope.h

2069

replace(__p, __n, __r);

headers/cpp/stl_rope.h

2073

void replace(size_t __p, _CharT __c) {

headers/cpp/stl_rope.h

2078

void replace(size_t __p, const rope& __r) {

headers/cpp/stl_rope.h

2079

replace(__p, 1, __r);

headers/cpp/stl_rope.h

2082

void replace(size_t __p, const _CharT* __i, size_t __i_len) {

headers/cpp/stl_rope.h

2083

replace(__p, 1, __i, __i_len);

headers/cpp/stl_rope.h

2086

void replace(size_t __p, const _CharT* __c_string) {

headers/cpp/stl_rope.h

2087

replace(__p, 1, __c_string);

headers/cpp/stl_rope.h

2090

void replace(size_t __p, const _CharT* __i, const _CharT* __j) {

headers/cpp/stl_rope.h

2091

replace(__p, 1, __i, __j);

headers/cpp/stl_rope.h

2094

void replace(size_t __p, const const_iterator& __i,

headers/cpp/stl_rope.h

2096

replace(__p, 1, __i, __j);

headers/cpp/stl_rope.h

2099

void replace(size_t __p, const iterator& __i,

headers/cpp/stl_rope.h

2101

replace(__p, 1, __i, __j);

headers/cpp/stl_rope.h

2106

_RopeRep* __result = replace(_M_tree_ptr, __p, __p + __n, 0);

headers/cpp/stl_rope.h

2140

void replace(const iterator& __p, const iterator& __q,

headers/cpp/stl_rope.h

2142

{ replace(__p.index(), __q.index() - __p.index(), __r); }

headers/cpp/stl_rope.h

2143

void replace(const iterator& __p, const iterator& __q, _CharT __c)

headers/cpp/stl_rope.h

2144

{ replace(__p.index(), __q.index() - __p.index(), __c); }

headers/cpp/stl_rope.h

2145

void replace(const iterator& __p, const iterator& __q,

headers/cpp/stl_rope.h

2147

{ replace(__p.index(), __q.index() - __p.index(), __c_string); }

headers/cpp/stl_rope.h

2148

void replace(const iterator& __p, const iterator& __q,

headers/cpp/stl_rope.h

2150

{ replace(__p.index(), __q.index() - __p.index(), __i, __n); }

headers/cpp/stl_rope.h

2151

void replace(const iterator& __p, const iterator& __q,

headers/cpp/stl_rope.h

2153

{ replace(__p.index(), __q.index() - __p.index(), __i, __j); }

headers/cpp/stl_rope.h

2154

void replace(const iterator& __p, const iterator& __q,

headers/cpp/stl_rope.h

2156

{ replace(__p.index(), __q.index() - __p.index(), __i, __j); }

headers/cpp/stl_rope.h

2157

void replace(const iterator& __p, const iterator& __q,

headers/cpp/stl_rope.h

2159

{ replace(__p.index(), __q.index() - __p.index(), __i, __j); }

headers/cpp/stl_rope.h

2162

void replace(const iterator& __p, const rope& __r)

headers/cpp/stl_rope.h

2163

{ replace(__p.index(), __r); }

headers/cpp/stl_rope.h

2164

void replace(const iterator& __p, _CharT __c)

headers/cpp/stl_rope.h

2165

{ replace(__p.index(), __c); }

headers/cpp/stl_rope.h

2166

void replace(const iterator& __p, const _CharT* __c_string)

headers/cpp/stl_rope.h

2167

{ replace(__p.index(), __c_string); }

headers/cpp/stl_rope.h

2168

void replace(const iterator& __p, const _CharT* __i, size_t __n)

headers/cpp/stl_rope.h

2169

{ replace(__p.index(), __i, __n); }

headers/cpp/stl_rope.h

2170

void replace(const iterator& __p, const _CharT* __i, const _CharT* __j)

headers/cpp/stl_rope.h

2171

{ replace(__p.index(), __i, __j); }

headers/cpp/stl_rope.h

2172

void replace(const iterator& __p, const_iterator __i,

headers/cpp/stl_rope.h

2174

{ replace(__p.index(), __i, __j); }

headers/cpp/stl_rope.h

2175

void replace(const iterator& __p, iterator __i, iterator __j)

headers/cpp/stl_rope.h

2176

{ replace(__p.index(), __i, __j); }

headers/os/interface/ListView.h

161

struct Replace { int32 index; BListItem *item; } replace;

headers/private/kernel/util/VectorSet.h

128

_VECTOR_SET_CLASS_NAME::Insert(const Value &value, bool replace)

headers/private/kernel/util/VectorSet.h

133

if (replace)

headers/private/kernel/util/VectorSet.h

54

status_t Insert(const Value &value, bool replace = true);

headers/private/storage/ResourcesContainer.h

49

bool replace = true);

src/apps/cortex/ParameterView/ParameterWindow.cpp

177

bool replace = false;

src/apps/cortex/ParameterView/ParameterWindow.cpp

178

if ((message->FindBool("replace", &replace) == B_OK)

src/apps/cortex/ParameterView/ParameterWindow.cpp

179

&& (replace == true)) {

src/apps/cortex/addons/common/AudioFilterNode.cpp

1329

op->replace(m_op);

src/apps/cortex/addons/common/IAudioOp.h

104

virtual void replace(

src/apps/mail/Content.cpp

1375

fInputMethodUndoState.replace = true;

src/apps/mail/Content.cpp

2666

fInputMethodUndoState.replace = false;

src/apps/mail/Content.cpp

2731

if (fInputMethodUndoState.replace) {

src/apps/mail/Content.cpp

2733

fInputMethodUndoState.replace = false;

src/apps/mail/Content.cpp

840

fInputMethodUndoState.replace = false;

src/apps/mail/Content.h

196

struct { bool active, replace; } fInputMethodUndoState;

src/apps/stylededit/StyledEditWindow.cpp

1082

StyledEditWindow::SearchAllWindows(BString find, BString replace,

src/apps/stylededit/StyledEditWindow.cpp

1091

message->AddString("ReplaceText", replace);

src/apps/stylededit/StyledEditWindow.h

49

void SearchAllWindows(BString find, BString replace,

src/apps/stylededit/StyledEditWindow.h

69

void _ReplaceAll(BString find, BString replace,

src/bin/unchop.c

27

void replace (char *, char *);

src/bin/unchop.c

73

replace(origfile, tmpfile);

src/bin/unzip/extract.c

1218

switch (G.lpUserFunctions->replace != NULL ?

src/bin/unzip/extract.c

1219

(*G.lpUserFunctions->replace)(G.filename) :

src/kits/interface/ListView.cpp

1447

data.replace.index = index;

src/kits/interface/ListView.cpp

1448

data.replace.item = item;

src/kits/interface/ListView.cpp

1575

return _ReplaceItem(data->replace.index, data->replace.item);

src/kits/storage/ResourcesContainer.cpp

37

bool replace)

src/kits/storage/ResourcesContainer.cpp

42

if (replace)

src/system/kernel/util/AVLTreeBase.cpp

544

AVLTreeNode* replace = NULL;

src/system/kernel/util/AVLTreeBase.cpp

548

result = _RemoveRightMostChild(&node->left, &replace);

src/system/kernel/util/AVLTreeBase.cpp

549

replace->parent = parent;

src/system/kernel/util/AVLTreeBase.cpp

550

replace->left = node->left;

src/system/kernel/util/AVLTreeBase.cpp

551

replace->right = node->right;

src/system/kernel/util/AVLTreeBase.cpp

553

node->left->parent = replace;

src/system/kernel/util/AVLTreeBase.cpp

554

node->right->parent = replace;

src/system/kernel/util/AVLTreeBase.cpp

555

replace->balance_factor = node->balance_factor;

src/system/kernel/util/AVLTreeBase.cpp

556

*nodeP = replace;

src/system/kernel/util/AVLTreeBase.cpp

559

replace->balance_factor++;

src/system/kernel/util/AVLTreeBase.cpp

564

replace = node->left;

src/system/kernel/util/AVLTreeBase.cpp

565

replace->parent = parent;

src/system/kernel/util/AVLTreeBase.cpp

566

replace->balance_factor = node->balance_factor + 1;

src/system/kernel/util/AVLTreeBase.cpp

567

*nodeP = replace;

src/system/kernel/util/AVLTreeBase.cpp

570

replace = node->right;

src/system/kernel/util/AVLTreeBase.cpp

571

replace->parent = node->parent;

src/system/kernel/util/AVLTreeBase.cpp

572

replace->balance_factor = node->balance_factor - 1;

src/system/kernel/util/AVLTreeBase.cpp

573

*nodeP = replace;

src/tests/system/kernel/util/VectorSetTest.cpp

157

void Insert(const Value& value, bool replace = true)

src/tests/system/kernel/util/VectorSetTest.cpp

159

CPPUNIT_ASSERT(fMySet.Insert(value, replace) == B_OK);