leiless

/*
 * Created Jul 4, 2020.
 */

#include <unistd.h>
#include <uv.h>

#include "test.h"
#include "utils.h"
#include "assertf.h"

kasvith

package main

import (
	"fmt"
	"math/rand"
	"sync"
	"time"
)

type DataEvent struct {

trevershick

set(CMAKE_BUILD_TYPE Debug)
cmake_minimum_required(VERSION 2.8.12)
project(libuv1)

add_definitions("-std=c++11")

include(${CMAKE_BINARY_DIR}/conanbuildinfo.cmake)
conan_basic_setup()

add_executable(server server.cpp)

eteq

rushilgupta

INTRO

Concurrency is a domain I have wanted to explore for a long time because the locks and the race conditions have always intimidated me. I recall somebody suggesting concurrency patterns in golang because they said "you share the data and not the variables".

Amused by that, I searched for "concurrency in golang" and bumped into this awesome slide by Rob Pike: https://talks.golang.org/2012/waza.slide#1 which does a great job of explaining channels, concurrency patterns and a mini-architecture of load-balancer (also explains the above one-liner).

Let's dig in:

Goroutines

xxlukas42

void setup() {
  Serial.begin(115200);
}
 
void loop() {
 
    int measurement = 0;

    measurement = hallRead();
 

prasmussen

net.ipv4.ip_forward=1
net.ipv6.conf.default.forwarding=1
net.ipv6.conf.6rdtun.forwarding=1
net.ipv6.conf.all.forwarding=1

bayesian_neural_network.ipynb

thealexcons

package main

import (
	"io/ioutil"
	"log"
	"strings"
	"net/http"
	"encoding/json"
	"fmt"
	"time"

xlab

func split(buf []byte, lim int) [][]byte {
	var chunk []byte
	chunks := make([][]byte, 0, len(buf)/lim+1)
	for len(buf) >= lim {
		chunk, buf = buf[:lim], buf[lim:]
		chunks = append(chunks, chunk)
	}
	if len(buf) > 0 {
		chunks = append(chunks, buf[:len(buf)])
	}