Hence, if text matched the entire pattern, the first set of parentheses would yield a string representing a positive or negative integer, such as + 49.
因此，如果文本匹配了整个模式，第一组括号将生成表示一个正整数或负整数的的字符串，例如+ 49。
Set D as non square factor positive integer.
设D是无平方因子正整数。
In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
应用推荐