pschanely

def make_bigger(n: int) -> int:
  '''
  post: __return__ != 0
  '''
  return 2 * n + 10

pschanely

def make_bigger(n: int) -> int:
  '''
  post: __return__ != 0
  '''
  return 2 * n + 10

pschanely

from dataclasses import dataclass

class HasConsistentHash:
    '''
    A mixin to enforce that classes have hash methods that are consistent
    with thier equality checks.
    '''
    def __eq__(self, other: object) -> bool:
        '''
        post: implies(__return__, hash(self) == hash(other))

pschanely

% cat example.py           
from hypothesis import given, settings
from hypothesis import strategies as st

@settings(backend="crosshair")
@given(st.sets(st.integers()))
def test(d):
    assert d != {42, 123}

test()

pschanely

def make_bigger(n: int) -> int:
  '''
  post: __return__ != 0
  '''
  return 2 * n + 10

pschanely

from typing import List

def remove_duplicates(numbers: List[int]) -> List[int]:
    """
    Removes duplicate numbers from the given list while preserving the order of the remaining elements.
    """
    
    # Precondition: List must not be empty
    assert len(numbers) > 0, "List must not be empty"
    

pschanely

def ex1(x=0):

    if x == 0: return 0

    if x*2 == 1: 
        return -1
    else: 
        return 1

pschanely

import dataclasses
from typing import List

@dataclasses.dataclass
class AverageableQueue:
    '''
    A queue of numbers with a O(1) average() operation.
    inv: self._total == sum(self._values)
    '''
    _values: List[int]

pschanely

def make_bigger(n: int) -> int:
  '''
  post: __return__ != 0
  '''
  return 2 * n + 10

pschanely

def make_bigger(n: int) -> int:
  '''
  post: __return__ != 0
  '''
  return 2 * n + 10