infix

vt. 把…印入；把…插进

n. [计] 中缀；插入词

vt.

使…钻进，让…插进；

n.

插入词，中缀；

英英释义

infix[ in'fiks, 'in-, 'infiks ]

n.an affix that is inserted inside the word

v.

put or introduce into something

同义词：insertenterintroduce

attach a morpheme into a stem word

权威例句

1. Read the infix expression from left to right, one character at a time.

从左到右读入中缀表达式，每次一个字符。

2. It can create indexes of word prefixes of arbitrary length and indexes of infix substrings of varying lengths.

它可以创建任意长度的单词前缀索引和可变长度的中缀子字符串的索引。

3. To convert an expression in an infix expression to its equivalent in postfix notation, we must know the precedence and associativity of operators.

要把表达式从中缀表达式的形式转换成用后缀表示法表示的等价表达式，必须了解操作符的优先级和结合性。

4. Infix notation is a common way of writing expressions, while prefix and postfix notations are primarily used in computer science.

中缀表示法是书写表达式的常见方式，而前缀和后缀表示法主要用于计算机科学领域。

5. The three most common forms of notation in arithmetic expressions are infix, prefix, and postfix notations.

算术表达式中最常见的表示法形式有中缀、前缀和后缀表示法。

6. Infix notation is the conventional notation for arithmetic expressions.

中缀表示法是算术表达式的常规表示法。

7. The infix index would match substrings anywhere within the string.

中缀索引将匹配在字符串内任意位置的子字符串。

8. The operands are in the same order that they would be in the equivalent infix expression.

操作数的顺序与等价的中缀表达式中操作数的顺序一致

9. Expressions use the same infix operators.

表达式使用同样的中缀运算符。

10. When parsing expressions written in infix notation, you need parentheses and precedence rules to remove ambiguity.

对以中缀表示法书写的表达式进行语法分析时，需要用括号和优先规则排除多义性。

11. Evaluating a postfix expression is simpler than directly evaluating an infix expression.

对后缀表达式求值比直接对中缀表达式求值简单。

12. The FileInput node considers each occurrence of the delimiter in the input file as either separating (infix) or terminating (postfix) each record.

FileInput节点将输入文件中出现的每个分隔符视为分离（中缀）或终止（后缀）每个记录。

13. Converting infix expression to a postfix expression

中缀表达式到后缀表达式的转换

14. The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm

转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号

15. Alternatively, a delimiter type of Infix can be specified.

或者，可以指定Infix（中缀）类型的分隔符。

16. Note that the use of Infix as the delimiter type means that there is no comma added after the last record is written, so the delimiter is only inserted between any two adjacent records.

请注意，使用Infix作为分隔符类型意味着，写入的最后一个记录后面没有添加逗号，因此分隔符仅插入任何两个相邻记录之间。

17. Because the value of the Delimiter type property is Infix, there does not need to be a comma at the end of the file.

由于Delimitertype属性的值为Infix，因此文件结尾不需要逗号。

18. any method may be used as an infix or postfix operator, and

任何方式可以被用作中缀（infix）或后缀（postfix）操作符

19. Requirements of the post-conversion infix expression in brackets should not be unnecessary.

要求转换后的中缀表达式中不应出现不必要的括号。

20. Converting infix notation to postfix notation

中缀表达式到后缀表达式的转换

21. This is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.

和中缀转换后缀的算法相反，那是把操作符存储在栈里。

22. The child order is set to "Infix", since the comma appears in between the fields in each record.

儿童顺序设置为“缀”，因为逗号之间的领域出现在每个记录。

23. This note gives a survey of the algorithms which recreate infix forms of general arithmetic expressions from their corresponding reverse Polish forms.

本文综述了从算术表达式的逆波蓝形式重建为通常算术表达式中缀形式之算法。

24. Subtypes: prefix, suffix, and infix.

前缀，后缀，中缀。

25. Subtypes: prefix, suffix, and infix.

前缀，后缀，中缀。