entriesLeft--

		entryInfo, err := fsys.Lstat(name)
		if err != nil {
			t.Fatalf("getting entry info error: %v", err)
		}
		hdr, err := tr.Next()
		if err == io.EOF {
			break // End of archive
		}
		if err != nil {
			t.Fatal(err)
		}

		tmpName := name
		if entryInfo.IsDir() {
			tmpName += "/"
		}
		if hdr.Name != tmpName {

any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS META-INF/MANIFEST.MF Manifest-Version: 1.0 Implementation-Title: Gradle Wrapper SPDX-License-Identifier: Apache-2.0 Main-Class: org.gradle.wrapper.GradleWrapperMain Enable-Native-Access: ALL-UNNAMED org/gradle/cli/CommandLineArgumentE.class...

      K key = entry.getKey();
      ImmutableSet.Builder<? extends V> values = (ImmutableSet.Builder<V>) entry.getValue();
      // If orderValuesBy got called at the very end, we may need to do the ImmutableSet to
      // ImmutableSortedSet copy for each of these.
      ImmutableSet<V> set = valueSet(valueComparator, values.build());
      if (!set.isEmpty()) {
        builder.put(key, set);

         * problems can exist with methods like FutureTask.done(), not to mention slow calls to
         * Thread.interrupt() (as discussed in InterruptibleTask). At the end of the day, it's
         * unlikely that cancel() will be slow, so we can probably get away with calling it while
         * holding a lock. Still, it would be nice to avoid somehow.
         */
        lock.lock();

A767          ; valid                                  # 5.1  LATIN SMALL LETTER THORN WITH STROKE THROUGH DESCENDER
A768          ; mapped                 ; A769          # 5.1  LATIN CAPITAL LETTER VEND
A769          ; valid                                  # 5.1  LATIN SMALL LETTER VEND
A76A          ; mapped                 ; A76B          # 5.1  LATIN CAPITAL LETTER ET
A76B          ; valid                                  # 5.1  LATIN SMALL LETTER ET

        assertEquals(6, pageList.size()); // Pages 1-6 (current page 1 + range 5)
        assertEquals("1", pageList.get(0));
        assertEquals("6", pageList.get(5));

        // Test when current page is at the end
        qrList = new QueryResponseList(null, 190, 10, 0) {
            @Override
            public int size() {
                return 10;
            }
        };

$(this._element).on(EVENT_POINTERDOWN, event => start(event))\n      $(this._element).on(EVENT_POINTERUP, event => end(event))\n\n      this._element.classList.add(CLASS_NAME_POINTER_EVENT)\n    } else {\n      $(this._element).on(EVENT_TOUCHSTART, event => start(event))\n      $(this._element).on(EVENT_TOUCHMOVE, event => move(event))\n      $(this._element).on(EVENT_TOUCHEND, event => end(event))\n    }\n  }\n\n  _keydown(event) {\n    if (/input|textarea/i.test(event.target.tagName)) {\n      return\n...

			}
			for za0001 := range x.versions {
				start := len(allMeta) - len(bts)
				bts, err = tmp.unmarshalV(1, bts)
				if err != nil {
					return msgp.WrapError(err, "Versions", za0001)
				}
				end := len(allMeta) - len(bts)
				// We reference the marshaled data, so we don't have to re-marshal.
				x.versions[za0001] = xlMetaV2ShallowVersion{
					header: tmp.header(),
					meta:   allMeta[start:end],
				}

    // * Everything with (to <= index < from) should be removed.
    // * The element with (index == from) should be kept.
    // * Everything with (index > from) has not been checked yet.

    // Check from the end of the list backwards (minimize expected cost of
    // moving elements when remove() is called). Stop before 'from' because
    // we already know that should be kept.
    for (int n = list.size() - 1; n > from; n--) {

an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.

                     END OF TERMS AND CONDITIONS

            How to Apply These Terms to Your New Programs

  If you develop a new program, and you want it to be of the greatest