首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 最简单的可查询的对象存储可能。

最简单的可查询的对象存储可能。

  • 资源大小:114.63 kB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:0次
  • 资源积分:1积分
  • 标      签: java

资 源 简 介

Minimalist queryable object cache - that can also be used to persist objects **Background** This work was based on a test framework for a kd-tree. I was using interfaces provided here to create unit tests for the kd-tree. It turned out everything was easier and quicker using this rather than the kd-tree. **Usage** Unable to introduce H2 (or similar) or Google Collections into the stack trace? Faced with having to create a virtual database of your own with Maps and Sets? Born out of a need for a relatively typesafe collection to dice and slice <100k objects I ended up writing this library for use against a JDBC Datasource. However, it"s greatest use is with an in-memory DB such as H2. With the aid of a quick in-memory database like H2 or HSQL we can do relational set base queries rather than faffing around with a goat pile of iterators, loops, if-else statements and nested comparators :) Provides the ability to query (

文 件 列 表

trunk
.classpath
.svn
all-wcprops
bin
example
domain
objects
Colour.class
main
test
VIP VIP
0.195333s