/**
 * Specifies the priority of a bean implementation when multiple implementations
 * of the same type are available.
 * <p>
 * Higher values indicate higher priority. When multiple implementations of the same
 * type exist, the one with the highest priority will be selected for injection.
 * <p>
 * Example usage:
 * <pre>
 * {@literal @}Priority(100)

                    && Objects.equals(priority(), phaseId.priority());
        }
    }

    @Override
    public int hashCode() {
        return Objects.hash(executionPoint(), phase(), priority());
    }

    @Override
    public String toString() {
        return executionPoint().prefix() + phase() + (priority() != 0 ? "[" + priority() + ']' : "");
    }

        int priority = Thread.NORM_PRIORITY;
        webFsIndexHelper.setIndexUpdaterPriority(priority);
        assertEquals(priority, webFsIndexHelper.indexUpdaterPriority);
    }

    @Test
    public void test_setCrawlerPriority() {
        int priority = Thread.NORM_PRIORITY;
        webFsIndexHelper.setCrawlerPriority(priority);
        assertEquals(priority, webFsIndexHelper.crawlerPriority);
    }

     *
     * @return the priority value
     */
    public int getPriority() {
        return priority;
    }

    /**
     * Sets the priority of this ingester.
     * Lower numbers indicate higher priority.
     *
     * @param priority the priority value to set
     */
    public void setPriority(final int priority) {
        this.priority = priority;
    }

    /**

  public ThreadFactoryBuilder setPriority(int priority) {
    // Thread#setPriority() already checks for validity. These error messages
    // are nicer though and will fail-fast.
    checkArgument(
        priority >= Thread.MIN_PRIORITY,
        "Thread priority (%s) must be >= %s",
        priority,
        Thread.MIN_PRIORITY);
    checkArgument(
        priority <= Thread.MAX_PRIORITY,

        newIngesters[ingesters.length] = ingester;
        Arrays.sort(newIngesters, (o1, o2) -> o1.priority - o2.priority);
        ingesters = newIngesters;
    }

    /**
     * Returns the array of registered ingesters sorted by priority.
     * The returned array contains all ingesters in priority order
     * (lower priority numbers first).
     *
     * @return the sorted array of ingesters
     */

        }
    }

    // Test class with priority tracking
    private static class PriorityTrackingBooster extends ScoreBooster {
        private static List<Integer> executionOrder = new ArrayList<>();
        private final long returnValue;

        public PriorityTrackingBooster(int priority, long returnValue) {
            this.priority = priority;
            this.returnValue = returnValue;
        }

      "00011110",
      "00011111",
      "PRIORITY",
      "END_STREAM|PRIORITY",
      "00100010",
      "00100011",
      "END_HEADERS|PRIORITY",
      "END_STREAM|END_HEADERS|PRIORITY",
      "00100110",
      "00100111",
      "00101000",
      "END_STREAM|PRIORITY|PADDED",
      "00101010",
      "00101011",
      "00101100",
      "END_STREAM|END_HEADERS|PRIORITY|PADDED",
      "00101110",

						field.Schema.Table, subName)
				}

				if (k == "UNIQUEINDEX") || settings["UNIQUE"] != "" {
					settings["CLASS"] = "UNIQUE"
				}

				priority, err := strconv.Atoi(settings["PRIORITY"])
				if err != nil {
					priority = 10
				}

				indexes = append(indexes, Index{
					Name:    name,
					Class:   settings["CLASS"],
					Type:    settings["TYPE"],
					Where:   settings["WHERE"],

eteReplication><Status>Disabled</Status></DeleteReplication><Prefix>prefix</Prefix><Priority>2</Priority><Destination><Bucket>arn:minio:replication:xxx::destinationbucket2</Bucket></Destination></Rule><Rule><Status>Enabled</Status><DeleteMarkerReplication><Status>Disabled</Status></DeleteMarkerReplication><DeleteReplication><Status>Disabled</Status></DeleteReplication><Prefix>prefix</Prefix><Priority>4</Priority><Destination><Bucket>arn:minio:replication:xxx::destinationbucket2</Bucket></Destina...