looop 9001.0.42

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: fe2468446ba9f2e488be338506d08aa7f7348aa4ae7dff39d2522952e69ba99d
+  data.tar.gz: 3b8b7366e66772c57cdb81c0835078f7bfdec9268c11f4448aff529e4f361cab
+SHA512:
+  metadata.gz: '02799c8862315e9f6260308d684a6272f461a28aa40c1ed32b43d7d52362ddcf0a7abfef3cc02c1d1dfdc08502343db86ab2ea658a0e619429dd61a259177871'
+  data.tar.gz: ee76252b4caeb13fc358e3fbab73a734cb2971e8bf1c74c592ae8ea103f4588fdc085c5e5ce49943b507464df7be3635e2ddb05ded7c5f6b0d4620f6af001169

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+# 9001.0.0
+
+__***Final***__ version. We achieved the perfect for loop.
+
+\- Sent from my iPhone

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Justin Léger
+
+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 OTHER DEALINGS IN THE
+SOFTWARE.

data/README.md

@@ -0,0 +1,108 @@
+# Looop ♻  ![tests badge](https://img.shields.io/badge/Tests-none-brightgreen) ![loop badge](https://img.shields.io/badge/loop-for-brightgreen) [![license badge](https://img.shields.io/badge/License-MIT-blue)](https://github.com/jusleg/looop/blob/master/LICENSE)
+Gone are the days where you convert your entire project to Java just to get the nice `for` loop. You can now build similar looking loops that run much slower than your average loop.
+
+## Get started
+
+`gem install looop`
+
+`require 'looop'`
+
+## How to use Looop
+
+Looop was built with simplicity as its core value. For this reason, we only offer one method: `Loop.for` (`for` was already taken 😢).
+
+Let's say you are [DJ Khaled](https://en.wikipedia.org/wiki/DJ_Khaled), a typical Java developer, and you wish to craft a tweet with your signature catchphrase "Another one." repeated **5** times
+
+```ruby
+# tweet.rb
+require 'looop'
+
+CATCHPHRASE = 'ANOTHER ONE.'
+tweet = ''
+Looop.for(index = 1, ->{index <= 5}, ->{index += 1}) do
+  tweet.concat(CATCHPHRASE)
+end
+
+puts tweet
+
+#=> ANOTHER ONE.ANOTHER ONE.ANOTHER ONE.ANOTHER ONE.ANOTHER ONE.
+```
+
+## I'm intrigued, what are these ->{} things?
+
+I'm glad you asked, those are [Procs](https://ruby-doc.org/core-2.6/Proc.html) We'll call these procs while running the loop. This is one of the main reason that make looop a tad bit slower.
+
+## Do U even Big-O ?!1
+
+I guess, you can run nested loops if that's what you are asking.
+
+```ruby
+height = 5
+Looop.for(i = 1, ->{ i <= height }, -> {i += 1}) do
+  Looop.for(h = height - i, -> {h > 0 }, -> {h -= 1}) do
+    print " "
+  end
+  Looop.for(j = 1, -> {j <= i}, -> {j += 1}) do
+    print "* "
+  end
+  print "\n"
+end
+```
+
+will print:
+
+```console
+    * 
+   * * 
+  * * * 
+ * * * * 
+* * * * * 
+```
+
+## Is this leetcode ready? Can I pass a technical interview with this?
+
+> Is this leetcode ready?
+
+It depends, you might be able to solve the base case, but I'd be surprise if you didn't time out during the evaluation of the secret cases.
+
+> Can I pass a technical interview with this?
+
+Meh, as long as they don't ask for it to be optimized for performance. 
+
+**TL;DR:** don't.
+
+## Is it fast
+
+no
+
+```ruby
+Looop.for(i=0, -> {i<1000}, -> {i+=1}) do
+  Looop.for(j=0, -> {j<1000}, -> {j+=1}) do
+    #noop
+  end
+end
+```
+
+was 6 times slower than
+
+```ruby
+i = 0
+while i<1000 do
+  j = 0
+  while j<1000 do
+    #noop
+    j += 1
+  end
+  i += 1
+end
+```
+
+## I don't want to setup a small script to test it but I'm really interested to try it, can you make a repl.it?
+
+Sure. [here](https://repl.it/@jusleg/looop).
+
+## Copyright and License
+Copyright (c) 2020, Justin Leger
+
+This project is licensed under the [MIT License](https://github.com/jusleg/looop/blob/master/LICENSE).
+

data/lib/looop.rb

@@ -0,0 +1,8 @@
+module Looop
+  def self.for(_initial_condition, evaluation_step, after_eval_step, &blk)
+    while(evaluation_step.call)
+      yield
+      after_eval_step.call
+    end
+  end
+end

metadata

@@ -0,0 +1,49 @@
+--- !ruby/object:Gem::Specification
+name: looop
+version: !ruby/object:Gem::Version
+  version: 9001.0.42
+platform: ruby
+authors:
+- Justin Leger
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2020-04-20 00:00:00.000000000 Z
+dependencies: []
+description: 'Build for loops with a signature similar to Java for loops. #ThrowbackThursday
+  to when you learned OOP using Java'
+email: hey@justinleger.ca
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- LICENSE
+- README.md
+- lib/looop.rb
+homepage: https://github.com/jusleg/looop
+licenses:
+- MIT
+metadata:
+  source_code_uri: https://github.com/jusleg/looop
+  changelog_uri: https://github.com/jusleg/looop/blob/master/CHANGELOG.md
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.3
+signing_key: 
+specification_version: 4
+summary: A slower way to generate for loops in Ruby with a funky java-like syntax
+test_files: []