bothra90

From ec1ab0049808a9fbca676bfe68ee735eb620d763 Mon Sep 17 00:00:00 2001
From: Richard Gilmore <richard.gilmore@slicelife.com>
Date: Sun, 6 Nov 2022 23:19:37 +0000
Subject: [PATCH] resolving pod launches and server logging

---
 .gitignore                                                | 1 +
 airbyte-commons/src/main/resources/log4j2.xml             | 5 -----
 .../io/airbyte/config/helpers/CloudLogsClientTest.java    | 4 ++--
 .../test/java/io/airbyte/config/helpers/S3LogsTest.java   | 4 ++--

bothra90

{
  "destinations": [
    {
      "destinationDefinitionId": "0eeee7fb-518f-4045-bacc-9619e31c43ea",
      "name": "Amazon SQS",
      "dockerRepository": "airbyte/destination-amazon-sqs",
      "dockerImageTag": "0.1.0",
      "documentationUrl": "https://docs.airbyte.com/integrations/destinations/amazon-sqs",
      "icon": "awssqs.svg",
      "iconUrl": "https://storage.googleapis.com/prod-airbyte-cloud-connector-metadata-service/metadata/airbyte/destination-amazon-sqs/latest/icon.svg",

bothra90

package main

import (
	"log"
	"time"

	"github.com/google/cel-go/cel"
	"github.com/google/cel-go/checker/decls"
)

bothra90

import celpy
import time
import random


def bench_native():
    start = time.time()
    for _ in range(10000):
        failure = 2000 * (1 + random.random())
        count = 10000 * (1 + random.random())

bothra90

1. General Background and Overview

• Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
• Models and Issues in Data Stream Systems
• Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
• Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
• [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep

bothra90

package main

import "fmt"

func main() {
	c := "`"
	x := `package main

import (
	"fmt"

bothra90

Types

A type is a collection of possible values. An integer can have values 0, 1, 2, 3, etc.; a boolean can have values true and false. We can imagine any type we like: for example, a HighFive type that allows the values "hi" or 5, but nothing else. It's not a string and it's not an integer; it's its own, separate type.

Statically typed languages constrain variables' types: the programming language might know, for example, that x is an Integer. In that case, the programmer isn't allowed to say x = true; that would be an invalid program. The compiler will refuse to compile it, so we can't even run it.

bothra90

Keybase proof

I hereby claim:

• I am bothra90 on github.
• I am bothra90 (https://keybase.io/bothra90) on keybase.
• I have a public key whose fingerprint is 5269 A892 0423 8B59 AB1B 208D 3168 9632 23AF CE9D

To claim this, I am signing this object:

bothra90

#First Heading

• List first elem
• Second elem
  • nested elem

##Second heading

Third heading