Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)
That's it!
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)
That's it!
Ok, I geeked out, and this is probably more information than you need. But it completely answers the question. Sorry. ☺
Locally, I'm at this commit:
$ git show
commit d6cd1e2bd19e03a81132a23b2025920577f84e37
Author: jnthn <jnthn@jnthn.net>
Date: Sun Apr 15 16:35:03 2012 +0200
When I added FIRST/NEXT/LAST, it was idiomatic but not quite so fast. This makes it faster. Another little bit of masak++'s program.
import { NamingStrategyInterface, DefaultNamingStrategy } from 'typeorm' | |
import { snakeCase } from 'typeorm/util/StringUtils' | |
export class SnakeNamingStrategy extends DefaultNamingStrategy implements NamingStrategyInterface { | |
tableName(className: string, customName: string): string { | |
return customName ? customName : snakeCase(className) | |
} | |
columnName(propertyName: string, customName: string, embeddedPrefixes: string[]): string { | |
return snakeCase(embeddedPrefixes.join('_')) + (customName ? customName : snakeCase(propertyName)) |