brettbeatty

brettbeatty

Many of the higher order functions in Enum reduce a list (or other enumerable) into another, reversed list then reverse it back to the original order. When several of these functions are chained together, the list is reversed at every step. Sometimes the order needs reversed anyway, and sometimes the order is even unimportant.

I have for a while envisioned a “maybe-reversed list” structure that would keep track of whether it was in original or reversed order. Several operations could be performed on it, just reducing a new list and flipping the order flag, then the correct order could be selected when converting back to a regular list. Is there an established name for such a structure? I’m having a hard time finding much.

In my head I’ve been calling this a “twist” because it rhymes with “list” and invokes imagery in my head of turning the list over again and again (which is what it’s doing between steps even if the end result is actually fewer reversals).

Showing Posts 1 to 2

dimitarvp

dimitarvp

I don’t see why the reversal should be the property that’s encoded in the name. IMO maybe_ordered_list works better and you can always prepend not to this moniker for the goal that you have in mind here.

al2o3cr

al2o3cr

You could call it a tsil, after the pattern of naming “other end” things backwards from Purely Functional Data Structures (also the inspiration for the stdlib :queue module). :man_shrugging:

FWIW, I suspect that the “don’t reverse intermediate lists” approach might only have a narrow window of list sizes where it’s a performance advantage over a “never construct intermediate lists” approach using Stream.

— All posts loaded —

Where Next? Top

Trending in Questions Top

RSP87
I’m working on a project that simulates the bumbl example in the programming phoenix book. It acts almost like an email client. We have a...
New
nseaSeb
Hello, I know there is an approach for handling lists that allows for optimized traversal, but I can’t recall the specific method (somet...
New
RemyXRenard
I’m seeing that a list inside a Kino.DataTable will be interpreted as a charlist, even if the Kino.configure() is set to charlists: :as_l...
New
brecabral
Documentation While reading the Scoped Routes section, I noticed that the documentation currently refers to a problem without explainin...
New
velrest
So my question is quite simple and i have found no conclusive answer on forum, google or AI. Should we use :erlang.float for Integer to ...
New
samoloth
Hi, I’ve just set up an application with ash_authentication. There is only magic link strategy for now, so there is no confirmation add o...
New
FlyingNoodle
If a change or preparation module uses Ash.Changeset.get_argument/2 or Ash.Query.get_argument/2 (or any of the other get_argument functio...
New

Other Trending Topics Top

mudasobwa
I am happy to introduce the very α version of the new programming language compiled to BEAM. Welcome Cure. It has literally three kille...
New
marciok
Hi there! We created Gust: A task orchestrator inspired by Airflow. For those who have never heard about Aiflow, it’s a Python-based wor...
New
mhanberg
Hi everyone! The first release candidate for the Expert language server project is now available! We’ve published a press release detai...
New
jimsynz
Beam Bots (or just BB for short) is a framework for building fault-tolerant robotics applications in Elixir using familiar OTP patterns. ...
New
Dmk
Xamal is a deployment tool for Elixir apps that deploys native releases to bare metal servers over SSH. It’s a port of GitHub - basecamp/...
New
netoum
Corex is an accessible, unstyled UI component library for Phoenix that integrates Zag.js state machines using Vanilla JavaScript and Live...
New

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews