ConcurrentMap<String, ConcurrentMap<String, Object>> pluginContextsByKey =
                pluginContextsByProjectAndPluginKey.computeIfAbsent(projectKey, k -> new ConcurrentHashMap<>());

        String pluginKey = plugin.getPluginLookupKey();

        return pluginContextsByKey.computeIfAbsent(pluginKey, k -> new ConcurrentHashMap<>());
    }

    public ProjectDependencyGraph getProjectDependencyGraph() {

        return vertices.get(id);
    }

    public Collection<Vertex> getVertices() {
        return vertices.values();
    }

    Vertex addVertex(String label) {
        return vertices.computeIfAbsent(label, Vertex::new);
    }

    void addEdge(Vertex from, Vertex to) throws CycleDetectedException {
        from.children.add(to);
        to.parents.add(from);
        List<String> cycle = findCycle(to);

        Long existingWeight = projectWeights.get(project);
        if (existingWeight != null) {
            return existingWeight;
        }

        // Calculate weight without using computeIfAbsent to avoid recursive update issues
        long weight = calculateWeight(project);

        // Use putIfAbsent to handle concurrent access safely
        Long previousWeight = projectWeights.putIfAbsent(project, weight);

      .toList()
      .reversed()
      .joinToString(prefix = "{", postfix = "}") { "${it.key}=${it.value}" }
}

internal fun <T : Any> AtomicReference<Tags>.computeIfAbsent(
  type: KClass<T>,
  compute: () -> T,
): T {
  var computed: T? = null

  while (true) {
    val tags = get()

    // If the element is already present. Return it.

        }
    }

    private fun MutableMap<String, MutableList<String>>.addToMap(filePath: String, values: List<String>) {
        this.computeIfAbsent(filePath) { mutableListOf() }.addAll(values)
    }

        return newArtifacts;
    }

    @SuppressWarnings("unchecked")
    private Set<String> needsInlining(RepositorySystemSession session) {
        return (Set<String>) session.getData()
                .computeIfAbsent(
                        PomInlinerTransformer.class.getName() + ".needsInlining", ConcurrentHashMap::newKeySet);
    }

    @Override

    }

    public void skip() {
        skip.set(true);
        mojos.clear();
    }

    public void addMojo(MojoExecution mojo, int priority) {
        if (!skip.get()) {
            mojos.computeIfAbsent(priority, k -> new LinkedHashMap<>())
                    .put(mojo.getGoal() + ":" + mojo.getExecutionId(), mojo);
        }
    }

    public void executeAfter(BuildStep stepToExecuteBefore) {

        apiTypesBySourceName.computeIfAbsent(sourceName) {
            repository.classBytesFor(sourceName)?.let { apiTypeFor(sourceName) { it } }
        }?.invoke()
    }

    internal
    fun allTypes(): Sequence<ApiType> = open {
        repository.allClassesBytesBySourceName().map { (sourceName, classBytes) ->
            apiTypesBySourceName.computeIfAbsent(sourceName) {

        // or DiSNI-specific methods

        if (buffer.isDirect()) {
            // Assign a unique address to each buffer instance
            return bufferAddresses.computeIfAbsent(buffer, b -> addressCounter.getAndIncrement());
        } else {
            throw new IllegalArgumentException("Only direct ByteBuffers are supported for RDMA");
        }
    }

    /**

            { loader.getResourceAsStream(classFilePath).use { it!!.readBytes() } }
        }
    }

    private
    fun openJarFile(file: File) =
        openJars.computeIfAbsent(file, ::JarFile)

    override fun close() {
        openJars.values.forEach(JarFile::close)
    }
}


/**