| /dports/net-mgmt/net-snmp/net-snmp-5.9/agent/mibgroup/Rmon/ |
| H A D | event.c | 505 create_explanaition(CRTL_ENTRY_T * evptr, u_char is_rising, in create_explanaition()
559 event_send_trap(CRTL_ENTRY_T * evptr, u_char is_rising, in event_send_trap()
650 event_api_send_alarm(u_char is_rising, in event_api_send_alarm()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/math/example/ |
| H A D | root_finding_start_locations.cpp | 47 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
177 …bool is_rising = true; // arc-length increases if one radii increases, so function is… in elliptic_root_noderiv() local
|
| H A D | root_finding_fifth.cpp | 188 bool is_rising = true; // So if result if guess^5 is too low, try increasing guess. in fifth_noderiv() local
|
| H A D | root_finding_example.cpp | 131 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
|
| H A D | root_finding_algorithms.cpp | 222 bool is_rising = true; // So if result if guess^3 is too low, then try increasing guess. in cbrt_noderiv() local
|
| H A D | root_n_finding_algorithms.cpp | 211 bool is_rising = true; // So if result if guess^3 is too low, then try increasing guess. in nth_root_noderiv() local
|
| /dports/devel/boost-docs/boost_1_72_0/libs/math/example/ |
| H A D | root_finding_start_locations.cpp | 47 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
177 …bool is_rising = true; // arc-length increases if one radii increases, so function is… in elliptic_root_noderiv() local
|
| H A D | root_finding_fifth.cpp | 188 bool is_rising = true; // So if result if guess^5 is too low, try increasing guess. in fifth_noderiv() local
|
| H A D | root_finding_example.cpp | 131 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
|
| H A D | root_finding_algorithms.cpp | 222 bool is_rising = true; // So if result if guess^3 is too low, then try increasing guess. in cbrt_noderiv() local
|
| H A D | root_n_finding_algorithms.cpp | 211 bool is_rising = true; // So if result if guess^3 is too low, then try increasing guess. in nth_root_noderiv() local
|
| /dports/devel/boost-libs/boost_1_72_0/libs/math/example/ |
| H A D | root_finding_start_locations.cpp | 47 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
177 …bool is_rising = true; // arc-length increases if one radii increases, so function is… in elliptic_root_noderiv() local
|
| H A D | root_finding_fifth.cpp | 188 bool is_rising = true; // So if result if guess^5 is too low, try increasing guess. in fifth_noderiv() local
|
| H A D | root_finding_example.cpp | 131 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
|
| H A D | root_finding_algorithms.cpp | 222 bool is_rising = true; // So if result if guess^3 is too low, then try increasing guess. in cbrt_noderiv() local
|
| /dports/devel/hyperscan/boost_1_75_0/libs/math/example/ |
| H A D | root_finding_start_locations.cpp | 47 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
177 …bool is_rising = true; // arc-length increases if one radii increases, so function is… in elliptic_root_noderiv() local
|
| H A D | root_finding_fifth.cpp | 188 bool is_rising = true; // So if result if guess^5 is too low, try increasing guess. in fifth_noderiv() local
|
| H A D | root_finding_example.cpp | 132 …bool is_rising = true; // So if result if guess^3 is too low, then try incr… in cbrt_noderiv() local
|
| H A D | root_finding_algorithms.cpp | 222 bool is_rising = true; // So if result if guess^3 is too low, then try increasing guess. in cbrt_noderiv() local
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/math/example/ |
| H A D | root_finding_example.cpp | 130 bool is_rising = true; // So if result if guess^3 is too low, try increasing guess. in cbrt_1() local
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/math/example/ |
| H A D | root_finding_example.cpp | 130 bool is_rising = true; // So if result if guess^3 is too low, try increasing guess. in cbrt_1() local
|
| /dports/databases/percona57-server/boost_1_59_0/libs/math/example/ |
| H A D | root_finding_example.cpp | 130 bool is_rising = true; // So if result if guess^3 is too low, try increasing guess. in cbrt_1() local
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/math/example/ |
| H A D | root_finding_example.cpp | 130 bool is_rising = true; // So if result if guess^3 is too low, try increasing guess. in cbrt_1() local
|
| /dports/databases/percona57-client/boost_1_59_0/libs/math/example/ |
| H A D | root_finding_example.cpp | 130 bool is_rising = true; // So if result if guess^3 is too low, try increasing guess. in cbrt_1() local
|
| /dports/cad/gnucap/gnucap-2013-04-23/include/ |
| H A D | e_node.h | 76 bool is_rising() const {return _lv == lvRISING;} in is_rising() function
|