visualize_helper 0.0.10.27 → 0.0.10.28

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3f2f9c1de5d9b0195c106f2c6b869bdae2711864
-  data.tar.gz: 8b5e01587c9ccd2e5d7bf158f80183983de2b95d
+  metadata.gz: b4100947c618bdc4518f2f89923495306bfbecfb
+  data.tar.gz: 04e6517f9f601470538a1f11fc706df5fa593752
 SHA512:
-  metadata.gz: e9fb451f383a415fea20d4d355990d9e3798f77e8e82056f3d60b32d044f7941659fe2ea3de9c99d890557f26e24249165ae082d3492df87ed962ce90b3ccecf
-  data.tar.gz: 1a2405ba64a3d15088b9f0396b5e8f4c33b51b5082bf4c9ca493d8ee2ab98634cc077e55c6c9f7223d57b26688ca7313cf5526803b7667b475d9841f12bc885d
+  metadata.gz: a86285f6896472865180c8ce1e303eb2d4752698aad4a0e55744bd1ebcf5058409294c8852f576b82581903471dcbd8b74414a57cc44277951ac179c1831c9cc
+  data.tar.gz: 7d534c2c3bf23c1d72b329a39ec105124a02feb129dee77adee43969f2e73a9011c8df3266070d0fd0c5d87350ca9781e1d3f92858abe2e7588b7d0b024312c1

data/ext/visualize_helper/visualize_helper.c

@@ -1,11 +1,105 @@
 #include <ruby.h>
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include <math.h>
 
-// Hello World  without parameters
-static VALUE hello_world()
+
+int myCompare (const void * a, const void * b ) {
+    const char *pa = *(const char**)a;
+    const char *pb = *(const char**)b;
+
+    return strcmp(pa,pb);
+}
+
+// recive a sorted array of strings and return a sorted array with only the unique elements 
+static VALUE uniq(VALUE sorted_array){
+
+  //initialize return variable in ruby
+  VALUE uniq_array = rb_ary_new();
+
+  //initialize variables for compare 
+  char* previous;
+  char* current;
+
+  for( int i = 0; i < RARRAY_LEN(sorted_array); i++){
+    VALUE current_temp = rb_ary_entry(sorted_array,i);
+    current =  StringValuePtr(current_temp);
+    // initial case, when there is no previous
+    if ( i == 0 ){
+      VALUE previous_temp = rb_ary_entry(sorted_array,i);
+      previous =  StringValuePtr(previous_temp);
+      rb_ary_push(uniq_array,rb_ary_entry(sorted_array,i));
+    } else {
+      if (strcmp(previous,current) != 0 ){
+        rb_ary_push(uniq_array,rb_ary_entry(sorted_array,i));
+        VALUE previous_temp = rb_ary_entry(sorted_array,i);
+        previous = StringValuePtr(previous_temp);
+      } 
+    }
+  }
+  
+  return uniq_array;
+}
+
+//static VALUE join(VALUE self, VALUE strings){
+static VALUE join(VALUE strings){
+
+  // initial variables
+  char* joined;
+  int strings_size = RARRAY_LEN(strings);
+  int string_size;
+  VALUE string_temp;
+  VALUE result;
+  
+  string_temp = rb_ary_entry(strings,0);
+  string_size = strlen(StringValuePtr(string_temp));
+  joined = (char*) malloc(strings_size + 1);
+  sprintf(joined,"%s", StringValuePtr(string_temp));
+
+  for (int i = 1 ; i < strings_size; i++) {
+    
+    string_temp = rb_ary_entry(strings,i);
+    string_size = strlen(StringValuePtr(string_temp));
+      
+    joined = (char*)  realloc(joined, string_size + strlen(joined) + 1);
+    sprintf(joined,"%s,%s", joined, StringValuePtr(string_temp));
+
+  }
+  result = rb_str_new2(joined);  
+  free(joined);
+  return  result;
+}
+
+
+
+// Receive  an array of unsorted strings with repeated strings and return a single a sorted array with unique elementes or with all
+// strings = array of strings
+// unique =  0 or 1  if want to call unique or not
+static VALUE sort_uniq(VALUE self, VALUE strings, int unique)
 {
-    return rb_str_new_cstr("hello world");
+    int strings_size = RARRAY_LEN(strings);
+    const char *input[strings_size];
+
+    for (int i = 0; i< strings_size; i++){
+      VALUE string  = rb_ary_entry(strings,i);
+      input[i] = StringValuePtr(string);
+    }
+
+    int stringLen = sizeof(input) / sizeof(char *);
+    qsort(input, stringLen, sizeof(char *), myCompare);
+
+
+    // Transform the result input into a ruby array
+    VALUE resultado = rb_ary_new();
+    for (int i=0; i<stringLen; ++i) {
+      rb_ary_push(resultado,rb_str_new2(input[i]));
+    } 
+
+    return (unique == 0 ) ? resultado : uniq(resultado);
 }
 
+
 // Find the index of the target value inside array
 int findIndex(VALUE intervals, size_t size, int target) 
 {
@@ -108,25 +202,171 @@ static VALUE min_max_period(VALUE self, VALUE min, VALUE max, VALUE hash, VALUE
 }
 
 
+//function to remove element from a array of strings
+static VALUE remove_entry_from_array (VALUE strings, char* element){
+    
+    //initial variables
+    VALUE result = rb_ary_new();
+    char* current_value;
+    VALUE current_value_temp;
+    
+    for(int i = 0; i < RARRAY_LEN(strings); i++){
+        current_value_temp = rb_ary_entry(strings,i);
+        current_value  = StringValuePtr(current_value_temp);
+        if (strcmp(current_value, element) != 0) {
+          rb_ary_push(result,rb_ary_entry(strings,i));
+        }
+    }
+
+    return result;
+}
+
+// Function to generate the boxes and links of each trajectory
+static VALUE generate_boxes_and_links(VALUE self, VALUE min, VALUE max, VALUE aggr, VALUE boxes, VALUE links, VALUE dict, VALUE type_agroupment, VALUE value)
+{
+
+  VALUE seq_key_result;
+  VALUE prox_key_result;
+  // Initial Variables
+  int length_seq_sorted;
+  int length_prox_sorted;
+  VALUE result_final;
+  VALUE boxes_period_value;
+  VALUE links_period_value;
+  VALUE seq_key;
+  VALUE prox_key;
+  VALUE seq;
+  VALUE aggr_prox;
+  int seq_size;
+  int aggr_prox_size;
+  int prox;
+  int aggr_size = RARRAY_LEN(aggr);
+  char* link_key;
+  char* period_s;
+  char* prox_s;
+
+  for(int period = 0; period < aggr_size; period++ ){
+     seq_key = rb_ary_new();
+
+     if (period < aggr_size - 1) {
+      prox_key = rb_ary_new();
+     } 
+     seq = rb_ary_entry(aggr,period);
+     seq_size = (int) RARRAY_LEN(seq);
+
+      // Translate sequences with dict
+      if (seq_size == 0) {
+        rb_ary_push(seq_key,rb_hash_aref(dict, rb_str_new2("M-2"))); 
+      }else{
+
+        for(int i = 0; i < seq_size; i++ ) {
+          rb_ary_push(seq_key,rb_hash_aref(dict,rb_ary_entry(seq,i)));  
+        }  
+      }
+
+    // agroup by unique or not
+    if ( strcmp(StringValuePtr(type_agroupment),"s") == 0 ) {
+      //sort with uniq 
+      seq_key = sort_uniq(self,seq_key,1);
+    }else{
+      //sort without uniq
+      seq_key = sort_uniq(self,seq_key,0);
+    }
+
+    // if there is "no-event" and other one selected, remove the "no-event"
+    length_seq_sorted  =  (strcmp(StringValuePtr(type_agroupment),"s") == 0 ) ? RARRAY_LEN(seq_key)  : RARRAY_LEN(uniq(seq_key)) ;
+    if (length_seq_sorted != 1) {
+      seq_key = remove_entry_from_array(seq_key,"M-3");
+    }
+
+    // Generate the key
+    seq_key_result = join(seq_key);
+
+    //
+    boxes_period_value = rb_hash_aref(rb_ary_entry(boxes,period),seq_key_result);
+    if (boxes_period_value  == Qnil) {
+      rb_hash_aset(rb_ary_entry(boxes,period),seq_key_result, value);
+    }else {
+      rb_hash_aset(rb_ary_entry(boxes,period),seq_key_result,INT2FIX(FIX2INT(boxes_period_value) + FIX2INT(value)));
+    }    
+
+    prox = period +1;
+
+    if (prox < aggr_size ) {
+      aggr_prox = rb_ary_entry(aggr,prox); 
+      aggr_prox_size = (int) RARRAY_LEN(aggr_prox);
+      if ( aggr_prox_size == 0) {
+        rb_ary_push(prox_key,rb_hash_aref(dict, rb_str_new2("M-2"))); 
+      }else{
+        for(int i = 0; i < aggr_prox_size ; i++ ) {
+          rb_ary_push(prox_key,rb_hash_aref(dict,rb_ary_entry(aggr_prox,i)));  
+        }  
+      }     
+
+       // agroup by unique or not
+      if ( strcmp(StringValuePtr(type_agroupment),"n") == 0 ) {
+        //sort with uniq
+        prox_key = sort_uniq(self,prox_key,1);
+      }else{
+        //sort without uniq
+        prox_key = prox_key;
+      }
+
+  //    
+      // if there is "no-event" and other one selected, remove the "no-event"
+      length_prox_sorted  =  (strcmp(StringValuePtr(type_agroupment),"n") == 0 ) ? RARRAY_LEN(prox_key)  : RARRAY_LEN(sort_uniq(self,prox_key,1)) ;
+      if (length_prox_sorted != 1) {
+        prox_key = remove_entry_from_array(prox_key,"M-3");
+      }
+
+      // Generate the key
+      prox_key_result = join(prox_key);
+
+      // generate a key link
+      period_s = ( period == 0 ) ? (char*) malloc(1)  : (char*) malloc(floor(log10(abs(period))) + 1);
+      prox_s = ( prox == 0 ) ? (char*) malloc(1)  : (char*) malloc(floor(log10(abs(prox))) + 1);
+      sprintf(period_s,"%d",period);
+      sprintf(prox_s,"%d",prox);
+      link_key =  (char*) malloc( strlen(period_s) + strlen(StringValuePtr(seq_key_result)) + strlen(prox_s) + strlen(StringValuePtr(prox_key_result)) + 3);
+      sprintf(link_key,"%s_%s;%s_%s", period_s,StringValuePtr(seq_key_result),prox_s,StringValuePtr(prox_key_result));
+
+      links_period_value = rb_hash_aref(rb_ary_entry(links,period),rb_str_new2(link_key));
+      if (links_period_value  == Qnil) {
+        rb_hash_aset(rb_ary_entry(links,period),rb_str_new2(link_key),value);
+      }else {
+        rb_hash_aset(rb_ary_entry(links,period),rb_str_new2(link_key), INT2FIX(FIX2INT(links_period_value) + FIX2INT(value)));
+      }    
 
-static VALUE test(VALUE self, VALUE param){
 
-  int a =  INT2FIX(param);
-  return FIX2INT(a);
+
+    }//end prox < aggr_size
+
+  }// end for 
+
+  VALUE ab = rb_ary_new();
+  rb_ary_push(ab,1);
+  rb_ary_push(ab,2);
+  //return result_final;
+  return Qnil;
 }  
 
+
+
 // Main function called when the gem is loaded 
 void Init_visualize_helper(void) {
 
   // Register the VisualizeHelper module
   VALUE mVisualizeHelper = rb_define_module("VisualizeHelper");
 
-  // Register the method Hello World without parameters 
-  rb_define_singleton_method(mVisualizeHelper, "hello_world", hello_world, 0);
-
   // Register the method min_max_period 
   rb_define_singleton_method(mVisualizeHelper, "min_max_period", min_max_period, 5);
 
-  // Register the method  for development testing
-  rb_define_singleton_method(mVisualizeHelper, "test", test, 1 );
+  // Register the method generate_boxes_and_links
+  rb_define_singleton_method(mVisualizeHelper, "generate_boxes_and_links", generate_boxes_and_links, 8);
+
+  // Register the method sort
+  rb_define_singleton_method(mVisualizeHelper, "sort_uniq", sort_uniq, 2 );
+
+  // Register the method sort
+  rb_define_singleton_method(mVisualizeHelper, "join", join, 1 );
 }

data/lib/visualize_helper/version.rb

@@ -1,3 +1,3 @@
 module VisualizeHelper
-  VERSION = "0.0.10.27"
+  VERSION = "0.0.10.28"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: visualize_helper
 version: !ruby/object:Gem::Version
-  version: 0.0.10.27
+  version: 0.0.10.28
 platform: ruby
 authors:
 - Raphael Ottoni Santiago Machado de Faria
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-03-30 00:00:00.000000000 Z
+date: 2016-04-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler