siteLK.RLock()
	defer siteLK.RUnlock()

	return s.region
}

var validRegionRegex = regexp.MustCompile("^[a-zA-Z][a-zA-Z0-9-_-]+$")

// validSiteNameRegex - allows lowercase letters, digits and '-', starts with
// letter. At least 2 characters long.
var validSiteNameRegex = regexp.MustCompile("^[a-z][a-z0-9-]+$")

// LookupSite - get site related configuration. Loads configuration from legacy

labels.backup_configuration=Backup
labels.backup_name=Name
labels.backup_bulk_file=Bulk File
labels.backup_button_upload=Upload
labels.process_time_is_exceeded=The search processing time has exceeded the limit. The displayed results may be partial.
labels.user_given_name=Given Name
labels.givenName=Given Name
labels.user_surname=Surname
labels.surame=Surname
labels.user_mail=Mail
labels.mail=Mail

        }

        final String result = client.testBuildContext(documents);
        assertTrue(result.length() <= 300); // some overhead from header text
    }

    // ========== P6: generateSummaryResponse size limit and HTML stripping tests ==========

    @Test
    public void test_generateSummaryResponse_stripsHtmlFromContent() {
        client.setTestContextMaxChars(10000);
        client.setTestSystemPrompt("system");

            final byte[] buf = buffer.array();
            int len;
            int amount = 0;
            while ((len = in.read(buf)) != -1) {
                buffer.limit(len);
                channel.write(buffer, amount);
                buffer.clear();
                amount += len;
            }
            out.flush();
            return amount;

	mac := hmac.New(sha256.New, d.objectEncryptionKey) // derive part encryption key from part ID and object key
	mac.Write(partIDbin[:])
	partEncryptionKey := mac.Sum(nil)

	// Limit the reader, so the decryptor doesn't receive bytes
	// from the next part (different DARE stream)
	encLenToRead := d.parts[d.partIndex].Size - d.partEncRelOffset

	if b.r > 0 {
		copy(b.buf, b.buf[b.r:b.w])
		b.w -= b.r
		b.r = 0
	}

	if b.w >= len(b.buf) {
		panic("bufio: tried to fill full buffer")
	}

	// Read new data: try a limited number of times.
	for i := maxConsecutiveEmptyReads; i > 0; i-- {
		n, err := b.rd.Read(b.buf[b.w:])
		if n < 0 {
			panic(errNegativeRead)
		}
		b.w += n
		if err != nil {
			b.err = err
			return

        }
        return 10000L;
    }

    // ===================================================================================
    //                                                                         Rate Limit
    //                                                                         ==========
    String RATE_LIMIT_WHITELIST_IPS_SET = "rateLimitWhitelistIpsSet";

   * header field name.
   *
   * @since 27.1
   */
  public static final String ORIGIN_TRIAL = "Origin-Trial";

  /** The HTTP {@code P3P} header field name. Limited browser support. */
  public static final String P3P = "P3P";

  /** The HTTP {@code Proxy-Authenticate} header field name. */
  public static final String PROXY_AUTHENTICATE = "Proxy-Authenticate";

      builder.add(9);
    }
    ImmutableSortedSet<Integer> unused = builder.build();
    assertThat(compares[0]).isAtMost(10000);
    // hopefully something quadratic would have more digits
  }

      finalResults.clear();
    }
    executor.shutdown();
  }

  // In a previous implementation this would cause a stack overflow after ~2000 futures chained
  // together.  Now it should only be limited by available memory (and time)
  public void testSetFuture_stackOverflow() {
    SettableFuture<String> orig = SettableFuture.create();
    SettableFuture<String> prev = orig;
    for (int i = 0; i < 100000; i++) {