登录
首页 » Java » Spring-transaction

Spring-transaction

于 2017-12-06 发布 文件大小:6431KB
0 153
下载积分: 1 下载次数: 1

代码说明:

  编程式事务管理以及声明式事务管理(bean/xml/注解)的代码演示(Code demonstration of programmatic transaction management and declarative transaction management (bean/XML/annotations))

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

发表评论


0 个回复

  • JCHelloWorld
    一个javacard2.2.2的helloworld applet.(a javacard2.2.2 the helloworld applet.)
    2006-12-18 16:00:37下载
    积分:1
  • JRegexTool
    正则匹配工具,可匹配任意字符,支持匹配替换,支持对各种标示符的特别处理,界面化操作,简单易用(Regular matching tool to match any character, support matching replacement support special treatment for a variety of identifiers, interface operation, easy to use)
    2014-02-17 14:56:07下载
    积分:1
  • DirectByteBuffer
    DirectByteBuffer extends BaseByteBuffer implements DirectBuffer.
    2014-02-18 12:46:44下载
    积分:1
  • savephoto
    使用eclipse连接数据库,将图片保存到数据库中(Connect to the database, the picture is saved to the database)
    2013-10-10 09:56:15下载
    积分:1
  • Effectiveness-Java-programming
    Java实效编程百例,本书通过100多个精选的实例讲解了利用JAVA进行应用程序开发的各个方面。(Effectiveness Java programming hundred cases, the book by more than 100 selected examples to explain the use of JAVA application development in all its aspects.)
    2015-12-03 13:19:22下载
    积分:1
  • java-learning-books
    java学习书籍,java设计模式,适用于初学者,,内容详细丰富(java learning books)
    2013-11-30 19:17:02下载
    积分:1
  • 项目答辩资料
    Darry ring 商城,一个婚戒预购网站,里面包含源代码,数据库脚本,以及项目答辩资料(Darry ring mall, a wedding ring prepurchase website containing source code, database scripts, and project defense materials)
    2018-03-10 17:49:04下载
    积分:1
  • 成绩管理系统源码
    成绩管理系统,对成绩管理,有成绩的录入,管理,分类等(achievement score result mark management system supervising system supervisory system manage supervise administrate Administration entering classify classification assortment)
    2018-05-30 16:41:04下载
    积分:1
  • 15755_jb_memory_monitor_v.2.2
    JBuilder里监控内存使用情况的插件(JBuilder Memory Lane control the use of plug-in)
    2004-10-13 09:49:37下载
    积分:1
  • TREE_INT
    Tree AVL In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
    2014-12-05 02:27:12下载
    积分:1
  • 696518资源总数
  • 105151会员总数
  • 4今日下载