Adding method: 1. Use the InsertBefore() function to insert an element before the specified element (mark point) in the list, the syntax is "InsertBefore(v,mark)"; 2. Use the InsertAfter() function to specify the element in the list (mark point) mark), the syntax is "InsertAfter(v,mark)"; 3. Use the PushBackList(() function to insert elements at the end of the list; 4. Use PushFrontList() to insert elements at the head of the list.
The operating environment of this tutorial: Windows 7 system, GO version 1.18, Dell G3 computer.
There are four scenarios for inserting Golang's list elements, which are: in the specified Insert before the element, insert after the specified element, insert at the head of the list and insert at the end of the list.
The method of inserting elements into the list is as shown in the following table:
Method | Function |
---|---|
InsertAfter(v interface {}, mark * Element) * Element | Insert element after mark point, The mark point is provided by other insertion functions |
InsertBefore(v interface {}, mark * Element) *Element | Inserts the element before the mark point, and the mark point is inserted by other The function provides |
PushBackList(other *List) | Add other list elements to the end |
PushFrontList(other *List) | Add other list elements to the header |
Let’s introduce it in detail below.
1. Insert an element v before the specified element in the list
Insert an element v before the node mark.
Syntax
InsertBefore(v interface {}, mark * Element) *Element
Parameters | Description |
---|---|
v | The element to be inserted. |
mark | The node of the list. |
Return value: element node.
Example: Use InsertBefore to insert an element before the specified element in the list
package main import ( "container/list" "fmt" ) func main() { //使用 InsertBefore 在列表的指定元素前插入元素 listHaiCoder := list.New() element := listHaiCoder.PushBack("Hello") element = listHaiCoder.InsertBefore("world", element) listHaiCoder.InsertBefore("你好", element) for i := listHaiCoder.Front(); i != nil; i = i.Next() { fmt.Println("Element =", i.Value) } }
Analysis:
-
We created a list listHaiCoder through list.New. Then, first use PushBack to insert an element at the end of the list, and then use
InsertBefore to insert in front of the just inserted tail element. an element.
#2. Insert an element v after the specified element in the list
Insert an element v after the node mark.
InsertAfter(v interface {}, mark * Element) *Element
Example:
package main import ( "container/list" "fmt" ) func main() { //使用 InsertAfter 在列表的指定元素后插入元素 listHaiCoder := list.New() element := listHaiCoder.PushBack("Hello") element = listHaiCoder.InsertAfter("world", element) listHaiCoder.InsertAfter("你好", element) for i := listHaiCoder.Front(); i != nil; i = i.Next() { fmt.Println("Element =", i.Value) } }
Analysis:
We created a list listHaiCoder through list.New, Then, first use PushBack to insert an element at the end of the list, and then use
InsertAfter to insert an element after the just inserted tail element.
3. Insert an element v at the head of the list
Insert an element v at the head of the list.
PushFront(v interface{}) *Element
Example: Use PushFront to insert elements at the head of the list
package main import ( "container/list" "fmt" ) func main() { //使用 PushFront 在列表头部插入元素 listHaiCoder := list.New() listHaiCoder.PushFront("Hello") listHaiCoder.PushFront("HaiCoder") for i := listHaiCoder.Front(); i != nil; i = i.Next() { fmt.Println("Element =", i.Value) } }
Analysis:
We pass the list .New creates a list listHaiCoder, and then uses the PushFront function to insert two consecutive elements at the head of the list. Because we are using head insertion, the last inserted element is at the front.
Finally, when we traverse all the elements in the list, we find that the last inserted element is at the front.
4. Insert an element v at the end of the list.
Insert an element v at the end of the list.
PushBack(v interface{}) *Element
Example: Use PushBack to insert elements at the end of the list
package main import ( "container/list" "fmt" ) func main() { //使用 PushBack 在列表尾部插入元素 listHaiCoder := list.New() listHaiCoder.PushBack("Hello") listHaiCoder.PushBack("HaiCoder") for i := listHaiCoder.Front(); i != nil; i = i.Next() { fmt.Println("Element =", i.Value) } }
Analysis: We created a list listHaiCoder through list.New, and then used the PushBack function in Two elements are inserted consecutively at the end of the list. Because we are using tail insertion, the last inserted element is at the end and the first inserted element is at the front.
【Related recommendations: Go video tutorial, Programming teaching】
The above is the detailed content of How to add list elements in golang. For more information, please follow other related articles on the PHP Chinese website!

Go's "strings" package provides rich features to make string operation efficient and simple. 1) Use strings.Contains() to check substrings. 2) strings.Split() can be used to parse data, but it should be used with caution to avoid performance problems. 3) strings.Join() is suitable for formatting strings, but for small datasets, looping = is more efficient. 4) For large strings, it is more efficient to build strings using strings.Builder.

Go uses the "strings" package for string operations. 1) Use strings.Join function to splice strings. 2) Use the strings.Contains function to find substrings. 3) Use the strings.Replace function to replace strings. These functions are efficient and easy to use and are suitable for various string processing tasks.

ThebytespackageinGoisessentialforefficientbyteslicemanipulation,offeringfunctionslikeContains,Index,andReplaceforsearchingandmodifyingbinarydata.Itenhancesperformanceandcodereadability,makingitavitaltoolforhandlingbinarydata,networkprotocols,andfileI

Go uses the "encoding/binary" package for binary encoding and decoding. 1) This package provides binary.Write and binary.Read functions for writing and reading data. 2) Pay attention to choosing the correct endian (such as BigEndian or LittleEndian). 3) Data alignment and error handling are also key to ensure the correctness and performance of the data.

The"bytes"packageinGooffersefficientfunctionsformanipulatingbyteslices.1)Usebytes.Joinforconcatenatingslices,2)bytes.Bufferforincrementalwriting,3)bytes.Indexorbytes.IndexByteforsearching,4)bytes.Readerforreadinginchunks,and5)bytes.SplitNor

Theencoding/binarypackageinGoiseffectiveforoptimizingbinaryoperationsduetoitssupportforendiannessandefficientdatahandling.Toenhanceperformance:1)Usebinary.NativeEndianfornativeendiannesstoavoidbyteswapping.2)BatchReadandWriteoperationstoreduceI/Oover

Go's bytes package is mainly used to efficiently process byte slices. 1) Using bytes.Buffer can efficiently perform string splicing to avoid unnecessary memory allocation. 2) The bytes.Equal function is used to quickly compare byte slices. 3) The bytes.Index, bytes.Split and bytes.ReplaceAll functions can be used to search and manipulate byte slices, but performance issues need to be paid attention to.

The byte package provides a variety of functions to efficiently process byte slices. 1) Use bytes.Contains to check the byte sequence. 2) Use bytes.Split to split byte slices. 3) Replace the byte sequence bytes.Replace. 4) Use bytes.Join to connect multiple byte slices. 5) Use bytes.Buffer to build data. 6) Combined bytes.Map for error processing and data verification.


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

MantisBT
Mantis is an easy-to-deploy web-based defect tracking tool designed to aid in product defect tracking. It requires PHP, MySQL and a web server. Check out our demo and hosting services.

Atom editor mac version download
The most popular open source editor

MinGW - Minimalist GNU for Windows
This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.

Dreamweaver Mac version
Visual web development tools

Zend Studio 13.0.1
Powerful PHP integrated development environment
