/*
 * Copyright (c) 1999 Johnny C. Lam.
 * All rights reserved.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  The author makes no representations
 * about the suitability of this software for any purpose.  It is
 * provided "as is" without express or implied warranty.
 */

// -*- C++ -*-

#ifndef LATENT_RECOMB_STRATEGY_H_INCLUDED
#define LATENT_RECOMB_STRATEGY_H_INCLUDED

#ifndef PATH_STRATEGY_H_INCLUDED
#include "path_strategy.h"
#endif

///////////////////////////////////////////////////////////////////////////
//
// LatentRecombStrategy
//
///////////////////////////////////////////////////////////////////////////

class LatentRecombStrategy : public PathStrategy {
public:
    ~LatentRecombStrategy();
    LatentRecombStrategy(unsigned int, bool = false);

    Path MakePath(const Haplotype&, const Haplotype&, size_type,
		  Probability*) const;

private:
    unsigned int _max_latents;
};

#include "latent_recomb_strategy_inline.h"

#endif /* LATENT_RECOMB_STRATEGY_H_INCLUDED */
