elixir | A Python package for 1-D blood flow simulation | Machine Learning library

I found that the missing object file that was referenced, libwx_gtk3u_webview-3.0.so.0, is included in this package's filelist.

I installed the package with

To make direct packet accesses in your program, you will need CAP_PERFMON in addition to CAP_BPF. I'm not aware of any way around it.

Why?

Because of Spectre vulnerabilities, someone able to perform arithmetic on unbounded pointers (i.e., all except stack and map value pointers) can read arbitrary memory via speculative out-of-bounds loads.

Such operations thus need to be forbidden for unprivileged users. Allowing CAP_BPF users to perform those operations would essentially give read access to arbitrary memory to CAP_BPF. For those reasons, I doubt this limitation will be lifted in the future.

1. Install asdf.
2. Install the erlang plugin.
   • Make sure to read the "Before asdf install" section.
   • The "Getting Erlang documentation" section is good to know too.
     TLDR: export KERL_BUILD_DOCS="yes"
   • asdf plugin add erlang https://github.com/asdf-vm/asdf-erlang.git
3. asdf install erlang latest + wait for erlang to build.
4. asdf global erlang latest
5. Install the elixir plugin.
   • asdf plugin-add elixir https://github.com/asdf-vm/asdf-elixir.git
6. asdf install elixir latest
7. asdf global elixir latest
8. iex to test. Done!

Bonus: export ERL_AFLAGS="-kernel shell_history enabled" to get shell history in iex.

Consider the arguments being passed to mult on each invocation.

When you do Test.mult([1,5,10]) first it checks the first function clause; that is can [1,5,10] be made to match []. Elixir will try to make the two expressions match if it can. In this case it cannot so then it tries the next function clause; can [1,5,10] be made to match [head|tail]? Yes it can so it assigns the first element (1) to head and the remaining elements [5,10] to tail. Then it recursively calls the function again but this time with the list [5,10]

Again it tries to match [5,10] to []; again this cannot be made to match so it drops down to [head|tail]. This time head is 5 and tail is 10. So again the function is called recursively with [10]

Again, can [10] be made to match []? No. So again it hits [head|tail] and assigns head = 10 and tail = [] (remember there's always an implied empty list at the end of every list).

Last go round; now [] definitely matches [] so it returns 1. Then the prior head * mult(tail) is evaluated (1 * 10) and that result is returned to the prior call on the stack. Evaluated again head (5) * mult(tail) (10) = 50. Final unwind of the stack head (1) * mult(tail) (50) = 50. Hence the overall value of the function is 50.

Remember that Elixir cannot totally evaluate any function call until it evaluates all subsequent function calls. So it hangs on to the intermediate values in order to compute the final value of the function.

Now consider your second code fragment in terms of pattern matching. [h|t] = [1,5,10] will assign h = 1 and t = [5,10]. h*t means 1 * [5,10]. Since those are fundamentally different types there's no inbuilt definition for multiplication in this case.

Turns out this was a bug from the library.

The fix is already in master as my PR was accepted: https://github.com/elixir-desktop/desktop/issues/17

At the time of this writing, the author pushed a fix to Master in Github. This fix addresses the issue of the application taking a long time to close, however it does not address the Chrome_WidgetWin_0. Error issue.

This issue is a known one and has already been reported, but there are no signs of fixing it from the Chrome project, so I guess we just have to live with it for the time being: https://bugs.chromium.org/p/chromium/issues/detail?id=113008

Another issue is the crash. Is likely happens because of the previous issue, and therefore there is little one can do here.

Since the main problem was fixed, I am marking this as solved.

I have tried to create a project such as yours.

You may have accidently added :changeset in the code:

The Codepagex library supports this. You just need to figure out what it calls SHIFT_JIS.

Codepagex uses the mappings available from unicode.org. There is one for shift-jis but it's marked as OBSOLETE, so is not available in Codepagex. However, Microsoft's CP932 is also available, which is effectively SHIFT_JIS, so you can use that.

It's not enabled by default, so you need to enable in in config (and re-compile with mix deps.compile codepagex --force if necessary):