예제 #1
0
    QuerySolutionNode* AndSortedNode::clone() const {
        AndSortedNode* copy = new AndSortedNode();
        cloneBaseData(copy);

        copy->_sort = this->_sort;

        return copy;
    }
예제 #2
0
    QuerySolutionNode* SkipNode::clone() const {
        SkipNode* copy = new SkipNode();
        cloneBaseData(copy);

        copy->skip = this->skip;

        return copy;
    }
예제 #3
0
    QuerySolutionNode* FetchNode::clone() const {
        FetchNode* copy = new FetchNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;

        return copy;
    }
예제 #4
0
    QuerySolutionNode* KeepMutationsNode::clone() const {
        KeepMutationsNode* copy = new KeepMutationsNode();
        cloneBaseData(copy);

        copy->sorts = this->sorts;

        return copy;
    }
예제 #5
0
    QuerySolutionNode* LimitNode::clone() const {
        LimitNode* copy = new LimitNode();
        cloneBaseData(copy);

        copy->limit = this->limit;

        return copy;
    }
예제 #6
0
    QuerySolutionNode* OrNode::clone() const {
        OrNode* copy = new OrNode();
        cloneBaseData(copy);

        copy->_sort = this->_sort;
        copy->dedup = this->dedup;

        return copy;
    }
예제 #7
0
BasicSynapticWeight::BasicSynapticWeight( const BasicSynapticWeight& other )
{
	cloneBaseData( other );
	constantDistanceOfSynapticWeightValue = other.constantDistanceOfSynapticWeightValue;
	mutationProbability = other.mutationProbability;
	input = 0.f;
	output = 0.f;
	weight = other.weight->clone();
}
예제 #8
0
    QuerySolutionNode* Geo2DNode::clone() const {
        Geo2DNode* copy = new Geo2DNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;
        copy->indexKeyPattern = this->indexKeyPattern;
        copy->gq = this->gq;

        return copy;
    }
예제 #9
0
    QuerySolutionNode* MergeSortNode::clone() const {
        MergeSortNode* copy = new MergeSortNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;
        copy->dedup = this->dedup;
        copy->sort = this->sort;

        return copy;
    }
예제 #10
0
    QuerySolutionNode* SortNode::clone() const {
        SortNode* copy = new SortNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;
        copy->pattern = this->pattern;
        copy->query = this->query;
        copy->limit = this->limit;

        return copy;
    }
예제 #11
0
    QuerySolutionNode* DistinctNode::clone() const {
        DistinctNode* copy = new DistinctNode();
        cloneBaseData(copy);

        copy->sorts = this->sorts;
        copy->indexKeyPattern = this->indexKeyPattern;
        copy->direction = this->direction;
        copy->bounds = this->bounds;
        copy->fieldNo = this->fieldNo;

        return copy;
    }
예제 #12
0
    QuerySolutionNode* TextNode::clone() const {
        TextNode* copy = new TextNode();
        cloneBaseData(copy);

        copy->_sort = this->_sort;
        copy->indexKeyPattern = this->indexKeyPattern;
        copy->query = this->query;
        copy->language = this->language;
        copy->indexPrefix = this->indexPrefix;

        return copy;
    }
예제 #13
0
    QuerySolutionNode* CollectionScanNode::clone() const {
        CollectionScanNode* copy = new CollectionScanNode();
        cloneBaseData(copy);

        copy->_sort = this->_sort;
        copy->name = this->name;
        copy->tailable = this->tailable;
        copy->direction = this->direction;
        copy->maxScan = this->maxScan;

        return copy;
    }
예제 #14
0
    QuerySolutionNode* CountNode::clone() const {
        CountNode* copy = new CountNode();
        cloneBaseData(copy);

        copy->sorts = this->sorts;
        copy->indexKeyPattern = this->indexKeyPattern;
        copy->startKey = this->startKey;
        copy->startKeyInclusive = this->startKeyInclusive;
        copy->endKey = this->endKey;
        copy->endKeyInclusive = this->endKeyInclusive;

        return copy;
    }
예제 #15
0
    QuerySolutionNode* GeoNear2DSphereNode::clone() const {
        GeoNear2DSphereNode* copy = new GeoNear2DSphereNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;
        copy->nq = this->nq;
        copy->baseBounds = this->baseBounds;
        copy->indexKeyPattern = this->indexKeyPattern;
        copy->addPointMeta = this->addPointMeta;
        copy->addDistMeta = this->addDistMeta;

        return copy;
    }
예제 #16
0
    QuerySolutionNode* ProjectionNode::clone() const {
        ProjectionNode* copy = new ProjectionNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;
        copy->fullExpression = this->fullExpression;

        // This MatchExpression* is owned by the canonical query, not by the
        // ProjectionNode. Just copying the pointer is fine.
        copy->projection = this->projection;

        return copy;
    }
예제 #17
0
    QuerySolutionNode* IndexScanNode::clone() const {
        IndexScanNode* copy = new IndexScanNode();
        cloneBaseData(copy);

        copy->_sorts = this->_sorts;
        copy->indexKeyPattern = this->indexKeyPattern;
        copy->indexIsMultiKey = this->indexIsMultiKey;
        copy->direction = this->direction;
        copy->maxScan = this->maxScan;
        copy->addKeyMetadata = this->addKeyMetadata;
        copy->bounds = this->bounds;

        return copy;
    }
예제 #18
0
TauSynapticWeight::TauSynapticWeight( const TauSynapticWeight& other )
{
	cloneBaseData( other );
	constantDistanceOfSynapticWeightValue = other.constantDistanceOfSynapticWeightValue;
	mutationProbability = other.mutationProbability;
	input = 0.f;
	output = 0.f;
	weight = other.weight->clone();
	maxBufferSize = other.maxBufferSize;
	constantDistanceOfBufferSize = other.constantDistanceOfBufferSize;
	bufferSizeMutationRate = other.bufferSizeMutationRate;
	bufferSize = other.bufferSize;

}
예제 #19
0
 QuerySolutionNode* ShardingFilterNode::clone() const {
     ShardingFilterNode* copy = new ShardingFilterNode();
     cloneBaseData(copy);
     return copy;
 }