data_construction.h

Go to the documentation of this file.

// Author(s): Wieger Wesselink
// Copyright: see the accompanying file COPYING or copy at
// https://github.com/mCRL2org/mCRL2/blob/master/COPYING
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
/// \file mcrl2/data/detail/data_construction.h
/// \brief add your file description here.
 
#ifndef MCRL2_DATA_DETAIL_DATA_CONSTRUCTION_H
#define MCRL2_DATA_DETAIL_DATA_CONSTRUCTION_H
 
#include "mcrl2/data/lambda.h"
#include "mcrl2/data/set.h"
 
namespace mcrl2::data::detail
{
 
/// \brief Create the finite set { x }, with x a data expression.
inline
data_expression create_finite_set(const data_expression& x)
{
  data_expression result = data::sort_fset::empty(x.sort());
  result = data::sort_fset::insert(x.sort(), x, result);
  result = data::sort_set::set_fset(x.sort(), result);
  return result;
}
 
/// \brief Create the set { x | phi }, with phi a predicate that may depend on the variable x.
inline
data_expression create_set_comprehension(const variable& x, const data_expression& phi)
{
  assert(sort_bool::is_bool(phi.sort()));
  data_expression result = sort_set::constructor(x.sort(), lambda(x, phi), sort_fset::empty(x.sort()));
  return result;
}
 
/// \brief Create the predicate 'x in X', with X a set.
inline
data_expression create_set_in(const data_expression& x, const data_expression& X)
{
  data_expression result = sort_set::in(x.sort(), x, X);
  return result;
}
 
/// \brief Returns the sort s of Set(s).
/// \param x A set expression
inline
sort_expression get_set_sort(const container_sort& x)
{
  return x.element_sort();
}
 
} // namespace mcrl2::data::detail
 
#endif // MCRL2_DATA_DETAIL_DATA_CONSTRUCTION_H