smintz

#!/bin/bash

export LC_ALL=en_US.UTF-8

SCHEMA=${DEFAULT_SCHEMA:-$1}
TABLE=${DEFAULT_TABLE:-$2}
SOURCEINSTANCE=${DEFAULT_SOURCEINSTANCE:-'source'}
SOURCEUSER=${DEFAULT_SOURCEUSER:-'admin'}
SOURCEPORT=${DEFAULT_SOURCEPORT:-'5439'}
SOURCEDB=${DEFAULT_SOURCEDB:-'db'}

karmi

require 'tire'

# Tire.configure { logger STDERR, level: 'debug' }

Tire.index('movie-titles') do
  delete
  create \
    settings: {
      index: {
        analysis: {

klange

Since this is on Hacker News and reddit...

• No, I don't distribute my résumé like this. A friend of mine made a joke about me being the kind of person who would do this, so I did (the link on that page was added later). My actual résumé is a good bit crazier.
• I apologize for the use of _t in my types. I spend a lot of time at a level where I can do that; "reserved for system libraries? I am the system libraries".
• Since people kept complaining, I've fixed the assignments of string literals to non-const char *s.
• My use of type * name, however, is entirely intentional.
• If you're using an older compiler, you might have trouble with the anonymous unions and the designated initializers - I think gcc 4.4 requires some extra braces to get them working together. Anything reasonably recent should work fine. Clang and gcc (newer than 4.4, at le

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

viola

-- model
some sort of constant hash: 
HASH_NAME = {
 0 => "Choose:",
1 => "On-Campus Recruiting - CSO",·
2 => "CSO Staff Referral",
3 => "Faculty Contact",·
4 => "Career Day",·
5 => "CSO Summer Job Listing",·
6 => "Alumni Contact",·

subdigital

class CompressedRequests
  def initialize(app)
    @app = app
  end
  
  def call(env)
    if env['REQUEST_METHOD'] =~ /(POST|PUT)/ 
      if env.keys.include? 'HTTP_CONTENT_ENCODING'
        
        input = env['rack.input'].read