| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 | 31 |
Tags
- 밴픽
- 운영체제
- 715. Range Module
- Python Implementation
- Python Code
- Convert Sorted List to Binary Search Tree
- kaggle
- 30. Substring with Concatenation of All Words
- LeetCode
- DWG
- shiba
- iterator
- 315. Count of Smaller Numbers After Self
- attribute
- 파이썬
- Python
- t1
- Decorator
- Substring with Concatenation of All Words
- Regular Expression
- Protocol
- 컴퓨터의 구조
- 프로그래머스
- concurrency
- 시바견
- 43. Multiply Strings
- data science
- Class
- Generator
- 109. Convert Sorted List to Binary Search Tree
Archives
- Today
- Total
목록Method (1)
Scribbling
Python Magic Methods: Pythonic Data Model
In this post, I am dealing with 'magic methods' to create more pythonic data models. First Example: Card Deck Card = namedtuple('Card', ['rank', 'suit']) class FrenchDeck: ranks = [str(n) for n in range(2, 11)] + list('JQKA') suits = ['Spades', 'Diamonds', 'Hearts', 'Clubs'] def __init__(self): self._cards = [Card(rank, suit) for suit in FrenchDeck.suits for rank in FrenchDeck.ranks] def __len__..
Computer Science/Python
2022. 3. 16. 13:54