| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 144 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
189 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
245 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
355 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
606 if (num_vertices(iG) != num_vertices(vG)) in two_graphs_common_spanning_trees()
627 boost::tuples::tie(current, last) = edges(iG); in two_graphs_common_spanning_trees()
670 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
712 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
758 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
803 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 144 int edges = num_vertices(iG) - 1;
189 make_filtered_graph(iG,
245 make_filtered_graph(iG,
355 make_filtered_graph(iG,
606 if (num_vertices(iG) != num_vertices(vG))
627 boost::tuples::tie(current, last) = edges(iG);
670 undirected_dfs(iG, iG_vis,
712 make_filtered_graph(iG,
758 make_filtered_graph(iG,
803 make_filtered_graph(iG,
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 152 const Graph& iG, in rec_two_graphs_common_spanning_trees() argument
177 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
218 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
577 const Graph& iG, in two_graphs_common_spanning_trees() argument
611 if(inL.size() != num_edges(iG) in two_graphs_common_spanning_trees()
615 if(iG_map.size() != num_edges(iG) in two_graphs_common_spanning_trees()
680 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
718 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
759 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
797 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | two_graphs_common_spanning_trees.hpp | 144 int edges = num_vertices(iG) - 1; in rec_two_graphs_common_spanning_trees()
189 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
245 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
355 make_filtered_graph(iG, in rec_two_graphs_common_spanning_trees()
606 if (num_vertices(iG) != num_vertices(vG)) in two_graphs_common_spanning_trees()
627 boost::tuples::tie(current, last) = edges(iG); in two_graphs_common_spanning_trees()
670 undirected_dfs(iG, iG_vis, in two_graphs_common_spanning_trees()
712 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
758 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
803 make_filtered_graph(iG, in two_graphs_common_spanning_trees()
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/tlslite/tlslite/utils/ |
| H A D | rijndael.py | 133 iG = [[0] * 4 for i in range(4)] variable
137 iG[i][j] = AA[i][j + 4]
170 T5.append(mul4(s, iG[0]))
171 T6.append(mul4(s, iG[1]))
172 T7.append(mul4(s, iG[2]))
173 T8.append(mul4(s, iG[3]))
175 U1.append(mul4(t, iG[0]))
176 U2.append(mul4(t, iG[1]))
177 U3.append(mul4(t, iG[2]))
178 U4.append(mul4(t, iG[3]))
[all …]
|
| /dports/security/py-tlslite/tlslite-0.4.9/tlslite/utils/ |
| H A D | rijndael.py | 133 iG = [[0] * 4 for i in range(4)] variable
137 iG[i][j] = AA[i][j + 4]
170 T5.append(mul4(s, iG[0]))
171 T6.append(mul4(s, iG[1]))
172 T7.append(mul4(s, iG[2]))
173 T8.append(mul4(s, iG[3]))
175 U1.append(mul4(t, iG[0]))
176 U2.append(mul4(t, iG[1]))
177 U3.append(mul4(t, iG[2]))
178 U4.append(mul4(t, iG[3]))
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/tlslite/tlslite/utils/ |
| H A D | rijndael.py | 133 iG = [[0] * 4 for i in range(4)] variable
137 iG[i][j] = AA[i][j + 4]
170 T5.append(mul4(s, iG[0]))
171 T6.append(mul4(s, iG[1]))
172 T7.append(mul4(s, iG[2]))
173 T8.append(mul4(s, iG[3]))
175 U1.append(mul4(t, iG[0]))
176 U2.append(mul4(t, iG[1]))
177 U3.append(mul4(t, iG[2]))
178 U4.append(mul4(t, iG[3]))
[all …]
|
| /dports/multimedia/Bento4/Bento4-1.6.0-639/Source/Python/utils/ |
| H A D | aes.py | 99 iG = [[0] * 4 for i in range(4)] variable
103 iG[i][j] = AA[i][j + 4]
136 T5.append(mul4(s, iG[0]))
137 T6.append(mul4(s, iG[1]))
138 T7.append(mul4(s, iG[2]))
139 T8.append(mul4(s, iG[3]))
141 U1.append(mul4(t, iG[0]))
142 U2.append(mul4(t, iG[1]))
143 U3.append(mul4(t, iG[2]))
144 U4.append(mul4(t, iG[3]))
[all …]
|
| /dports/science/jdftx/jdftx-1.6.0/jdftx/electronic/ |
| H A D | SCF.cpp | 49 { vector3<int> iG; in SCF() local
50 for(iG[0]=-1; iG[0]<=1; iG[0]++) in SCF()
51 for(iG[1]=-1; iG[1]<=1; iG[1]++) in SCF()
52 for(iG[2]=-1; iG[2]<=1; iG[2]++) in SCF()
53 if(iG.length_squared()) //except G==0 in SCF()
54 GminSq = std::min(GminSq, e.gInfo.GGT.metric_length_squared(iG)); in SCF()
|
| /dports/math/jacop/jacop-4.8.0/src/main/scala/org/jacop/examples/scala/ |
| H A D | Conference.scala | 60 val iG = 6; constant
78 sessions(iF) #\= sessions(iG)
87 alldifferent(for (i <- Array(iB, iG, iH, iI)) yield sessions(i))
93 alldifferent(for (i <- Array(iA, iE, iG)) yield sessions(i))
|
| /dports/math/gretl/gretl-2021d/addons/SVAR/examples/SignRestrictions/ |
| H A D | spaghetti_plot.inp | 14 iG = inv(Gamma)
16 Y = U * iG'
23 eval iG*iG'
|
| H A D | supply_demand.inp | 14 iG = inv(Gamma)
16 Y = U * iG'
23 eval iG*iG'
|
| /dports/science/qmcpack/qmcpack-3.11.0/src/QMCWaveFunctions/ |
| H A D | einspline_helper.hpp | 46 for (int iG = 0; iG < cG.size(); iG++) in unpack4fftw() local
48 …if (gvecs[iG][0] > upper_bound[0] || gvecs[iG][0] < lower_bound[0] || gvecs[iG][1] > upper_bound[1… in unpack4fftw()
49 … gvecs[iG][1] < lower_bound[1] || gvecs[iG][2] > upper_bound[2] || gvecs[iG][2] < lower_bound[2]) in unpack4fftw()
57 …fftbox((gvecs[iG][0] + maxg[0]) % maxg[0], (gvecs[iG][1] + maxg[1]) % maxg[1], (gvecs[iG][2] + max… in unpack4fftw()
58 cG[iG]; in unpack4fftw()
|
| /dports/games/corsix-th/CorsixTH-0.65.1/CorsixTH/Src/ |
| H A D | th_lua_ui.cpp | 97 uint8_t iG = 0; in l_town_map_draw() local
105 iG = range_scale(minOkTemp, maxOkTemp - 1, iTemp, 140, 224); in l_town_map_draw()
113 iG = range_scale(0, minOkTemp - 1, iTemp, 80, 180); in l_town_map_draw()
116 iG = range_scale(minOkTemp, 255, iTemp, 184, 104); in l_town_map_draw()
126 iColour = render_target::map_colour(iR, iG, iB); in l_town_map_draw()
|
| /dports/devel/hub/hub-2.14.2/utils/ |
| H A D | color.go | 87 for iG := 0; iG < 6; iG++ {
91 x6colorIndexes[iG],
|