misyltoad

double not_terrible_lerp<double>(double, double, double):
        push    rbp
        mov     rbp, rsp
        movsd   QWORD PTR [rbp-8], xmm0
        movsd   QWORD PTR [rbp-16], xmm1
        movsd   QWORD PTR [rbp-24], xmm2
        movsd   xmm0, QWORD PTR [rbp-16]
        subsd   xmm0, QWORD PTR [rbp-8]
        mulsd   xmm0, QWORD PTR [rbp-24]
        addsd   xmm0, QWORD PTR [rbp-8]

misyltoad

std::isfinite(double):
        push    rbp
        mov     rbp, rsp
        movsd   QWORD PTR [rbp-8], xmm0
        movsd   xmm0, QWORD PTR [rbp-8]
        movq    xmm1, QWORD PTR .LC0[rip]
        andpd   xmm1, xmm0
        movsd   xmm0, QWORD PTR .LC1[rip]
        ucomisd xmm0, xmm1
        setb    al

misyltoad

template <class _Ty>
_NODISCARD /* constexpr */ _Ty _Common_lerp(const _Ty _ArgA, const _Ty _ArgB, const _Ty _ArgT) noexcept {
    // on a line intersecting {(0.0, _ArgA), (1.0, _ArgB)}, return the Y value for X == _ArgT

    const int _Finite_mask = (int{isfinite(_ArgA)} << 2) | (int{isfinite(_ArgB)} << 1) | int{isfinite(_ArgT)};
    if (_Finite_mask == 0b111) {
        // 99% case, put it first; this block comes from P0811R3
        if ((_ArgA <= 0 && _ArgB >= 0) || (_ArgA >= 0 && _ArgB <= 0)) {
            // exact, monotonic, bounded, determinate, and (for _ArgA == _ArgB == 0) consistent:
            return _ArgT * _ArgB + (1 - _ArgT) * _ArgA;

phil-blain

*.md diff=markdown

afloesch

Terraforming API Gateway to SQS queue

Example of a bare-minimum terraform script to setup an API Gateway endpoint that takes records and puts them into an SQS queue.

SQS

Start by creating the SQS queue.

resource "aws_sqs_queue" "queue" {

MPThLee

/**
  * !!!! This code doesn't work anymore !!!!
  * 
  * - You can check working code on comments. I won't update this code anymore.
  *
  * Also, I just decided to remove this code. You can check revisions for old code.
  * Since this code was made for discord client that almost 5 years ago, It seems like doesn't work anymore.
  * I don't want people keep arguing in the comments, i decided to remove this code.
  *
  * Note: This code is now fulfilled with Javascript comments. This code won't work even if you pasted to console. doesn't do anything.

beesandbombs

int[][] result;
float t, c;

float ease(float p) {
  return 3*p*p - 2*p*p*p;
}

float ease(float p, float g) {
  if (p < 0.5) 
    return 0.5 * pow(2*p, g);

mohanpedala

Table of Contents

• set -e, -u, -x, -o pipefail
• set -e
• set -x
• set -u
• set -o pipefail
• Setting IFS
• Original Reference

set -e, -u, -x, -o pipefail

Kalinovcic

//
// Author:   Jonathan Blow
// Version:  1
// Date:     31 August, 2018
//
// This code is released under the MIT license, which you can find at
//
//          https://opensource.org/licenses/MIT
//
//

kennygoff

// 
//     |￣￣￣￣￣￣|
//     | this is  |
//     |   your   |
//     |   spot   |
//     |__________|
//  (\__/) ||
//  (•ㅅ•) ||
//  /     づ
//