zoukankan      html  css  js  c++  java
  • activiti engine.schema.update DB_SCHEMA_UPDATE_FALSE

    engine.properties

    # engine properties
    engine.schema.update=true
    engine.activate.jobexecutor=false
    engine.asyncexecutor.enabled=true
    engine.asyncexecutor.activate=true
    engine.history.level=full

    ProcessEngineConfiguration.createStandaloneInMemProcessEngineConfiguration() .setDatabaseSchemaUpdate(ProcessEngineConfiguration.DB_SCHEMA_UPDATE_FALSE)

    DB_SCHEMA_UPDATE_FALSE

    http://www.cnblogs.com/mingforyou/p/5347789.html

    package junit;
    
    import org.activiti.engine.ProcessEngine;
    import org.activiti.engine.ProcessEngineConfiguration;
    import org.junit.Test;
    
    public class TestActiviti {
        /**
         * 使用代码创建工作流需要的23张表
         */
        @Test
        public void createTable(){
            ProcessEngineConfiguration processEngineConfiguration = ProcessEngineConfiguration.createStandaloneProcessEngineConfiguration();
            //连接数据库配置
            processEngineConfiguration.setJdbcDriver("com.mysql.jdbc.Driver");
            processEngineConfiguration.setJdbcUrl("jdbc:mysql://localhost:3306/activiti?useUnicode=true&characterEncoding=utf8");
            processEngineConfiguration.setJdbcUsername("root");
            processEngineConfiguration.setJdbcPassword("******");
            
            /**
              public static final String DB_SCHEMA_UPDATE_FALSE = "false";//不能自动创建表,需要表存在
              public static final String DB_SCHEMA_UPDATE_CREATE_DROP = "create-drop";//先删除表再创建表
              public static final String DB_SCHEMA_UPDATE_TRUE = "true";//如果表不存在,自动创建表
              */
            processEngineConfiguration.setDatabaseSchemaUpdate(ProcessEngineConfiguration.DB_SCHEMA_UPDATE_TRUE);
            //工作流的核心对象,ProcessEngine对象
            ProcessEngine processEngine = processEngineConfiguration.buildProcessEngine();
            System.out.println("processEngine:"+ processEngine);
        }
    }
  • 相关阅读:
    Leetcode 15 3Sum
    Leetcode 383 Ransom Note
    用i个点组成高度为不超过j的二叉树的数量。
    配对问题 小于10 1.3.5
    字符矩阵的旋转 镜面对称 1.2.2
    字符串统计 连续的某个字符的数量 1.1.4
    USACO twofive 没理解
    1002 All Roads Lead to Rome
    USACO 5.5.1 求矩形并的周长
    USACO 5.5.2 字符串的最小表示法
  • 原文地址:https://www.cnblogs.com/rgqancy/p/7098026.html
Copyright © 2011-2022 走看看