Searched refs:solution (Results 1 – 21 of 21) sorted by relevance
| /glibc-2.36/iconv/ |
| D | gconv_db.c | 431 struct derivation_step *first, *current, **lastp, *solution = NULL; in find_derivation() local
537 for (step = solution; step != NULL; step = step->next) in find_derivation()
546 step->next = solution; in find_derivation()
547 solution = step; in find_derivation()
621 for (step = solution; step != NULL; in find_derivation()
653 if (solution != NULL) in find_derivation()
660 if (solution->next != NULL) in find_derivation()
662 struct derivation_step *solution2 = solution->next; in find_derivation()
664 if (solution2->cost_hi < solution->cost_hi in find_derivation()
665 || (solution2->cost_hi == solution->cost_hi in find_derivation()
[all …]
|
| /glibc-2.36/manual/ |
| D | charset.texi | 308 The most widely useful solution seems to be: go with the most general
716 correct size before returning it, but a better solution might be to
948 this solution is unsuitable, there is a very slow but more accurate
949 solution.
1070 piece of a running text is not always an adequate solution and,
1837 desirable solution; therefore, future versions will provide better ones,
1880 The example below features a solution for a common problem. Given that
2028 This solution is problematic as it requires a great deal of effort to
2039 This solution provides much more flexibility. The C library itself
2043 of available conversion modules. A drawback of this solution is that
[all …]
|
| D | message.texi | 12 certainly not a good solution since extending the set of languages is
16 A better solution is to keep the message sets for each language
1270 to be written in English, this solution nevertheless fulfills its
1326 Therefore the solution implemented is to allow the translator to specify
1328 with every language this is the only viable solution except for
1631 One solution to this problem is to artificially extend the strings
1923 come a solution for this some day). This means for the user that s/he
|
| D | ctype.texi | 682 In fact, usually this fails miserably. The correct solution to this
|
| D | maint.texi | 146 The general solution for providing low-level features is to export them as
|
| D | nss.texi | 15 @Theglibc{} contains a cleaner solution to this problem. It is
|
| D | search.texi | 377 the program. A solution is to use the following functions which are a
|
| D | llio.texi | 2046 A better solution is to use the @code{select} function. This blocks the
2809 meant for the same file, all for different files or every solution in
3065 some situations this is not the ideal solution. In a program which
3067 always the best solution to go round robin since some connections might
3069 caller might also be not the best solution since whenever the process
|
| D | socket.texi | 147 The Unix98 specification provides a solution by introducing a type
3207 it if desired. A more automatic solution could be to use
|
| D | time.texi | 2372 solution to this.
|
| D | string.texi | 1823 the work already done in the @code{strlen} function. A better solution
|
| D | arith.texi | 2504 solution. It still can be used in the same way but requires a most
|
| D | filesys.texi | 2707 user. One possible solution is to set the setuid-bit of the program
|
| D | texinfo.tex | 9864 % The only solution would be perhaps to write out @U{...} sequences in
|
| /glibc-2.36/posix/ |
| D | tst-fnmatch.input | 52 # > resolve the differences, but no solution has been found that would
|
| /glibc-2.36/po/ |
| D | fr.po | 6401 msgstr "Échec temporaire dans la résolution du nom"
6409 msgstr "Échec non récupérable lors de la résolution du nom"
|
| /glibc-2.36/ChangeLog.old/ |
| D | ChangeLog.7 | 53 backup solution.
1043 This is to work around a limitation in `ld' while no better solution
2314 different solution for the problem.
|
| D | ChangeLog.6 | 7632 Correct solution of multiple initialization problem by
|
| D | ChangeLog.5 | 5949 solution for formaer patches.
|
| D | ChangeLog.nptl | 5137 * sysdeps/pthread/unwind-forcedunwind.c: Different solution for
|
| D | ChangeLog.11 | 3208 solution.
|