hcad (empty) → 0.1
raw patch · 8 files changed
+1783/−0 lines, 8 filesdep +basedep +containersdep +gasp
Dependencies added: base, containers, gasp, mtl
Files
- HCad.hs +12/−0
- HCad/Expr.hs +150/−0
- HCad/Nuts.hs +78/−0
- HCad/Part.hs +721/−0
- HCad/Part/Extensions.hs +49/−0
- HCad/SCAD.hs +73/−0
- LICENSE +674/−0
- hcad.cabal +26/−0
+ HCad.hs view
@@ -0,0 +1,12 @@+module HCad (module H) where++import Algebra.Linear as H hiding (transform)+import HCad.Part as H+import HCad.Part.Extensions as H+import HCad.SCAD as H+import HCad.Expr as H+++++
+ HCad/Expr.hs view
@@ -0,0 +1,150 @@+{-# LANGUAGE ViewPatterns #-}+{-# LANGUAGE LambdaCase #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE TypeInType #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE RecordWildCards #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE DeriveTraversable #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE PatternSynonyms #-}+module HCad.Expr where+++import Algebra.Classes as A+import Prelude hiding (divMod,div,Num(..))+import Prelude (abs)+import qualified Prelude+import qualified Data.Set as Set+import Numeric (showGFloat)+data Expr where+ Con :: Double -> Expr+ Var :: Parameter -> Expr+ Fun :: String -> [Expr] -> Expr+ BinOp :: String -> Expr -> Expr -> Expr+ deriving Eq++pattern (:+:) :: Expr -> Expr -> Expr+pattern x :+: y = BinOp "+" x y++-- pattern (:-:) :: Expr -> Expr -> Expr+-- pattern x :-: y = BinOp "-" x y++pattern (:*:) :: Expr -> Expr -> Expr+pattern x :*: y = BinOp "*" x y++instance Additive Expr where+ zero = Con 0+ Con z + x | abs z < 1e-10 = x+ x + Con z | abs z < 1e-10 = x+ Con x + Con y = Con (x A.+ y)+ (Con x :+: z) + Con y = Con (x A.+ y) A.+ z+ Con y + (Con x :+: z) = Con (x A.+ y) A.+ z+ (Con a :+: x) + (Con b :+: y) = Con (a + b) :+: (x + y)+ (Con x :+: z) + y = Con x :+: (z + y)+ y + (Con x :+: z) = Con x :+: (z + y)+ (a :*: x) + (b :*: y) | x == y = (a + b) * x+ (a :*: x) + y | x == y = (a + 1) * x+ y + (a :*: x)| x == y = (a + 1) * x+ x + Con y = Con y :+: x+ x + y = x :+: y++instance Group Expr where+ -- x - Con z | abs z < 1e-10= x+ -- Con x - Con y = Con (x A.- y)+ -- x - y = BinOp "-" x y+ negate = (Con (-1) *)++instance Division Expr where+ Con x / Con y = Con (x A./ y)+ x / y = BinOp "/" x y+++instance Multiplicative Expr where+ Con z * _ | abs z < 1e-10 = zero+ _ * Con z | abs z < 1e-10 = zero+ Con 1 * x = x+ x * Con 1 = x+ Con x * Con y = Con (x A.* y)+ (x :+: y) * z = x * z + y * z+ z * (x :+: y) = x * z + y * z+ -- z * (x :-: y) = x * z - y * z+ (Con x :*: z) * Con y = Con (x A.* y) A.* z+ Con y * (Con x :*: z) = Con (x A.* y) A.* z+ x * Con y = Con y :*: x+ x * y = BinOp "*" x y+ one = Con 1++instance Show Expr where+ showsPrec d = \case+ BinOp op x y -> showParen True (showsPrec d x . showString op . showsPrec d y)+ Con x -> showGFloat (Just 8) x+ Var v -> showString (paramName v)+ Fun f args -> showString f . showParen True (intercalate' "," $ map (showsPrec d) args)++intercalate' :: Foldable t => String -> t (String -> String) -> String -> String+intercalate' s = foldr1 (\x y -> x . showString s . y)++data Possible = PRange Double Double | PSet [Double]+ deriving (Ord,Eq)+data Parameter+ = Parameter {paramGroup :: String+ ,paramName :: String+ ,paramDefault :: Double+ ,paramComment :: String+ ,paramPossible :: Possible}+ deriving (Ord,Eq)+params :: Expr -> Set.Set Parameter+params = \case+ BinOp _ x y -> foldMap params [x,y]+ Con _ -> Set.empty+ Var p -> Set.singleton p+ Fun _ args -> foldMap params args++confun :: (Double -> Double) -> String -> Expr -> Expr+confun f _g (Con x) = Con (f x)+confun _f g x = Fun g [x]++instance Module Expr Expr where+ (*^) = (A.*)+instance AbelianAdditive Expr where+instance Ring Expr where+instance Field Expr where+instance Floating Expr where+ pi = Con pi+ exp = confun exp "exp"+ log = confun log "log"+ sin = confun sin "sin"+ cos = confun cos "cos"+ asin = confun asin "asin"+ acos = confun acos "acos"+ atan = confun atan "atan"+ sinh = confun sinh "sinh"+ cosh = confun cosh "cosh"+ asinh = confun asinh "asinh"+ acosh = confun acosh "acosh"+ atanh = confun atanh "atanh"++instance Fractional Expr where+ fromRational = A.fromRational+ recip = A.recip++instance Prelude.Num Expr where+ (+) = (A.+)+ (-) = (A.-)+ (*) = (A.*)+ abs = Fun "abs" . return+ signum = Fun "signum" . return+ fromInteger = Con . A.fromInteger
+ HCad/Nuts.hs view
@@ -0,0 +1,78 @@+{-# LANGUAGE ViewPatterns #-}+{-# LANGUAGE LambdaCase #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE TypeInType #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE RecordWildCards #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE DeriveTraversable #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE PatternSynonyms #-}+{-# LANGUAGE RebindableSyntax #-}+module HCad.Nuts where++import Algebra.Linear+import Algebra.Classes+import Prelude hiding (Num(..),(/),divMod,div,recip,fromRational)+import Data.Foldable+import GHC.TypeLits+import Data.List (intercalate)+import Data.Kind (Type)+import Data.Type.Equality+import Unsafe.Coerce+import Data.Char (toLower)+import HCad.Part++data MNut a = MNut { mSize :: a+ , mThreadPitch :: a+ , mMaxFlatsDist :: a+ , mMinFlatsDist :: a+ , mMaxThickness :: a+ , mMinThickness :: a}+m1_6,m2, m2_5, m3, m4, m5, m6, m8, m10, m12, m14, m16, m20, m24, m30, m36, m42, m48, m56, m64 :: Field a => MNut a ++m1_6 = MNut 1.6 0.35 3.2 3.02 1.3 1.05+m2 = MNut 2 0.4 4 3.82 1.6 1.35+m2_5 = MNut 2.5 0.45 5 4.82 2 1.75+m3 = MNut 3 0.5 5.5 5.32 2.4 2.15+m4 = MNut 4 0.7 7 6.78 3.2 2.9+m5 = MNut 5 0.8 8 7.78 4.7 4.4+m6 = MNut 6 1 10 9.78 5.2 4.9+m8 = MNut 8 1.25 13 12.73 6.8 6.44+m10 = MNut 10 1.5 16 15.73 8.4 8.04+m12 = MNut 12 1.75 18 17.73 10.8 10.37+m14 = MNut 14 2 21 20.67 12.8 12.1+m16 = MNut 16 2 24 23.67 14.8 14.1+m20 = MNut 20 2.5 30 29.16 18 16.9+m24 = MNut 24 3 36 35 21.5 20.2+m30 = MNut 30 3.5 46 45 25.6 24.3+m36 = MNut 36 4 55 53.8 31 29.4+m42 = MNut 42 4.5 65 63.1 34 32.4+m48 = MNut 48 5 75 73.1 38 36.4+m56 = MNut 56 5.5 85 82.8 45 43.4+m64 = MNut 64 6 95 92.8 51 49.1++++metricNutProfile :: Floating a => Module a a => Show a => Field a => MNut a -> a -> Part '[] V2' a+metricNutProfile nut tol = scale flat2flat $ regularPolygonO 6+ where flat2flat = mMaxFlatsDist nut + tol++metricBoltProfile :: Floating a => Module a a => Show a => Field a => MNut a -> a -> Part '[] V2' a+metricBoltProfile m tol = scale (mSize m + tol) $ circle++metricNutSocket :: (Floating a, Show a, Module a a, Field a) => MNut a -> a -> a -> a -> Part3 xs a -> Part3 xs a+metricNutSocket m tol recess depth = push recess (metricNutProfile m tol) . push depth (metricBoltProfile m tol)+
+ HCad/Part.hs view
@@ -0,0 +1,721 @@+{-# LANGUAGE ViewPatterns #-}+{-# LANGUAGE LambdaCase #-}+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE TypeInType #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE RecordWildCards #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE DeriveTraversable #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE PatternSynonyms #-}+{-# LANGUAGE RebindableSyntax #-}+module HCad.Part where++import Algebra.Linear+import Algebra.Classes+import Algebra.Category+import Prelude hiding (Num(..),(/),divMod,div,recip,fromRational, (.), mod, id)+import Data.Foldable+import GHC.TypeLits+import Data.List (intercalate)+import Data.Kind (Type)+import Data.Type.Equality+import Unsafe.Coerce+import Data.Char (toLower)+import qualified Data.Set as Set++data SCAD = SCAD {scadPrim :: String+ ,scadArgs :: [(String,String)]+ ,scadBody :: [SCAD]}++newtype Sq4 a = Sq4 (SqMat V4' a)++instance Functor Sq4 where+ fmap f (Sq4 m) = Sq4 (f >$< m)++instance Foldable Sq4 where+ foldMap f (Sq4 (Mat v)) = foldMap (foldMap f) v++data Op = Union | Intersection | Hull deriving Show+data DSC vec a where+ Polygon :: Int -> [V2 a] -> DSC V2' a+ Polyhedron :: Int -> [V3 a] -> [[Int]] -> DSC V3' a+ Prim :: SCAD -> DSC vec a+ Color :: Double -> V3 s -> DSC vec s -> DSC vec s+ NOp :: Op -> [DSC vec a] -> DSC vec a+ Difference :: DSC vec a -> DSC vec a -> DSC vec a+ MultMat :: Sq4 a -> DSC vec a -> DSC vec a+ LExtrude :: a -> a -> a -> DSC V2' a -> DSC V3' a+ RExtrude :: Maybe Int -> a -> DSC V2' a -> DSC V3' a+ Mirror :: Euclid v a -> DSC v a -> DSC v a++deriving instance Foldable vec => Foldable (DSC vec)++type V4' = VNext V3'++difference' :: DSC vec a -> DSC vec a -> DSC vec a+difference' (Difference a b) c = Difference a (unions' [b,c])+difference' x y = Difference x y++pattern Uni :: forall vec a. [DSC vec a] -> DSC vec a+pattern Uni xs = NOp Union xs++unions' :: [DSC vec a] -> DSC vec a+unions' xs = Uni (unions'' xs)+unions'' :: [DSC vec a] -> [DSC vec a]+unions'' [] = []+unions'' (Uni xs:ys) = unions'' (xs++ys)+unions'' (x:xs) = x:unions'' xs++-- | add one dimension to the argument (the extra dimension is "diagonal")+addOneMat :: (Ring s, Applicative v, Applicative v) => Mat s v v -> Mat s (VNext v) (VNext v)+addOneMat (Mat vs) = Mat (VNext (VNext <$> vs <*> pure zero) (VNext (pure zero) one)) ++homMat :: ScadV v => Applicative v => Functor v => Ring s => SqMat v s -> SqMat V4' s+homMat = addOneMat . conv3dMat++-- | translation as a matrix transforming homogeneous vectors+translateToMat :: (Traversable v, Ring s, Applicative v) => Euclid v s -> SqMat (VNext v) s+translateToMat (Euclid v) = Mat (VNext (VNext <$> i <*> v) (VNext (pure zero) one))+ where Mat i = identity++instance ScadV V2' where+ conv3dVec (Euclid v) = Euclid (VNext v zero)+ conv3dMat = addOneMat++instance ScadV V3' where+ conv3dVec = id+ conv3dMat = id++class (Traversable v, Applicative v) => ScadV v where+ conv3dVec :: Additive a => Euclid v a -> Euclid V3' a+ conv3dMat :: Ring a => SqMat v a -> SqMat V3' a++translate' :: ScadV vec => Traversable vec => Ring a => Applicative vec => Euclid vec a -> DSC vec a -> DSC vec a+translate' v = multmat'' (translateToMat $ conv3dVec v)++multmat' :: ScadV vec => Ring a => Traversable vec => Applicative vec => SqMat vec a -> DSC vec a -> DSC vec a+multmat' = multmat'' . homMat++multmat'' :: Ring a => Traversable vec => Applicative vec => SqMat V4' a -> DSC vec a -> DSC vec a+multmat'' v (Color a c t) = Color a c (multmat'' v t)+multmat'' v (NOp op ts) = NOp op (multmat'' v <$> ts)+multmat'' v (Difference t u) = Difference (multmat'' v t) (multmat'' v u)+multmat'' v (MultMat (Sq4 v') t) = MultMat (Sq4 (v . v')) t+multmat'' v t = MultMat (Sq4 v) t++convexity :: DSC vec a -> Int+convexity = \case+ (Difference x y) -> convexity x + convexity y+ (MultMat _ r) -> convexity r+ (LExtrude _ _ _ r) -> convexity r+ (Polygon convex _) -> convex+ (Polyhedron convex _ _) -> convex+ (Prim _) -> 2+ (Color _ _ r) -> convexity r+ (NOp Hull _) -> 2+ (NOp Intersection rs) -> maximum (map convexity rs)+ (NOp _ rs) -> sum (map convexity rs)+ Mirror _ r -> convexity r+ RExtrude {} -> 10++toSCAD :: Foldable vec => Functor vec => Floating a => Field a => Show a => DSC vec a -> SCAD+toSCAD = \case+ Mirror normal r -> SCAD "mirror" [("v",renderVec normal)] [toSCAD r]+ RExtrude fn angle partCode ->+ SCAD "rotate_extrude" ([("angle",showAngle angle)] ++ [("$fn",show x) | Just x <- [fn]]) [toSCAD partCode]+ (LExtrude height scaleFactor twist partCode) ->+ (SCAD "linear_extrude"+ [("height",show height)+ ,("center","true")+ ,("convexity",show (convexity partCode))+ ,("scale",show scaleFactor)+ ,("twist",showAngle twist)] [toSCAD partCode])+ MultMat (Sq4 m) r -> SCAD "multmatrix" [("m",m')] [toSCAD r]+ where m' = showL (toList (showL . toList . (fmap show) <$> fromMat m))+ Polygon _ points -> SCAD "polygon" [("points",showL (map renderVec points))] []+ Polyhedron _ points faces -> SCAD "polyhedron" [("points",showL (map renderVec points))+ ,("faces",showL $ map (showL . map show) $ faces)] []+ Prim p -> p+ NOp op rs -> SCAD (map toLower $ show op) [] (map toSCAD rs)+ Difference r1 r2 -> SCAD "difference" [] [toSCAD r1, toSCAD r2]+ Color a c r -> SCAD "color" [("c",renderVec c),("alpha",show a)] [toSCAD r]++data Part xs vec a+ = Part {partVertices :: NamedVec xs (Euclid vec a) -- TODO: use Loc here+ ,partBases :: NamedVec xs (SqMat vec a)+ ,partCode :: DSC vec a }++type Part3 xs a = Part xs V3' a+type Part2 xs a = Part xs V2' a++type family (++) (a::[k]) (b::[k]) where+ '[] ++ a = a+ (x ': xs) ++ ys = x ': (xs ++ ys)++unitR :: xs :~: (xs ++ '[])+unitR = unsafeCoerce Refl++(#>) :: a :~: b -> (a ~ b => k) -> k+Refl #> k = k+infixr 0 #>++infixr ++*+(++*) :: NamedVec xs v -> NamedVec ys v -> NamedVec (xs ++ ys) v+Nil ++* ys = ys+(x :* xs) ++* ys = x :* xs ++* ys++type FieldName = [Symbol]++data NamedVec (fields::[FieldName]) vec where+ Nil :: NamedVec '[] vec+ (:*) :: vec -> NamedVec xs vec -> NamedVec (x ': xs) vec++infixr :*+++class KnownLen xs where+ repet :: a -> NamedVec xs a+ appl :: NamedVec xs (a -> b) -> NamedVec xs a -> NamedVec xs b++instance KnownLen '[] where+ repet _ = Nil+ appl _ _ = Nil+++instance KnownLen xs => KnownLen (x ': xs) where+ repet x = x :* repet x+ (f :* fs) `appl` (a :* as) = f a :* (fs `appl` as)++instance KnownLen xs => Applicative (NamedVec xs) where+ pure = repet+ (<*>) = appl++-- instance (Additive vec, KnownLen xs) => Additive (NamedVec xs vec) where+-- zero = repet zero+-- v1 + v2 = (+) <$> v1 <*> v2+-- instance (AbelianAdditive vec, KnownLen xs) => AbelianAdditive (NamedVec xs vec)+-- instance Module s vec => Module s (NamedVec xs vec)++deriving instance (Functor (NamedVec faces))+deriving instance (Foldable (NamedVec faces))+deriving instance (Traversable (NamedVec faces))++class (∈) (x :: FieldName) (xs :: [FieldName]) where+ getField :: NamedVec xs a -> a++instance {-# OVERLAPPING #-} x ∈ (x ': xs) where+ getField (x :* _) = x++instance {-# OVERLAPPING #-} x ∈ xs => x ∈ (y ': xs) where+ getField (_y :* xs) = getField @x xs++class (⊆) (xs :: [FieldName]) (ys :: [FieldName]) where+ filterVec :: NamedVec ys a -> NamedVec xs a++instance {-# OVERLAPPING #-} xs ⊆ ys => xs ⊆ (x ': ys) where+ filterVec (_ :* xs) = filterVec xs++instance {-# OVERLAPPING #-} xs ⊆ ys => (x ': xs) ⊆ (x ': ys) where+ filterVec (x :* xs) = x :* filterVec xs++instance {-# OVERLAPPING #-} '[] ⊆ '[] where+ filterVec Nil = Nil++getBase :: forall x xs v a. x ∈ xs => Part xs v a -> SqMat v a+getBase = getField @x . partBases++getVertex :: forall x xs v a. x ∈ xs => Part xs v a -> Euclid v a+getVertex = getField @x . partVertices++getLoc :: forall x xs v a. x ∈ xs => RelLoc xs v a+getLoc p = Loc (getVertex @x p) (getBase @x p)++class KnownD v where+ is3d :: Bool++-------------------------------------------+-- Primitive ops++type family SimpleFields x where+ SimpleFields '[] = '[]+ SimpleFields ( x ': xs) = '[x] ': SimpleFields xs++type family MapCons x xs where+ MapCons _ '[] = '[]+ MapCons x ( y ': ys) = ( (x ': y) ': MapCons x ys )++nameVec :: forall x xs vec. NamedVec xs vec -> NamedVec (MapCons x xs) vec+nameVec Nil = Nil+nameVec (a :* as) = (a :* nameVec @x as)+++name :: forall x xs vec a. Part xs vec a -> Part (MapCons x xs) vec a+name (Part {..}) = Part{partVertices = nameVec @x partVertices+ ,partBases = nameVec @x partBases+ ,..}++weaken :: ys ⊆ xs => Part xs vec a -> Part ys vec a+weaken (Part {..}) = Part{partVertices = filterVec partVertices+ ,partBases = filterVec partBases+ ,..}++forget :: Part xs vec a -> Part '[] vec a+forget Part{..} = Part {partBases=Nil,partVertices=Nil,..}++meshImport :: String -> Part3 '[] a+meshImport fname = Part {partBases=Nil+ ,partVertices=Nil+ ,partCode= Prim (SCAD "import" [("file",show fname)] [])}+++color' :: (Show s) => Double -> V3 s -> Part xs vec s -> Part xs vec s+color' a c Part{..} = Part {partCode = Color a c partCode+ ,..}++color :: (Show s) => V3 s -> Part xs vec s -> Part xs vec s+color = color' 1++cube :: Show a => Floating a => Field a+ => Part '[ '["bottom"], '["top"], '["right"], '["back"],+ '["left"], '["front"], '["northEast"], '["northWest"],+ '["southWest"], '["southEast"]] V3' a+cube = extrude one square++sphere :: Part3 '[] a+sphere = Part {partVertices = Nil, partBases = Nil+ ,partCode = Prim (SCAD "sphere" [("r","0.5")] [])}++square :: forall a. Module a a => Floating a => Show a => Field a + => Part2 (SimpleFields '[East, North, West, South, "northEast", "northWest", "southWest", "southEast"]) a+square = Part {partVertices = matVecMul <$> partBases <*> (V2 <$> scales <*> pure 0)+ ,partCode = Prim (SCAD "square" [("size","1"),("center","true")] [])+ ,..}+ where partBases = rotation2d <$> angles+ scales = 0.5 :* 0.5 :* 0.5 :* 0.5 :* sqrt 0.5 :* sqrt 0.5 :* sqrt 0.5 :* sqrt 0.5 :* Nil+ angles = (pi *) <$> (0 :* 0.5 :* 1 :* 1.5 :* 0.25 :* 0.75 :* 1.25 :* 1.75 :* Nil)++rectangle :: (Field s, Show s, Module s s, Floating s) =>+ Euclid V2' s+ -> Part+ '[ '["right"], '["back"], '["left"], '["front"], '["northEast"],+ '["northWest"], '["southWest"], '["southEast"]]+ V2'+ s+rectangle sz = scale' sz square++circle :: Part2 '[] a+circle = Part {partVertices = Nil, partBases = Nil+ ,partCode = Prim (SCAD "circle" [("r","0.5")] [])}++polygon' :: Show a => Int -> [V2 a] -> Part2 '[] a+polygon' convex points+ = Part {partVertices = Nil+ ,partBases = Nil+ ,partCode = Polygon convex points}++polygon :: Show a => [V2 a] -> Part2 '[] a+polygon = polygon' 2++tessalateFace :: [a] -> [[a]]+tessalateFace [x,y,z] = [[x,y,z]]+tessalateFace (a:b:c:vs) = [a,b,c]:tessalateFace (a:c:vs)++-- | List of faces. Points in a faces must be coplanar, and going+-- clockwise when looking from outside. Faces must form a closed polyhedron.+polyhedron :: Ord a => [[V3 a]] -> Part3 '[] a+polyhedron faces = Part {partVertices=Nil, partBases=Nil,partCode = Polyhedron 1 (toList vertices) faces'}+ where vertices = Set.fromList (concat faces)+ faces' = concatMap tessalateFace $ map (map (flip Set.findIndex vertices)) $ faces++extrude :: forall a xs. Field a => Floating a => Module a a => Show a+ => a -> Part2 xs a -> Part3 (SimpleFields '[Nadir,Zenith] ++ xs) a+extrude height p = extrudeEx height 1 0 p+++extrudeEx :: forall a xs. Floating a => Field a => Module a a => Show a+ => a -> a -> a -> Part2 xs a -> Part3 (SimpleFields '[Nadir,Zenith] ++ xs) a+extrudeEx height scaleFactor twist Part{..}+ = Part {partVertices = (flip matVecMul (V3 0 0 (0.5 * height)) <$> botTopBases) ++* (z0 <$> partVertices)+ ,partBases = botTopBases ++* (conv <$> partBases)+ ,partCode = LExtrude height scaleFactor twist partCode+ }+ where botTopBases = flip rotation3d (V3 1 0 0) <$> angles+ angles = pi :* zero :* Nil+ z0 (V2 x y) = (V3 x y zero)+ zz0 (Mat2x2 a b c d) =+ Mat3x3 a b 0+ c d 0+ 0 0 1+ zToX = Mat3x3 0 0 1+ 0 1 0+ (-1) 0 0+ conv m = zz0 m . zToX . transpose (zz0 m)++lathe :: (Show a, Field a, Floating a) => Part2 xs a -> Part3 '[] a+lathe = latheEx Nothing (2*pi)++latheEx :: (Show a, Division a, Floating a) => Maybe Int -> a -> Part2 xs a -> Part3 '[] a+latheEx fn angle Part{..} =+ Part {partVertices = Nil,+ partBases = Nil,+ partCode = RExtrude fn angle partCode+ }+++flattenUnions :: [SCAD] -> [SCAD]+flattenUnions (SCAD "union" [] xs:ys) = xs ++ flattenUnions ys+flattenUnions (x:xs) = x:flattenUnions xs+flattenUnions [] = []++mkUnion :: [SCAD] -> SCAD+mkUnion xs = SCAD "union" [] (flattenUnions xs)++(/+) :: Part xs v a -> Part ys v a -> Part (xs ++ ys) v a+(/+) p1 p2 = Part {partVertices = partVertices p1 ++* partVertices p2+ ,partBases = partBases p1 ++* partBases p2+ ,partCode = unions' [partCode p1,partCode p2]}+union :: Part ys v a -> Part xs v a -> Part (xs ++ ys) v a+union = flip (/+)++unions :: [Part xs v a] -> Part '[] v a+unions ps = Part {partVertices = Nil+ ,partBases = Nil+ ,partCode = unions' (map partCode ps)}++intersection :: Part ys v a -> Part xs v a -> Part (xs ++ ys) v a+intersection p2 p1 = Part {partVertices = partVertices p1 ++* partVertices p2+ ,partBases = partBases p1 ++* partBases p2+ ,partCode = NOp Intersection [partCode p1,partCode p2]}++hull :: Part ys v a -> Part xs v a -> Part (xs ++ ys) v a+hull p2 p1 = Part {partVertices = partVertices p1 ++* partVertices p2+ ,partBases = partBases p1 ++* partBases p2+ ,partCode = NOp Hull [partCode p1,partCode p2]}++hulls :: [Part xs v a] -> Part '[] v a+hulls ps = Part {partVertices = Nil+ ,partBases = Nil+ ,partCode = NOp Hull (map partCode ps)}++(/-) :: Part xs v a -> Part ys v a -> Part (xs ++ ys) v a+(/-) p1 p2 = Part {partVertices = partVertices p1 ++* partVertices p2+ ,partBases = partBases p1 ++* partBases p2+ ,partCode = difference' (partCode p1) (partCode p2)}++++difference :: Part ys v a -> Part xs v a -> Part (xs ++ ys) v a+difference = flip (/-)++translate :: forall (v :: Type -> Type) s xs. ScadV v => Ring s => Traversable v => Additive s => Applicative v => Foldable v => Show s => Euclid v s -> Part xs v s -> Part xs v s+translate v Part{..} = Part {partBases = partBases+ ,partVertices = (v +) <$> partVertices+ ,partCode = translate' v partCode+ }++rotate :: ScadV v => Traversable v => Applicative v => Show s => Floating s => Division s => Module s s => Ring s => SqMat v s -> Part xs v s -> Part xs v s+rotate m Part{..} = Part {partVertices = matVecMul m <$> partVertices+ ,partBases = (m .) <$> partBases+ ,partCode = multmat' m partCode}+++mirror :: forall a v xs. Applicative v => Field a => Ring a => Foldable v => Show a => Euclid v a -> Part xs v a -> Part xs v a+mirror normal Part{..}+ = Part {partBases = mm <$> partBases+ ,partVertices = m <$> partVertices+ ,partCode = Mirror normal partCode}+ where m :: Euclid v a -> Euclid v a+ m x = x - (fromInteger 2 * d) *^ normal+ where d = normal · x+ m' :: v a -> v a+ m' = fromEuclid . m . Euclid+ mm :: SqMat v a -> SqMat v a+ mm = Mat . fmap m' . fromMat++scale' :: ScadV v => (Field s,Show s) => Euclid v s -> Part xs v s -> Part xs v s+scale' v Part{..} = Part {partBases = partBases -- FIXME: shear the base!+ ,partVertices = (v ⊙) <$> partVertices+ ,partCode = multmat' (diagonal v) partCode }++scale :: (ScadV v, Field s, Show s) => s -> Part xs v s -> Part xs v s+scale s = scale' (pure s)++------------------------------------------------+-- Locations and relative locations++data Loc v a = Loc {locPoint :: Euclid v a, locBase :: SqMat v a}++locNormal :: Ring a => Loc V3' a -> Euclid V3' a+locNormal = flip matVecMul (V3 zero zero one) . locBase++-- | Origin point with normal pointing to 'Zenith'.+origin :: Ring a => Loc V3' a+origin = Loc {locPoint = zero, locBase = identity}++type RelLoc xs v a = Part xs v a -> Loc v a++-- | Put the focus point on the given point (not changing the focused+-- direction)+at :: Ring s => (ScadV v, Show s) => (RelLoc xs v s) -> (Part xs v s -> Part ys v s) -> (Part xs v s -> Part ys v s)+at relLoc f body = translating (locPoint (relLoc body)) f body++translating :: ScadV v => Ring s => Show s =>+ Euclid v s+ -> (Part xs1 v s -> Part xs2 v s)+ -> Part xs1 v s+ -> Part xs2 v s+translating delta f = translate delta . f . translate (negate delta)++-- -- | Put the focus point over or under the given point (so, leaving+-- -- z-coordinate unchanged)+-- atXY :: (Show s, Division s, Module s s) =>+-- (Part xs (V3 s) -> Loc (V3 s))+-- -> (Part xs (V3 s) -> Part ys (V3 s))+-- -> Part xs (V3 s)+-- -> Part ys (V3 s)+-- atXY f = at (projectOnPlane origin . f)+++rotating :: ScadV v => (Show s, Floating s, Field s, Module s s) =>+ SqMat v s+ -> (Part xs1 v s -> Part xs2 v s)+ -> Part xs1 v s+ -> Part xs2 v s+rotating o f = rotate o . f . rotate (transpose o)++-- | Put the focus point on the given locus+on :: ScadV v => Division a => Module a a => Floating a => Field a => Show a+ => RelLoc xs v a -> (Part xs v a -> Part ys v a) -> (Part xs v a -> Part ys v a)+on relLoc f body = translating locPoint (rotating locBase f) body+ where Loc{..} = relLoc body++-- | Center the given location+center :: ScadV v => Ring a => Show a => RelLoc xs v a -> Part xs v a -> Part xs v a+center getX p = translate (negate (locPoint (getX p))) p++-- | Shift and rotate part to the given location+withLoc :: Floating a => Show a => Field a => ScadV v => Loc v a -> Part xs v a -> Part xs v a+withLoc Loc{..} = translate locPoint . rotate locBase++------------------------------------------------+-- Non-primitive ops++rotate2d :: (Show s, Floating s, Field s) =>+ s -> Part xs V2' s -> Part xs V2' s+rotate2d angle = rotate (rotation2d angle)++xAxis, yAxis, zAxis :: Ring a => V3 a+xAxis = V3 one zero zero+yAxis = V3 zero one zero+zAxis = V3 zero zero one+++mirrored :: forall v a xs. Module a a => Field a => Applicative v => (Foldable v, Show a) => Euclid v a -> Part xs v a -> Part xs v a+mirrored axis part = unitR @xs #> union (forget $ mirror axis part) part++mirroring :: (Applicative v, Field a, Module a a, Foldable v, Show a) =>+ Euclid v a -> (Part xs v a -> Part xs v a) -> Part xs v a -> Part xs v a+mirroring axis f = mirror axis . f . mirror axis . f++-- | Regular polygon contained a unit-diameter circle.+regularPolygon :: Field a => Module a a => Division a => Floating a => Show a => Int -> Part2 '[] a+regularPolygon order = scale 0.5 (polygon coords)+ where coords=[V2 (cos th) (sin th)+ | i <- [0..order-1],+ let th = fromIntegral i*(2.0*pi/fromIntegral order) ];++-- | Regular polygon containing a unit-diameter circle.+regularPolygonO :: Field a => Module a a => Division a => Floating a => Show a => Int -> Part2 '[] a+regularPolygonO order = scale (1 / cos (pi / fromIntegral order)) $ regularPolygon order++epsilon :: Field a => a+epsilon = 0.001++rectangleWithChamferCorners :: Floating a => Show a => Field a => a -> Euclid V2' a -> Part ('[ '["right"], '["back"], '["left"], '["front"],+ '["northEast"], '["northWest"], '["southWest"],+ '["southEast"]]) V2' a+rectangleWithChamferCorners r sz@(V2 w h) = rect {partCode = code}+ where rect = rectangle sz + code = partCode $+ mirrored (V2 1 0) $+ mirrored (V2 0 1) $+ polygon [V2 (-epsilon) (-epsilon), V2 (-epsilon) (h/2), V2 (w/2-r) (h/2), V2 (w/2) (h/2-r), V2 (w/2) (-epsilon) ]+++rectangleWithRoundedCorners :: Floating a => Show a => Field a => a -> Euclid V2' a -> Part ('[ '["right"], '["back"], '["left"], '["front"],+ '["northEast"], '["northWest"], '["southWest"],+ '["southEast"]]) V2' a+rectangleWithRoundedCorners r sz@(V2 w h) =+ mirrored (V2 1 0) $+ mirrored (V2 0 1) $+ union (translate (V2 (w/2-r) (h/2-r)) $ scale (2*r) $ circle) $+ rectangleWithChamferCorners r sz+++-- | A circle with an angular top. The argument is the top angle; often pi/2 or pi/3+waterdrop :: Field a => (Division a, Group a, Floating a, Show a) => a -> Part2 '[] a+waterdrop alpha = union circle (scale 0.5 $ polygon [V2 c s, V2 0 (1/s), V2 (-c) s])+ where s = sin alpha+ c = cos alpha++-- | Create a mortise+push :: forall xs ys a. Floating a => Show a => Ring a => Field a => a -> Part2 ys a -> (Part3 xs a -> Part3 xs a)+push depth shape =+ unitR @xs #> (difference $ forget $ + translate (V3 zero zero (epsilon - 0.5 * depth)) (extrude (depth+2*epsilon) shape))+ where epsilon :: a+ epsilon = 0.05++-- | Create a tenon+pull :: forall xs ys a. Module a a => Floating a => Show a => Field a => a -> Part2 ys a -> (Part3 xs a -> Part3 xs a)+pull depth shape = unitR @xs #> union $ forget $ translate (V3 0 0 (0.5 * depth - epsilon)) (extrude depth shape)+ where epsilon :: a+ epsilon = 0.05++cone' :: (Floating a, Field a, Module a a, Show a) => a -> Part3 '[ '["bottom"], '["top"]] a+cone' angle = (extrudeEx c 0 0 circle)+ where c = sin angle++counterSink :: forall xs a.+ (Floating a, Show a, Module a a, Field a)+ => a -> a -> Part3 xs a -> Part3 xs a+counterSink angle diameter = unitR @xs #> difference (forget negative) where+ negative = translate (V3 0 0 epsilon) $ center nadir $ rotate (rotation3d pi (V3 1 0 0)) (scale diameter $ cone' angle)+ epsilon = 0.05++----------------------------------+-- Filling++linearRepeat' :: ScadV v => Ring s => Show s =>+ Int -> [Euclid v s] -> Part xs v s -> Part '[] v s+linearRepeat' number intervals part =+ unions [translate (mult (fromIntegral k) (intervals !! k) ++ mult (fromIntegral j) (add intervals)) part+ | i <- [negate number `div` 2..number `div` 2],+ let (j,k) = i `divMod` length intervals+ ]++linearRepeat :: forall s v xs. ScadV v => Show s => Field s =>+ Int -> Euclid v s -> Part xs v s -> Part '[] v s+linearRepeat number interval part =+ unions [translate ((shift + mult (fromIntegral i) interval)) part | i <- [negate number `div` 2..number `div` 2]]+ where shift = if number `mod` 2 == 1 then (fromRational 0.5::s) *^ interval else zero++linearFill :: (ScadV v, Show s, RealFrac s, Floating s, Field s, Ring s) =>+ s -> Euclid v s -> Part xs v s -> Part '[] v s+linearFill len interval part = linearRepeat (floor (len / norm interval)) interval part++-- | Fill a rectangle in hexagonal pattern+hexagonFill :: Module Int s => RealFrac s => Floating s => Show s => Field s => Module s s+ => s -> s -> s+ -> Part2 xs s+ -> Part2 ('[ '["right"], '["back"], '["left"], '["front"],+ '["northEast"], '["northWest"], '["southWest"],+ '["southEast"]] :: [[Symbol]]) s+hexagonFill len width cell_size shape+ = intersection (scale' (V2 len width) square) $+ linearRepeat' no_of_rows (V2 tr_x <$> [negate tr_y, tr_y]) $+ linearFill (width + cell_size) (V2 0 cell_size) $ -- width + cell_size: we need a bit larger area because of the tr_y offsets+ shape+ where no_of_rows = floor(1.2 * len / cell_size)+ tr_x = sqrt(3)/2 * cell_size+ tr_y = cell_size / 2+++--------------------------------------+-- Locations++south :: '[South] ∈ xs => RelLoc xs v a; south = getLoc @'[South]+north :: '[North] ∈ xs => RelLoc xs v a; north = getLoc @'[North]+west :: '[West] ∈ xs => RelLoc xs v a; west = getLoc @'[West]+east :: '[East] ∈ xs => RelLoc xs v a; east = getLoc @'[East]+nadir :: '[Nadir] ∈ xs => RelLoc xs v a; nadir = getLoc @'[Nadir]+zenith :: '[Zenith] ∈ xs => RelLoc xs v a; zenith = getLoc @'[Zenith]++southEast :: '["southEast"] ∈ xs => RelLoc xs v a; southEast = getLoc @'["southEast"]+northEast :: '["northEast"] ∈ xs => RelLoc xs v a; northEast = getLoc @'["northEast"]+southWest :: '["southWest"] ∈ xs => RelLoc xs v a; southWest = getLoc @'["southWest"]+northWest :: '["northWest"] ∈ xs => RelLoc xs v a; northWest = getLoc @'["northWest"]+++projectOnPlane :: (Module scalar scalar, Field scalar) =>+ Loc V3' scalar -> Loc V3' scalar -> Loc V3' scalar+projectOnPlane plane@Loc {locPoint = planeOrigin}+ Loc {..} = Loc {locPoint = position, locBase = locBase}+ where θ = (planeOrigin - locPoint) · planeNormal+ position = θ *^ planeNormal + locPoint+ planeNormal = locNormal plane+ -- equation : (position - planeOrigin) · planeNormal = 0++(|<-) :: (Module scalar scalar, Field scalar)+ => (t -> Loc V3' scalar) -> (t -> Loc V3' scalar) -> t -> Loc V3' scalar+(plane |<- pos) p = projectOnPlane (plane p) (pos p)+infixr |<-++projectOnLine :: (Module scalar scalar, Field scalar) =>+ Loc V3' scalar -> Loc V3' scalar -> Loc V3' scalar+projectOnLine line@Loc {locPoint = lineOrigin}+ Loc {..} = Loc {locPoint = position, locBase = locBase}+ where cosθ = (locPoint - lineOrigin) · lineVec+ position = lineOrigin + cosθ *^ lineVec+ lineVec = locNormal line++(/<-) :: (Module scalar scalar, Field scalar) =>+ (t -> Loc V3' scalar)+ -> (t -> Loc V3' scalar) -> t -> Loc V3' scalar+(line /<- pos) p = projectOnLine (line p) (pos p)+++projectOnPoint :: (Module scalar scalar, Field scalar) =>+ Loc V3' scalar -> Loc V3' scalar -> Loc V3' scalar+projectOnPoint Loc {locPoint = lineOrigin}+ Loc {..} = projectOnLine Loc {locBase=locBase, locPoint=lineOrigin} Loc {..}++(.<-) :: (Module scalar scalar, Field scalar) =>+ (t -> Loc V3' scalar)+ -> (t -> Loc V3' scalar) -> t -> Loc V3' scalar+(line .<- pos) p = projectOnPoint (line p) (pos p)++-- yxPoint :: V2 a -> V2 a -> V2 a+-- yxPoint (V2 _ y) (V2 x _) = V2 x y++-- yxLoc :: (t -> Loc V2' a) -> (t -> Loc V2' a) -> t -> Loc V2' a+-- yxLoc f g p = Loc (yxPoint (locPoint y) (locPoint x)) (yxPoint (locBase y) (locBase x))+-- where y = f p+-- x = g p+++type East = "right"+type West = "left"+type North = "back"+type South = "front"+type Zenith = "top"+type Nadir = "bottom"++++-------------------------------------+-- Rendering++renderVec :: (Show a, Foldable t) => t a -> String+renderVec v = showL (map show (toList v))++showL :: [String] -> String+showL v = "[" <> intercalate ", " v <> "]"++showAngle :: Show a => Field a => Floating a => a -> String+showAngle x = show (x * (180 / pi))+
+ HCad/Part/Extensions.hs view
@@ -0,0 +1,49 @@+{-# LANGUAGE FlexibleContexts #-}+{-# LANGUAGE TypeInType #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE RecordWildCards #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE DeriveTraversable #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE ScopedTypeVariables #-}+{-# LANGUAGE PartialTypeSignatures #-}++module HCad.Part.Extensions where++import HCad.Part+import Algebra.Linear+import Algebra.Classes hiding (normalize)+import Algebra.Category+import Prelude hiding (Num(..),(/),divMod,div,recip,fromRational, (.), mod, id)++-- | Extrude a shape along a givent segment. The y axis of the shape+-- will align with the upwards direction given. This function may+-- crash if the segment is itself too well aligned with the segment.+extrudeAlongSegment :: (Show a,Floating a, Field a)+ => Part xs V2' a -- ^ shape+ -> V3 a -- ^ upwards direction+ -> (V3 a, V3 a) -- ^ segment+ -> Part (SimpleFields '[Nadir,Zenith] ++ xs) V3' a+extrudeAlongSegment shape upDir (start,end) = translate start $ rotate r $ center nadir $ extrude l shape+ where r = transpose $ Mat (fromEuclid <$> (V3' x' (x' × z') z'))+ l = norm d+ d = end-start+ z' = normalize d+ x' = normalize (upDir × z')+-- >>> main++-- | Apply 'extrudeAlongSegment' on several segments+extrudeAlongSegments :: (Show a, Floating a, Field a)+ => Part xs V2' a -> V3 a -> [(V3 a, V3 a)] -> Part '[] V3' a+extrudeAlongSegments shape upDir = unions . map (extrudeAlongSegment shape upDir)
+ HCad/SCAD.hs view
@@ -0,0 +1,73 @@+{-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE PolyKinds #-}+{-# LANGUAGE RecordWildCards #-}+{-# LANGUAGE GeneralizedNewtypeDeriving #-}+{-# LANGUAGE AllowAmbiguousTypes #-}+{-# LANGUAGE DeriveTraversable #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE GADTs #-}+{-# LANGUAGE TypeApplications #-}+{-# LANGUAGE StandaloneDeriving #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE DataKinds #-}+{-# LANGUAGE KindSignatures #-}+{-# LANGUAGE RankNTypes #-}+{-# LANGUAGE ScopedTypeVariables #-}+module HCad.SCAD where++import HCad.Part+import HCad.Expr+import Data.List (intercalate, nub)+-- import Algebra.Linear+import Data.Set (Set)+import qualified Data.Set as Set+data Options = Options {optFn :: Int}++defaultOptions :: Options+defaultOptions = Options {optFn = 10}++render :: Functor v => Foldable v => Options -> Part xs v Double -> String+render Options{..} p = unlines (("$fn="++show optFn++";"):+ renderCode (toSCAD $ partCode p)+++ [";"])++renderP :: Functor v => Foldable v => Options -> Part xs v Expr -> String+renderP Options{..} p = unlines (("$fn="++show optFn++";"):+ concat [["// " ++ paramComment+ ,paramName ++ " = " ++ show paramDefault ++ "; "+ ++ "// " ++ v (paramPossible)]+ | Parameter{..} <- Set.toList ps ] +++ renderCode (toSCAD $ partCode p) +++ [";"])+ where ps :: Set Parameter+ ps = foldMap params (partCode p)+ v (PRange lo hi) = "["++show lo++":"++ show hi ++"]"+ v (PSet vals) = show vals+++renderCode :: SCAD -> [String]+renderCode (SCAD fname args body)+ -- | fname == "union" = rbody+ | otherwise = (fname <>"(" <> (intercalate ", " [pname <> "=" <> arg+ | (pname,arg) <- args]) <> ")") `app` rbody+ where rbody = case body of+ [] -> []+ [x] -> renderCode x+ xs -> "{" : fmap indent (concatMap (semicolon . renderCode) xs) ++ "}" : []++ indent xs = " " ++ xs+ semicolon [] = error "semicolon: empty"+ semicolon xs = init xs ++ [last xs ++ ";"]+ x `app` (y : ys) = (x<>y) : ys+ app x [] = [x]++++-- tst :: Part3 '[] Double+-- tst = forget $ mirror (V3 (sin (pi/6)) (cos (pi/6)) 0) $ translate (V3 20 0 0) $ on zenith (union $ translate (V3 0 2.5 0) $ scale 5 $ cube) $ scale 10 cube++-- main :: IO ()+-- main = writeFile "tst.scad" $ render defaultOptions tst++-- >>> main
+ LICENSE view
@@ -0,0 +1,674 @@+ GNU GENERAL PUBLIC LICENSE+ Version 3, 29 June 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>+ Everyone is permitted to copy and distribute verbatim copies+ of this license document, but changing it is not allowed.++ Preamble++ The GNU General Public License is a free, copyleft license for+software and other kinds of works.++ The licenses for most software and other practical works are designed+to take away your freedom to share and change the works. By contrast,+the GNU General Public License is intended to guarantee your freedom to+share and change all versions of a program--to make sure it remains free+software for all its users. We, the Free Software Foundation, use the+GNU General Public License for most of our software; it applies also to+any other work released this way by its authors. You can apply it to+your programs, too.++ When we speak of free software, we are referring to freedom, not+price. Our General Public Licenses are designed to make sure that you+have the freedom to distribute copies of free software (and charge for+them if you wish), that you receive source code or can get it if you+want it, that you can change the software or use pieces of it in new+free programs, and that you know you can do these things.++ To protect your rights, we need to prevent others from denying you+these rights or asking you to surrender the rights. Therefore, you have+certain responsibilities if you distribute copies of the software, or if+you modify it: responsibilities to respect the freedom of others.++ For example, if you distribute copies of such a program, whether+gratis or for a fee, you must pass on to the recipients the same+freedoms that you received. You must make sure that they, too, receive+or can get the source code. And you must show them these terms so they+know their rights.++ Developers that use the GNU GPL protect your rights with two steps:+(1) assert copyright on the software, and (2) offer you this License+giving you legal permission to copy, distribute and/or modify it.++ For the developers' and authors' protection, the GPL clearly explains+that there is no warranty for this free software. For both users' and+authors' sake, the GPL requires that modified versions be marked as+changed, so that their problems will not be attributed erroneously to+authors of previous versions.++ Some devices are designed to deny users access to install or run+modified versions of the software inside them, although the manufacturer+can do so. This is fundamentally incompatible with the aim of+protecting users' freedom to change the software. The systematic+pattern of such abuse occurs in the area of products for individuals to+use, which is precisely where it is most unacceptable. Therefore, we+have designed this version of the GPL to prohibit the practice for those+products. If such problems arise substantially in other domains, we+stand ready to extend this provision to those domains in future versions+of the GPL, as needed to protect the freedom of users.++ Finally, every program is threatened constantly by software patents.+States should not allow patents to restrict development and use of+software on general-purpose computers, but in those that do, we wish to+avoid the special danger that patents applied to a free program could+make it effectively proprietary. To prevent this, the GPL assures that+patents cannot be used to render the program non-free.++ The precise terms and conditions for copying, distribution and+modification follow.++ TERMS AND CONDITIONS++ 0. Definitions.++ "This License" refers to version 3 of the GNU General Public License.++ "Copyright" also means copyright-like laws that apply to other kinds of+works, such as semiconductor masks.++ "The Program" refers to any copyrightable work licensed under this+License. Each licensee is addressed as "you". "Licensees" and+"recipients" may be individuals or organizations.++ To "modify" a work means to copy from or adapt all or part of the work+in a fashion requiring copyright permission, other than the making of an+exact copy. The resulting work is called a "modified version" of the+earlier work or a work "based on" the earlier work.++ A "covered work" means either the unmodified Program or a work based+on the Program.++ To "propagate" a work means to do anything with it that, without+permission, would make you directly or secondarily liable for+infringement under applicable copyright law, except executing it on a+computer or modifying a private copy. Propagation includes copying,+distribution (with or without modification), making available to the+public, and in some countries other activities as well.++ To "convey" a work means any kind of propagation that enables other+parties to make or receive copies. Mere interaction with a user through+a computer network, with no transfer of a copy, is not conveying.++ An interactive user interface displays "Appropriate Legal Notices"+to the extent that it includes a convenient and prominently visible+feature that (1) displays an appropriate copyright notice, and (2)+tells the user that there is no warranty for the work (except to the+extent that warranties are provided), that licensees may convey the+work under this License, and how to view a copy of this License. If+the interface presents a list of user commands or options, such as a+menu, a prominent item in the list meets this criterion.++ 1. Source Code.++ The "source code" for a work means the preferred form of the work+for making modifications to it. "Object code" means any non-source+form of a work.++ A "Standard Interface" means an interface that either is an official+standard defined by a recognized standards body, or, in the case of+interfaces specified for a particular programming language, one that+is widely used among developers working in that language.++ The "System Libraries" of an executable work include anything, other+than the work as a whole, that (a) is included in the normal form of+packaging a Major Component, but which is not part of that Major+Component, and (b) serves only to enable use of the work with that+Major Component, or to implement a Standard Interface for which an+implementation is available to the public in source code form. A+"Major Component", in this context, means a major essential component+(kernel, window system, and so on) of the specific operating system+(if any) on which the executable work runs, or a compiler used to+produce the work, or an object code interpreter used to run it.++ The "Corresponding Source" for a work in object code form means all+the source code needed to generate, install, and (for an executable+work) run the object code and to modify the work, including scripts to+control those activities. However, it does not include the work's+System Libraries, or general-purpose tools or generally available free+programs which are used unmodified in performing those activities but+which are not part of the work. For example, Corresponding Source+includes interface definition files associated with source files for+the work, and the source code for shared libraries and dynamically+linked subprograms that the work is specifically designed to require,+such as by intimate data communication or control flow between those+subprograms and other parts of the work.++ The Corresponding Source need not include anything that users+can regenerate automatically from other parts of the Corresponding+Source.++ The Corresponding Source for a work in source code form is that+same work.++ 2. Basic Permissions.++ All rights granted under this License are granted for the term of+copyright on the Program, and are irrevocable provided the stated+conditions are met. This License explicitly affirms your unlimited+permission to run the unmodified Program. The output from running a+covered work is covered by this License only if the output, given its+content, constitutes a covered work. This License acknowledges your+rights of fair use or other equivalent, as provided by copyright law.++ You may make, run and propagate covered works that you do not+convey, without conditions so long as your license otherwise remains+in force. You may convey covered works to others for the sole purpose+of having them make modifications exclusively for you, or provide you+with facilities for running those works, provided that you comply with+the terms of this License in conveying all material for which you do+not control copyright. Those thus making or running the covered works+for you must do so exclusively on your behalf, under your direction+and control, on terms that prohibit them from making any copies of+your copyrighted material outside their relationship with you.++ Conveying under any other circumstances is permitted solely under+the conditions stated below. Sublicensing is not allowed; section 10+makes it unnecessary.++ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.++ No covered work shall be deemed part of an effective technological+measure under any applicable law fulfilling obligations under article+11 of the WIPO copyright treaty adopted on 20 December 1996, or+similar laws prohibiting or restricting circumvention of such+measures.++ When you convey a covered work, you waive any legal power to forbid+circumvention of technological measures to the extent such circumvention+is effected by exercising rights under this License with respect to+the covered work, and you disclaim any intention to limit operation or+modification of the work as a means of enforcing, against the work's+users, your or third parties' legal rights to forbid circumvention of+technological measures.++ 4. Conveying Verbatim Copies.++ You may convey verbatim copies of the Program's source code as you+receive it, in any medium, provided that you conspicuously and+appropriately publish on each copy an appropriate copyright notice;+keep intact all notices stating that this License and any+non-permissive terms added in accord with section 7 apply to the code;+keep intact all notices of the absence of any warranty; and give all+recipients a copy of this License along with the Program.++ You may charge any price or no price for each copy that you convey,+and you may offer support or warranty protection for a fee.++ 5. Conveying Modified Source Versions.++ You may convey a work based on the Program, or the modifications to+produce it from the Program, in the form of source code under the+terms of section 4, provided that you also meet all of these conditions:++ a) The work must carry prominent notices stating that you modified+ it, and giving a relevant date.++ b) The work must carry prominent notices stating that it is+ released under this License and any conditions added under section+ 7. This requirement modifies the requirement in section 4 to+ "keep intact all notices".++ c) You must license the entire work, as a whole, under this+ License to anyone who comes into possession of a copy. This+ License will therefore apply, along with any applicable section 7+ additional terms, to the whole of the work, and all its parts,+ regardless of how they are packaged. This License gives no+ permission to license the work in any other way, but it does not+ invalidate such permission if you have separately received it.++ d) If the work has interactive user interfaces, each must display+ Appropriate Legal Notices; however, if the Program has interactive+ interfaces that do not display Appropriate Legal Notices, your+ work need not make them do so.++ A compilation of a covered work with other separate and independent+works, which are not by their nature extensions of the covered work,+and which are not combined with it such as to form a larger program,+in or on a volume of a storage or distribution medium, is called an+"aggregate" if the compilation and its resulting copyright are not+used to limit the access or legal rights of the compilation's users+beyond what the individual works permit. Inclusion of a covered work+in an aggregate does not cause this License to apply to the other+parts of the aggregate.++ 6. Conveying Non-Source Forms.++ You may convey a covered work in object code form under the terms+of sections 4 and 5, provided that you also convey the+machine-readable Corresponding Source under the terms of this License,+in one of these ways:++ a) Convey the object code in, or embodied in, a physical product+ (including a physical distribution medium), accompanied by the+ Corresponding Source fixed on a durable physical medium+ customarily used for software interchange.++ b) Convey the object code in, or embodied in, a physical product+ (including a physical distribution medium), accompanied by a+ written offer, valid for at least three years and valid for as+ long as you offer spare parts or customer support for that product+ model, to give anyone who possesses the object code either (1) a+ copy of the Corresponding Source for all the software in the+ product that is covered by this License, on a durable physical+ medium customarily used for software interchange, for a price no+ more than your reasonable cost of physically performing this+ conveying of source, or (2) access to copy the+ Corresponding Source from a network server at no charge.++ c) Convey individual copies of the object code with a copy of the+ written offer to provide the Corresponding Source. This+ alternative is allowed only occasionally and noncommercially, and+ only if you received the object code with such an offer, in accord+ with subsection 6b.++ d) Convey the object code by offering access from a designated+ place (gratis or for a charge), and offer equivalent access to the+ Corresponding Source in the same way through the same place at no+ further charge. You need not require recipients to copy the+ Corresponding Source along with the object code. If the place to+ copy the object code is a network server, the Corresponding Source+ may be on a different server (operated by you or a third party)+ that supports equivalent copying facilities, provided you maintain+ clear directions next to the object code saying where to find the+ Corresponding Source. Regardless of what server hosts the+ Corresponding Source, you remain obligated to ensure that it is+ available for as long as needed to satisfy these requirements.++ e) Convey the object code using peer-to-peer transmission, provided+ you inform other peers where the object code and Corresponding+ Source of the work are being offered to the general public at no+ charge under subsection 6d.++ A separable portion of the object code, whose source code is excluded+from the Corresponding Source as a System Library, need not be+included in conveying the object code work.++ A "User Product" is either (1) a "consumer product", which means any+tangible personal property which is normally used for personal, family,+or household purposes, or (2) anything designed or sold for incorporation+into a dwelling. In determining whether a product is a consumer product,+doubtful cases shall be resolved in favor of coverage. For a particular+product received by a particular user, "normally used" refers to a+typical or common use of that class of product, regardless of the status+of the particular user or of the way in which the particular user+actually uses, or expects or is expected to use, the product. A product+is a consumer product regardless of whether the product has substantial+commercial, industrial or non-consumer uses, unless such uses represent+the only significant mode of use of the product.++ "Installation Information" for a User Product means any methods,+procedures, authorization keys, or other information required to install+and execute modified versions of a covered work in that User Product from+a modified version of its Corresponding Source. The information must+suffice to ensure that the continued functioning of the modified object+code is in no case prevented or interfered with solely because+modification has been made.++ If you convey an object code work under this section in, or with, or+specifically for use in, a User Product, and the conveying occurs as+part of a transaction in which the right of possession and use of the+User Product is transferred to the recipient in perpetuity or for a+fixed term (regardless of how the transaction is characterized), the+Corresponding Source conveyed under this section must be accompanied+by the Installation Information. But this requirement does not apply+if neither you nor any third party retains the ability to install+modified object code on the User Product (for example, the work has+been installed in ROM).++ The requirement to provide Installation Information does not include a+requirement to continue to provide support service, warranty, or updates+for a work that has been modified or installed by the recipient, or for+the User Product in which it has been modified or installed. Access to a+network may be denied when the modification itself materially and+adversely affects the operation of the network or violates the rules and+protocols for communication across the network.++ Corresponding Source conveyed, and Installation Information provided,+in accord with this section must be in a format that is publicly+documented (and with an implementation available to the public in+source code form), and must require no special password or key for+unpacking, reading or copying.++ 7. Additional Terms.++ "Additional permissions" are terms that supplement the terms of this+License by making exceptions from one or more of its conditions.+Additional permissions that are applicable to the entire Program shall+be treated as though they were included in this License, to the extent+that they are valid under applicable law. If additional permissions+apply only to part of the Program, that part may be used separately+under those permissions, but the entire Program remains governed by+this License without regard to the additional permissions.++ When you convey a copy of a covered work, you may at your option+remove any additional permissions from that copy, or from any part of+it. (Additional permissions may be written to require their own+removal in certain cases when you modify the work.) You may place+additional permissions on material, added by you to a covered work,+for which you have or can give appropriate copyright permission.++ Notwithstanding any other provision of this License, for material you+add to a covered work, you may (if authorized by the copyright holders of+that material) supplement the terms of this License with terms:++ a) Disclaiming warranty or limiting liability differently from the+ terms of sections 15 and 16 of this License; or++ b) Requiring preservation of specified reasonable legal notices or+ author attributions in that material or in the Appropriate Legal+ Notices displayed by works containing it; or++ c) Prohibiting misrepresentation of the origin of that material, or+ requiring that modified versions of such material be marked in+ reasonable ways as different from the original version; or++ d) Limiting the use for publicity purposes of names of licensors or+ authors of the material; or++ e) Declining to grant rights under trademark law for use of some+ trade names, trademarks, or service marks; or++ f) Requiring indemnification of licensors and authors of that+ material by anyone who conveys the material (or modified versions of+ it) with contractual assumptions of liability to the recipient, for+ any liability that these contractual assumptions directly impose on+ those licensors and authors.++ All other non-permissive additional terms are considered "further+restrictions" within the meaning of section 10. If the Program as you+received it, or any part of it, contains a notice stating that it is+governed by this License along with a term that is a further+restriction, you may remove that term. If a license document contains+a further restriction but permits relicensing or conveying under this+License, you may add to a covered work material governed by the terms+of that license document, provided that the further restriction does+not survive such relicensing or conveying.++ If you add terms to a covered work in accord with this section, you+must place, in the relevant source files, a statement of the+additional terms that apply to those files, or a notice indicating+where to find the applicable terms.++ Additional terms, permissive or non-permissive, may be stated in the+form of a separately written license, or stated as exceptions;+the above requirements apply either way.++ 8. Termination.++ You may not propagate or modify a covered work except as expressly+provided under this License. Any attempt otherwise to propagate or+modify it is void, and will automatically terminate your rights under+this License (including any patent licenses granted under the third+paragraph of section 11).++ However, if you cease all violation of this License, then your+license from a particular copyright holder is reinstated (a)+provisionally, unless and until the copyright holder explicitly and+finally terminates your license, and (b) permanently, if the copyright+holder fails to notify you of the violation by some reasonable means+prior to 60 days after the cessation.++ Moreover, your license from a particular copyright holder is+reinstated permanently if the copyright holder notifies you of the+violation by some reasonable means, this is the first time you have+received notice of violation of this License (for any work) from that+copyright holder, and you cure the violation prior to 30 days after+your receipt of the notice.++ Termination of your rights under this section does not terminate the+licenses of parties who have received copies or rights from you under+this License. If your rights have been terminated and not permanently+reinstated, you do not qualify to receive new licenses for the same+material under section 10.++ 9. Acceptance Not Required for Having Copies.++ You are not required to accept this License in order to receive or+run a copy of the Program. Ancillary propagation of a covered work+occurring solely as a consequence of using peer-to-peer transmission+to receive a copy likewise does not require acceptance. However,+nothing other than this License grants you permission to propagate or+modify any covered work. These actions infringe copyright if you do+not accept this License. Therefore, by modifying or propagating a+covered work, you indicate your acceptance of this License to do so.++ 10. Automatic Licensing of Downstream Recipients.++ Each time you convey a covered work, the recipient automatically+receives a license from the original licensors, to run, modify and+propagate that work, subject to this License. You are not responsible+for enforcing compliance by third parties with this License.++ An "entity transaction" is a transaction transferring control of an+organization, or substantially all assets of one, or subdividing an+organization, or merging organizations. If propagation of a covered+work results from an entity transaction, each party to that+transaction who receives a copy of the work also receives whatever+licenses to the work the party's predecessor in interest had or could+give under the previous paragraph, plus a right to possession of the+Corresponding Source of the work from the predecessor in interest, if+the predecessor has it or can get it with reasonable efforts.++ You may not impose any further restrictions on the exercise of the+rights granted or affirmed under this License. For example, you may+not impose a license fee, royalty, or other charge for exercise of+rights granted under this License, and you may not initiate litigation+(including a cross-claim or counterclaim in a lawsuit) alleging that+any patent claim is infringed by making, using, selling, offering for+sale, or importing the Program or any portion of it.++ 11. Patents.++ A "contributor" is a copyright holder who authorizes use under this+License of the Program or a work on which the Program is based. The+work thus licensed is called the contributor's "contributor version".++ A contributor's "essential patent claims" are all patent claims+owned or controlled by the contributor, whether already acquired or+hereafter acquired, that would be infringed by some manner, permitted+by this License, of making, using, or selling its contributor version,+but do not include claims that would be infringed only as a+consequence of further modification of the contributor version. For+purposes of this definition, "control" includes the right to grant+patent sublicenses in a manner consistent with the requirements of+this License.++ Each contributor grants you a non-exclusive, worldwide, royalty-free+patent license under the contributor's essential patent claims, to+make, use, sell, offer for sale, import and otherwise run, modify and+propagate the contents of its contributor version.++ In the following three paragraphs, a "patent license" is any express+agreement or commitment, however denominated, not to enforce a patent+(such as an express permission to practice a patent or covenant not to+sue for patent infringement). To "grant" such a patent license to a+party means to make such an agreement or commitment not to enforce a+patent against the party.++ If you convey a covered work, knowingly relying on a patent license,+and the Corresponding Source of the work is not available for anyone+to copy, free of charge and under the terms of this License, through a+publicly available network server or other readily accessible means,+then you must either (1) cause the Corresponding Source to be so+available, or (2) arrange to deprive yourself of the benefit of the+patent license for this particular work, or (3) arrange, in a manner+consistent with the requirements of this License, to extend the patent+license to downstream recipients. "Knowingly relying" means you have+actual knowledge that, but for the patent license, your conveying the+covered work in a country, or your recipient's use of the covered work+in a country, would infringe one or more identifiable patents in that+country that you have reason to believe are valid.++ If, pursuant to or in connection with a single transaction or+arrangement, you convey, or propagate by procuring conveyance of, a+covered work, and grant a patent license to some of the parties+receiving the covered work authorizing them to use, propagate, modify+or convey a specific copy of the covered work, then the patent license+you grant is automatically extended to all recipients of the covered+work and works based on it.++ A patent license is "discriminatory" if it does not include within+the scope of its coverage, prohibits the exercise of, or is+conditioned on the non-exercise of one or more of the rights that are+specifically granted under this License. You may not convey a covered+work if you are a party to an arrangement with a third party that is+in the business of distributing software, under which you make payment+to the third party based on the extent of your activity of conveying+the work, and under which the third party grants, to any of the+parties who would receive the covered work from you, a discriminatory+patent license (a) in connection with copies of the covered work+conveyed by you (or copies made from those copies), or (b) primarily+for and in connection with specific products or compilations that+contain the covered work, unless you entered into that arrangement,+or that patent license was granted, prior to 28 March 2007.++ Nothing in this License shall be construed as excluding or limiting+any implied license or other defenses to infringement that may+otherwise be available to you under applicable patent law.++ 12. No Surrender of Others' Freedom.++ If conditions are imposed on you (whether by court order, agreement or+otherwise) that contradict the conditions of this License, they do not+excuse you from the conditions of this License. If you cannot convey a+covered work so as to satisfy simultaneously your obligations under this+License and any other pertinent obligations, then as a consequence you may+not convey it at all. For example, if you agree to terms that obligate you+to collect a royalty for further conveying from those to whom you convey+the Program, the only way you could satisfy both those terms and this+License would be to refrain entirely from conveying the Program.++ 13. Use with the GNU Affero General Public License.++ Notwithstanding any other provision of this License, you have+permission to link or combine any covered work with a work licensed+under version 3 of the GNU Affero General Public License into a single+combined work, and to convey the resulting work. The terms of this+License will continue to apply to the part which is the covered work,+but the special requirements of the GNU Affero General Public License,+section 13, concerning interaction through a network will apply to the+combination as such.++ 14. Revised Versions of this License.++ The Free Software Foundation may publish revised and/or new versions of+the GNU General Public License from time to time. Such new versions will+be similar in spirit to the present version, but may differ in detail to+address new problems or concerns.++ Each version is given a distinguishing version number. If the+Program specifies that a certain numbered version of the GNU General+Public License "or any later version" applies to it, you have the+option of following the terms and conditions either of that numbered+version or of any later version published by the Free Software+Foundation. If the Program does not specify a version number of the+GNU General Public License, you may choose any version ever published+by the Free Software Foundation.++ If the Program specifies that a proxy can decide which future+versions of the GNU General Public License can be used, that proxy's+public statement of acceptance of a version permanently authorizes you+to choose that version for the Program.++ Later license versions may give you additional or different+permissions. However, no additional obligations are imposed on any+author or copyright holder as a result of your choosing to follow a+later version.++ 15. Disclaimer of Warranty.++ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.++ 16. Limitation of Liability.++ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF+SUCH DAMAGES.++ 17. Interpretation of Sections 15 and 16.++ If the disclaimer of warranty and limitation of liability provided+above cannot be given local legal effect according to their terms,+reviewing courts shall apply local law that most closely approximates+an absolute waiver of all civil liability in connection with the+Program, unless a warranty or assumption of liability accompanies a+copy of the Program in return for a fee.++ END OF TERMS AND CONDITIONS++ How to Apply These Terms to Your New Programs++ If you develop a new program, and you want it to be of the greatest+possible use to the public, the best way to achieve this is to make it+free software which everyone can redistribute and change under these terms.++ To do so, attach the following notices to the program. It is safest+to attach them to the start of each source file to most effectively+state the exclusion of warranty; and each file should have at least+the "copyright" line and a pointer to where the full notice is found.++ <one line to give the program's name and a brief idea of what it does.>+ Copyright (C) <year> <name of author>++ This program is free software: you can redistribute it and/or modify+ it under the terms of the GNU General Public License as published by+ the Free Software Foundation, either version 3 of the License, or+ (at your option) any later version.++ This program is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+ GNU General Public License for more details.++ You should have received a copy of the GNU General Public License+ along with this program. If not, see <https://www.gnu.org/licenses/>.++Also add information on how to contact you by electronic and paper mail.++ If the program does terminal interaction, make it output a short+notice like this when it starts in an interactive mode:++ <program> Copyright (C) <year> <name of author>+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.+ This is free software, and you are welcome to redistribute it+ under certain conditions; type `show c' for details.++The hypothetical commands `show w' and `show c' should show the appropriate+parts of the General Public License. Of course, your program's commands+might be different; for a GUI interface, you would use an "about box".++ You should also get your employer (if you work as a programmer) or school,+if any, to sign a "copyright disclaimer" for the program, if necessary.+For more information on this, and how to apply and follow the GNU GPL, see+<https://www.gnu.org/licenses/>.++ The GNU General Public License does not permit incorporating your program+into proprietary programs. If your program is a subroutine library, you+may consider it more useful to permit linking proprietary applications with+the library. If this is what you want to do, use the GNU Lesser General+Public License instead of this License. But first, please read+<https://www.gnu.org/licenses/why-not-lgpl.html>.
+ hcad.cabal view
@@ -0,0 +1,26 @@+name: hcad+version: 0.1+category: Graphics+synopsis: Haskell CAD library+license: GPL+license-file: LICENSE+author: Jean-Philippe Bernardy+maintainer: jeanphilippe.bernardy@gmail.com+cabal-version: 1.18+build-type: Simple+description: Haskell CAD library on top of OpenSCAD++library+ build-depends: base < 666+ , gasp+ , containers+ -- , glpk-hs+ , mtl+ exposed-modules: HCad+ , HCad.Part+ , HCad.Part.Extensions+ , HCad.SCAD+ , HCad.Expr+ , HCad.Nuts++ default-language: Haskell2010