PJUllrich

from observer.observer_pattern import Observable, Observer


class Elf:
    name = 'Galadriel'

    def nall_nin(self):
        print('Elf says: Calling the Overlord ...')

PJUllrich

#!/bin/bash

IP=`hostname -I | awk '{print $1}'`
MESSAGE="Pi ${HOSTNAME} fully booted. New IP: $IP"
TITLE="`whoami`@${HOSTNAME}"

APP_TOKEN="YOUR_APP_TOKEN_HERE"
USER_TOKEN="YOUR_USER_TOKEN_HERE"

wget https://api.pushover.net/1/messages.json --post-data="token=$APP_TOKEN&user=$USER_TOKEN&message=$MESSAGE&title=$TITLE" -qO- > /dev/null 2>&1 &

PJUllrich

pragma solidity ^0.4.24;

contract A {
    address public sender; 
    
    function dcall(B other, C child) public {
        other.dcall(child);
    }
}

PJUllrich

defmodule MyApp.PubSubLib do
  @moduledoc """
  This library implements easy to use Publish-Subscribe functionality.

  ## Usage
  Use this library with `use MyApp.PubSubLib`.

  ## Example

    defmodule MyApp.MyPublishingModule do

PJUllrich

name: Elixir CI

on:
  push:
    branches:
      - master

jobs:
  test:
    runs-on: ubuntu-latest

PJUllrich

defmodule Support.FeatureCase do
  @moduledoc false

  use ExUnit.CaseTemplate

  using do
    quote do
      @moduletag :feature

      use Wallaby.DSL

PJUllrich

name: Update data

on:
  schedule:
    - cron: "0 5 * * *"

jobs:
  execute:
    runs-on: ubuntu-latest

PJUllrich

require 'google/apis/identitytoolkit_v3'
require 'google/apis/core/api_command'
require 'googleauth'
require 'addressable/template'
require 'json'
require 'securerandom'

# Request to delete account.
class CreateSessionCookieRequest
  include Google::Apis::Core::Hashable

PJUllrich

defmodule Terminvergabe do
  @moduledoc """
  This script checks for available appointments in the "Bürgeramt" (city hall)
  every 5min and notifies a user via Pushover if new appointments become were added.

  In order to use Pushover, you must configure the following environment variables:

  PUSHOVER_USER
  PUSHOVER_TOKEN

PJUllrich

Big-O Time Complexities for Elixir data structures

Map [1]

Operation	Time Complexity
Access	O(log n)
Search	O(log n)
Insertion	O(n) for <= 32 elements, O(log n) for > 32 elements [2]
Deletion	O(n) for <= 32 elements, O(log n) for > 32 elements