zoukankan      html  css  js  c++  java
  • mnesia

    1、模式创建

    mnesia:create_schema([node()|nodes()]).集群的节点之间创建模式

    2、启动和停止

    application:start(mnesia).

    application:stop(mnesia).

    3、创建表

    rd(usr,{msisdn,id,status,plan,services}).                                                                        usr
    (om@publicGroup1)18> Fields = record_info(fields,usr).
    [msisdn,id,status,plan,services]
    (om@publicGroup1)19> mnesia:create_table(usr,[{disc_copies,[node()]},{ram_copies,nodes()},{type,set},{attributes,Fields},{index,[id]}]).
    {atomic,ok}

    4、事务

    transaction(F).

    mnesia:transaction(fun() -> mnesia:index_read(usr, 700000002,id) end).

    mnesia:transaction(fun() -> mnesia:write(usr, Usr#usr{services=[ok]}).

    5、遍历

    (foo@publicGroup1)41> Fun = fun(#muppet{name="Francesco",salary = Salary},_) ->  
    (foo@publicGroup1)41> Salary;                                                    
    (foo@publicGroup1)41> (_,_) -> ok                                                
    (foo@publicGroup1)41> end.
    #Fun<erl_eval.12.111823515>
    (foo@publicGroup1)42> mnesia:transaction(fun() -> mnesia:foldl(Fun,ok,muppet) end).
    {atomic,0}

    6、脏操作

    mnesia:dirty_index_read(usr,700000002,id).

    mnesia:dirty_read({usr,PhoneNo}).

  • 相关阅读:
    java传递String参数
    C++ string与int的互相转换
    java插入排序
    凸包Graham Scan算法实现
    求平面上N点最远两点和最近两点距离
    求最大公约数
    n个数连接得到最小或最大的多位整数(携程)
    Java快排
    背包问题
    二分查找离左边元素最近的(可以等于)
  • 原文地址:https://www.cnblogs.com/yanwei-wang/p/4649121.html
Copyright © 2011-2022 走看看