thetooth

thetooth@alpine1 ~/a/scripts> sh mkimage.sh --tag edge \
                              --outdir ~/iso \
                              --arch x86_64 \
                              --repository http://dl-cdn.alpinelinux.org/alpine/edge/main \
                              --profile standard
OK: 0 MiB in 0 packages
fetch http://dl-cdn.alpinelinux.org/alpine/edge/main/x86_64/APKINDEX.tar.gz
v3.7.0-2817-g2ce590a52d [http://dl-cdn.alpinelinux.org/alpine/edge/main]
OK: 5754 distinct packages available
>>> mkimage-x86_64: Building standard

thetooth

# Configuration for Alacritty, the GPU enhanced terminal emulator


# Any items in the `env` entry below will be added as
# environment variables. Some entries may override variables
# set by alacritty it self.
env:
  # TERM env customization.
  #
  # If this property is not set, alacritty will set it to xterm-256color.

thetooth

#!/usr/bin/env bash

# This script will 
#	1. (Optionally) First snapshot your BTRFS /home subvolume as /resticbackup
#	2. Generate a list of packages and backup as `pkglist'
#	3. Backup the pacman cache directory
#	4. Backup the users home directory (from the BTRFS snapshot or directly)

# Try to load a credentials file
source ./backup-creds &> /dev/null || true

thetooth

% Document color scheme
\definecolor{defColor}{RGB}{255,255,204}
\definecolor{sysColor}{RGB}{204,229,255}
\definecolor{appColor}{RGB}{204,229,255}

% Fancy sections
\newcommand\layertitle[2][defColor]{%
	\refstepcounter{section}%
	\addcontentsline{toc}{section}{\protect\numberline{\thesection}#2}%
	\sectionmark{#2}%

thetooth

#define PWM_ELEMENTS 100
const uint32_t PWM_Buffer[PWM_ELEMENTS] = { // Sine Table
    0,  3,  6,  9,  12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48,
    50, 53, 56, 58, 61, 63, 66, 68, 70, 72, 75, 77, 79, 80, 82, 84, 86,
    87, 89, 90, 91, 92, 94, 95, 96, 96, 97, 98, 98, 99, 99, 99, 99, 100,
    99, 99, 99, 99, 98, 98, 97, 96, 96, 95, 94, 92, 91, 90, 89, 87, 86,
    84, 82, 80, 79, 77, 75, 72, 70, 68, 66, 63, 61, 58, 56, 53, 50, 48,
    45, 42, 39, 36, 33, 30, 27, 24, 21, 18, 15, 12, 9,  6,  3};

#define ADC_LEN 2

thetooth

Compiler Warnings:

Src/main.c:202:28: format specifies type 'unsigned long' but the argument has type 'unsigned int'
Src/main.c:206:31: format specifies type 'unsigned long' but the argument has type 'int'
Drivers/STM32F4xx_HAL_Driver/Src/stm32f4xx_hal_adc.c:1374:26: equality comparison with extraneous parentheses
Drivers/STM32F4xx_HAL_Driver/Src/stm32f4xx_hal_tim.c:401:19: equality comparison with extraneous parentheses
Drivers/STM32F4xx_HAL_Driver/Src/stm32f4xx_hal_tim.c:405:24: equality comparison with extraneous parentheses
Drivers/STM32F4xx_HAL_Driver/Src/stm32f4xx_hal_tim.c:800:19: equality comparison with extraneous parentheses
Drivers/STM32F4xx_HAL_Driver/Src/stm32f4xx_hal_tim.c:804:24: equality comparison with extraneous parentheses

thetooth

package main

import (
	"context"
	"fmt"
	"io/ioutil"
	"net/http"
	"os"
	"os/signal"
	"syscall"

thetooth

---
- hosts: localhost
  connection: local
  gather_facts: False
  tasks:
    - name: Build client
      shell: "GOARM=7 GOARCH=arm GOOS=linux go build -v -i -o client cmd/client/main.go"
      register: build
    
    - debug: var=build.stderr

thetooth

// NUCLEO-F401RE DMA Driven PWM - Not good for school or work assignments.
// Copyright (C) 2015 [email protected], All Rights Reserved

#include "stm32f4xx.h"

#define PWM_ELEMENTS 100

const u32 PWM_Buffer[PWM_ELEMENTS] = { // Sine Table
  0,  3,  6,  9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 50, 53, 56,
 58, 61, 63, 66, 68, 70, 72, 75, 77, 79, 80, 82, 84, 86, 87, 89, 90, 91, 92, 94,

thetooth

The local commuter railroad services a number of towns in Kiwiland.  Because of monetary concerns, all of the tracks are 'one-way’. That is, a route from Kaitaia to Invercargill does not imply the existence of a route from Invercargill to Kaitaia. In fact, even if both of these routes do happen to exist, they are distinct and are not necessarily the same distance!

The purpose of this problem is to help the railroad provide its customers with information about the routes. In particular, you will compute the distance along a certain route, the number of different routes between two towns, and the shortest route between two towns.

Input: A directed graph where a node represents a town and an edge represents a route between two towns. The weighting of the edge represents the distance between the two towns. A given route will never appear more than once, and for a given route, the starting and ending town will not be the same town.

Output: For test input 1 through 5, if no such route exists, output 'NO SUCH ROU