ioff += maxChunkSize;
                        }

                        if ( dfd == null || !dfd.isValid() ) {
                            // don't reopen the file for every round if it's not necessary, keep the lock
                            dfd = openCopyTargetFile(dest, src.getAttributes(), !write);
                        }

                String[] found = d.list();
                String[] expect = names;

                Arrays.sort(found);
                Arrays.sort(expect);

                if ( log.isDebugEnabled() ) {
                    log.debug("Expect " + Arrays.toString(expect));
                    log.debug("Found " + Arrays.toString(found));
                }

        "Access is denied.",
        "The TID specified was invalid.",
        "The handle is invalid.",
        "The network name cannot be found.",
        "Not enough storage is available to process this command.",
        "The media is write protected.",
        "The device is not ready.",
        "A device attached to the system is not functioning.",

        values.add(value);
        boolean found = false;
        Iterator entries = requestProperties.entrySet().iterator();
        while (entries.hasNext()) {
            Map.Entry entry = (Map.Entry) entries.next();
            if (key.equalsIgnoreCase((String) entry.getKey())) {
                entry.setValue(values);
                found = true;
                break;
            }
        }

                KerberosKey serverKey = keysByAlgo.get(encType.getValue().intValue());
                if ( keysByAlgo.isEmpty() || serverKey == null ) {
                    throw new PACDecodingException("Kerberos key not found for eType " + encType.getValue());
                }

                try {
                    byte[] decrypted = KerberosEncData.decrypt(crypt, serverKey, serverKey.getKeyType());

            while ( true ) {
                dr = links.map.get(link);

                if ( dr != null ) {
                    if ( log.isTraceEnabled() ) {
                        log.trace("Found at " + link);
                    }
                    break;
                }

                // walk up trying to find a match, do not go up to the root
                int nextSep = link.lastIndexOf('\\');

         * negative so it with NT_STATUS_SUCCESS (0) the binary search will not be
         * performed properly. The effect is that the code at index 1 is never found
         * (NT_STATUS_UNSUCCESSFUL). So here we factor out NT_STATUS_SUCCESS
         * as a special case (which it is).
         */
        if (errcode == 0) {
            return "NT_STATUS_SUCCESS";
        }

        work   = (leftt ^ right) & 0xaaaaaaaa;
        leftt ^= work;
        right ^= work;
        leftt  = (leftt << 1) | ((leftt >>> 31) & 1);

        for ( round = 0; round < 8; ++round )  {
            work   = (right << 28) | (right >>> 4);
            work  ^= keys[keysi++];
            fval   = SP7[ work         & 0x0000003f ];
            fval  |= SP5[(work >>>  8) & 0x0000003f ];

            throws InterruptedException, ExecutionException, TimeoutException {
        boolean found = checkInResult(action, name, infos);
        if ( !found ) {
            // retry, the first watch may have already come back before the triggered change was active
            try {
                setupWatch(w);
                found = checkInResult(action, name, infos);
            }
            catch ( TimeoutException e ) {

                        c.createNewFile();
                    }
                }

                String[] found = f.list();
                Arrays.sort(found);

                for ( int i = 0; i < n; i++ ) {
                    Assert.assertTrue(Arrays.binarySearch(found, String.format("%s%d.tmp", prefix, i)) >= 0);
                }
            }
            finally {
                f.delete();