Searched defs:one (Results 26 - 50 of 68) sorted by relevance

123

/openjdk7/jdk/test/com/sun/jdi/
H A DTwoThreadsTest.java47 static boolean one = false; field in class:TwoThreadsTarg
H A DInvokeHangTest.java47 static boolean one = false; field in class:InvokeHangTarg
H A DSimulResumerTest.java47 static boolean one = false; field in class:SimulResumerTarg
/openjdk7/jdk/test/java/io/Serializable/oldTests/
H A DCheckingEquality.java86 String one; field in class:Firstpsio
91 one = "one";
105 if (!one.equals(other.one)) {
106 System.err.println("\nfirstpsio: expected " + one +
107 " actual " + other.one);
139 if (one == null) {
/openjdk7/jdk/test/java/lang/Thread/
H A DGenerifyStackTraces.java41 private static Thread one; field in class:GenerifyStackTraces
48 one = new ThreadOne();
49 one.start();
134 StackTraceElement[] stack = one.getStackTrace();
135 checkStack(one, stack, depth);
146 if (t == one) {
H A DStackTraces.java41 private static Thread one; field in class:StackTraces
48 one = new ThreadOne();
49 one.start();
134 StackTraceElement[] stack = one.getStackTrace();
135 checkStack(one, stack, depth);
150 if (t == one) {
/openjdk7/jdk/src/share/native/java/lang/fdlibm/src/
H A De_acos.c58 one= 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable
95 q = one+z*(qS1+z*(qS2+z*(qS3+z*qS4)));
99 z = (one+x)*0.5;
101 q = one+z*(qS1+z*(qS2+z*(qS3+z*qS4)));
107 z = (one-x)*0.5;
113 q = one+z*(qS1+z*(qS2+z*(qS3+z*qS4)));
H A De_asin.c65 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable
100 if(huge+x>one) return x;/* return x with inexact if x!=0*/
104 q = one+t*(qS1+t*(qS2+t*(qS3+t*qS4)));
109 w = one-fabs(x);
112 q = one+t*(qS1+t*(qS2+t*(qS3+t*qS4)));
H A De_exp.c97 one = 1.0, variable
154 if(huge+x>one) return one+x;/* trigger inexact */
161 if(k==0) return one-((x*c)/(c-2.0)-x);
162 else y = one-((lo-(x*c)/(2.0-c))-hi);
H A De_jn.c62 one = 1.00000000000000000000e+00; /* 0x3FF00000, 0x00000000 */ variable
137 for (a=one,i=2;i<=n;i++) {
184 for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t);
186 b = one;
217 b = one;
243 if((ix|lx)==0) return -one/zero;
H A Ds_expm1.c90 * (A). To save one multiplication, we scale the coefficient Qi
129 one = 1.0, variable
171 return tiny-one; /* return -1 */
200 r1 = one+hxs*(Q1+hxs*(Q2+hxs*(Q3+hxs*(Q4+hxs*Q5))));
210 else return one+2.0*(x-e);
213 y = one-(e-x);
215 return y-one;
217 t = one;
225 y += one;
H A Dk_rem_pio2.c65 * precison, one may have to do something like:
172 one = 1.0, variable
246 z = one - z;
247 if(carry!=0) z -= scalbn(one,q0);
283 fw = scalbn(one,q0);
H A De_j0.c45 * to compute the worse one.)
86 one = 1.0, variable
113 if(ix>=0x7ff00000) return one/(x*x);
137 if(huge+x>one) { /* raise inexact if x != 0 */
138 if(ix<0x3e400000) return one; /* |x|<2**-27 */
139 else return one - 0.25*x*x;
144 s = one+z*(S01+z*(S02+z*(S03+z*S04)));
146 return one + z*(-0.25+(r/s));
149 return((one+u)*(one
[all...]
H A De_j1.c46 * to compute the worse one.)
86 one = 1.0, variable
114 if(ix>=0x7ff00000) return one/x;
139 if(huge+x>one) return 0.5*x;/* inexact if x!=0 necessary */
143 s = one+z*(s01+z*(s02+z*(s03+z*(s04+z*s05))));
185 if(ix>=0x7ff00000) return one/(x+x*x);
186 if((ix|lx)==0) return -one/zero;
207 * to compute the worse one.
221 v = one+z*(V0[0]+z*(V0[1]+z*(V0[2]+z*(V0[3]+z*V0[4]))));
222 return(x*(u/v) + tpi*(__ieee754_j1(x)*__ieee754_log(x)-one/
[all...]
/openjdk7/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/
H A DLogCleanupReader.java52 private char[] one = new char[1]; field in class:LogCleanupReader
157 read(one, 0, 1);
158 return one[0];
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DConstFold.java66 static Integer one = 1; field in class:ConstFold
71 return b ? one : zero;
256 return syms.intType.constType(one);
278 return syms.intType.constType(one);
282 return syms.intType.constType(one);
304 return syms.intType.constType(one);
308 return syms.intType.constType(one);
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/
H A DXSWildcardDecl.java52 // for NSCONSTRAINT_LIST, it means one of the namespaces in the list
80 // For a value which is either a namespace name or absent to be valid with respect to a wildcard constraint (the value of a {namespace constraint}) one of the following must be true:
104 // 3 The constraint is a set, and the value is identical to one of the members of the set.
126 // namespace constraint (call it super) one of the following must be true:
378 // +5.2 If one of the two is a pair of not and absent, the other must be
410 // and each item in one list must appear in the other one
424 String[] intersect2sets(String[] one, String[] theOther){ argument
425 String[] result = new String[Math.min(one.length,theOther.length)];
429 for (int i=0; i<one
440 union2sets(String[] one, String[] theOther) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/util/
H A DXSNamedMapImpl.java57 // each entry contains components in one namespace
69 * Construct an XSNamedMap implementation for one namespace
94 * Construct an XSNamedMap implementation one namespace from an array
109 // get the namespace from the first one.
197 static boolean isEqual(String one, String two) { argument
198 return (one != null) ? one.equals(two) : (two == null);
/openjdk7/corba/src/share/classes/com/sun/tools/corba/se/idl/constExpr/
H A DExpression.java217 public static final BigInteger one = BigInteger.valueOf (1); field in class:Expression
230 public static final BigInteger usMax = sMax.multiply (two).add (one);
236 public static final BigInteger ulMax = lMax.multiply (two).add (one);
242 public static final BigInteger ullMax = llMax.multiply (two).add (one);
/openjdk7/hotspot/src/share/vm/opto/
H A DindexSet.cpp198 // Compute the union of all elements of one and two which interfere with
207 IndexSet *one = ifg->neighbors(lr1); local
212 assert(_max_elements == one->_max_elements, "max element mismatch");
214 one->check_watch("union source");
224 if (two->count() > one->count()) {
225 IndexSet *temp = one;
226 one = two;
238 // Load up the combined interference set with the neighbors of one
239 IndexSetIterator elements(one);
526 // if there is one
[all...]
/openjdk7/jdk/test/java/util/Collections/
H A DRacingCollections.java48 final static Integer one = 1; field in class:RacingCollections
169 if (! c.contains(one))
170 c.add(one);
174 if (! m.containsKey(one))
175 m.put(one, true);
274 x.put(one, true);
/openjdk7/jdk/test/sun/net/www/httptest/
H A DHttpServer.java408 byte[] one; field in class:HttpServer.NioInputStream
421 one = new byte[1];
430 return read (one, 0, 1);
531 byte[] one; field in class:HttpServer.NioOutputStream
538 one = new byte [1];
542 one[0] = (byte)b;
543 write (one, 0, 1);
/openjdk7/jdk/src/share/classes/sun/net/httpserver/
H A DRequest.java226 byte[] one; field in class:Request.ReadStream
241 one = new byte[1];
250 int result = read (one, 0, 1);
252 return one[0] & 0xFF;
359 byte[] one; field in class:Request.WriteStream
367 one = new byte [1];
372 one[0] = (byte)b;
373 write (one, 0, 1);
/openjdk7/jdk/src/share/classes/java/math/
H A DMutableBigInteger.java72 * MutableBigInteger with one element value array with the value 1. Used by
82 * a one word capacity.
387 * Returns true iff this MutableBigInteger has a value of one.
509 * A primitive used for division. This method adds in one multiple of the
526 * This method is used for division. It multiplies an n word input a by one
622 // Result one word longer from carry-out; copy low-order
807 * This method is used for division of an n word dividend by a one word
808 * divisor. The quotient is placed into quotient. The one word divisor is
817 // Special case of one word dividend
877 * It special cases one wor
1070 unsignedLongCompare(long one, long two) argument
[all...]
/openjdk7/jdk/test/sun/security/ssl/sun/net/www/httpstest/
H A DHttpServer.java588 byte[] one; field in class:HttpServer.NioInputStream
603 one = new byte[1];
612 return read (one, 0, 1);
725 byte[] one; field in class:HttpServer.NioOutputStream
735 one = new byte [1];
739 one[0] = (byte)b;
740 write (one, 0, 1);

Completed in 278 milliseconds

123