It is a symbol table specialized to string keys.
The goal is to device a data structure that is Faster than hashing and More flexible than BSTs.
Challenge - Efficient Performance for String keys
variable "aws_profile" { | |
description = "AWS Profile For Deployment" | |
} | |
variable "aws_region" { | |
description = "AWS Region For Deployment" | |
} | |
variable "project" { | |
type = string |
interface PostalChannel { | |
channel: string, | |
topic: string | |
} | |
export const useEventBus = (channel: PostalChannel, callback: (data: any) => void) => { | |
const [state, setState] = useState({}); | |
useEffect(() => { | |
const subscription = postal.subscribe({ |
export interface Subscriber { | |
name: string | |
callback: (data: any) => void | |
} | |
class EventBus { | |
private static instance: EventBus | undefined | |
private subscribers: Map<string, Array<Subscriber>> | |
constructor() { |
cat << 'EOF' > ~/.tilde-switch && chmod +x ~/.tilde-switch | |
hidutil property --set '{"UserKeyMapping":[{"HIDKeyboardModifierMappingSrc":0x700000035,"HIDKeyboardModifierMappingDst":0x700000064},{"HIDKeyboardModifierMappingSrc":0x700000064,"HIDKeyboardModifierMappingDst":0x700000035}]}' | |
EOF | |
sh .tilde-switch | |
# To revert back, run the following: | |
# hidutil property --set '{"UserKeyMapping":[{"HIDKeyboardModifierMappingSrc":0x700000035,"HIDKeyboardModifierMappingDst":0x700000035},{"HIDKeyboardModifierMappingSrc":0x700000064,"HIDKeyboardModifierMappingDst":0x700000064}]}' |
<!-- | |
~ Hibernate, Relational Persistence for Idiomatic Java | |
~ | |
~ License: GNU Lesser General Public License (LGPL), version 2.1 or later. | |
~ See the lgpl.txt file in the root directory or <http://www.gnu.org/licenses/lgpl-2.1.html>. | |
--> | |
<persistence xmlns="http://java.sun.com/xml/ns/persistence" | |
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" | |
xsi:schemaLocation="http://java.sun.com/xml/ns/persistence http://java.sun.com/xml/ns/persistence/persistence_2_0.xsd" | |
version="2.0"> |
import java.util.Arrays; | |
public class BottomUpMergeSort implements Sort { | |
@Override | |
public int[] sort(int[] input) { | |
var arr = Arrays.copyOf(input, input.length); | |
var aux = new int[input.length]; | |
for (var width = 1; width < arr.length; width = 2 * width) { | |
int i; | |
for (i = 0; i < arr.length; i = i + 2 * width) { |
import os | |
import requests | |
import json | |
from app.report import Report | |
BITBUCKET_BASE_URL = os.environ['BITBUCKET_URL'] # bitbucket base url | |
ACCESS_TOKEN = os.environ['ACCESS_TOKEN'] # get this token from bitbucket account | |
JENKINS_BASE_URL = os.environ['JENKINS_URL'] # host url for Jenkins | |
headers = { |
#include<iostream> | |
using namespace std; | |
int low; | |
int hi; | |
void test_cases() { | |
cin >> low; cin.ignore(); | |
cin >> hi; cin.ignore(); |
import com.bma.algorithms.sort.elementary.Util; | |
import java.io.BufferedWriter; | |
import java.io.File; | |
import java.io.FileWriter; | |
import java.io.IOException; | |
import java.util.Collections; | |
import java.util.LinkedList; | |
import java.util.List; | |
import java.util.Random; |