bobfang1992

`alembic` is great but lacks an out of the box way to set up running migrations against a specific database (e.g. `development`, `test`, `production`). The following adjustments to its `env.py` and `alembic.ini` allow us to target a specific database:

**Example:**

```bash
alembic -x db=development upgrade head
```

**env.py:**

bobfang1992

#include <iostream>

template <int...>
struct static_vector {
};

template <int n>
struct static_vector<n> {
    static constexpr int value = n;
    static_vector<> rest;

bobfang1992

Things to check:

1. It seems when creating indeces, the sqlalchemy will prepend table name when it is a Postgres database but does not do it if it is Sqlite Figure out if this is true. Pratically this implies that for PG you can have same index name across tables but not for Sqlite. Small issue but worth checking.

bobfang1992

from contextlib import contextmanager
from typing import ContextManager

from sqlalchemy.engine.base import Engine
from sqlalchemy.orm import sessionmaker
from sqlalchemy.orm.session import Session


@contextmanager
def get_seesion(engine: Engine) -> ContextManager[Session]:

bobfang1992

key - value mapping

{
  "name": "Bob"
  "age": 28,
  "sex": "male"
}

bobfang1992

DO $$ DECLARE
  r RECORD;
BEGIN
  FOR r IN (SELECT tablename FROM pg_tables WHERE schemaname = current_schema()) LOOP
    EXECUTE 'DROP TABLE ' || quote_ident(r.tablename) || ' CASCADE';
  END LOOP;
END $$;

bobfang1992

from fastapi import FastAPI
import uuid


app = FastAPI()

COM_API_OBJECT = {}

@app.get("/create")
async def create():

bobfang1992

class Solution:
    def gameOfLife(self, board: List[List[int]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
        
        m = len(board)
        if m == 0:
            return 
        n = len(board[0])

bobfang1992

class Solution:
    def largestRectangleArea(self, heights: List[int]) -> int:
        stack = [-1]
        
        result = 0
        heights.append(0)
        for i in range(len(heights)):
            while stack and heights[stack[-1]] > heights[i]:
                h = heights[stack.pop()]
                w = i - stack[-1] - 1

bobfang1992

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def getTargetCopy(self, original: TreeNode, cloned: TreeNode, target: TreeNode) -> TreeNode:
        val = target.val