harsh183

#!/usr/bin/env ruby
# frozen_string_literal: true

require 'English'
require 'json'
require 'tempfile'
require 'fileutils'

# StackedPR creates and manages stacked pull requests for Jujutsu commits
class StackedPR

harsh183

#!/usr/bin/env ruby

# Load Ruby's standard Date library
require 'date'

# Travel data as key-value map where arrival date points to departure date
# Each pair represents how long spent in the country during that visit
# Note: Most recent arrival (2025-03-30) uses projected departure of Nov 1, 2025
trips_data = {
  '2025-03-30' => '2025-11-01',  # Current visit - projected departure Nov 1, 2025

harsh183

from discord.ext import commands
from googlesearch import search

bot = commands.Bot(command_prefix='!')

@bot.command(name="uiuc", help="Find a UIUC specific resources")
async def uiuc(ctx, *, question):
    # breakpoint()
    search_text = f"UIUC {question}"
    await ctx.send("You've come to the right place for help! :slight_smile:")

harsh183

I've gotten many questions about this from both students, and current existing course staff since type inference is a reasonably new age concept that is getting picked up in the programming languages of the 2010s and 2020s.

The lesson gives a pretty good starting point, especially the 7-minute walkthrough here on the basics of type inference.

---

Talk is cheap, show me the code

I redid a few of the older problems using var type inference across a few of the past homework problems to see this in action. I highly suggest checking these out.

harsh183

interface TestCase {
  boolean test();
}
// print title if case fails
void checkCase(String title, TestCase t) {
  if (t.test() == false) {
    System.out.println("Failed: " + title);
  }
}
int add(int a, int b) {

harsh183

// Linked list
data class Node<T>(var value: T, var next: Node<T>?);

fun main() {
  val head = Node(1, null)
  val second = Node(2, Node(3, null))   // two more (init multiple)
  head.next = second
  
  println(head.value)                   // 1
  println(head.next?.value)             // 2

harsh183

#!/usr/bin/env bash
set -ex

kotlinc $1 -d $1.jar
java -jar $1.jar

harsh183

fun main() {
    // Both are the same
    val array1: Array<Int> = arrayOf(0, 1, 4, 9, 16) 
    val list1: List<Int> = listOf(0, 1, 4, 9, 16)
    val map1: Map<Int, Int> = mapOf(0 to 0, 1 to 1, 2 to 4, 3 to 9, 4 to 16)
    
    val array2: Array<Int> = Array(5) { it*it }
    val list2: List<Int> = List(5) {it*it}
    val map2: Map<Int, Int> = (Array(5) {it}).associate {it to it*it}
}

harsh183

fun main() {
    // normal function
    repeat(3) { print("Yay $it ") }
    // => Yay 0 Yay 1 Yay 2 
  
    2.times { print("Looop ") }
    // => Looop Looop 
    10.times { print("$it ") }
    // => 0 1 2 3 4 5 6 7 8 9
}

harsh183

#include <iostream>
#include <string>
#include <vector>

#include <functional> // std::function, std::bind
#include <algorithm>  // std::transform, std::remove_if 
#include <numeric>    // std::accumulate

using namespace std;