*
   * <p>Changes to the returned map will update the underlying table, and vice versa.
   *
   * @param columnKey key of column to search for in the table
   * @return the corresponding map from row keys to values
   */
  Map<R, V> column(@ParametricNullness C columnKey);

  /**
   * Returns a set of all row key / column key / value triplets. Changes to the returned set will

    }

    @Test
    void testMultipleUpdates() {
        // Test multiple update calls
        HMACT64 hmac1 = new HMACT64(TEST_KEY);
        HMACT64 hmac2 = new HMACT64(TEST_KEY);

        // Update hmac1 all at once
        hmac1.engineUpdate(TEST_DATA, 0, TEST_DATA.length);

        // Update hmac2 byte by byte
        for (byte b : TEST_DATA) {
            hmac2.engineUpdate(b);
        }

	DB.Model(&hamster).Association("PreferredToy").Find(&hamsterToy)
	if hamsterToy.Name != "bike 2" {
		t.Errorf("Should update has one polymorphic association with Append")
	}

	hamsterToy = Toy{}
	DB.Model(&hamster).Association("OtherToy").Find(&hamsterToy)
	if hamsterToy.Name != "treadmill 2" {
		t.Errorf("Should update has one polymorphic association with Append")
	}

	if DB.Model(&hamster2).Association("PreferredToy").Count() != 1 {

          totalBytesWritten += byteCount;
          progressListener.update(totalBytesWritten, contentLength(), completed);
        }

        @Override
        public void close() throws IOException {
          super.close();
          if (!completed) {
            completed = true;
            progressListener.update(totalBytesWritten, contentLength(), completed);
          }
        }
      };

    @Override
    void compareAndSetSeenExceptions(
        AggregateFutureState<?> state, @Nullable Set<Throwable> expect, Set<Throwable> update) {
      seenExceptionsUpdater.compareAndSet(state, expect, update);
    }

    @Override
    int decrementAndGetRemainingCount(AggregateFutureState<?> state) {
      return remainingCountUpdater.decrementAndGet(state);
    }

- **Features**: Access control, file type filtering

**Data Store Crawling**:
- **Admin Path**: Crawler > Data Store
- **Supports**: Databases (via JDBC), CSV files, custom plugins
- **Features**: Incremental updates, custom field mapping

---

## Configuration Migration

### Exporting Current Configuration

**Via Admin UI**:
1. Navigate to **System > Backup**
2. Select configuration items to export:

async def read_user_item(
    user_id: int, item_id: str, q: str | None = None, short: bool = False
):
    item = {"item_id": item_id, "owner_id": user_id}
    if q:
        item.update({"q": q})
    if not short:
        item.update(
            {"description": "This is an amazing item that has a long description"}
        )

    return (initialCapacity == UNSET_INT) ? DEFAULT_INITIAL_CAPACITY : initialCapacity;
  }

  /**
   * Guides the allowed concurrency among update operations. Used as a hint for internal sizing. The
   * table is internally partitioned to try to permit the indicated number of concurrent updates
   * without contention. Because assignment of entries to these partitions is not necessarily

    tags_schema = {"default": [], "title": "Tags"}
    if mod_name.startswith("tutorial001"):
        tags_schema.update(UNTYPED_LIST_SCHEMA)
    elif mod_name.startswith("tutorial002"):
        tags_schema.update(LIST_OF_STR_SCHEMA)
    elif mod_name.startswith("tutorial003"):
        tags_schema.update(SET_OF_STR_SCHEMA)

    response = client.get("/openapi.json")
    assert response.status_code == 200, response.text

// Package callbacks provides the default callback functions for GORM operations such as create, query, update, and delete.
package callbacks

import (
	"gorm.io/gorm"
)

var (
	createClauses = []string{"INSERT", "VALUES", "ON CONFLICT"}
	queryClauses  = []string{"SELECT", "FROM", "WHERE", "GROUP BY", "ORDER BY", "LIMIT", "FOR"}
	updateClauses = []string{"UPDATE", "SET", "WHERE"}
	deleteClauses = []string{"DELETE", "FROM", "WHERE"}
)