dlist | Type-safe single file linked list

You're correct, fs.FileInfo implement the interface fileInfo!

However, that does not mean that you can assign a value of type []fs.FileInfo to a variable typed []fileInfo - these are completely different types.

In fact - the types cannot even be converted to each other, they are laid out completely differently in memory: interface values are a pair of {concrete type,data struct pointer}, and struct values are just what you see in the struct!

So, the short answer is that you have to do something like your loop which assigns values and appends them to the slice of interface values... behind the scenes what is happening is Go is creating an interface value for each of the struct slice elements for you, automatically.

A succinct way to say this all is: "Go interfaces types are covariant with the struct types that implement them, but slices of interface values are not type-covariant with slices of structs that implement those values."

For more info on slices of structs vs. interface types, see https://www.timr.co/go-interfaces-the-tricky-parts/

You are nesting & dt::after inside & dt. Since the ampersand (&) is evaluated to be the parent selector of & dt::after, it will be evaluated to dlist dt dt::after, which fails to select any elements.

Instead of nesting the & dt::after object inside & dt, try moving the object out of & dt:

The geom_desntity has no data. Put the data in the ggplot() or in all functions.

The best solution is in the Answer by Sergey Afinogenov, a very brief one-line of code. Below are my two approaches. Not as succinct, but I will leave them here as they may prove interesting to readers.

Your code converts your strings into double or Double values. Doing so introduces the inherent inaccuracy of floating-point technology. Avoid this if you care about accuracy.

Instead, parse your input strings directly as BigDecimal objects.

You must parse your strings directly as BigDecimal. Collect those objects into a list. Sort. Then generate a new list of fresh String objects by generating a new string value for each BigDecimal. Each of these steps has been covered many time already on Stack Overflow. Search to learn more.

Alternatively, use a SortedMap/NavigableMap. Map the BigDecimal derived from each input string to that string. The keys, being BigDecimal objects (which are Comparable), are automatically sorted by mathematical order. Feed the collection produced by a call to values into the constructor of a new List to get your result.

You didn't show how you try to get random elements so you could do something what changes order back to original.

You can use random.shuffle(list) to set random order on the list.
And then you can use for item on list: ... to get items without repetition.

The problem is you have imported an incorrect class. Please look at your import statement in the class Testing.

In your insertAtHead function you aren't incrementing your list length when the list is empty. It should be:

This function execute a search task in a list dlist. the while function means that the algo will continue until pos is equal to the length of your list. To check on every elements of your list. the and not found condition check that the variable found is still False.

when the element of the list is the item to find, found = True to stop the while loop. else the pos is incremented as pos = pos + 1

the function return the boolean found and the position of the result in your list.

Use colnames<- to modify the column names. Since the object is a 1-element list containing a matrix-like object, you need to use [[1]]; if you have multiple chains you'll need to lapply() (or use a for loop) to apply the solution to every chain (i.e., every element in the list).