| 1234567891011121314151617181920212223242526272829 |
- # Copyright (C) 2006 Douglas Gregor <doug.gregor -at- gmail.com>.
- # Use, modification and distribution is subject to 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)
- # Test scan() collective.
- import boost.parallel.mpi as mpi
- from generators import *
- def scan_test(comm, generator, kind, op, op_kind):
- if comm.rank == 0:
- print ("Prefix reduction to %s of %s..." % (op_kind, kind)),
- my_value = generator(comm.rank)
- result = mpi.scan(comm, my_value, op)
- expected_result = generator(0);
- for p in range(1, comm.rank+1):
- expected_result = op(expected_result, generator(p))
-
- assert result == expected_result
- if comm.rank == 0:
- print "OK."
- return
- scan_test(mpi.world, int_generator, "integers", lambda x,y:x + y, "sum")
- scan_test(mpi.world, int_generator, "integers", lambda x,y:x * y, "product")
- scan_test(mpi.world, string_generator, "strings", lambda x,y:x + y, "concatenation")
- scan_test(mpi.world, string_list_generator, "list of strings", lambda x,y:x + y, "concatenation")
|
