josepmartins

# Inline svg from @tomeara https://gist.github.com/tomeara/6515860
def inline_svg(path)
  file = File.open("app/assets/images/#{path}", "rb")
  raw file.read
end

# Use SVG internal link
def use_svg(clazz)
  content_tag(:svg, content_tag(:use, "", { "xlink:href" => '#icon-' + clazz }), class: "icon icon-#{clazz}")
end

ericdke

func showNotification() -> Void {
    var notification = NSUserNotification()
    notification.title = "Test from Swift"
    notification.informativeText = "The body of this Swift notification"
    notification.soundName = NSUserNotificationDefaultSoundName
    NSUserNotificationCenter.defaultUserNotificationCenter().deliverNotification(notification)
}

//showNotification()

njakobsen

class DatabaseController < ApplicationController
  def database_dump
    database = Rails.configuration.database_configuration[Rails.env]["database"]
    send_file_headers!(:type => 'application/octet-stream', :filename => "#{database}_#{Time.now.to_s(:human)}.backup")

    pipe = IO.popen("pg_dump '#{database}' -F c")
    stream = response.stream
    while (line = pipe.gets)
      stream.write line
      sleep 0.0001 # HACK: Prevent server instance from sleeping forever if client disconnects during download

suan

class InfiniteArray < Array
  def initialize(value)
    super(1, value)
  end
  def [](index)
    self.first
  end
end

cpjolicoeur

I'm hunting for the best solution on how to handle keeping large sets of DB records "sorted" in a performant manner.

Problem Description

Most of us have work on projects at some point where we have needed to have ordered lists of objects. Whether it be a to-do list sorted by priority, or a list of documents that a user can sort in whatever order they want.

A traditional approach for this on a Rails project is to use something like the acts_as_list gem, or something similar. These systems typically add some sort of "postion" or "sort order" column to each record, which is then used when querying out the records in a traditional order by position SQL query.

This approach seems to work fine for smaller datasets, but can be hard to manage on large data sets with hundreds (or thousands) of records needing to be sorted. Changing the sort position of even a single object will require updating every single record in the database that is in the same sort group. This requires potentially thousands of wri