resource.setDirectory(alignToBaseDirectory(resource.getDirectory(), basedir));
            }

            if (build.getFilters() != null) {
                List<String> filters = new ArrayList<>(build.getFilters().size());
                for (String filter : build.getFilters()) {
                    filters.add(alignToBaseDirectory(filter, basedir));
                }
                build.setFilters(filters);
            }

  }

  /**
   * Returns the number of key-value mappings in this map. If the map contains more than {@code
   * Integer.MAX_VALUE} elements, returns {@code Integer.MAX_VALUE}.
   */
  public int size() {
    return map.size();
  }

  /** Returns {@code true} if this map contains no key-value mappings. */
  public boolean isEmpty() {
    return map.isEmpty();
  }

  /**

        }

        if (metadata == null) {
            result.setVersion(version);
        } else {
            List<MetadataRequest> metadataReqs =
                    new ArrayList<>(request.getRepositories().size());

            metadataReqs.add(new MetadataRequest(metadata, null, request.getRequestContext()));

            for (RemoteRepository repository : request.getRepositories()) {

            public Class<? extends Annotation> annotationType() {
                return CustomSize.class;
            }

            @Override
            public String message() {
                return "Size validation failed";
            }

            @Override
            public Class<?>[] groups() {
                return new Class<?>[0];
            }

            @Override

  public ImmutableList<E> asList() {
    ImmutableList<E> list = asList;
    return (list == null) ? (asList = createAsList()) : list;
  }

  ImmutableList<E> createAsList() {
    switch (size()) {
      case 0:
        return ImmutableList.of();
      case 1:
        return ImmutableList.of(iterator().next());
      default:
        return new RegularImmutableAsList<E>(this, toArray());
    }
  }

    private @Nullable Set<@Nullable N> visitedNodes;

    private Undirected(BaseGraph<N> graph) {
      super(graph);
      this.visitedNodes = Sets.newHashSetWithExpectedSize(graph.nodes().size() + 1);
    }

    @Override
    protected @Nullable EndpointPair<N> computeNext() {
      while (true) {
        /*
         * requireNonNull is safe because visitedNodes isn't cleared until this method calls

0;outline:0;color:#333}.bootstrap-timepicker-widget table td a:hover{text-decoration:none;background-color:#eee;-webkit-border-radius:4px;-moz-border-radius:4px;border-radius:4px;border-color:#ddd}.bootstrap-timepicker-widget table td a i{margin-top:2px;font-size:18px}.bootstrap-timepicker-widget table td input{width:25px;margin:0;text-align:center}.bootstrap-timepicker-widget .modal-content{padding:4px}@media(min-width:767px){.bootstrap-timepicker-widget.modal{width:200px;margin-left:-100px}}@media(max-wi...

            int index = Math.abs((int) (affinityKey % list.size()));
            return list.get(index);
        }

        // No affinity, use weighted random
        return selectWeightedRandom(channels);
    }

    private ChannelInfo selectAdaptive(CommonServerMessageBlock message, Collection<ChannelInfo> channels) {
        // Adaptive strategy based on message type and size

        if (isLargeTransfer(message)) {

      return head.getNextInWriteQueue() == head;
    }

    @Override
    public int size() {
      int size = 0;
      for (ReferenceEntry<K, V> e = head.getNextInWriteQueue();
          e != head;
          e = e.getNextInWriteQueue()) {
        size++;
      }
      return size;
    }

    @Override
    public void clear() {

import jakarta.validation.constraints.Size;

/**
 * The list form for Search List.
 */
public class ListForm extends SearchRequestParams {

    /**
     * Default constructor.
     */
    public ListForm() {
        super();
    }

    /** The search query string. */
    @Size(max = 1000)
    public String q;

    /** The sort field and direction. */