func (store *IAMStoreSys) ListGroups(ctx context.Context) (res []string, err error) {
	cache := store.lock()
	defer store.unlock()

	return store.updateGroups(ctx, cache)
}

// listGroups - lists groups - fetch groups from cache
func (store *IAMStoreSys) listGroups(ctx context.Context) (res []string, err error) {
	cache := store.rlock()
	defer store.runlock()

}

// replayItems - Reads the items from the store and replays.
func replayItems[I any](store Store[I], doneCh <-chan struct{}, log logger, id string) <-chan Key {
	keyCh := make(chan Key)

	go func() {
		defer xioutil.SafeClose(keyCh)

		retryTicker := time.NewTicker(retryInterval)
		defer retryTicker.Stop()

		for {
			for _, key := range store.List() {
				select {
				case keyCh <- key:

		logger.Info("IAM expired STS purge took %.2fs", took)
	}

	// Store the newly populated map in the iam cache. This takes care of
	// removing stale entries from the existing map.
	cache.iamSTSAccountsMap = stsAccountsFromStore

	stsAccPoliciesFromStore.Range(func(k string, v MappedPolicy) bool {
		cache.iamSTSPolicyMap.Store(k, v)
		return true
	})

	return nil
}

	var p MappedPolicy
	err := ies.loadIAMConfig(ctx, &p, getMappedPolicyPath(name, userType, isGroup))
	if err != nil {
		if err == errConfigNotFound {
			return errNoSuchPolicy
		}
		return err
	}
	m.Store(name, p)
	return nil
}

func getMappedPolicy(kv *mvccpb.KeyValue, m *xsync.MapOf[string, MappedPolicy], basePrefix string) error {
	var p MappedPolicy
	err := getIAMConfig(&p, kv.Value, string(kv.Key))

labels.crawling_info_DataCrawlExecTime=Crawl Execution Time (Data Store)
labels.crawling_info_DataCrawlStartTime=Crawl Start Time (Data Store)
labels.crawling_info_DataCrawlEndTime=Crawl End Time (Data Store)
labels.crawling_info_DataIndexExecTime=Indexing Execution Time (Data Store)
labels.crawling_info_DataIndexSize=Index Size (Data Store)
labels.webauth_configuration=Web Authentication
labels.webauth_list_hostname=Hostname

   *
   * @param value any value in the range of the {@code short} type
   * @return the {@code short} value that equals {@code value}
   * @throws IllegalArgumentException if {@code value} is greater than {@link Short#MAX_VALUE} or
   *     less than {@link Short#MIN_VALUE}
   */
  public static short checkedCast(long value) {
    short result = (short) value;

labels.crawling_info_DataCrawlExecTime=Crawl Execution Time (Data Store)
labels.crawling_info_DataCrawlStartTime=Crawl Start Time (Data Store)
labels.crawling_info_DataCrawlEndTime=Crawl End Time (Data Store)
labels.crawling_info_DataIndexExecTime=Indexing Execution Time (Data Store)
labels.crawling_info_DataIndexSize=Index Size (Data Store)
labels.webauth_configuration=Web Authentication
labels.webauth_list_hostname=Hostname

    /** SMB2 lock file command */
    protected static final short SMB2_LOCK = 0x000A;
    /** SMB2 IO control command */
    protected static final short SMB2_IOCTL = 0x000B;
    /** SMB2 cancel command */
    protected static final short SMB2_CANCEL = 0x000C;
    /** SMB2 echo/keepalive command */
    protected static final short SMB2_ECHO = 0x000D;
    /** SMB2 query directory command */

}

// Del - Deletes an entry from the store.
func (store *QueueStore[_]) Del(key Key) error {
	store.Lock()
	defer store.Unlock()
	return store.del(key)
}

// Len returns the entry count.
func (store *QueueStore[_]) Len() int {
	store.RLock()
	l := len(store.entries)
	defer store.RUnlock()
	return l
}

// lockless call
func (store *QueueStore[_]) del(key Key) error {

     *
     * @param buf the byte array to use as the buffer
     * @param start the starting position in the buffer
     */
    public NdrBuffer(final byte[] buf, final int start) {
        this.buf = buf;
        this.start = index = start;
        length = 0;
        deferred = this;
    }

    /**
     * Creates a derived NdrBuffer at the specified index position.