You are here |
www.magnusson.io | ||
| | | |
blog.nuculabs.de
|
|
| | | | Hi ?? In this article I want to highlight a simple pattern for sorting a slice in Go on multiple keys. Given the following structure, let's say we want to sort it in ascending order after Version, Generation and Time. 1 2 3 4 5 type TheStruct struct { Generation int Time int Version int } The way we sort slices in Go is by using the sort interface or one of the sort.Slice functions. To sort the slice after the above criteria we'll call slice.Sort with the following function. | |
| | | |
www.baturin.org
|
|
| | | | ||
| | | |
ukiahsmith.com
|
|
| | | | Often times we need to unmarshal upstream data with unique constraints. Such as custom data types, or custom parsing of specific formats. Using the standard library could be impractical, and handling long structs manually can be tedious; however there is an alternative. | |
| | | |
blog.nuculabs.de
|
|
| | MalwareTech's string challenges are so easy that everyone can do them. I'm writing this article in order to help those who struggle with them, but of course you could cheat and use a debugger. The challenges can be found here: https://www.malwaretech.com/beginner-malware-reversing-challenges. The first two challenge are so easy that I'm not even bothering writing too much about them. Open strings1.exe into BN then right click data pointer twice -> FLAG. |