dynamicTable = doubled
          }
          index = nextHeaderIndex--
          dynamicTable[index] = entry
          headerCount++
        } else { // Replace value at same position.
          index += dynamicTableIndex(index) + entriesEvicted
          dynamicTable[index] = entry
        }
        dynamicTableByteCount += delta
      }

			}
			for _, spec := range d.Specs {
				if s, ok := spec.(*ast.ImportSpec); ok && s.Path.Value == `"C"` {
					// Replace "C" with _ "unsafe", to keep program valid.
					// (Deleting import statement or clause is not safe if it is followed
					// in the source by an explicit semicolon.)
					f.Edit.Replace(f.offset(s.Path.Pos()), f.offset(s.Path.End()), `_ "unsafe"`)
				}
			}
		}
	}

            Path base = project.getOutputDirectory(scope());
            return targetPath.map(base::resolve).orElse(base);
        });
    }

    /**
     * {@return whether resources are filtered to replace tokens with parameterized values}
     * The default value is {@code false}.
     */
    default boolean stringFiltering() {
        return false;
    }

    /**

    echo "Look at the instructions for ':api_compatibility_test -- --update_goldens=True'"
}

# See b/279852433 (internal).
# TODO(b/279852433) Replace deps(//tensorflow/...) with deps(//...)
@test "Verify that it's possible to query every TensorFlow target without BUILD errors" {
    bazel query "deps(//tensorflow/... -attr(tags, 'manual', //tensorflow/...))" > /dev/null
}

			if err != nil {
				internalLogIf(ctx, err, logger.WarningKind)
				break
			}

			// Handle if we have some buckets in-memory those are stale.
			// first delete them and then replace the newer state()
			// from disk.
			diskBuckets := set.CreateStringSet()
			for _, bucket := range buckets {
				diskBuckets.Add(bucket.Name)
			}
			sys.RemoveStaleBuckets(diskBuckets)

        assertEquals(dr, l.getDfsReferral());
        assertEquals("dfs-server", l.getServerWithDfs());
        assertEquals("smb://dfs-server/dfs-share" + l.getUNCPath().replace('\\', '/'), l.getDfsPath());
        assertEquals("dfs-share", l.getShare());

        // Path consumed negative -> coerced to 0
        when(dr.getPathConsumed()).thenReturn(-1);

func TestAddObjectPart(t *testing.T) {
	testCases := []struct {
		partNum       int
		expectedIndex int
	}{
		{1, 0},
		{2, 1},
		{4, 2},
		{5, 3},
		{7, 4},
		// Insert part.
		{3, 2},
		// Replace existing part.
		{4, 3},
		// Missing part.
		{6, -1},
	}

	// Setup.
	fi := newFileInfo("test-object", 8, 8)
	fi.Erasure.Index = 1
	if !fi.IsValid() {
		t.Fatalf("unable to get xl meta")
	}

  if (title === '') {\n      title = $item.text()\n    }\n\n    const link = $item.attr('href')\n    if (link === '#' || link === '' || link === undefined) {\n      return\n    }\n\n    const uniqueName = unescape(link).replace('./', '').replace(/[\"#&'./:=?[\\]]/gi, '-').replace(/(--)/gi, '')\n    const navId = `tab-${uniqueName}`\n\n    if (!this._config.allowDuplicates && $(`#${navId}`).length > 0) {\n      return this.switchTab(`#${navId}`, this._config.allowReload)\n    }\n\n    if ((!this....

 * elements.
 *
 * <p>The collections created by {@link #createCollection()} may or may not allow duplicates. If the
 * collection, such as a {@link Set}, does not support duplicates, an added key-value pair will
 * replace an existing pair with the same key and value, if such a pair is present. With collections
 * like {@link List} that allow duplicates, the collection will keep the existing key-value pairs
 * while adding a new pair.
 *

		s = s[l:]
	}
	return t
}

// Replace returns a copy of the slice s with the first n
// non-overlapping instances of old replaced by new.
// If old is empty, it matches at the beginning of the slice
// and after each UTF-8 sequence, yielding up to k+1 replacements
// for a k-rune slice.
// If n < 0, there is no limit on the number of replacements.
func Replace(s, old, new []byte, n int) []byte {
	m := 0