如何将Ruby inlineC代码分离到多个文件?
我希望将MATCH宏和位图移动到一个单独的文件中,因为我使用了这些位置,并且我希望避免重复代码。如何做到这一点如何将Ruby inlineC代码分离到多个文件?,ruby,inline,Ruby,Inline,我希望将MATCH宏和位图移动到一个单独的文件中,因为我使用了这些位置,并且我希望避免重复代码。如何做到这一点 require 'inline' # Class to calculate the Levenshtein distance between two # given strings. # http://en.wikipedia.org/wiki/Levenshtein_distance class Levenshtein BYTES_IN_INT = 4 def self.
require 'inline'
# Class to calculate the Levenshtein distance between two
# given strings.
# http://en.wikipedia.org/wiki/Levenshtein_distance
class Levenshtein
BYTES_IN_INT = 4
def self.distance(s, t)
return 0 if s == t;
return t.length if s.length == 0;
return s.length if t.length == 0;
v0 = "\0" * (t.length + 1) * BYTES_IN_INT
v1 = "\0" * (t.length + 1) * BYTES_IN_INT
l = self.new
l.distance_C(s, t, s.length, t.length, v0, v1)
end
# >>>>>>>>>>>>>>> RubyInline C code <<<<<<<<<<<<<<<
inline do |builder|
# Macro for matching nucleotides including ambiguity codes.
builder.prefix %{
#define MATCH(A,B) ((bitmap[A] & bitmap[B]) != 0)
}
# Bitmap for matching nucleotides including ambiguity codes.
# For each value bits are set from the left: bit pos 1 for A,
# bit pos 2 for T, bit pos 3 for C, and bit pos 4 for G.
builder.prefix %{
char bitmap[256] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 1,14, 4,11, 0, 0, 8, 7, 0, 0,10, 0, 5,15, 0,
0, 0, 9,12, 2, 2,13, 3, 0, 6, 0, 0, 0, 0, 0, 0,
0, 1,14, 4,11, 0, 0, 8, 7, 0, 0,10, 0, 5,15, 0,
0, 0, 9,12, 2, 2,13, 3, 0, 6, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
}
builder.prefix %{
unsigned int min(unsigned int a, unsigned int b, unsigned int c)
{
unsigned int m = a;
if (m > b) m = b;
if (m > c) m = c;
return m;
}
}
builder.c %{
VALUE distance_C(
VALUE _s, // string
VALUE _t, // string
VALUE _s_len, // string length
VALUE _t_len, // string length
VALUE _v0, // score vector
VALUE _v1 // score vector
)
{
char *s = (char *) StringValuePtr(_s);
char *t = (char *) StringValuePtr(_t);
unsigned int s_len = FIX2UINT(_s_len);
unsigned int t_len = FIX2UINT(_t_len);
unsigned int *v0 = (unsigned int *) StringValuePtr(_v0);
unsigned int *v1 = (unsigned int *) StringValuePtr(_v1);
unsigned int i = 0;
unsigned int j = 0;
unsigned int cost = 0;
for (i = 0; i < t_len + 1; i++)
v0[i] = i;
for (i = 0; i < s_len; i++)
{
v1[0] = i + 1;
for (j = 0; j < t_len; j++)
{
cost = (MATCH(s[i], t[j])) ? 0 : 1;
v1[j + 1] = min(v1[j] + 1, v0[j + 1] + 1, v0[j] + cost);
}
for (j = 0; j < t_len + 1; j++)
v0[j] = v1[j];
}
return UINT2NUM(v1[t_len]);
}
}
end
end
要求“内联”
#类来计算两个对象之间的Levenshtein距离
#给定字符串。
# http://en.wikipedia.org/wiki/Levenshtein_distance
Levenshtein类
字节\u IN\u INT=4
def自身距离(s、t)
如果s==t,则返回0;
如果s.length==0,则返回t.length;
如果t.length==0,则返回s.length;
v0=“\0”*(t.length+1)*字节数
v1=“\0”*(t.length+1)*字节数
l=自我更新
l、 距离C(s,t,s长度,t长度,v0,v1)
结束
#>>>>>>>>>>>>>>>>>>>RubyLine C代码builder.prefix
只是一个方法调用,因此您可以创建一个Ruby方法,用宏和字符数组调用它,然后将它添加到任何想要内联使用这些C代码段的类中。e、 g
module MixinCommonC
def add_match_macro inline_builder
inline_builder.prefix %{
#define MATCH(A,B) ((bitmap[A] & bitmap[B]) != 0)
}
end
end
在示例代码中,对其进行以下更改:
开始上课时
class Levenshtein
extend MixinCommonC
(它是extend
而不是include
,因为inline
方法是针对类调用的,所以只能访问块内的类方法)
当前可以调用builder.prefix
:
add_match_macro( builder )
嗯,我没能让它工作:我的错误-使用extend
而不是include
,因为inline
命令是针对类调用的,所以需要类方法include
用于混合实例方法。