当然，正则表达式被限定为严格的字符串比较。
Of course, regular expressions are limited to strict string comparisons.
PHP和宽松的字符串比较失败吗？
指示字符串比较必须使用字符串排序算法。
Indicates that the string comparison must use the string sort algorithm.
经过实验，我还发现循环字符串比较操作速度都非常快。
Experimentally, I also found that a looping string comparison is faster than taking a slice.
浮为字符串比较！我可以吗？它是有效的方法？
如果设置了此选项，字符串比较会忽略假名类型。
If this option is set, the string comparison ignores kana type.
浮为字符串比较！
正如您看到的，使用强类型资源类访问资源文件中的字符串比较简单。
As you can see, accessing strings from a resource file using a strongly typed resource class is pretty easy.
这可以确保在查询中使用日期比较，而不是标准的字符串比较。
This ensures that the date comparison is used in the query, rather than standard string comparison.
如果有匹配的哈希值，就可以通过字符串比较进行匹配验证。
If a hash in the array matches the new hash, the strings can be compared to verify the match.
清单15、清单16和清单17分别演示如何使用文件、数字和字符串比较。
Listing 15, Listing 16, and Listing 17 display how you can use numeric, string, and file comparisons, respectively.
换句话说，在不区分大小写的数据库中，字符串比较的开销可能会略微增加。
In other words, string comparisons may be slightly more expensive in a case-insensitive database.
这使您能够对这些字符串进行对象比较，而不是开销更大的字符串比较。
This enables you to do object comparisons on these strings rather than a more expensive string comparison.
在查询运行时，尝试在雇员ID上执行字符串比较将遭到失败，并产生一个类型错误。
Any attempt to perform a string comparison on an employee ID will then fail with a type error at query run time.
此警告意味着在应当使用字符串比较函数的位置使用了字符串复制函数。
This warning indicates that a string copy function was used where a string comparison function should have been used.
所以在使用了命名空间的文档中，您几乎总是需要进行两次字符串比较，如清单3所示。
So in namespaced documents, you almost always need to perform two string comparisons, as shown in Listing 3.
要想创建对于所有字符串比较不区分大小写的数据库，需要使用排序规则UCA500R1，见清单4。
To create a database that is case-insensitive for all string comparisons, it is necessary to use the collation UCA500R1 as shown in Listing 4.
请记住，即便是复数与复数之间也不能进行比较，而Unicode对象只在与某些字符串比较时会出问题。
Keeping in mind that complex Numbers are incomparable even to each other, while Unicode objects only have problems comparing to some strings, we can use.
在UnixWare编译器的某一个版本中，对strcmp的引用被自动转换为Intel处理器自己的字符串比较指令。
On one version of the UnixWare compiler, references to STRCMP were translated automatically into an Intel processor's native string compare instruction.
无论如何为名称表加载名称，一旦名称存储在表中，便可以使用对象比较（而不是字符串比较）来快速比较名称。
Regardless of how the name table is loaded with names, once the names are stored in the table, names can be compared quickly using object comparison instead of string comparison.
强烈推荐对所有字符串比较使用“显式设置大小写的”运算对象，因为这样可以确保无论用户选项设置如何变化，脚本都可以可靠地执行。
Using the "explicitly cased" operators for all string comparisons is strongly recommended, because they ensure that scripts behave reliably regardless of variations in the user's option Settings.
in _ word_set：该例程使用hash确定某个字符串是否属于用户提供的列表，大多数情况下只使用一个字符串比较。
In_word_set: This routine USES hash to determine whether a particular string belongs to the user-supplied list, using one string comparison in the most common case.
perfectproperty：查找时间复杂度为o(1)的表条目—就是说，至多需要一个字符串比较执行静态搜索集中的关键字识别。
Perfect property: Locating a table entry requires o (1) time-that is, at most, one string comparison is required to perform keyword recognition within the static search set.
在这里，检索请求对象而获得协议信息(通过EL的pagecontext隐式对象)，并用简单的字符串比较对协议信息进行测试。
Here, protocol information is retrieved from the request object (by means of the EL's pageContext implicit object) and tested using a simple string comparison.
强度属性决定在对文本字符串进行排序或比较时，是否考虑重音或大小写。
The strength attribute determines whether accent or case is taken into account when collating or comparing text strings.
第二个属性s2指定强度级别，这决定在字符串排序或比较时是否考虑大小写或重音符号。
The second attribute S2 specifies the strength level which determines whether case or accent is taken into account when ordering or comparing strings.
使用该方法验证的关键在于将更新过的索引和初始输入字符串的长度进行比较。
The key to using the method for validation is to compare the updated index to the length of the original input string.
对字符串数据进行比较并按一定顺序排列的过程称为排序。
The process of comparing string data and placing it in order is known as collation.
算法很简单，它对树的顶级项目进行迭代，并将其文本内容与搜索字符串进行比较(清单6中的第43- 52行)。
The algorithm is simple; it iterates through the top-level items of the tree and compares their text contents with the search string (lines 43 to 52 in listing 6).
甚至还可以超出字符串本身的边界，比较与外部条件的一致性，如库存目录或当前公司股票价格。
They can even go outside the bounds of the string itself to compare its consistency with external conditions, such as the inventory of a warehouse or the current stock price of a company.
应用推荐