RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/concurrentskiplistmap-put-method-in-java-with-examples/ below:

ConcurrentSkipListMap put() method in Java with Examples

Last Updated : 11 Jul, 2025

The

put()

method of

java.util.concurrent.ConcurrentSkipListMap

is an in-built function in Java which associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced.

Syntax:

public V put(K key, V value)

Parameter:

The function accepts two mandatory parameters:

key which specifies the key with which the specified value is to be associated
value: which specifies the value to be associated with the specified key.

Return Value:

The function returns the previous value associated with the specified key. If there was no mapping for the specified key, then this method returns null. Below programs illustrate the above method:

Program 1: Java


 // Java Program Demonstrate put()
// method of ConcurrentSkipListMap

import java.util.concurrent.*;

class GFG {
    public static void main(String[] args)
    {

        // Initializing the map
        ConcurrentSkipListMap<Integer, Integer>
            mpp = new ConcurrentSkipListMap<Integer,
                                            Integer>();

        // Adding elements to this map
        for (int i = 1; i <= 5; i++)
            mpp.put(i, i);

        // put() operation on the map
        System.out.println("After put(): "
                           + mpp);
    }
}

Output:

After put(): {1=1, 2=2, 3=3, 4=4, 5=5}

Program 2: Java


 // Java Program Demonstrate put()
// method of ConcurrentSkipListMap

import java.util.concurrent.*;

class GFG {
    public static void main(String[] args)
    {

        // Initializing the map
        ConcurrentSkipListMap<Integer, Integer>
            mpp = new ConcurrentSkipListMap<Integer,
                                            Integer>();

        // Adding elements to this map
        for (int i = 1; i <= 9; i++)
            mpp.put(i, i);

        // put() operation on the map
        System.out.println("After put(): "
                           + mpp);
    }
}

Output:

After put(): {1=1, 2=2, 3=3, 4=4, 5=5, 6=6, 7=7, 8=8, 9=9}

Reference: https://docs.oracle.com/javase/9/docs/api/java/util/concurrent/ConcurrentSkipListMap.html#put-K-V-

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4