예제 #1
0
        //12 20 28 36
        // to Get all possible Solution(Spacing - Depth ) according to the input depth
        public static Algo.OutPut ConvertNailsCellToOutput(Algo.Pitch.NailsCell nailsCell)
        {
            InputData input = new InputData();

            Algo.OutPut outPut = new Algo.OutPut(input);
            outPut.NailsNo       = nailsCell.NailsNo;
            outPut.Pitch         = (int)nailsCell.RafterPitch;
            outPut.Input         = null;
            outPut.RafterDepth   = 0;
            outPut.RafterSpacing = (int)nailsCell.RafterSpacing_p;
            outPut.RafterSpan    = nailsCell.RoofSpan_P * 6;
            outPut.TotalCost     = 0;
            outPut.VOL_total     = 0;

            return(outPut);
        }
예제 #2
0
        public static Algo.OutPut ConvertNailsCellToOutput(Algo.Pitch.NailsCell nailsCell)
        {
            //  InputData input = new InputData();
            Algo.OutPut outPut = new Algo.OutPut()
            {
                Input         = new InputData(), NailsNo = nailsCell.NailsNo,
                Pitch         = (int)nailsCell.RafterPitch, RafterDepth = 0,
                RafterSpacing = (int)nailsCell.RafterSpacing_p,
                RafterSpan    = (int)nailsCell.RafterSpacing_p / 2,
                TotalCost     = 0, VOL_total = 0
            };

            //outPut.NailsNo = nailsCell.NailsNo;
            //outPut.Pitch = (int)nailsCell.RafterPitch;
            //outPut.Input = null;
            //outPut.RafterDepth = 0;
            //outPut.RafterSpacing = (int)nailsCell.RafterSpacing_p;
            //outPut.RafterSpan = nailsCell.RoofSpan_P * 6;
            //outPut.TotalCost = 0;
            //outPut.VOL_total = 0;

            return(outPut);
        }