登录
首页 » Java » Publisher_Manager

Publisher_Manager

于 2009-11-23 发布 文件大小:5414KB
0 217
下载积分: 1 下载次数: 89

代码说明:

  一套基于数据库开发的个人出版物管理系统, 使用Hibernate来进行持久化, 数据库连接选用MySQL, 使用java 和 ant来进行连接。 使用JUnit进行测试。 包含源代码、需求分析、文档和测试代码。(A set of publications based on database management systems developed by individuals, using Hibernate to carry out persistence, database connection use MySQL, the use of java, and ant to make a connection. The use of JUnit for testing. Contains the source code, requirements analysis, documentation and test code.)

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

发表评论

0 个回复

  • CRC64
    CRC循环64位校验的源码,可直接引用该函数使用,有疑问请EM:lovely6226@163.com(Cyclic 64 check source code, can be directly invoked the function uses, the question please EM : lovely6226@163.com)
    2007-05-16 22:16:03下载
    积分:1
  • UsefulSUBs
    Useful Generic Excel Macro s
    2013-08-27 10:33:33下载
    积分:1
  • MemoryGame
    java 记忆游戏 MemoryGame(java game MemoryGame)
    2010-08-28 10:23:00下载
    积分:1
  • 介绍了netstat, ping等网络命令的作用和使用方法, 使用改进后的client来计算接收和发送的包的数目....
    介绍了netstat, ping等网络命令的作用和使用方法, 使用改进后的client来计算接收和发送的包的数目.-introduced, such as network ping orders of the role and use of methods, the use of improved client to receive and send calculation of the number of packets.
    2022-07-02 14:57:58下载
    积分:1
  • Dapper
    Dapper各种语句基础功能测试。。。。。。(Dapper Basic Function Testing)
    2020-06-24 18:20:02下载
    积分:1
  • zhousan
    vc++连接数据库的有关代码,以及对话框的设计(vc++ connect to the database of the code, and the design of the dialog box)
    2010-06-24 21:31:16下载
    积分:1
  • float_long_double_explicit
    Tests that SkPoint::length() and SkPoint::Length() both return.
    2015-10-23 10:21:21下载
    积分:1
  • ssd7_Ex4
    this is answer for ssd7 exercise 4
    2013-10-13 17:34:41下载
    积分:1
  • 单射函数问题 设函数f将点集S = {0,1, , n
    单射函数问题 设函数f将点集S = {0,1, , n -1}映射为f (S) = { f (i) | iÎ S} Í S 。单射函数问题要 从S中选取最大子集X Í S 使f (X )是单射函数。 例如,当n=7, f (S) = {1,0,0,2,2,3,6} Í S 时, X = {0,1,6} Í S 是所求的最大子集。-Injective function, the function f the problem will be the point set based S = (0,1,  , n-1) maps to f (S) = (f (i) | iÎ S) Í S. Injective function of the problem from the largest subset of S, select the X Í S so that f (X) is injective function. For example, when n = 7, f (S) = (1,0,0,2,2,3,6) Í S, when, X = (0,1,6) Í S is a subset of the desired maximum.
    2023-04-24 20:15:02下载
    积分:1
  • umat_2d4n_dp
    2维平面应变+各项同性+J2流动+自定义屈服强度等效塑性应变关系+欧拉后推径向返回(ABAQUS UMAT)
    2016-01-04 11:00:49下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载