if (target1 == null || target2 == null) {
            return false;
        }
        final int length1 = target1.length();
        final int length2 = target2.length();
        if (length1 < length2) {
            return false;
        }
        final String s1 = target1.substring(length1 - length2);
        return s1.equalsIgnoreCase(target2);
    }

    /**

- Fixed runtime cost estimation for `x-int-or-string` custom resource schemas with maximum lengths. ([#132837](https://github.com/kubernetes/kubernetes/pull/132837), [@JoelSpeed](https://github.com/JoelSpeed))

          var i = 4
          val limit = minOf(a.length, b.length)
          while (i < limit) {
            val charA = a[i]
            val charB = b[i]
            if (charA != charB) return if (charA < charB) -1 else 1
            i++
          }
          val lengthA = a.length
          val lengthB = b.length
          if (lengthA != lengthB) return if (lengthA < lengthB) -1 else 1
          return 0
        }
      }

      }

    // Read the length.
    val length0 = source.readByte().toInt() and 0xff
    val length =
      when {
        length0 == 0b1000_0000 -> {
          throw ProtocolException("indefinite length not permitted for DER")
        }
        (length0 and 0b1000_0000) == 0b1000_0000 -> {
          // Length specified over multiple bytes.
          val lengthBytes = length0 and 0b0111_1111

		uuid_t uuid;
	} policy_handle;

	/*
	 * typedef struct _UNICODE_STRING
	 *     USHORT Length;
	 *     USHORT MaximumLength;
	 *     [size_is(MaximumLength / 2), length_is((Length) / 2) ] USHORT *  Buffer;
	 * } UNICODE_STRING;
	 */

	typedef struct {
		uint16_t length;
		uint16_t maximum_length;
		[length_is(length / 2),size_is(maximum_length / 2)] uint16_t *buffer;
	} unicode_string;

	/* 

		uuid_t uuid;
	} policy_handle;

	/*
	 * typedef struct _UNICODE_STRING
	 *     USHORT Length;
	 *     USHORT MaximumLength;
	 *     [size_is(MaximumLength / 2), length_is((Length) / 2) ] USHORT *  Buffer;
	 * } UNICODE_STRING;
	 */

	typedef struct {
		uint16_t length;
		uint16_t maximum_length;
		[length_is(length / 2),size_is(maximum_length / 2)] uint16_t *buffer;
	} unicode_string;

	/* 

</p>

<pre>
p1 := &amp;[]int{}    // p1 points to an initialized, empty slice with value []int{} and length 0
p2 := new([]int)  // p2 points to an uninitialized slice with value nil and length 0
</pre>

<p>
The length of an array literal is the length specified in the literal type.
If fewer elements than the length are provided in the literal, the missing
elements are set to the zero value for the array element type.

LICENSE file. //go:build !purego #include "textflag.h" // func cryptBlocks(c code, key, dst, src *byte, length int) TEXT ·cryptBlocks(SB),NOSPLIT,$0-40 MOVD key+8(FP), R1 MOVD dst+16(FP), R2 MOVD src+24(FP), R4 MOVD length+32(FP), R5 MOVD c+0(FP), R0 loop: KM R2, R4 // cipher message (KM) BVS loop // branch back if interrupted XOR R0, R0 RET // func cryptBlocksChain(c code, iv, key, dst, src *byte, length int) TEXT ·cryptBlocksChain(SB),NOSPLIT,$48-48 LA params-48(SP), R1 MOVD iv+8(FP), R8 MOVD key+16(FP),...

sk[64:] s1 = make([]ringElement, l) for i := range l { length := n * bits.Len(uint(η)*2) / 8 s1[i], err = bitUnpackSlow(sk[:length], η, η) if err != nil { return } sk = sk[length:] } s2 = make([]ringElement, k) for i := range k { length := n * bits.Len(uint(η)*2) / 8 s2[i], err = bitUnpackSlow(sk[:length], η, η) if err != nil { return } sk = sk[length:] } const bound = 1 << (13 - 1) // 2^(d-1) t0 = make([]ringElement, k) for i := range k { length := n * 13 / 8 t0[i], err = bitUnpackSlow(sk[:length],...

| :--                  | :--                                            |
| _Type_               | _String_                                       |
| _Length Constraints_ | _Minimum length of 2. Maximum length of 2048._ |
| _Required_           | _Yes_                                          |

### LDAPPassword