#!/usr/bin/env bash | |
### | |
## This mounts a (single) ephemral NVMe drive in an EC2 server. | |
## It's meant to be run once, within user-data | |
## For EBS drives (non-ephemeral storage), see: https://gist.github.com/jalaziz/c22c8464cb602bc2b8d0a339b013a9c4 | |
# | |
#!/bin/bash | |
# Source: https://docs.aws.amazon.com/general/latest/gr/sigv4-signed-request-examples.html | |
[[ -n "${AWS_ACCESS_KEY_ID}" ]] || { echo "AWS_ACCESS_KEY_ID required" >&2; exit 1; } | |
[[ -n "${AWS_SECRET_ACCESS_KEY}" ]] || { echo "AWS_SECRET_ACCESS_KEY required" >&2; exit 1; } | |
readonly parameterName="SlawekTestParam" | |
readonly method="POST" |
use core::future::Future; | |
use core::pin::Pin; | |
use core::task::Poll; | |
use futures_core::Stream; | |
/// Item to return from stream. | |
pub struct StreamItem { | |
pub append_length: usize, | |
} | |
/// State shared between each sequential item computation. |
// https://github.com/microsoft/TypeScript/blob/ba5e86f1406f39e89d56d4b32fd6ff8de09a0bf3/src/compiler/checker.ts | |
// 1. add this line to ln:3 | |
export const _conditionalTypes: any = {} | |
// 2. then replace ln:12303 to ln:12360 | |
function trackConditionalType() { | |
// one time stuff |
Firecracker comes with an internal way of logging a timestamp that measures time elapsed between the very start of the guest VM and the moment a specific IO port has been written to.
That allows for marking specific moment along the boot process by having code writing to this port.
Here we're going to measure the time it takes for a Firecracker guest VM to reach userspace. To do so we're going to build 3 components:
type BarberId= usize; | |
type ShopId = usize; | |
struct Shop { | |
barber: Option<BarberId>, | |
} | |
struct Barber { | |
shop: Option<ShopId>, | |
} |
NOTE: The Tree-sitter API and documentation has changed and improved since this guide was created. I can't guarantee this is up to date.
Tree-sitter is the new way Atom is providing language recognition features, such as syntax highlighting, code folding, autocomplete, and more. In contrast to TextMate grammars, which work by regex matching, Tree-sitter will generate an entire syntax tree. But more on that can be found in it's own docs.
Here, we look at making one from scratch.
# Copyright (C) 2006-2016 Amazon.com, Inc. or its affiliates. | |
# All Rights Reserved. | |
# | |
# Licensed under the Apache License, Version 2.0 (the "License"). | |
# You may not use this file except in compliance with the License. | |
# A copy of the License is located at | |
# | |
# http://aws.amazon.com/apache2.0/ | |
# | |
# or in the "license" file accompanying this file. This file is |
{ | |
"configurations": [ | |
{ | |
"name": "Linux", | |
"includePath": [ | |
"${workspaceFolder}", | |
"LINUX_PATH/include", | |
"LINUX_PATH/include/uapi", | |
"LINUX_PATH/include/generated", | |
"LINUX_PATH/arch/x86/include", |