#ruby
Double splat arguments in Crystal
In Crystal, as well as in Ruby you can use double splat arguments. Unfortunately they behave a bit different.
def foo(**options)
baz(**options, a: 1)
end
def baz(**options)
puts options
end
foo(b: 2, a: 3) # {:b=>2, :a=>1}
This code in Ruby works as it should. If we try the same in Crystal (https://play.crystal-lang.org/#/r/7r0l), we got an error:
error in line 2
Error: duplicate key: a
This happens because **options is a NamedTuple and it cannot have duplicate keys. I found that using NamedTuple#merge can be a workaround (https://play.crystal-lang.org/#/r/7s1c):
def foo(**options)
baz(**options.merge(a: 1))
end
def baz(**options)
puts options
end
foo(b: 2, a: 3) # {:b=>2, :a=>1}
Hack!
Strip Whitespace from Heredocs in Ruby/Rails
UPDATE!
Simple way - it's use:
class Template
def self.base
<<~TEXT
Lorem Ipsum is simply dummy
Lorem Ipsum is simply dummy
TEXT
end
end
> Template.base
=> "Lorem Ipsum is simply dummy\nLorem Ipsum is simply dummy\n"
I forgot about <<~, and that's why I got this TIL bike.
You use heredoc in Ruby/Rails app?
Then you're familiar with the problem..
class Template
def self.base
<<-TEXT
Lorem Ipsum is simply dummy
Lorem Ipsum is simply dummy
Lorem Ipsum is simply dummy
TEXT
end
end
> Template.base
=> " Lorem Ipsum is simply dummy\n Lorem Ipsum is simply dummy\n Lorem Ipsum is simply dummy\n"
hmm...
I don't want to have so many gaps in the text.
Maybe use them:
class Template
def self.base
<<-TEXT
Lorem Ipsum is simply dummy
Lorem Ipsum is simply dummy
TEXT
end
end
> Template.base
=> "Lorem Ipsum is simply dummy\nLorem Ipsum is simply dummy\n"
It's good, but the code looks like 💩.
This problem can be solved by using activesupport #strip_heredoc:
class Template
def self.base
<<-TEXT.strip_heredoc
Lorem Ipsum is simply dummy
Lorem Ipsum is simply dummy
TEXT
end
end
> Template.base
=> "Lorem Ipsum is simply dummy\nLorem Ipsum is simply dummy\n"
If you don't have active_support, use refine String with #strip_heredoc which will give similar result:
module Utils
refine String do
def strip_heredoc
gsub(/^#{scan(/^[ \t]*(?=\S)/).min}/, "".freeze)
end
end
end
class Template
using Utils
def self.base
<<-TEXT.strip_heredoc
Lorem Ipsum is simply dummy
Lorem Ipsum is simply dummy
TEXT
end
end
> Template.base
=> "Lorem Ipsum is simply dummy\nLorem Ipsum is simply dummy\n"
Rails 5.2 changes in callbacks
In version 5.1 you may see deprecation warnings in after_save callbacks (related to changes in ActiveRecord::Dirty module).
But since 5.2 these changes were applied.
For examples, I will use Rails 4.2.11 and Rails 5.2.3 and model User with email attribute. Let's do:
u = User.new(email: 'old@domain.com')
u.save
u.email = 'new@domain.com'
u.save
and look at after_save callback in time of last save.
1. attribute_changed?
Rails 4
> email_changed?
=> true
Rails 5.2
> email_changed?
=> false
but you can use saved_changes?
> saved_change_to_email?
=> true
2. changed?
Rails 4
> changed?
=> true
Rails 5.2
> changed?
=> false
but you can use saved_changes?
> saved_changes?
=> true
3. changes
Rails 4
> changes
=> {"email"=>["old@domain.com", "new@domain.com"]}
Rails 5.2
> changes
=> {}
but you can use saved_changes
> saved_changes
=> {"email"=>["old@domain.com", "new@domain.com"]}
4. previous_changes
Rails 4
> previous_changes
=> {"email"=>[nil, "old@domain.com"]}
Rails 5.2
Now, this method returns the changes that were just saved (like saved_changes).
> previous_changes
=> {"email"=>["old@domain.com", "new@domain.com"]}
this method has no replacement.
Simple way to get all values from hash
In the ruby from the box, we can't find all the hash values if it's nested.
I suggest an easy way to find all the values using recursion.
Example hash:
hash = {
a: 2,
b: { c: 3, d: 4, e: {f: 5}}
}
> hash.values
=> [2, {:c=>3, :d=>4, :e=>{:f=>5}}]
That's not an option, we need all the values.
def deep_values(array = [], object:)
object.each do |_key, value|
if value.is_a?(Hash)
deep_values(array, object: value)
else
array << value
end
end
array
end
> deep_values(object: hash)
=> [2, 3, 4, 5]
If you run the benchmark with this data, we get the following data:
> puts Benchmark.measure { 100_000.times { hash.values } }
=> 0.028920 0.002643 0.031563 ( 0.032759)
> puts Benchmark.measure { 100_000.times { deep_values(object: hash ) } }
=> 0.140439 0.003318 0.143757 ( 0.146637)
How to parse CSV with double quote (") character in Crystal
We use microservice written in Crystal to parse large CSV files (about 1.5Gb). Some rows in these files may contain no closed " characters:
,Y,FEDERAL NATIONAL MORTGAGE ASSOCIATION "F,,
With Crystal default CSV parse settings this row and everything after it won't be parsed correctly because DEFAULT_QUOTE_CHAR constant is equal to ". Of couse you can override quote_char param in CSV contstructor with something that cannot be found in your document.
From my point of view the best is to use zero byte which is '\u0000' in Crystal.
csv = CSV.new(file, headers: true, strip: true, quote_char: '\u0000')
while csv.next
# ...
end
Hack!
Determining class of an object with case equality operator (===)
Case equality operator (or triple equals, ===) in Ruby returns true if the passed class is in the ancestors list of the passed object's class:
1.class.ancestors # [Integer, Numeric, Object, ...]
Numeric === 1 # true
Object === 1 # true
So it can be used for determining object's class:
String === 'abc' # true
'abc'.class #=> String
In cases above the case equality operator works like #kind_of? (or #is_a?):
1.kind_of?(Integer) # true
1.is_a?(Numeric) # true
The classes above has different implementations of === operator, that's why the results of comparison are different:
String.===('abc') # the same as String === 'abc'
Also it means that order of the arguments is important:
1 === Integer # false
Ruby double splat (**) operator cheatsheet
The operator ** is useful as an options hash.
def one_method(**options);end
This form is completely similar to the following:
def another_method(options = {});end
In addition, you can strictly define the set of required keys for the method.
def one_strict_method(first_name:, last_name: , **options)
puts "options: #{options}"
greeting = "Hello #{first_name} #{last_name}"
puts options[:upcase] ? greeting.upcase : greeting
end
pry(main)> one_strict_method(upcase: true)
ArgumentError: missing keywords: first_name, last_name
pry(main)> one_strict_method(first_name: 'John', last_name: 'Doe', upcase: true)
options: {:upcase=>true}
HELLO JOHN DOE
=> nil
Another advantage of double splat literal is that it works like #merge for Ruby Hash
class Contact::ShowRepresenter #:nodoc:
def call(contact)
{
contact: {
**base_info(contact),
**legal_info(contact),
# You can add something more complex here.
# **GeoLocaionRepresenter.new.(contact)
}
}
end
private
def base_info(contact)
{
id: contact.id,
first_name: contact.first_name,
last_name: contact.last_name,
email: contact.email,
phone: contact.phone
}
end
def legal_info(contact)
{
legal_name: contact.legal_name,
legal_type: contact.legal_type,
mailing_address: contact.mailing_address
}
end
end
pry(main)>Contact::ShowRepresenter.new.(Contact.last)
=> {
:contact=>{
:id=>51986,
:first_name=>"Ilia",
:last_name=>"Kriachkov",
:email=>"ilia.kriachkov@jetrockets.ru",
:phone=>"+79000000000",
:legal_name=>"JetRockets",
:legal_type=>"LLC",
:mailing_address=>"15 Let Oktyabrya Street, #10b, Tver, Russian Federation 170008"
}
}
In conclusion, I want to demonstrate some benchmark results.
As you can see, the ** operator is a bit faster than Hash#merge.
require 'benchmark'
n = 50_000
Benchmark.bm(2) do |x|
x.report('merge: ') { n.times { merge } }
x.report('double_splat_merge:') { n.times { double_splat_merge } }
end
def merge
hash = { a: 'a' }
{ b: 'b' }.merge(hash)
end
def double_splat_merge
hash = { a: 'a' }
{ b: 'b', **hash }
end
user system total real
merge: 0.109247 0.088652 0.197899 ( 0.204470)
double_splat_merge: 0.079480 0.003590 0.083070 ( 0.083642)
How to store large JSON in PostgreSQL with Rails Attributes API
If you store large objects in the database (such as JSON), for example, data for big reports, then this can take up a lot of space. To reduce the size of data, you can compress and store in binary form.
PostgreSQL has a bytea field type for storing such data. You can add bytea column in Rails using migration
add_column :reports, :data, :binary
For binary field operations, you can use the Rails Attributes API and add a new BinaryHash data type
# app/types/binary_hash.rb
class BinaryHash < ActiveRecord::Type::Binary
def serialize(value)
super value_to_binary(value.to_json)
end
def deserialize(value)
super case value
when NilClass
{}
when ActiveModel::Type::Binary::Data
value_to_hash(value.to_s)
else
value_to_hash(PG::Connection.unescape_bytea(value))
end
end
private
def value_to_hash(value)
JSON.parse(
ActiveSupport::Gzip.decompress(value),
symbolize_names: true
) || {}
end
def value_to_binary(value)
ActiveSupport::Gzip.compress(value)
end
end
Register new type in initializers
# config/initializers/types.rb
ActiveRecord::Type.register(:binary_hash, BinaryHash)
And add to binary type attribute in model
# app/models/snapshot.rb
class Reports < ApplicationRecord
attribute :data, :binary_hash
end
Tests show that data size is reduced by almost 3 times
Run time with 100000 width JSON
user system total real
Compress JSON 0.008671 0.001535 0.010206 ( 0.010885)
Decompress JSON 0.001357 0.000095 0.001452 ( 0.001509)
json size 95450 bytes
binary size 33868 bytes
~ 2.82 times compression
A simple way to distribute jobs in Sidekiq queues
This option implies that jobs of one context are executed sequentially in one queue, and jobs of different contexts in parallel in different queues.
Let's look at the following example.
There are investment funds for which we want to make time-consuming reporting calculations. Jobs for calculation within the same fund are carried out sequentially so that there are no errors in the calculations, jobs of different funds are performed in parallel.
We automate the distribution of jobs in queues so as not to specify a queue manually.
Specify the queues in the sidekiq.yml configuration file:
:queues:
- fund_processor_0
- fund_processor_1
- fund_processor_2
- fund_processor_3
- fund_processor_4
It is important that the queues are numbered from 0.
Now, when starting the worker, we indicate in which queue we will set the job depending on the fund. To do this, we use the operation of obtaining the remainder from dividing the fund ID and the count of queues. So we get the queue number.
# 5 queues
# fund ID % count of queues = queue number
# 1 % 5 => 1
# 2 % 5 => 2
# 3 % 5 => 3
# 4 % 5 => 4
# 5 % 5 => 0
def queue_name(fund_id)
queue_number = fund_id % 5
"fund_processor_#{queue_number}"
end
Start the worker, indicating to him the received queue name.
This can be done using the Sidekiq API
Sidekiq::Client.push(
'queue' => queue_name(fund_id),
'class' => Fund::ReportCalculator,
'args' => [fund_id]
)
Rubyists life made easier with composition operators.
If you write Ruby code and wandered into FP world you might just started writing those little tiny methods inside your classes/modules. And that was awesome to write code like this:
class Import
# Some code goes here...
def find_record(row)
[ Msa.find_or_initialize_by(region_name: row[:region_name], city: row[:city], state: row[:state], metro: row[:metro] ), row ]
end
# record is one of:
# Object - when record was found
# false - when record was not found
def update_record(record, attributes)
record.attributes = attributes
record
end
# record is one of:
# false
# ZipRegion
def validate_record(record)
case record
when false
[:error, nil]
else
validate_record!(record)
end
end
# record is ZipRegion object
def validate_record!(record)
if record.valid?
[:ok, record]
else
error(record.id, record.errors.messages)
[:error, record]
end
end
def persist_record!(validation, record)
case validation
when :ok
record.save
when :error
false
end
end
end
Yeah, I know there is YARD, and argument types are somewhat weird but at the time of coding, I was fascinated with Gregor Kiczales's HTDP courses (that was a ton of fun, sincerely recommend for every adventurous soul).
And next comes dreadful composition:
def process(row, index)
return if header_row?(row)
success(row[:region_name], persist_record!(*validate_record(update_record(*find_record(parse_row(row))))))
end
The pipeline is quite short but already hard to read. Luckily, in Ruby 2.6 we now have 2 composition operators: Proc#>> and its reverse sibling Proc#<<.
And, with a bit of refactoring composition method becomes:
def process(row, index)
return if header_row?(row)
composition = method(:parse_row) >>
method(:find_record) >>
method(:update_record) >>
method(:validate_record) >>
method(:persist_record!) >>
method(:success).curry[row[:region_name]]
composition.call(row)
Much nicier, don't you think? Ruby just became one step closer to FP-friendly languages family, let's hope there'll be more!
Migrate tags in Rails to PostgreSQL array from ActsAsTaggableOn
ActsAsTaggableOn is a swiss army knife solution if you need to add tags to your ActiveRecord model.
Just by adding one gem to your Gemfile and acts_as_taggable to the model you get everything you need: adding tags, searching for a model by tag, getting top tags, etc. However, sometimes you don't need all these.
In our project, we used acts_as_taggable to store tags for Note model. Then we displayed a list of notes on several pages with assigned tags and had autocompleted input for tags on Note form. Everything worked well, but since we use PostgreSQL, I decided to store tags as an array in Note model.
First of all, I added tags Array<String> column to Note, after this migrated actsastaggable tags to notes table with migration.
class MigrateNoteTags < ActiveRecord::Migration[5.2]
def change
execute <<-SQL
UPDATE notes
SET tags = grouped_taggings.tags_array
FROM
(
SELECT
taggings.taggable_id,
ARRAY_AGG ( tags.NAME ) tags_array
FROM
taggings
LEFT JOIN tags ON taggings.tag_id = tags.ID
WHERE
taggable_type = 'Note'
GROUP BY
taggings.taggable_id
) AS grouped_taggings
WHERE
notes.ID = grouped_taggings.taggable_id
SQL
end
end
To have backward compatibility, I added Note#tag_list method:
def tag_list
tags.join(', ')
end
The last thing is to add the ability to search for tags. Since there about 500k records in the Notes table, I decided to create an SQL view:
CREATE OR REPLACE VIEW note_tags AS
SELECT UNNEST
( tags ) AS name,
COUNT ( * ) AS taggings_count
FROM
notes
GROUP BY
name
That's it! It takes from 100ms to 150ms to search for tags in this view, which is fine for me.
If you have more significant data sets, then the best would be to create tags table and add triggers to notes table that will update tags on INSERT/UPDATE/DELETE.
AND & OR Operators Precedence
Are you still sure that && and and is the same operators? Look at this:
a = true && false
a
=> false
a = true and false
a
=> true
The same situation could be reproduced for || and or. Why? The answer lies in Ruby Operator Precedence.
The first example can be represented as:
a = (true && false)
Second:
(a = true) and false
Use hash or case-statement in Ruby?
Often, when we need to get a value based on the other one, we're using a case-statement. Like this
def realizing_trade_type(realizable_trade_type)
case realizable_trade_type
when 'buy'
'sell'
when 'short'
'cover'
when 'buy_contract'
'sell_contract'
when 'short_contract'
'cover_contract'
end
end
But, if the conditions and the results are simple values, why don't we use hash for this? We can :)
REALIZING_TRADE_TYPES = {
'buy' => 'sell',
'short' => 'cover',
'buy_contract' => 'sell_contract',
'short_contract' => 'cover_contract'
}.freeze
Here is the benchmark of both options, executed 10000000 times. It shows that a hash is faster in times for such the kind of usage.
>> require 'benchmark'
true
>> Benchmark.bm(15) do |x|
x.report('hash') { 10_000_000.times { REALIZING_TRADE_TYPES['buy'] } }
x.report('case-statement') { 10_000_000.times { realizing_trade_type 'buy' } }
x.report('empty') { 10_000_000.times {} }
end
user system total real
hash 0.990423 0.003412 0.993835 ( 1.057612)
case-statement 1.752263 0.004531 1.756794 ( 1.762030)
empty 0.380810 0.000728 0.381538 ( 0.382153)
So, it's better to use a hash when you are just retrieving some values (like in the example above). If there is additional logic to execute, a case-statement is still a way to go.
Command for create zip archive without gem's 📁
class CreateZipCommand
def call(files)
# Create temp directory for files
tmp_dir = Dir.mktmpdir
tmp_zip_path = File.join(tmp_dir, "files.zip")
# Move files to the temporary folder you created above
files.map do |file|
download_file(file, tmp_dir)
end
# Go to the folder and archive the entire contents
`cd #{tmp_dir} && zip #{tmp_zip_path} ./*`
# Return zip path
tmp_zip_path
end
end
> CreateZipCommand.new.call(files)
=> "/var/folders/bk/0c864z710654sx555jpdpx9c0000gn/T/d20190126-7447-d27fpl/files.zip")
Most gems for working with archives eat a lot of memory when working with large files. This solution does not have these problems.
Make sure that the zip utility is installed on your computer - it don't work without it
Webhook integration in development with Ngrok 🚀
All begin when I’m using the Pipedrive (is a sales management tool designed to help small sales teams manage intricate or lengthy sales processes) webhook.
The solution was easy I just create an ngrok tunnel
> ngrok http 3000
Session Status online
Account Andrey (Plan: Free)
Version 2.2.8
Region United States (us)
Web Interface http://127.0.0.1:4040
Forwarding http://b1256cb6.ngrok.io -> localhost:3000
Forwarding https://b1256cb6.ngrok.io -> localhost:3000
and then sent the webhook to the generated address and it works. In local development I can user webhook from another api! It's work 🚀
To use it you need to do 4 steps:
Register on ngrok
Download ngrok from site
Connect your account
Run it 🚀
ps
In addition, this service has a ngrok-tunel gem that allows you to fully integrate it with your application. But that's another story 💎
How to create zip files on the fly w/o Tempfile
There are many articles about how to archive files from the server and send a zip-file to a client without persisting it on the server. But usually they don't literally do it, because they use temporary files.
There is a simple way to do it without creating any file though. You just have to put files directly to Zip::OutputStream and then read from it. Btw pay attention: you must rewind the stream before reading it.
# some files objects
def download(files)
zip_stream = Zip::OutputStream.write_buffer do |zip|
files.each.with_index(1) do |file, index|
# file name must be uniq in archive
zip.put_next_entry("#{file.name}--#{index}.#{file.extension}")
zip.write(file.read.force_encoding('utf-8'))
end
end
# important - rewind the steam
zip_stream.rewind
send_data zip_stream.read,
type: 'application/zip',
disposition: 'attachment',
filename: 'files-archive.zip'
end