blob: 45c8018f91b3dd1f2b4b13b875c076f8ad681f06 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
/* -*- C++ -*- */
//=============================================================================
/**
* @file BCU.h
*
* $Id$
*
* @author David Levine and Tim Harrison (harrison@cs.wustl.edu)
*
*
* Times how long it takes to generate each of the first N prime
* numbers.
*
*/
//=============================================================================
#ifndef ACE_BCU_H
#define ACE_BCU_H
#include /**/ "ace/pre.h"
#include "ace/os_include/os_stdint.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "old_event_export.h"
// Check if a specific, hardcoded number is prime (via ACE::is_prime) <n>
// times.
TAO_RTOLDEvent_Export u_long ACE_BCU (u_long n);
// Check if <number> is prime (via ACE::is_prime ()) <n> times.
TAO_RTOLDEvent_Export u_long ACE_BCU (u_long number, u_long n);
#include /**/ "ace/post.h"
#endif /* ACE_BCU_H */
|
