| /haiku/src/libs/mapm/ |
| H A D | mapmrsin.c | 65 M_APM sum, term, tmp2, tmp7, tmp8; local
70 term = M_get_stack_var();
76 m_apm_copy(term, xx);
88 m_apm_multiply(tmp8, term, tmp2);
93 local_precision = dplaces + term->m_apm_exponent;
101 m_apm_divide(term, local_precision, tmp8, tmp7);
105 m_apm_subtract(tmp7, sum, term);
110 m_apm_add(tmp7, sum, term);
129 M_APM sum, term, tmp7, tmp8, tmp9; local
134 term
[all...] |
| H A D | mapm_lg4.c | 55 M_APM tmp0, tmp1, tmp2, tmpS, term; local
63 term = M_get_stack_var();
71 m_apm_copy(term, tmpS);
79 m_apm_multiply(tmp0, term, tmp2);
90 m_apm_round(term, local_precision, tmp0);
91 m_apm_divide(tmp0, local_precision, term, tmp1);
|
| H A D | mapmasn0.c | 110 M_APM tmp0, tmp2, tmpR, tmpS, digit, term; local
118 term = M_get_stack_var();
124 m_apm_copy(term, aa);
134 * do the subtraction term
137 m_apm_multiply(tmp0, term, tmp2);
152 m_apm_round(term, local_precision, tmp0);
153 m_apm_divide(tmp0, local_precision, term, digit);
157 * do the addition term
160 m_apm_multiply(tmp0, term, tmp2);
175 m_apm_round(term, local_precisio
[all...] |
| H A D | mapm_exp.c | 366 M_APM tmp0, digit, term; local
371 term = M_get_stack_var();
379 m_apm_copy(term, xx);
386 m_apm_multiply(tmp0, term, xx);
387 m_apm_divide(term, local_precision, tmp0, digit);
388 m_apm_add(tmp0, rr, term);
391 if ((term->m_apm_exponent < tolerance) || (term->m_apm_sign == 0))
396 local_precision = local_precision + term->m_apm_exponent - prev_exp;
402 prev_exp = term
[all...] |
| /haiku/src/libs/bsd/ |
| H A D | readpassphrase.c | 48 struct termios term, oterm; local
96 memcpy(&term, &oterm, sizeof(term));
98 term.c_lflag &= ~(ECHO | ECHONL);
100 if (term.c_cc[VSTATUS] != _POSIX_VDISABLE)
101 term.c_cc[VSTATUS] = _POSIX_VDISABLE;
103 (void)tcsetattr(input, TCSAFLUSH|TCSASOFT, &term);
105 memset(&term, 0, sizeof(term));
106 term
[all...] |
| /haiku/src/preferences/keymap/ |
| H A D | KeyboardLayout.cpp | 205 // The first term within a row is the position of the row, written as
656 /*! Returns the term delimiter expected in a certain parse mode. */
677 BString& term, bool closingBracketAllowed)
679 // Get term
680 term = "";
684 term += data[0];
691 _Trim(term, true);
697 KeyboardLayout::_SubstituteVariables(BString& term, VariableMap& variables, argument
701 int32 index = term.FindFirst('$');
713 if (!term
676 _GetTerm(const char*& data, const char* delimiter, BString& term, bool closingBracketAllowed) argument
740 _ParseTerm(const parse_state& state, const char*& data, BString& term, VariableMap& variables) argument
802 BString term; local
829 BString term; local
[all...] |
| H A D | KeyboardLayout.h | 99 BString& term, bool closingBracketAllowed);
100 bool _SubstituteVariables(BString& term,
103 const char*& data, BString& term,
|
| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | Query.cpp | 634 Term* term = this; local
640 while (term != NULL && status == MATCH_OK) {
641 Operator* parent = (Operator*)term->Parent();
648 if (other == term)
662 term = (Term*)parent;
925 // choose the term with the better score for OP_OR
1006 Term* term = new(std::nothrow) Term(equation);
1007 if (term == NULL)
1010 return term;
1023 Term* term
[all...] |
| /haiku/src/bin/multiuser/ |
| H A D | multiuser_utils.cpp | 178 const char* term = getenv("TERM"); local
185 if (term != NULL)
186 setenv("TERM", term, false);
|
| /haiku/src/apps/haikudepot/model/ |
| H A D | Model.cpp | 128 BString term; local
129 searchTerms.CopyInto(term, index, nextSpace - index);
130 term.ToLower();
131 fSearchTerms.Add(term);
141 // Every search term must be found in one of the package texts
143 const BString& term = fSearchTerms.StringAt(i); local
144 if (!_TextContains(package->Name(), term)
145 && !_TextContains(package->Title(), term)
146 && !_TextContains(package->Publisher().Name(), term)
147 && !_TextContains(package->ShortDescription(), term)
159 const BString& term = fSearchTerms.StringAt(i); local
[all...] |
| /haiku/headers/private/file_systems/ |
| H A D | QueryParser.h | 926 Term<QueryPolicy>* term = this;
932 while (term != NULL && status == MATCH_OK) {
934 = (Operator<QueryPolicy>*)term->Parent();
941 if (other == term)
955 term = (Term<QueryPolicy>*)parent;
1026 // choose the term with the better score for OP_OR
1209 Term<QueryPolicy>* term = ParseOr(expr);
1214 delete term;
1218 // If the term is negated, we just complement the tree, to get
1221 term
[all...] |
| /haiku/src/add-ons/index_server/fulltext/ |
| H A D | CLuceneDataBase.cpp | 231 Term term(_T("path"), wPath);
232 reader->deleteDocuments(&term);
|
| /haiku/src/bin/pc/ |
| H A D | pc.c | 133 ULONG term(char **str); /* multiplication/division *,%,/ */
681 sum = term(str);
690 val = term(str);
705 term(char **str) function
|
| /haiku/docs/interface_guidelines/docbook-css/ |
| H A D | core.css | 48 subtitle, synopfragment, synopfragmentref, table, term, tertiaryie, tip,
|
| /haiku/src/apps/mail/ |
| H A D | MailWindow.cpp | 3239 BString* term = new BString("(("); local
3240 term->Append(attribute);
3241 term->Append("==\"*");
3242 term->Append(text);
3243 term->Append("*\")&&(BEOS:TYPE==\"text/x-email\"))");
3273 queryNode.WriteAttrString("_trk/qrystr", term);
|
| /haiku/src/bin/network/telnet/ |
| H A D | telnet.c | 53 #include <term.h>
|
| /haiku/src/bin/mail_utils/ |
| H A D | spamdbm.cpp | 1875 double term; local
1882 sum = term = exp (-m);
1885 term *= m / i;
1886 sum += term;
|