Properties merged = new Properties();
        if (sourceDominant) {
            merged.putAll(target.getProperties());
            merged.putAll(source.getProperties());
        } else {
            merged.putAll(source.getProperties());
            merged.putAll(target.getProperties());
        }
        target.setProperties(merged);
        target.setLocation(

                    PluginExecution existing = merged.get(key);
                    if (existing != null) {
                        mergePluginExecution(element, existing, sourceDominant, context);
                    }
                    merged.put(key, element);
                }

                target.setExecutions(new ArrayList<>(merged.values()));
            }
        }
    }

        SuggestItem merged = SuggestItem.merge(item1, item2);

        assertNotNull(merged);
        assertEquals("item1", merged.getText());
        assertEquals(150L, merged.getQueryFreq()); // Sum of frequencies
        assertEquals(75L, merged.getDocFreq()); // Sum of frequencies
        assertEquals(1.5f, merged.getUserBoost(), 0.001f); // Takes item2's boost

            metadata.storeInLocalRepository(localRepo, localRepo);
            merged = true;
        } catch (Exception e) {
            throw new RepositoryException(e.getMessage(), e);
        }
    }

    @Override
    public boolean isMerged() {
        return merged;
    }

    @Override
    public String getGroupId() {
        return emptify(metadata.getGroupId());
    }

            List<ToolchainModel> dominant, List<ToolchainModel> recessive, String recessiveSourceLevel) {
        Map<Object, ToolchainModel> merged = new LinkedHashMap<>();

        for (ToolchainModel dominantModel : dominant) {
            Object key = getToolchainModelKey(dominantModel);

            merged.put(key, dominantModel);
        }

        for (ToolchainModel recessiveModel : recessive) {

			merged = append(merged, b[0])
			b = b[1:]
		}
		if limit > 0 && len(merged) >= limit {
			break
		}
	}
	// Append anything left.
	if limit < 0 || len(merged) < limit {
		merged = append(merged, a...)
		merged = append(merged, b...)
	}
	m.o = merged
}

// filterPrefix will filter m to only contain entries with the specified prefix.
func (m *metaCacheEntriesSorted) filterPrefix(s string) {

// Merge data of two ReplicationLastHour structure
func (l ReplicationLastHour) merge(o ReplicationLastHour) (merged ReplicationLastHour) {
	if l.LastMin > o.LastMin {
		o.forwardTo(l.LastMin)
		merged.LastMin = l.LastMin
	} else {
		l.forwardTo(o.LastMin)
		merged.LastMin = o.LastMin
	}

	for i := range merged.Totals {
		merged.Totals[i] = AccElem{
			Total: l.Totals[i].Total + o.Totals[i].Total,

        Metadata recessive = read(existing);

        merge(recessive);

        write(result, metadata);

        merged = true;
    }

    @Override
    public boolean isMerged() {
        return merged;
    }

    protected abstract void merge(Metadata recessive);

    static Metadata read(Path metadataPath) throws RepositoryException {

import java.util.ArrayList;
import java.util.List;

import org.apache.maven.building.Problem;
import org.apache.maven.toolchain.model.PersistedToolchains;

/**
 * Holds the result of the merged toolchains and holds the problems during this build, if any.
 *
 * @since 3.3.0
 * @deprecated since 4.0.0, use {@code org.apache.maven.api.services.ToolchainsBuilder} instead
 */
@Deprecated(since = "4.0.0")

     * <p>This method iterates through the provided array of SuggestItem objects and merges
     * items that have the same ID. The merged items are added to a new list, which is then
     * converted back to an array and returned.</p>
     *
     * @param items an array of SuggestItem objects to be merged
     * @return an array of merged SuggestItem objects
     */
    default SuggestItem[] mergeItems(final SuggestItem[] items) {