# slices Published articles for slices. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## Glitch Effect in Jetpack Compose DevFeed: [Glitch Effect in Jetpack Compose]() Original publisher: [Read original article]() Author: sinasamaki Published: 2025-10-11T08:00:46Z Content type: tutorial Language: en Sources: [sinasamaki]() Topics: [Jetpack Compose](), [Compose](), [Graphics](), [GUI]() Tags: [animation](), [article](), [canvas](), [compose](), [graphics](), [jetpack-compose](), [mutation](), [random](), [scale](), [slices](), [translation]() ### AI overview A tutorial on implementing a glitch effect in Jetpack Compose by drawing composable content to an offscreen buffer, slicing it horizontally, and applying randomized translations, scaling, color overlays, and timed animation. ### Source excerpt Easily apply sci-fi, cyberpunk effects on to your app ## 重新思考 Go：Slice 只是「操作视图」 DevFeed: [重新思考 Go：Slice 只是「操作视图」]() Original publisher: [Read original article]() Author: Joway Published: 2024-03-30T00:00:00Z Content type: article Language: zh Sources: [Random Thoughts]() Topics: [Go Language](), [bug]() Tags: [copy](), [gc](), [go](), [slices](), [tech]() ### AI overview This article examines Go slices as views over underlying memory rather than memory representations. It explains how subslices can retain oversized buffers, pointer elements can remain referenced after removal, and certain allocation patterns can cause unnecessary memory clearing. It concludes by discussing Go 1.21's slices package as a safer way to manipulate slices. ### Source excerpt 重新思考 Go 系列：这个系列希望结合工作中在 Go 编程与性能优化中遇到过的问题，探讨 Go 在语言哲学、底层实现和现实需求三者之间关系与矛盾。 Go 在语法级别上提供了 Slice 类型作为对底层内存的一个「操作视图」: var sh []any // ==> internal struct of []any type SliceHeader struct { Data uintptr Len int Cap int } 编程者可以使用一些近似 Python 的语法来表达对底层内存边界的控制: ## Slices Package: Clip, Clone, and Compact DevFeed: [Slices Package: Clip, Clone, and Compact]() Original publisher: [Read original article]() Published: 2023-08-18T00:00:00Z Content type: tutorial Language: en Sources: [William Kennedy]() Topics: [Library](), [Code](), [SDKs]() Tags: [apis](), [code](), [go](), [golang](), [library](), [slices](), [standard-library]() ### AI overview This tutorial explains how the Go slices package APIs Clip, Clone, and Compact work. It shows how Clip reduces a slice's capacity to its length and describes Clone as a shallow copy of the backing-array elements. ### Source excerpt Series Here are all the posts in this series about the slices package. Binary Search Clip, Clone, and Compact Compare Contains, Delete, and Equal Introduction In the first post of this series, I discussed the binary search API from the slices package that is now part of the standard library with the release of version 1.21. In this post, I will share how the Clip, Clone, and Compact APIs work. Clip The Clip API can be used to remove unused capacity from a slice. This means reducing the capacity of the slice to match its length. ## Collection like objects in python DevFeed: [Collection like objects in python]() Original publisher: [Read original article]() Published: 2020-04-15T00:00:00Z Content type: tutorial Language: en Sources: [Paweł Chudzik]() Topics: [Python](), [Programming](), [Protocol (disambiguation)](), [Code]() Tags: [behavior](), [class](), [collections](), [dsl](), [functional](), [list](), [programming-language](), [protocol](), [python](), [set](), [slices]() ### AI overview A tutorial on implementing Python collection-like objects using the collections protocol. It discusses slices and methods such as __getitem__, __setitem__, __delitem__, __iter__, __contains__, and __missing__, including how they support collection behavior and domain-specific language extensions. ### Source excerpt Collections are an important part of every programming language. In python, there is a couple of built-in collections like list, set, dictionary but I'm not going to dig into them now. In this post, I'll explore what it takes to implement collection like objects on your own using collections protocol. Read more ## Are large slices more expensive than smaller ones? DevFeed: [Are large slices more expensive than smaller ones?]() Original publisher: [Read original article]() Author: Dave Cheney Published: 2020-03-01T05:35:26Z Content type: article Language: en Sources: [Dave Cheney]() Topics: [Go Language](), [Code]() Tags: [code](), [go](), [golang](), [internals](), [performance](), [slices]() ### AI overview In Go, assigning a large slice is not more expensive than assigning a smaller slice of the same type. A slice value consists of three machine words--a pointer to its backing array, its length, and its capacity--so assigning a slice copies only those three words, regardless of the amount of data in the backing array. ### Source excerpt Programmers have a tendency to be superstitious. Particularly, when a programmer hears that copies are expensive, they start to see them everywhere, especially when they learn that, in Go, every assignment is a copy. Consider this code; x is three orders of magnitude larger than y, is the assignment of x to a more expensive [...] ## A Closer look at Slices on Android DevFeed: [A Closer look at Slices on Android]() Original publisher: [Read original article]() Published: 2018-05-31T13:11:02Z Content type: tutorial Language: en Sources: [Posts on Adam Bennett]() Topics: [Android](), [SDK](), [Google](), [App](), [Framework]() Tags: [algorithms](), [android](), [app](), [blog](), [career](), [compose](), [developer-preview](), [development](), [engineering](), [finance](), [functional](), [google](), [google-assistant](), [google-io](), [growth](), [java](), [jetpack](), [kotlin](), [money](), [opinions](), [play-store](), [sdk](), [search](), [slices](), [software](), [startups](), [thoughts](), [training](), [tutorial]() ### AI overview This article examines Android Slices introduced around the Android P Alpha release and explains their relationship to App Actions. It describes how App Actions can connect apps with Google Assistant, Search, and the Play Store, using recognized user intents and app deep links to support queries such as cryptocurrency price requests. ### Source excerpt In the lead-up to Google IO 2018 and after peering into the Android P Alpha release, some people noticed a mysterious new "Slices" class within the P SDK docs. There was a lot of speculation as to what Slices actually did, and Sebastiano Poggi at Novoda did a great deep-dive into what was known at the time. ## Go: Slice search vs map lookup DevFeed: [Go: Slice search vs map lookup]() Original publisher: [Read original article]() Author: Graham King Published: 2015-06-30T06:09:24Z Content type: article Language: en Sources: [Graham King]() Topics: [Go Language](), [Data structures](), [Benchmark]() Tags: [array](), [benchmark](), [code](), [data-structure](), [go](), [performance](), [results](), [slices](), [software]() ### AI overview A comparison of Go map lookups and slice searches finds that slices can be faster for very small collections: up to about five items for key-value lookups and ten items for integer-set lookups. Maps are generally the straightforward choice beyond those break-even points. ### Source excerpt Maps vs. slices: Choose wisely for optimal performance. ## L3 cache mapping on Sandy Bridge CPUs DevFeed: [L3 cache mapping on Sandy Bridge CPUs]() Original publisher: [Read original article]() Author: Mark Seaborn (noreply@blogger.com) Published: 2015-04-27T21:59:00Z Content type: article Language: en Sources: [Mark Seaborn]() Topics: [Cache](), [cpu](), [intel](), [systems]() Tags: [cache](), [cpu](), [hash](), [intel](), [kernel](), [memory](), [paper](), [protocol](), [rowhammer](), [side-channel](), [slices](), [xor]() ### AI overview The article explains how physical addresses map to cache sets and slices in the L3 cache of Intel Sandy Bridge CPUs. It reports a previously published mapping for four-core CPUs and presents the author's mapping for two-core CPUs, with applications to kernel ASLR analysis and row-hammering research. ### Source excerpt In 2013, some researchers reverse-engineered how Intel Sandy Bridge CPUs map physical addresses to cache sets in the L3 cache (the last-level cache). They were interested in the cache mapping because it can be used to defeat kernel ASLR. I'm interested because the cache mapping can be used to test whether cached memory accesses can do row hammering (which can cause exploitable bit flips in some DRAM devices). The researchers published the details in the paper "Practical Timing Side Channel Attacks Against Kernel Space ASLR" (Ralf Hund, Carsten Willems and Thorsten Holz). They only published the mapping for 4-core CPUs, but I have figured out the mapping for 2-core CPUs as well. Some background: On Sandy Bridge CPUs, the L3 cache is divided into slices. Physical addresses are hashed to determine which slice of the L3 cache they will be stored in. The L3 cache is distributed and ring-based. There is one slice per core, but all the cores in a CPU can access all the cache slices via a ring bus which connects all the cores and their caches together. When a core accesses a memory location, the location will be slightly slower to access if it maps to a different core's cache slice, because it would take one or two hops around the ring bus to access it. The protocol used on the ring bus is based on QPI (Intel's QuickPath Interconnect). (QPI is a protocol used for connecting multiple CPUs together on high-end multi-socket systems.) Each cache slice contains 2048 cache sets. On lower-end CPUs, cache sets are 12-way associative, so a cache slice is 1.5MB in size (2048 sets * 12 ways * 64 bytes per cache line = 1.5MB). On higher-end CPUs, cache sets are 16-way associative, so a cache slice is 2MB in size (2048 sets * 16 ways * 64 bytes per cache line = 2MB). Cache mapping The researchers (Hund et al) figured out that the L3 cache uses the bits of a physical address as follows: Bits 0-5: These give the 6-bit byte offset within a 64-byte cache line. Bits 6-16: These give the 11-b ## Three-Index Slices in Go 1.2 DevFeed: [Three-Index Slices in Go 1.2]() Original publisher: [Read original article]() Published: 2013-12-17T00:00:00Z Content type: tutorial Language: en Sources: [William Kennedy]() Topics: [Go Language](), [Code]() Tags: [ardan-labs](), [blog](), [capacity](), [code](), [go](), [go-programming](), [golang](), [index](), [programming](), [slices]() ### AI overview This tutorial explains the three-index slice feature introduced in Go 1.2. It shows how restricting a slice's capacity provides more control over append operations and protects the underlying array from unintended access. ### Source excerpt With the release of Go 1.2, slices gained the ability to specify the capacity when performing a slicing operation. This doesn't mean we can use this index to extend the capacity of the underlying array. It means we can create a new slice whose capacity is restricted. Restricting the capacity provides a level of protection to the underlying array and gives us more control over append operations. Here are the release notes and design document for the feature request: External resource on tip.golang.org: http://tip.golang.org/doc/go1.2#three_index External resource on docs.google.com: https://docs.google.com/document/d/1GKKdiGYAghXRxC2BFrSEbHBZZgAGKQ-yXK-hRKBo0Kk/pub Let's write some code to explore using the new capacity index. As with all my slice posts, I am going to use this InspectSlice function: ## Go: How slices grow DevFeed: [Go: How slices grow]() Original publisher: [Read original article]() Author: Graham King Published: 2013-12-12T04:49:00Z Content type: tutorial Language: en Sources: [Graham King]() Topics: [Go Language](), [Code]() Tags: [array](), [capacity](), [garbage-collection](), [go](), [growth](), [make](), [memory](), [slices](), [software]() ### AI overview This article explains how Go slices grow when append exceeds the backing array's capacity. It states that slices double in size up to 1024 elements, then grow by 25% per allocation, while noting that this is an implementation detail that may change. It recommends preallocating capacity when the approximate size is known to reduce allocations, copying, and garbage collection. ### Source excerpt Uncover the hidden growth patterns of Go slices. ## Iterating Over Slices In Go DevFeed: [Iterating Over Slices In Go]() Original publisher: [Read original article]() Published: 2013-09-23T00:00:00Z Content type: tutorial Language: en Sources: [William Kennedy]() Topics: [Go Language](), [Programming]() Tags: [ardan-labs](), [blog](), [code](), [go](), [go-programming](), [golang](), [programming](), [slices]() ### AI overview A tutorial on iterating over slices in Go. The supplied text introduces slices as collections used for data and discusses Go's imperative, pass-by-value model, including how pointers can affect memory use, performance, and synchronization. ### Source excerpt Slices are used everywhere in my code. If I am working with data from MongoDB, it is stored in a slice. If I need to keep track of a collection of problems after running an operation, it is stored in a slice. If you don't understand how slices work yet or have been avoiding them like I did when I started, read these two posts to learn more. External resource on ardanlabs.com: https://www.ardanlabs.com/blog/2013/08/understanding-slices-in-go-programming.html External resource on ardanlabs.com: https://www.ardanlabs.com/blog/2013/08/collections-of-unknown-length-in-go.html ## Slices of Slices of Slices in Go DevFeed: [Slices of Slices of Slices in Go]() Original publisher: [Read original article]() Published: 2013-09-10T00:00:00Z Content type: tutorial Language: en Sources: [William Kennedy]() Topics: [Go Language](), [MongoDB](), [Data structures](), [Code](), [data]() Tags: [ardan-labs](), [blog](), [code](), [data-structure](), [geospatial](), [go](), [go-programming](), [golang](), [how-to](), [mongodb](), [programming](), [slices]() ### AI overview This tutorial explains how to model nested Go slices for storing marine forecast polygons in MongoDB. It defines polygon, polygon-ring, and marine-station structures, including the nested coordinate representation required for MongoDB geospatial searches. ### Source excerpt I am working on building code to load polygons for the different Marine Forecast areas in the United States. These polygons need to be stored in MongoDB and there is a special way that needs to be done. It would not have been a big deal if it wasn't for this fact. There isn't just one polygon for each area. There is an external polygon and then zero to many interior polygons that need to be stored in relationship. After staring at the problem for a bit I realized that I needed to create a slice of Marine Forecast areas, each of which contained a slice of polygons. To store each polygon ring I needed a slice of geographic coordinates. Finally each coordinate needed to be stored in a two dimensional array of floats. A picture is worth a thousand words: ## Collections Of Unknown Length in Go DevFeed: [Collections Of Unknown Length in Go]() Original publisher: [Read original article]() Published: 2013-08-26T00:00:00Z Content type: tutorial Language: en Sources: [William Kennedy]() Topics: [Go Language](), [Programming](), [Programming language](), [data]() Tags: [ardan-labs](), [article](), [blog](), [collections](), [go](), [go-programming](), [golang](), [programming](), [programming-language](), [slices]() ### AI overview This article explains how to use Go slices for collections whose length is unknown. It concludes that slices are generally preferable to linked lists in practical cases, while noting considerations such as shared underlying arrays and related performance edge cases. ### Source excerpt If you are coming to Go after using a programming language like C# or Java, the first thing you will discover is that there are no traditional collection types like List and Dictionary. That really threw me off for months. I found a package called container/list and gravitated to using it for almost everything. Something in the back of my head kept nagging me. It didn't make any sense that the language designers would not directly support managing a collection of unknown length. Everyone talks about how slices are widely used in the language and here I am only using them when I have a well defined capacity or they are returned to me by some function. Something is wrong!! So I wrote an article earlier in the month that took the covers off of slices in a hope that I would find some magic that I was missing. I now know how slices work but at the end of the day, I still had an array that would have to grow. I was taught in school that linked lists were more efficient and gave you a better way to store large collections of data. Especially when the number of items you need to collect is unknown. It made sense to me. When I thought about using an empty slice, I had this very WRONG picture in my head: ## Understanding Slices in Go Programming DevFeed: [Understanding Slices in Go Programming]() Original publisher: [Read original article]() Published: 2013-08-15T00:00:00Z Content type: tutorial Language: en Sources: [William Kennedy]() Topics: [Go Language](), [Programming](), [Code]() Tags: [ardan-labs](), [blog](), [capacity](), [data-structure](), [function](), [go](), [go-programming](), [golang](), [make](), [programming](), [slices]() ### AI overview A tutorial explaining Go slices, including their internal structure, relationship to underlying arrays, length and capacity, creation with make and slice literals, and copying when capacity must change. ### Source excerpt Since I started programming in Go the concept and use of slices has been confusing. This is something completely new to me. They look like an array, and feel like an array, but they are much more than an array. I am constantly reading how slices are used quite a bit by Go programmers and I think it is finally time for me to understand what slices are all about.