Package com.coyotegulch.jisp

Examples of com.coyotegulch.jisp.IndexedObjectDatabase

99
100
101
102
103
104
105
106
107
108
109
                m_Index = new BTreeIndex(indexFile.toString(),
                                         order, super.getNullKey(), false);
            } else {
                m_Index = new BTreeIndex(indexFile.toString());
            }
            m_Database = new IndexedObjectDatabase(databaseFile.toString(), !isOld);
            m_Database.attachIndex(m_Index);
        }
        catch (KeyNotFound ignore)
        {
        }
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
        try {
            final boolean databaseExists = databaseFile.exists();
            if (getLogger().isDebugEnabled()) {
                getLogger().debug("Datafile exists: " + databaseExists);
            }
            super.m_Database = new IndexedObjectDatabase(databaseFile.toString(),
                                                         !databaseExists);

            if (!databaseExists) {
                // Create new index
                super.m_Index = new BTreeIndex(indexFile.toString(),
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
        try {
            if (databaseFile.exists()) {
                if (getLogger().isDebugEnabled()) {
                    this.getLogger().debug("initialize(): Datafile exists");
                }
                mDatabase = new IndexedObjectDatabase(databaseFile.toString(), false);
                mIndex = new BTreeIndex(indexFile.toString());
                mDatabase.attachIndex(mIndex);
            } else {
                if (getLogger().isDebugEnabled()) {
                    this.getLogger().debug("initialize(): Datafile does not exist");
                }
                mDatabase = new IndexedObjectDatabase(databaseFile.toString(), false);
                mIndex = new BTreeIndex(indexFile.toString(),
                                        mOrder, new JispStringKey(), false);
                mDatabase.attachIndex(mIndex);
            }
        } catch (KeyNotFound ignore) {
View Full Code Here
554
555
556
557
558
559
560
561
562
563
564
        try {
            if (db.exists()) {
                db.delete();
            }
            m_database = new IndexedObjectDatabase(
                    m_databaseUrl, CREATE, m_loader);

            final List indexes = createBtreeIndexes(btreeIndexes);
            for (Iterator it = indexes.iterator(); it.hasNext();) {
                m_database.attachIndex((BTreeIndex)it.next());
View Full Code Here
576
577
578
579
580
581
582
583
584
585
586
     */
    protected void loadDatabase(final List btreeIndexes) {
        if (btreeIndexes == null) throw new IllegalArgumentException("index definition can not be null");

        try {
            m_database = new IndexedObjectDatabase(m_databaseUrl, LOAD, m_loader);

            final List indexes = loadBtreeIndexes(btreeIndexes);
            for (Iterator it = indexes.iterator(); it.hasNext();) {
                m_database.attachIndex((BTreeIndex)it.next());
            }
View Full Code Here
554
555
556
557
558
559
560
561
562
563
564
        try {
            if (db.exists()) {
                db.delete();
            }
            m_database = new IndexedObjectDatabase(
                    m_databaseUrl, CREATE, m_loader);

            final List indexes = createBtreeIndexes(btreeIndexes);
            for (Iterator it = indexes.iterator(); it.hasNext();) {
                m_database.attachIndex((BTreeIndex)it.next());
View Full Code Here
576
577
578
579
580
581
582
583
584
585
586
     */
    protected void loadDatabase(final List btreeIndexes) {
        if (btreeIndexes == null) throw new IllegalArgumentException("index definition can not be null");

        try {
            m_database = new IndexedObjectDatabase(m_databaseUrl, LOAD, m_loader);

            final List indexes = loadBtreeIndexes(btreeIndexes);
            for (Iterator it = indexes.iterator(); it.hasNext();) {
                m_database.attachIndex((BTreeIndex)it.next());
            }
View Full Code Here
554
555
556
557
558
559
560
561
562
563
564
        try {
            if (db.exists()) {
                db.delete();
            }
            m_database = new IndexedObjectDatabase(
                    m_databaseUrl, CREATE, m_loader);

            final List indexes = createBtreeIndexes(btreeIndexes);
            for (Iterator it = indexes.iterator(); it.hasNext();) {
                m_database.attachIndex((BTreeIndex)it.next());
View Full Code Here
576
577
578
579
580
581
582
583
584
585
586
     */
    protected void loadDatabase(final List btreeIndexes) {
        if (btreeIndexes == null) throw new IllegalArgumentException("index definition can not be null");

        try {
            m_database = new IndexedObjectDatabase(m_databaseUrl, LOAD, m_loader);

            final List indexes = loadBtreeIndexes(btreeIndexes);
            for (Iterator it = indexes.iterator(); it.hasNext();) {
                m_database.attachIndex((BTreeIndex)it.next());
            }
View Full Code Here
TOP

Related Classes of com.coyotegulch.jisp.IndexedObjectDatabase

  • org.apache.cocoon.components.store.impl.DefaultPersistentStore
  • org.apache.cocoon.components.store.impl.DefaultStore
  • org.apache.cocoon.components.store.JispFilesystemStore
  • org.apache.cocoon.jispstore.JispFilesystemStore
  • org.apache.excalibur.store.impl.JispFilesystemStore
  • org.apache.jcs.auxiliary.disk.jisp.JISPCache
  • org.apache.stratum.jcs.auxiliary.disk.jisp.JISPCache
  • org.codehaus.aspectwerkz.extension.persistence.jisp.JispPersistenceManager
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.