zoukankan      html  css  js  c++  java
  • 自定义基于IFC数据的施工进度数据结构

    <DataSource>D:/qlbz20190802.ifc</DataSource>
    <Datas>
        <Data>
            <ID>0</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF9n9</GlobalID>
            <Name>F1</Name>
            <Completion>0.0000</Completion>
            <Type>Summary</Type>
            <Legend></Legend>
            <StartDate>2019-08-04 23:08:52</StartDate>
            <EndDate>2019-08-04 23:08:52</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>1</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF9n9</GlobalID>
            <Name>M_矩形-结构柱:400 x 600mm:365808</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-04 23:09:05</StartDate>
            <EndDate>2019-08-06 23:09:05</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>2</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF8Ig</GlobalID>
            <Name>M_矩形-结构柱:400 x 600mm:363539</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-05 23:09:29</StartDate>
            <EndDate>2019-08-07 23:09:29</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>3</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF8GZ</GlobalID>
            <Name>M_矩形-结构柱:400 x 600mm:363674</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-06 23:09:48</StartDate>
            <EndDate>2019-08-07 23:09:48</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>4</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF9og</GlobalID>
            <Name>M_矩形-结构柱:400 x 600mm:365587</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-07 23:10:01</StartDate>
            <EndDate>2019-08-08 23:10:01</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>5</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF9og</GlobalID>
            <Name>F2</Name>
            <Completion>0.0000</Completion>
            <Type>Summary</Type>
            <Legend></Legend>
            <StartDate>2019-08-04 23:10:28</StartDate>
            <EndDate>2019-08-04 23:10:28</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>6</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF8FG</GlobalID>
            <Name>M_矩形-结构柱:400 x 600mm:363369</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-07 23:10:37</StartDate>
            <EndDate>2019-08-10 23:10:37</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>7</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF8Dn</GlobalID>
            <Name>M_矩形-结构柱:400 x 600mm:363464</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-09 23:11:02</StartDate>
            <EndDate>2019-08-11 23:11:02</EndDate>
            <Depend></Depend>
            <DependID>-1</DependID>
        </Data>
        <Data>
            <ID>8</ID>
            <GlobalID>006bBpRNnEKe6MNkkOF9zk</GlobalID>
            <Name>楼板:常规 140 - 20+120:366551</Name>
            <Completion>0.0000</Completion>
            <Type>Task</Type>
            <Legend></Legend>
            <StartDate>2019-08-11 23:11:20</StartDate>
            <EndDate>2019-08-14 23:11:20</EndDate>
            <Depend>F2</Depend>
            <DependID>-1</DependID>
        </Data>
    </Datas>

  • 相关阅读:
    最长公共子序列(LCS)
    数组分割问题
    Trie树
    BitMap(比特位)
    KMP算法——字符串匹配
    排序算法
    概率问题
    【设计模式】——访问者模式
    【设计模式】——解释器模式
    【设计模式】——享元模式
  • 原文地址:https://www.cnblogs.com/herd/p/11300489.html
Copyright © 2011-2022 走看看