1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646
|
/*
* spvec.c - Sparse vector
*
* Copyright (c) 2009-2020 Shiro Kawai <shiro@acm.org>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the authors nor the names of its contributors
* may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "spvec.h"
#define INDEX_CHECK(n) /*empty*/
/*===================================================================
* Generic stuff
* NB: The generic constructor is defined near the bottom of the source,
* since it should come after static descriptor definitions.
*/
/* Common CPL */
ScmClass *spvec_cpl[] = {
SCM_CLASS_STATIC_PTR(Scm_SparseVectorBaseClass),
SCM_CLASS_STATIC_PTR(Scm_DictionaryClass),
SCM_CLASS_STATIC_PTR(Scm_CollectionClass),
SCM_CLASS_STATIC_PTR(Scm_TopClass),
NULL
};
ScmClass *spmat_cpl[] = {
SCM_CLASS_STATIC_PTR(Scm_SparseMatrixBaseClass),
SCM_CLASS_STATIC_PTR(Scm_CollectionClass),
SCM_CLASS_STATIC_PTR(Scm_TopClass),
NULL
};
SCM_DEFINE_BUILTIN_CLASS(Scm_SparseVectorBaseClass,
NULL, NULL, NULL, NULL,
spvec_cpl+1);
SCM_DEFINE_BUILTIN_CLASS(Scm_SparseMatrixBaseClass,
NULL, NULL, NULL, NULL,
spmat_cpl+1);
ScmObj SparseVectorRef(SparseVector *sv, u_long index, ScmObj fallback)
{
INDEX_CHECK(index);
Leaf *leaf = CompactTrieGet(&sv->trie, index >> sv->desc->shift);
if (leaf == NULL) return fallback;
ScmObj v = sv->desc->ref(leaf, index);
if (SCM_UNBOUNDP(v)) return fallback;
else return v;
}
void SparseVectorSet(SparseVector *sv, u_long index, ScmObj value)
{
INDEX_CHECK(index);
Leaf *leaf = CompactTrieAdd(&sv->trie, index >> sv->desc->shift,
sv->desc->allocate, sv);
/* set returns TRUE if this is a new entry */
if (sv->desc->set(leaf, index, value)) sv->numEntries++;
}
/* returns value of the deleted entry, or SCM_UNBOUND if there's no entry */
ScmObj SparseVectorDelete(SparseVector *sv, u_long index)
{
INDEX_CHECK(index);
Leaf *leaf = CompactTrieGet(&sv->trie, index >> sv->desc->shift);
if (leaf == NULL) return SCM_UNBOUND;
ScmObj r = sv->desc->delete(leaf, index);
if (!SCM_UNBOUNDP(r)) sv->numEntries--;
return r;
}
void SparseVectorClear(SparseVector *sv)
{
sv->numEntries = 0;
CompactTrieClear(&sv->trie, sv->desc->clear, sv->desc);
}
ScmObj SparseVectorCopy(const SparseVector *src)
{
SparseVector *dst =
(SparseVector*)MakeSparseVector(Scm_ClassOf(SCM_OBJ(src)),
src->defaultValue,
src->flags);
CompactTrieCopy(&dst->trie, &src->trie, src->desc->copy, src->desc);
dst->numEntries = src->numEntries;
return SCM_OBJ(dst);
}
void SparseVectorIterInit(SparseVectorIter *iter, SparseVector *sv)
{
iter->sv = sv;
iter->leaf = NULL;
CompactTrieIterInit(&iter->citer, &sv->trie);
iter->leafIndex = -1;
}
ScmObj SparseVectorIterNext(SparseVectorIter *iter)
{
ScmObj (*iterproc)(Leaf*,int*) = iter->sv->desc->iter;
for (;;) {
if (iter->leaf) {
ScmObj r = iterproc(iter->leaf, &iter->leafIndex);
if (!SCM_UNBOUNDP(r)) {
u_long ind = ((leaf_key(iter->leaf) << iter->sv->desc->shift)
+ iter->leafIndex);
return Scm_Cons(Scm_MakeIntegerU(ind), r);
}
}
iter->leaf = CompactTrieIterNext(&iter->citer);
if (iter->leaf == NULL) return SCM_FALSE; /* we're at the end */
iter->leafIndex = -1;
}
}
/* special routine for uniform numeric sparse vectors */
/* TODO: Allow clamp arg */
ScmObj SparseVectorInc(SparseVector *sv, u_long index,
ScmObj delta, /* number */
ScmObj fallback) /* number or unbound */
{
if (!SCM_NUMBERP(fallback)) {
if (SCM_NUMBERP(sv->defaultValue)) {
fallback = sv->defaultValue;
} else {
fallback = SCM_MAKE_INT(0);
}
}
INDEX_CHECK(index);
Leaf *leaf = CompactTrieGet(&sv->trie, index >> sv->desc->shift);
if (leaf == NULL) {
ScmObj v = Scm_Add(fallback, delta);
SparseVectorSet(sv, index, v);
return v;
} else {
ScmObj v = sv->desc->ref(leaf, index);
if (SCM_UNBOUNDP(v)) v = fallback;
v = Scm_Add(v, delta);
sv->desc->set(leaf, index, v);
return v;
}
}
void SparseVectorDump(SparseVector *sv)
{
CompactTrieDump(SCM_CUROUT, &sv->trie, sv->desc->dump, sv->desc);
}
/*===================================================================
* Individual vector types
*/
/*-------------------------------------------------------------------
* General vector
*/
typedef struct GLeafRec {
Leaf hdr;
ScmObj val[2];
} GLeaf;
static ScmObj g_ref(Leaf *leaf, u_long index)
{
return ((GLeaf*)leaf)->val[index&1];
}
static Leaf *g_allocate(void *data SCM_UNUSED)
{
GLeaf *z = SCM_NEW(GLeaf);
z->val[0] = z->val[1] = SCM_UNBOUND;
return (Leaf*)z;
}
static int g_set(Leaf *leaf, u_long index, ScmObj value)
{
ScmObj v = ((GLeaf*)leaf)->val[index&1];
((GLeaf*)leaf)->val[index&1] = value;
return SCM_UNBOUNDP(v);
}
static ScmObj g_delete(Leaf *leaf, u_long index)
{
ScmObj v = ((GLeaf*)leaf)->val[index&1];
((GLeaf*)leaf)->val[index&1] = SCM_UNBOUND;
return v;
}
static void g_clear(Leaf *leaf, void *data SCM_UNUSED)
{
GLeaf *z = (GLeaf*)leaf;
z->val[0] = z->val[1] = NULL;
}
static Leaf *g_copy(Leaf *leaf, void *data SCM_UNUSED)
{
GLeaf *dst = SCM_NEW(GLeaf);
*dst = *(GLeaf*)leaf;
return (Leaf*)dst;
}
static ScmObj g_iter(Leaf *leaf, int *index)
{
GLeaf *z = (GLeaf*)leaf;
if (++(*index) == 0) {
if (!SCM_UNBOUNDP(z->val[0])) return z->val[0];
(*index)++;
/*FALLTHROUGH*/
}
if (*index == 1) {
if (!SCM_UNBOUNDP(z->val[1])) return z->val[1];
(*index)++;
}
return SCM_UNBOUND;
}
static void g_dump(ScmPort *out, Leaf *leaf, int indent, void *data SCM_UNUSED)
{
GLeaf *z = (GLeaf*)leaf;
for (int i=0; i<2; i++) {
if (!SCM_UNBOUNDP(z->val[i])) {
Scm_Printf(out, "\n %*s%2d: %25.1S", indent, "", i, z->val[i]);
}
}
}
static SparseVectorDescriptor g_desc = {
g_ref, g_set, g_allocate, g_delete, g_clear, g_copy, g_iter, g_dump, 1
};
SCM_DEFINE_BUILTIN_CLASS(Scm_SparseVectorClass, NULL, NULL, NULL, NULL,
spvec_cpl);
SCM_DEFINE_BUILTIN_CLASS(Scm_SparseMatrixClass, NULL, NULL, NULL, NULL,
spmat_cpl);
/*-------------------------------------------------------------------
* Uniform sparse vector common stuff
*/
typedef struct ULeafRec {
Leaf hdr; /* LEAF_DATA has bitmap of used entries */
union {
ScmWord dummy[2]; /* placeholder */
int8_t s8[2*SIZEOF_LONG];
uint8_t u8[2*SIZEOF_LONG];
int16_t s16[SIZEOF_LONG];
uint16_t u16[SIZEOF_LONG];
int32_t s32[SIZEOF_LONG/2];
uint32_t u32[SIZEOF_LONG/2];
int64_t s64[SIZEOF_LONG/4];
uint64_t u64[SIZEOF_LONG/4];
ScmHalfFloat f16[SIZEOF_LONG];
float f32[SIZEOF_LONG/2];
double f64[SIZEOF_LONG/4];
};
} ULeaf;
#define ULEAF(leaf) ((ULeaf*)leaf)
#if SIZEOF_LONG == 4
#define SHIFT8 3
#define SHIFT16 2
#define SHIFT32 1
#define SHIFT64 0
#else /* SIZEOF_LONG != 4 */
#define SHIFT8 4
#define SHIFT16 3
#define SHIFT32 2
#define SHIFT64 1
#endif /* SIZEOF_LONG != 4 */
#define MASK8 ((1UL<<SHIFT8)-1)
#define MASK16 ((1UL<<SHIFT16)-1)
#define MASK32 ((1UL<<SHIFT32)-1)
#define MASK64 ((1UL<<SHIFT64)-1)
#define U_HAS_ENTRY(leaf, ind, mask) leaf_data_bit_test(leaf, (ind)&(mask))
#define U_SET_ENTRY(leaf, ind, mask) leaf_data_bit_set(leaf, (ind)&(mask))
#define U_RESET_ENTRY(leaf, ind, mask) leaf_data_bit_reset(leaf, (ind)&(mask))
static Leaf *u_allocate(void *data SCM_UNUSED)
{
ULeaf *z = SCM_NEW_ATOMIC(ULeaf);
z->dummy[0] = z->dummy[1] = 0;
return (Leaf*)z;
}
static void u_clear(Leaf *leaf SCM_UNUSED, void *data SCM_UNUSED)
{
/* nothing to do */
}
static Leaf *u_copy(Leaf *leaf, void *data SCM_UNUSED)
{
ULeaf *z = SCM_NEW_ATOMIC(ULeaf);
memcpy(z, leaf, sizeof(ULeaf));
return (Leaf*)z;
}
/*-------------------------------------------------------------------
* Uniform Sparse Vector Ref
*/
#define REF_CHECK(leaf, index, mask) \
do { if (!U_HAS_ENTRY(leaf, index, mask)) return SCM_UNBOUND; } while(0)
#define U_REF(tag, mask, box) \
static ScmObj SCM_CPP_CAT(tag,_ref)(Leaf *leaf, u_long index) \
{ \
REF_CHECK(leaf, index, mask); \
return box(ULEAF(leaf)->tag[index&mask]); \
}
#define F16BOX(v) Scm_VMReturnFlonum(Scm_HalfToDouble(v))
#define F32BOX(v) Scm_VMReturnFlonum((double)(v))
U_REF(s8, MASK8, SCM_MAKE_INT)
U_REF(u8, MASK8, SCM_MAKE_INT)
U_REF(s16, MASK16, SCM_MAKE_INT)
U_REF(u16, MASK16, SCM_MAKE_INT)
U_REF(s32, MASK32, Scm_MakeInteger)
U_REF(u32, MASK32, Scm_MakeIntegerU)
U_REF(s64, MASK64, Scm_MakeInteger64)
U_REF(u64, MASK64, Scm_MakeIntegerU64)
U_REF(f16, MASK16, F16BOX)
U_REF(f32, MASK32, F32BOX)
U_REF(f64, MASK64, Scm_VMReturnFlonum)
/*-------------------------------------------------------------------
* Uniform Sparse Vector Set
*/
#define U_SET_INT(elt, mask, getter) \
do { \
ULEAF(leaf)->elt[index&mask] = getter(val, SCM_CLAMP_ERROR, NULL); \
U_SET_CHECK(mask); \
} while(0)
#define U_SET_CHECK(mask) \
do { \
int z = U_HAS_ENTRY(leaf, index, mask); \
U_SET_ENTRY(leaf, index, mask); \
return !z; \
} while (0)
static int s8_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(s8, MASK8, Scm_GetInteger8Clamp);
}
static int u8_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(u8, MASK8, Scm_GetIntegerU8Clamp);
}
static int s16_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(s16, MASK16, Scm_GetInteger16Clamp);
}
static int u16_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(u16, MASK16, Scm_GetIntegerU16Clamp);
}
static int s32_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(s32, MASK32, Scm_GetInteger32Clamp);
}
static int u32_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(u32, MASK32, Scm_GetIntegerU32Clamp);
}
static int s64_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(s64, MASK64, Scm_GetInteger64Clamp);
}
static int u64_set(Leaf *leaf, u_long index, ScmObj val)
{
U_SET_INT(u64, MASK64, Scm_GetIntegerU64Clamp);
}
static int f16_set(Leaf *leaf, u_long index, ScmObj val)
{
ULEAF(leaf)->f16[index&MASK16] = Scm_DoubleToHalf(Scm_GetDouble(val));
U_SET_CHECK(MASK16);
}
static int f32_set(Leaf *leaf, u_long index, ScmObj val)
{
ULEAF(leaf)->f32[index&MASK32] = (float)Scm_GetDouble(val);
U_SET_CHECK(MASK32);
}
static int f64_set(Leaf *leaf, u_long index, ScmObj val)
{
ULEAF(leaf)->f64[index&MASK64] = Scm_GetDouble(val);
U_SET_CHECK(MASK64);
}
/*-------------------------------------------------------------------
* Uniform Sparse Vector Delete
*/
#define U_DEL(ref, mask) \
do { \
ScmObj r = ref(leaf, index); \
if (SCM_UNBOUNDP(r)) return r; \
U_RESET_ENTRY(leaf, index, mask); \
return r; \
} while (0);
static ScmObj s8_delete(Leaf *leaf, u_long index)
{
U_DEL(s8_ref, MASK8);
}
static ScmObj u8_delete(Leaf *leaf, u_long index)
{
U_DEL(u8_ref, MASK8);
}
static ScmObj s16_delete(Leaf *leaf, u_long index)
{
U_DEL(s16_ref, MASK16);
}
static ScmObj u16_delete(Leaf *leaf, u_long index)
{
U_DEL(u16_ref, MASK16);
}
static ScmObj s32_delete(Leaf *leaf, u_long index)
{
U_DEL(s32_ref, MASK32);
}
static ScmObj u32_delete(Leaf *leaf, u_long index)
{
U_DEL(u32_ref, MASK32);
}
static ScmObj s64_delete(Leaf *leaf, u_long index)
{
U_DEL(s64_ref, MASK64);
}
static ScmObj u64_delete(Leaf *leaf, u_long index)
{
U_DEL(u64_ref, MASK64);
}
static ScmObj f16_delete(Leaf *leaf, u_long index)
{
U_DEL(f16_ref, MASK16);
}
static ScmObj f32_delete(Leaf *leaf, u_long index)
{
U_DEL(f32_ref, MASK32);
}
static ScmObj f64_delete(Leaf *leaf, u_long index)
{
U_DEL(f64_ref, MASK64);
}
/*-------------------------------------------------------------------
* Uniform Sparse Vector Iter
*/
static ScmObj u_iter_sub(Leaf *leaf, ScmObj (*ref)(Leaf*, u_long),
int *index, int mask)
{
int i = *index;
for (i++; i<=mask; i++) {
if (U_HAS_ENTRY(leaf, i, mask)) {
*index = i;
return ref(leaf, i);
}
}
*index = i;
return SCM_UNBOUND;
}
#define U_ITER(tag, mask) \
static ScmObj SCM_CPP_CAT(tag,_iter)(Leaf *leaf, int *index) { \
return u_iter_sub(leaf, SCM_CPP_CAT(tag,_ref), index, mask); \
}
U_ITER(s8, MASK8)
U_ITER(u8, MASK8)
U_ITER(s16, MASK16)
U_ITER(u16, MASK16)
U_ITER(s32, MASK32)
U_ITER(u32, MASK32)
U_ITER(s64, MASK64)
U_ITER(u64, MASK64)
U_ITER(f16, MASK16)
U_ITER(f32, MASK32)
U_ITER(f64, MASK64)
/*-------------------------------------------------------------------
* Uniform Sparse Vector Descriptors and constructors
*/
#define U_DECL(tag, TAG, shift) \
static SparseVectorDescriptor SCM_CPP_CAT(tag, _desc) = { \
SCM_CPP_CAT(tag,_ref), \
SCM_CPP_CAT(tag,_set), \
u_allocate, \
SCM_CPP_CAT(tag,_delete), \
u_clear, \
u_copy, \
SCM_CPP_CAT(tag,_iter), \
NULL, shift, \
}; \
SCM_DEFINE_BUILTIN_CLASS(SCM_CPP_CAT3(Scm_Sparse,TAG,VectorClass), \
NULL, NULL, NULL, NULL, spvec_cpl); \
SCM_DEFINE_BUILTIN_CLASS(SCM_CPP_CAT3(Scm_Sparse,TAG,MatrixClass), \
NULL, NULL, NULL, NULL, spmat_cpl)
U_DECL(s8, S8, SHIFT8);
U_DECL(u8, U8, SHIFT8);
U_DECL(s16, S16, SHIFT16);
U_DECL(u16, U16, SHIFT16);
U_DECL(s32, S32, SHIFT32);
U_DECL(u32, U32, SHIFT32);
U_DECL(s64, S64, SHIFT64);
U_DECL(u64, U64, SHIFT64);
U_DECL(f16, F16, SHIFT16);
U_DECL(f32, F32, SHIFT32);
U_DECL(f64, F64, SHIFT64);
/*===================================================================
* Generic constructor
*/
ScmObj MakeSparseVector(ScmClass *klass, ScmObj defaultValue, u_long flags)
{
SparseVectorDescriptor *desc = NULL;
if (SCM_EQ(SCM_CLASS_SPARSE_VECTOR, klass)) desc = &g_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S8VECTOR, klass)) desc = &s8_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U8VECTOR, klass)) desc = &u8_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S16VECTOR, klass)) desc = &s16_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U16VECTOR, klass)) desc = &u16_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S32VECTOR, klass)) desc = &s32_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U32VECTOR, klass)) desc = &u32_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S64VECTOR, klass)) desc = &s64_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U64VECTOR, klass)) desc = &u64_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_F16VECTOR, klass)) desc = &f16_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_F32VECTOR, klass)) desc = &f32_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_F64VECTOR, klass)) desc = &f64_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_MATRIX, klass)) desc = &g_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S8MATRIX, klass)) desc = &s8_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U8MATRIX, klass)) desc = &u8_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S16MATRIX, klass)) desc = &s16_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U16MATRIX, klass)) desc = &u16_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S32MATRIX, klass)) desc = &s32_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U32MATRIX, klass)) desc = &u32_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_S64MATRIX, klass)) desc = &s64_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_U64MATRIX, klass)) desc = &u64_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_F16MATRIX, klass)) desc = &f16_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_F32MATRIX, klass)) desc = &f32_desc;
else if (SCM_EQ(SCM_CLASS_SPARSE_F64MATRIX, klass)) desc = &f64_desc;
else {
Scm_TypeError("class", "subclass of <sparse-vector-base>",
SCM_OBJ(klass));
}
SparseVector *v = SCM_NEW(SparseVector);
SCM_SET_CLASS(v, klass);
CompactTrieInit(&v->trie);
v->numEntries = 0;
v->desc = desc;
v->flags = flags;
v->defaultValue = defaultValue;
return SCM_OBJ(v);
}
/*===================================================================
* Initialization
*/
void Scm_Init_spvec(ScmModule *mod)
{
#define INITC(klass, name) \
Scm_InitStaticClass(&klass, name, mod, NULL, 0)
INITC(Scm_SparseVectorBaseClass, "<sparse-vector-base>");
INITC(Scm_SparseVectorClass, "<sparse-vector>");
INITC(Scm_SparseS8VectorClass, "<sparse-s8vector>");
INITC(Scm_SparseU8VectorClass, "<sparse-u8vector>");
INITC(Scm_SparseS16VectorClass, "<sparse-s16vector>");
INITC(Scm_SparseU16VectorClass, "<sparse-u16vector>");
INITC(Scm_SparseS32VectorClass, "<sparse-s32vector>");
INITC(Scm_SparseU32VectorClass, "<sparse-u32vector>");
INITC(Scm_SparseS64VectorClass, "<sparse-s64vector>");
INITC(Scm_SparseU64VectorClass, "<sparse-u64vector>");
INITC(Scm_SparseF16VectorClass, "<sparse-f16vector>");
INITC(Scm_SparseF32VectorClass, "<sparse-f32vector>");
INITC(Scm_SparseF64VectorClass, "<sparse-f64vector>");
INITC(Scm_SparseMatrixBaseClass, "<sparse-matrix-base>");
INITC(Scm_SparseMatrixClass, "<sparse-matrix>");
INITC(Scm_SparseS8MatrixClass, "<sparse-s8matrix>");
INITC(Scm_SparseU8MatrixClass, "<sparse-u8matrix>");
INITC(Scm_SparseS16MatrixClass, "<sparse-s16matrix>");
INITC(Scm_SparseU16MatrixClass, "<sparse-u16matrix>");
INITC(Scm_SparseS32MatrixClass, "<sparse-s32matrix>");
INITC(Scm_SparseU32MatrixClass, "<sparse-u32matrix>");
INITC(Scm_SparseS64MatrixClass, "<sparse-s64matrix>");
INITC(Scm_SparseU64MatrixClass, "<sparse-u64matrix>");
INITC(Scm_SparseF16MatrixClass, "<sparse-f16matrix>");
INITC(Scm_SparseF32MatrixClass, "<sparse-f32matrix>");
INITC(Scm_SparseF64MatrixClass, "<sparse-f64matrix>");
}
|