Home
last modified time | relevance | path

Searched refs:to_find (Results 1 – 25 of 221) sorted by relevance

123456789

/dports/java/java-subversion/subversion-1.14.1/tools/client-side/svn-mergeinfo-normalizer/
H A Dlog.c681 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletion() local
691 while (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletion()
710 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletion()
726 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletions() local
731 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletions()
747 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletions()
782 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in next_copy() local
805 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in next_copy()
808 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in next_copy()
855 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__get_copies() local
[all …]
/dports/devel/py-subversion/subversion-1.14.1/tools/client-side/svn-mergeinfo-normalizer/
H A Dlog.c681 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletion() local
691 while (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletion()
710 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletion()
726 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletions() local
731 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletions()
747 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletions()
782 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in next_copy() local
805 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in next_copy()
808 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in next_copy()
855 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__get_copies() local
[all …]
/dports/security/subversion-gnome-keyring/subversion-1.14.1/tools/client-side/svn-mergeinfo-normalizer/
H A Dlog.c681 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletion() local
691 while (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletion()
710 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletion()
726 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletions() local
731 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletions()
747 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletions()
782 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in next_copy() local
805 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in next_copy()
808 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in next_copy()
855 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__get_copies() local
[all …]
/dports/devel/p5-subversion/subversion-1.14.1/tools/client-side/svn-mergeinfo-normalizer/
H A Dlog.c681 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletion() local
691 while (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletion()
710 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletion()
726 deletion_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__find_deletions() local
731 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in svn_min__find_deletions()
747 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in svn_min__find_deletions()
782 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in next_copy() local
805 if (!svn_fspath__is_root(to_find->path, strlen(to_find->path))) in next_copy()
808 to_find->path = svn_fspath__dirname(to_find->path, scratch_pool); in next_copy()
855 svn_min__copy_t *to_find = apr_pcalloc(scratch_pool, sizeof(*to_find)); in svn_min__get_copies() local
[all …]
/dports/math/libmesh/libmesh-1.6.2/include/utils/
H A Dvectormap.h155 value_type to_find; variable
156 to_find.first = key;
178 value_type to_find; in find() local
179 to_find.first = key; in find()
181 iterator lb = std::lower_bound (this->begin(), this->end(), to_find, FirstOrder()); in find()
203 value_type to_find; in find() local
204 to_find.first = key; in find()
206 const_iterator lb = std::lower_bound (this->begin(), this->end(), to_find, FirstOrder()); in find()
228 value_type to_find; in count() local
229 to_find.first = key; in count()
[all …]
/dports/devel/aws-c-common/aws-c-common-0.6.15/tests/
H A Dbyte_cursor_find_test.c14 const char *to_find = "and we want"; in s_test_byte_cursor_find_str_fn() local
17 struct aws_byte_cursor to_find_cur = aws_byte_cursor_from_c_str(to_find); in s_test_byte_cursor_find_str_fn()
37 const char *to_find = "and we went"; in AWS_TEST_CASE() local
40 struct aws_byte_cursor to_find_cur = aws_byte_cursor_from_c_str(to_find); in AWS_TEST_CASE()
58 const char *to_find = "and we want"; in AWS_TEST_CASE() local
61 struct aws_byte_cursor to_find_cur = aws_byte_cursor_from_c_str(to_find); in AWS_TEST_CASE()
/dports/databases/percona57-server/percona-server-5.7.36-39/rapid/plugin/x/mysqlxtest_src/common/
H A Dutils_string_parsing.cc32 void replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/rapid/plugin/x/mysqlxtest_src/common/
H A Dutils_string_parsing.cc32 void replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/rapid/plugin/x/mysqlxtest_src/common/
H A Dutils_string_parsing.cc32 void replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/rapid/plugin/x/mysqlxtest_src/common/
H A Dutils_string_parsing.cc32 void replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/databases/percona57-client/percona-server-5.7.36-39/rapid/plugin/x/mysqlxtest_src/common/
H A Dutils_string_parsing.cc32 void replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/databases/mysql57-client/mysql-5.7.36/rapid/plugin/x/mysqlxtest_src/common/
H A Dutils_string_parsing.cc32 void replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/plugin/x/tests/driver/common/
H A Dutils_string_parsing.cc31 int replace_all(std::string &input, const std::string &to_find, in replace_all() argument
34 if (to_find.empty()) return 0; in replace_all()
36 size_t position = input.find(to_find); in replace_all()
39 input.replace(position, to_find.size(), change_to); in replace_all()
40 position = input.find(to_find, position + change_to.size()); in replace_all()
/dports/textproc/aspell-ispell/aspell-0.60.8/common/
H A Dhash.hpp130 std::pair<iterator, iterator> equal_range_i(const Key & to_find, int & c);
153 iterator find(const key_type & to_find) { in find() argument
155 iterator i = find_i(to_find,h); in find()
158 bool have(const key_type & to_find) const { in have()
160 const_cast<HashTable *>(this)->find_i(to_find,h); in have()
163 const_iterator find(const key_type & to_find) const { in find()
164 return const_cast<HashTable *>(this)->find(to_find); in find()
167 std::pair<iterator,iterator> equal_range(const key_type & to_find) in equal_range() argument
170 return equal_range_i(to_find, irrelevant); in equal_range()
174 equal_range(const key_type & to_find) const in equal_range()
[all …]
H A Dhash-t.hpp137 typename HashTable<P>::iterator HashTable<P>::find_i(const Key & to_find, bool & have) in find_i() argument
139 Size pos = parms_.hash(to_find) % table_size_; in find_i()
145 } else if (parms_.equal(parms_.key((*n)->data),to_find)) { in find_i()
156 HashTable<P>::equal_range_i(const Key & to_find, int & c) in equal_range_i() argument
160 iterator first = find_i(to_find,have); in equal_range_i()
167 while (!(last == e) && parms_.equal(parms_.key(*last), to_find)) { in equal_range_i()
/dports/textproc/aspell/aspell-0.60.8/common/
H A Dhash.hpp130 std::pair<iterator, iterator> equal_range_i(const Key & to_find, int & c);
153 iterator find(const key_type & to_find) { in find() argument
155 iterator i = find_i(to_find,h); in find()
158 bool have(const key_type & to_find) const { in have()
160 const_cast<HashTable *>(this)->find_i(to_find,h); in have()
163 const_iterator find(const key_type & to_find) const { in find()
164 return const_cast<HashTable *>(this)->find(to_find); in find()
167 std::pair<iterator,iterator> equal_range(const key_type & to_find) in equal_range() argument
170 return equal_range_i(to_find, irrelevant); in equal_range()
174 equal_range(const key_type & to_find) const in equal_range()
[all …]
H A Dhash-t.hpp137 typename HashTable<P>::iterator HashTable<P>::find_i(const Key & to_find, bool & have) in find_i() argument
139 Size pos = parms_.hash(to_find) % table_size_; in find_i()
145 } else if (parms_.equal(parms_.key((*n)->data),to_find)) { in find_i()
156 HashTable<P>::equal_range_i(const Key & to_find, int & c) in equal_range_i() argument
160 iterator first = find_i(to_find,have); in equal_range_i()
167 while (!(last == e) && parms_.equal(parms_.key(*last), to_find)) { in equal_range_i()
/dports/x11-toolkits/xmhtml/XmHTML-1.1.10/lib/gtk/
H A Dtextsel.c587 free(finder->to_find); in XmHTMLTextFinderDestroy()
617 if(to_find == NULL) in XmHTMLTextFinderSetPattern()
627 free(finder->to_find); in XmHTMLTextFinderSetPattern()
629 finder->to_find = NULL; in XmHTMLTextFinderSetPattern()
641 finder->to_find = strdup(to_find); in XmHTMLTextFinderSetPattern()
685 String to_find = strdup(finder->to_find); in XmHTMLTextFinderSetPatternFlags() local
703 free(finder->to_find); in XmHTMLTextFinderSetPatternFlags()
704 finder->to_find = NULL; in XmHTMLTextFinderSetPatternFlags()
742 free(to_find); in XmHTMLTextFinderSetPatternFlags()
854 free(finder->to_find); in XmHTMLTextFinderReset()
[all …]
/dports/x11-toolkits/xmhtml/XmHTML-1.1.10/lib/Motif/
H A Dtextsel.c587 free(finder->to_find); in XmHTMLTextFinderDestroy()
617 if(to_find == NULL) in XmHTMLTextFinderSetPattern()
627 free(finder->to_find); in XmHTMLTextFinderSetPattern()
629 finder->to_find = NULL; in XmHTMLTextFinderSetPattern()
641 finder->to_find = strdup(to_find); in XmHTMLTextFinderSetPattern()
685 String to_find = strdup(finder->to_find); in XmHTMLTextFinderSetPatternFlags() local
703 free(finder->to_find); in XmHTMLTextFinderSetPatternFlags()
704 finder->to_find = NULL; in XmHTMLTextFinderSetPatternFlags()
742 free(to_find); in XmHTMLTextFinderSetPatternFlags()
854 free(finder->to_find); in XmHTMLTextFinderReset()
[all …]
/dports/science/afni/afni-AFNI_21.3.16/src/XmHTML/lib/Motif/
H A Dtextsel.c593 free(finder->to_find); in XmHTMLTextFinderDestroy()
623 if(to_find == NULL) in XmHTMLTextFinderSetPattern()
633 free(finder->to_find); in XmHTMLTextFinderSetPattern()
635 finder->to_find = NULL; in XmHTMLTextFinderSetPattern()
647 finder->to_find = strdup(to_find); in XmHTMLTextFinderSetPattern()
691 String to_find = strdup(finder->to_find); in XmHTMLTextFinderSetPatternFlags() local
709 free(finder->to_find); in XmHTMLTextFinderSetPatternFlags()
710 finder->to_find = NULL; in XmHTMLTextFinderSetPatternFlags()
748 free(to_find); in XmHTMLTextFinderSetPatternFlags()
860 free(finder->to_find); in XmHTMLTextFinderReset()
[all …]
/dports/deskutils/flameshot/flameshot-0.10.2/src/utils/
H A Dstrfparse.cpp30 std::string const& to_find, in replace_all() argument
34 while ((pos = input.find(to_find, pos)) != std::string::npos) { in replace_all()
35 input.replace(pos, to_find.length(), to_replace); in replace_all()
103 auto to_find = delim + row.first; in format_time_string() local
104 output_string = replace_all(output_string, to_find, row.second); in format_time_string()
/dports/print/qpdf/qpdf-10.5.0/
H A Dcopy_dlls47 my @to_find = get_dlls($file);
52 while (@to_find)
54 my $dll = shift(@to_find);
63 push(@to_find, get_dlls("$dir/$dll"));
/dports/graphics/gnash/gnash-2b3bdede0305c4fc3ad21a0a4197330606c9b880/libbase/
H A Dstring_table.h95 key find(const std::string& to_find, bool insert_unfound = true);
102 const std::string& value(key to_find) const in value() argument
104 if (_table.empty() || !to_find) return _empty; in value()
107 _table.get<StringID>().find(to_find); in value()
/dports/x11/wapanel/wapanel-1.1.0/src/applets/app-finder/search-engine/
H A Dsearch_engine.cc55 const char *to_find = text.c_str(); in search_directory() local
86 if (fnmatch(to_find, filename.c_str(), 0) == 0) { found_files.push_back(entry); } in search_directory()
159 std::string to_find = "*" + text + "*"; in search() local
162 search_directory(to_find, app_dir, false); in search()
165 std::cout << "searching " << to_find << std::endl; in search()
/dports/editors/elementary-code/code-6.0.0/plugins/word-completion/
H A Dcompletion-provider.vala125 string to_find = "";
133 to_find = temp_buffer.get_text (start, end, true);
135 if (to_find.length == 0) {
144 to_find += c.to_string ();
151 to_find = to_find.reverse ();
159 if (no_minimum || to_find.length >= Euclide.Completion.Parser.MINIMUM_WORD_LENGTH) {
162 if (parser.get_for_word (to_find, out prop_word_list)) {

123456789