vimamsa 0.1.0 → 0.1.5
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/.vma_project +0 -0
- data/README.md +110 -16
- data/exe/vimamsa +40 -0
- data/ext/vmaext/vmaext.c +0 -3
- data/lang/hyperplaintext.lang +129 -0
- data/lib/vimamsa.rb +3 -1
- data/lib/vimamsa/ack.rb +35 -0
- data/lib/vimamsa/actions.rb +125 -0
- data/lib/vimamsa/buffer.rb +1760 -0
- data/lib/vimamsa/buffer_list.rb +207 -0
- data/lib/vimamsa/constants.rb +44 -0
- data/lib/vimamsa/debug.rb +142 -0
- data/lib/vimamsa/default_key_bindings.rb +448 -0
- data/lib/vimamsa/easy_jump.rb +161 -0
- data/lib/vimamsa/editor.rb +667 -0
- data/lib/vimamsa/encrypt.rb +47 -0
- data/lib/vimamsa/file_finder.rb +103 -0
- data/lib/vimamsa/file_history.rb +100 -0
- data/lib/vimamsa/file_manager.rb +144 -0
- data/lib/vimamsa/hook.rb +46 -0
- data/lib/vimamsa/hyper_plain_text.rb +61 -0
- data/lib/vimamsa/key_binding_tree.rb +603 -0
- data/lib/vimamsa/macro.rb +177 -0
- data/lib/vimamsa/main.rb +71 -0
- data/lib/vimamsa/rbvma.rb +1072 -0
- data/lib/vimamsa/search.rb +100 -0
- data/lib/vimamsa/search_replace.rb +333 -0
- data/lib/vimamsa/text_transforms.rb +32 -0
- data/lib/vimamsa/util.rb +101 -0
- data/lib/vimamsa/version.rb +1 -1
- data/styles/134272-molokai.xml +33 -0
- data/styles/dark.xml +152 -0
- data/styles/molokai_edit.xml +49 -0
- data/vimamsa.gemspec +4 -2
- metadata +66 -10
- data/ext/vimamsa/extconf.rb +0 -11
- data/ext/vimamsa/vimamsa.c +0 -174
data/ext/vimamsa/extconf.rb
DELETED
data/ext/vimamsa/vimamsa.c
DELETED
@@ -1,174 +0,0 @@
|
|
1
|
-
#include <ruby.h>
|
2
|
-
// #include <gtk/gtk.h>
|
3
|
-
#include "ruby/ruby.h"
|
4
|
-
|
5
|
-
#include <stdio.h>
|
6
|
-
#include <string.h>
|
7
|
-
#include <stdlib.h>
|
8
|
-
|
9
|
-
#warning "C Preprocessor got here!"
|
10
|
-
|
11
|
-
typedef struct node {
|
12
|
-
int i;
|
13
|
-
void * next;
|
14
|
-
} node;
|
15
|
-
|
16
|
-
|
17
|
-
void add_to_list(unsigned char c, int i, struct node ** t) {
|
18
|
-
struct node * n;
|
19
|
-
struct node * np;
|
20
|
-
|
21
|
-
n =(struct node*) calloc(1,sizeof(struct node)); //TODO: free
|
22
|
-
n->i = i;
|
23
|
-
if(!t[c]) {
|
24
|
-
t[c] = n;
|
25
|
-
}
|
26
|
-
else {
|
27
|
-
np = t[c];
|
28
|
-
while (np->next) {
|
29
|
-
np = np->next;
|
30
|
-
}
|
31
|
-
np->next = n;
|
32
|
-
}
|
33
|
-
}
|
34
|
-
|
35
|
-
void dump_list(struct node**t) {
|
36
|
-
for(int i=0;i < 256; i++) {
|
37
|
-
if(t[i]) {
|
38
|
-
printf ("\n%c: ", (char) i);
|
39
|
-
struct node * n = t[i];
|
40
|
-
do {
|
41
|
-
printf ("%d ", n->i);
|
42
|
-
}
|
43
|
-
while (n = n->next);
|
44
|
-
}
|
45
|
-
}
|
46
|
-
}
|
47
|
-
|
48
|
-
float calc_sub_score(unsigned char* s1, unsigned char* s2, int i1, int i2) {
|
49
|
-
|
50
|
-
int s1_len = strlen(s1);
|
51
|
-
int s2_len = strlen(s2);
|
52
|
-
float sub_score = 1;
|
53
|
-
float score_inc = 1;
|
54
|
-
float score_inc_multip = 0.63212;
|
55
|
-
//float score_inc_multip = 0.23212;
|
56
|
-
|
57
|
-
|
58
|
-
// From i2 to zero
|
59
|
-
int i_s1 = i1-1;
|
60
|
-
//printf("{");
|
61
|
-
for (int i_s2=i2-1; i_s2 >= 0 && i_s1 >= 0;) {
|
62
|
-
if(s1[i_s1] == s2[i_s2]) {
|
63
|
-
//printf("%c",s1[i_s1]);
|
64
|
-
i_s1--; i_s2--;
|
65
|
-
sub_score += score_inc;
|
66
|
-
score_inc = 1;
|
67
|
-
}
|
68
|
-
else {i_s2--; score_inc = score_inc*score_inc_multip;}
|
69
|
-
}
|
70
|
-
|
71
|
-
|
72
|
-
// From i2 to end
|
73
|
-
score_inc = 1;
|
74
|
-
i_s1 = i1+1;
|
75
|
-
//printf("%c",s1[i1]);
|
76
|
-
for (int i_s2=i2+1; i_s2 < s2_len && i_s1 < s1_len;) {
|
77
|
-
if(s1[i_s1] == s2[i_s2]) {
|
78
|
-
//printf("%c",s1[i_s1]);
|
79
|
-
i_s1++; i_s2++;
|
80
|
-
sub_score += score_inc;
|
81
|
-
score_inc = 1;
|
82
|
-
}
|
83
|
-
else {i_s2++;score_inc = score_inc*score_inc_multip;}
|
84
|
-
}
|
85
|
-
|
86
|
-
|
87
|
-
//printf("}");
|
88
|
-
return sub_score;
|
89
|
-
|
90
|
-
}
|
91
|
-
|
92
|
-
float srn_dst(char * s1_sgn, char * s2_sgn) {
|
93
|
-
unsigned char* s1;
|
94
|
-
unsigned char* s2;
|
95
|
-
s1 = (unsigned char *) s1_sgn;
|
96
|
-
s2 = (unsigned char *) s2_sgn;
|
97
|
-
struct node** t;
|
98
|
-
int len_s1 = strlen(s1);
|
99
|
-
int len_s2 = strlen(s2);
|
100
|
-
t = (struct node**) calloc(256,sizeof(struct node*));
|
101
|
-
float score=0;
|
102
|
-
node * nA;
|
103
|
-
node * nB;
|
104
|
-
//printf("l1,2: %d %d\n",len_s1,len_s2);
|
105
|
-
|
106
|
-
for(int i_s2=0;i_s2 < strlen(s2); i_s2++) {
|
107
|
-
add_to_list(s2[i_s2],i_s2,t);
|
108
|
-
}
|
109
|
-
|
110
|
-
for(int i_s1=0;i_s1 < strlen(s1); i_s1++) {
|
111
|
-
struct node * n = t[s1[i_s1]];
|
112
|
-
if (n) {
|
113
|
-
float max_score = 0;
|
114
|
-
unsigned char c = s1[i_s1];
|
115
|
-
do {
|
116
|
-
float sub_score = calc_sub_score(s1,s2,i_s1,n->i);
|
117
|
-
if(sub_score > max_score) {max_score = sub_score;}
|
118
|
-
//printf(" i=%d %c %d [%f] \n",i_s1,c,n->i,sub_score);
|
119
|
-
} while(n = n->next);
|
120
|
-
score += max_score;
|
121
|
-
}
|
122
|
-
}
|
123
|
-
|
124
|
-
//dump_list(t);
|
125
|
-
float p =0.01;
|
126
|
-
score = (1-p)*score/(len_s1*len_s1) +p*score/(len_s1*len_s2);
|
127
|
-
|
128
|
-
// Free memory
|
129
|
-
for(int i=0;i<256;i++) {
|
130
|
-
if(t[i]) {
|
131
|
-
// node * nA = t[i];
|
132
|
-
// node * nB;
|
133
|
-
nA = t[i];
|
134
|
-
do {
|
135
|
-
nB = nA->next;
|
136
|
-
free(nA);
|
137
|
-
nA = nB;
|
138
|
-
} while (nA);
|
139
|
-
}
|
140
|
-
}
|
141
|
-
free(t);
|
142
|
-
|
143
|
-
return score;
|
144
|
-
}
|
145
|
-
|
146
|
-
void srn_dst_wrap(void *y) {
|
147
|
-
void **x = (void **)y;
|
148
|
-
char *a = (char *)x[0];
|
149
|
-
char *b = (char *)x[1];
|
150
|
-
float *d = (float *)x[2];
|
151
|
-
*d = srn_dst(a, b);
|
152
|
-
// printf("00000 A:%s B:%s %f\n",a,b,*d);
|
153
|
-
}
|
154
|
-
|
155
|
-
VALUE _srn_dst(VALUE self, VALUE s1, VALUE s2) {
|
156
|
-
VALUE ret;
|
157
|
-
float d;
|
158
|
-
void **ptr = malloc(sizeof(void *) * 3);
|
159
|
-
ptr[0] = (void *)StringValueCStr(s1);
|
160
|
-
ptr[1] = (void *)StringValueCStr(s2);
|
161
|
-
ptr[2] = (void *)&d;
|
162
|
-
rb_thread_call_without_gvl(srn_dst_wrap, ptr, NULL, NULL);
|
163
|
-
// d = srn_dst(StringValueCStr(s1), StringValueCStr(s2));
|
164
|
-
ret = rb_float_new(d);
|
165
|
-
free(ptr);
|
166
|
-
return ret;
|
167
|
-
}
|
168
|
-
|
169
|
-
void Init_vimamsa(void) {
|
170
|
-
printf("Init_vimamsa\n");
|
171
|
-
rb_define_global_function("srn_dst", _srn_dst, 2);
|
172
|
-
}
|
173
|
-
|
174
|
-
|