public IngestFactory() {
        // Default constructor
    }

    /**
     * Adds an ingester to the factory.
     * The ingester is inserted into the collection and the array is re-sorted by priority.
     * This method is thread-safe.
     *
     * @param ingester the ingester to add
     */
    public synchronized void add(final Ingester ingester) {
        if (logger.isDebugEnabled()) {

	ADD	R0->28, R1           // 401e81e0
	ADD	R0@>28, R1           // 601e81e0
	ADD.S	R0<<28, R1           // 001e91e0
	ADD.S	R0>>28, R1           // 201e91e0
	ADD.S	R0->28, R1           // 401e91e0
	ADD.S	R0@>28, R1           // 601e91e0
	ADD	R0<<R1, R2, R3       // 103182e0
	ADD	R0>>R1, R2, R3       // 303182e0
	ADD	R0->R1, R2, R3       // 503182e0
	ADD	R0@>R1, R2, R3       // 703182e0

     * Adds each element of {@code elements} to the {@code ImmutableSortedMultiset}.
     *
     * @param elements the elements to add
     * @return this {@code Builder} object
     * @throws NullPointerException if {@code elements} is null or contains a null element
     */
    @CanIgnoreReturnValue
    @Override
    public Builder<E> add(E... elements) {
      for (E element : elements) {
        add(element);
      }

    }

    /**
     * Adds a new duplicate host rule to the list.
     * Initializes the list if it doesn't exist.
     *
     * @param duplicateHost the duplicate host rule to add
     */
    public void add(final DuplicateHost duplicateHost) {
        if (duplicateHostList == null) {
            duplicateHostList = new ArrayList<>();
        }
        duplicateHostList.add(duplicateHost);
    }

    /**

   * element, and the overall size of the collection, by one.
   *
   * <p>To both add the element and obtain the previous count of that element, use {@link
   * #add(Object, int) add}{@code (element, 1)} instead.
   *
   * @param element the element to add one occurrence of; may be null only if explicitly allowed by
   *     the implementation
   * @return {@code true} always, since this call is required to modify the multiset, unlike other

	ADDL $7, (BX)                           // 830307
	ADDL $7, (R11)                          // 41830307
	ADDL $7, DX                             // 83c207
	ADDL $7, R11                            // 4183c307
	ADDL DX, (BX)                           // 0113
	ADDL R11, (BX)                          // 44011b
	ADDL DX, (R11)                          // 410113
	ADDL R11, (R11)                         // 45011b

      // modify this builder, so we make a copy instead.
      this.mutableValueGraph =
          graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build();
    }

    /**
     * Adds {@code node} if it is not already present.
     *
     * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null.
     *
     * @return this {@code Builder} object
     */

      super(capacity);
    }

    /**
     * Adds {@code element} to the {@code ImmutableList}.
     *
     * @param element the element to add
     * @return this {@code Builder} object
     * @throws NullPointerException if {@code element} is null
     */
    @CanIgnoreReturnValue
    @Override
    public Builder<E> add(E element) {
      super.add(element);
      return this;
    }

    /**

				}
				for _, addr := range addrs {
					domainIPs.Add(addr)
				}
			}
			domainIPs.Add(endpoint)
		}
		updateDomainIPs(domainIPs)
	} else {
		// Add found interfaces IP address to global domain IPS,
		// loopback addresses will be naturally dropped.
		domainIPs := mustGetLocalIP4()
		for _, host := range globalEndpoints.Hostnames() {
			domainIPs.Add(host)
		}
		updateDomainIPs(domainIPs)

        request.addr = addr != null ? addr : getWINSAddress();
        request.isBroadcast = request.addr == null || isBroadcastAddress(request.addr);

        if (request.isBroadcast) {
            if (request.addr == null) {
                request.addr = this.baddr;
            }
            n = config.getNetbiosRetryCount();
        } else {
            n = 1;
        }

        do {
            try {