djspiewak

Fibers

Fibers are an abstraction over sequential computation, similar to threads but at a higher level. There are two ways to think about this model: by example, and abstractly from first principles. We'll start with the example.

(credit here is very much due to Fabio Labella, who's incredible Scala World talk describes these ideas far better than I can)

Callback Sequentialization

Consider the following three functions

osamaqarem

Install nginx (Homebrew)

brew install nginx

Configuration file for nginx will be at /usr/local/etc/nginx/nginx.conf

Web apps can be stored at /usr/local/var/www

Commands

Start:

jfcherng

This gist will no longer be updated as the changelog will be on the official website.

• Sublime Text/Merge Official Discord chat server: https://discord.gg/D43Pecu
• Sublime Text/Merge 中文 Telegram 交流群組： https://t.me/sublime_tw

Converted via https://domchristie.github.io/turndown

About Sublime Text 4

ahoy-jon

sealed trait Path

case class Field(name: String, child: Option[Path]) extends Path {
  override def toString: String = child match {
    case None       => name
    case Some(path) => s"$name.$path"
  }
}

djspiewak

Easy Scala Publication

The following describes how you can publish artifacts for any sbt project using the GitHub Package Registry and the sbt-github-packages plugin.

Step 1: Create a GitHub Token

In your GitHub account, go to Settings > Developer settings > Personal access tokens, then click on Generate new token (or click here). Fill in some sort of meaningful name (I chose Dev) and click on the write:packages checkbox:

alexandru

See context.

To configure this script to automatically execute on file changes, save the XML config in ~/Library/LaunchAgents/dot-files.sync.plist then do:

launchctl load -w ~/Library/LaunchAgents/dot-files.sync.plist

jdegoes

final case class ZIO[-R, +E, +A](run: R => Either[E, A]) {
  final def map[B](f: A => B): ZIO[R, E, B] = 
    ZIO(r => run(r).map(f))

  final def flatMap[R1 <: R, E1 >: E, B](f: A => ZIO[R1, E1, B]): ZIO[R1, E1, B] = 
    ZIO(r => run(r).flatMap(a => f(a).run(r)))

  final def provide(r: R): ZIO[Any, E, A] = 
    ZIO(_ => run(r))

johnynek

/*
 * Consider a simple recursive function like:
 * f(x) = if (x > 1) f(x - 1) + x
 *        else 0
 *
 * This function isn't tail recursive (it could be, but let's set that aside for a moment).
 * How can we mechanically, which is to say without thinking about it, convert this into a stack safe recursion?
 * An approach is to model everything that happens after the recursion as a continuation, and build up that
 * continuation in a stack safe manner. Here is some example code:
 */

non

COLLECTION                              0        1        5       10       50      100      500     1000
Array[Int]                             16       24       40       56      216      416     2016     4016
immutable.BitSet                       24       24       24       24       24       32       96      160
immutable.IntMap[Int]                  16       40      328      688     3568     7168    35968    71968
immutable.List[Int]                    16       56      216      416     2016     4016    20016    40016
immutable.Map[Int,Int]                 16       40      304      720     4856     9680    53504   111760
immutable.Queue[Int]                   40       80      240      440     2040     4040    20040    40040
immutable.Set[Int]                     16       32      264      480     3016     5840    27696    57952
immutable.SortedMap[Int,Int]           40       88      280      520     2440     4840    30008    62008
immutable.SortedSet[Int]               40      104      296      536     2456  

kubukoz

import cats.effect._

import java.net.InetSocketAddress
import java.nio.channels.AsynchronousChannelGroup
import java.util.concurrent.Executors

import fs2.Stream
import cats.implicits._