php editor Banana brought a wonderful article about the concurrent mapping of slices in golang. In this article, we will look at how to use slices for mapping operations in a concurrent environment and explain why slices are very useful in concurrent programming. By using golang's concurrency mechanism, we can access and modify slices in multiple goroutines at the same time, thereby improving the performance and efficiency of the program. Whether you are a beginner or an experienced golang developer, this article will bring you valuable knowledge and practical skills. Let's explore concurrent mapping with slices in golang!
Question content
I've been trying to solve a concurrency issue after one of the developers in the field left a few months ago, but I can't find a proper way to solve this problem.
For context, we load the customer data into a structure like this:
[ key ] -> { value }
[Customer Specific Hash] -> {Data Point/File Slice}
Example - really bad formatting, sorry:
[a60d849ad97bfb833e1096941] -> { { StartDate: '01-02-2022', EndDate: '28-02-2022', DataFrames: [1598,921578,12981,21749,192578...]}, { StartDate: '01-03-2022', EndDate: '28-03-2022', DataFrames: [1234,1567,6781,126978...]}, }
The above is because we have 100,000 customers and every night we start a process that consolidates the data based on each customer's hash (or actually a bucket). Before processing the dataframes, we iterate over the slices and "merge" the dataframes into one large dataframe that contains many legal/accounting rules.
It runs in a goroutine to index all data points as quickly as possible.
So the implementation is essentially a sync.Map[string, []DataFrame]
But I noticed that while the map operation is protected, appending to the DataFrame slice is not. Each hash probably has around 20-30 file references in that slice per night.
There's a good chance that customer data has been merged incorrectly over the past two years and I'm tasked with fixing it. Before sync.map, they again used RWMutex with Map, but not slicing, which points to this article as a guide.
First of all, is the idea of a Map containing slices an appropriate data structure?
I'm trying to create a RWMutex based tile handler but was wondering if the Map could have a chan DataFrame
instead put in when indexing the customer files and then once complete merge them in a second step into an array (such as len(chanx)
) will it be known?
I'm mainly from Java, so I might be confused with some terminology, so I'm sorry.
Solution
You have two different problems:
- Concurrency issues occurred when updating the map
- Concurrency issues when updating map entries
sync.Map
will prevent 1, but not 2.
One way to solve this problem is:
sync.Map[string, *DFrame]
where
type DFrame struct { sync.RWMutex Data []DataFrame }
Once you get the entry from the map, you should Lock
or RLock
it and then use the data. This isn't limited to just appending slices. Even if you are only reading from a dataframe, you must RLock
the structure.
So if you want to append a new dataframe:
df := &DFrame{} entry,_:=m.LoadOrStore(key, df) dfEntry:=entry.(*DFrame) dfEntry.Lock() dfEntry.Data=append(dfEntry.Data, newDataFrame) dfEntry.Unlock()
The above is the detailed content of Concurrent mapping with slices in golang. For more information, please follow other related articles on the PHP Chinese website!

Mastering the strings package in Go language can improve text processing capabilities and development efficiency. 1) Use the Contains function to check substrings, 2) Use the Index function to find the substring position, 3) Join function efficiently splice string slices, 4) Replace function to replace substrings. Be careful to avoid common errors, such as not checking for empty strings and large string operation performance issues.

You should care about the strings package in Go because it simplifies string manipulation and makes the code clearer and more efficient. 1) Use strings.Join to efficiently splice strings; 2) Use strings.Fields to divide strings by blank characters; 3) Find substring positions through strings.Index and strings.LastIndex; 4) Use strings.ReplaceAll to replace strings; 5) Use strings.Builder to efficiently splice strings; 6) Always verify input to avoid unexpected results.

ThestringspackageinGoisessentialforefficientstringmanipulation.1)Itofferssimpleyetpowerfulfunctionsfortaskslikecheckingsubstringsandjoiningstrings.2)IthandlesUnicodewell,withfunctionslikestrings.Fieldsforwhitespace-separatedvalues.3)Forperformance,st

WhendecidingbetweenGo'sbytespackageandstringspackage,usebytes.Bufferforbinarydataandstrings.Builderforstringoperations.1)Usebytes.Bufferforworkingwithbyteslices,binarydata,appendingdifferentdatatypes,andwritingtoio.Writer.2)Usestrings.Builderforstrin

Go's strings package provides a variety of string manipulation functions. 1) Use strings.Contains to check substrings. 2) Use strings.Split to split the string into substring slices. 3) Merge strings through strings.Join. 4) Use strings.TrimSpace or strings.Trim to remove blanks or specified characters at the beginning and end of a string. 5) Replace all specified substrings with strings.ReplaceAll. 6) Use strings.HasPrefix or strings.HasSuffix to check the prefix or suffix of the string.

Using the Go language strings package can improve code quality. 1) Use strings.Join() to elegantly connect string arrays to avoid performance overhead. 2) Combine strings.Split() and strings.Contains() to process text and pay attention to case sensitivity issues. 3) Avoid abuse of strings.Replace() and consider using regular expressions for a large number of substitutions. 4) Use strings.Builder to improve the performance of frequently splicing strings.

Go's bytes package provides a variety of practical functions to handle byte slicing. 1.bytes.Contains is used to check whether the byte slice contains a specific sequence. 2.bytes.Split is used to split byte slices into smallerpieces. 3.bytes.Join is used to concatenate multiple byte slices into one. 4.bytes.TrimSpace is used to remove the front and back blanks of byte slices. 5.bytes.Equal is used to compare whether two byte slices are equal. 6.bytes.Index is used to find the starting index of sub-slices in largerslices.

Theencoding/binarypackageinGoisessentialbecauseitprovidesastandardizedwaytoreadandwritebinarydata,ensuringcross-platformcompatibilityandhandlingdifferentendianness.ItoffersfunctionslikeRead,Write,ReadUvarint,andWriteUvarintforprecisecontroloverbinary


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

SublimeText3 Linux new version
SublimeText3 Linux latest version

SecLists
SecLists is the ultimate security tester's companion. It is a collection of various types of lists that are frequently used during security assessments, all in one place. SecLists helps make security testing more efficient and productive by conveniently providing all the lists a security tester might need. List types include usernames, passwords, URLs, fuzzing payloads, sensitive data patterns, web shells, and more. The tester can simply pull this repository onto a new test machine and he will have access to every type of list he needs.

ZendStudio 13.5.1 Mac
Powerful PHP integrated development environment

DVWA
Damn Vulnerable Web App (DVWA) is a PHP/MySQL web application that is very vulnerable. Its main goals are to be an aid for security professionals to test their skills and tools in a legal environment, to help web developers better understand the process of securing web applications, and to help teachers/students teach/learn in a classroom environment Web application security. The goal of DVWA is to practice some of the most common web vulnerabilities through a simple and straightforward interface, with varying degrees of difficulty. Please note that this software

Notepad++7.3.1
Easy-to-use and free code editor
