edisonywh

import React, { useMemo, useState } from "react";
import { format, addDays, startOfWeek, endOfWeek, startOfMonth, endOfMonth, isSameMonth, addMonths, subMonths, parseISO, Interval, isFuture, getTime, isToday, isSameDay } from "date-fns";

import { classNames, isoToUtc } from "../Shared/utils";
import { Habit, HabitType, Progress, Streak, Entry } from "../Shared/types";
import { isWithinInterval } from "date-fns/esm";
import CircularProgressBar from "./CircularProgressBar";

type Prop = {
  habit: Habit,

edisonywh

defmodule SlickWeb.NewsletterSuggestionComponent do
  use SlickWeb, :live_component

  def mount(socket) do
    socket =
      socket
      |> assign(:suggestions, [])
      |> assign(:picked, nil)

    {:ok, socket}

edisonywh

require 'objspace'

class Foo
  def self.memo_hash
    @_memo_hash ||= begin
      Hash.new(100)
    end
  end
end

edisonywh

# Note: This is pretty badly written code, I just wrote it as a quick proof for https://dev.to/edisonywh/how-arrays-work-the-way-arrays-work-3bpg
# To get the growth rate of the array, just look at the jump in memory bytes after every copy. You can see that it's about 1.5~

require 'objspace' # Require this for additional ObjectSpace methods

def memory_calculator
  array = Array.new
  result = {}

  100.times do |i|

edisonywh

require 'httparty'
require 'pry'
require 'nokogiri'
require 'terminal-notifier'

class FeedService

  attr_accessor :url
  attr_accessor :keyword

edisonywh

```
#!/bin/sh
echo "\nRunning rubocop 🚓 💨 💨 💨\n"

declare -a ERRORS=()

for file in $(git diff --cached --name-only | grep -E '.rb')
do
	ERRORS+=("$(rubocop $file | grep -e 'C:' -e 'E:')")
done