From 90abba689a90a7ab734f89002377c77a44b9e2b7 Mon Sep 17 00:00:00 2001
From: Romain Goyet <romain@goyet.com>
Date: Thu, 3 Sep 2015 22:44:54 +0200
Subject: [PATCH] [Poincare] Integer class, work in progress

---
 poincare/include/poincare/integer.h | 19 +++++++
 poincare/src/integer.cpp            | 77 +++++++++++++++++++++++++++++
 2 files changed, 96 insertions(+)
 create mode 100644 poincare/include/poincare/integer.h
 create mode 100644 poincare/src/integer.cpp

diff --git a/poincare/include/poincare/integer.h b/poincare/include/poincare/integer.h
new file mode 100644
index 000000000..8e06aa7a3
--- /dev/null
+++ b/poincare/include/poincare/integer.h
@@ -0,0 +1,19 @@
+#ifndef POINCARE_NUMBER_H
+#define POINCARE_NUMBER_H
+
+#include <poincare/expression.h>
+
+class Integer : public Expression {
+  public:
+    Integer(char * string);
+    ~Integer();
+    //Number(int v);
+    virtual void draw();
+    virtual Expression ** children();
+  protected:
+    virtual void layout();
+  private:
+    void * m_bits;
+};
+
+#endif
diff --git a/poincare/src/integer.cpp b/poincare/src/integer.cpp
new file mode 100644
index 000000000..403a2906a
--- /dev/null
+++ b/poincare/src/integer.cpp
@@ -0,0 +1,77 @@
+#include <poincare/integer.h>
+#include <kandinsky/text.h>
+#include <string.h>
+#include <stdlib.h>
+
+Integer::Integer(char * string) {
+  int base = 10;
+  int stringLength = strlen(string);
+  /*
+  // Only support base 10 for now
+  if (stringLength > 2 && string[0] == '0')
+   switch (string[1]) {
+     case 'x':
+       base=16;
+       break;
+     case 'b':
+       base = 2;
+       break;
+   }
+  }
+  */
+
+  /* How many bits do we need to store that number knowing that it requires at
+   * most K digits in base N?
+   *
+   * We know that 2^(num_bits-1) < number < 2^num_bits
+   * So num_bits = ceil(log2(number))
+   *             = ceil(log2(N^K))
+   *             = ceil(log2(N)*K)
+   */
+  float log2 = 3.32193f; // Caution: This value has to be round up!
+  //int num_bytes = ceilf(log2*stringLength)/8;
+  // FIXME: We don't have ceilf just yet. Do we really need it though?
+  int num_bytes = (log2*stringLength)/8;
+
+  m_bits = malloc(num_bytes);
+
+
+
+  // How many bits in base 2 for a k-digits number in base n?
+  // num_bits = log_2(number) (because 2**num_bits = number, more or less)
+  // = log_2(n^k)
+  // = log_2(n)*k
+
+}
+
+Integer::~Integer() {
+  free(m_bits);
+}
+
+/*Number::Number(int v) : m_value(v) {
+  for (int i=0; i<16; i++) {
+    m_stringValue[i] = 0;
+  }
+
+  int value = v;
+  for (int i=0; i<15; i++) {
+    int digit = value - 10*(value/10);
+    m_stringValue[i] = '0' + digit;
+    value = value/10;
+    if (value == 0) {
+      break;
+    }
+  }
+}*/
+
+Expression ** Integer::children() {
+  return NULL;
+}
+
+void Integer::layout() {
+ //m_frame.size = KDStringSize(m_stringValue);
+}
+
+void Integer::draw() {
+  // KDDrawString(m_stringValue, KDPOINT(0,0));
+}