Esempio n. 1
0
sequence<T> adjoint( sequence<T> X )
{
	int t1 = X.t1();
	int t2 = X.t2();
	for( int t = t1; t <= t2; t++ )
		X(t) = adjoint(X(t));
	return X.timereverse();
}
Esempio n. 2
0
complex inner_prod(const sequence<T> &X, const sequence<T> &Y )
{
	// If any vector is empty
	if( X.size() == 0 || Y.size() == 0 )
		return 0;

	// Overlapping interval
	int	ta  = max(X.t1(),Y.t1());
	int	tb  = min(X.t2(),Y.t2());

	// If they do not overlap
	if( ta > tb )
		return 0;

	// They do overlap
	complex r = 0;
	for( int t = ta; t <= tb; t++ )
		r += inner_prod( X(t), Y(t) );
	return r;
}
Esempio n. 3
0
sequence<decltype(T()*S())> element_prod( const sequence<T>& X, const sequence<S>& Y )
{
	typedef decltype(T()*S()) R;

	// If any vector is empty
	if( X.size() == 0 || Y.size() == 0 )
		return sequence<R>();

	// Overlapping interval
	int	ta  = max(X.t1(),Y.t1());
	int	tb  = min(X.t2(),Y.t2());

	// If they do not overlap
	if( ta > tb )
		return sequence<R>();

	// They do overlap
	vec<R> v = element_prod(
			X.buffer()( range( ta-X.t1(), tb-X.t1()+1 ) ),
			Y.buffer()( range( ta-Y.t1(), tb-Y.t1()+1 ) ) );
	return sequence<R>( v, ta );
}
Esempio n. 4
0
sequence<R> operator+( sequence<T1> X, sequence<T2> Y )
{
	if( X.size() == 0 )
		return Y;
	if( Y.size() == 0 )
		return X;

	// Intervals
	int	t1  = min(X.t1(),Y.t1());
	int	ta  = max(X.t1(),Y.t1());
	int	tb  = min(X.t2(),Y.t2());
	int	t2  = max(X.t2(),Y.t2());
	int sx  = X.size();
	int sy  = Y.size();

	// First interval
	vec<R> v1(0);
	if( t1 == X.t1() && t1 != Y.t1() )
		v1 = X.buffer()( range( 0, min(ta-X.t1(),sx) ) );
	else if( t1 != X.t1() && t1 == Y.t1() )
		v1 = Y.buffer()( range( 0, min(ta-Y.t1(),sy) ) );

	// Second interval
	vec<R> v2;
	if( ta <= tb )
		v2 = X.buffer()( range( ta-X.t1(), tb-X.t1()+1 ) ) + Y.buffer()( range( ta-Y.t1(), tb-Y.t1()+1 ) );
	else {
		int I = ta-tb-1;
		v2.resize(I);
		for( int i = 0; i < I; i++ )
			v2(i) = 0*X.buffer()(0);
	}

	// Third interval
	vec<R> v3(0);
	if( t2 == X.t2() && t2 != Y.t2() )
		v3 = X.buffer()( range( max(tb-X.t1()+1,0), X.size() ) );
	else if( t2 != X.t2() && t2 == Y.t2() )
		v3 = Y.buffer()( range( max(tb-Y.t1()+1,0), Y.size() ) );

	// Sum
	return sequence<R>( vec<R>{v1,v2,v3}, t1 );
}