jidckii

{{ define "__yucca_text_alert_list" }}{{ range . }}
---
🪪 <b>{{ .Labels.alertname }}</b>
{{- if .Annotations.summary }}
📝 {{ .Annotations.summary }}{{ end }}
{{- if .Annotations.description }}
📖 {{ .Annotations.description }}{{ end }}
🏷 Labels:
{{ range .Labels.SortedPairs }}  <i>{{ .Name }}</i>: <code>{{ .Value }}</code>
{{ end }}{{ end }}

kjmph

-- Based off IETF draft, https://datatracker.ietf.org/doc/draft-peabody-dispatch-new-uuid-format/

create or replace function uuid_generate_v7()
returns uuid
as $$
begin
  -- use random v4 uuid as starting point (which has the same variant we need)
  -- then overlay timestamp
  -- then set version 7 by flipping the 2 and 1 bit in the version 4 string
  return encode(

wosc

Creating opentelemetry tracing data from an haproxy access log

Approach

Unfortunately, otelcol currently has no receiver for logfiles that produces tracing data. There is log tailing functionality, and e.g. a fluent forward protocol receiver, but they all create "log" data, not tracing. I've seen this proof of concept to implement a forward receiver that creates tracing data, but that seems to have no traction and no relation to the upstream project at all (not even git history.

Thus, we've settled on this approach:

carolynvs

[alias]
  wip = for-each-ref --sort='authordate:iso8601' --format=' %(color:green)%(authordate:relative)%09%(color:white)%(refname:short)' refs/heads
  

rawc0der

#!/bin/bash
# Small utility function based on yq to extract openAPIV3Schema from CRD
# example:  crd2jsonschema.sh ./crd-alertmanager.yaml
set -e

function crd2jsonschema() {
    set -e
    local xkgroup="x-kubernetes-group-version-kind"
    local document="$1"
    local openAPIV3Schema=$(mktemp -u)

jaredpar

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using Microsoft.Build.Logging.StructuredLogger;

var build = BinaryLog.ReadBuild(@"p:\roslyn3\artifacts\log\Debug\Build.binlog");
var root = @"p:\roslyn3";
var sourceFileSet = new HashSet<string>(StringComparer.OrdinalIgnoreCase);
build.VisitAllChildren<CscTask>(cscTask =>

desbest

<# 
.SYNOPSIS 
Reset-WindowsUpdate.ps1 - Resets the Windows Update components 
 
.DESCRIPTION  
This script will reset all of the Windows Updates components to DEFAULT SETTINGS. 
 
.OUTPUTS 
Results are printed to the console. Future releases will support outputting to a log file.  
 

vchirikov

/*
  https://marketplace.visualstudio.com/items?itemName=be5invis.vscode-custom-css
  https://marketplace.visualstudio.com/items?itemName=lehni.vscode-fix-checksums
*/

.loopText tspan {
  fill: white;
  background: white;
}
/* removes underscore style on links */

buybackoff

Binary search is theoretically optimal, but it's possible to speed it up substantially using AVX2 and branchless code even in .NET Core.

Memory access is the limiting factor for binary search. When we access each element for comparison a cache line is loaded, so we could load a 32-byte vector almost free, check if it contains the target value, and if not - reduce the search space by 32/sizeof(T) elements instead of 1 element. This gives quite good performance improvement (code in BinarySearch1.cs and results in the table 1 below).

However, for larger N the search space reduction is quite minimal and the most gains come from switching to linear search. After an interesting discussion in Twitter (especially with @trav_downs), and trying to widen the pivot area to use 2 AVX2 vectors it became clear that just switching to linear search sooner is more important than using AVX2 vectors as pivots.

The linear search was not using AVX2, and for linear

3v1n0

#/usr/bin/python3

import json
import sys
import os
import re
import copy

input = sys.argv[1]