登录
首页 » C++ Builder » log

log

于 2016-02-02 发布 文件大小:45KB
0 224
下载积分: 1 下载次数: 3

代码说明:

  日志模块 支持多线程 可用于linux windows系统,项目中实际使用多年 没有问题。(log system for linux and windows)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • loadEXE
    说明:  将非自身的EXE注入到其它进程控制中运行的代码。非常经典的东西。(of non-self-injected into the EXE other process control operation of the code. Very classic things.)
    2005-01-05 19:25:27下载
    积分:1
  • bjeadth-command
    Exercise_editor Edit the shortcut key
    2018-11-26 00:31:58下载
    积分:1
  • QVIHJ
    彩色渐变进度条,可是使程序在等待状态下,出现一个彩色的进度条,()
    2018-02-24 08:42:27下载
    积分:1
  • 864599
    扩展后的中点法画直线程序,可以支持任意斜率的直线的绘制,()
    2018-06-14 20:42:13下载
    积分:1
  • multitreadsrc2
    MFC多线程编程源代码和说明文档 很好的学习多线程的文档(MFC multi-threaded programming source code and documentation good learning Multithread documents)
    2008-01-01 17:23:17下载
    积分:1
  • 96062207
    Helix浅谈算式处理(C++计算器源码发布()
    2018-05-16 21:52:39下载
    积分:1
  • 2
    说明:  这篇讲述线程之间存在竞争时如何确保同步并且不发生死锁(This tells the thread between the presence of competition and how to ensure synchronization deadlocks do not occur)
    2014-06-07 15:49:42下载
    积分:1
  • HideProcess_forC
    XP隐藏进程C代码,直接调用即可。。。。。。。。。。。。。。(XP hidden process C code, you can call directly.)
    2009-03-30 13:51:40下载
    积分:1
  • tkgws
    用C++实现了模拟退火算法求多元函数极值,可以避免陷入局部最优解(By c + + implementation of a simulated annealing algorithm for multivariate function extreme value, can avoid falling into local optimal solution)
    2017-08-22 22:48:39下载
    积分:1
  • project
    本程序用两种算法对五个进程进行调度,每个进程可有三个状态,并假设初始状态为就绪状态。初始优先数60。为了便于处理,程序中的运行时间以时间片为单位计算,各进程的优先数或轮转时间数以及进程需要运行的时间片数的初值均由用户给定。3) 在优先数算法中,进程每执行一次,优先数减3,CPU时间片数加1,进程还需要的时间片数减1,在轮转算法中,采用固定时间片,时间片数为2,进程每执行1次,CPU时间片数加2,进程还需要的时间数减2,并排列到就绪队列的尾上。(This procedure using two algorithms for five scheduling process, each process can have three states, and assuming that the initial state to the ready state. The initial priority number 60. To facilitate processing, the program runs in time for the unit time slices, each time slice process priority number or rotation time and the number of processes that need to run the initial value by the number given by the user. 3) the priority number algorithm, the process Each time, priority number minus 3, CPU time slices plus one, the process needs time slices minus one, in the Round Robin, the fixed time slice, the time slice number 2 , each process is d once, CPU time slices plus 2, the process needs time minus 2, and arranged into the tail of the ready queue.)
    2016-05-19 13:18:40下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载