Maxximiliann

Maxximiliann

trades = 
%{
  "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2" => [
    %{
      asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2",
      last_price: 0.09019287,
      priced_in: "WAVES",
      volume: 13918.3182330112
    },
    %{
      asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2",
      last_price: 0.1313214,
      priced_in: "DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p",
      volume: 9986.99466236054
    },
    %{
      asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2",
      last_price: 1.268e-5,
      priced_in: "8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS",
      volume: 9786.93694331709
    }
  ],
  "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu" => [
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 192.01,
      priced_in: "WAVES",
      volume: 137852.319057268
    },
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 279.152165,
      priced_in: "DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p",
      volume: 77018.2552159809
    },
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 0.02768054,
      priced_in: "8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS",
      volume: 38723.9182969945
    },
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 459.22,
      priced_in: "Ft8X1v1LTa1ABafufpaCWyVj8KkaxUWE6xBhW6sNFJck",
      volume: 513.413421879477
    }
  ],
  "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8" => [
    %{
      asset: "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8",
      last_price: 0.05171444,
      priced_in: "WAVES",
      volume: 14110.9296573005
    },
    %{
      asset: "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8",
      last_price: 7.5e-6,
      priced_in: "8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS",
      volume: 9722.17123718049
    },
    %{
      asset: "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8",
      last_price: 0.075459,
      priced_in: "DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p",
      volume: 8482.23199810624
    }
  ]
}
defmodule Remove_Blacklisted_Assets do		

	def filter_excluded_assets(number_of_assets_to_be_excluded, accumulator) when accumulator == number_of_assets_to_be_excluded do

		excluded = ['DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p', '8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS', '2tR9EKvDPMThfrFSb96CSBGYNwNPtzwkGcdhQjv4dVoj']
		number_of_assets_to_be_excluded = length(excluded)			
				
		Enum.filter(trades, fn map -> map.priced_in != Enum.fetch!(excluded, 0) end)
			|> Enum.into(%{})
			|> IO.inspect
	end



	def filter_excluded_assets(number_of_assets_to_be_excluded, accumulator) do

		excluded = ['DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p', '8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS', '2tR9EKvDPMThfrFSb96CSBGYNwNPtzwkGcdhQjv4dVoj']
		number_of_assets_to_be_excluded = length(excluded)

		Enum.filter(trades, fn map -> map.priced_in != Enum.fetch!(excluded,(number_of_assets_to_be_excluded - accumulator)) end)
			|> IO.inspect
			
		filter_excluded_assets(number_of_assets_to_be_excluded, accumulator + 1)
	end
	
			
end

Desired output:

trades = 
%{
  "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2" => [
    %{
      asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2",
      last_price: 0.09019287,
      priced_in: "WAVES",
      volume: 13918.3182330112
    }
  ],
  "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu" => [
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 192.01,
      priced_in: "WAVES",
      volume: 137852.319057268
    },
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 459.22,
      priced_in: "Ft8X1v1LTa1ABafufpaCWyVj8KkaxUWE6xBhW6sNFJck",
      volume: 513.413421879477
    }
  ],
  "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8" => [
    %{
      asset: "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8",
      last_price: 0.05171444,
      priced_in: "WAVES",
      volume: 14110.9296573005
    }
    }
  ]
}
iex(1)> Remove_Blacklisted_Assets.filter_excluded_assets(3,0)
** (ArgumentError) you attempted to apply :priced_in on {"3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2", [%{asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2", last_price: 0.09019287, priced_in: "WAVES", volume: 13888.8199642112}, %{asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2", last_price: 1.268e-5, priced_in: "8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS", volume: 9792.16173281305}, %{asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2", last_price: 0.1313214, priced_in: "DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p", volume: 9610.63424570971}]}.

How do I get Enum.filter to drill down to the map where priced_in is located?

Also, is the repetition of the excluded lists and the number_of_asssets_to_be_excluded functions in each function best practice?

Showing Posts 1 to 8

kokolegorille

kokolegorille

There are many errors…

When You use Enum on a map, You receive a tuple of key and value…

Enum.filter(trades, fn {_key, map} -> map.priced_in

It’s what the error message tells You…

Not only this, but the map, is not a map, it’s a list of map.

You are not using number_of_assets_to_be_excluded, then You set it to a new value.

What are You trying to do? If You want to test if a value is in a list, use Enum.member? or in.

Maxximiliann

Maxximiliann OP

Thanks for your insights so far. :slight_smile:

I’m attempting to iterate throughexcluded, removing each from trades.

kokolegorille

kokolegorille

It is wrong to think ‘A’ is equal to “A”, they are not. You might encounter some bad surprises if You think so :slight_smile:

Please try to understand the solution, because You should be able to write it, as descriptive as it is.

iex> excluded = ["DG2xFkPdDwKUoBkzGAhQtLpSGzfXLiCYPEzeKH2Ad24p", "8LQW8f7P5d5PZM7GtZEBgaqRPGSzS3DfPuiXrURJ4AJS", "2tR9EKvDPMThfrFSb96CSBGYNwNPtzwkGcdhQjv4dVoj"]
iex> trades 
|> Enum.reduce(%{}, fn {k, l}, acc -> 
  Map.put(acc, k, Enum.reject(l, & &1.priced_in in excluded)) 
end)
%{
  "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2" => [
    %{
      asset: "3QvxP6YFBKpWJSMAfYtL8Niv8KmmKsnpb9uQwQpg8QN2",
      last_price: 0.09019287,
      priced_in: "WAVES",
      volume: 13918.3182330112
    }
  ],
  "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu" => [
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 192.01,
      priced_in: "WAVES",
      volume: 137852.319057268
    },
    %{
      asset: "474jTeYx2r2Va35794tCScAXWJG9hU2HcgxzMowaZUnu",
      last_price: 459.22,
      priced_in: "Ft8X1v1LTa1ABafufpaCWyVj8KkaxUWE6xBhW6sNFJck",
      volume: 513.413421879477
    }
  ],
  "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8" => [
    %{
      asset: "4LHHvYGNKJUg5hj65aGD5vgScvCBmLpdRFtjokvCjSL8",
      last_price: 0.05171444,
      priced_in: "WAVES",
      volume: 14110.9296573005
    }
  ]
}

Often You will realize You can write it as a one line command.

Maxximiliann

Maxximiliann OP

If you would kindly step me through your solution, why is Enum.reduce needed? What precisely is it doing?

Thank you for all your help :slight_smile:

kokolegorille

kokolegorille

I prefer to use Enum.reduce when I would otherwise use Enum.map followed by Enum.into. It’s an iteration less.

Enum.reduce is worth learning how to use it… It takes an enumerable, and reduce it to a single value.

In this case, the value is a map.

All of your module recursive code could be replaced by

Enum.reject(l, & &1.priced_in in excluded)

It takes a list, and rejects the items whose price_in is in excluded. In this case reject is more appropriate than filter.

Map.put(acc, k, Enum.reject(l, & &1.priced_in in excluded)) 

It takes a map, and returns a map with k set to the new list.

trades |> Enum.reduce(%{}, fn {k, l}, acc -> 

It takes a map as enumerable (trades), and set acc to the initial value of an empty map. It loops through trades, each item is a tuple of key and value. In this case value is a list.

Each iteration will return a map, which is the updated accumulator, with the key set to the new list.

Finally, it returns the final accumulator, which is what You want :slight_smile:

The Enum module is probably the most used module, and it’s worth knowing all its functions.

ericgray

ericgray

Just to add what @kokolegorille has already explained usually when you need an accumulator or you need to pass around some state Enum.reduce is usually the right tool for the job.

Matter of fact everything in the Enum module is implemented with Enum.reduce except for zip. Jose Valim explains why and when you should use Enum.reduce in one of his Twitch Videos.
When you get a chance you should watch them, you’ll learn a lot.

Maxximiliann

Maxximiliann OP

Thank you so very much for the detailed walk-through :slight_smile:

Maxximiliann

Maxximiliann OP

Thanks for the recommendation. His videos are great! :slight_smile:

— 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
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
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
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
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
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

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews