/* * Copyright (c) 1998, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions.
*/
/* @test @bug 4090383 @summary Ensure that BufferedReader's read method will fill the target array whenever possible
*/
publicint read(char[] cbuf, int off, int len) throws IOException { int n = len - shortFall; for (int i = off; i < n; i++)
cbuf[i] = next++; return n;
}
publicboolean ready() { returntrue;
}
publicvoid close() throws IOException {
}
}
/** * Test BufferedReader with an underlying source that always reads * shortFall fewer characters than requested
*/ staticvoid go(int shortFall) throws Exception {
Reader r = new BufferedReader(new Source(shortFall), 10); char[] cbuf = newchar[8];
int n1 = r.read(cbuf); int n2 = r.read(cbuf);
System.err.println("Shortfall " + shortFall
+ ": Read " + n1 + ", then " + n2 + " chars"); if (n1 != cbuf.length) thrownew Exception("First read returned " + n1); if (n2 != cbuf.length) thrownew Exception("Second read returned " + n2);
}
publicstaticvoid main(String[] args) throws Exception { for (int i = 0; i < 8; i++) go(i);
}
}
Messung V0.5
¤ Dauer der Verarbeitung: 0.15 Sekunden
(vorverarbeitet)
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.