single process running those previous steps *even* if afterwards, you start **multiple processes** (multiple workers) for the application itself. If those steps were run by **multiple processes**, they would **duplicate** the work by running it in **parallel**, and if the steps were something delicate like a database migration, they could cause conflicts with each other.

Of course, there are some cases where there's no problem in running the previous steps multiple times, in that case, it's...

		{"VADDPD.A.A X0, X1, X2", `unknown suffix "A"; duplicate suffix "A"`},
		{"VADDPD.A.A.A X0, X1, X2", `unknown suffix "A"; duplicate suffix "A"`},
		{"VADDPD.A.B X0, X1, X2", `unknown suffix "A"; unknown suffix "B"`},
		{"VADDPD.Z.A X0, X1, X2", `Z suffix should be the last; unknown suffix "A"`},
		{"VADDPD.Z.Z X0, X1, X2", `Z suffix should be the last; duplicate suffix "Z"`},

    collection = getSubjectGenerator().create(arrayAndDuplicate.elements);
    E duplicate = arrayAndDuplicate.duplicate;

    assertTrue(
        "removeAll(intersectingCollection) should return true",
        getList().removeAll(MinimalCollection.of(duplicate)));
    assertFalse(
        "after removeAll(e), a collection should not contain e even "

    collection = getSubjectGenerator().create(arrayAndDuplicate.elements);
    E duplicate = arrayAndDuplicate.duplicate;

    assertTrue(
        "removeAll(intersectingCollection) should return true",
        getList().removeAll(MinimalCollection.of(duplicate)));
    assertFalse(
        "after removeAll(e), a collection should not contain e even "

  ASSERT_EQ(TF_GetCode(status.get()), TF_OK) << TF_Message(status.get());

  const char* device_name = "/job:localhost/replica:0/task:0/device:CUSTOM:0";
  const char* first_device_name =
      "/job:localhost/replica:0/task:0/device:CPU:0";
  const char* second_device_name =
      "/job:localhost/replica:0/task:0/device:CPU:1";
  std::array<const char*, 2> underlying_devices{first_device_name,

labels.pathmap_pt_displaying=Displaying
labels.pathmap_pt_both=Crawling/Displaying
labels.pathmap_pt_stored=Stored URLs
labels.regular_name=Regular Name
labels.duplicate_name=Duplicate Name
labels.duplicate_host_configuration=Duplicate Host
labels.duplicate_host_title_details=Duplicate Host
labels.dashboard_title_configuration=System Configuration
labels.suggest_search_log_enabled=Suggest from Search Words

�EcBSize��EcIndex�EcDist�
�CSumAlgo
�PartNums�
�PartETags��PartSizes��	ը�PartASizes��	ը�Size�	ը�MTime�������MetaSys��x-minio-internal-replica-status�REPLICA�"x-minio-internal-replica-timestamp�2022-03-20T15:17:01.730949636Z�MetaUsr��content-type�application/octet-stream�x-amz-storage-class�STANDARD�X-Amz-Replication-Status�REPLICA�etag� 9587ddd31fead633830366f45d221d56�j��...

N�EcBSize��EcIndex�EcDist�
�CSumAlgo
�PartNums�
�PartETags��PartSizes��	ը�PartASizes��	ը�Size�	ը�MTime�����çMetaSys��x-minio-internal-replica-status�REPLICA�"x-minio-internal-replica-timestamp�2022-03-20T15:15:01.584169645Z�MetaUsr��content-type�application/octet-stream�x-amz-storage-class�STANDARD�X-Amz-Replication-Status�REPLICA�etag� 9587ddd31fead633830366f45d221d56�;��...

			opts:           ObjectOpts{Name: "c1test", DeleteMarker: false, OpType: ObjectReplicationType, Replica: false}, // 1. Replica mod sync enabled; not a replica
			expectedResult: true,
		},
		// case 2 - rule with replica modification disabled; a replica
		{

    // If there are no duplicate keys, hashTablePlus is the final hashTable value. If there *are*
    // duplicate keys, hashTablePlus consists of 3 elements: [0] the hashTable; [1] the number of
    // entries in alternatingKeysAndValues that are still valid after rewriting to remove
    // duplicates; [2] a Builder.DuplicateKey that records the first duplicate key we encountered