8284893: Fix typos in java.base

Reviewed-by: iris, wetmore, lancea, mullan, naoto
This commit is contained in:
Magnus Ihse Bursie 2022-04-19 20:07:57 +00:00
parent 4594696f54
commit fb469fb894
162 changed files with 369 additions and 369 deletions

View file

@ -494,7 +494,7 @@ public abstract class ClassLoader {
}
// package-private used by StackTraceElement to avoid
// calling the overrideable getName method
// calling the overridable getName method
final String name() {
return name;
}

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2014, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2014, 2022, 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
@ -629,7 +629,7 @@ public final class ModuleLayer {
* </p>
*
* @apiNote It is implementation specific as to whether creating a layer
* with this method is an atomic operation or not. Consequentially it is
* with this method is an atomic operation or not. Consequently it is
* possible for this method to fail with some modules, but not all, defined
* to the Java virtual machine.
*

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2014, 2018, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2014, 2022, 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
@ -241,7 +241,7 @@ public interface ProcessHandle extends Comparable<ProcessHandle> {
* <p>
* The executable pathname may contain only the
* name of the executable without the full path information.
* It is undecideable whether white space separates different
* It is undecidable whether white space separates different
* arguments or is part of a single argument.
*
* @return an {@code Optional<String>} of the command line

View file

@ -3256,7 +3256,7 @@ public final class String
icoder |= delimiter.coder();
}
// assert len > 0L; // max: (long) Integer.MAX_VALUE << 32
// following loop wil add max: (long) Integer.MAX_VALUE * Integer.MAX_VALUE to len
// following loop will add max: (long) Integer.MAX_VALUE * Integer.MAX_VALUE to len
// so len can overflow at most once
for (int i = 0; i < size; i++) {
var el = elements[i];

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2008, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2008, 2022, 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
@ -238,7 +238,7 @@ class MethodHandleNatives {
throw new InternalError(err);
} catch (NoSuchFieldException | IllegalAccessException ex) {
String err = (name+": JVM has "+vmval+" which Java does not define");
// ignore exotic ops the JVM cares about; we just wont issue them
// ignore exotic ops the JVM cares about; we just won't issue them
//System.err.println("warning: "+err);
continue;
}

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2009, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2009, 2022, 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
@ -1503,7 +1503,7 @@ public class ModuleDescriptor
*
* If {@code strict} is {@code true} then module, package, and class
* names are checked to ensure they are legal names. In addition, the
* {@link #build buid} method will add "{@code requires java.base}" if
* {@link #build build} method will add "{@code requires java.base}" if
* the dependency is not declared.
*/
Builder(String name, boolean strict, Set<Modifier> modifiers) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1999, 2022, 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
@ -898,7 +898,7 @@ public class Proxy implements java.io.Serializable {
private static final AtomicInteger counter = new AtomicInteger();
/*
* Define a dynamic module with a packge named $MODULE which
* Define a dynamic module with a package named $MODULE which
* is unconditionally exported and another package named
* com.sun.proxy.$MODULE which is encapsulated.
*

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2017, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2017, 2022, 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
@ -331,7 +331,7 @@ public class ObjectMethods {
* Chops the getters into smaller chunks according to the maximum number of slots
* StringConcatFactory::makeConcatWithConstants can chew
* @param getters the current getters
* @return chunks that wont surpass the maximum number of slots StringConcatFactory::makeConcatWithConstants can chew
* @return chunks that won't surpass the maximum number of slots StringConcatFactory::makeConcatWithConstants can chew
*/
private static List<List<MethodHandle>> split(MethodHandle[] getters) {
List<List<MethodHandle>> splits = new ArrayList<>();

View file

@ -2157,7 +2157,7 @@ public class BigDecimal extends Number implements Comparable<BigDecimal> {
//
// unscaledValue * 10^(-scale)
//
// where unscaledValue is an integer with the mimimum
// where unscaledValue is an integer with the minimum
// precision for the cohort of the numerical value. To
// allow binary floating-point hardware to be used to get
// approximately a 15 digit approximation to the square
@ -4311,7 +4311,7 @@ public class BigDecimal extends Number implements Comparable<BigDecimal> {
* digits.
*
* @param x the {@code long}
* @return the length of the unscaled value, in deciaml digits.
* @return the length of the unscaled value, in decimal digits.
*/
static int longDigitLength(long x) {
/*
@ -4944,7 +4944,7 @@ public class BigDecimal extends Number implements Comparable<BigDecimal> {
}
/*
* returns INFLATED if oveflow
* returns INFLATED if overflow
*/
private static long add(long xs, long ys){
long sum = xs + ys;

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -3923,7 +3923,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
*
* @param val BigInteger whose magnitude array to be compared.
* @return -1, 0 or 1 as this magnitude array is less than, equal to or
* greater than the magnitude aray for the specified BigInteger's.
* greater than the magnitude array for the specified BigInteger's.
*/
final int compareMagnitude(BigInteger val) {
int[] m1 = mag;

View file

@ -176,7 +176,7 @@ import sun.nio.ch.DefaultSelectorProvider;
* // optionally configure multicast TTL; the TTL defines the scope of a
* // multicast datagram, for example, confining it to host local (0) or
* // link local (1) etc...
* int ttl = ...; // a number betwen 0 and 255
* int ttl = ...; // a number between 0 and 255
* sender.setOption(StandardSocketOptions.IP_MULTICAST_TTL, ttl);
*
* // send a packet to a multicast group

View file

@ -387,7 +387,7 @@ class Inet6Address extends InetAddress {
holder6 = new Inet6AddressHolder();
try {
initif (hostName, addr, null);
} catch (UnknownHostException e) {} /* cant happen if ifname is null */
} catch (UnknownHostException e) {} /* can't happen if ifname is null */
}
Inet6Address (String hostName, byte[] addr, NetworkInterface nif)

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1995, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1995, 2022, 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
@ -723,7 +723,7 @@ public final class URL implements java.io.Serializable {
String protocol = uri.getScheme();
// In general we need to go via Handler.parseURL, but for the jrt
// protocol we enforce that the Handler is not overrideable and can
// protocol we enforce that the Handler is not overridable and can
// optimize URI to URL conversion.
//
// Case-sensitive comparison for performance; malformed protocols will

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2020, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2020, 2022, 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
@ -138,7 +138,7 @@ import java.io.UncheckedIOException;
return mappingAddress(address, mappingOffset, 0);
}
// Given an offset previously otained from calling
// Given an offset previously obtained from calling
// mappingOffset(index) returns the largest page aligned address
// of the mapping less than or equal to the address of the buffer
// element identified by index.
@ -147,7 +147,7 @@ import java.io.UncheckedIOException;
return indexAddress - mappingOffset;
}
// given a mappingOffset previously otained from calling
// given a mappingOffset previously obtained from calling
// mappingOffset(index) return that offset added to the supplied
// length.
private static long mappingLength(long mappingOffset, long length) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, 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
@ -295,7 +295,7 @@ public class KeyFactory {
/**
* Update the active KeyFactorySpi of this class and return the next
* implementation for failover. If no more implemenations are
* implementation for failover. If no more implementations are
* available, this method returns null. However, the active spi of
* this class is never set to null.
*/

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, 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
@ -603,7 +603,7 @@ public abstract class KeyPairGenerator extends KeyPairGeneratorSpi {
/**
* Update the active spi of this class and return the next
* implementation for failover. If no more implemenations are
* implementation for failover. If no more implementations are
* available, this method returns null. However, the active spi of
* this class is never set to null.
*/

View file

@ -771,7 +771,7 @@ public class KeyStore {
}
/**
* Gets the trusted {@code Certficate} from this entry.
* Gets the trusted {@code Certificate} from this entry.
*
* @return the trusted {@code Certificate} from this entry
*/

View file

@ -1605,7 +1605,7 @@ public abstract class Provider extends Properties {
"java.lang.Object");
}
// get the "standard" (mixed-case) engine name for arbitary case engine name
// get the "standard" (mixed-case) engine name for arbitrary case engine name
// if there is no known engine by that name, return s
private static String getEngineName(String s) {
// try original case first, usually correct

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -225,7 +225,7 @@ public final class Security {
* Looks up providers, and returns the property (and its associated
* provider) mapping the key, if any.
* The order in which the providers are looked up is the
* provider-preference order, as specificed in the security
* provider-preference order, as specified in the security
* properties file.
*/
private static ProviderProperty getProviderProperty(String key) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -405,7 +405,7 @@ public class ChoiceFormat extends NumberFormat {
int i;
for (i = 0; i < choiceLimits.length; ++i) {
if (!(number >= choiceLimits[i])) {
// same as number < choiceLimits, except catchs NaN
// same as number < choiceLimits, except catches NaN
break;
}
}
@ -464,7 +464,7 @@ public class ChoiceFormat extends NumberFormat {
* {@link Math#nextUp(double) Math.nextUp(d)}
*
* @param d the reference value
* @return the least double value greather than {@code d}
* @return the least double value greater than {@code d}
* @see #previousDouble
*/
public static final double nextDouble (double d) {

View file

@ -1723,7 +1723,7 @@ public class DecimalFormat extends NumberFormat {
}
}
// ======== End fast-path formating logic for double =========================
// ======== End fast-path formatting logic for double =========================
/**
* Complete the formatting of a finite number. On entry, the digitList must

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -461,7 +461,7 @@ final class DigitList implements Cloneable {
* rounding done, is needed in this class.
*
* - For the HALF_DOWN, HALF_EVEN, HALF_UP rounding rules below:
* In the case of formating float or double, We must take into
* In the case of formatting float or double, We must take into
* account what FloatingDecimal has done in the binary to decimal
* conversion.
*
@ -469,7 +469,7 @@ final class DigitList implements Cloneable {
* value (returning decimal digits equal to tie when it is below),
* or "truncate" the value to the tie while value is above it,
* or provide the exact decimal digits when the binary value can be
* converted exactly to its decimal representation given formating
* converted exactly to its decimal representation given formatting
* rules of FloatingDecimal ( we have thus an exact decimal
* representation of the binary value).
*

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1999, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1999, 2022, 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
@ -187,7 +187,7 @@ final class RBCollationTables {
* with the specified comparison order.
*
* @param order a collation order returned by previous or next.
* @return the maximum length of any expansion seuences ending
* @return the maximum length of any expansion sequences ending
* with the specified order.
*
* @see CollationElementIterator#getMaxExpansion

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1999, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1999, 2022, 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
@ -82,7 +82,7 @@ final class RBTableBuilder {
// This array maps Unicode characters to their collation ordering
mapping = new UCompactIntArray(RBCollationTables.UNMAPPED);
// Normalize the build rules. Find occurances of all decomposed characters
// Normalize the build rules. Find occurrences of all decomposed characters
// and normalize the rules before feeding into the builder. By "normalize",
// we mean that all precomposed Unicode characters must be converted into
// a base character and one or more combining characters (such as accents).
@ -503,7 +503,7 @@ final class RBTableBuilder {
/**
* Create a new entry in the expansion table that contains the orderings
* for the given characers. If anOrder is valid, it is added to the
* for the given characters. If anOrder is valid, it is added to the
* beginning of the expanded list of orders.
*/
private int addExpansion(int anOrder, String expandChars) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1996, 2022, 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
@ -1581,7 +1581,7 @@ public class SimpleDateFormat extends DateFormat {
}
/* If the next tag/pattern is a <Numeric_Field> then the parser
* should consider the count of digits while parsing the contigous digits
* should consider the count of digits while parsing the contiguous digits
* for the current tag/pattern
*/
private boolean shouldObeyCount(int tag, int count) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2012, 2018, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2012, 2022, 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
@ -237,7 +237,7 @@
* This is made manageable through the use of consistent method prefixes.
* <ul>
* <li>{@code of} - static factory method</li>
* <li>{@code parse} - static factory method focussed on parsing</li>
* <li>{@code parse} - static factory method focused on parsing</li>
* <li>{@code get} - gets the value of something</li>
* <li>{@code is} - checks if something is true</li>
* <li>{@code with} - the immutable equivalent of a setter</li>

View file

@ -1040,7 +1040,7 @@ public class ArrayDeque<E> extends AbstractCollection<E>
}
/**
* Nulls out slots starting at array index i, upto index end.
* Nulls out slots starting at array index i, up to index end.
* Condition i == end means "empty" - nothing to do.
*/
private static void circularClear(Object[] es, int i, int end) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2005, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2005, 2022, 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
@ -1219,7 +1219,7 @@ class JapaneseImperialCalendar extends Calendar {
} else {
value = getMinimum(field);
CalendarDate d = jcal.getCalendarDate(Long.MIN_VALUE, getZone());
// Use an equvalent year of d.getYear() if
// Use an equivalent year of d.getYear() if
// possible. Otherwise, ignore the leap year and
// common year difference.
int y = d.getYear();

View file

@ -2969,7 +2969,7 @@ public abstract class ResourceBundle {
if (language.equals("zh")) {
if (region.isEmpty()) {
// Supply region(country) for users who still package Chinese
// bundles using old convension.
// bundles using old convention.
switch (script) {
case "Hans" -> region = "CN";
case "Hant" -> region = "TW";

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1997, 2022, 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
@ -2983,7 +2983,7 @@ public class TreeMap<K,V>
* potential speed-ups of using custom Spliterators versus default
* mechanics.
*
* To boostrap initialization, external constructors use
* To bootstrap initialization, external constructors use
* negative size estimates: -1 for ascend, -2 for descend.
*/
static class TreeMapSpliterator<K,V> {

View file

@ -676,7 +676,7 @@ public class ArrayBlockingQueue<E> extends AbstractQueue<E>
}
/**
* Nulls out slots starting at array index i, upto index end.
* Nulls out slots starting at array index i, up to index end.
* Condition i == end means "full" - the entire array is cleared.
*/
private static void circularClear(Object[] items, int i, int end) {

View file

@ -4908,7 +4908,7 @@ loop: for(int x=0, offset=0; x<nCodePoints; x++, offset+=len) {
if (count < cmax) {
// Let's check if we have already tried and failed
// at this starting position "i" in the past.
// If yes, then just return false wihtout trying
// If yes, then just return false without trying
// again, to stop the exponential backtracking.
if (posIndex != -1 &&
matcher.localsPos[posIndex].contains(i)) {

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2014, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2014, 2022, 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
@ -214,7 +214,7 @@ public final class CRC32C implements Checksum {
private static int updateBytes(int crc, byte[] b, int off, int end) {
// Do only byte reads for arrays so short they can't be aligned
// or if bytes are stored with a larger witdh than one byte.,%
// or if bytes are stored with a larger width than one byte.,%
if (end - off >= 8 && Unsafe.ARRAY_BYTE_INDEX_SCALE == 1) {
// align on 8 bytes

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 1995, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1995, 2022, 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
@ -53,7 +53,7 @@ public class ZipEntry implements ZipConstants, Cloneable {
long crc = -1; // crc-32 of entry data
long size = -1; // uncompressed size of entry data
long csize = -1; // compressed size of entry data
boolean csizeSet = false; // Only true if csize was explicitely set by
boolean csizeSet = false; // Only true if csize was explicitly set by
// a call to setCompressedSize()
int method = -1; // compression method
int flag = 0; // general purpose flag
@ -562,7 +562,7 @@ public class ZipEntry implements ZipConstants, Cloneable {
// and compressed file size fields.
// If invalid zip64 extra fields, simply skip. Even
// it's rare, it's possible the entry size happens to
// be the magic value and it "accidently" has some
// be the magic value and it "accidentally" has some
// bytes in extra match the id.
if (sz >= 16) {
size = get64(extra, off);

View file

@ -1632,7 +1632,7 @@ public class ZipFile implements ZipConstants, Closeable {
// 32 bit hash matches the hashed name.
while (idx != ZIP_ENDCHAIN) {
if (getEntryHash(idx) == hsh) {
// The CEN name must match the specfied one
// The CEN name must match the specified one
int pos = getEntryPos(idx);
try {

View file

@ -700,8 +700,8 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
writeShort(45); // version needed to extract
writeInt(0); // number of this disk
writeInt(0); // central directory start disk
writeLong(xentries.size()); // number of directory entires on disk
writeLong(xentries.size()); // number of directory entires
writeLong(xentries.size()); // number of directory entries on disk
writeLong(xentries.size()); // number of directory entries
writeLong(len); // length of central directory
writeLong(off); // offset of central directory

View file

@ -1,5 +1,5 @@
/*
* Copyright (c) 2013, 2020, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 2013, 2022, 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
@ -283,7 +283,7 @@ class ZipUtils {
static final int READBLOCKSZ = 128;
/**
* Loads zip native library, if not already laoded
* Loads zip native library, if not already loaded
*/
static void loadLibrary() {
jdk.internal.loader.BootLoader.loadLibrary("zip");