Skip to content

Instantly share code, notes, and snippets.

View deniskyashif's full-sized avatar

Denis Kyashif deniskyashif

View GitHub Profile
@deniskyashif
deniskyashif / pre-commit-dotnet-format
Last active September 30, 2021 08:01
Git pre-commit hook to run dotnet format on the staged files.
#!/bin/sh
cs_files="$(git diff --name-only --cached --diff-filter=d | grep -E '\.cs$')"
if [ -n "$cs_files" ]; then
cs_files_seperated_by_comma="$(echo $cs_files | tr ' ' ,)"
dotnet format --workspace <Project-Root> --files $cs_files_seperated_by_comma
git add $cs_files
fi
/*
S -> aAe
A -> bAd | c
*/
const parse = (() => {
let tokens;
let pos = 0;
const peek = () => tokens[pos];
const eat = token => {
@deniskyashif
deniskyashif / Global.Application_Start.cs
Last active January 30, 2020 19:54
Integrate OpenGraph and TwitterCard with Sitefinity
protected void Application_Start(object sender, EventArgs e)
{
Bootstrapper.Initialized += this.BootstrapperInitializedHook;
}
@deniskyashif
deniskyashif / req-lca.cs
Last active July 2, 2019 05:56
Solution for Range Minimum Query & Lowest Common Ancestor
/*
Solves both Range Minimum Query & Lowest Common Ancestor
in O(n) space & O(1) query time following Farach-Colton and Bender's algorithm.
Reference: https://www.ics.uci.edu/~eppstein/261/BenFar-LCA-00.pdf
*/
using System.Collections.Generic;
using System.Linq;
public class RMQLin
{
@deniskyashif
deniskyashif / rmq-st.cs
Last active June 28, 2019 12:05
Implementation of Range Minimum Query with Sparse Table.
public class RMQLog
{
private int[] A;
private int[,] sparseTable;
private int[] logTable;
public RMQLog(int[] A)
{
this.PrecomputeSparseTable(A);
}
@deniskyashif
deniskyashif / rsq-st.cs
Created June 28, 2019 12:02
Range Sum Query in Linear Time
public class RSQLog
{
private int[] A;
private int[,] sparseTable;
private int[] logTable;
public RSQLog(int[] A)
{
this.PrecomputeSparseTable(A);
}

This is the readme for the UDM Project


UDM.Global

This is the project used for the Global Domain entities

UDM.ETL

This is the project for the SQL Server Integration Services used to populate the PostgreSQL database

// hard-code that the item will always have children
hasChildren: true
// map the hasChildren property to the hasSubordinates field, serialized from the server
hasChildren: "hasSubordinates"
// compute whether the given item will have children
hasChildren: function(item) {
return item.hasEmployees && item.relatedDepartment;
}
public static class Distance
{
public static double Levenshtein(string source, string target)
{
if (source.Length == 0)
return target.Length;
if (target.Length == 0)
return source.Length;