Date | 05-05-2021 - 10-17-2023 |
Revision | R3 |
Author | Guillaume Dua |
Reviewers | Loïc Joly, Antoine Morrier |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
name: Test | |
on: | |
push: | |
branches: | |
- main | |
- features/** | |
- dependabot/** | |
pull_request: | |
branches: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
version: "3.6" | |
services: | |
promtail: | |
image: grafana/promtail:1.4.0 | |
container_name: promtail | |
command: [ "-config.file=/etc/promtail/local-config.yaml" ] | |
volumes: | |
- './promtail.yml:/etc/promtail/local-config.yaml:ro' | |
- '__path_to_logs_directory__:/app/log:ro' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Guidance: https://www.tenouk.com/Module41c.html | |
#include <arpa/inet.h> | |
#include <array> | |
#include <iostream> | |
#include <netinet/in.h> | |
#include "udpSock.hpp" | |
#include "zz_diagnose.hpp" | |
int main() | |
{ |
Please comment below if you have an update, e.g., with another networking-related dataset.
- Finding datasets: New Google Dataset search
- Mendeley Data: https://data.mendeley.com/datasets
- Kaggle Data: https://www.kaggle.com/datasets
- Google's M-Lab networking performance data sets: https://www.measurementlab.net/data/
- https://segment.com/blog/allocation-efficiency-in-high-performance-go-services/
- https://medium.com/a-journey-with-go/go-memory-management-and-allocation-a7396d430f44
Here’s a list of some patterns we’ve found which typically cause variables to escape to the heap:
- Sending pointers or values containing pointers to channels. At compile time there’s no way to know which goroutine will receive the data on a channel. Therefore the compiler cannot determine when this data will no longer be referenced.
- Storing pointers or values containing pointers in a slice. An example of this is a type like
[]*string
. This always causes the contents of the slice to escape. Even though the backing array of the slice may still be on the stack, the referenced data escapes to the heap. - Backing arrays of slices that get reallocated because an append would exceed their capacity. In cases where the initial size of a slice is known at compile time, it will begin its allocation on the stack. If this slice’s underl
A non-exhaustive list of WebGL and WebGPU frameworks and libraries. It is mostly for learning purposes as some of the libraries listed are wip/outdated/not maintained anymore.
Name | Stars | Last Commit | Description |
---|---|---|---|
three.js | ![GitHub |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <algorithm> | |
#include <experimental/any> | |
#include <array> | |
#include <condition_variable> | |
#include <functional> | |
#include <iostream> | |
#include <iterator> | |
#include <mutex> | |
#include <thread> | |
#include <vector> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
23.21.150.121:3478 | |
iphone-stun.strato-iphone.de:3478 | |
numb.viagenie.ca:3478 | |
s1.taraba.net:3478 | |
s2.taraba.net:3478 | |
stun.12connect.com:3478 | |
stun.12voip.com:3478 | |
stun.1und1.de:3478 | |
stun.2talk.co.nz:3478 | |
stun.2talk.com:3478 |
NewerOlder