mazzie

mazzie

I have a list. I am trying to choose specific combinations from that list and making a list of list of those combinations.
My code runs something like this:

n = 6
list = [1,2,3,4,5,6]
n_list =
for i ← n..1 do
temp_list = List.delete_at(list,i-1)
[temp_list | n_list]
end

So basically i am removing one element at a time adding the resultant list to my list of list. temp_list is getting created correctly in each iteration. However that the end of the for n_list is still empty.

First 8 of 8 Posts Switch mode

wmnnd

wmnnd

Remember that in Elixir, all variables are immutable. So what you’’e doing there simply has no effect, neither on list nor on n_list. At the end of this code, list and n_list still point to the same values as they did before.

benwilson512

benwilson512

Author of Craft GraphQL APIs in Elixir with Absinthe

All data in elixir is immutable, it can’t be changed or altered. Instead you need to think about having functions that return transformed data. What should the output of this process look like?

NobbZ

NobbZ

Do I understand you correctly, that you want to have a list of tails?

So for [1,2,3] you want to have [[1,2,3],[2,3],[3],[]]?

def tails(list) when is_list(list), do: tails(list, [list])

defp tails([], acc), do: Enum.reverse(acc)
defp tails([_|t], acc), do: tails(t, [t | acc])

If I did not understand you correctly, can you please get a bit more into detail and show some sample input and expected output?

mazzie

mazzie OP

i want [[2,3],[1,3],[1,2]]

NobbZ

NobbZ

So basically this?

def foo(list) when is_list(list) do
  for i <- (Enum.count(list) - 1), do: List.delete_at(list, i)
end

The culprit is, that this is O(n²), since List.delete_at/2 is O(n) and we call it n times… I’m not sure though if one can do this in something better… Intuitively O(n) can’t be achieved, but perhaps something inbetween?


Anyway… I’m not sure what this has to do with “appending to a list” as written in the title… Can you perhaps think about it and rephrase the question?

gregvaughn

gregvaughn

Do you want something like this?

iex(1)> list = [1, 2, 3, 4, 5, 6]
[1, 2, 3, 4, 5, 6]
iex(2)> for x <- list, y <- list, x < y, do: [x,y]
[[1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [2, 3], [2, 4], [2, 5], [2, 6], [3, 4],
 [3, 5], [3, 6], [4, 5], [4, 6], [5, 6]]
mazzie

mazzie OP

I wanted to some like [[2, 3, 4, 5, 6], [1, 3, 4, 5, 6], [1, 2, 4, 5, 6], [1, 2, 3, 5, 6], [1, 2, 3, 4, 6], [1, 2, 3, 4, 5]]

I think the basic issue was due to variables being immutable. I got the solution using recursion instead of for. Some thing like this-

def my_function(i,n,list,n_list) do
  if i < n do
    n_list = my_function(i+1,n,list,n_list) ;
  end
  temp_list = List.delete_at(list,i-1) ;
  [ temp_list | n_list] ;
end

calling it using new_list = my_function(1,n,list,[]) ;

where list = [1,2,3,4,5,6]

Suggestions for corrections and improvements are welcomed :slight_smile:

NobbZ

NobbZ

You can get that result with my function shown in Appending elements to a list - #6 by NobbZ

Your function does use imperative assignement and will produce warnings in Elixir 1.4 and newer (perhaps earlier, I’m not sure exactly when this has been deprecated) and will not work anymore in 2.0.

A version that works better were this:

def foo(list) when is_list(list), do: foo(list, Enum.count(list), [])

defp foo(list, 0, acc), do: acc
defp foo(list, n, acc) when n > 0, do: foo(list, n - 1, [List.delete_at(list, n - 1) | acc])

It has the same problems according runtime as my already shown version using for.

— All posts loaded —

Where Next? Top

Trending in Questions Top

stjefim
Hello! Suppose you are building workflow (order / task / payment) processing system with the following requirements: Each workflow con...
New
jonnycharles
I’m in search of an Elixir library that offers PDF generation capabilities similar to Ruby’s Prawn. While there have been discussions abo...
New
spammy
I’m looking to build a personal workflow to quickly deploy web applications written in elixir/phoenix, for local consumption (ie not on t...
New
dli
Before I dive in myself, did anyone successfully sprinkle Hologram into their existing LiveView app? Looking for hints regarding: Addi...
New
roeland
Kia ora, We have been using elixir-google-api to connect to Google Drive. However, with the updates to Tesla due to CVEs this is now bro...
New
bottlenecked
Hi all, I wanted to ask how the community is dealing with post-release steps. Today we have Ecto migrations, which make sure that the db...
New
rahultumpala
Hello, I have an Elixir backend that implements a custom protocol over TCP. I want to load test the backend and assess the performance o...
New

Other Trending Topics Top

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
jimsynz
Beam Bots (or just BB for short) is a framework for building fault-tolerant robotics applications in Elixir using familiar OTP patterns. ...
New
Damirados
Hello everyone. After busy few months I am happy to announce v0.1.0 of Emerge &amp; Solve. They are GUI (Emerge) and State management (S...
New
netoum
Corex is an accessible, unstyled UI component library for Phoenix that integrates Zag.js state machines using Vanilla JavaScript and Live...
New
ausimian
Emily is an Elixir library that runs Nx computations on Apple’s MLX. Install it as the default Nx backend and Nx, defn, Axon, Nx.Serving,...
New
juhalehtonen
There has been a thread to discuss the Stack Overflow Developer Survey on this forum every year since 2018, so here’s yet another one for...
New

We're in Beta

About us Mission Statement