| /dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/parasites/avrlib/ |
| H A D | spi.h | 101 static inline void Write(uint8_t v) { in Write()
114 static inline void Send(uint8_t v) { in Send()
136 static inline void Overwrite(uint8_t v) { in Overwrite()
276 static inline void Write(uint8_t v) { in Write()
282 static inline void Send(uint8_t v) { in Send()
293 static inline void Overwrite(uint8_t v) { in Overwrite()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|
| /dports/math/cocoalib/CoCoALib-0.99712/examples/ |
| H A D | ex-SmallFp3.C | 28 RingElem InnerProd_RINGELEM(const vector<RingElem>& u, const vector<RingElem>& v) in InnerProd_RINGELEM()
46 FpElem InnerProd_SLOW(const SmallFpImpl& Fp, const vector<FpElem>& u, const vector<FpElem>& v) in InnerProd_SLOW()
63 FpElem InnerProd_A(const SmallFpImpl& Fp, const vector<FpElem>& u, const vector<FpElem>& v) in InnerProd_A()
83 FpElem InnerProd_B(const SmallFpImpl& Fp, const vector<FpElem>& u, const vector<FpElem>& v) in InnerProd_B()
108 vector<RingElem> v; v.reserve(p*p); in TimeTrialRingElem() local
131 vector<FpElem> v; v.reserve(p*p); in TimeTrialSmallFp() local
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/testsuite/experimental/optional/cons/ |
| H A D | value.cc | 117 std::vector<int> v = { 0, 1, 2, 3, 4, 5 }; in main() local
124 std::vector<int> v = { 0, 1, 2, 3, 4, 5 }; in main() local
131 std::vector<int> v = { 0, 1, 2, 3, 4, 5 }; in main() local
138 std::vector<int> v = { 0, 1, 2, 3, 4, 5 }; in main() local
145 std::vector<int> v = { 0, 1, 2, 3, 4, 5 }; in main() local
152 std::vector<int> v = { 0, 1, 2, 3, 4, 5 }; in main() local
|
| /dports/science/grib_api/grib_api-1.28.0-Source/src/ |
| H A D | grib_accessor_class_long_vector.c | 53 long* v; member
142 long* v; member
151 grib_accessor_abstract_long_vector* v =NULL; in init() local
172 grib_accessor_abstract_long_vector* v =NULL; in unpack_long() local
194 grib_accessor_abstract_long_vector* v =NULL; in unpack_double() local
209 grib_accessor_abstract_long_vector* v =NULL; in pack_long() local
|
| /dports/math/R-cran-expm/expm/tests/ |
| H A D | ex2.R | 89 v <- 100*(n:1) globalVar
111 scl.e.Atv <- function(A, v, s) { argument
120 v <- rep(1,3) globalVar
132 sc.Atv <- function(A,v, s) { argument
136 chk.sc.Atv <- function(A,v, s, tol=1e-15) { argument
156 v <- round(100*rnorm(nrow(S))) globalVar
|
| /dports/games/solarus/solarus-f43727b232b3ed13d98440a845e2a29e470e4f0d/libraries/win32/mingw32/include/glm/gtx/ |
| H A D | vector_query.inl | 111 vecType<T, P> const & v,
123 vecType<T, P> const & v,
135 vecType<T, P> const & v,
147 tvec2<T, P> const & v,
158 tvec3<T, P> const & v,
171 tvec4<T, P> const & v,
|
| /dports/shells/ast-ksh/ast-ksh93v/src/lib/libast/include/ |
| H A D | fs3d.h | 37 #define IVIEW(p,v) ((p)->st_spare1=(v)) argument
41 #define IVIEW(p,v) ((p)->st_spare4[0]=(v)) argument
45 #define IVIEW(p,v) ((p)->st_extra[0]=(v)) argument
49 #define IVIEW(p,v) ((p)->st_pad4[0]=(v)) argument
53 #define IVIEW(p,v) do{if(!S_ISBLK((p)->st_mode)&&!S_ISCHR((p)->st_mode))(p)->st_rdev=(v);}while(0) argument
56 #define IVIEW(p,v) argument
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|
| /dports/lang/gauche/Gauche-0.9.10/gc/include/private/ |
| H A D | gc_atomic_ops.h | 55 # define AO_fetch_and_add(p, v) __atomic_fetch_add(p, v, __ATOMIC_RELAXED) argument
60 # define AO_or(p, v) (void)__atomic_or_fetch(p, v, __ATOMIC_RELAXED) argument
70 # define AO_store(p, v) __atomic_store_n(p, v, __ATOMIC_RELAXED) argument
72 # define AO_store_release(p, v) __atomic_store_n(p, v, __ATOMIC_RELEASE) argument
74 # define AO_store_release_write(p, v) AO_store_release(p, v) argument
79 # define AO_char_store(p, v) __atomic_store_n(p, v, __ATOMIC_RELAXED) argument
|
| /dports/emulators/mame/mame-mame0226/src/devices/sound/ |
| H A D | c140.h | 77 const inline bool ch_looped(C140_VOICE *v) { return BIT(v->mode, 4); } // shared as c140 and c219 in ch_looped()
79 virtual const inline bool ch_mulaw(C140_VOICE *v) { return BIT(v->mode, 3); } in ch_mulaw()
123 virtual const inline bool ch_mulaw(C140_VOICE *v) override { return BIT(v->mode, 0); } in ch_mulaw()
126 const inline bool ch_noise(C140_VOICE *v) { return BIT(v->mode, 2); } in ch_noise()
127 const inline bool ch_inv_lout(C140_VOICE *v) { return BIT(v->mode, 3); } in ch_inv_lout()
128 const inline bool ch_inv_sign(C140_VOICE *v) { return BIT(v->mode, 6); } in ch_inv_sign()
|
| /dports/emulators/mame/mame-mame0226/3rdparty/glm/glm/gtx/ |
| H A D | vector_query.inl | 111 vecType<T, P> const & v,
123 vecType<T, P> const & v,
135 vecType<T, P> const & v,
147 tvec2<T, P> const & v,
158 tvec3<T, P> const & v,
171 tvec4<T, P> const & v,
|
| /dports/math/ogdf/OGDF/src/ogdf/energybased/dtree/ |
| H A D | GalaxyLevel.cpp | 123 for (node v = m_pGraph->firstNode(); v; v = v->succ()) { in buildNextCoarserLevel() local
192 node v = adj->twinNode(); in buildNextCoarserLevel() local
213 for (node v : sunList) { in buildNextCoarserLevel() local
222 for (node v = m_pGraph->firstNode(); v; v = v->succ()) { in buildNextCoarserLevel() local
266 for (node v = m_pGraph->firstNode(); v; v = v->succ()) { in removeParEdgesWithWeight() local
344 void GalaxyLevel::setWeight(node v, double weight) in setWeight()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/calendar/libical/src/libical/ |
| H A D | icalparameter.c | 59 struct icalparameter_impl* v; in icalparameter_new_impl() local
82 struct icalparameter_impl* v = icalparameter_new_impl(kind); in icalparameter_new() local
330 icalparameter_set_xname (icalparameter* param, const char* v) in icalparameter_set_xname()
356 icalparameter_set_xvalue (icalparameter* param, const char* v) in icalparameter_set_xvalue()
381 void icalparameter_set_iana_value (icalparameter* param, const char* v) in icalparameter_set_iana_value()
391 void icalparameter_set_iana_name (icalparameter* param, const char* v) in icalparameter_set_iana_name()
|
| /dports/science/cantera/cantera-2.5.1-611-gc4d6ecc15/ext/sundials/include/nvector/ |
| H A D | nvector_pthreads.h | 109 #define NV_CONTENT_PT(v) ( (N_VectorContent_Pthreads)(v->content) ) argument
111 #define NV_LENGTH_PT(v) ( NV_CONTENT_PT(v)->length ) argument
113 #define NV_NUM_THREADS_PT(v) ( NV_CONTENT_PT(v)->num_threads ) argument
115 #define NV_OWN_DATA_PT(v) ( NV_CONTENT_PT(v)->own_data ) argument
117 #define NV_DATA_PT(v) ( NV_CONTENT_PT(v)->data ) argument
119 #define NV_Ith_PT(v,i) ( NV_DATA_PT(v)[i] ) argument
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|
| /dports/graphics/vips/vips-8.12.0/libvips/deprecated/ |
| H A D | matalloc.c | 59 int *v; in im_ivector() local
70 float *v; in im_fvector() local
81 double *v; in im_dvector() local
90 void im_free_ivector(int *v, int nl, int nh) in im_free_ivector()
95 void im_free_fvector(float *v, int nl, int nh) in im_free_fvector()
100 void im_free_dvector(double *v, int nl, int nh) in im_free_dvector()
|
| /dports/science/eccodes/eccodes-2.23.0-Source/src/ |
| H A D | grib_accessor_class_long_vector.c | 54 long* v; member
150 long* v; member
159 grib_accessor_abstract_long_vector* v = NULL; in init() local
181 grib_accessor_abstract_long_vector* v = NULL; in unpack_long() local
206 grib_accessor_abstract_long_vector* v = NULL; in unpack_double() local
222 grib_accessor_abstract_long_vector* v = NULL; in pack_long() local
|
| /dports/emulators/qemu42/qemu-4.2.1/roms/u-boot-sam460ex/arch/sparc/include/asm/ |
| H A D | io.h | 55 #define __arch_putb(v,a) (*(volatile unsigned char *)(a) = (v)) argument
56 #define __arch_putw(v,a) (*(volatile unsigned short *)(a) = (v)) argument
57 #define __arch_putl(v,a) (*(volatile unsigned int *)(a) = (v)) argument
59 #define __raw_writeb(v,a) __arch_putb(v,a) argument
60 #define __raw_writew(v,a) __arch_putw(v,a) argument
61 #define __raw_writel(v,a) __arch_putl(v,a) argument
|
| /dports/editors/calligra/calligra-3.2.1/libs/widgetutils/ |
| H A D | KoProperties.cpp | 74 QVariant v; in load() local
101 QVariant v = it.value(); in save() local
148 const QVariant v = property(name); in intProperty() local
158 const QVariant v = property(name); in doubleProperty() local
167 const QVariant v = property(name); in boolProperty() local
176 const QVariant v = property(name); in stringProperty() local
|
| /dports/lang/spidermonkey60/firefox-60.9.0/mfbt/tests/ |
| H A D | TestVariant.cpp | 239 Variant<uint32_t, uint64_t> v(uint64_t(1)); in testSimple() local
255 Variant<uint32_t, uint64_t, uint32_t> v(uint64_t(1)); in testDuplicate() local
276 Variant<uint32_t, uint64_t, uint32_t> v(mozilla::VariantType<uint64_t>{}, 3); in testConstructionWithVariantType() local
285 Variant<uint32_t, uint64_t, uint32_t> v(mozilla::VariantIndex<2>{}, 2); in testConstructionWithVariantIndex() local
349 Variant<char, UniquePtr<char[]>, Destroyer> v(d); in testDestructor() local
434 V v(uint8_t(1)); in testRvalueMatcher() local
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | clustering_coefficient.hpp | 42 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
56 typename graph_traits<Graph>::vertex_descriptor v, in count_edges()
66 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
83 num_triangles_on_vertex(const Graph& g, Vertex v) in num_triangles_on_vertex()
106 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
116 clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
|