Searched +refs:compare +refs:windows +refs:highlight (Results 1 - 2 of 2) sorted by relevance

/macosx-10.10/tcl-105/tcl_ext/tkcon/tkcon/
H A Dtkcon.tcl249 windows {
594 # title - title for the console root and main (.) windows
844 if {[$con compare 1.0 == end-1c]} {
1629 if {$tcl_platform(platform) == "windows"} {
2542 -message "Close all windows and exit tkcon?" \
2739 ## ::tkcon::StateCompare - compare two states and output difference
2752 set w $PRIV(base).compare
2974 # Remove all highlight classes from a widget
2980 $w highlight 1.0 end
3032 [string compare {} [se
[all...]
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dtommath.tex1245 particular with the pointer aliases to highlight code phases. For example, a Comba multiplier (discussed in chapter six)
1499 Comparing a multiple precision integer is performed with the exact same algorithm used to compare two decimal numbers. For example,
1500 to compare $1,234$ to $1,264$ the digits are extracted by their positions. That is we compare $1 \cdot 10^3 + 2 \cdot 10^2 + 3 \cdot 10^1 + 4 \cdot 10^0$
1504 The first comparision routine that will be developed is the unsigned magnitude compare which will perform a comparison based on the digits of two
1544 \textbf{MP\_GT} and similar with respect to when $a = b$ and $a < b$. The first two steps compare the number of digits used in both $a$ and $b$.
1558 The two if statements (lines 25 and 29) compare the number of digits in the two inputs. These two are
1589 The first two steps compare the signs of the two inputs. If the signs do not agree then it can return right away with the appropriate
1592 $\vert a \vert < \vert b \vert$. Step number four will compare the two when they are both positive.
1610 $\left [ 3 \right ]$ & Give the probability that algorithm mp\_cmp\_mag will have to compare
[all...]

Completed in 131 milliseconds