wrb 2.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: d24162aaa236c333d02af6790b81cc49918a02a92d64b68270aa4a0fbd75573e
+  data.tar.gz: 113784bdc5058b80603e495f9664b8527758a29e5f0e48ddf4b23a7ce50a64f6
+SHA512:
+  metadata.gz: 9b0d7cb894e55b3cf8607fe04a6f620ec8d5e696e6024e700a935e773b6fe4ecbfae82e9e4ad8782c94a2393ba45aa31e7048c9e96f30b30ab69417e982d5eac
+  data.tar.gz: d11d2053ab3f6a48f6264f16e4e78ccc1b73f8061ad5a156ef07f27bf13bc1942ffe2ebe94ee15b52aa7cce8feddf0526ea621cedb0d5f8a8a80df78e07fd3bf

data/README

@@ -0,0 +1,28 @@
+Project WRB was forked from Project VisualuRuby(temp-name).
+Author of this project: BANJO Koyu <banjokoyu at gmail.com>
+Copyright 2018-2018 "BANJO Koyu" and WRB development team.
+The URL of this project is https://bitbucket.org/wrb/ .
+
+Note: The URL of Project VisualuRuby(temp-name) is
+�@http://www.osk.3web.ne.jp/~nyasu/vruby/vrproject-e.html .
+
+To install this library, follow the instructions below.
+
+Step1:
+  Make sure that you can install the extension library, 
+  that is, C compiler, Make tool etc works.
+
+Step2:
+  Type below in your command line.
+    $ gem install wrb
+
+Step 3:
+  Wait a few minutes, and make sure following message.
+    Done installing documentation for wrb ...
+    1 gem installed
+
+Step 4:
+  Type "wrb" to see the documents and samples.
+  Type "wrb -f" to run the FormDesigner.
+
+Enjoy!!

data/Rakefile

@@ -0,0 +1,66 @@
+require 'rubygems/package_task'
+begin
+  require 'rake/extensiontask' # This line needs 'rake-compiler' of gems.
+rescue
+  raise "Install `rake-compiler'."
+end
+
+PKG_FILES = FileList[
+  'ext/rwin/*.c',
+  'ext/rwin/*.h',
+  'ext/rwin/*.rb',
+  'lib/*.rb',
+  'lib/wrb/*.rb',
+  'lib/wrb/components/*.rb',
+  'lib/wrb/applications/frmdesigner/*.rb',
+  'lib/wrb/applications/frmdesigner/*.bmp',
+  'lib/wrb/applications/frmdesigner/*.cur',
+  'lib/wrb/applications/frmdesigner/controls/*.rb',
+  'lib/wrb/applications/frmdesigner/controls/*.bmp',
+  'lib/wrb/documents/*.html',
+  'lib/wrb/documents/*.css',
+  'lib/wrb/documents/*.txt',
+  'lib/wrb/documents/*.png',
+  'lib/wrb/documents/*.rb',
+  'lib/wrb/documents/samples/*.rb',
+  'lib/wrb/documents/samples/*.png',
+  'lib/wrb/documents/samples/*.bmp',
+  'lib/wrb/documents/samples/*.iml',
+  'lib/wrb/documents/samples/*.ico',
+  'lib/wrb/documents/images/*.png',
+  'bin/wrb',
+  'bin/wrb.bat',
+  'Rakefile',
+  'README'
+]
+
+desc "Default Task"
+task :default => [:package]
+
+extension = Rake::ExtensionTask.new("rwin") do|ext|
+  ext.lib_dir = "lib/wrb"
+end
+
+require 'wrb'
+spec = Gem::Specification.new do |s|
+  s.required_ruby_version = '>= 2.3.0'
+  s.name             = 'wrb'
+  s.version          = WR::WR_VERSION
+  s.author           = 'Banjo Koyu'
+  s.email            = 'banjokoyu@gmail.com'
+  s.homepage         = 'https://bitbucket.org/wrb'
+  s.platform         = Gem::Platform::RUBY
+  s.license          = 'BSD-2-Clause'
+  s.summary          = 'A Windows GUI framework for Ruby.'
+  s.files            = PKG_FILES.to_a 
+  s.executables      = ['wrb']
+  s.require_paths    = ['lib', 'bin']
+  s.has_rdoc         = false
+  #s.extra_rdoc_files = ['README']
+  s.description      = "A Windows GUI framework for Ruby running on Ruby 2.X."
+  s.extensions = ["ext/rwin/extconf.rb"]
+end
+
+Gem::PackageTask.new(spec) do |pkg|
+  pkg.gem_spec = spec
+end

data/bin/wrb

@@ -0,0 +1,41 @@
+#!/usr/bin/env ruby
+require 'wrb'
+module WR
+  def self.wrb_show_doc()
+    pid = Registry.open(RC::HKCU,
+        'Software\Microsoft\Windows\Shell\Associations\UrlAssociations\HTTP\UserChoice'){|r|
+      r.read('Progid')
+    }
+    path = Registry.open(RC::HKCR, pid+'\shell\open\command'){|r| r.read}.match(/^\".+?\"/)[0]
+    doc = WR_INSTALLED_DIR + '/wrb/documents/index.html'
+    if RbConfig::CONFIG['arch'] =~ /cygwin/
+      s = `cygpath -a #{path}`
+      s.gsub!(/[ ()]/){'\\' + $&}
+      d = `cygpath -aw #{doc}`
+      exec s.chomp + ' "' + d.chomp + '"' + " &"
+    else
+      exec "start " + path + ' "' + doc.tr('/', '\\') + '"'
+    end
+  end
+end
+
+if ARGV.size>0 && ARGV[0] =~ /-\w+/
+  case ARGV.shift
+  when '-x'
+    require 'wrb/applications/exebuilder/xbuild.rb'
+    WR::MainForm.start_as_dialog
+  when '-f'
+    require 'wrb/applications/frmdesigner/fdesign.rb'
+    WR::FDMain.start
+  when '-r'
+    require 'wrb/applications/rsccreator/rcreate.rb'
+    WR::MainForm.start
+  when '-e'
+    require 'wrb/applications/scieditor/sciedit.rb'
+    WR::MainForm.start
+  else
+    WR.wrb_show_doc
+  end
+else
+  WR.wrb_show_doc
+end

data/bin/wrb.bat

@@ -0,0 +1,6 @@
+@ECHO OFF
+IF NOT "%~f0" == "~f0" GOTO :WinNT
+ECHO.This version of Ruby has not been built with support for Windows 95/98/Me.
+GOTO :EOF
+:WinNT
+@"%~dp0rubyw.exe" "%~dpn0" %*

data/ext/rwin/aatree.c

@@ -0,0 +1,192 @@
+/*
+# AA tree (Arne Anderson's balancing tree)
+# Programmed by BANJO Koyu <banjokoyu at gmail.com>.
+# Referred to:
+#   https://gist.github.com/siritori/2760460
+#   http://www.geocities.jp/m_hiroi/light/pyalgo53.html
+# Thanks!
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "aatree.h"
+
+static AAnode*
+newAAnode(const ULONG_PTR key, void *val, AAnode *nullnode) {
+    AAnode *node = (AAnode*)malloc(sizeof(AAnode));
+    if(node){
+	node->key = key;
+	node->val = val;
+	node->level  = 1;
+	node->left = node->right = NULL;
+    }
+    return node;
+}
+
+AAtree*
+newAAtree(void(*valfree_func)(void*)) {
+    AAtree *tree = (AAtree*)malloc(sizeof(AAtree));
+	if(tree){
+	    tree->root = NULL;
+	    tree->num_entries = 0;
+	    tree->valfree_func = valfree_func;
+	}
+    return tree;
+}
+
+static void
+free_aatree_(AAtree *tree, AAnode *node) {
+    if(node){
+	if(node->left) free_aatree_(tree, node->left);
+	if(node->right) free_aatree_(tree, node->right);
+	if(node->val && tree->valfree_func) (tree->valfree_func)(node->val);
+	free(node);
+    }
+}
+void
+freeAAtree(AAtree *tree) {
+    free_aatree_(tree, tree->root);
+    free(tree);
+}
+
+static AAnode*
+aa_skew(AAnode *node) {
+    if(!node || !node->left) return node;
+    if(node->level == node->left->level){
+	AAnode *left = node->left;
+	node->left = left->right;
+	left->right = node;
+	return left;
+    }
+    return node;
+}
+
+static AAnode*
+aa_split(AAnode *node) {
+    if(!node || !node->right || !node->right->right) return node;
+    if(node->right->right->level == node->level){
+	AAnode *right = node->right;
+	node->right = right->left;
+	right->left = node;
+	right->level++;
+	return right;
+    }
+    return node;
+}
+
+static AAnode*
+aa_search_(AAnode *node, const ULONG_PTR key) {
+    if(node && node->key != key){ /* faster than non-recuresive! */
+	return aa_search_((node->key > key) ? node->left : node->right, key);
+    }
+    return node;
+}
+AAnode*
+aaSearch(const AAtree *tree, const ULONG_PTR key) {
+    return aa_search_(tree->root, key);
+}
+
+void*
+aaGetval(const AAtree *tree, const ULONG_PTR key) {
+    AAnode *nd = aa_search_(tree->root, key);
+    return nd ? nd->val : 0;
+}
+
+static AAnode*
+aa_insert_(AAtree *tree, AAnode *node, const ULONG_PTR key, void *val) {
+    if(!node) {
+	node = newAAnode(key, val, NULL);
+	tree->num_entries++;
+	return node;
+    }
+    if(key < node->key) {
+	node->left = aa_insert_(tree, node->left, key, val);
+    } else if(key > node->key) {
+	node->right = aa_insert_(tree, node->right, key, val);
+    } else return node;
+    node = aa_skew(node);
+    node = aa_split(node);
+    return node;
+}
+
+AAtree*
+aaInsert(AAtree *tree, const ULONG_PTR key, void *val) {
+    tree->root = aa_insert_(tree, tree->root, key, val);
+    return tree;
+}
+
+static AAnode*
+search_min(AAnode *node){
+    AAnode *nd = node;
+    while(nd->left){ nd = nd->left; }
+    return nd;
+}
+
+static AAnode*
+aa_delete_(AAtree *tree, AAnode *node, const ULONG_PTR key, void(*free_func)(void*)) {
+    if (!node) return node;
+    if (key > node->key){
+	node->right = aa_delete_(tree, node->right, key, free_func);
+    } else if (key < node->key){
+	node->left = aa_delete_(tree, node->left, key, free_func);
+    } else { /* key == node->key */
+	AAnode *nd;
+	if(!node->left){
+	    AAnode *ndel = node;
+	    if (ndel->val && free_func) (free_func)(ndel->val);/* callback */
+	    tree->num_entries--;
+	    node = node->right;
+	    free(ndel);
+	    return node;
+	} else if (!node->right){
+	    AAnode *ndel = node;
+	    tree->num_entries--;
+	    if (ndel->val && free_func) (free_func)(ndel->val);/* callback */
+	    node = node->left;
+	    free(ndel);
+	    return node;
+	}
+	nd = search_min(node->right);
+	node->key = nd->key;
+	node->val = nd->val;
+	node->right = aa_delete_(tree, node->right, node->key, NULL);
+	
+	/* re-balancing */
+	if (node->left && node->right &&
+	    (node->left->level < node->level-1 || node->right->level < node->level-1)){
+	    node->level--;
+	    if(node->right->level > node->level) node->right->level = node->level;
+	    node = aa_skew(node);
+	    node->right = aa_skew(node->right);
+	    if(node->right->right) node->right->right = aa_skew(node->right->right);
+	    node = aa_split(node);
+	    node->right = aa_split(node->right);	
+	}
+    }
+    return node;
+}
+
+AAtree*
+aaDelete(AAtree *tree, const ULONG_PTR key) {
+    unsigned n = tree->num_entries;
+    tree->root = aa_delete_(tree, tree->root, key, tree->valfree_func);
+    return (n == tree->num_entries) ? 0 : tree;
+}
+
+unsigned
+aaCount(const AAtree *tree) {
+    return tree->num_entries;
+}
+
+static void
+aa_foreach_(const AAnode *node, AAForeach cb, void *arg) {
+    if(!node) return;
+    aa_foreach_(node->left, cb, arg);
+    (*cb)(node, arg);
+    aa_foreach_(node->right, cb, arg);
+}
+
+void
+aaForeach(const AAtree *tree, AAForeach callback, void *arg) {
+    aa_foreach_(tree->root, callback, arg);
+}

data/ext/rwin/aatree.h

@@ -0,0 +1,55 @@
+/*
+# AA tree (Arne Anderson's balancing tree)
+# Programmed by BANJO Koyu <banjokoyu at gmail.com>.
+# Referred to:
+#   https://gist.github.com/siritori/2760460
+#   http://www.geocities.jp/m_hiroi/light/pyalgo53.html
+# Thanks!
+*/
+
+#ifndef AA_TREE_H__
+#define AA_TREE_H__
+#include <ctype.h>
+#include <windows.h>
+typedef struct AAnode_ {
+    ULONG_PTR key;
+    union{
+	INT_PTR num;
+	void *val;
+    };
+    int level;
+    struct AAnode_ *left, *right;
+} AAnode;
+
+typedef struct {
+    AAnode *root;
+    void(*valfree_func)(void*);
+    unsigned int num_entries;
+} AAtree;
+
+/* creates new empty tree. valfree_func can be set NULL. */
+AAtree* newAAtree(void(*valfree_func)(void*));
+
+/* must be called at last */
+void freeAAtree(AAtree *tree);
+
+AAnode* aaSearch(const AAtree *tree, const ULONG_PTR key);
+
+/* this function causes error when key does not exist */
+void* aaGetval(const AAtree *tree, const ULONG_PTR key);
+
+AAtree*  aaInsert(AAtree *tree, const ULONG_PTR key, void *val);
+
+AAtree*  aaDelete(AAtree *tree, const ULONG_PTR key);
+
+unsigned aaCount(const AAtree *tree);
+
+/* foreach statement */
+typedef void (*AAForeach)(const AAnode *, void *args);
+void aaForeach(const AAtree *tree, AAForeach callback, void *arg);
+
+/* map statement(old value is released automatically) */
+typedef void*(*AAmap)(const AAnode *);
+AAtree* aaMap(AAtree *tree, AAmap callback);
+
+#endif

data/ext/rwin/extconf.rb

@@ -0,0 +1,47 @@
+# Project WRB was forked from Project VisualuRuby(temp-name).
+# Author of this project: BANJO Koyu <banjokoyu at gmail.com>
+# The URL of this project: https://bitbucket.org/wrb/
+#
+# This is a ext-library part of WRB.
+
+require "mkmf"
+
+if RUBY_VERSION < "2.2.0"
+  STDERR.puts "ABORT: This version supports only Ruby 2.2 or later."
+end
+cflags = [" -DUNICODE", " -DRWIN_USEMULTITHREAD"]
+ARGV.each{|i|
+  case i
+  when '--nounicode'
+    cflags.delete(" -DUNICODE")
+  when '--nomultithread'
+    cflags.delete(" -DRWIN_USEMULTITHREAD")
+  else
+    STDERR.puts "ABORT: unrecognised option: #{i}"
+    exit
+  end
+}
+
+$CFLAGS += cflags.join('')
+#$CFLAGS += " -DUNICODE -DRWIN_USEMULTITHREAD"
+$LDFLAGS += " -s" if CONFIG["GCC"] == "yes"
+
+SYSTEM_LIBRARIES = [
+#  "uuid",
+  "ole32",
+  "winspool",
+  "comctl32",
+#  "comdlg32",
+  "gdi32",
+  "user32",
+  "kernel32",
+  "gdiplus"
+]
+
+lacking = SYSTEM_LIBRARIES.inject([]){|ar, lib| ar<< lib unless have_library(lib)}
+
+if lacking
+  STDERR.puts "ABORT: missing libraries: "<< lacking.join(",")
+else
+  create_makefile("rwin")
+end