// For pre-populated disallowedPriorLocks edges, omit the stack trace.
          setStackTrace(EMPTY_STACK_TRACE);
          break;
        }
        if (!EXCLUDED_CLASS_NAMES.contains(origStackTrace[i].getClassName())) {
          setStackTrace(Arrays.copyOfRange(origStackTrace, i, n));
          break;
        }
      }
    }
  }

  /**

            int count = 0;
            while (emptyIterator.hasNext()) {
                emptyIterator.next();
                count++;
                if (count > 10)
                    break; // Safety check
            }
            assertEquals(0, count, "No iterations should occur for empty iterator");
        }, "EmptyIterator should work with manual iteration");
    }

    @Test

        int length = 0;
        for (int i = offset; i < offset + maxLength && i < buffer.length; i++) {
            if (buffer[i] == 0) {
                break;
            }
            length++;
        }
        return new String(buffer, offset, length);
    }

									guessNestedRelations = append(guessNestedRelations, relation)
									currentRelations = relation.FieldSchema.Relationships.Relations
								} else {
									isNestedJoin = false
									break
								}
							}

							if isNestedJoin {
								isRelations = true
								relations = guessNestedRelations
							}
						}
					}

					if isRelations {

      boolean changedAnyBits = true;
      do {
        ourLongOld = data.get(i);
        ourLongNew = ourLongOld | longValue;
        if (ourLongOld == ourLongNew) {
          changedAnyBits = false;
          break;
        }
      } while (!data.compareAndSet(i, ourLongOld, ourLongNew));

      if (changedAnyBits) {
        int bitsAdded = Long.bitCount(ourLongNew) - Long.bitCount(ourLongOld);
        bitCount.add(bitsAdded);

			if err == nil || isUsingClosedConnError(err) {
				continue
			}
			t.Errorf("failed to read user of id %d due to %s, there should not be error", id, err)
			unexpectedError = true
			break
		}
	}(user.ID)

	wg.Add(1)
	go func() {
		defer wg.Done()
		<-writerFinish
		pdb.Close()
	}()

	wg.Wait()

	if unexpectedError {
		t.Fatalf("should is a unexpected error")

        storageClient.setInitParameterMap(params);

        for (int i = 0; i < 10; i++) {
            try {
                setupMinioClient(bucketName, endpoint);
                break;
            } catch (final Exception e) {
                logger.warn("[{}] {}", i + i, e.getMessage());
            }
            ThreadUtil.sleep(1000L);
        }
    }

                    }
                    break;
                }

                // walk up trying to find a match, do not go up to the root
                final int nextSep = link.lastIndexOf('\\');
                if (nextSep <= 0) {
                    if (log.isTraceEnabled()) {
                        log.trace("Not found " + link);
                    }
                    break;
                }

index e966c03..22ab790 100644
--- a/locale/weightwc.h
+++ b/locale/weightwc.h
@@ -79,19 +79,19 @@ findidx (const wint_t **cpp, size_t len)
 	    if (cp[cnt] != usrc[cnt])
 	      break;
 
-	  if (cnt < nhere - 1)
+	  if (cnt < nhere - 1 || cnt == len)
 	    {
 	      cp += 2 * nhere;
 	      continue;
 	    }
 
-	  if (cp[nhere - 1] > usrc[nhere -1])

                    return doNameQuery(new Name(host, type, scope), svr);
                }
                b = b * 10 + c - '0';

                i++;
                if (i >= data.length) {
                    break;
                }

                c = data[i];
            }
            if (b > 0xFF) {
                return doNameQuery(new Name(host, type, scope), svr);
            }
            IP = (IP << 8) + b;