Package org.apache.clerezza.rdf.core.test

Source Code of org.apache.clerezza.rdf.core.test.RandomMGraph

/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements.  See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership.  The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License.  You may obtain a copy of the License at
*
*   http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied.  See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.apache.clerezza.rdf.core.test;

import java.util.Iterator;
import java.util.UUID;
import org.apache.clerezza.rdf.core.BNode;
import org.apache.clerezza.rdf.core.MGraph;
import org.apache.clerezza.rdf.core.NonLiteral;
import org.apache.clerezza.rdf.core.Resource;
import org.apache.clerezza.rdf.core.Triple;
import org.apache.clerezza.rdf.core.UriRef;
import org.apache.clerezza.rdf.core.impl.PlainLiteralImpl;
import org.apache.clerezza.rdf.core.impl.TripleImpl;
import org.apache.commons.lang.RandomStringUtils;

/**
* A <code>MGraph</code> wrapper that allows growing and shrinking of
* the wrapped mgraph.
*
* @author mir
*/
public class RandomMGraph extends MGraphWrapper {
   
    private int interconnectivity = 2;

    public RandomMGraph(MGraph mGraph, int interconnectivity) {
        super(mGraph);
        this.interconnectivity = interconnectivity;
    }

    /**
     * Creates a new random mutual graph.
     *
     * @param initialSize Determines the initial size of the content graph
     * @param interconnectivity Determines the probability of using already existing
     *        resource when creating a new triple. The probability of using an existing
     *        resource over creating a new resouce is 1-(1/interconnectivity).
     * @param mGraph
     */
    public RandomMGraph(int initialSize, int interconnectivity, MGraph mGraph) {
        super(mGraph);
        if (interconnectivity <= 0) {
            throw new IllegalArgumentException("growth speed and the interconnectivity "
                    + "value have to be equals or highter one");
        }
        this.interconnectivity = interconnectivity;

        setupInitialSize(initialSize);
    }

    /**
     * Add or removes randomly a triple.
     *
     * @return the triple that was added or removed.
     */
    public Triple evolve() {
        Triple triple;
        int random = rollDice(2);
        if (random == 0 && size() != 0) {
            triple = getRandomTriple();
            remove(triple);
        } else {
            triple = createRandomTriple();
            add(triple);
        }
        return triple;
    }

    /**
     * Removes a random triple.
     *
     * @return the triple that was removed.
     */
    public Triple removeRandomTriple() {
        Triple randomTriple = getRandomTriple();
        remove(randomTriple);
        return randomTriple;
    }

    /**
     * Adds a random triple.
     *
     * @return the triple that was added.
     */
    public Triple addRandomTriple() {
        Triple randomTriple;
        do {
         randomTriple = createRandomTriple();
        } while(contains(randomTriple));
       
        add(randomTriple);
        return randomTriple;
    }
   
    private Triple createRandomTriple() {
        return new TripleImpl(getSubject(), getPredicate(), getObject());
    }

    private NonLiteral getSubject() {
        int random = rollDice(interconnectivity);
        if (size() == 0) {
            random = 0;
        }
        switch (random) {
            case 0: // create new NonLiteral
                Resource newResource;
                do {
                    newResource = createRandomResource();
                } while (!(newResource instanceof NonLiteral));
                return (NonLiteral) newResource;
            default: // get existing NonLiteral
                Resource existingResource;
                do {
                    existingResource = getExistingResource();
                    if (existingResource == null) {
                        random = 0;
                    }
                } while (!(existingResource instanceof NonLiteral));

                return (NonLiteral) existingResource;
        }
    }

    private UriRef getPredicate() {
        int random = rollDice(interconnectivity);
        if (size() == 0) {
            random = 0;
        }
        switch (random) {
            case 0: // create new UriRef
                return createRandomUriRef();
            default: // get existing UriRef
                Resource existingResource;
                do {
                    existingResource = getExistingResource();
                    if (existingResource == null) {
                        random = 0;
                    }
                } while (!(existingResource instanceof UriRef));
                return (UriRef) existingResource;
        }
    }

    private Resource getObject() {
        int random = rollDice(interconnectivity);
        if (size() == 0) {
            random = 0;
        }       
        switch (random) {
            case 0: // create new resource
                return createRandomResource();
            default: // get existing resource
                Resource existingResource = getExistingResource();
                if (existingResource == null) {
                    random = 0;
                }
                return existingResource;
        }
    }

    private static int rollDice(int faces) {
        return Double.valueOf(Math.random() * faces).intValue();
    }

    private Resource createRandomResource() {
        switch (rollDice(3)) {
            case 0:
                return new BNode();
            case 1:
                return createRandomUriRef();
            case 2:
                return new PlainLiteralImpl(RandomStringUtils.random(rollDice(100) + 1));
        }
        throw new RuntimeException("in createRandomResource()");
    }

    private Resource getExistingResource() {
        Triple triple = getRandomTriple();
        if (triple == null) {
            return null;
        }
        switch (rollDice(3)) {
            case 0:
                return triple.getSubject();
            case 1:
                return triple.getPredicate();
            case 2:
                return triple.getObject();
        }
        return null;
    }

    private UriRef createRandomUriRef() {
        return new UriRef("http://" + UUID.randomUUID().toString());
    }

    /**
     * Returns a random triple contained in the MGraph.
     */
    public Triple getRandomTriple() {
        int size = this.size();
        if (size == 0) {
            return null;
        }
        Iterator<Triple> triples = iterator();
        while (triples.hasNext()) {
            Triple triple = triples.next();
            if (rollDice(this.size()) == 0) {
                return triple;
            }
        }
        return getRandomTriple();
    }

    private void setupInitialSize(int initialSize) {
        for (int i = 0; i < initialSize; i++) {
            addRandomTriple();
        }
    }
}
TOP

Related Classes of org.apache.clerezza.rdf.core.test.RandomMGraph

TOP
Copyright © 2018 www.massapi.com. 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.