Joseph Gan bwgjoseph

## cache-oblivious.md

      
              1 file
            
          
              7 forks
            
          
              2 comments
            
          
              45 stars
            
          
                debasishg
                / cache-oblivious.md
            
            
              Last active
              July 8, 2024 16:19
            
              
                Papers related to cache oblivious data structures
              
          
    Cache Oblivious and Cache Aware Data Structure and Algorithms


Cache-Oblivious Algorithms and Data Structures - Erik Demaine (One of the earliest papers in cache oblivious data structures and algorithms that introduces the cache oblivious model in detail and examines static and dynamic cache oblivious data structures built between 2000-2003)


Cache Oblivious B-Trees - Bender, Demaine, Farch-Colton (This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. One of the fundamental papers in the field where both search trees discussed match the optimal search bound of Θ(1+log (B+1)N) memory transfers)


Cache Oblivious Search Trees via Binary Trees of Small Height - Brodal, Fagerberg, Jacob (The data structure discussed in this paper works on the version of [2] but avoids the use o


## storage.md

      
              1 file
            
          
              9 forks
            
          
              0 comments
            
          
              66 stars
            
          
                debasishg
                / storage.md
            
            
              Last active
              July 9, 2024 01:30
            
          
    Basics


The Log-Structured Merge-Tree (LSM-Tree)
B-Tree vs Log-Structured Merge-Tree
Modern B-tree techniques
LSM-based Storage Techniques: A Survey

B-trees and CPU Caches


B-tree Indexes and CPU Caches by Goetz Graefe and Per-Åke Larson


## CustomBodyAnnotationApplication.java
package com.example.custombodyannotation;

import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Target;
import java.util.List;

import javax.servlet.http.HttpServletRequest;

## README.md

      
              1 file
            
          
              3 forks
            
          
              6 comments
            
          
              38 stars
            
          
                kentcdodds
                / README.md
            
            
              Last active
              August 9, 2022 09:52
            
              
                Function syntaxes supported by TypeScript
              
          
    The blog post has been written: https://kentcdodds.com/blog/typescript-function-syntaxes

TypeScript Function Syntaxes

I'm trying to create examples of all the different ways to write functions and function type definitions in TypeScript.
One requirement is these examples must work with strict mode (noImplicitAny, etc) enabled.
If I'm missing anything, please add comments below with examples. I'll eventually put this into a blog post.

  
## flappy.html
<body onload=z=c.getContext`2d`,setInterval(`c.width=W=150,Y<W&&P<Y&Y<P+E|9<p?z.fillText(S++${Y=`,9,9|z.fillRect(p`}*0,Y-=--M${Y+Y},P+E,9,W),P))):p=M=Y=S=6,p=p-6||(P=S%E,W)`,E=49) onclick=M=9><canvas id=c>

## types.ts

// when T is any|unknown, Y is returned, otherwise N
type IsAnyUnknown<T, Y, N> = unknown extends T ? Y : N;

// when T is never, Y is returned, otherwise N
type IsNever<T, Y = true, N = false> = [T] extends [never] ? Y : N;

// when T is a tuple, Y is returned, otherwise N
// valid tuples = [string], [string, boolean],
// invalid tuples = [], string[], (string | number)[]

## tweet-when-to-use-generators-iterators.js
// Builds array of everything ahead of time
function collectAllItems() {
  return [calculateFirst(), calculateSecond(), ...]
}

// This loop will end as soon as `isMatch(item)` is truthy.
// If the very first item in the array is a match, then we
// wasted all this time building the array in the first place.
for (let item of collectAllItems()) {
  if (isMatch(item)) {

## opa-vs-casbin.md

      
              1 file
            
          
              3 forks
            
          
              7 comments
            
          
              46 stars
            
          
                StevenACoffman
                / opa-vs-casbin.md
            
            
              Last active
              July 18, 2024 15:27
            
              
                OPA vs Casbin
              
          
    Information in this Gist originally from this github issue, which is outdated.

As @RomanMinkin mentioned, you can also consider Casbin (https://github.com/casbin/casbin). It is the most starred authorization library in Golang. There are several differences between Casbin and OPA.


Feature
Casbin
OPA


Library or service?
Library/Service
Library/Service


How to write policy?
Two parts: model and policy. Model is general authorization logic. Policy is concrete policy rule.
A single part: Rego


RBAC hierarchy
Casbin supports role hierarchy (a role can have a sub-role)
Role hierarchies can be encoded in data. Also with the new graph.reachable() built-in function queries over those hierarchies are much more feasible now.


RBAC separation of duties
Not supported
Supported: two roles cannot be assigned together


## move-photos.js
const path = require('path')
const fs = require('fs')
const execSync = require('child_process').execSync

if (!process.argv[2] || !process.argv[3]) {
  throw new Error('you did not pass the source and destination paths')
}

const searchPath = path.join(process.cwd(), process.argv[2])
const destination = path.join(process.cwd(), process.argv[3])

## everything-i-know-about-routing.md

      
              1 file
            
          
              34 forks
            
          
              9 comments
            
          
              326 stars
            
          
                ryanflorence
                / everything-i-know-about-routing.md
            
            
              Last active
              May 29, 2024 20:14
            
          
    Everything I Know About UI Routing

Definitions


Location - The location of the application. Usually just a URL, but the location can contain multiple pieces of information that can be used by an app

pathname - The "file/directory" portion of the URL, like invoices/123
search - The stuff after ? in a URL like /assignments?showGrades=1.
query - A parsed version of search, usually an object but not a standard browser feature.
hash - The # portion of the URL. This is not available to servers in request.url so its client only. By default it means which part of the page the user should be scrolled to, but developers use it for various things.
state - Object associated with a location. Think of it like a hidden URL query. It's state you want to keep with a specific location, but you don't want it to be visible in the URL.
	package com.example.custombodyannotation;

	import java.lang.annotation.ElementType;
	import java.lang.annotation.Retention;
	import java.lang.annotation.RetentionPolicy;
	import java.lang.annotation.Target;
	import java.util.List;

	import javax.servlet.http.HttpServletRequest;

	// when T is any\|unknown, Y is returned, otherwise N
	type IsAnyUnknown<T, Y, N> = unknown extends T ? Y : N;

	// when T is never, Y is returned, otherwise N
	type IsNever<T, Y = true, N = false> = [T] extends [never] ? Y : N;

	// when T is a tuple, Y is returned, otherwise N
	// valid tuples = [string], [string, boolean],
	// invalid tuples = [], string[], (string \| number)[]
	// Builds array of everything ahead of time
	function collectAllItems() {
	return [calculateFirst(), calculateSecond(), ...]
	}

	// This loop will end as soon as `isMatch(item)` is truthy.
	// If the very first item in the array is a match, then we
	// wasted all this time building the array in the first place.
	for (let item of collectAllItems()) {
	if (isMatch(item)) {
Feature	Casbin	OPA
Library or service?	Library/Service	Library/Service
How to write policy?	Two parts: model and policy. Model is general authorization logic. Policy is concrete policy rule.	A single part: Rego
RBAC hierarchy	Casbin supports role hierarchy (a role can have a sub-role)	Role hierarchies can be encoded in data. Also with the new `graph.reachable()` built-in function queries over those hierarchies are much more feasible now.
RBAC separation of duties	Not supported	Supported: two roles cannot be assigned together
	const path = require('path')
	const fs = require('fs')
	const execSync = require('child_process').execSync

	if (!process.argv[2] \|\| !process.argv[3]) {
	throw new Error('you did not pass the source and destination paths')
	}

	const searchPath = path.join(process.cwd(), process.argv[2])
	const destination = path.join(process.cwd(), process.argv[3])