-
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
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import * as Sentry from "@sentry/node"; | |
| import imagemin from "imagemin"; | |
| import mozjpeg from "imagemin-mozjpeg"; | |
| import sharp from "sharp"; | |
| import isJpg from "is-jpg"; | |
| import * as aws from "aws-sdk"; | |
| import { Upload } from "../../types/graphqlUtils"; | |
| import { generateFilename } from "./generateFilename"; | |
| export const s3 = new aws.S3({ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Douglas Hill, December 2018 | |
| // Made for https://douglashill.co/reading-app/ | |
| // Find the latest version of this file at https://github.com/douglashill/KeyboardKit | |
| import UIKit | |
| /// A table view that allows navigation and selection using a hardware keyboard. | |
| /// Only supports a single section. | |
| class KeyboardTableView: UITableView { | |
| // These properties may be set or overridden to provide discoverability titles for key commands. |
In this challenge you will create a folders table, create a new router and endpoints for the folders, and update the existing notes endpoints to return folder related data.
- Create a
folderstable- Optionally, alter the default sequence so the folder IDs start at 100
- Add a
folder_idcolumn to thenotestable and define the relationship - Populate the
folderstable with sample data and update thenotesdata to include folders.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // | |
| // UIView+Constraints.swift | |
| // CiLabs | |
| // | |
| // Copyright © 2019 Netguru.co. All rights reserved. | |
| // | |
| import UIKit | |
| typealias Constraint = (_ layoutView: UIView) -> NSLayoutConstraint |
NewerOlder