belteconti

belteconti

I know we can create somewhat of a similar function to a while loop using recursion and case keyword. However, how can we create a while loop with multiple conditions such as the following in Elixir:

a = [1,2,3,4,5]
b = [5,4,3,2,1]
i = 0
while (length(a) > 0 and a[length(a)-1] == b[i]){
      a.pop()
      i += 1
    }

A noob at this so any help would be appreciated. Thank you!

Showing Posts 1 to 2

Aetherus

Aetherus

TL; DR you can’t.

In Elixir, everything is immutable, so even if there is a.pop(), it won’t work as you expected.

According to your code, I guess what you want to do is find the index of the first pair of identical elements from reversed a and b. If I’m right, then the code can be

a = [1,2,3,4,5]
b = [5,4,3,2,1]

i =
  a
  |> Enum.reverse()
  |> Enum.zip(b)
  |> Enum.find_index(fn {ea, eb} -> ea == eb end)
kip

kip

ex_cldr Core Team

Echoing everything @Aetherus said, with a similar example but just using recursion:

defmodule Match do
  @a [1,2,3,4,5]
  @b [5,4,3,2,1]

  # Elixir has lists, not arrays, and therefore
  # its O(n) to access elements and typically this
  # is not what you want. For this example, reversing
  # the second list once is far more efficient
  def reverse(a \\ @a, b \\ @b) do
    a
    |> :lists.reverse()
    |> reverse(b, 0)
  end

  # length(a) == 0
  def reverse([], _, count) do
    count
  end

  # the head of each list is the same fulfilling
  # a[length(a)-1] == b[I]
  # notice we are pattern matching the head of each list
  # and proceeding only if they are the same
  def reverse([first | a_rest], [first | b_rest], count) do
    reverse(a_rest, b_rest, count + 1)
  end

  # When the head of the lists no longer match we return
  def reverse(_, _, count) do
    count
  end
end
— All posts loaded —

Where Next? Top

Trending in Questions Top

katta
I having some trouble figuring out if I have set myself too strict of standards for my production server. Currently I can handle 75% of r...
New
brecabral
Documentation While reading the Scoped Routes section, I noticed that the documentation currently refers to a problem without explainin...
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
kpanic
Hi everyone, I am toying with the idea of building a “match maker” for giving personal help to people that wants to start coding. I sta...
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
asweet-confluent
I recently noticed that Elixir’s Logger defaults its primary log level to :debug when no :logger, :level application configuration is pre...
New
apz
I’m new to elixir and just tried to install the elixirLS extension for VScode(ium) and it is throwing some errors that I would like help ...
New

Other Trending Topics Top

GenericJam
Edit: 2026 May 15 - This post is archived. Mob is alive!! Main docs: mob v0.7.11 — Documentation A bit of explanation for the slightly c...
New
JesseHerrick
Hey, I’m Jesse and I’m the main contributor behind Dexter, a full-featured, lightning-fast Elixir LSP optimized for large codebases. It s...
New
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
garrison
Hobbes is a low-level distributed database for the Elixir programming language. Hobbes provides a simple, safe, and scalable storage lay...
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
budgie
A little off-topic, but I feel like people here have a good head on their shoulders. I used to be quite good at making software. Was luc...
New

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews