Skip to content

Instantly share code, notes, and snippets.

View SebastiaanLubbers's full-sized avatar

Sebastiaan Lubbers SebastiaanLubbers

View GitHub Profile
@SebastiaanLubbers
SebastiaanLubbers / README.md
Created February 10, 2026 18:49 — forked from ajkauffmann/README.md
Example Copilot instruction templates for AL development (sanitized conference version)

Copilot Instruction Templates

These are sanitized examples shared at a conference.

They are starting points, not rules.

Adapt them to your workflow and projects.

Windows Registry Editor Version 5.00
[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Cryptography\OID\EncodingType 0]
[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Cryptography\OID\EncodingType 0\CryptSIPDllCreateIndirectData]
[HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Cryptography\OID\EncodingType 0\CryptSIPDllCreateIndirectData\{36FFA03E-F824-48E7-8E07-4A2DCB034CC7}]
"Dll"="C:\\Windows\\system32\\NavSip.dll"
"FuncName"="NavSIPCreateIndirectData"
@SebastiaanLubbers
SebastiaanLubbers / WorkflowResourceDictionary.cs
Created December 14, 2015 13:07
How to load customized workflow resource dictionary
namespace MyWorkflow
{
public sealed partial class MyDesigner
{
static MyDesigner()
{
var hashTable = new Hashtable();
using (var xmlReader = XmlReader.Create(new StringReader(Resources.DefaultColorResources)))
{
@SebastiaanLubbers
SebastiaanLubbers / DispatchDelegate.cs
Last active March 23, 2025 05:20
EventManager.Dispatcher
namespace EventManager
{
public delegate void DispatchDelegate(object sender, object source, object target, object data);
public class Dispatcher
{
public event DispatchDelegate OnDispatch;
public void Dispatch(object source, object target, object data)
{
@SebastiaanLubbers
SebastiaanLubbers / SymSpell.cs
Last active March 23, 2025 05:18
1000x Faster Spelling Correction algorithm
// SymSpell: 1000x faster through Symmetric Delete spelling correction algorithm
//
// The Symmetric Delete spelling correction algorithm reduces the complexity of edit candidate generation and dictionary lookup
// for a given Damerau-Levenshtein distance. It is three orders of magnitude faster and language independent.
// Opposite to other algorithms only deletes are required, no transposes + replaces + inserts.
// Transposes + replaces + inserts of the input term are transformed into deletes of the dictionary term.
// Replaces and inserts are expensive and language dependent: e.g. Chinese has 70,000 Unicode Han characters!
//
// Copyright (C) 2012 Wolf Garbe, FAROO Limited
// Version: 1.6