jaymcgavren

jaymcgavren

1-fade.xm
2-higrou.xm
32coop.xm
4-bottle.xm
5-potion.xm
aalto.xm
chip1.xm
cloudcomplex_ds.xm
come_guilt.xm
cotton.xm

jaymcgavren

class ListenerQueue
  attr_reader :listeners
  def initialize
    @listeners = []
  end
  def register(listener)
    @listeners << listener
  end
  def share_message(receiver, method_name, args, kwargs)
    @listeners.each do |listener|

jaymcgavren

module MethodBroadcaster
  def broadcast_calls_to(*method_names)
    proxy = Module.new
    method_names.each do |method_name|
      proxy.define_method(method_name) do |*args, **kwargs, &block|
        arg_strings = args.map(&:inspect)
        kwarg_strings = kwargs.map{|k, v| "#{k}: #{v.inspect}" }
        all_arg_strings = arg_strings + kwarg_strings
        puts "#{method_name}(#{all_arg_strings.join(', ')})"
        super(*args, **kwargs, &block)

jaymcgavren

# Untitled Text Adventure prototype.
# Copyright 2024 Jay McGavren. All rights reserved.

class Thing
  attr_accessor :name
  def initialize(name:)
    @name = name
  end
end

jaymcgavren

Abstractile.saver
Anemone.saver
Anemotaxis.saver
AntInspect.saver
AntMaze.saver
AntSpotlight.saver
Apollonian.saver
Atlantis.saver
Attraction.saver
Beats.saver

jaymcgavren

$ wdiff gpt_as_jaymcgavren.txt gpt_as_dhh.txt
Hey there, fellow [-Rubyists! Today, we're going to-] {+Ruby enthusiasts! Let's+} talk about [-one of-] {+Hashes,+} the [-most powerful-] {+gloriously versatile+} data [-structures in Ruby: Hashes.

If you're new-] {+structure that's as essential+} to [-programming or just getting started with Ruby, you might be wondering what a Hash is. Simply put, a Hash-] {+Ruby as air+} is [-a collection-] {+to breathing.

Hashes, also known as associative arrays or dictionaries in other programming languages, are an integral part+} of {+the Ruby ecosystem. They let you group together+} key-value [-pairs, where each key maps to-] {+pairs that are easily accessible and modifiable using+} a [-corresponding value.-] {+key.+} Think of [-it-] {+them+} as [-a dictionary,-] {+an unordered list of items+} where {+each item has its own name that+} you [-look up a word (the key)-] {+can use+} to [-find its definition (the value).-] {+fetch it.+}

Here's a simple [-example:-] {+example t

jaymcgavren

javascript:setTimeout(async()=>await navigator.clipboard.writeText('"'+window.getSelection().toString()+'"\n'+location), 50);

jaymcgavren

Syntax basics

• Compiled language

• Who created Go, and why

  • Fast builds
  • Fast execution
  • Concurrency
  • Garbage collection

jaymcgavren

Copyright 2022 Jay McGavren

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHE