Skip to main content
SimilarExport ZIP
100%

[Golang实现自定义sort接口(根据结构值排序)] #golang #sort

✓ Published0🌍 Public
LLaughingVzr
Last edited Jul 11, 2018
Created on Jul 11, 2018

This example demonstrates custom sorting of a Go structure by value, specifically ordering nodes by their count in descending order. It defines a `node` type with key and count fields, then implements the `sort.Interface` methods—`Len`, `Less`, and `Swap`—on a `nodeList` slice to enable native `sort` package functionality. The `SortPatten` function converts a `map[string]int` into a `nodeList`, which is then sorted using the custom comparator. The code shows how to adapt arbitrary map data into a sortable collection without external libraries, relying solely on Go’s standard `sort` package.

AI-generated description

Similar vizzes

Loading thumbnail…

struct operators

This example demonstrates sorting an array of 25 `stringStruct` objects, each containing a single-character string, into ascending alphabetical order. It shows three different sorting approaches using the C++ Standard Library’s `std::sort` algorithm: one with a custom functor (`sorter`), one with a lambda, and one with a template function. The code defines custom operators for comparing `stringStruct` instances and pointers, and overloads the stream insertion operator for output. The program prints the sorted sequence to the console, highlighting how operator overloading and custom comparators integrate with generic algorithms.

NN0taN3rd
56% match
Loading thumbnail…

Gist 810577150f4b252e8faa69e7060bf3af

This example presents a Clojure visualization of a custom sorting algorithm called `sorting-sort`. The code defines two functions: `remove-one`, which removes a specified item from a list using `split-with` and `rest`, and `sorting-sort`, which iteratively finds the minimum value in an unsorted collection via `apply min`, removes it, and appends it to a sorted vector within a `loop`/`recur` construct. The visualization likely animates this selection-sort-like process, though no graphical library is shown; the gist contains only the algorithmic logic without any rendering or charting API.

66ewis
52% match
Loading thumbnail…

sortArrayByKey.js

This example demonstrates a reusable utility for sorting arrays of objects by nested properties, such as `letter` or `values.value2`. The function `sortArrayByKey` first maps each element to extract the target value via dot-notation path traversal, then sorts the mapped indices using a comparator that handles string and numeric comparisons, and finally returns the reordered original objects. It uses plain JavaScript array methods (`map`, `sort`) without external libraries, and the included example generates random test data with `Math.random` to show sorting across different key depths.

MMAKIO135
51% match
Loading thumbnail…

JavaScript Arrays

This example demonstrates how to sort an array of objects by a key using D3’s `ascending` comparator within a JavaScript `sort()` method. The code defines three entries with keys and values, then logs the sorted array to the console. It relies on the D3 library version 7.8.5, importing the `ascending` function from the `d3` module. The example highlights a concise alternative to manual comparator logic, with commented-out code showing a `reduce` operation for future object transformation.

Aa0x0
50% match
Loading thumbnail…

JavaScript Arrays

This example demonstrates how JavaScript’s built-in array methods can transform and organize data, specifically by sorting an array of objects by their `key` property. It shows the result of calling `entries.sort((a,b) => a.key < b.key ? -1:1)`, which arranges the entries alphabetically by key. The code also includes commented-out examples of `filter`, `map`, `reduce`, and numeric sorting with comparator functions, illustrating pitfalls like lexicographic sorting of numbers. The implementation relies solely on native JavaScript array APIs, with no external libraries or rendering, outputting results to the console.

Kkwambokar
48% match
Loading thumbnail…

Sequential Sort in Snap!

This example demonstrates a sequential sort algorithm implemented in Snap!, a block-based programming environment. The code defines a reporter block that repeatedly scans an unsorted list to find the largest remaining item, inserts it at the front of a new sorted list, and deletes it from the original. The visualization shows the step-by-step process of building the sorted list. The implementation uses Snap! custom blocks, list operations like `reportListLength`, `reportListItem`, `doInsertInList`, and `doDeleteFromList`, along with nested loops and conditional logic. No external JavaScript libraries are used; the data source is the input list provided by the user.

CCliffordAnderson
48% match
Loading thumbnail…

d3-indented-tree API example #32

This example demonstrates how node sorting can be re-applied in a d3-indented-tree chart. It initially renders a tree from CSV-like data embedded in an aside element, then after a two-second delay, triggers a resort using the `nodeSort` method with the `num` key, ascending order, and height-aware grouping. The code uses the d3-indented-tree API built on D3 v6, with `d3.indentedTree` initializing the chart and `linkLabel` setting the edge labels. The `convertTypes` option is set to "none," causing all columns to remain strings, which influences the lexical sorting behavior.

EEE2dev
48% match
Loading thumbnail…

d3-indented-tree API example #33

This example demonstrates how to reorder tree nodes after initial rendering, using the `nodeSort` method to sort by the `size1` column. The chart is built with the d3-indented-tree API, which parses semicolon-delimited data from an HTML `<aside>` element into hierarchical levels. A `convertTypes` function explicitly converts `size1`, `size2`, and `size3` from strings to numeric values, while `linkLabel` displays the `size1` value as an edge label. After a two-second delay, `nodeSort("size1")` triggers the re-sort, showing dynamic updates to the tree layout.

EEE2dev
48% match