GraphQL Bug Detector

import functools


@functools.lru_cache(maxsize=100)
def fibonacci(n):
   if n < 2:
       return n
   return fibonacci(n - 1) + fibonacci(n - 2)

import asyncio


async def task_process():
   await asyncio.sleep(3)
   print('Task complete')

async def activator():
   task = asyncio.ensure_future(task_process())
   await asyncio.sleep(1)
   print('Activating...')

activator()

for i in range(2, 10):
    for j in range(2, i):
        if i % j == 0:
            print(f'{i} equals {j} * {i//j}')
            break
    else:
        print(f'{i} is a prime number')

sql = '''
SELECT name, annual_revenue
FROM company
WHERE country = 'USA'
ORDER BY annual_revenue DESC
LIMIT 5
''';
cursor.execute(sql)

WITH RECURSIVE cnt(x) AS ( 
   SELECT 1 
   UNION ALL 
   SELECT x+1 FROM cnt 
   LIMIT 1000000 
) 
SELECT x FROM cnt;

import pandas as pd
df = pd.DataFrame({'A': ['foo', 'bar', 'foo', 'bar', 'foo', 'bar', 'foo', 'bar'],
                   'B': ['one', 'one', 'two', 'three', 'two', 'two', 'one', 'three'],
                   'C': np.random.randn(8),
                   'D': np.random.randn(8)})
g = df.groupby(['A', 'B']).sum()

adults = filter(lambda x: x['age'] > 18, people)

str1 = 'Welcome'
str2 = 'Home'
str3 = f'{str1} {str2}'

HASHX(ALL('Sales'[Fiscal Year]), 'Sales'[Fiscal Year], [Total Sales])

=INDEX($A$1:$C$20, MATCH(1,($B$1:$B$20=$E$1)*($C$1:$C$20=$E$2), 0), 1)