zoukankan      html  css  js  c++  java
  • php用simplexml来操作xml

    <?php

    $username = 'zhansan';

    if (!file_exists('001.xml'))
    {
    $fp = fopen('001.xml', 'w');
    $xmlContent = '<?xml version="1.0" encoding="utf-8"?><record></record>';
    fwrite($fp, $xmlContent);
    fclose($fp);

    $xml = simplexml_load_file('001.xml');
    $unode = $xml->addChild($username);
    $unode->addChild('times', 2);
    $unode->addChild('time', '2016');
    $unode->addChild('ip', '192.1.0.11');


    $unode = $xml->addChild('lisi');
    $unode->addChild('times', 22);
    $unode->addChild('time', '2016');
    $unode->addChild('ip', '12.0.0.13');

    $xml->asXML('001.xml');
    }
    //修改
    $xml = simplexml_load_file('001.xml');
    echo $xml;
    $usr = $xml->lisi;
    $usr->times += 1;
    echo $usr->times;
    $xml->asXML('001.xml');

    /**
    * 删除
    */
    //unset($xml->zhansan);
    //$xml->asXML('001.xml');

    //查看


    //删除xml文件
    //unlink('001.xml');



    echo '<br />';
    /**
    * 查看xml,不一定好
    */
    //$dom = simplexml_import_dom($xml);
    echo $dom->zhansan->times.'<br />';

    if ($dom->saonv->times === null)
    {
    echo 'saop is not exist';
    }
    echo '<br />';
    var_dump($xml->lisis->times);

    /**
    * 将xml转为数组 ,注意,如果有顶级同名节点会被合并
    */
    $jn = json_encode($xml);
    $data = json_decode($jn, true);

    echo '<pre>';
    print_r($data['xml']['node']);
    echo '</pre>';




    ?>
  • 相关阅读:
    字符串的全排列

    链表
    青蛙跳一格或者两格,n格跳法
    二叉树
    Concurrent实现原理
    sql语句总结 (转) http://blog.csdn.net/fengfeng91/article/details/15029173
    ArrayList实现原理
    java虚拟机 内存分配
    【转】关于Quartus ii无法识别Modelsim路径的问题
  • 原文地址:https://www.cnblogs.com/yubolin/p/6051207.html
Copyright © 2011-2022 走看看