anilpai

def flatten(lst):
  '''
  Flattens a list of lists.
  '''
  r = []
    for x in lst:
       if type(x) is list:
          r.extend(x)
       else:
          r.append(x)

anilpai

Backend Architectures

Twitter

ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats

• Introduce Gizzard of Twitter - 트위터의 새로운 분산 관리 라이브러리 Gizzard를 소개합니다.
• The Architecture Twitter Uses to Deal with 150M Active Users, 300K QPS, a 22 MB/S Firehose, and Send Tweets in Under 5 Seconds
• Scaling Twitter: Making Twitter 10000 Percent Faster

anilpai

class Student:

    def __init__(self, first_name, last_name):
        self.first_name = first_name
        self.last_name = last_name
        
    @classmethod
    def from_string(cls, name_str):
      first_name, last_name = map(str, name_str.split(' '))
      student = cls(first_name, last_name)

anilpai

import jaydebeapi

username = ''
password = ''

conn = jaydebeapi.connect('com.qubole.jdbc.jdbc41.core.QDriver',
                          'jdbc:qubole://hive/default/db_name?endpoint=https://us.qubole.com',
                          ['', password])

if conn:

anilpai

def min_hacks(d, p):
    p_list = list(p)
    can_swap = True
    curr_damage, num_of_hacks = (0,)*2

    while can_swap:
        curr_damage, shoot_damage = 0, 1
        for c in p_list:
            if c == 'S':
                curr_damage += shoot_damage

anilpai

Commit Type Emoji Initial Commit 🎉 Party Popper Version Tag 🔖 Bookmark New Feature ✨ Sparkles Bugfix 🐛 Bug Security Fix 🔒 Lock Metadata 📇 Card Index Refactoring ♻️ Black Universal Recycling Symbol Documentation 📚 Books Internationalization 🌐 Globe With Meridians

anilpai

 python3 setup.py sdist upload -r pypi

anilpai

class LNode:
  """defining a linked list node"""
  def __init__(self, value,next=None, random=None):
    self.value = value
    self.random = random
    self.next = next
  
  def __str__(self):
    return "(%s)"%(self.value)

anilpai

class TreeNode:
  def __init__(self, value, left=None, right=None):
    self.value = value
    self.left = left
    self.right = right
  
def build_a_tree():
  root = TreeNode(10)
  a = TreeNode(20)

anilpai

class TreeNode:
  def __init__(self, value, left=None, right=None):
    self.value = value
    self.left = left
    self.right = right
  
def build_a_tree():
  root = TreeNode(10)
  a = TreeNode(20)