}
		} else {
			// If bytealg.Index is not available a brute force search is
			// ~1.5-3x faster than Rabin-Karp since n is small.
			c0 := b[last]
			c1 := b[last-1] // There are at least 2 chars to match
		loop:
			for ; i < len(s); i++ {
				if s[i] == c0 && s[i-1] == c1 {
					for k := 2; k < n; k++ {
						if s[i-k] != b[last-k] {
							continue loop
						}
					}
					return i - last
				}

    do {
      System.runFinalization();
      if (latch.getCount() == 0) {
        return;
      }
      System.gc();
      try {
        if (latch.await(1L, SECONDS)) {
          return;
        }
      } catch (InterruptedException ie) {
        throw new RuntimeException("Unexpected interrupt while waiting for latch", ie);
      }
    } while (System.nanoTime() - deadline < 0);

            validator.validatePath("\\share\\con");
            fail("Should block lowercase reserved name");
        } catch (SmbException e) {
            // Expected
        }

        try {
            validator.validatePath("\\share\\Con");
            fail("Should block mixed case reserved name");
        } catch (SmbException e) {
            // Expected
        }
    }

    @Test

        try {
            createResp = th.send(create);
        } catch (final SmbException e) {
            final Smb2CreateResponse cr = create.getResponse();
            if (cr != null && cr.isReceived() && cr.getStatus() == NtStatus.NT_STATUS_SUCCESS) {
                try {
                    th.send(new Smb2CloseRequest(th.getConfig(), cr.getFileId()));
                } catch (final SmbException e2) {
                    e.addSuppressed(e2);

                            this.type = SmbConstants.TYPE_WORKGROUP;
                            return this.type;
                        }
                    }
                } catch (final CIFSException e) {
                    if (!(e.getCause() instanceof UnknownHostException)) {
                        throw e;
                    }
                    log.debug("Unknown host", e);

jede
jedem
jeden
jeder
jedes
jene
jenem
jenen
jener
jenes
jetzt
kann
kein
keine
keinem
keinen
keiner
keines
können
könnte
machen
man
manche
manchem
manchen
mancher
manches
mein
meine
meinem
meinen
meiner
meines
mit
muss
musste
nach
nicht
nichts
noch
nun
nur
ob
oder
ohne

                    java.lang.reflect.Field realmField = NetworkExplorer.class.getDeclaredField("realm");
                    realmField.setAccessible(true);
                    realmField.set(this, "jCIFS");
                } catch (Exception e) {
                    throw new ServletException(e);
                }
            }
        };

        assertDoesNotThrow(() -> networkExplorer.init(servletConfig));

            try {
                boostDocumentRuleService.store(entity);
                saveInfo(messages -> messages.addSuccessCrudCreateCrudTable(GLOBAL));
            } catch (final Exception e) {
                logger.warn("Failed to process a request.", e);
                throwValidationError(messages -> messages.addErrorsCrudFailedToCreateCrudTable(GLOBAL, buildThrowableMessage(e)),

        StringWriter sWriter = new StringWriter(1024);

        MavenStaxWriter writer = new MavenStaxWriter();
        try {
            writer.write(sWriter, model.getDelegate());
        } catch (IOException | XMLStreamException e) {
            throw new ModelInterpolationException("Cannot serialize project model for interpolation.", e);
        }

        String serializedModel = sWriter.toString();

                if (retryDelayMs > 0) {
                    // Safe calculation preventing overflow: use Math.max(0, retryCount - 1) and limit shift
                    int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(0, retryCount - 1));
                    long multiplier = 1L << safeShift;
                    // Check for potential overflow before multiplication