COMPAS 2.1.1__py3-none-any.whl

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (468) hide show
  1. compas/__init__.py +274 -0
  2. compas/__main__.py +31 -0
  3. compas/_iotools.py +80 -0
  4. compas/_os.py +746 -0
  5. compas/colors/__init__.py +14 -0
  6. compas/colors/cmcrameri/acton.txt +256 -0
  7. compas/colors/cmcrameri/actonS.txt +100 -0
  8. compas/colors/cmcrameri/bam.txt +256 -0
  9. compas/colors/cmcrameri/bamO.txt +256 -0
  10. compas/colors/cmcrameri/bamako.txt +256 -0
  11. compas/colors/cmcrameri/bamakoS.txt +100 -0
  12. compas/colors/cmcrameri/batlow.txt +256 -0
  13. compas/colors/cmcrameri/batlowK.txt +256 -0
  14. compas/colors/cmcrameri/batlowS.txt +100 -0
  15. compas/colors/cmcrameri/batlowW.txt +256 -0
  16. compas/colors/cmcrameri/berlin.txt +256 -0
  17. compas/colors/cmcrameri/bilbao.txt +256 -0
  18. compas/colors/cmcrameri/bilbaoS.txt +100 -0
  19. compas/colors/cmcrameri/broc.txt +256 -0
  20. compas/colors/cmcrameri/brocO.txt +256 -0
  21. compas/colors/cmcrameri/buda.txt +256 -0
  22. compas/colors/cmcrameri/budaS.txt +100 -0
  23. compas/colors/cmcrameri/bukavu.txt +256 -0
  24. compas/colors/cmcrameri/cork.txt +256 -0
  25. compas/colors/cmcrameri/corkO.txt +256 -0
  26. compas/colors/cmcrameri/davos.txt +256 -0
  27. compas/colors/cmcrameri/davosS.txt +100 -0
  28. compas/colors/cmcrameri/devon.txt +256 -0
  29. compas/colors/cmcrameri/devonS.txt +100 -0
  30. compas/colors/cmcrameri/fes.txt +256 -0
  31. compas/colors/cmcrameri/grayC.txt +256 -0
  32. compas/colors/cmcrameri/grayCS.txt +100 -0
  33. compas/colors/cmcrameri/hawaii.txt +256 -0
  34. compas/colors/cmcrameri/hawaiiS.txt +100 -0
  35. compas/colors/cmcrameri/imola.txt +256 -0
  36. compas/colors/cmcrameri/imolaS.txt +100 -0
  37. compas/colors/cmcrameri/lajolla.txt +256 -0
  38. compas/colors/cmcrameri/lajollaS.txt +100 -0
  39. compas/colors/cmcrameri/lapaz.txt +256 -0
  40. compas/colors/cmcrameri/lapazS.txt +100 -0
  41. compas/colors/cmcrameri/lisbon.txt +256 -0
  42. compas/colors/cmcrameri/nuuk.txt +256 -0
  43. compas/colors/cmcrameri/nuukS.txt +100 -0
  44. compas/colors/cmcrameri/oleron.txt +256 -0
  45. compas/colors/cmcrameri/oslo.txt +256 -0
  46. compas/colors/cmcrameri/osloS.txt +100 -0
  47. compas/colors/cmcrameri/roma.txt +256 -0
  48. compas/colors/cmcrameri/romaO.txt +256 -0
  49. compas/colors/cmcrameri/tofino.txt +256 -0
  50. compas/colors/cmcrameri/tokyo.txt +256 -0
  51. compas/colors/cmcrameri/tokyoS.txt +100 -0
  52. compas/colors/cmcrameri/turku.txt +256 -0
  53. compas/colors/cmcrameri/turkuS.txt +100 -0
  54. compas/colors/cmcrameri/vanimo.txt +256 -0
  55. compas/colors/cmcrameri/vik.txt +256 -0
  56. compas/colors/cmcrameri/vikO.txt +256 -0
  57. compas/colors/color.py +1118 -0
  58. compas/colors/colordict.py +103 -0
  59. compas/colors/colormap.py +306 -0
  60. compas/colors/html_colors.py +149 -0
  61. compas/colors/mpl_colormap.py +1064 -0
  62. compas/data/__init__.py +31 -0
  63. compas/data/coercion.py +71 -0
  64. compas/data/conftest.py +10 -0
  65. compas/data/data.py +342 -0
  66. compas/data/encoders.py +240 -0
  67. compas/data/exceptions.py +2 -0
  68. compas/data/json.py +240 -0
  69. compas/data/samples/boxes.obj +250 -0
  70. compas/data/samples/butt_model.obj +2829 -0
  71. compas/data/samples/cone.stl +0 -0
  72. compas/data/samples/cube.off +16 -0
  73. compas/data/samples/cube_ascii.stl +56114 -0
  74. compas/data/samples/cube_binary.stl +0 -0
  75. compas/data/samples/cube_binary_2.stl +0 -0
  76. compas/data/samples/doosabin.json +1 -0
  77. compas/data/samples/faces.obj +63 -0
  78. compas/data/samples/faces_big.obj +9663 -0
  79. compas/data/samples/faces_reversed.obj +63 -0
  80. compas/data/samples/fink.obj +135 -0
  81. compas/data/samples/grid_irregular.obj +303 -0
  82. compas/data/samples/hypar.obj +148 -0
  83. compas/data/samples/lines.json +1 -0
  84. compas/data/samples/lines.obj +282 -0
  85. compas/data/samples/lines_big.obj +40322 -0
  86. compas/data/samples/lines_bigger.obj +161282 -0
  87. compas/data/samples/lines_noleaves.obj +422 -0
  88. compas/data/samples/mesh.obj +874 -0
  89. compas/data/samples/mesh_100_faces.json +1893 -0
  90. compas/data/samples/mesh_110_faces.json +2081 -0
  91. compas/data/samples/open_edges.obj +424 -0
  92. compas/data/samples/point.json +1 -0
  93. compas/data/samples/quadmesh.obj +183 -0
  94. compas/data/samples/quadmesh_planar.obj +181 -0
  95. compas/data/samples/saddle.obj +314 -0
  96. compas/data/samples/spline.obj +72 -0
  97. compas/data/samples/tubemesh.json +1 -0
  98. compas/data/samples/tubemesh.obj +378 -0
  99. compas/data/samples/tubemesh.off +374 -0
  100. compas/data/samples/tubemesh.ply +551 -0
  101. compas/data/schema.py +137 -0
  102. compas/data/validators.py +243 -0
  103. compas/datastructures/__init__.py +75 -0
  104. compas/datastructures/_mutablemapping.py +148 -0
  105. compas/datastructures/assembly/__init__.py +0 -0
  106. compas/datastructures/assembly/assembly.py +234 -0
  107. compas/datastructures/assembly/exceptions.py +6 -0
  108. compas/datastructures/assembly/part.py +228 -0
  109. compas/datastructures/attributes.py +85 -0
  110. compas/datastructures/cell_network/__init__.py +0 -0
  111. compas/datastructures/cell_network/cell_network.py +4190 -0
  112. compas/datastructures/datastructure.py +309 -0
  113. compas/datastructures/graph/__init__.py +0 -0
  114. compas/datastructures/graph/duality.py +197 -0
  115. compas/datastructures/graph/graph.py +2478 -0
  116. compas/datastructures/graph/operations/__init__.py +0 -0
  117. compas/datastructures/graph/operations/join.py +124 -0
  118. compas/datastructures/graph/operations/split.py +63 -0
  119. compas/datastructures/graph/planarity.py +292 -0
  120. compas/datastructures/graph/smoothing.py +59 -0
  121. compas/datastructures/mesh/__init__.py +0 -0
  122. compas/datastructures/mesh/conway.py +553 -0
  123. compas/datastructures/mesh/duality.py +104 -0
  124. compas/datastructures/mesh/mesh.py +5103 -0
  125. compas/datastructures/mesh/operations/__init__.py +0 -0
  126. compas/datastructures/mesh/operations/collapse.py +350 -0
  127. compas/datastructures/mesh/operations/extrude.py +0 -0
  128. compas/datastructures/mesh/operations/insert.py +120 -0
  129. compas/datastructures/mesh/operations/merge.py +83 -0
  130. compas/datastructures/mesh/operations/split.py +263 -0
  131. compas/datastructures/mesh/operations/substitute.py +37 -0
  132. compas/datastructures/mesh/operations/swap.py +62 -0
  133. compas/datastructures/mesh/operations/weld.py +107 -0
  134. compas/datastructures/mesh/remesh.py +234 -0
  135. compas/datastructures/mesh/slice.py +170 -0
  136. compas/datastructures/mesh/smoothing.py +187 -0
  137. compas/datastructures/mesh/subdivision.py +754 -0
  138. compas/datastructures/tree/__init__.py +0 -0
  139. compas/datastructures/tree/tree.py +504 -0
  140. compas/datastructures/volmesh/__init__.py +0 -0
  141. compas/datastructures/volmesh/volmesh.py +4203 -0
  142. compas/files/__init__.py +27 -0
  143. compas/files/_xml/__init__.py +0 -0
  144. compas/files/_xml/xml_cli.py +213 -0
  145. compas/files/_xml/xml_cpython.py +32 -0
  146. compas/files/_xml/xml_pre_38.py +58 -0
  147. compas/files/_xml/xml_shared.py +40 -0
  148. compas/files/gltf/__init__.py +0 -0
  149. compas/files/gltf/constants.py +59 -0
  150. compas/files/gltf/data_classes.py +657 -0
  151. compas/files/gltf/extensions.py +317 -0
  152. compas/files/gltf/gltf.py +92 -0
  153. compas/files/gltf/gltf_children.py +64 -0
  154. compas/files/gltf/gltf_content.py +615 -0
  155. compas/files/gltf/gltf_exporter.py +465 -0
  156. compas/files/gltf/gltf_mesh.py +273 -0
  157. compas/files/gltf/gltf_node.py +348 -0
  158. compas/files/gltf/gltf_parser.py +115 -0
  159. compas/files/gltf/gltf_reader.py +310 -0
  160. compas/files/gltf/gltf_scene.py +125 -0
  161. compas/files/gltf/helpers.py +59 -0
  162. compas/files/obj.py +680 -0
  163. compas/files/off.py +296 -0
  164. compas/files/ply.py +697 -0
  165. compas/files/stl.py +436 -0
  166. compas/files/xml.py +328 -0
  167. compas/geometry/__init__.py +772 -0
  168. compas/geometry/_core/__init__.py +0 -0
  169. compas/geometry/_core/_algebra.py +2826 -0
  170. compas/geometry/_core/angles.py +408 -0
  171. compas/geometry/_core/centroids.py +573 -0
  172. compas/geometry/_core/distance.py +895 -0
  173. compas/geometry/_core/normals.py +149 -0
  174. compas/geometry/_core/nurbs.py +367 -0
  175. compas/geometry/_core/predicates_2.py +582 -0
  176. compas/geometry/_core/predicates_3.py +1111 -0
  177. compas/geometry/_core/quaternions.py +196 -0
  178. compas/geometry/_core/size.py +204 -0
  179. compas/geometry/_core/tangent.py +56 -0
  180. compas/geometry/_core/transformations.py +1121 -0
  181. compas/geometry/_core/transformations_numpy.py +279 -0
  182. compas/geometry/bbox.py +145 -0
  183. compas/geometry/bbox_numpy.py +306 -0
  184. compas/geometry/bestfit.py +77 -0
  185. compas/geometry/bestfit_numpy.py +259 -0
  186. compas/geometry/booleans.py +297 -0
  187. compas/geometry/booleans_shapely.py +147 -0
  188. compas/geometry/brep/__init__.py +112 -0
  189. compas/geometry/brep/brep.py +1131 -0
  190. compas/geometry/brep/edge.py +302 -0
  191. compas/geometry/brep/errors.py +22 -0
  192. compas/geometry/brep/face.py +329 -0
  193. compas/geometry/brep/loop.py +87 -0
  194. compas/geometry/brep/trim.py +46 -0
  195. compas/geometry/brep/vertex.py +46 -0
  196. compas/geometry/contours.py +32 -0
  197. compas/geometry/curves/__init__.py +0 -0
  198. compas/geometry/curves/arc.py +429 -0
  199. compas/geometry/curves/bezier.py +345 -0
  200. compas/geometry/curves/circle.py +500 -0
  201. compas/geometry/curves/conic.py +16 -0
  202. compas/geometry/curves/curve.py +614 -0
  203. compas/geometry/curves/ellipse.py +408 -0
  204. compas/geometry/curves/hyperbola.py +336 -0
  205. compas/geometry/curves/line.py +431 -0
  206. compas/geometry/curves/nurbs.py +412 -0
  207. compas/geometry/curves/parabola.py +256 -0
  208. compas/geometry/curves/polyline.py +724 -0
  209. compas/geometry/frame.py +769 -0
  210. compas/geometry/geometry.py +296 -0
  211. compas/geometry/hull.py +146 -0
  212. compas/geometry/hull_numpy.py +82 -0
  213. compas/geometry/icp_numpy.py +104 -0
  214. compas/geometry/interpolation_barycentric.py +38 -0
  215. compas/geometry/interpolation_coons.py +102 -0
  216. compas/geometry/interpolation_tweening.py +87 -0
  217. compas/geometry/intersection.py +121 -0
  218. compas/geometry/intersections.py +1105 -0
  219. compas/geometry/kdtree.py +153 -0
  220. compas/geometry/offset.py +208 -0
  221. compas/geometry/pca_numpy.py +87 -0
  222. compas/geometry/plane.py +657 -0
  223. compas/geometry/point.py +664 -0
  224. compas/geometry/pointcloud.py +409 -0
  225. compas/geometry/polygon.py +473 -0
  226. compas/geometry/polyhedron.py +650 -0
  227. compas/geometry/projection.py +155 -0
  228. compas/geometry/quadmesh_planarize.py +30 -0
  229. compas/geometry/quadmesh_planarize_none.py +114 -0
  230. compas/geometry/quaternion.py +544 -0
  231. compas/geometry/reflection.py +102 -0
  232. compas/geometry/rotation.py +354 -0
  233. compas/geometry/scale.py +100 -0
  234. compas/geometry/shapes/__init__.py +0 -0
  235. compas/geometry/shapes/box.py +747 -0
  236. compas/geometry/shapes/capsule.py +472 -0
  237. compas/geometry/shapes/cone.py +309 -0
  238. compas/geometry/shapes/cylinder.py +355 -0
  239. compas/geometry/shapes/shape.py +300 -0
  240. compas/geometry/shapes/sphere.py +362 -0
  241. compas/geometry/shapes/torus.py +294 -0
  242. compas/geometry/shear.py +115 -0
  243. compas/geometry/surfaces/__init__.py +0 -0
  244. compas/geometry/surfaces/conical.py +166 -0
  245. compas/geometry/surfaces/cylindrical.py +251 -0
  246. compas/geometry/surfaces/extrusion.py +0 -0
  247. compas/geometry/surfaces/nurbs.py +380 -0
  248. compas/geometry/surfaces/planar.py +223 -0
  249. compas/geometry/surfaces/revolution.py +0 -0
  250. compas/geometry/surfaces/spherical.py +259 -0
  251. compas/geometry/surfaces/surface.py +689 -0
  252. compas/geometry/surfaces/toroidal.py +198 -0
  253. compas/geometry/transformation.py +554 -0
  254. compas/geometry/translation.py +104 -0
  255. compas/geometry/triangulation_delaunay.py +102 -0
  256. compas/geometry/triangulation_earclip.py +300 -0
  257. compas/geometry/trimesh_curvature.py +113 -0
  258. compas/geometry/trimesh_descent_numpy.py +26 -0
  259. compas/geometry/trimesh_geodistance.py +35 -0
  260. compas/geometry/trimesh_gradient_numpy.py +74 -0
  261. compas/geometry/trimesh_isolines.py +41 -0
  262. compas/geometry/trimesh_matrices.py +31 -0
  263. compas/geometry/trimesh_matrices_numpy.py +191 -0
  264. compas/geometry/trimesh_parametrisation.py +55 -0
  265. compas/geometry/trimesh_pull_points_numpy.py +216 -0
  266. compas/geometry/trimesh_remeshing.py +97 -0
  267. compas/geometry/trimesh_samplepoints_numpy.py +108 -0
  268. compas/geometry/trimesh_slicing.py +28 -0
  269. compas/geometry/trimesh_smoothing_numpy.py +34 -0
  270. compas/geometry/vector.py +889 -0
  271. compas/itertools.py +441 -0
  272. compas/linalg.py +634 -0
  273. compas/matrices.py +314 -0
  274. compas/plugins.py +488 -0
  275. compas/rpc/__init__.py +20 -0
  276. compas/rpc/__main__.py +77 -0
  277. compas/rpc/dispatcher.py +181 -0
  278. compas/rpc/errors.py +11 -0
  279. compas/rpc/proxy.py +437 -0
  280. compas/rpc/server.py +79 -0
  281. compas/rpc/services/__init__.py +0 -0
  282. compas/rpc/services/default.py +87 -0
  283. compas/rpc/services/watcher.py +43 -0
  284. compas/scene/__init__.py +56 -0
  285. compas/scene/assemblyobject.py +3 -0
  286. compas/scene/context.py +154 -0
  287. compas/scene/descriptors/__init__.py +0 -0
  288. compas/scene/descriptors/attribute.py +30 -0
  289. compas/scene/descriptors/color.py +91 -0
  290. compas/scene/descriptors/colordict.py +101 -0
  291. compas/scene/descriptors/protocol.py +12 -0
  292. compas/scene/exceptions.py +7 -0
  293. compas/scene/geometryobject.py +58 -0
  294. compas/scene/graphobject.py +173 -0
  295. compas/scene/meshobject.py +238 -0
  296. compas/scene/scene.py +144 -0
  297. compas/scene/sceneobject.py +253 -0
  298. compas/scene/volmeshobject.py +252 -0
  299. compas/tolerance.py +879 -0
  300. compas/topology/__init__.py +45 -0
  301. compas/topology/combinatorics.py +108 -0
  302. compas/topology/connectivity.py +129 -0
  303. compas/topology/orientation.py +204 -0
  304. compas/topology/traversal.py +567 -0
  305. compas/utilities/__init__.py +25 -0
  306. compas/utilities/azync.py +155 -0
  307. compas/utilities/datetime.py +40 -0
  308. compas/utilities/decorators.py +136 -0
  309. compas/utilities/remote.py +54 -0
  310. compas/utilities/ssh.py +169 -0
  311. compas-2.1.1.dist-info/AUTHORS.md +42 -0
  312. compas-2.1.1.dist-info/LICENSE +21 -0
  313. compas-2.1.1.dist-info/METADATA +132 -0
  314. compas-2.1.1.dist-info/RECORD +468 -0
  315. compas-2.1.1.dist-info/WHEEL +5 -0
  316. compas-2.1.1.dist-info/entry_points.txt +2 -0
  317. compas-2.1.1.dist-info/top_level.txt +4 -0
  318. compas_blender/__init__.py +250 -0
  319. compas_blender/collections.py +130 -0
  320. compas_blender/conversions/__init__.py +48 -0
  321. compas_blender/conversions/breps.py +0 -0
  322. compas_blender/conversions/colors.py +23 -0
  323. compas_blender/conversions/curves.py +125 -0
  324. compas_blender/conversions/geometry.py +161 -0
  325. compas_blender/conversions/meshes.py +148 -0
  326. compas_blender/conversions/surfaces.py +48 -0
  327. compas_blender/conversions/transformations.py +46 -0
  328. compas_blender/data.py +30 -0
  329. compas_blender/geometry/__init__.py +14 -0
  330. compas_blender/geometry/booleans.py +100 -0
  331. compas_blender/install.py +338 -0
  332. compas_blender/objects.py +326 -0
  333. compas_blender/print_python_path.py +18 -0
  334. compas_blender/scene/__init__.py +116 -0
  335. compas_blender/scene/boxobject.py +64 -0
  336. compas_blender/scene/capsuleobject.py +73 -0
  337. compas_blender/scene/circleobject.py +53 -0
  338. compas_blender/scene/coneobject.py +70 -0
  339. compas_blender/scene/curveobject.py +58 -0
  340. compas_blender/scene/cylinderobject.py +70 -0
  341. compas_blender/scene/frameobject.py +105 -0
  342. compas_blender/scene/graphobject.py +257 -0
  343. compas_blender/scene/lineobject.py +60 -0
  344. compas_blender/scene/meshobject.py +508 -0
  345. compas_blender/scene/planeobject.py +81 -0
  346. compas_blender/scene/pointcloudobject.py +67 -0
  347. compas_blender/scene/pointobject.py +71 -0
  348. compas_blender/scene/polygonobject.py +57 -0
  349. compas_blender/scene/polyhedronobject.py +57 -0
  350. compas_blender/scene/polylineobject.py +54 -0
  351. compas_blender/scene/sceneobject.py +249 -0
  352. compas_blender/scene/sphereobject.py +72 -0
  353. compas_blender/scene/surfaceobject.py +54 -0
  354. compas_blender/scene/torusobject.py +73 -0
  355. compas_blender/scene/vectorobject.py +69 -0
  356. compas_blender/scene/volmeshobject.py +475 -0
  357. compas_blender/utilities/__init__.py +38 -0
  358. compas_blender/utilities/drawing.py +768 -0
  359. compas_ghpython/__init__.py +124 -0
  360. compas_ghpython/components/Compas_FromJson/code.py +18 -0
  361. compas_ghpython/components/Compas_Info/code.py +15 -0
  362. compas_ghpython/components/Compas_RpcCall/code.py +31 -0
  363. compas_ghpython/components/Compas_ToJson/code.py +19 -0
  364. compas_ghpython/components/Compas_ToRhinoGeometry/code.py +15 -0
  365. compas_ghpython/components/__init__.py +99 -0
  366. compas_ghpython/install.py +29 -0
  367. compas_ghpython/scene/__init__.py +115 -0
  368. compas_ghpython/scene/boxobject.py +40 -0
  369. compas_ghpython/scene/brepobject.py +40 -0
  370. compas_ghpython/scene/capsuleobject.py +41 -0
  371. compas_ghpython/scene/circleobject.py +40 -0
  372. compas_ghpython/scene/coneobject.py +40 -0
  373. compas_ghpython/scene/curveobject.py +42 -0
  374. compas_ghpython/scene/cylinderobject.py +38 -0
  375. compas_ghpython/scene/ellipseobject.py +40 -0
  376. compas_ghpython/scene/frameobject.py +67 -0
  377. compas_ghpython/scene/graphobject.py +77 -0
  378. compas_ghpython/scene/lineobject.py +39 -0
  379. compas_ghpython/scene/meshobject.py +137 -0
  380. compas_ghpython/scene/planeobject.py +61 -0
  381. compas_ghpython/scene/pointobject.py +38 -0
  382. compas_ghpython/scene/polygonobject.py +48 -0
  383. compas_ghpython/scene/polyhedronobject.py +48 -0
  384. compas_ghpython/scene/polylineobject.py +39 -0
  385. compas_ghpython/scene/sceneobject.py +12 -0
  386. compas_ghpython/scene/sphereobject.py +39 -0
  387. compas_ghpython/scene/surfaceobject.py +42 -0
  388. compas_ghpython/scene/torusobject.py +39 -0
  389. compas_ghpython/scene/vectorobject.py +51 -0
  390. compas_ghpython/scene/volmeshobject.py +154 -0
  391. compas_ghpython/sets.py +83 -0
  392. compas_ghpython/timer.py +36 -0
  393. compas_ghpython/uninstall.py +31 -0
  394. compas_ghpython/utilities/__init__.py +33 -0
  395. compas_ghpython/utilities/drawing.py +457 -0
  396. compas_rhino/__init__.py +607 -0
  397. compas_rhino/conduits/__init__.py +16 -0
  398. compas_rhino/conduits/base.py +121 -0
  399. compas_rhino/conduits/faces.py +91 -0
  400. compas_rhino/conduits/labels.py +102 -0
  401. compas_rhino/conduits/lines.py +109 -0
  402. compas_rhino/conduits/points.py +111 -0
  403. compas_rhino/conversions/__init__.py +168 -0
  404. compas_rhino/conversions/breps.py +122 -0
  405. compas_rhino/conversions/curves.py +453 -0
  406. compas_rhino/conversions/docobjects.py +0 -0
  407. compas_rhino/conversions/exceptions.py +7 -0
  408. compas_rhino/conversions/extrusions.py +80 -0
  409. compas_rhino/conversions/geometry.py +187 -0
  410. compas_rhino/conversions/meshes.py +281 -0
  411. compas_rhino/conversions/shapes.py +291 -0
  412. compas_rhino/conversions/surfaces.py +355 -0
  413. compas_rhino/conversions/transformations.py +45 -0
  414. compas_rhino/geometry/__init__.py +44 -0
  415. compas_rhino/geometry/booleans.py +118 -0
  416. compas_rhino/geometry/brep/__init__.py +40 -0
  417. compas_rhino/geometry/brep/brep.py +554 -0
  418. compas_rhino/geometry/brep/builder.py +184 -0
  419. compas_rhino/geometry/brep/edge.py +202 -0
  420. compas_rhino/geometry/brep/face.py +285 -0
  421. compas_rhino/geometry/brep/loop.py +129 -0
  422. compas_rhino/geometry/brep/trim.py +99 -0
  423. compas_rhino/geometry/brep/vertex.py +76 -0
  424. compas_rhino/geometry/curves/__init__.py +43 -0
  425. compas_rhino/geometry/curves/curve.py +382 -0
  426. compas_rhino/geometry/curves/nurbs.py +298 -0
  427. compas_rhino/geometry/surfaces/__init__.py +50 -0
  428. compas_rhino/geometry/surfaces/nurbs.py +370 -0
  429. compas_rhino/geometry/surfaces/surface.py +407 -0
  430. compas_rhino/geometry/trimesh_curvature.py +344 -0
  431. compas_rhino/geometry/trimesh_slicing.py +65 -0
  432. compas_rhino/install.py +382 -0
  433. compas_rhino/install_plugin.py +169 -0
  434. compas_rhino/install_with_pip.py +20 -0
  435. compas_rhino/layers.py +347 -0
  436. compas_rhino/objects.py +1141 -0
  437. compas_rhino/print_python_path.py +18 -0
  438. compas_rhino/scene/__init__.py +123 -0
  439. compas_rhino/scene/boxobject.py +44 -0
  440. compas_rhino/scene/brepobject.py +41 -0
  441. compas_rhino/scene/capsuleobject.py +45 -0
  442. compas_rhino/scene/circleobject.py +43 -0
  443. compas_rhino/scene/coneobject.py +43 -0
  444. compas_rhino/scene/curveobject.py +43 -0
  445. compas_rhino/scene/cylinderobject.py +43 -0
  446. compas_rhino/scene/ellipseobject.py +44 -0
  447. compas_rhino/scene/frameobject.py +99 -0
  448. compas_rhino/scene/graphobject.py +364 -0
  449. compas_rhino/scene/helpers.py +33 -0
  450. compas_rhino/scene/lineobject.py +43 -0
  451. compas_rhino/scene/meshobject.py +673 -0
  452. compas_rhino/scene/planeobject.py +71 -0
  453. compas_rhino/scene/pointobject.py +43 -0
  454. compas_rhino/scene/polygonobject.py +45 -0
  455. compas_rhino/scene/polyhedronobject.py +45 -0
  456. compas_rhino/scene/polylineobject.py +43 -0
  457. compas_rhino/scene/sceneobject.py +123 -0
  458. compas_rhino/scene/sphereobject.py +43 -0
  459. compas_rhino/scene/surfaceobject.py +42 -0
  460. compas_rhino/scene/torusobject.py +43 -0
  461. compas_rhino/scene/vectorobject.py +49 -0
  462. compas_rhino/scene/volmeshobject.py +518 -0
  463. compas_rhino/ui.py +114 -0
  464. compas_rhino/uninstall.py +243 -0
  465. compas_rhino/uninstall_plugin.py +91 -0
  466. compas_rhino/utilities/__init__.py +37 -0
  467. compas_rhino/utilities/constructors.py +71 -0
  468. compas_rhino/utilities/drawing.py +1081 -0
@@ -0,0 +1,567 @@
1
+ from __future__ import absolute_import
2
+ from __future__ import division
3
+ from __future__ import print_function
4
+
5
+ try:
6
+ from queue import PriorityQueue
7
+ except ImportError:
8
+ from Queue import PriorityQueue # type: ignore
9
+
10
+ from collections import deque
11
+
12
+ from compas.geometry import distance_point_point
13
+
14
+ # ==============================================================================
15
+ # DFS
16
+ # ==============================================================================
17
+
18
+
19
+ def depth_first_ordering(adjacency, root):
20
+ """Compute a depth-first ordering of the nodes of a graph, starting from a root node.
21
+
22
+ Parameters
23
+ ----------
24
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
25
+ An adjacency dictionary representing the connectivity of the graph
26
+ by mapping nodes identifiers to neighbour identifiers.
27
+ Examples of valid adjacency dicts are
28
+
29
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
30
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
31
+
32
+ root : hashable
33
+ The node from which to start the depth-first search.
34
+
35
+ Returns
36
+ -------
37
+ list[hashable]
38
+ A depth-first ordering of all nodes of the graph.
39
+
40
+ Notes
41
+ -----
42
+ Return all nodes of a connected component containing `root` of a graph
43
+ represented by an adjacency dictionary.
44
+
45
+ This implementation uses a "to visit" stack. The principle of a stack
46
+ is LIFO. In Python, a list is a stack.
47
+
48
+ Initially only the root element is on the stack. While there are still
49
+ elements on the stack, the node on top of the stack is "popped off" and if
50
+ this node was not already visited, its neighbors are added to the stack if
51
+ they hadn't already been visited themselves.
52
+
53
+ Since the last element on top of the stack is always popped off, the
54
+ algorithm goes deeper and deeper in the datastructure, until it reaches a
55
+ node without (unvisited) neighbors and then backtracks. Once a new node
56
+ with unvisited neighbors is found, there too it will go as deep as possible
57
+ before backtracking again, and so on. Once there are no more nodes on the
58
+ stack, the entire structure has been traversed.
59
+
60
+ Note that this returns a depth-first spanning tree of a connected component
61
+ of the graph.
62
+
63
+ """
64
+ adjacency = {key: set(nbrs) for key, nbrs in iter(adjacency.items())}
65
+ tovisit = [root]
66
+ visited = set()
67
+ ordering = []
68
+
69
+ while tovisit:
70
+ # pop the last added element from the stack
71
+ node = tovisit.pop()
72
+ if node not in visited:
73
+ # mark the node as visited
74
+ visited.add(node)
75
+ ordering.append(node)
76
+ # add the unvisited nbrs to the stack
77
+ tovisit.extend(adjacency[node] - visited)
78
+ return ordering
79
+
80
+
81
+ # def depth_first_tree(adjacency, root):
82
+ # """Construct a spanning tree using a depth-first search.
83
+
84
+ # Parameters
85
+ # ----------
86
+ # adjacency : dict
87
+ # An adjacency dictionary.
88
+ # root : hashable
89
+ # The identifier of the root node.
90
+
91
+ # Returns
92
+ # -------
93
+ # list
94
+ # List of nodes in depth-first order.
95
+ # dict
96
+ # Dictionary of predecessors for each of the nodes.
97
+ # list
98
+ # The depth-first paths.
99
+
100
+ # Examples
101
+ # --------
102
+ # >>>
103
+ # """
104
+ # adjacency = {key: set(nbrs) for key, nbrs in iter(adjacency.items())}
105
+ # tovisit = [root]
106
+ # visited = set()
107
+ # ordering = []
108
+ # predecessors = {}
109
+ # paths = [[root]]
110
+
111
+ # while tovisit:
112
+ # # pop the last added element from the stack
113
+ # node = tovisit.pop()
114
+ # if node not in visited:
115
+ # paths[-1].append(node)
116
+ # # mark the node as visited
117
+ # visited.add(node)
118
+ # ordering.append(node)
119
+ # # add the unvisited nbrs to the stack
120
+ # nodes = adjacency[node] - visited
121
+ # if nodes:
122
+ # for child in nodes:
123
+ # predecessors[child] = node
124
+ # else:
125
+ # paths.append([])
126
+ # tovisit.extend(nodes)
127
+ # if not len(paths[-1]):
128
+ # del paths[-1]
129
+ # return ordering, predecessors, paths
130
+
131
+
132
+ # ==============================================================================
133
+ # BFS
134
+ # ==============================================================================
135
+
136
+
137
+ def breadth_first_ordering(adjacency, root):
138
+ """Compute a breadth-first ordering of the nodes of a graph, starting from a root node.
139
+
140
+ Parameters
141
+ ----------
142
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
143
+ An adjacency dictionary representing the connectivity of the graph
144
+ by mapping nodes identifiers to neighbour identifiers.
145
+ Examples of valid adjacency dicts are
146
+
147
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
148
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
149
+
150
+ root : hashable
151
+ The node from which to start the breadth-first search.
152
+
153
+ Returns
154
+ -------
155
+ list[hashable]
156
+ A breadth-first ordering of all nodes of the graph.
157
+
158
+ Notes
159
+ -----
160
+ This implementation uses a double-ended queue (deque) to keep track of nodes to visit.
161
+ The principle of a queue is FIFO. In Python, a deque is ideal for removing elements
162
+ from the beginning, i.e. from the 'left'.
163
+
164
+ In a breadth-first search, all unvisited neighbors of a node are visited
165
+ first. When a neighbor is visited, its univisited neighbors are added to
166
+ the list of nodes to visit.
167
+
168
+ By appending the neighbors to the end of the list of nodes to visit,
169
+ and by visiting the nodes at the start of the list first, the graph is
170
+ traversed in *breadth-first* order.
171
+
172
+ """
173
+ tovisit = deque([root])
174
+ visited = set([root])
175
+ ordering = [root]
176
+ while tovisit:
177
+ node = tovisit.popleft()
178
+ for nbr in adjacency[node]:
179
+ if nbr not in visited:
180
+ tovisit.append(nbr)
181
+ visited.add(nbr)
182
+ ordering.append(nbr)
183
+ return ordering
184
+
185
+
186
+ def breadth_first_traverse(adjacency, root, callback=None):
187
+ """Traverse an adjacency dict in "breadth-first" order.
188
+
189
+ Parameters
190
+ ----------
191
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
192
+ An adjacency dictionary representing the connectivity of the graph
193
+ by mapping nodes identifiers to neighbour identifiers.
194
+ Examples of valid adjacency dicts are
195
+
196
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
197
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
198
+
199
+ root : hashable
200
+ The identifier of the starting node.
201
+ callback : callable, optional
202
+ A callback function applied to every traversed node and its current neighbour.
203
+
204
+ Returns
205
+ -------
206
+ set[hashable]
207
+ The visited nodes.
208
+
209
+ """
210
+ tovisit = deque([root])
211
+ visited = set([root])
212
+ while tovisit:
213
+ node = tovisit.popleft()
214
+ for nbr in adjacency[node]:
215
+ if nbr not in visited:
216
+ tovisit.append(nbr)
217
+ visited.add(nbr)
218
+ if callback:
219
+ callback(node, nbr)
220
+ return visited
221
+
222
+
223
+ def breadth_first_paths(adjacency, root, goal):
224
+ """Return all paths from root to goal.
225
+
226
+ Parameters
227
+ ----------
228
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
229
+ An adjacency dictionary representing the connectivity of the graph
230
+ by mapping nodes identifiers to neighbour identifiers.
231
+ Examples of valid adjacency dicts are
232
+
233
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
234
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
235
+
236
+ root : hashable
237
+ The identifier of the starting node.
238
+ goal : hashable
239
+ The identifier of the ending node.
240
+
241
+ Yields
242
+ ------
243
+ list[hashable]
244
+ A path from root to goal.
245
+
246
+ Notes
247
+ -----
248
+ Due to the nature of the search, the first path returned is the shortest.
249
+
250
+ """
251
+ adjacency = {key: set(nbrs) for key, nbrs in iter(adjacency.items())}
252
+ tovisit = deque([(root, [root])])
253
+ while tovisit:
254
+ node, path = tovisit.popleft()
255
+ for nbr in adjacency[node] - set(path):
256
+ if nbr == goal:
257
+ yield path + [nbr]
258
+ else:
259
+ tovisit.append((nbr, path + [nbr]))
260
+
261
+
262
+ def breadth_first_tree(adjacency, root):
263
+ """Compute a BFS tree, starting from a root node.
264
+
265
+ Parameters
266
+ ----------
267
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
268
+ An adjacency dictionary representing the connectivity of the graph
269
+ by mapping nodes identifiers to neighbour identifiers.
270
+ Examples of valid adjacency dicts are
271
+
272
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
273
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
274
+
275
+ root : hashable
276
+ Identifier of the root node.
277
+
278
+ Returns
279
+ -------
280
+ list[hashable]
281
+ BFS ordering of all nodes.
282
+ dict[hashable, hashable]
283
+ A dict mapping each node to its direct predecessor in the tree.
284
+ list[list[hashable]]
285
+ A traversal path for every node in the graph.
286
+
287
+ """
288
+ tovisit = deque([root])
289
+ visited = set([root])
290
+ ordering = [root]
291
+ predecessors = {}
292
+ paths = []
293
+ while tovisit:
294
+ node = tovisit.popleft()
295
+ for nbr in adjacency[node]:
296
+ if nbr not in visited:
297
+ predecessors[nbr] = node
298
+ tovisit.append(nbr)
299
+ visited.add(nbr)
300
+ ordering.append(nbr)
301
+ else:
302
+ path = [node]
303
+ while path[-1] in predecessors:
304
+ path.append(predecessors[path[-1]])
305
+ paths.append(reversed(path))
306
+ return ordering, predecessors, paths
307
+
308
+
309
+ # ==============================================================================
310
+ # shortest
311
+ # ==============================================================================
312
+
313
+
314
+ def shortest_path(adjacency, root, goal):
315
+ """Find the shortest path between two vertices of a graph.
316
+
317
+ Parameters
318
+ ----------
319
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
320
+ An adjacency dictionary representing the connectivity of the graph
321
+ by mapping nodes identifiers to neighbour identifiers.
322
+ Examples of valid adjacency dicts are
323
+
324
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
325
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
326
+
327
+ root : hashable
328
+ The identifier of the starting node.
329
+ goal : hashable
330
+ The identifier of the ending node.
331
+
332
+ Returns
333
+ -------
334
+ list[hashable] | None
335
+ The path from root to goal, or None, if no path exists between the vertices.
336
+
337
+ """
338
+ try:
339
+ return next(breadth_first_paths(adjacency, root, goal))
340
+ except StopIteration:
341
+ return None
342
+
343
+
344
+ # ==============================================================================
345
+ # A*
346
+ # ==============================================================================
347
+
348
+
349
+ def reconstruct_path(came_from, current):
350
+ if current not in came_from:
351
+ return None
352
+ total_path = [current]
353
+ while current in came_from:
354
+ current = came_from[current]
355
+ total_path.append(current)
356
+ total_path.reverse()
357
+ return total_path
358
+
359
+
360
+ def astar_lightest_path(adjacency, weights, heuristic, root, goal):
361
+ """Find the path of least weight between two vertices of a graph using the A* search algorithm.
362
+
363
+ Parameters
364
+ ----------
365
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
366
+ An adjacency dictionary representing the connectivity of the graph
367
+ by mapping nodes identifiers to neighbour identifiers.
368
+ Examples of valid adjacency dicts are
369
+
370
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
371
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
372
+
373
+ weights : dict[tuple[hashable, hashable], float]
374
+ A dictionary of edge weights.
375
+ heuristic : dict[hashable, float]
376
+ A dictionary of guesses of weights of paths from a node to the goal.
377
+ root : hashable
378
+ The start vertex.
379
+ goal : hashable
380
+ The end vertex.
381
+
382
+ Returns
383
+ -------
384
+ list[hashable] | None
385
+ The path from root to goal, or None, if no path exists between the vertices.
386
+
387
+ References
388
+ ----------
389
+ https://en.wikipedia.org/wiki/A*_search_algorithm
390
+
391
+ """
392
+ visited_set = set()
393
+
394
+ candidates_set = {root}
395
+ best_candidate_heap = PriorityQueue()
396
+ best_candidate_heap.put((heuristic[root], root))
397
+
398
+ came_from = dict()
399
+
400
+ g_score = dict()
401
+ for v in adjacency:
402
+ g_score[v] = float("inf")
403
+ g_score[root] = 0
404
+
405
+ while not best_candidate_heap.empty():
406
+ _, current = best_candidate_heap.get()
407
+ if current == goal:
408
+ break
409
+
410
+ visited_set.add(current)
411
+ for neighbor in adjacency[current]:
412
+ if neighbor in visited_set:
413
+ continue
414
+
415
+ tentative_g_score = g_score[current] + weights[(current, neighbor)]
416
+ if neighbor not in candidates_set:
417
+ candidates_set.add(neighbor)
418
+ elif tentative_g_score >= g_score[neighbor]:
419
+ continue
420
+
421
+ came_from[neighbor] = current
422
+ g_score[neighbor] = tentative_g_score
423
+ new_f_score = g_score[neighbor] + heuristic[neighbor]
424
+ best_candidate_heap.put((new_f_score, neighbor))
425
+
426
+ return reconstruct_path(came_from, goal)
427
+
428
+
429
+ def _get_coordinates(key, structure):
430
+ if hasattr(structure, "node_attributes"):
431
+ return structure.node_attributes(key, "xyz")
432
+ if hasattr(structure, "vertex_coordinates"):
433
+ return structure.vertex_coordinates(key)
434
+ raise Exception("Coordinates cannot be found for object of type {}".format(type(structure)))
435
+
436
+
437
+ def _get_points(structure):
438
+ if hasattr(structure, "nodes"):
439
+ return structure.nodes()
440
+ if hasattr(structure, "vertices"):
441
+ return structure.vertices()
442
+ raise Exception("Points cannot be found for object of type {}".format(type(structure)))
443
+
444
+
445
+ def astar_shortest_path(graph, root, goal):
446
+ """Find the shortest path between two vertices of a graph or mesh using the A* search algorithm.
447
+
448
+ Parameters
449
+ ----------
450
+ graph : :class:`compas.datastructures.Graph` | :class:`compas.datastructures.Mesh`
451
+ A graph or mesh data structure.
452
+ root : hashable
453
+ The identifier of the starting node.
454
+ goal : hashable
455
+ The identifier of the ending node.
456
+
457
+ Returns
458
+ -------
459
+ list[hashable] | None
460
+ The path from root to goal, or None, if no path exists between the vertices.
461
+
462
+ References
463
+ ----------
464
+ https://en.wikipedia.org/wiki/A*_search_algorithm
465
+
466
+ """
467
+ adjacency = graph.adjacency
468
+ weights = {}
469
+ for u, v in graph.edges():
470
+ u_coords = _get_coordinates(u, graph)
471
+ v_coords = _get_coordinates(v, graph)
472
+ distance = distance_point_point(u_coords, v_coords)
473
+ weights[(u, v)] = distance
474
+ weights[(v, u)] = distance
475
+
476
+ heuristic = {}
477
+ goal_coords = _get_coordinates(goal, graph)
478
+ points = _get_points(graph)
479
+ for u in points:
480
+ u_coords = _get_coordinates(u, graph)
481
+ heuristic[u] = distance_point_point(u_coords, goal_coords)
482
+
483
+ return astar_lightest_path(adjacency, weights, heuristic, root, goal)
484
+
485
+
486
+ def dijkstra_distances(adjacency, weight, target):
487
+ """Compute Dijkstra distances from all nodes in a graph to one target node.
488
+
489
+ Parameters
490
+ ----------
491
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
492
+ An adjacency dictionary representing the connectivity of the graph
493
+ by mapping nodes identifiers to neighbour identifiers.
494
+ Examples of valid adjacency dicts are
495
+
496
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
497
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
498
+
499
+ weight : dict[tuple[hashable, hashable], float]
500
+ A dictionary of edge weights.
501
+ target : hashable
502
+ The key of the vertex to which the distances are computed.
503
+
504
+ Returns
505
+ -------
506
+ dict[hashable, float]
507
+ A dictionary of distances to the target.
508
+
509
+ """
510
+ adjacency = {key: set(nbrs) for key, nbrs in adjacency.items()}
511
+ distance = {key: (0 if key == target else 1e17) for key in adjacency}
512
+ tovisit = set(adjacency.keys())
513
+ visited = set()
514
+
515
+ while tovisit:
516
+ u = min(tovisit, key=lambda k: distance[k])
517
+ tovisit.remove(u)
518
+ visited.add(u)
519
+ for v in adjacency[u] - visited:
520
+ d = distance[u] + weight[(u, v)]
521
+ if d < distance[v]:
522
+ distance[v] = d
523
+ return distance
524
+
525
+
526
+ def dijkstra_path(adjacency, weight, source, target, dist=None):
527
+ """Find the shortest path between two nodes of a graph if the weights of the connecting edges are not all the same.
528
+
529
+ Parameters
530
+ ----------
531
+ adjacency : dict[hashable, dict[hashable, None]] | dict[hashable, sequence[hashable]]
532
+ An adjacency dictionary representing the connectivity of the graph
533
+ by mapping nodes identifiers to neighbour identifiers.
534
+ Examples of valid adjacency dicts are
535
+
536
+ * ``{0: [1, 2, 3, 4], 1: [0], 2: [0], 3: [0], 4: [0]}``
537
+ * ``{0: {1: None, 2: None, 3: None, 4: None}, 1: {0: None}, 2: {0: None}, 3: {0: None}, 4: {0: None}}``
538
+
539
+ weight : dict[tuple[hashable, hashable], float]
540
+ A dictionary of edge weights.
541
+ source : hashable
542
+ The start vertex.
543
+ target : hashable
544
+ The end vertex.
545
+
546
+ Returns
547
+ -------
548
+ list[hashable]
549
+ The shortest path.
550
+
551
+ Notes
552
+ -----
553
+ The edge weights should all be positive.
554
+ For a directed graph, set the weights of the reversed edges to ``+inf``.
555
+ For an undirected graph, add the same weight for an edge in both directions.
556
+
557
+ """
558
+ if not dist:
559
+ dist = dijkstra_distances(adjacency, weight, target)
560
+ path = [source]
561
+ node = source
562
+ node = min(adjacency[node], key=lambda nbr: dist[nbr] + weight[(node, nbr)])
563
+ path.append(node)
564
+ while node != target:
565
+ node = min(adjacency[node], key=lambda nbr: dist[nbr] + weight[(node, nbr)])
566
+ path.append(node)
567
+ return path
@@ -0,0 +1,25 @@
1
+ from __future__ import absolute_import
2
+
3
+ from .azync import await_callback
4
+ from .datetime import now, timestamp
5
+ from .decorators import (
6
+ abstractclassmethod,
7
+ abstractstaticmethod,
8
+ memoize,
9
+ print_profile,
10
+ )
11
+
12
+ from .remote import download_file_from_remote
13
+ from .ssh import SSH
14
+
15
+ __all__ = [
16
+ "await_callback",
17
+ "timestamp",
18
+ "now",
19
+ "abstractstaticmethod",
20
+ "abstractclassmethod",
21
+ "memoize",
22
+ "print_profile",
23
+ "download_file_from_remote",
24
+ "SSH",
25
+ ]