zoukankan      html  css  js  c++  java
  • log4cpp之Category

        Log4cpp 有一个总可用并实例化好的Category,即根Category。使用log4cpp::Category::getRoot()可以得到根 Category。在大多数情况下,一个应用程序只需要一个日志种类(Category),但是有时也会用到多个Category,此时可以使用根 Category的getInstance方法来得到子Category。不同的子Category用于不同的场合。一个简单的例子 CategoryExam如下所示:
    #include <iostream>
    #include<log4cpp/Category.hh>
    #include<log4cpp/OstreamAppender.hh>
    #include<log4cpp/BasicLayout.hh>
    #include<log4cpp/Priority.hh>
    using namespace std;
    using namespace log4cpp;
    int main()
    {
            OstreamAppender * osAppender1=new OstreamAppender("osAppender1",&cout);
            osAppender1->setLayout(new BasicLayout());

            OstreamAppender * osAppender2=new OstreamAppender("osAppender2",&cout);
            osAppender2->setLayout(new BasicLayout());

            Category & root=Category::getRoot();
            //root.setPriority(Priority::DEBUG);

            Category & sub1=root.getInstance("sub1");
            sub1.addAppender(osAppender1);
            sub1.setPriority(Priority::DEBUG);
            sub1.error("sub error");

            Category & sub2=root.getInstance("sub2");
            sub2.addAppender(osAppender2);
            sub2.setPriority(101);
            sub2.warn("sub2 warning");
            sub2.fatal("sub2 fatal");
            sub2.alert("sub2 alert");
            sub2.crit("sub2 crit");                 // Priority=200

            Category::shutdown();
            return 0;
    }

  • 相关阅读:
    LightOJ 1132 Summing up Powers(矩阵快速幂)
    hdu 3804 Query on a tree (树链剖分+线段树)
    LightOJ 1052 String Growth && uva 12045 Fun with Strings (矩阵快速幂)
    uva 12304 2D Geometry 110 in 1! (Geometry)
    LA 3263 That Nice Euler Circuit (2D Geometry)
    2013 SCAUCPC Summary
    poj 3321 Apple Tree (Binary Index Tree)
    uva 11796 Dog Distance (几何+模拟)
    uva 11178 Morley's Theorem (2D Geometry)
    动手动脑
  • 原文地址:https://www.cnblogs.com/meihao1203/p/8888029.html
Copyright © 2011-2022 走看看