},
		{
			name:       "lower-case-is",
			query:      `select * from s3object[*] as s where s.request.header['User-Agent'] is not null`,
			wantResult: `{"request":{"uri":"/1","header":{"User-Agent":"test"}}}`,

spotless-plugin = "8.4.0"
square-kotlin-poet = "2.3.0"
square-moshi = "1.15.2"
square-okio = "3.17.0"
square-retrofit = "3.0.0"
startup-runtime = "1.2.0"
testcontainers = "1.21.4"
zstd-kmp-okio = "0.4.0"

# Set to lower version than KGP version to maximize compatibility
# Default to matching okio
kotlinCoreLibrariesVersion = "2.1.21"

[libraries]

declarations and definitions. These may then be referred to from Go
code as though they were defined in the package "C". All names
declared in the preamble may be used, even if they start with a
lower-case letter. Exception: static variables in the preamble may
not be referenced from Go code; static functions are permitted.

See $GOROOT/cmd/cgo/internal/teststdio and $GOROOT/misc/cgo/gmp for examples. See

- The `controller.kubernetes.io/pod-deletion-cost` annotation can be set to offer a hint on the cost of deleting a `Pod` compared to other pods belonging to the same ReplicaSet. Pods with lower deletion cost are deleted first. This is an alpha feature. ([#99163](https://github.com/kubernetes/kubernetes/pull/99163), [@ahg-g](https://github.com/ahg-g))

   * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
   * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
   * bits.
   *
   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,

			markDelete = false
		}
		if opts.VersionPurgeStatus() == replication.VersionPurgeComplete {
			markDelete = false
		}
		// now, since VersionPurgeStatus() is already set, we can let the
		// lower layers decide this. This fixes a regression that was introduced
		// in PR #14555 where !VersionPurgeStatus.Empty() is automatically
		// considered as Delete marker true to avoid listing such objects by

			mu.Lock()
			policies = append(policies, policy.toSlice()...)
			mu.Unlock()
			return nil
		}, index)
	}

	err := errors.Join(g.Wait()...)
	return policies, err
}

// policyDBGet - lower-level helper; does not take locks.
//
// If a group is passed, it returns policies associated with the group.
//
// If a user is passed, it returns policies of the user along with any groups

   * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
   * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
   * bits.
   *
   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,

*   `tf.data`

    * `tf.data` now has an `autotune_options.initial_parallelism` option to
      control the initial parallelism setting used by autotune before the data
      pipeline has started running. The default is 16. A lower value reduces
      initial memory usage, while a higher value improves startup time.

## Keras

*  `keras.layers.experimental.DynamicEmbedding`
    * Added `DynamicEmbedding` Keras layer

- Fixed the issue where pod with ordinal number lower than the rolling partitioning number was being deleted it was coming up with updated image. ([#120731](https://github.com/kubernetes/kubernetes/pull/120731), [@adilGhaffarDev](https://github.com/adilGhaffarDev)) [SIG Apps and Testing]