var mutex sync.Mutex
	printOnce := make(map[Endpoint]map[string]int)

	return func(endpoint Endpoint, err error, once bool) {
		reqInfo := (&logger.ReqInfo{}).AppendTags("endpoint", endpoint.String())
		ctx := logger.SetReqInfo(GlobalContext, reqInfo)
		mutex.Lock()
		defer mutex.Unlock()

		m, ok := printOnce[endpoint]
		if !ok {
			m = make(map[string]int)
			printOnce[endpoint] = m
			if once {
				m[err.Error()]++

    return conn.app.state.value


@app.get("/http")
async def get_value_by_http(value: int = Depends(extract_value_from_http_connection)):
    return value


@app.websocket("/ws")
async def get_value_by_ws(
    websocket: WebSocket, value: int = Depends(extract_value_from_http_connection)
):
    await websocket.accept()
    await websocket.send_json(value)
    await websocket.close()

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package p4

type Pair[T1 interface{ M() }, T2 ~int] struct {
	f1 T1
	f2 T2
}

func NewPair[T1 interface{ M() }, T2 ~int](v1 T1, v2 T2) Pair[T1, T2] {
	return Pair[T1, T2]{f1: v1, f2: v2}
}

func (p Pair[X1, _]) First() X1 {
	return p.f1
}

func (p Pair[_, X2]) Second() X2 {
	return p.f2

    for (List<E> subList : asList(copy, head, tail)) {
      for (int index : asList(-1, subList.size())) {
        assertThrows(IndexOutOfBoundsException.class, () -> subList.get(index));
      }
    }
  }

  @CollectionSize.Require(absent = {ZERO, ONE})
  public void testSubList_contains() {
    List<E> list = getList();
    int size = getNumElements();
    List<E> copy = list.subList(0, size);

    for (List<E> subList : asList(copy, head, tail)) {
      for (int index : asList(-1, subList.size())) {
        assertThrows(IndexOutOfBoundsException.class, () -> subList.get(index));
      }
    }
  }

  @CollectionSize.Require(absent = {ZERO, ONE})
  public void testSubList_contains() {
    List<E> list = getList();
    int size = getNumElements();
    List<E> copy = list.subList(0, size);

        message[62] = 0x00;
        message[63] = 0x00;

        // Add dummy LM response (24 zeros at offset 64)
        for (int i = 0; i < 24; i++) {
            message[64 + i] = 0;
        }

        // Add dummy NT response (24 zeros at offset 88)
        for (int i = 0; i < 24; i++) {
            message[88 + i] = 0;
        }

        // Add Domain "DOMAIN" in Unicode at offset 112

        securityDescriptorBytes[3] = 0;
        // No owner (offset 0)
        for (int i = 4; i < 8; i++)
            securityDescriptorBytes[i] = 0;
        // No group (offset 0)
        for (int i = 8; i < 12; i++)
            securityDescriptorBytes[i] = 0;
        // No SACL (offset 0)
        for (int i = 12; i < 16; i++)
            securityDescriptorBytes[i] = 0;
        // DACL at offset 20

            return Integer.valueOf(3);
        }

        /**
         * @param arg1
         * @param arg2
         * @return int
         */
        public int add2(final int arg1, final int arg2) {
            return arg1 + arg2;
        }

        /**
         * @param arg
         * @return Integer
         */

                }
            }
        }
        return decoded;
    }

    @Override
    public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + ((getId() == null) ? 0 : getId().hashCode());
        return result;
    }

    @Override
    public boolean equals(Object obj) {

@SuppressWarnings("JUnit4ClassUsedInJUnit3")
public class MapHashCodeTester<K, V> extends AbstractMapTester<K, V> {
  public void testHashCode() {
    int expectedHashCode = 0;
    for (Entry<K, V> entry : getSampleEntries()) {
      expectedHashCode += hash(entry);
    }
    assertEquals(
        "A Map's hashCode() should be the sum of those of its entries.",