C++ (Cpp) findIntervals Examples

Example #1

File: blocktab.cpp Project: gunmetal313/relipmoC

void BlockTab::reduce(void)
{
	number( );
	if ( CFG ) {	
		print( cerr );
		throw EXIT_SUCCESS;
	}
	if ( INTERVALS ) {
		findIntervals( );
		for ( Intervals::iterator i = all.begin( ); 
							i != all.end( ); ++i ) {
			i -> print(cerr ); 
			cerr << endl;
		}
		throw EXIT_SUCCESS;
	}
	do {
		all.resize( 0 );
		findIntervals( );
/* reduce each interval starting from the bottom-most one */
		for ( Intervals::reverse_iterator curI = all.rbegin( );
					curI != all.rend( );  ++curI ) {
			bool r;
			applyT2( );
			if ( r = curI -> findLoops( ) )
				curI -> findLoopType( );

			curI -> findConditionals( );
			applyT2( );
			if ( r )
				curI -> reduceLoop( );
		}
	} while ( all.size( ) > 1 );
}

Example #2

File: genomic_variants.cpp Project: IsmailM/seqan

GenomicInterval PositionMap::getGenomicInterval(int svPos) const
{
    seqan::String<GenomicInterval> intervals;
    findIntervals(intervals, svIntervalTree, svPos);
    SEQAN_ASSERT_EQ(length(intervals), 1u);
    return intervals[0];
}

Example #3

File: PbSolver_convert.C Project: broesdecat/Minisatid

bool PbSolver::convertPbs(bool first_call)
{
    vec<Formula>    converted_constrs;

    if (first_call){
        findIntervals();
        if (!rewriteAlmostClauses()){
            ok = false;
            return false; }
    }

    for (int i = 0; i < constrs.size(); i++){
        if (constrs[i] == NULL) continue;
        Linear& c   = *constrs[i]; assert(c.lo != Int_MIN || c.hi != Int_MAX);

        if (options->opt_verbosity >= 1)
            /**/reportf("---[%4d]---> ", constrs.size() - 1 - i);

        if (options->opt_convert == ct_Sorters) {
            if (options->opt_dump) { // no formulae built
                buildConstraint(c,primesLoader, options);
            } else {
                converted_constrs.push(buildConstraint(c,primesLoader, options));
            }
        }
        else if (options->opt_convert == ct_Adders)
            linearAddition(c, converted_constrs, options->opt_verbosity);
        else if (options->opt_convert == ct_BDDs)
            converted_constrs.push(convertToBdd(c, options->opt_verbosity));
        else if (options->opt_convert == ct_Mixed){
            int adder_cost = estimatedAdderCost(c);
            //**/printf("estimatedAdderCost: %d\n", estimatedAdderCost(c));
            Formula result = convertToBdd(c, options->opt_verbosity, (int)(adder_cost * options->opt_bdd_thres));
            if (result == _undef_)
                result = buildConstraint(c,primesLoader, options, (int)(adder_cost * options->opt_sort_thres));
            if (result == _undef_)
                linearAddition(c, converted_constrs, options->opt_verbosity);
            else
                converted_constrs.push(result);
        }else
            assert(false);

        if (!ok) return false;
    }

    if (!options->opt_validateResoult) cleanPBC();
	
	formulaSize = converted_constrs.size();
	
    clausify(*sat_solver, options, converted_constrs);
    
    if (options->opt_dump) {
        exit(0);
    }

    return ok;
}

Example #4

File: genomic_variants.cpp Project: IsmailM/seqan

// Returns the GenomicInterval on the sequence using a position on the small var reference.
GenomicInterval PositionMap::getGenomicIntervalSmallVarPos(int smallVarPos) const
{
    seqan::String<GenomicInterval> intervals;
    findIntervals(intervals, svIntervalTreeSTL, smallVarPos);
    return intervals[0];
}