Searched refs:replace (Results 1 - 25 of 30) sorted by relevance

12

/haiku/docs/interface_guidelines/docbook-css/
H A Dopera.css32 -o-replace: attr(fileref)
/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp509 // the found node might have a left child: replace the node with the
544 AVLTreeNode* replace = NULL; local
548 result = _RemoveRightMostChild(&node->left, &replace);
549 replace->parent = parent;
550 replace->left = node->left;
551 replace->right = node->right;
552 if (node->left) // check necessary, if node->left == replace
553 node->left->parent = replace;
554 node->right->parent = replace;
555 replace
[all...]
/haiku/src/bin/
H A Dunchop.c27 void replace (char *, char *);
73 replace(origfile, tmpfile);
154 replace(char *origfile, char *newfile) function
156 // replace the contents of the original file
/haiku/src/apps/cortex/addons/common/
H A DIAudioOp.h104 virtual void replace(
/haiku/headers/cpp/std/
H A Dbastring.h211 { return replace (length (), 0, _str, pos, n); }
213 { return replace (length (), 0, s, n); }
217 { return replace (length (), 0, n, c); }
224 { return replace (iend (), iend (), first, last); }
231 { return replace (0, npos, str, pos, n); }
233 { return replace (0, npos, s, n); }
237 { return replace (0, npos, n, c); }
244 { return replace (ibegin (), iend (), first, last); }
260 { return replace (pos1, 0, str, pos2, n); }
262 { return replace (po
300 basic_string& replace (size_type pos, size_type n1, const charT* s) function in class:basic_string
303 basic_string& replace (size_type pos, size_type n, charT c) function in class:basic_string
305 basic_string& replace (iterator i1, iterator i2, const basic_string& str) function in class:basic_string
307 basic_string& replace (iterator i1, iterator i2, const charT* s, size_type n) function in class:basic_string
309 basic_string& replace (iterator i1, iterator i2, const charT* s) function in class:basic_string
311 basic_string& replace (iterator i1, iterator i2, size_type n, charT c) function in class:basic_string
459 replace (iterator i1, iterator i2, InputIterator j1, InputIterator j2) function in class:basic_string
[all...]
H A Dbastring.cc118 replace (size_type pos1, size_type n1, function in class:basic_string
131 return replace (pos1, n1, _str.data () + pos2, n2);
153 replace (size_type pos, size_type n1, const charT* s, size_type n2) function in class:basic_string
189 replace (size_type pos, size_type n1, size_type n2, charT c) function in class:basic_string
/haiku/src/apps/cortex/addons/audioOps/
H A DNullAudioOp.cpp63 void replace( function in class:_NullAudioOp
H A DAudioAdapterOp.cpp76 void replace( function in class:_AudioAdapterOp_base
/haiku/headers/private/storage/
H A DResourcesContainer.h49 bool replace = true);
/haiku/headers/cpp/
H A Dstl_rope.h1952 static _RopeRep* replace(_RopeRep* __old, size_t __pos1, function in class:rope
1976 replace(_M_tree_ptr, __p, __p, __r._M_tree_ptr);
2029 // (position, length) versions of replace operations:
2031 void replace(size_t __p, size_t __n, const rope& __r) { function in class:rope
2033 replace(_M_tree_ptr, __p, __p + __n, __r._M_tree_ptr);
2038 void replace(size_t __p, size_t __n, function in class:rope
2041 replace(__p, __n, __r);
2044 void replace(size_t __p, size_t __n, _CharT __c) { function in class:rope
2046 replace(__p, __n, __r);
2049 void replace(size_ function in class:rope
2054 void replace(size_t __p, size_t __n, function in class:rope
2060 void replace(size_t __p, size_t __n, function in class:rope
2066 void replace(size_t __p, size_t __n, function in class:rope
2073 void replace(size_t __p, _CharT __c) { function in class:rope
2078 void replace(size_t __p, const rope& __r) { function in class:rope
2082 void replace(size_t __p, const _CharT* __i, size_t __i_len) { function in class:rope
2086 void replace(size_t __p, const _CharT* __c_string) { function in class:rope
2090 void replace(size_t __p, const _CharT* __i, const _CharT* __j) { function in class:rope
2094 void replace(size_t __p, const const_iterator& __i, function in class:rope
2099 void replace(size_t __p, const iterator& __i, function in class:rope
2140 void replace(const iterator& __p, const iterator& __q, function in class:rope
2143 void replace(const iterator& __p, const iterator& __q, _CharT __c) function in class:rope
2145 void replace(const iterator& __p, const iterator& __q, function in class:rope
2148 void replace(const iterator& __p, const iterator& __q, function in class:rope
2151 void replace(const iterator& __p, const iterator& __q, function in class:rope
2154 void replace(const iterator& __p, const iterator& __q, function in class:rope
2157 void replace(const iterator& __p, const iterator& __q, function in class:rope
2162 void replace(const iterator& __p, const rope& __r) function in class:rope
2164 void replace(const iterator& __p, _CharT __c) function in class:rope
2166 void replace(const iterator& __p, const _CharT* __c_string) function in class:rope
2168 void replace(const iterator& __p, const _CharT* __i, size_t __n) function in class:rope
2170 void replace(const iterator& __p, const _CharT* __i, const _CharT* __j) function in class:rope
2172 void replace(const iterator& __p, const_iterator __i, function in class:rope
2175 void replace(const iterator& __p, iterator __i, iterator __j) function in class:rope
[all...]
H A Dalgo.h48 using __STD::replace;
/haiku/src/tools/
H A Dhardlink_packages.py97 srcpkg = greatestVersion.replace("-" + arch + ".hpkg",
98 "-source.hpkg").replace('-', '_source-', 1)
126 repoInfoTemplate = repoInfoTemplate.replace("$ARCH$", arch)
/haiku/src/tools/checkstyle/
H A Dutils.py20 + "): '" + match.group().replace('\n','\\n') + "'")
80 file.write('<span class="linehead"> </span>' + line.replace('\r', ' ') \
/haiku/src/apps/stylededit/
H A DStyledEditWindow.h49 void SearchAllWindows(BString find, BString replace,
69 void _ReplaceAll(BString find, BString replace,
/haiku/src/kits/storage/
H A DResourcesContainer.cpp37 bool replace)
41 // replace an item with the same type and id
42 if (replace)
36 AddResource(ResourceItem *item, int32 index, bool replace) argument
/haiku/src/system/libroot/posix/glibc/include/
H A Dstdlib.h52 const char *combines, int replace);
/haiku/headers/private/kernel/util/
H A DVectorSet.h54 status_t Insert(const Value &value, bool replace = true);
114 operation will not fail, but return \c B_OK. \a replace specifies
116 Otherwise \a replace is ignored.
119 \param replace If the an element with this value does already exist and
120 \a replace is \c true, the element is replaced, otherwise left
128 _VECTOR_SET_CLASS_NAME::Insert(const Value &value, bool replace) argument
133 if (replace)
/haiku/src/apps/cortex/ParameterView/
H A DParameterWindow.cpp177 bool replace = false; local
178 if ((message->FindBool("replace", &replace) == B_OK)
179 && (replace == true)) {
268 message->AddBool("replace", true);
/haiku/src/apps/haikudepot/build/scripts/
H A Dustache.py457 .replace(b'&', b'&amp;')
458 .replace(b'<', b'&lt;')
459 .replace(b'>', b'&gt;')
460 .replace(b'"', b'&quot;')
461 .replace(b'\'', b'&#x60;')
462 .replace(b'`', b'&#x3D;')
/haiku/src/tests/kits/net/service/
H A Dtestserver.py126 # If that's the case, we'll replace it here in order to allow the test
174 header_value = header_value.replace(
188 body_bytes = body_bytes.replace(
/haiku/src/tests/kits/net/netservices2/
H A Dtestserver.py126 # If that's the case, we'll replace it here in order to allow the test
174 header_value = header_value.replace(
188 body_bytes = body_bytes.replace(
/haiku/src/apps/mail/
H A DContent.h196 struct { bool active, replace; } fInputMethodUndoState; member in struct:TTextView::__anon146
/haiku/headers/os/interface/
H A DListView.h161 struct Replace { int32 index; BListItem *item; } replace; member in union:BListView::MiscData
/haiku/src/kits/interface/
H A DListView.cpp1438 data.replace.index = index;
1439 data.replace.item = item;
1566 return _ReplaceItem(data->replace.index, data->replace.item);
2031 // replace item
/haiku/src/tests/system/kernel/util/
H A DVectorSetTest.cpp207 void Insert(const Value &value, bool replace = true)
209 CHK(fMySet.Insert(value, replace) == B_OK);

Completed in 461 milliseconds

12