Serendipity

Free AI web copilot to create summaries, insights and extended knowledge, download it at here

3474

Abstract

w <code>SafeMap</code>.</li></ul><h1 id="f98e">Step 4: Set Method</h1>Now, let’s create a method to set key-value pairs in our map. Add this code to the <code>SafeMap</code> struct:<div id="3d52"><pre>// Set sets a key-value pair in the map. func (m *SafeMap) Set(key string, value int) { m.mu.Lock() defer m.mu.Unlock() m.data[key] = value }</pre></div><ul><li>We define a method called <code>Set</code> that takes a key and a value as parameters.</li><li><code>m.mu.Lock()</code> locks the mutex to ensure exclusive access to the map.</li><li>We use <code>defer</code> to ensure that the mutex is unlocked even if an error occurs or the function returns.</li><li>Finally, we set the key-value pair in the map.</li></ul><h1 id="a568">Step 5: Get Method</h1>Let’s create a method to retrieve values based on keys. Add this code:<div id="2071"><pre>// Get retrieves the value associated with a key. func (m *SafeMap) Get(key string) (int, bool) { m.mu.Lock() defer m.mu.Unlock() val, ok := m.data[key] return val, ok }</pre></div><ul><li>We define a method called <code>Get</code> that takes a key as a parameter and returns both the value and a boolean indicating if the key exists.</li><li>We lock the mutex, retrieve the value from the map, and unlock the mutex before returning the result.</li></ul><h1 id="9e28">Step 6: Delete Method</h1>To delete key-value pairs, add the following code:<div id="569d"><pre>// Delete removes a key-value pair from the map. func (m *SafeMap) Delete(key string) { m.mu.Lock() defer m.mu.Unlock() delete(m.data, key) }</pre></div><ul><li>We define a method called <code>Delete</code> that removes a key-value pair based on the provided key.</li><li>Similar to other methods, we lock the mutex, perform the deletion, and unlock the mutex.</li></ul><h1 id="e8e5">Step 7: Size Method</h1>Let’s create a method to determine the size of the map:<div id="f476"><pre>// Size returns the number of key-value pairs in the map. func (m *SafeMap) Size() int { m.mu.Lock() defer m.mu.Unlock() return len(m.data) }</pre></div><ul><li>We define a method called <code>Size</code> that returns the number of key-value pairs in the map.</li><li>As with other methods, we lock the mutex, obtain the size, and unlock the mutex.</li></ul><h1 id="4996">Step 8: Putting It All Together</h1>Now that we’v

Options

e defined our custom thread-safe map, let’s put it to use:<div id="327a"><pre>func main() { // Create a new thread-safe map. safeMap := NewSafeMap()

// Set key-value pairs concurrently. wg := sync.WaitGroup{} for i := 0; i < 100; i++ { wg.Add(1) go func(i int) { defer wg.Done() key := fmt.Sprintf("key%d", i) safeMap.Set(key, i) }(i) } wg.Wait()

// Get and print values concurrently. for i := 0; i < 100; i++ { wg.Add(1) go func(i int) { defer wg.Done() key := fmt.Sprintf("key%d", i) val, ok := safeMap.Get(key) if ok { fmt.Printf("Key: %s, Value: %d\n", key, val) } else { fmt.Printf("Key: %s not found\n", key) } }(i) } wg.Wait()

// Delete keys concurrently. for i := 0; i < 50; i++ { wg.Add(1) go func(i int) { defer wg.Done() key := fmt.Sprintf("key%d", i) safeMap.Delete(key) }(i) } wg.Wait()

// Print the final size of the map. size := safeMap.Size() fmt.Printf("Map size: %d\n", size) }</pre></div><ul><li>In the <code>main</code> function, we create an instance of our <code>SafeMap</code>.</li><li>We set key-value pairs concurrently using goroutines.</li><li>We retrieve and print values concurrently.</li><li>We delete keys concurrently.</li><li>Finally, we print the size of the map.</li></ul><h1 id="d1df">Conclusion</h1>You’ve just created a custom thread-safe map in Go! This example demonstrates the basics of using mutexes to protect concurrent access to data structures. Understanding these concepts is crucial for building reliable concurrent programs in Go.Feel free to explore my repository at <a href="https://github.com/parv-jain/thread-safe-data-structures">https://github.com/parv-jain/thread-safe-data-structures</a> where I plan to delve deeper into and experiment with the implementation of thread-safe data structures in Go.</article></body>