dsp_blueprint_parser 0.1.1 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 0e1f313346ba7c2ec3370570a6db46c75c15d4483d1df0760d65c1bec29c478b
-  data.tar.gz: ce8c9216312ee174256d5d11d46c897a9767d65b0d458c8aa18fd99ffe1a853d
+  metadata.gz: ea96a27ab7a6ff6a0d8f471171bf00d895598405e3540a39e1eef500c5845441
+  data.tar.gz: 667b222e2fc364e6bbb3453d4593f7c024523a58655d699a8f569efa87a7cfdc
 SHA512:
-  metadata.gz: b5a1873d1e5fc1dea052681b2b95969502d797b986efc612855d4e0cd2b0414a1bd3480ef10d7513ea6616a97c31a2ff237a1942c05847c935c1b9beee4dcd17
-  data.tar.gz: 2a60d12b85c731d86e9b4891f2e08423d65297ee531c472523790c6586616ce6a57941945fb6fa34c189f3f4540ff3731f260cabbb98e78d82c341cce86c69e2
+  metadata.gz: 7d2b7fee9d4fd08748608c5a6d9920f754d7ca7ee62e57bd792a54409534ca1c880c3231c9e271f1a5a73dc4b8a3cbf47446dd9c307bc9297734ada96d9774eb
+  data.tar.gz: 9fe1c4414ee671bc6a296a8b872b3c583131d6531a7717a687993a3e1a21421f83c748c4c1282de9d4425722181465acfd2a41d51f74c88ec84c56a715e4812f

data/.rubocop.yml

@@ -1,22 +1,22 @@
-AllCops:
-  TargetRubyVersion: 3.0
-
-Style/StringLiterals:
-  Enabled: true
-  EnforcedStyle: single_quotes
-
-Style/StringLiteralsInInterpolation:
-  Enabled: true
-  EnforcedStyle: double_quotes
-
-Layout/LineLength:
-  Max: 120
-
-Metrics/MethodLength:
-  Max: 30
-
-Metrics/BlockLength:
-  Max: 30
-
-Metrics/AbcSize:
+AllCops:
+  TargetRubyVersion: 3.0
+
+Style/StringLiterals:
+  Enabled: true
+  EnforcedStyle: single_quotes
+
+Style/StringLiteralsInInterpolation:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Layout/LineLength:
+  Max: 120
+
+Metrics/MethodLength:
+  Max: 30
+
+Metrics/BlockLength:
+  Max: 30
+
+Metrics/AbcSize:
   Enabled: false

data/Gemfile

@@ -1,15 +1,15 @@
-# frozen_string_literal: true
-
-source 'https://rubygems.org'
-
-# Specify your gem's dependencies in dsp_blueprint_parser.gemspec
-gemspec
-
-gem 'rake', '~> 13.0'
-
-gem 'rspec', '~> 3.0'
-
-gem 'pry', '~> 0.14.0'
-gem 'rspec-expectations', '~> 3.10.1'
-gem 'rspec-its', '~> 1.3.0'
-gem 'rubocop', '~> 1.7'
+# frozen_string_literal: true
+
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in dsp_blueprint_parser.gemspec
+gemspec
+
+gem 'rake', '~> 13.0'
+
+gem 'rspec', '~> 3.0'
+
+gem 'pry', '~> 0.14.0'
+gem 'rspec-expectations', '~> 3.10.1'
+gem 'rspec-its', '~> 1.3.0'
+gem 'rubocop', '~> 1.7'

data/Gemfile.lock

@@ -45,13 +45,13 @@ GEM
       rubocop-ast (>= 1.8.0, < 2.0)
       ruby-progressbar (~> 1.7)
       unicode-display_width (>= 1.4.0, < 3.0)
-    rubocop-ast (1.8.0)
+    rubocop-ast (1.9.0)
       parser (>= 3.0.1.1)
     ruby-progressbar (1.11.0)
     unicode-display_width (2.0.0)
 
 PLATFORMS
-  x64-mingw32
+  x86_64-linux
 
 DEPENDENCIES
   dsp_blueprint_parser!
@@ -63,4 +63,4 @@ DEPENDENCIES
   rubocop (~> 1.7)
 
 BUNDLED WITH
-   2.2.22
+   2.2.3

data/README.md

@@ -1,46 +1,48 @@
-# DspBlueprintParser
-
-Small Ruby gem to handle parsing of Dyson Sphere Program's blueprint data.
-
-Currently the gem does not support validating the MD5 hash of the blueprint. It appears as if the DSP devs wrote their own MD5 algorithm which would need it's own Ruby port. 
-
-## Installation
-
-Add this line to your application's Gemfile:
-
-```ruby
-gem 'dsp_blueprint_parser'
-```
-
-And then execute:
-
-    $ bundle install
-
-Or install it yourself as:
-
-    $ gem install dsp_blueprint_parser
-
-## Usage
-
-Module `DspBlueprintParser` has a single static method `parse` which takes the DSP blueprint string to be parsed.
-
-```ruby
-DspBlueprintParser.parse(str_blueprint)
-```
-
-This method returns a [BlueprintData](https://github.com/LRFalk01/DSP-Blueprint-Parser/blob/master/lib/dsp_blueprint_parser/blueprint_data.rb) object which includes the various metadata of the blueprint.
-Part of the `BlueprintData` object are properties for [areas](https://github.com/LRFalk01/DSP-Blueprint-Parser/blob/master/lib/dsp_blueprint_parser/area.rb) and [buildings](https://github.com/LRFalk01/DSP-Blueprint-Parser/blob/master/lib/dsp_blueprint_parser/building.rb) which are what one would mostly be interested in further evaluating.
-
-## Development
-
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
-
-To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
-
-## Contributing
-
-Bug reports and pull requests are welcome on GitHub at https://github.com/LRFalk01/dsp_blueprint_parser.
-
-## License
-
-The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+# DspBlueprintParser
+
+Small Ruby gem to handle parsing of Dyson Sphere Program's blueprint data.
+
+Currently the gem does not support validating the MD5 hash of the blueprint. It appears as if the DSP devs wrote their own MD5 algorithm which would need it's own Ruby port. 
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'dsp_blueprint_parser'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install dsp_blueprint_parser
+
+## Usage
+
+Module `DspBlueprintParser` has a single static method `parse` which takes the DSP blueprint string to be parsed.
+
+```ruby
+DspBlueprintParser.parse(str_blueprint)
+```
+
+This method returns a [BlueprintData](https://github.com/LRFalk01/DSP-Blueprint-Parser/blob/master/lib/dsp_blueprint_parser/blueprint_data.rb) object which includes the various metadata of the blueprint.
+Part of the `BlueprintData` object are properties for [areas](https://github.com/LRFalk01/DSP-Blueprint-Parser/blob/master/lib/dsp_blueprint_parser/area.rb) and [buildings](https://github.com/LRFalk01/DSP-Blueprint-Parser/blob/master/lib/dsp_blueprint_parser/building.rb) which are what one would mostly be interested in further evaluating.
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Running `rake compile` requires `gem install rake-compiler` to build the md5f extension.
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/LRFalk01/dsp_blueprint_parser.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/Rakefile

@@ -1,12 +1,16 @@
-# frozen_string_literal: true
-
-require 'bundler/gem_tasks'
-require 'rspec/core/rake_task'
-
-RSpec::Core::RakeTask.new(:spec)
-
-require 'rubocop/rake_task'
-
-RuboCop::RakeTask.new
-
-task default: %i[spec rubocop]
+# frozen_string_literal: true
+
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+require 'rubocop/rake_task'
+
+RuboCop::RakeTask.new
+
+task default: %i[spec rubocop]
+
+
+require 'rake/extensiontask'
+Rake::ExtensionTask.new('md5f')

data/bin/console

@@ -1,15 +1,15 @@
-#!/usr/bin/env ruby
-# frozen_string_literal: true
-
-require 'bundler/setup'
-require 'dsp_blueprint_parser'
-
-# You can add fixtures and/or initialization code here to make experimenting
-# with your gem easier. You can also use a different console, if you like.
-
-# (If you use this, don't forget to add pry to your Gemfile!)
-# require "pry"
-# Pry.start
-
-require 'irb'
-IRB.start(__FILE__)
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require 'bundler/setup'
+require 'dsp_blueprint_parser'
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require 'irb'
+IRB.start(__FILE__)

data/dsp_blueprint_parser.gemspec

@@ -1,37 +1,39 @@
-# frozen_string_literal: true
-
-require_relative 'lib/dsp_blueprint_parser/version'
-
-Gem::Specification.new do |spec|
-  spec.name          = 'dsp_blueprint_parser'
-  spec.version       = DspBlueprintParser::VERSION
-  spec.authors       = ['Lucas Falk']
-  spec.email         = ['LRFalk01@gmail.com']
-
-  spec.summary       = 'Parse Dyson Sphere Program blueprint string'
-  spec.description   = 'Parse Dyson Sphere Program blueprint string'
-  spec.homepage      = 'https://github.com/LRFalk01/DSP-Blueprint-Parser'
-  spec.license       = 'MIT'
-  spec.required_ruby_version = '>= 3.0'
-
-  # spec.metadata["allowed_push_host"] = "TODO: Set to 'https://mygemserver.com'"
-
-  spec.metadata['homepage_uri'] = spec.homepage
-  spec.metadata['source_code_uri'] = spec.homepage
-  # spec.metadata['changelog_uri'] = spec.homepage
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files = Dir.chdir(File.expand_path(__dir__)) do
-    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{\A(?:test|spec|features)/}) }
-  end
-  spec.bindir        = 'exe'
-  spec.executables   = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
-  spec.require_paths = ['lib']
-
-  # Uncomment to register a new dependency of your gem
-  # spec.add_dependency "example-gem", "~> 1.0"
-
-  # For more information and examples about making a new gem, checkout our
-  # guide at: https://bundler.io/guides/creating_gem.html
-end
+# frozen_string_literal: true
+
+require_relative 'lib/dsp_blueprint_parser/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'dsp_blueprint_parser'
+  spec.version       = DspBlueprintParser::VERSION
+  spec.authors       = ['Lucas Falk']
+  spec.email         = ['LRFalk01@gmail.com']
+
+  spec.summary       = 'Parse Dyson Sphere Program blueprint string'
+  spec.description   = 'Parse Dyson Sphere Program blueprint string'
+  spec.homepage      = 'https://github.com/LRFalk01/DSP-Blueprint-Parser'
+  spec.license       = 'MIT'
+  spec.required_ruby_version = '>= 3.0'
+
+  # spec.metadata["allowed_push_host"] = "TODO: Set to 'https://mygemserver.com'"
+
+  spec.metadata['homepage_uri'] = spec.homepage
+  spec.metadata['source_code_uri'] = spec.homepage
+  # spec.metadata['changelog_uri'] = spec.homepage
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(File.expand_path(__dir__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{\A(?:test|spec|features)/}) }
+  end
+  spec.bindir        = 'exe'
+  spec.executables   = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  # Uncomment to register a new dependency of your gem
+  # spec.add_dependency "example-gem", "~> 1.0"
+
+  # For more information and examples about making a new gem, checkout our
+  # guide at: https://bundler.io/guides/creating_gem.html
+
+  spec.extensions = %w[ext/md5f/extconf.rb]
+end

data/ext/md5f/extconf.rb

@@ -0,0 +1,3 @@
+require 'mkmf'
+
+create_makefile 'dsp_blueprint_parser/md5f'

data/ext/md5f/md5f.c

@@ -0,0 +1,311 @@
+#include<stdio.h> // define the header file  
+#include <stdlib.h>
+#include <string.h>
+#include "ruby.h"
+
+uint A;
+uint B;
+uint C;
+uint D;
+
+const int S11 = 7;
+const int S12 = 12;
+const int S13 = 17;
+const int S14 = 22;
+const int S21 = 5;
+const int S22 = 9;
+const int S23 = 14;
+const int S24 = 20;
+const int S31 = 4;
+const int S32 = 11;
+const int S33 = 16;
+const int S34 = 23;
+const int S41 = 6;
+const int S42 = 10;
+const int S43 = 15;
+const int S44 = 21;
+
+// ugly, I know
+uint ArrayLength = 0;
+
+uint F(uint x, uint y, uint z)
+{
+    return (uint) (((int) x & (int) y) | (~(int) x & (int) z));
+}
+
+uint G(uint x, uint y, uint z)
+{
+    return (uint) (((int) x & (int) z) | ((int) y & ~(int) z));
+}
+
+uint H(uint x, uint y, uint z)
+{
+    return x ^ y ^ z;
+}
+
+uint I(uint x, uint y, uint z)
+{
+    return y ^ (x | ~z);
+}
+
+uint FF(uint a, uint b, uint c, uint d, uint mj, int s, uint ti)
+{
+    a = a + F(b, c, d) + mj + ti;
+    a = a << s | a >> (32 - s);
+    a += b;
+    return a;
+}
+
+uint GG(uint a, uint b, uint c, uint d, uint mj, int s, uint ti)
+{
+    a = a + G(b, c, d) + mj + ti;
+    a = a << s | a >> (32 - s);
+    a += b;
+    return a;
+}
+
+uint HH(uint a, uint b, uint c, uint d, uint mj, int s, uint ti)
+{
+    a = a + H(b, c, d) + mj + ti;
+    a = a << s | a >> (32 - s);
+    a += b;
+    return a;
+}
+
+uint II(uint a, uint b, uint c, uint d, uint mj, int s, uint ti)
+{
+    a = a + I(b, c, d) + mj + ti;
+    a = a << s | a >> (32 - s);
+    a += b;
+    return a;
+}
+
+void MD5_Init()
+{
+    A = 1732584193U;
+    B = 4024216457U;
+    C = 2562383102U;
+    D = 271734598U;
+}
+
+uint * MD5_Append(unsigned char input[], size_t length)
+{
+    int num1 = 1;
+    int num2 = length % 64;
+    int num3;
+    int num4 = 0;
+    if (num2 < 56)
+    {
+        num3 = 55 - num2;
+        num4 = length - num2 + 64;
+    }
+    else if (num2 == 56)
+    {
+        num3 = 63;
+        num1 = 1;
+        num4 = length + 8 + 64;
+    }
+    else
+    {
+        num3 = 63 - num2 + 56;
+        num4 = length + 64 - num2 + 64;
+    }
+
+    unsigned char arrayList[num3 + 9 + length];
+    unsigned int position = 0;
+
+    for (size_t i = 0; i < length; i++)
+    {
+        arrayList[position++] = input[i];
+    }
+
+    if (num1 == 1)
+    {
+        arrayList[position++] = (unsigned char) 128;
+    }
+
+    for (int index = 0; index < num3; ++index)
+    {
+        arrayList[position++] = (unsigned char) 0;
+    }
+
+    long num5 = (long) length * 8L;
+    unsigned char num6 = (unsigned char) ((unsigned long) num5 & (unsigned long) 255);
+    unsigned char num7 = (unsigned char) ((unsigned long) num5 >> 8 & (unsigned long) 255);
+    unsigned char num8 = (unsigned char) ((unsigned long) num5 >> 16 & (unsigned long) 255);
+    unsigned char num9 = (unsigned char) ((unsigned long) num5 >> 24 & (unsigned long) 255);
+    unsigned char num10 = (unsigned char) ((unsigned long) num5 >> 32 & (unsigned long) 255);
+    unsigned char num11 = (unsigned char) ((unsigned long) num5 >> 40 & (unsigned long) 255);
+    unsigned char num12 = (unsigned char) ((unsigned long) num5 >> 48 & (unsigned long) 255);
+    unsigned char num13 = (unsigned char) ((unsigned long) num5 >> 56);
+    arrayList[position++] = num6;
+    arrayList[position++] = num7;
+    arrayList[position++] = num8;
+    arrayList[position++] = num9;
+    arrayList[position++] = num10;
+    arrayList[position++] = num11;
+    arrayList[position++] = num12;
+    arrayList[position++] = num13;
+
+    ArrayLength = num4 / 4;
+    uint *numArray = calloc(ArrayLength, sizeof(uint));
+    long index1 = 0;
+    long index2 = 0;
+    for (; index1 < (long) num4; index1 += 4)
+    {
+        numArray[index2] = (uint) ((int) arrayList[index1] | ((int) arrayList[index1 + 1] << 8) | ((int) arrayList[index1 + 2] << 16) | ((int) arrayList[index1 + 3] << 24));
+        ++index2;
+    }
+
+    return numArray;
+}
+
+void MD5_Trasform(uint x[])
+{
+    for (int index = 0; index < ArrayLength; index += 16)
+    {
+        uint a = A;
+        uint b = B;
+        uint c = C;
+        uint d = D;
+        a = FF(a, b, c, d, x[index], 7, 3614090360U);
+        d = FF(d, a, b, c, x[index + 1], 12, 3906451286U);
+        c = FF(c, d, a, b, x[index + 2], 17, 606105819U);
+        b = FF(b, c, d, a, x[index + 3], 22, 3250441966U);
+        a = FF(a, b, c, d, x[index + 4], 7, 4118548399U);
+        d = FF(d, a, b, c, x[index + 5], 12, 1200080426U);
+        c = FF(c, d, a, b, x[index + 6], 17, 2821735971U);
+        b = FF(b, c, d, a, x[index + 7], 22, 4249261313U);
+        a = FF(a, b, c, d, x[index + 8], 7, 1770035416U);
+        d = FF(d, a, b, c, x[index + 9], 12, 2336552879U);
+        c = FF(c, d, a, b, x[index + 10], 17, 4294925233U);
+        b = FF(b, c, d, a, x[index + 11], 22, 2304563134U);
+        a = FF(a, b, c, d, x[index + 12], 7, 1805586722U);
+        d = FF(d, a, b, c, x[index + 13], 12, 4254626195U);
+        c = FF(c, d, a, b, x[index + 14], 17, 2792965006U);
+        b = FF(b, c, d, a, x[index + 15], 22, 968099873U);
+        a = GG(a, b, c, d, x[index + 1], 5, 4129170786U);
+        d = GG(d, a, b, c, x[index + 6], 9, 3225465664U);
+        c = GG(c, d, a, b, x[index + 11], 14, 643717713U);
+        b = GG(b, c, d, a, x[index], 20, 3384199082U);
+        a = GG(a, b, c, d, x[index + 5], 5, 3593408605U);
+        d = GG(d, a, b, c, x[index + 10], 9, 38024275U);
+        c = GG(c, d, a, b, x[index + 15], 14, 3634488961U);
+        b = GG(b, c, d, a, x[index + 4], 20, 3889429448U);
+        a = GG(a, b, c, d, x[index + 9], 5, 569495014U);
+        d = GG(d, a, b, c, x[index + 14], 9, 3275163606U);
+        c = GG(c, d, a, b, x[index + 3], 14, 4107603335U);
+        b = GG(b, c, d, a, x[index + 8], 20, 1197085933U);
+        a = GG(a, b, c, d, x[index + 13], 5, 2850285829U);
+        d = GG(d, a, b, c, x[index + 2], 9, 4243563512U);
+        c = GG(c, d, a, b, x[index + 7], 14, 1735328473U);
+        b = GG(b, c, d, a, x[index + 12], 20, 2368359562U);
+        a = HH(a, b, c, d, x[index + 5], 4, 4294588738U);
+        d = HH(d, a, b, c, x[index + 8], 11, 2272392833U);
+        c = HH(c, d, a, b, x[index + 11], 16, 1839030562U);
+        b = HH(b, c, d, a, x[index + 14], 23, 4259657740U);
+        a = HH(a, b, c, d, x[index + 1], 4, 2763975236U);
+        d = HH(d, a, b, c, x[index + 4], 11, 1272893353U);
+        c = HH(c, d, a, b, x[index + 7], 16, 4139469664U);
+        b = HH(b, c, d, a, x[index + 10], 23, 3200236656U);
+        a = HH(a, b, c, d, x[index + 13], 4, 681279174U);
+        d = HH(d, a, b, c, x[index], 11, 3936430074U);
+        c = HH(c, d, a, b, x[index + 3], 16, 3572445317U);
+        b = HH(b, c, d, a, x[index + 6], 23, 76029189U);
+        a = HH(a, b, c, d, x[index + 9], 4, 3654602809U);
+        d = HH(d, a, b, c, x[index + 12], 11, 3873151461U);
+        c = HH(c, d, a, b, x[index + 15], 16, 530742520U);
+        b = HH(b, c, d, a, x[index + 2], 23, 3299628645U);
+        a = II(a, b, c, d, x[index], 6, 4096336452U);
+        d = II(d, a, b, c, x[index + 7], 10, 1126891415U);
+        c = II(c, d, a, b, x[index + 14], 15, 2878612391U);
+        b = II(b, c, d, a, x[index + 5], 21, 4237533241U);
+        a = II(a, b, c, d, x[index + 12], 6, 1700485571U);
+        d = II(d, a, b, c, x[index + 3], 10, 2399980690U);
+        c = II(c, d, a, b, x[index + 10], 15, 4293915773U);
+        b = II(b, c, d, a, x[index + 1], 21, 2240044497U);
+        a = II(a, b, c, d, x[index + 8], 6, 1873313359U);
+        d = II(d, a, b, c, x[index + 15], 10, 4264355552U);
+        c = II(c, d, a, b, x[index + 6], 15, 2734768916U);
+        b = II(b, c, d, a, x[index + 13], 21, 1309151649U);
+        a = II(a, b, c, d, x[index + 4], 6, 4149444226U);
+        d = II(d, a, b, c, x[index + 11], 10, 3174756917U);
+        c = II(c, d, a, b, x[index + 2], 15, 718787259U);
+        b = II(b, c, d, a, x[index + 9], 21, 3951481745U);
+        A += a;
+        B += b;
+        C += c;
+        D += d;
+    }
+}
+
+unsigned char * MD5_Array(unsigned char input[], long length)
+{
+    MD5_Init();
+    uint *append = MD5_Append(input, length);
+    MD5_Trasform(append);
+    uint numArray1[4] = { A, B, C, D};
+
+    unsigned char *numArray2 = calloc(4 * 4, sizeof(unsigned char));
+
+    int index1 = 0;
+    int index2 = 0;
+    while (index1 < 4)
+    {
+        numArray2[index2] = (unsigned char) (numArray1[index1] & (uint) 255);
+        numArray2[index2 + 1] = (unsigned char) (numArray1[index1] >> 8 & (uint) 255);
+        numArray2[index2 + 2] = (unsigned char) (numArray1[index1] >> 16 & (uint) 255);
+        numArray2[index2 + 3] = (unsigned char) (numArray1[index1] >> 24 & (uint) 255);
+        ++index1;
+        index2 += 4;
+    }
+
+    free(append);
+    return numArray2;
+}
+
+unsigned char * ArrayToHexString(unsigned char input[])
+{
+    size_t length = 16;
+    unsigned char *result = calloc(length * 2, sizeof(unsigned char));
+
+    for (size_t i = 0; i < length; i++)
+    {
+        sprintf(result+2*i, "%.2X", input[i]);
+    }
+
+    return result;
+}
+
+unsigned char * Compute(unsigned char message[], long length)
+{
+    unsigned char * data = MD5_Array(message, length);
+    unsigned char * result = ArrayToHexString(data);
+
+    free(data);
+    return result;
+}
+
+VALUE MD5F = Qnil;  /* Ruby Module */
+
+VALUE rb_compute(VALUE self, VALUE str) {
+    if (RB_TYPE_P(str, T_STRING) != 1) {
+        return Qnil;
+    }
+
+    unsigned char *data = StringValuePtr(str);
+    long strLength = RSTRING_LEN(str);
+
+    unsigned char *hex = Compute(data, strLength);
+
+    VALUE result = rb_str_new(hex, 32);
+    free(hex);
+
+    return result;
+}
+
+void Init_md5f()
+{
+    MD5F = rb_define_module("MD5F");
+    rb_define_module_function(MD5F, "compute", rb_compute, 1);
+}