We Love Privacy Club

feeds.twtxt.net

How Swarming Jellyfish Overran Three French Nuclear Power Reactors
A “massive influx” of jellyfish forced Electricite de France SA to shut three units at its Gravelines nuclear power plant this week and reduce output at a fourth, reports Bloomberg. Just as summer temperatures surged, 3.2 gigawatts went offline — and the power utility was already facing cuts other nuclear sites as high temperatures reduce … ⌘ Read more

⤋ Read More

slashdot

feeds.twtxt.net

6:50AM (6h ago)

How Larry Ellison Dropped From World’s 2nd-Richest To No. 8 In Just 2 Months
Less than a year ago he was the #1 richest man in the world. 10 weeks ago he was #2. But yesterday Larry Ellison dropped to #8, Forbes reports, falling behind Nvidia CEO Jensen Huang.

Ellison’s net worth is now estimated at just $192.6 billion — after a $104 billion decline:

Shares of Oracle plunged roughly 54% betwe … ⌘ Read more

⤋ Read More

gaming-on-linux

feeds.twtxt.net

12:31AM (13h ago)

D7VK version 2.1 brings improvements to retro game loading time
D7VK continues to mature its Direct3D 7, 6, 5 and 3 to Vulkan translation, to bring improvements for retro Windows games with Wine / Proton on Linux.

Image

Read the full article on GamingOnLinux. ⌘ Read more

⤋ Read More

prologic

twtxt.net

Sat 15, 12:46PM (1d ago)

↳ In-reply-to » It is such a nice feeling that Mu is such a capable little language 😅 And I decided to write code code in Mu by hand 🤚 haha 🤣 and start solving Project Euler problems, like Problem 8 which works out to be a nice elegant solution in Mu:

And just like that Problem 10 is done and correct whoohoo 🥳 It was easy because in Problem 7 I’d already written an iterator to produce infinite primes. So the solution for finding the sum of primes under 2,000,000 is basically (shortened):

  primes := iter.take_while(iter.filter(prime_candidates(), is_prime), fn(p) { p < n })
  print(iter.sum(primes))

And of course the answer is: 142913828922 which took ~21.ss for the Go Vm to compuete.

⤋ Read More

prologic

twtxt.net

Sat 15, 12:30PM (1d ago)

↳ In-reply-to » It is such a nice feeling that Mu is such a capable little language 😅 And I decided to write code code in Mu by hand 🤚 haha 🤣 and start solving Project Euler problems, like Problem 8 which works out to be a nice elegant solution in Mu:

Oh man wow 😮 Problem 9 was quite hard 😱 I had to build two new functions in the Mu stdlib for computing combinations and permutations, but then the combinations of range(1000) for triples such as a + b == c is enormous! So i had to write iterator versions of these to do lazy evaluation. Anyway solution follows:

#!/usr/bin/env mu

// Special Pythagorean Triplet

import "iter"

fn usage() {
  print("Usage:", args()[0], "<n>")
}

fn sqr(x) { x * x }

fn main() {
  if len(args()) < 2 {
    usage()
    exit(1)
  }

  n := must(int(args()[1]))
  print("n:", n)

  // For a < b < c and a + b + c == n, both a and b are strictly less
  // than n/2. Generate only (a,b) combinations and derive c directly. This
  // keeps the search lazy and reduces n=1000 from C(999,3) = 165,668,499
  // candidate triples to C(499,2) = 124,251 candidate pairs.
  pairs := iter.combinations(iter.range(1, n / 2), 2)

  triples := iter.map(pairs, fn(xs) {
    a := xs[0]
    b := xs[1]
    return [a, b, n - a - b]
  })

  // Enforce b < c; a < b is already guaranteed by combinations over an
  // increasing range, and a + b + c == n holds by construction.
  triples = iter.filter(triples, fn(xs) {
    return xs[1] < xs[2]
  })

  // Euler 9 has one answer for n=1000. find() stops the entire upstream
  // iterator chain as soon as the first Pythagorean triple is found.
  answer := iter.find(triples, fn(xs) {
    return sqr(xs[0]) + sqr(xs[1]) == sqr(xs[2])
  })

  print(answer)

  if answer != nil {
    print(answer[0] * answer[1] * answer[2])
  }
}

main()

⤋ Read More

prologic

twtxt.net

Sat 15, 11:22AM (1d ago)

It is such a nice feeling that Mu is such a capable little language 😅 And I decided to write code code in Mu by hand 🤚 haha 🤣 and start solving Project Euler problems, like Problem 8 which works out to be a nice elegant solution in Mu:

#!/usr/bin/env mu

// Largest Product in a Series

import "fp"
import "sys"

fn usage() {
  print("Usage: cat |", args()[0], "<n>")
}

fn products(xs) {
  return fp.reduce(xs, 1, fn(x, y) {
    if y == nil {
      return x
    }
    return x * y
  })
}

fn main() {
  if len(args()) < 2 {
    usage()
    exit(1)
  }

  s := must(sys.read_all(0))
  if len(s) == 0 {
    usage()
    exit(1)
  }

  n := must(int(args()[1]))
  r := fp.max(fp.map(fp.sliding(fp.map(s, int), n), products))
  print(r)
}

main()

⤋ Read More

Searching We Love Privacy Club