commit 474e7ea5c334a154480b0f7c2a5591726675bae9
Author: cyh <chenyh@connor.net.cn>
Date:   Mon Dec 18 15:20:58 2023 +0800

    正泰ITK代码

diff --git a/General/.gitattributes b/General/.gitattributes
new file mode 100644
index 0000000..1ff0c42
--- /dev/null
+++ b/General/.gitattributes
@@ -0,0 +1,63 @@
+###############################################################################
+# Set default behavior to automatically normalize line endings.
+###############################################################################
+* text=auto
+
+###############################################################################
+# Set default behavior for command prompt diff.
+#
+# This is need for earlier builds of msysgit that does not have it on by
+# default for csharp files.
+# Note: This is only used by command line
+###############################################################################
+#*.cs     diff=csharp
+
+###############################################################################
+# Set the merge driver for project and solution files
+#
+# Merging from the command prompt will add diff markers to the files if there
+# are conflicts (Merging from VS is not affected by the settings below, in VS
+# the diff markers are never inserted). Diff markers may cause the following 
+# file extensions to fail to load in VS. An alternative would be to treat
+# these files as binary and thus will always conflict and require user
+# intervention with every merge. To do so, just uncomment the entries below
+###############################################################################
+#*.sln       merge=binary
+#*.csproj    merge=binary
+#*.vbproj    merge=binary
+#*.vcxproj   merge=binary
+#*.vcproj    merge=binary
+#*.dbproj    merge=binary
+#*.fsproj    merge=binary
+#*.lsproj    merge=binary
+#*.wixproj   merge=binary
+#*.modelproj merge=binary
+#*.sqlproj   merge=binary
+#*.wwaproj   merge=binary
+
+###############################################################################
+# behavior for image files
+#
+# image files are treated as binary by default.
+###############################################################################
+#*.jpg   binary
+#*.png   binary
+#*.gif   binary
+
+###############################################################################
+# diff behavior for common document formats
+# 
+# Convert binary document formats to text before diffing them. This feature
+# is only available from the command line. Turn it on by uncommenting the 
+# entries below.
+###############################################################################
+#*.doc   diff=astextplain
+#*.DOC   diff=astextplain
+#*.docx  diff=astextplain
+#*.DOCX  diff=astextplain
+#*.dot   diff=astextplain
+#*.DOT   diff=astextplain
+#*.pdf   diff=astextplain
+#*.PDF   diff=astextplain
+#*.rtf   diff=astextplain
+#*.RTF   diff=astextplain
diff --git a/General/.gitignore b/General/.gitignore
new file mode 100644
index 0000000..7964536
--- /dev/null
+++ b/General/.gitignore
@@ -0,0 +1,189 @@
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+
+# User-specific files
+*.suo
+*.user
+*.sln.docstates
+
+# Build results
+[Dd]ebug/
+[Dd]ebugPublic/
+[Rr]elease/
+x64/
+build/
+bld/
+[Bb]in/
+[Oo]bj/
+
+# Roslyn cache directories
+*.ide/
+
+# MSTest test Results
+[Tt]est[Rr]esult*/
+[Bb]uild[Ll]og.*
+
+#NUNIT
+*.VisualState.xml
+TestResult.xml
+
+# Build Results of an ATL Project
+[Dd]ebugPS/
+[Rr]eleasePS/
+dlldata.c
+
+*_i.c
+*_p.c
+*_i.h
+*.ilk
+*.meta
+*.obj
+*.pch
+*.pdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.tmp_proj
+*.log
+*.vspscc
+*.vssscc
+.builds
+*.pidb
+*.svclog
+*.scc
+
+# Chutzpah Test files
+_Chutzpah*
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opensdf
+*.sdf
+*.cachefile
+
+# Visual Studio profiler
+*.psess
+*.vsp
+*.vspx
+
+# TFS 2012 Local Workspace
+$tf/
+
+# Guidance Automation Toolkit
+*.gpState
+
+# ReSharper is a .NET coding add-in
+_ReSharper*/
+*.[Rr]e[Ss]harper
+*.DotSettings.user
+
+# JustCode is a .NET coding addin-in
+.JustCode
+
+# TeamCity is a build add-in
+_TeamCity*
+
+# DotCover is a Code Coverage Tool
+*.dotCover
+
+# NCrunch
+_NCrunch_*
+.*crunch*.local.xml
+
+# MightyMoose
+*.mm.*
+AutoTest.Net/
+
+# Web workbench (sass)
+.sass-cache/
+
+# Installshield output folder
+[Ee]xpress/
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish/
+
+# Publish Web Output
+*.[Pp]ublish.xml
+*.azurePubxml
+## TODO: Comment the next line if you want to checkin your
+## web deploy settings but do note that will include unencrypted
+## passwords
+#*.pubxml
+
+# NuGet Packages Directory
+packages/*
+## TODO: If the tool you use requires repositories.config
+## uncomment the next line
+#!packages/repositories.config
+
+# Enable "build/" folder in the NuGet Packages folder since
+# NuGet packages use it for MSBuild targets.
+# This line needs to be after the ignore of the build folder
+# (and the packages folder if the line above has been uncommented)
+!packages/build/
+
+# Windows Azure Build Output
+csx/
+*.build.csdef
+
+# Windows Store app package directory
+AppPackages/
+
+# Others
+sql/
+*.Cache
+ClientBin/
+[Ss]tyle[Cc]op.*
+~$*
+*~
+*.dbmdl
+*.dbproj.schemaview
+*.pfx
+*.publishsettings
+node_modules/
+
+# RIA/Silverlight projects
+Generated_Code/
+
+# Backup & report files from converting an old project file
+# to a newer Visual Studio version. Backup files are not needed,
+# because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+UpgradeLog*.htm
+
+# SQL Server files
+*.mdf
+*.ldf
+
+# Business Intelligence projects
+*.rdl.data
+*.bim.layout
+*.bim_*.settings
+
+# Microsoft Fakes
+FakesAssemblies/
+
+# LightSwitch generated files
+GeneratedArtifacts/
+_Pvt_Extensions/
+ModelManifest.xml
\ No newline at end of file
diff --git a/General/General.sln b/General/General.sln
new file mode 100644
index 0000000..08c0c56
--- /dev/null
+++ b/General/General.sln
@@ -0,0 +1,26 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio 2012
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "General", "General\General.vcxproj", "{69AF44E1-87DF-4DE6-B996-699B397016E8}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Debug|x64 = Debug|x64
+		Release|Win32 = Release|Win32
+		Release|x64 = Release|x64
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Debug|Win32.ActiveCfg = Debug|Win32
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Debug|Win32.Build.0 = Debug|Win32
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Debug|x64.ActiveCfg = Debug|x64
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Debug|x64.Build.0 = Debug|x64
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Release|Win32.ActiveCfg = Release|Win32
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Release|Win32.Build.0 = Release|Win32
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Release|x64.ActiveCfg = Release|x64
+		{69AF44E1-87DF-4DE6-B996-699B397016E8}.Release|x64.Build.0 = Release|x64
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/General/General/AddReleaseStatus.cpp b/General/General/AddReleaseStatus.cpp
new file mode 100644
index 0000000..6c57a0c
--- /dev/null
+++ b/General/General/AddReleaseStatus.cpp
@@ -0,0 +1,86 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+#define ITKCALL( argument )                                             \
+{                                                                       \
+	int retcode = argument;                                             \
+	if ( retcode != ITK_ok ) {                                          \
+	char* s;                                                        \
+	printf( " "#argument "\n" );                                    \
+	printf( "  returns [%d]\n", retcode );                          \
+	EMH_ask_error_text (retcode, &s);                               \
+	TC_printf( "  Teamcenter ERROR: [%s]\n", s);           \
+	printf( "  in file ["__FILE__"], line [%d]\n\n", __LINE__ );    \
+	if (s != 0) MEM_free (s);                                       \
+	}                                                                   \
+}
+int AddReleaseStatus(EPM_action_message_t msg)
+{
+	cout<<"���ӷ���״̬"<<endl;
+
+	int ifail = ITK_ok, arg_cnt = 0, i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	tag_t *release_status=NULL;int rs_num=0;
+	char *value=NULL;
+
+		tag_t release_stat = NULLTAG;
+	ITKCALL(ifail=RELSTAT_create_release_status("TCM Released", &release_stat));
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+
+	ITKCALL(	ifail = EPM_ask_root_task(task_tag, &rootTask_tag));
+	//��ȡĿ�����ö���
+	ITKCALL(	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments));
+	//ѭ��Ŀ�����	
+	for (int i=0;i<att_cnt;i++)
+	{
+		//			ifail = AOM_ask_value_tags(attachments[i],"release_status_list",&rs_num,&release_status);
+		ITKCALL(ifail =AOM_ask_value_string(attachments[i],"object_string",&value));
+
+		cout<<value<<endl;
+		ITKCALL(ifail=RELSTAT_add_release_status(release_stat, 1, &attachments[i], true));
+	}
+	if (value != NULL)
+	{
+		MEM_free(value);
+		value = NULL;
+	}
+	if (attachments != NULL)
+	{
+		MEM_free(attachments);
+		attachments = NULL;
+	}
+	if (release_status != NULL)
+	{
+		MEM_free(release_status);
+		release_status = NULL;
+	}
+	return ifail;
+}
diff --git a/General/General/AddTime.cpp b/General/General/AddTime.cpp
new file mode 100644
index 0000000..ba64f18
--- /dev/null
+++ b/General/General/AddTime.cpp
@@ -0,0 +1,113 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <tccore/item_errors.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include "common_itk_util.h"
+#include <fclasses/tc_date.h>
+#include "string_utils.h"
+#include <tc/folder.h>
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+
+
+int AddTime(EPM_action_message_t msg)
+{
+	cout<<"���ô���handler�ĵ�ǰʱ��"<<endl;
+	time_t now;
+	struct tm *p;	
+	time(&now);//��ȡ��ǰʱ��
+	p = localtime(&now);//���ػ�ʱ�䣬����ϸ��Ϊ������ʱ�����
+	int  year=1900+p->tm_year;
+	int month=p->tm_mon;
+	int day=p->tm_mday;
+	int hour=p->tm_hour;
+	int min=p->tm_min;
+	int second=p->tm_sec;
+	date_t timesss;
+	char date_str_act[30]="\0";
+	sprintf(date_str_act,"%d-%d-%d %d:%d",year,month +1,day,hour,min);		
+//	string timesss=date_str_act;
+//	cout<<"timesss--------------"<<timesss<<endl;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	int ifail=0;int att_cnt=0;
+	//��ȡ��ǰ����������
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+	ifail = EPM_ask_root_task(task_tag, &rootTask_tag);
+	//��ȡĿ�����ö���
+	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments);
+	char *object_TYPE_1=NULL;
+	for (int i = 0; i < att_cnt; i++) {
+	//�������ݼ�
+		tag_t rev_tag=attachments[i];
+		AOM_ask_value_string(rev_tag,"object_type",&object_TYPE_1);
+		cout<<object_TYPE_1<<endl;
+		date_t creation_date;
+//		AOM_ask_value_date(rev_tag,"creation_date", &creation_date);//fnd0StartDate
+//		DATE_date_to_string(creation_date,arg3value,&d_value);
+//		//ITKCALL(AOM_UIF_ask_value( cur_perform_task, "fnd0StartDate", &d_value));
+//		ECHO("d_value : %s",d_value);
+		if(strcmp(object_TYPE_1,"B2sypfRevision")==0||strcmp(object_TYPE_1,"B2sytsRevision")==0||strcmp(object_TYPE_1,"LP2_Elc_CompRevision")==0)
+		{
+			POM_AM__set_application_bypass(true);
+			ITKCALL(AOM_load(rev_tag));
+			ITKCALL(AOM_lock(rev_tag));
+			ITKCALL(AOM_refresh(rev_tag,1));
+
+			ITK_string_to_date(date_str_act, &timesss);
+			AOM_set_value_date(rev_tag,"b2llsj",timesss);//ʵ�ʿ�ʼ����
+
+
+			POM_AM__set_application_bypass(false); 
+			AOM_save(rev_tag);
+			AOM_refresh(rev_tag,0);
+			AOM_unlock(rev_tag);
+			
+		}
+	
+	
+	}
+	if(object_TYPE_1!=NULL)
+	{
+		MEM_free(object_TYPE_1);
+		object_TYPE_1=NULL;
+	}
+	if(attachments!=NULL)
+	{
+		MEM_free(attachments);
+		attachments=NULL;
+	}
+
+	
+
+	return 0;
+}
+
+
+
+		
\ No newline at end of file
diff --git a/General/General/ApplyMatnrCode.cpp b/General/General/ApplyMatnrCode.cpp
new file mode 100644
index 0000000..dc5b6bd
--- /dev/null
+++ b/General/General/ApplyMatnrCode.cpp
@@ -0,0 +1,493 @@
+//#include <tc/tc.h>
+//#include "epm_handler_common.h"
+//#include <ict/ict_userservice.h>
+//#include <tccore/custom.h>
+//#include <epm/epm_toolkit_tc_utils.h>
+//#include <tccore/aom.h>
+//#include <tccore/aom_prop.h>
+//#include <tccore/item.h>
+//#include <bom/bom.h>
+//#include "ps/ps.h";
+//#include "ps/vrule.h"
+//#include "sstream"
+//#include <tccore/grm.h>
+//#include "epm/epm.h"
+//#include "sa/sa.h"
+//#include "libxl.h"
+//#include <map>
+//#include "epm/signoff.h"
+//#include <ctime>
+//#include <vector>
+//#include <locale>
+//#include <codecvt>
+//#include "ae/dataset.h"
+//#include <iostream>
+//#include <stdlib.h>
+//#include <tccore/aom.h>
+//#include <tc/emh.h>
+//#include <ict/ict_userservice.h>
+//#include <tc/tc.h>
+//#include <tccore/tctype.h>
+//#include <sa/tcfile.h>
+//#include <ss/ss_errors.h>
+//#include <ae/datasettype.h>
+//// #include "hx_custom.h"
+//#include "tc_log.h"
+//// #include "jk_custom.h"
+//#include "chint_Handler.h"
+//#include "tc_util.h"
+//#include <regex>
+//#include "ado.h"
+//#include "ocilib.h"
+////������ѡ����Ϣ��ȡm_code
+//
+//
+////��ѯ���ݿ���Ϣ PartSqlUtil.getConnection()
+////SQL.URL = jdbc:sqlserver://10.128.20.35:1433;DatabaseName=BDP2020
+////SQL.DRIVER = com.microsoft.sqlserver.jdbc.SQLServerDriver
+////SQL.USER = PLMUser
+////SQL.PASSWORD = PLMUser
+//
+////1ZDB 2ZDB 4ZDB
+//string groupId;
+//string Sql2 = "select t.PrhName,t.PrdLine,t.PrdNo,t.PrdFeatureCode,t.FeatureName,t.PrdCanInput,t.PrdSign from CcemVW_Prd t where t.prhcode = '%s' order by t.PrdNo";
+//string Sql1 = "select t.PmpcPrhCode, t.PmpcPType,t.PmpcMType from CcemVW_Pmpc t where t.PmpcCode='%s'";
+//string m_code1 = "230101001";
+//string m_code2 = "220101001";
+//
+//string sql_query = "select FeatureList from CcemVW_GoodsFeature where GoodsCode ='%s' ";
+//struct PRD
+//{
+//	string prdFeatureCode;
+//	string featureName;
+//};
+//struct PMPC
+//{
+//	string m_code;
+//	string pmpcPrhCode;
+//	string pmpcPType;
+//	string pmpcMType;
+//};
+//vector<PRD> prds2;
+//vector<PRD> prds;
+//PMPC pmpc;
+//PMPC pmpc2;
+//void listBom(tag_t bom_line, vector<tag_t> &bomLineVec) {
+//
+//	int c_line_count;
+//	tag_t *c_line_tags;
+//	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+//	for (int i = 0; i < c_line_count; i++) {
+//
+//		tag_t c_line_tag = c_line_tags[i];
+//		bomLineVec.push_back(c_line_tag);
+//		listBom(c_line_tag, bomLineVec);
+//	}
+//	
+//
+//}
+//boolean isNeedApply(tag_t rev){
+//	char *type,*zt2_Diagram,*zt2_Source;
+//	AOM_ask_value_string(rev,"object_type", &type);
+//	if (strcmp(type,"ZT2_Design3DRevision")==0)
+//		return false;
+//	// ���������
+//	AOM_ask_value_string(rev, "zt2_Diagram", &zt2_Diagram);
+//	if (strcmp(zt2_Diagram, "Y") == 0 || strcmp(zt2_Diagram, "��") == 0) {
+//		return false;
+//	}
+//	int cnt = 0;
+//	tag_t *children;
+//	AOM_UIF_ask_value(rev,"zt2_Source", &zt2_Source);
+//	printf("zt2_Source ==> %s\n", zt2_Source);
+//	AOM_ask_value_tags(rev,"ZT2_FactoryNumber",&cnt, &children);
+//	if (cnt > 0) {
+//		return false;
+//	}
+//	return true;
+//}
+//void getRevs(tag_t line,string &errBuff,map<tag_t,vector<string>> &general_maps) {
+//
+//	tag_t rev;
+//	ITKCALL(AOM_ask_value_tag(line, "bl_line_object", &rev));
+//	if (isNeedApply(rev)) {
+//		char *itemId,*ZT2_TYSpecifications;
+//		AOM_ask_value_string(rev, "item_id", &itemId);
+//		if (strstr("1ZDB", itemId) == 0 || strstr("2ZDB", itemId) == 0 || strstr("4ZDB", itemId) == 0) {
+//			int cnt=0;
+//			tag_t *comps;
+//			AOM_ask_value_string(line,"ZT2_TYSpecifications",&ZT2_TYSpecifications);
+//			if (strcmp(ZT2_TYSpecifications,"") == 0) {
+//				AOM_ask_value_tags(rev,"representation_for",&cnt,&comps);
+//				char *zt2_Specifications;
+//				if (cnt == 0) {
+//					AOM_ask_value_string(rev, "zt2_Specifications", &zt2_Specifications);
+//					if (general_maps.count(rev) == 1) {
+//						vector<string> vec = general_maps[rev];
+//						if (std::find(vec.begin(), vec.end(), zt2_Specifications) == vec.end()) {
+//							vec.push_back(zt2_Specifications);
+//						}
+//					}
+//					else {
+//						vector<string> vec;
+//						vec.push_back(zt2_Specifications);
+//						general_maps[rev] = vec;
+//					}
+//				}
+//			}
+//			else {
+//				string qryVal;
+//				tag_t query = NULLTAG, *tags;
+//				map<string, tag_t> map_revs;
+//				qryVal.append("*").append(itemId).append("*").append(ZT2_TYSpecifications).append("*");
+//				//fields.put("����", "*" + item_id + "*" + zt2_TYJNo + "*");
+//				ITKCALL(QRY_find2("chint_query_material_test", &query));
+//				char* qry_entries[2] = { "����","������ͼ��" }, *qry_values[2] = { (char *)qryVal.c_str(),itemId };
+//				int n_found;
+//				ITKCALL(QRY_execute(query, 2, qry_entries, qry_values, &n_found, &tags));
+//				if (n_found == 0) {
+//					if (general_maps.count(rev) == 1) {
+//						vector<string> vec = general_maps[rev];
+//						if (std::find(vec.begin(), vec.end(), ZT2_TYSpecifications) == vec.end()) {
+//							vec.push_back(ZT2_TYSpecifications);
+//						}
+//					}
+//					else {
+//						vector<string> vec;
+//						vec.push_back(ZT2_TYSpecifications);
+//						general_maps[rev] = vec;
+//					}
+//				}
+//				else {
+//					boolean flag2 = true;
+//					for (int i = 0; i < n_found; i++) {
+//						if (!flag2) {
+//							break;
+//						}
+//						char *zt2_MaterialNo;
+//						tag_t matnrTag = tags[i];
+//						AOM_ask_value_string(matnrTag,"zt2_MaterialNo",&zt2_MaterialNo);
+//						char selectRecord[200];
+//						int outputColumn = 0, outputValueCount = 0;
+//						char*** outputValue = NULL;
+//						sprintf(selectRecord, sql_query.c_str(), zt2_MaterialNo);
+//						ado_QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+//						string pmpcPrhCode, pmpcPType, pmpcMType;
+//						for (int j = 0; j < outputValueCount; j++) {
+//							string featureList = outputValue[j][0];
+//							vector<string> vec2;
+//							Split(featureList, ",", vec2);
+//							for (int x = 0, len2 = vec2.size(); x < len2; x++) {
+//								if (vec2[x].rfind("F064:", 0) == 0) {
+//									string temp = "F064:";
+//									temp.append(ZT2_TYSpecifications);
+//									if (vec2[x].compare(temp)==0) {
+//										flag2 = false;
+//									}
+//									break;
+//								}
+//							}
+//						}
+//					}
+//					if (flag2) {
+//						if (general_maps.count(rev) == 1) {
+//							vector<string> vec = general_maps[rev];
+//							if (std::find(vec.begin(), vec.end(), ZT2_TYSpecifications) == vec.end()) {
+//								vec.push_back(ZT2_TYSpecifications);
+//							}
+//						}
+//						else {
+//							vector<string> vec;
+//							vec.push_back(ZT2_TYSpecifications);
+//							general_maps[rev] = vec;
+//						}
+//					}
+//				}
+//			}
+//		}
+//	}
+//}
+//void send1(map<tag_t, vector<string>> general_maps,string now,
+//	char *user_id,vector<string> &jsons) {
+//	map<tag_t, vector<string>>::iterator it;
+//	for (it = general_maps.begin(); it != general_maps.end(); it++) {
+//		tag_t rev = it->first;
+//		char *item_id, *object_name, *zt2_DrawingNo1, *zt2_MaterialMark, *zt2_ProductModel
+//			, *object_desc, *zt2_SurfaceTreatment,*zt2_Source;
+//		vector<string> specs = it->second;
+//		AOM_ask_value_string(rev,"item_id", &item_id); //groupId
+//		AOM_ask_value_string(rev, "object_name", &object_name);
+//		AOM_ask_value_string(rev, "zt2_DrawingNo", &zt2_DrawingNo1);
+//		AOM_ask_value_string(rev, "zt2_MaterialMark", &zt2_MaterialMark);
+//		AOM_ask_value_string(rev, "zt2_ProductModel", &zt2_ProductModel);
+//		AOM_ask_value_string(rev, "object_desc", &object_desc);
+//		AOM_ask_value_string(rev, "zt2_SurfaceTreatment", &zt2_SurfaceTreatment);
+//		AOM_UIF_ask_value(rev, "zt2_Source", &zt2_Source);
+//		PMPC m_pmpc;
+//		vector<PRD> m_prds;
+//		if (strstr(item_id,"1ZDB") == 0) {
+//			m_prds = prds;
+//			m_pmpc = pmpc;
+//		}
+//		else {
+//			m_prds = prds2;
+//			m_pmpc = pmpc2;
+//		}
+//		string pmpcCode = m_pmpc.m_code;
+//		string prhCode = m_pmpc.pmpcPrhCode;
+//		string pmpcType = m_pmpc.pmpcMType;
+//		if (pmpcType.length() == 0) {
+//			continue;
+//		}
+//		string goodsCode = ""; // ����ʱΪ��
+//		string goodsName = object_name;//rev.getProperty("object_name");
+//		string unitCode = "ST"; // Ĭ�ϼ�����ʵֵST
+//		string companyCode = groupId;
+//		string mp = "M";
+//		if (strcmp(zt2_Source,"�⹺")==0) {
+//			mp = "P";
+//			pmpcType = m_pmpc.pmpcPType;
+//		}
+//		string bpNo = item_id;//rev.getProperty("item_id"); // �DZ���
+//		string zt2_DrawingNo = zt2_DrawingNo1;//rev.getProperty("zt2_DrawingNo");
+//		if (!zt2_DrawingNo.empty()) {
+//			if (strcmp(item_id, zt2_DrawingNo1)!=0)
+//				bpNo = zt2_DrawingNo1;
+//		}
+//		string materialMark = zt2_MaterialMark;//rev.getProperty("zt2_MaterialMark"); // �DZ���
+//
+//		if (materialMark.compare("--")==0) {
+//			materialMark = "";
+//		}
+//		// ��Ʒ�ͺ� //������Ʒ
+//		string productModel = zt2_ProductModel;//rev.getProperty("zt2_ProductModel");
+//		string teRe = "";
+//		string state = ""; // ����ʱΪ��
+//		string wbs = "";
+//		string product = "";
+//		string user = user_id;
+//		string time = now;
+//		string condition = "�����";// Ĭ�������
+//		string desc = object_desc;// properties[5];//rev.getProperty("object_desc");
+//		for (int i = 0; i < specs.size(); i++) {
+//			string json = "{";
+//			string sql22 = "select CHINT_MATERIAL_SEQ.nextval as sid from dual";
+//			int colmun2 = 0, count2 = 0;
+//			char ***outputValue2 = NULL;
+//			QuerySQLNoInputParam((char *)sql22.c_str(), &colmun2, &count2, &outputValue2);
+//			char *projn;
+//			if (count2 > 0) {
+//				projn = outputValue2[0][0];
+//			}
+//			json.append("\"Code\":").append(projn);
+//			string spec = specs[i]; // �DZ���
+//			string feature = "\"Feature\":{";
+//			for (int j = 0; j < m_prds.size(); j++) {
+//				PRD prd = m_prds[j];
+//				//System.out.println(prd.prdFeatureCode + "-" + prd.featureName);
+//				if (strstr(prd.featureName.c_str(),"����")!=NULL) {
+//					feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+//						.append(zt2_MaterialMark).append("\",");
+//				}else if (strstr(prd.featureName.c_str(), "����") != NULL) {
+//					feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+//						.append(goodsName).append("\",");
+//				}
+//				else if (strstr(prd.featureName.c_str(), "�ͺ�") != NULL|| strstr(prd.featureName.c_str(), "���") != NULL) {
+//					feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+//						.append(spec).append("\",");
+//				}
+//				else if (strstr(prd.featureName.c_str(), "ͼ������") != NULL) {
+//					feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+//						.append(bpNo).append("\",");
+//				}
+//				else if (strstr(prd.featureName.c_str(), "������Ʒ") != NULL) {
+//					feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+//						.append(zt2_ProductModel).append("\",");
+//				}
+//				else{
+//					feature.append("\"").append(prd.prdFeatureCode).append("\":\"").append("\",");
+//				}
+//			}
+//			if (strcmp(zt2_SurfaceTreatment, "") != 0) {
+//				feature.append("\"").append("F067").append("\":\"").append(zt2_SurfaceTreatment).append("\",");
+//			}
+//			feature.substr(0, feature.length());
+//			feature.append("},");
+//			string data = "\"data\":[{";
+//			data.append("\"PrhCode").append("\":\"").append(prhCode).append("\",");
+//			data.append("\"PmpcCode").append("\":\"").append(pmpcCode).append("\",");
+//			data.append("\"PmpcType").append("\":\"").append(pmpcType).append("\",");
+//			data.append("\"UnitCode").append("\":\"").append(unitCode).append("\",");
+//			data.append("\"CompanyCode").append("\":\"").append(companyCode).append("\",");
+//			data.append("\"UserCode").append("\":\"").append(user).append("\",");
+//			data.append("\"MP").append("\":\"").append(mp).append("\",");
+//			data.append(feature);
+//			data.append("\"ProductGroupCode").append("\":\"").append("\",");
+//			data.append("\"AssistUnitCode").append("\":\"").append("\",");
+//			data.append("\"UnitQty").append("\":\"").append("\",");
+//			data.append("\"AssistUnitQty").append("\":\"").append("\",");
+//			data.append("\"Desc").append("\":\"").append(desc).append("\",");
+//			data.append("}]");
+//			jsons.push_back(data);
+//			/*uid = "";
+//			Object params[] = new Object[15];
+//			params[0] = code;
+//			params[1] = uid;
+//			params[2] = pmpcCode;
+//			params[3] = goodsCode;
+//			params[4] = goodsName;
+//			params[5] = unitCode;
+//			params[6] = companyCode;
+//			params[7] = bpNo;
+//			params[8] = spec;
+//			params[9] = teRe;
+//			params[10] = state;
+//			params[11] = user;
+//			params[12] = time;
+//			params[13] = condition;
+//			params[14] = "";
+//			drequests.add(obj.toString());
+//			self_lists.add(new SelfMPartBean(code, params, rev, spec, m_code1));*/
+//		}
+//	}
+//}
+//
+//int ApplyMatnr(void* returnValue)
+//{
+//	prds2.clear();
+//	prds.clear();
+//	int ifail = ITK_ok;
+//	//SQLSERVER�������ݿ�
+//	if (open("PLMUser", "PLMUser", "BDP2020", "10.128.20.35")) {
+//		printf("����SQLSERVERʧ��\n");
+//	}
+//	else {
+//		printf("����SQLSERVER�ɹ�\n");
+//	}
+//	{
+//		char selectRecord[200], selectRecord1[200];
+//		sprintf(selectRecord, Sql1.c_str(), m_code1.c_str());
+//		printf("ִ�в�ѯ %s\n", selectRecord);
+//		int outputColumn = 0, outputValueCount = 0;
+//		char*** outputValue = NULL;
+//		ado_QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+//		string pmpcPrhCode, pmpcPType, pmpcMType;
+//		for (int j = 0; j < outputValueCount; j++) {
+//			pmpcPrhCode = outputValue[j][0];
+//			pmpcPType = outputValue[j][1];
+//			pmpcMType = outputValue[j][2];
+//			pmpc.m_code = m_code1;
+//			pmpc.pmpcPrhCode = pmpcPrhCode;
+//			pmpc.pmpcPType = pmpcPType;
+//			pmpc.pmpcMType = pmpcMType;
+//		}
+//		sprintf(selectRecord1, Sql2.c_str(), pmpcPrhCode.c_str());
+//		int outputColumn1 = 0, outputValueCount1 = 0;
+//		char*** outputValue1 = NULL;
+//		ado_QuerySQLNoInputParam(selectRecord1, &outputColumn1, &outputValueCount1, &outputValue1);
+//		for (int j = 0; j < outputValueCount1; j++) {
+//			string prdFeatureCode = outputValue1[j][3];
+//			string featureName = outputValue1[j][4];
+//			PRD prd;
+//			prd.prdFeatureCode = prdFeatureCode;
+//			prd.featureName = featureName;
+//			prds.push_back(prd);
+//		}
+//	}
+//	{
+//		char selectRecord[200], selectRecord1[200];
+//		sprintf(selectRecord, Sql1.c_str(), m_code2.c_str());
+//		printf("ִ�в�ѯ %s\n", selectRecord);
+//		int outputColumn = 0, outputValueCount = 0;
+//		char*** outputValue = NULL;
+//		ado_QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+//		string pmpcPrhCode, pmpcPType, pmpcMType;
+//		for (int j = 0; j < outputValueCount; j++) {
+//			pmpcPrhCode = outputValue[j][0];
+//			pmpcPType = outputValue[j][1];
+//			pmpcMType = outputValue[j][2];
+//			pmpc2.m_code = m_code2;
+//			pmpc2.pmpcPrhCode = pmpcPrhCode;
+//			pmpc2.pmpcPType = pmpcPType;
+//			pmpc2.pmpcMType = pmpcMType;
+//		}
+//		sprintf(selectRecord1, Sql2.c_str(), pmpcPrhCode.c_str());
+//		int outputColumn1 = 0, outputValueCount1 = 0;
+//		char*** outputValue1 = NULL;
+//		ado_QuerySQLNoInputParam(selectRecord1, &outputColumn1, &outputValueCount1, &outputValue1);
+//		for (int j = 0; j < outputValueCount1; j++) {
+//			string prdFeatureCode = outputValue1[j][3];
+//			string featureName = outputValue1[j][4];
+//			PRD prd;
+//			prd.prdFeatureCode = prdFeatureCode;
+//			prd.featureName = featureName;
+//			prds2.push_back(prd);
+//		}
+//	}
+//	printf("prds2.size()%d\n", prds2.size());
+//	printf("prds1.size()%d\n", prds.size());
+//	char *revUid;
+//	tag_t tzRev;
+//	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+//	ITK__convert_uid_to_tag(revUid, &tzRev);
+//	vector<tag_t> bomLineVec;
+//	int bvr_count = 0, c_line_count;
+//	tag_t ebom_window = NULLTAG;
+//	tag_t bom_line = NULLTAG;
+//	tag_t item_tag = NULLTAG, *c_line_tags;
+//	(BOM_create_window(&ebom_window));
+//	tag_t* bvr_list = NULL, owning_group, owning_user;
+//	char *grpId,*user_id;
+//	AOM_ask_value_tag(tzRev, "owning_user", &owning_user);
+//	AOM_ask_value_tag(tzRev,"owning_group",&owning_group);
+//	AOM_ask_value_string(owning_group,"name",&grpId);
+//	AOM_ask_value_string(owning_user, "user_id", &user_id);
+//	
+//	groupId = grpId;
+//	(ITEM_rev_list_bom_view_revs(tzRev, &bvr_count, &bvr_list));
+//
+//	ITKCALL(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+//	bomLineVec.push_back(bom_line);
+//	listBom(bom_line, bomLineVec);
+//	string error;
+//	map<tag_t, vector<string>> general_maps;
+//	for (int i = 0; i < bomLineVec.size(); i++) {
+//		getRevs(bomLineVec[i], error, general_maps);
+//	}
+//
+//	close();
+//	time_t now;
+//	struct tm *p;
+//	time(&now);
+//	p = localtime(&now);
+//	char buffer[80];
+//	sprintf_s(buffer, "%04d%02d%02d %02d:%02d:%02d", 1900 + p->tm_year, p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
+//	string now1 = buffer;
+//
+//	int url_num = 0;
+//	char ** url_vals = NULL;
+//	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+//	string url = url_vals[0];
+//	url.append("/").append(url_vals[2]);
+//
+//	printf("url ==> %s \n", url.c_str());
+//	if (ConnServer(url_vals[3], url_vals[4], (char *)url.c_str()) == -1)
+//	{
+//		printf("��ʾ:�м����ݱ�����ʧ��\n");
+//		ifail = 1;
+//		return ifail;
+//	}
+//	vector<string> jsons;
+//	send1(general_maps, now1, user_id, jsons);
+//
+//	DisConnServer();
+//	BOM_close_window(ebom_window);
+//	
+//	//ORACLE���ݿ����
+//}	
+//
+//
+//
+//
+//
+//
diff --git a/General/General/AutoFeeding.cpp b/General/General/AutoFeeding.cpp
new file mode 100644
index 0000000..aae048c
--- /dev/null
+++ b/General/General/AutoFeeding.cpp
@@ -0,0 +1,787 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+using namespace std;
+
+tag_t getPBomTag(tag_t designRev) {
+	char* object_type;
+	AOM_ask_value_string(designRev, "object_type", &object_type);
+	if (strcmp(object_type, "ZT2_Design3DRevision") == 0) {
+		int num;
+		tag_t* mantrs;
+		ITKCALL(AOM_ask_value_tags(designRev, "representation_for", &num, &mantrs));
+		return mantrs[0];
+	}
+	else if (strcmp(object_type, "Part Revision") == 0) {
+		return designRev;
+	}
+}
+void SplitTest(string strArg, string spliter, vector<string> &ans)
+{
+	ans.clear();
+	size_t index0;
+	string one_arg;
+	if (strArg.find_first_not_of(' ') == string::npos)
+		strArg = "";
+	while (strArg.size() > 0)
+	{
+		index0 = strArg.find(spliter);
+		if (index0 != string::npos)
+		{
+			one_arg = strArg.substr(0, index0);
+			strArg = strArg.substr(index0 + spliter.size());
+			ans.push_back(one_arg);
+		}
+		else
+		{
+			ans.push_back(strArg);
+			break;
+		}
+	}
+}
+void getDrawNo(tag_t bom_line, string &drawNo) {
+	char* bl_desc;
+	AOM_ask_value_string(bom_line, "bl_rev_object_desc", &bl_desc);
+	regex qq_reg2("^1ZDB5.*\\d{1,}1000X.*");
+	//string item_id = id;
+	AOM_ask_value_string(bom_line, "bl_rev_object_desc", &bl_desc);
+	vector<string> descVec1;
+	SplitTest(bl_desc, " ", descVec1);
+	printf("bl_desc===>%s\n", bl_desc);
+	if (descVec1.size() > 1) {
+		string drawNos = descVec1[1];
+		printf("drawNos===>%s\n", descVec1[0].c_str());
+		printf("drawNos===>%s\n", drawNos.c_str());
+		vector<string> drawNoVec1;
+		SplitTest(drawNos, "-", drawNoVec1);
+		if (drawNoVec1.size() > 1) {
+			drawNo = drawNoVec1[0];
+			smatch result;
+			/*if (drawNoVec1.size() == 3) {
+				drawNo = drawNo.append();
+			}*/
+			bool ret = regex_match(drawNo, result, qq_reg2);
+			if (ret) {
+				drawNo = "1ZDB5*10000X";
+			}
+		}
+	}
+}
+//����PBOM
+//void 
+typedef struct {
+	string name;//��Ʒ�ͺ� �͡��С��ߡ�������
+	string zzmb;
+	string xh;
+	string tlth;
+	string type;
+	string tl;
+	string yjgx;
+	string ejgx;
+}FeedRule;
+
+struct StBomBean {
+	string currentName;//��Ʒ�ͺ� �͡��С��ߡ�������
+	tag_t bomline;
+	boolean st = false;
+	boolean istl = false;
+	boolean flag = true; //��һ�㼶
+	vector<StBomBean> childs;
+
+};
+
+boolean isSt(tag_t matnr) {
+	int cnt2, numFac, cnt3;
+	boolean flag = false;
+	char** procureType, ** factorys, ** specialProcureType,*objName;
+	AOM_ask_value_strings(matnr, "zt2_SZSpecialProcuretype", &cnt3, &specialProcureType); //Ϊ/
+	AOM_ask_value_strings(matnr, "zt2_SZProcuretype", &cnt2, &procureType); //��������
+	AOM_ask_value_strings(matnr, "zt2_SZFactory", &numFac, &factorys);
+	//AOM_ask_value_string(matnr, "object_name",&objName);
+	for (int i = 0; i < numFac; i++) {
+		if (strcmp(factorys[i], "M060") == 0 && cnt2 > i && cnt3 > i) {
+			if (strstr(procureType[i], "����") != NULL && strcmp(specialProcureType[i], "/") == 0) {
+				flag = true;
+			}
+		}
+	}
+	
+	return flag;
+}
+void getBomMessage(vector<StBomBean>& stBomlines, tag_t cBomLine, StBomBean &pBean) {
+
+	int c_line_count;
+	tag_t * c_line_tags;
+	//char* parentName;
+	//ITKCALL(AOM_ask_value_tag(pBomLine, "bl_line_object", &mantr));
+	//ITKCALL(AOM_ask_value_string(mantr, "object_name", &parentName));
+	ITKCALL(BOM_line_ask_all_child_lines(cBomLine, &c_line_count, &c_line_tags));
+	tag_t cmantr;
+	char* cName;
+	ITKCALL(AOM_ask_value_tag(cBomLine, "bl_line_object", &cmantr));
+	ITKCALL(AOM_ask_value_string(cmantr, "object_name", &cName));
+	printf("�����===>%s\n", cName);
+	StBomBean bean;
+	bean.bomline = cBomLine;
+	bean.currentName = cName;
+	bean.flag = false;
+	if (c_line_count > 0 && isSt(cmantr)) {
+		bean.st = true;
+		//stBomlines.push_back(bean);
+		pBean.childs.push_back(bean);
+	}
+	else if (c_line_count == 0) {
+		bean.st = true;
+		//	stBomlines.push_back(bean);
+		pBean.childs.push_back(bean);
+	}
+	else {
+		for (int i = 0; i < c_line_count; i++) {
+			tag_t c_line_tag = c_line_tags[i];
+			getBomMessage(stBomlines, c_line_tag, bean);
+		}
+		//	stBomlines.push_back(bean);
+		pBean.childs.push_back(bean);
+	}
+}
+void getBomMessage(vector<StBomBean> &stBomlines, tag_t cBomLine) {
+
+	int c_line_count;
+	tag_t * c_line_tags;
+	//char* parentName;
+	//ITKCALL(AOM_ask_value_tag(pBomLine, "bl_line_object", &mantr));
+	//ITKCALL(AOM_ask_value_string(mantr, "object_name", &parentName));
+	ITKCALL(BOM_line_ask_all_child_lines(cBomLine, &c_line_count, &c_line_tags));
+	tag_t cmantr;
+	char* cName;
+	ITKCALL(AOM_ask_value_tag(cBomLine, "bl_line_object", &cmantr));
+	ITKCALL(AOM_ask_value_string(cmantr, "object_name", &cName));
+	StBomBean bean;
+	bean.bomline = cBomLine;
+	bean.currentName = cName;
+	if (c_line_count > 0 && isSt(cmantr)) {
+		bean.st = true;
+		stBomlines.push_back(bean);
+	}
+	else if (c_line_count == 0) {
+		bean.st = true;
+		stBomlines.push_back(bean);
+		//printf("st = true===>%s\n", cName);
+	}
+	else {
+		//���������չ�� //ʵ���ֱ��Ͷ��
+		printf("�����============>%s\n", cName);
+		for (int i = 0; i < c_line_count; i++) {
+			tag_t c_line_tag = c_line_tags[i];
+			getBomMessage(stBomlines, c_line_tag, bean);
+		}
+		stBomlines.push_back(bean);
+		printf("�����===========>%d\n", bean.childs.size());
+	}
+}
+//��������չ����ʵ��Ͷ��
+void autoFeedLike(tag_t towGxLine, StBomBean& pBean, vector<StBomBean>& stBomlines,double xnQty) {
+	if (!pBean.st) {
+		char* qty;
+		tag_t line = pBean.bomline;
+		AOM_ask_value_string(line,"bl_quantity",&qty);
+		if (strcmp(qty,"") == 0) {
+			qty = "1";
+		}
+		double x = atof(qty);
+		printf("pBean.childs==>%d %s \n", pBean.childs.size(), qty);
+		for (int i = 0; i < pBean.childs.size(); i++) {
+			StBomBean& child = pBean.childs[i];
+			autoFeedLike(towGxLine, child, stBomlines, xnQty*x);
+		}
+	}
+	else if (!pBean.istl) {
+
+		pBean.istl = true;
+		tag_t newChild;
+		tag_t *c_line_tags;
+		int c_line_count;
+		ITKCALL(BOM_line_ask_all_child_lines(towGxLine, &c_line_count, &c_line_tags)); // һ������
+		string bl_seq = to_string((c_line_count+1) * 10);
+		char *bl_qty;
+		
+		AOM_ask_value_string(pBean.bomline,"bl_quantity",&bl_qty);
+		double x = atof(bl_qty);
+		double xx = xnQty * x;
+		string bl_quantity = bl_qty;
+		if (fmod(xx, 1.0) == 0.0) {
+			bl_quantity = to_string((int)xx);
+		}
+		else {
+			bl_quantity = to_string(xx);
+		}
+		ITKCALL(BOM_line_copy(towGxLine, pBean.bomline, NULLTAG, &newChild));
+		printf("bl_quantity==>%s\n", bl_quantity.c_str());
+		AOM_lock(newChild); // bl_occ_type
+		//������������
+		ITKCALL(AOM_set_value_string(newChild, "bl_sequence_no", bl_seq.c_str()));
+		ITKCALL(AOM_set_value_string(newChild, "bl_quantity", bl_quantity.c_str()));
+		ITKCALL(AOM_set_value_string(newChild,"bl_occ_type","MEConsumed"));
+		ITKCALL(AOM_save(newChild));
+		ITKCALL(AOM_unlock(newChild));
+
+	}
+}
+void autoFeedLike(tag_t towGxLine, StBomBean& pBean, string name2, vector<StBomBean>& stBomlines) {
+
+	//��������ģ��ƥ��
+	printf(" pBean.childs.size()%d\n", pBean.childs.size());
+	for (int i = 0; i < pBean.childs.size(); i++) {
+		StBomBean& child = pBean.childs[i];
+		printf("child.currentName%s   %s \n", child.currentName.c_str(), name2.c_str());
+		if (strstr(name2.c_str(), "*") != NULL) {
+			vector<string> liVec;
+			string nameLike;
+			SplitTest(name2, "*", liVec);
+			for (int x = 0; x < liVec.size(); x++) {
+				if (!liVec[x].empty()) {
+					nameLike = liVec[x];
+					break;
+				}
+			}
+			if (strstr(child.currentName.c_str(), nameLike.c_str()) != NULL) {
+				autoFeedLike(towGxLine, child, stBomlines,1);
+			}
+		}else if (name2.compare(child.currentName) == 0) {
+			printf("===================\n");
+			autoFeedLike(towGxLine, child, stBomlines,1);
+		}
+	}
+}
+//ȥ�����еĹ���
+void cutGxLine(tag_t bom_line) {
+	tag_t *c_line_tags;
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+	for (int i = 0; i < c_line_count; i++) {
+		char *bl_occ_type;
+		AOM_ask_value_string(c_line_tags[i],"bl_occ_type",&bl_occ_type);
+		if (strcmp(bl_occ_type,"MEConsumed")==0) {
+			BOM_line_cut(c_line_tags[i]);
+		}
+	}
+
+}
+
+void startFeed(tag_t meprocess, vector<StBomBean>& stBomlines, FeedRule bean, string name1, string name2) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(meprocess, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+	//һ������
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGx = c_line_tags[i], *towGxLines;
+		int c_cnt = 0;
+		char* yjName;
+		tag_t yjGx;
+		ITKCALL(AOM_ask_value_tag(oneGx, "bl_line_object", &yjGx));
+		AOM_ask_value_string(yjGx, "object_name", &yjName);
+		printf("yjName%s %s \n", yjName, bean.yjgx.c_str());
+		if (bean.yjgx.compare(yjName) == 0) {
+			BOM_line_ask_all_child_lines(oneGx, &c_cnt, &towGxLines);
+			//��������
+			for (int j = 0; j < c_cnt; j++) {
+				tag_t towGxLine = towGxLines[j];
+				char* ejName;
+				tag_t ejGx;
+				ITKCALL(AOM_ask_value_tag(towGxLine, "bl_line_object", &ejGx));
+				AOM_ask_value_string(ejGx, "object_name", &ejName);
+				printf("ejName%s %s\n", ejName, bean.ejgx.c_str());
+				if (bean.ejgx.compare(ejName) == 0) {
+					printf("stBomlines %d\n", stBomlines.size());
+					cutGxLine(towGxLine);
+					for (int t = 0; t < stBomlines.size(); t++) {
+						StBomBean& stBom = stBomlines[t];
+						tag_t newChild;
+						printf("stBom.currentName==>%s %d\n", stBom.currentName.c_str(), stBom.childs.size());
+						if (stBom.currentName.compare(name1) == 0) {
+							//if (!stBom.istl && stBom.st && stBom.flag) {
+							autoFeedLike(towGxLine, stBom, name2, stBomlines);
+							//stBom.istl = true;
+							//}
+						}
+					}
+				}
+			}
+		}
+	}
+	BOM_save_window(ebom_window);
+	BOM_close_window(ebom_window);
+}
+//ƥ��һ������Ͷ�����������
+void startFeed(tag_t meprocess, vector<StBomBean>& stBomlines, FeedRule bean, vector<string> names) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(meprocess, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+	//һ������
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGx = c_line_tags[i], *towGxLines;
+		int c_cnt = 0;
+		char* yjName;
+		tag_t yjGx;
+		ITKCALL(AOM_ask_value_tag(oneGx, "bl_line_object", &yjGx));
+		AOM_ask_value_string(yjGx, "object_name", &yjName);
+		if (bean.yjgx.compare(yjName) == 0) {
+			BOM_line_ask_all_child_lines(oneGx, &c_cnt, &towGxLines);
+			//��������
+			for (int j = 0; j < c_cnt; j++) {
+				tag_t towGxLine = towGxLines[j];
+				char* ejName;
+				tag_t ejGx;
+				ITKCALL(AOM_ask_value_tag(towGxLine, "bl_line_object", &ejGx));
+				AOM_ask_value_string(ejGx, "object_name", &ejName);
+				if (bean.ejgx.compare(ejName) == 0) {
+					cutGxLine(towGxLine);
+					for (int t = 0; t < stBomlines.size(); t++) {
+						StBomBean& stBom = stBomlines[t];
+						tag_t newChild;
+						if (std::find(names.begin(), names.end(), stBom.currentName) != names.end() && stBom.flag) {
+							printf("stBom.currentName2%s %d\n", stBom.currentName.c_str(), !stBom.istl);
+							if (!stBom.istl) {
+								//Ͷ�� δͶ�ϵ�
+								autoFeedLike(towGxLine, stBom, stBomlines,1);
+								stBom.istl = true;
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	BOM_save_window(ebom_window);
+	BOM_close_window(ebom_window);
+}
+void startFeed(tag_t meprocess, vector<StBomBean>& stBomlines, FeedRule bean, string nameLike) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(meprocess, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+	//һ������
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGx = c_line_tags[i], *towGxLines;
+		int c_cnt = 0;
+		char* yjName;
+		tag_t yjGx;
+		ITKCALL(AOM_ask_value_tag(oneGx, "bl_line_object", &yjGx));
+		AOM_ask_value_string(yjGx, "object_name", &yjName);
+		printf("yjName===>%s  %s \n", yjName, bean.yjgx.c_str());
+		boolean falg = false;
+		if (strstr(bean.yjgx.c_str(), "*") != NULL) {
+			vector<string> liVec;
+			string gxlike;
+			Split(bean.yjgx, "*", liVec);
+			for (int x = 0; x < liVec.size(); x++) {
+				if (!liVec[x].empty()) {
+					gxlike = liVec[x];
+					if (strstr(yjName, gxlike.c_str()) != NULL) {
+						falg = true;
+					}
+				}
+			}
+		}
+		if (bean.yjgx.compare(yjName) == 0 || falg) {
+			BOM_line_ask_all_child_lines(oneGx, &c_cnt, &towGxLines);
+			//��������
+			for (int j = 0; j < c_cnt; j++) {
+				tag_t towGxLine = towGxLines[j];
+				char* ejName;
+				tag_t ejGx;
+				ITKCALL(AOM_ask_value_tag(towGxLine, "bl_line_object", &ejGx));
+				AOM_ask_value_string(ejGx, "object_name", &ejName);
+				printf("ejName===>%s \n", ejName);
+				if (bean.ejgx.compare(ejName) == 0) {
+					cutGxLine(towGxLine);
+					for (int t = 0; t < stBomlines.size(); t++) {
+						StBomBean& stBom = stBomlines[t];
+						tag_t newChild;
+						//printf("Tlstart===>%s %d %d\n", stBom.currentName.c_str(), stBom.st, !stBom.istl);
+						//printf("Tlstart===>%d %d\n", );
+						printf("stBom.currentName2==>%s %d\n", stBom.currentName.c_str(), !stBom.istl);
+						if (!nameLike.empty()) {
+							if (strstr(stBom.currentName.c_str(), nameLike.c_str()) != NULL) {
+								printf("stBom.currentName2==>%s %d\n", stBom.currentName.c_str(), !stBom.st);
+								if (!stBom.istl && stBom.flag) {
+									autoFeedLike(towGxLine, stBom, stBomlines,1);
+									stBom.istl = true;
+								}
+							}
+						}
+						else if (!stBom.istl) {
+							autoFeedLike(towGxLine, stBom, stBomlines,1);
+							stBom.istl = true;
+							//ITKCALL(BOM_line_copy(towGxLine, stBom.bomline, NULLTAG, &newChild));
+						}
+						//ITKCALL(AOM_save(newChild));
+					}
+					break;
+				}
+			}
+		}
+	}
+	BOM_save_window(ebom_window);
+	BOM_close_window(ebom_window);
+}
+//map<string, vector<FeedRule>> drawMap;
+//map<string, vector<FeedRule>> nameMap;
+void AutoFeedBom(tag_t mantr,tag_t meprocess,
+	map<string, vector<FeedRule>> drawMap, map<string, vector<FeedRule>> nameMap) {
+	//����PBOM
+	tag_t* bvr_list = NULL, ebom_window, bom_line;
+	int bvr_count;
+	ITKCALL(ITEM_rev_list_bom_view_revs(mantr, &bvr_count, &bvr_list));
+	ITKCALL(BOM_create_window(&ebom_window));
+	ITKCALL(BOM_set_window_top_line(ebom_window, NULL, mantr, NULLTAG, &bom_line));
+
+	int c_line_count;
+	tag_t * c_line_tags;
+	vector<StBomBean> stBomlines;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	for (int i = 0; i < c_line_count; i++) {
+		//����BOM��ȡ��ҪͶ�ϵ���Ϣ
+		getBomMessage(stBomlines, c_line_tags[i]);
+	}
+	string drawNo;
+	getDrawNo(bom_line, drawNo);
+	printf("����Ŀ��=====>%s\n", drawNo.c_str());
+	//
+	if (drawMap.count(drawNo) > 0) {
+		//ͼ��ƥ��
+		vector<FeedRule> beans = drawMap[drawNo];
+		printf("beans===>%d\n", beans.size());
+		for (int t = 0; t < beans.size(); t++) {
+			FeedRule bean = beans[t];
+			if (bean.tlth.empty()) {
+				//ȫͶ
+				printf("beans===>%s %s\n", bean.yjgx.c_str(), bean.ejgx.c_str());
+				startFeed(meprocess, stBomlines, bean, "");
+			}
+			else {
+				//ʣ��ȫͶ
+				printf("beans===>%s\n", bean.tlth.c_str());
+				if (bean.tlth.compare("else") == 0) {
+					startFeed(meprocess, stBomlines, bean, "");
+				}
+				else {
+					string nameMatnr = bean.tlth;
+					//������ģ��ƥ��Ͷ
+					if (strstr(nameMatnr.c_str(), "*") != NULL) {
+						vector<string> liVec;
+						string nameLike;
+						SplitTest(nameMatnr, "*", liVec);
+						for (int x = 0; x < liVec.size(); x++) {
+							if (!liVec[x].empty()) {
+								nameLike = liVec[x];
+							}
+						}
+						startFeed(meprocess, stBomlines, bean, nameLike);
+					}
+					else {
+						//�����ƾ�׼ƥ��Ͷ��
+						if (strstr(nameMatnr.c_str(), "\\") != NULL) {
+							vector<string> names;
+							SplitTest(nameMatnr, "\\", names);
+							startFeed(meprocess, stBomlines, bean, names[0], names[1]);
+						}
+						else {
+							vector<string> names;
+							SplitTest(nameMatnr, ";", names);
+							startFeed(meprocess, stBomlines, bean, names);
+						}
+					}
+				}
+			}
+		}
+	}
+	else {
+		//map<string, vector<FeedRule>> nameMap;
+		map<string, vector<FeedRule>>::iterator it;
+		//����ģ��ƥ��
+		for (it = nameMap.begin(); it != nameMap.end(); it++) {
+			string s = it->first;
+			char* nowName;
+			AOM_ask_value_string(mantr, "object_name", &nowName);
+			if (strstr(nowName, s.c_str()) != NULL) {
+				vector<FeedRule> beans = nameMap[s];
+				printf("beans===>%d\n", beans.size());
+				for (int t = 0; t < beans.size(); t++) {
+					FeedRule bean = beans[t];
+					printf("beans===>%s %s\n", bean.yjgx.c_str(), bean.ejgx.c_str());
+					if (bean.tlth.empty()) {
+						//ȫͶ
+						startFeed(meprocess, stBomlines, bean, "");
+					}
+					else {
+						//ʣ��ȫͶ
+						if (bean.tlth.compare("else") == 0) {
+							startFeed(meprocess, stBomlines, bean, "");
+						}
+						else {
+							string nameMatnr = bean.tlth;
+							//������ģ��ƥ��Ͷ
+							if (strstr(nameMatnr.c_str(), "*") != NULL) {
+								vector<string> liVec;
+								string nameLike;
+								SplitTest(nameMatnr, "*", liVec);
+								for (int x = 0; x < liVec.size(); x++) {
+									if (!liVec[x].empty()) {
+										nameLike = liVec[x];
+									}
+								}
+								startFeed(meprocess, stBomlines, bean, nameLike);
+							}
+							else {
+								//�����ƾ�׼ƥ��Ͷ��
+								if (strstr(nameMatnr.c_str(), "\\") != NULL) {
+									vector<string> names;
+									SplitTest(nameMatnr, "\\", names);
+									printf("beans===>%s %s\n", names[0].c_str(), names[1].c_str());
+									startFeed(meprocess, stBomlines, bean, names[0], names[1]);
+								}
+								else {
+									vector<string> names;
+									SplitTest(nameMatnr, ";", names);
+									startFeed(meprocess, stBomlines, bean, names);
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+
+
+	ITKCALL(BOM_close_window(ebom_window));
+}
+
+void readPbomMsg(tag_t bom_line,string &errBuffer, 
+	map<string, vector<FeedRule>> drawMap, map<string, vector<FeedRule>> nameMap,char *loginId) {
+	int c_line_count;
+	tag_t * c_line_tags;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	tag_t rev;
+	char *id,*objName;
+	ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &rev));
+	AOM_ask_value_string(rev, "item_id", &id);
+	AOM_ask_value_string(rev, "object_name", &objName);
+	if (c_line_count > 0 && (isSt(rev)|| strstr(objName, "��ѹ��") != NULL)) {
+
+		int n_references = 0;
+		int* levels = 0;
+		tag_t* references_tag = NULLTAG, user;
+		char** relation_type_name = NULL,*duser;
+		//ͨ�����ù�ϵ���ҵ������
+		ITKCALL(WSOM_where_referenced(rev, 1, &n_references, &levels, &references_tag, &relation_type_name));
+		//boolean hasProcess = false;
+		int meNum = 0;
+		tag_t meprocess;
+		AOM_ask_value_tag(rev, "owning_user", &user);
+		AOM_ask_value_string(user, "user_id", &duser);
+		for (int i = 0; i < n_references; i++)
+		{
+			char* refType;
+			tag_t refTag = references_tag[i];
+			AOM_ask_value_string(refTag, "object_type", &refType);
+			if (strcmp(refType, "MEProcessRevision") == 0) {
+				//hasProcess = true;
+				//break;
+				meNum = meNum + 1;
+				meprocess = refTag;
+			}
+		}
+		printf("loginUser===>%s,ownerUser===>%s\n",loginId, duser);
+		//if (strcmp(duser, loginId) == 0) {
+		if (meNum == 0) {
+			errBuffer.append(id).append(":��������պ����²���.\n");
+			//return 1;
+		}
+		if (meNum > 1) {
+			errBuffer.append(id).append("��ȡ������������պ����²���.\n");
+			//return 1;
+		}
+		if (meNum == 1) {
+			AutoFeedBom(rev, meprocess, drawMap, nameMap);
+		}
+		//}
+	}
+	for (int i = 0; i < c_line_count; i++) {
+		readPbomMsg(c_line_tags[i], errBuffer, drawMap, nameMap, loginId);
+	}
+}
+
+//int EbomToPMethod(void *returnValue);
+int AutoFeeding(void *returnValue) {
+	string sql = "select MC,ZZMB,XH,TLTH,LX,TL,YJGX,EJGX from CHINT_GYGL_001 WHERE LX is not NULL ORDER BY XH ";
+
+	/*string sql22 = "select CHINT_MATERIAL_SEQ.nextval as sid from dual";
+	int colmun2 = 0, count2 = 0;
+	char*** outputValue2 = NULL;
+	printf("search1");
+	QuerySQLNoInputParam((char*)sql22.c_str(), &colmun2, &count2, &outputValue2);*/
+	char *loginId;
+	POM_get_user_id(&loginId);
+	int ifail = ITK_ok;
+	tag_t matnrRev;
+	char *revUid;
+	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+	ITK__convert_uid_to_tag(revUid, &matnrRev);
+
+	string errBuffer;
+	tag_t mantr = getPBomTag(matnrRev);
+	
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+	string errorBuff;
+	//map<string,
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		//ifail = 1;
+	}
+	char selectCPZ[200], selectGyId[200];
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	sprintf(selectGyId, sql.c_str());
+	printf("search2 %s \n", selectGyId);
+	QuerySQLNoInputParam(selectGyId, &outputColumn1, &outputValueCount1, &outputValue1);
+	printf("search22\n");
+	map<string, vector<FeedRule>> drawMap;
+	map<string, vector<FeedRule>> nameMap;
+	for (int j = 0; j < outputValueCount1; j++) {
+		string name = outputValue1[j][0];
+		string zzmb = outputValue1[j][1];
+		string num = outputValue1[j][2];
+		string tlth = outputValue1[j][3];
+		string type = outputValue1[j][4];
+		string tl = outputValue1[j][5];
+		string yjgx = outputValue1[j][6];
+		string ejgx = outputValue1[j][7];
+		FeedRule ruleBean;
+		ruleBean.name = name;
+		ruleBean.zzmb = zzmb;
+		ruleBean.xh = num;
+		ruleBean.tlth = tlth;
+		ruleBean.type = type;
+		ruleBean.tl = tl;
+		ruleBean.yjgx = yjgx;
+		ruleBean.ejgx = ejgx;
+		if (strstr(zzmb.c_str(), "ZDB") != NULL) {
+			if (drawMap.count(zzmb) == 0) {
+				vector<FeedRule> feedRuleVec;
+				feedRuleVec.push_back(ruleBean);
+				drawMap[zzmb] = feedRuleVec;
+			}
+			else {
+				drawMap[zzmb].push_back(ruleBean);
+			}
+		}
+		else {
+			if (nameMap.count(zzmb) == 0) {
+				vector<FeedRule> feedRuleVec;
+				feedRuleVec.push_back(ruleBean);
+				nameMap[zzmb] = feedRuleVec;
+			}
+			else {
+				nameMap[zzmb].push_back(ruleBean);
+			}
+		}
+	}
+
+	//����BOM��ȡ����ҪͶ�ϵ�
+	tag_t* bvr_list = NULL, ebom_window, bom_line;
+	int bvr_count;
+	ITKCALL(ITEM_rev_list_bom_view_revs(mantr, &bvr_count, &bvr_list));
+	ITKCALL(BOM_create_window(&ebom_window));
+	ITKCALL(BOM_set_window_top_line(ebom_window, NULL, mantr, NULLTAG, &bom_line));
+
+	readPbomMsg(bom_line, errBuffer, drawMap, nameMap, loginId);
+
+	ITKCALL(BOM_close_window(ebom_window));
+	
+
+	//readProcessBom(bom_line, errorBuff);
+	string buff = errBuffer;
+	if (buff.empty()) {
+		buff = "succ";
+	}
+	*((char**)returnValue) = (char*)MEM_alloc((strlen(buff.c_str()) + 1) * sizeof(char));
+	tc_strcpy(*((char**)returnValue), buff.c_str());
+	DisConnServer();
+	return ITK_ok;
+}
\ No newline at end of file
diff --git a/General/General/AutomaticRelease.cpp b/General/General/AutomaticRelease.cpp
new file mode 100644
index 0000000..6b6a85e
--- /dev/null
+++ b/General/General/AutomaticRelease.cpp
@@ -0,0 +1,212 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <epm/epm_task_template_itk.h>
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include "error_handling.h"
+
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+int AutomaticRelease(EPM_action_message_t msg)
+{
+	cout<<"����������Զ�����"<<endl;
+	int ifail = ITK_ok,  i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL,*attachments2 = NULL;;
+//	tag_t *release_status=NULL;
+	int rs_num=0;
+//	char *value=NULL;
+	char * object_type=NULL;
+	char * object_type2=NULL;
+//	tag_t *targets=NULLTAG;
+	task_tag = msg.task;
+	int num1=0;
+	int num2=0;
+	tag_t * primary=NULLTAG;
+	tag_t * second=NULLTAG;
+	tag_t * only=NULLTAG; int num3=0;
+	tag_t * final=NULLTAG;
+	//��ȡ�����̽ڵ�
+	vector<tag_t>	target_vec;
+	vector<tag_t>	target_vec2;//��� OA��������µ�����
+	ITKCALL(	ifail = EPM_ask_root_task(task_tag, &rootTask_tag));
+	//��ȡĿ�����ö���
+	ITKCALL(	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments));
+	//ѭ��Ŀ�����	
+	for (int i=0;i<att_cnt;i++)
+	{
+		//DL2_Part
+		ITKCALL(ifail=AOM_ask_value_string(attachments[i],"object_type",&object_type));
+
+		if(strcmp(object_type,"DL2_PartRevision")==0)//TODO  �޶��������̵İ汾����
+		{
+//			target_vec.push_back(attachments[i]);
+			//TODO ������汾��α�ļ��й��������㲿����DL2_Achangeparts���������㲿���汾���汾�����ϴ�������
+			ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"DL2_Achangeparts",&num1,&primary));
+			for (int j=0;j<num1;j++)
+			{
+				//TODO ����ǰ汾��������������,���˵��ǰ汾����
+				ITKCALL(ifail = AOM_ask_value_string(primary[j], "object_type",&object_type2));
+				if (((strstr(object_type2,"Revision") != NULL) || (strstr(object_type2,"revision") != NULL))
+					&&(strstr(object_type2,"Master") == NULL) &&(strstr(object_type2,"master") == NULL)
+					&& (strstr(object_type2,"BOM") ==NULL) && (strstr(object_type2,"bom") ==NULL) && (strstr(object_type2,"Bom") == NULL))	
+				{
+					target_vec.push_back(primary[j]);
+					ITKCALL(ifail=AOM_ask_value_tags(primary[j],"IMAN_specification",&num2,&second));
+					for (int k=0;k<num2;k++)
+					{
+						target_vec.push_back(second[k]);
+					}
+					ITKCALL(ifail=AOM_ask_value_tags(primary[j],"TC_Attaches",&num2,&second));
+					for (int k=0;k<num2;k++)
+					{
+						target_vec.push_back(second[k]);
+					}
+				}
+
+			}
+//			//TODO ���α�ļ���OA���������DL2_CMAttachment���µ�����
+//			ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"DL2_CMAttachment",&num1,&primary));
+//			for (int j=0;j<num1;j++)
+//			{
+//				target_vec2.push_back(primary[j]);
+//
+//			}
+		}
+	}
+
+	//TODO �Ѱ汾α�ļ����µİ汾�Լ��汾�µ��������ϴ�������
+	int *att_types=NULL;
+	att_types = (int*) MEM_alloc (sizeof(int) * ( target_vec.size() ));
+	attachments2 = (tag_t*) MEM_alloc (sizeof(tag_t) * ( target_vec.size() ));
+	//�ƶ�Ŀ�꣬����ת��
+	for ( int indx = 0; indx < target_vec.size(); indx++ )
+	{
+		att_types[indx] = EPM_target_attachment;//EPM_reference_attachment;
+		attachments2[indx] = target_vec[indx];
+	}
+	//�����еİ汾�����ӵ�������
+	ITKCALL(EPM_add_attachments(rootTask_tag,target_vec.size(),attachments2,att_types));
+
+	//TODO �Ѱ汾α�ļ���OA���������DL2_CMAttachment���µ����ϵİ汾���Ƶ���һ�����OA���������DL2_CMAttachment��α�ļ�����
+	cout<<"target_vec.size()-------------"<<target_vec.size()<<endl;
+	for (int i=0;i<att_cnt;i++)
+	{
+		ITKCALL(ifail=AOM_ask_value_string(attachments[i],"object_string",&object_type));
+		cout<<"object_string------------"<<object_type<<endl;
+		ITKCALL(ifail=AOM_ask_value_string(attachments[i],"object_type",&object_type));
+		if(strcmp(object_type,"DL2_PartRevision")==0)//TODO �޶��ļ�����
+		{
+			//TODO ���α�ļ���OA���������DL2_CMAttachment���µ�����
+			target_vec2.clear();//���
+			ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"DL2_CMAttachment",&num1,&primary));
+			for (int j=0;j<num1;j++)
+			{
+				target_vec2.push_back(primary[j]);
+
+			}
+
+			//TODO ��ð汾��α�ļ��й��������㲿����DL2_Achangeparts���������㲿���汾���ٻ���㲿����α�ļ���OA���������DL2_CMAttachment��
+
+			ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"DL2_Achangeparts",&num2,&second));
+			cout<<"--------���������㲿������---------"<<num2<<endl;
+			for (int j=0;j<num2;j++)
+			{
+				ITKCALL(ifail=AOM_ask_value_tags(second[j],"DL2_CMAttachment",&num3,&only));
+				cout<<"--------OA�����������---------"<<num3<<endl;
+
+				//���������������target_vec2��only
+				final= (tag_t*) MEM_alloc (sizeof(tag_t) * ( target_vec2.size()+num3 ));
+				for (int n=0;n<num3;n++)
+				{
+					final[n]=only[n];
+						ITKCALL(ifail = AOM_ask_value_string(final[n], "object_string",&object_type2));
+					cout<<"�����������------------"<<object_type2<<endl;
+				}
+				for (int n=num3;n< target_vec2.size()+num3 ;n++)
+				{
+					final[n]=target_vec2[n-num3];
+				ITKCALL(ifail = AOM_ask_value_string(final[n], "object_string",&object_type2));
+					cout<<"�����������------------"<<object_type2<<endl;
+				}
+				//����ֵ
+				cout<<"����ֵ----------"<<endl;
+				ITKCALL(ifail=AOM_lock(second[j]));
+				POM_AM__set_application_bypass(true);
+				AOM_set_value_tags(second[j],"DL2_CMAttachment", target_vec2.size()+num3,final);
+				AOM_save(second[j]);
+				POM_AM__set_application_bypass(false);
+				ITKCALL(ifail=AOM_unlock(second[j]));
+			}
+
+			
+			
+		}
+		if (final != NULL)
+		{
+			MEM_free(final);
+			final = NULL;
+		}
+		if (attachments2 != NULL)
+	{
+		MEM_free(attachments2);
+		attachments2 = NULL;
+	}
+	}
+	if (attachments != NULL)
+	{
+		MEM_free(attachments);
+		attachments = NULL;
+	}
+	
+	if (object_type != NULL)
+	{
+		MEM_free(object_type);
+		object_type = NULL;
+	}
+	if (object_type2 != NULL)
+	{
+		MEM_free(object_type2);
+		object_type2 = NULL;
+	}
+	if (primary != NULL)
+	{
+		MEM_free(primary);
+		primary = NULL;
+	}
+	if (second != NULL)
+	{
+		MEM_free(second);
+		second = NULL;
+	}
+	if (only != NULL)
+	{
+		MEM_free(only);
+		only = NULL;
+	}
+	
+
+	return 0;
+}
\ No newline at end of file
diff --git a/General/General/CHINT_Ecn_SendOA.cxx b/General/General/CHINT_Ecn_SendOA.cxx
new file mode 100644
index 0000000..fda2e34
--- /dev/null
+++ b/General/General/CHINT_Ecn_SendOA.cxx
@@ -0,0 +1,123 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <vector>
+#include <iostream>
+#include "CRUL_server_call_httpserver.h"
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include "common_itk_util.h"
+#include <tc/preferences.h>
+#include "string_utils.h"
+#include <fclasses\tc_date.h>
+#include "ocilib.h"
+#include "cJSON.h"
+void connectSql() {
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+	}
+}
+void closeConn() {
+	DisConnServer();
+}
+
+cJSON* getDrawingInform(tag_t changeTag) {
+	int changeNo,signNo, placesNo,beforeNo,verBefNo,aftNo,aftVerNo,reasonNo,processTypeNo;
+	char **changeDrawingNos, **signs, **placesNos, **changeBefs, **versionBefs,
+		 **changeAfts, **versionAfts, **changeReasons, **processTypes;
+	AOM_ask_value_strings(changeTag, "zt2_ChangeDrawingNo",&changeNo, &changeDrawingNos);
+	AOM_ask_value_strings(changeTag, "zt2_Sign", &signNo, &signs);
+	AOM_ask_value_strings(changeTag, "zt2_PlacesNo", &placesNo, &placesNos);
+	AOM_ask_value_strings(changeTag, "zt2_ChangeBefore1", &beforeNo, &changeBefs);
+	AOM_ask_value_strings(changeTag, "zt2_SZVersionbefore", &verBefNo, &versionBefs);
+	AOM_ask_value_strings(changeTag, "zt2_ChangeAfter1", &aftNo, &changeAfts);
+	AOM_ask_value_strings(changeTag, "zt2_SZRevisedversion", &aftVerNo, &versionAfts);
+	AOM_ask_value_strings(changeTag, "zt2_ChangeReason", &reasonNo, &changeReasons);
+	AOM_ask_value_strings(changeTag, "zt2_ProcessType1", &processTypeNo, &processTypes);
+	cJSON* infomations = cJSON_CreateArray();
+	for (int i = 0; i < changeNo; i++) {
+		cJSON* infomation = cJSON_CreateObject();
+		cJSON_AddStringToObject(infomation, "S_DrawingCode", changeDrawingNos[i]);
+		cJSON_AddStringToObject(infomation, "S_Sign", signNo > i ? signs[i] : "");
+		cJSON_AddStringToObject(infomation, "S_CS", placesNo > i ? placesNos[i] : "");
+		cJSON_AddStringToObject(infomation, "S_PreChange", beforeNo > i ? changeBefs[i] : "");
+		cJSON_AddStringToObject(infomation, "S_PreChangeVersion", verBefNo > i ? versionBefs[i] : "");
+		cJSON_AddStringToObject(infomation, "S_AfterChange", aftNo > i ? changeAfts[i] : "");
+		cJSON_AddStringToObject(infomation, "S_AfterChangeVersion", aftVerNo > i ? versionAfts[i] : "");
+		cJSON_AddStringToObject(infomation, "S_ChangeReason", reasonNo > i ? changeReasons[i] : "");
+		cJSON_AddStringToObject(infomation, "S_ZZPCL", processTypeNo > i ? processTypes[i] : "");
+		cJSON_AddItemToArray(infomations, infomation);
+	}
+	return infomations;
+}
+ 
+
+//��������͵�OA
+int CHINT_task_complete(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	ECHO("=========================================================\n");
+	ECHO("CHINT_task_complete ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+	char* jobName;
+	current_task = msg.task;
+	AOM_ask_value_string(current_task, "job_name", &jobName);
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	//��ȡurl��ַ
+	char* url;
+	PREF_ask_char_value("CHINT_ECNSendOAUrl", 0, &url);
+	//��ȡ��ǰ����Ŀ��
+	connectSql();
+	for (int count = 0; count < occur_of_counts; count++) {
+		char *type;
+		tag_t taskTag = taskAttches[count];
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		if (strcmp(type, "ZT2_Change") == 0) {
+			//��ȡ���� ��ѯ���ݿ���дJSON
+			char* changeType,*productModel,
+				*productName, *fileName, *contractNo, *contractName, 
+				*changeDateStr, *changeUnit;
+			date_t changeDate;
+			AOM_ask_value_string(taskTag, "zt2_ChangeType", &changeType);//�������
+			AOM_ask_value_string(taskTag, "zt2_ProductModel", &productModel);//��Ʒ�ͺ�
+			AOM_ask_value_string(taskTag, "zt2_ProductName", &productName); // ��Ʒ����
+			AOM_ask_value_string(taskTag, "zt2_FileName", &fileName); // 	�ļ����ż�����
+			AOM_ask_value_string(taskTag, "zt2_ContractNo", &contractNo); // ��ͬ����
+			AOM_ask_value_string(taskTag, "zt2_ContractName", &contractName); // ��ͬ����
+			AOM_ask_value_date(taskTag, "zt2_ChangeDate", &changeDate); // ���ʵʩ����
+			AOM_ask_value_string(taskTag, "zt2_ChangeUnit1", &changeUnit); // ��ͬ����
+			cJSON* paramValue = cJSON_CreateObject();
+			//json�����ֶ�
+			cJSON_AddStringToObject(paramValue, "S_ChangeTypes", changeType);
+			cJSON_AddStringToObject(paramValue, "S_ProductNumber", productModel);
+			cJSON_AddStringToObject(paramValue, "S_ProductName", productName);
+			cJSON_AddStringToObject(paramValue, "S_Pcodename", fileName);
+			cJSON_AddStringToObject(paramValue, "S_Contractcode", contractNo);
+			cJSON_AddStringToObject(paramValue, "S_ContractName", contractName);
+			DATE_date_to_string(changeDate, "%Y-%m-%d", &changeDateStr);
+			cJSON_AddStringToObject(paramValue, "T_MaterialDate", changeDateStr);
+			cJSON_AddStringToObject(paramValue, "S_FFBM", changeUnit);
+			//EH_DrawingInformationͼ����Ϣ
+			cJSON* infomations = getDrawingInform(taskTag);
+			cJSON_AddItemToObject(paramValue, "EH_DrawingInformation", infomations);
+
+		}
+	
+	}
+	closeConn();
+	//
+
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/CHINT_GetFrock.cpp b/General/General/CHINT_GetFrock.cpp
new file mode 100644
index 0000000..d8cfddc
--- /dev/null
+++ b/General/General/CHINT_GetFrock.cpp
@@ -0,0 +1,97 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+#include <property/nr.h>
+#include "CRUL_server_call_httpserver.h"
+int CHINT_GetFrock(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	tag_t root_task = NULLTAG, * sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0; tag_t* taskAttches = NULLTAG;
+	int attachment_types = EPM_target_attachment;
+
+	current_task = msg.task;
+	ECHO("=========================================================\n");
+	ECHO("CHINT_GetFrock ��ʼִ��\n");
+	ECHO("=========================================================\n");
+
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+
+
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+
+		char* type;
+		int num2 = 0;
+		tag_t* second;
+		tag_t taskTag = taskAttches[count];
+		
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+			int n_references = 0;
+			int* levels = 0;
+			tag_t* references_tag = NULLTAG;
+			char** relation_type_name = NULL;
+			//ͨ�����ù�ϵ���ҵ������
+			ITKCALL(WSOM_where_referenced(taskTag, 1, &n_references, &levels, &references_tag, &relation_type_name));
+			for (int i = 0; i < n_references; i++) {
+				//���ӵ�������
+				char* objtype;
+				ITKCALL(AOM_ask_value_string(references_tag[i], "object_type", &objtype));
+				if (strcmp("ZT2_FrockRevision", objtype) == 0) {
+					EPM_add_attachments(root_task, 1, &references_tag[i], &attachment_types);
+					printf("999\n");
+				}
+				
+			}
+		}
+
+		ECHO("=========================================================\n");
+		ECHO("CHINT_GetFrock ����ִ��\n");
+		ECHO("=========================================================\n");
+
+		
+	}
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/CHINT_SendOAMaterial.cpp b/General/General/CHINT_SendOAMaterial.cpp
new file mode 100644
index 0000000..f722434
--- /dev/null
+++ b/General/General/CHINT_SendOAMaterial.cpp
@@ -0,0 +1,150 @@
+
+#include "cJSON.h"
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+#include "chint_Handler.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+#include <property/nr.h>
+#include "CRUL_server_call_httpserver.h"
+#include "common_itk_util.h"
+
+char* Utf8ToGbk(const char* src_str)
+{
+	int len = MultiByteToWideChar(CP_UTF8, 0, src_str, -1, NULL, 0);
+	wchar_t* wszGBK = (wchar_t*)MEM_alloc((len + 1) * sizeof(wchar_t));
+	memset(wszGBK, 0, len * 2 + 2);
+	MultiByteToWideChar(CP_UTF8, 0, src_str, -1, wszGBK, len);
+	len = WideCharToMultiByte(CP_ACP, 0, wszGBK, -1, NULL, 0, NULL, NULL);
+	char* szGBK = (char*)MEM_alloc((len + 1) * sizeof(char));
+
+	memset(szGBK, 0, len + 1);
+	WideCharToMultiByte(CP_ACP, 0, wszGBK, -1, szGBK, len, NULL, NULL);
+	return szGBK;
+}
+
+int CHINT_SendOAMaterial(EPM_action_message_t msg) {
+	char* log_file = NULL;
+
+	printf("������־�ļ�\n");
+	char* CHINT_SendOAMaterial = (char*)malloc(sizeof("CHINT_SendOAMaterial"));
+	strcpy(CHINT_SendOAMaterial, "TO_SRM");
+	CreateLogFile(CHINT_SendOAMaterial, &log_file); //
+	int ifail = ITK_ok;
+	int att_cnt = 0, rev_count = 0;
+	tag_t  rootTask_tag = NULLTAG;
+	tag_t* attachments = NULL,
+		* rev_tags = NULL;
+
+	char* objtype = NULL;
+	time_t timep;
+	time(&timep); //��ȡ��1970������˶����룬����time_t���͵�timep
+	//��ctime������ת�����ַ�����ʽ�������Thu Feb 28 14:14:17 2019
+	WriteLog("%s������־�ļ����\n", ctime(&timep));
+	EPM_ask_root_task(msg.task, &rootTask_tag);
+	EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments);
+	WriteLog("��ȡ����Ŀ���������Ϊ%d\n", att_cnt);
+
+	if (att_cnt > 0) {
+
+		char* cPCode = NULL;
+		char* zt2_formnumber = NULL;
+		char* zt2_MaterialNo = NULL;
+		char* sfId = NULL;
+
+		tag_t* target = NULL;//��ϵ�����ϰ汾����
+		int  target_count = 0;
+		cJSON* array = cJSON_CreateArray();
+
+		for (int i = 0; i < att_cnt; i++) {
+			ITKCALL(AOM_ask_value_string(attachments[i], "object_type", &objtype));
+			if (strcmp("ZT2_FrockRevision", objtype) == 0) {
+
+
+				ITKCALL(AOM_ask_value_string(attachments[i], "item_id", &cPCode));
+				ITKCALL(AOM_ask_value_string(attachments[i], "zt2_formnumber", &zt2_formnumber));
+				ITKCALL(AOM_ask_value_string(attachments[i], "zt2_sfid", &sfId));
+
+
+
+
+			}
+			if (strcmp("ZT2_Design3DRevision", objtype) == 0) {
+				ITKCALL(ifail = AOM_ask_value_tags(attachments[i], "representation_for", &target_count, &target));
+				if (target) {
+					for (int i = 0; i < target_count; i++) {
+
+						ITKCALL(ifail = AOM_ask_value_string(target[i], "zt2_MaterialNo", &zt2_MaterialNo));
+						WriteLog("target�¶���zt2_MaterialNoΪ��%s", zt2_MaterialNo);
+					}
+
+				}
+			}
+
+		}
+
+		WriteLog("item_id->%s", cPCode);
+		WriteLog("zt2_formnumber->%s", zt2_formnumber);
+		WriteLog("zt2_MaterialNo->%s", zt2_MaterialNo);
+		WriteLog("json��ʼƴ��\n");
+		/* ����һ��JSON���ݶ���(����ͷ���) */
+			//cJSON_AddStringToObject(cpgy, "sfId", sfId);
+
+		cJSON* cpgx = cJSON_CreateObject();
+		cJSON_AddStringToObject(cpgx, "ItemName", "S_wlh");
+		cJSON_AddStringToObject(cpgx, "ItemValue", zt2_MaterialNo);
+		cJSON_AddItemToArray(array, cpgx);
+		string json_to_char;
+
+		WriteLog("JSONƴ�����\n");
+		json_to_char = cJSON_Print(array);
+		WriteLog("json->%s\n", json_to_char.c_str());
+		//��ȡ��ѡ��url
+		char* url;
+		PREF_ask_char_value("CHINT_SendOAURL", 0, &url);
+		WriteLog("url=%s\n", url);
+		string msg = sendOA(sfId, zt2_formnumber, json_to_char, url);
+		char* a = "false";
+		if (strstr(msg.c_str(), a) != NULL) {//����
+			EMH_store_error_s1(EMH_severity_user_error, EMH_USER_error_base, "�ӿڴ���ʧ�ܣ�");
+
+			ifail = 1;
+		}
+	}
+	CloseLog();
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/CHINT_cossheet_upgrade.cpp b/General/General/CHINT_cossheet_upgrade.cpp
new file mode 100644
index 0000000..9e518a3
--- /dev/null
+++ b/General/General/CHINT_cossheet_upgrade.cpp
@@ -0,0 +1,157 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ocilib.h"
+
+
+char* incrementChar(char* input) {
+	int num = atoi(input); // ���ַ�ת��Ϊ����
+	num++; // ����
+	sprintf(input, "%02d", num); // ������ת��Ϊ��λ�����ַ���
+
+	return input;
+}
+
+int CHINT_cossheet_upgrade(EPM_action_message_t msg) {
+	ECHO("=========================================================\n");
+	ECHO("CHINT_cossheet_upgrade ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	int doc_num = 0;
+	tag_t rootTask_tag = NULLTAG;
+	tag_t task = NULLTAG;
+	tag_t* doc_tags = NULLTAG;
+	int arg_cnt = TC_number_of_arguments(msg.arguments);
+	task = msg.task;
+	ITKCALL(EPM_ask_root_task(task, &rootTask_tag));
+	int ifail = ITK_ok;
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		ifail = 1;
+	}
+
+	//��ȡ������Ŀ���ϵ�µĶ���
+	printf("��ȡ������Ŀ���ϵ�µĶ���");
+	ITKCALL(EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &doc_num, &doc_tags));
+
+	for (int i = 0; i < doc_num;i++) {
+		char* objtype = NULL;
+		ITKCALL(AOM_ask_value_string(doc_tags[i], "object_type", &objtype));
+		if (strstr(objtype,"ZT2_COSTSHEET") != nullptr) {
+			char* cbdtype = NULL;
+			ITKCALL(AOM_ask_value_string(doc_tags[i], "zt2_cbdlx", &cbdtype));
+			char* desc;
+			ITKCALL(AOM_ask_value_string(doc_tags[i], "object_desc", &desc));
+			//��ѯ����
+			string sqlTitle = "select \"cbdlx\",\"projectid\",\"revision\",\"factory\",\"proname\",\"tennumber\",\"promanager\",\"quantity\",\"tramodel\",\"capfactor\",\"volratio\",\"noloadloss\",\"loadloss\",\"impvoltage\",\"traweight\",\"totweight\",\"copconsumption\",\"cmarketprice\",\"vollevel\" from \"CHINT_ CUSQUOTATION_TITLE_TEMPLATE\" where \"cbdlx\" = '%s' and \"projectid\" = '%s' order by \"revision\" desc";
+			char selectRecord[1000];
+			sprintf(selectRecord, sqlTitle.c_str(), cbdtype,desc);
+			int outputColumn = 0, outputValueCount = 0;
+			char*** outputValue = NULL;
+			printf("search3 ===> %s\n", selectRecord);
+			QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+			printf("outputValueCount ===> %d\n", outputValueCount);
+			//��ȡ��ǰ����ϸ�汾
+			string getrev;
+			//����һ���µ����ݣ����Ҹ��°汾
+			if (outputValueCount > 0) {
+				getrev = outputValue[0][2];
+				
+				//��ȡ������İ汾
+				char* newStr = incrementChar(outputValue[0][2]);
+				string insert = "INSERT INTO \"CHINT_ CUSQUOTATION_TITLE_TEMPLATE\" (\"cbdlx\",\"projectid\",\"revision\",\"factory\",\"proname\",\"tennumber\",\"promanager\",\"quantity\",\"tramodel\",\"capfactor\",\"volratio\",\"noloadloss\",\"loadloss\",\"impvoltage\",\"traweight\",\"totweight\",\"copconsumption\",\"cmarketprice\",\"vollevel\") VALUES ('%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s')";
+				char selectRecord2[600];
+				sprintf(selectRecord2, insert.c_str(),outputValue[0][0], outputValue[0][1], newStr, outputValue[0][3], outputValue[0][4], outputValue[0][5], outputValue[0][6], outputValue[0][7], outputValue[0][8], outputValue[0][9], outputValue[0][10], outputValue[0][11], outputValue[0][12], outputValue[0][13], outputValue[0][14], outputValue[0][15], outputValue[0][16], outputValue[0][17], outputValue[0][18]);
+				printf("selectRecord2 ===> %s\n", selectRecord2);
+				ExecuteSQLNoInputParam(selectRecord2);
+				ExecuteSQLNoInputParam("commit");
+			}
+			else {
+				printf("���ݿ�û�в�ѯ���������\n");
+				break;
+			}
+
+			//��ѯ����
+			string selSql = "select \"cbdlx\",\"projectid\",\"revision\",\"matgroup\",\"mgsnumber\",\"matcname\",\"matcnumber\",\"matcatname\",\"specifications\",\"manufacturer\",\"nwquantity\",\"utirate\",\"unit\",\"amomoney\",\"unitprice\",\"no\",\"totalprice\" from \"CHINT_ CUSQUOTATION_ DETAILS_TEMPLATE\" where \"cbdlx\" = '%s' and \"revision\" = '%s' and \"projectid\" = '%s' ";
+			char selectRecord1[400];
+			sprintf(selectRecord1, selSql.c_str(), cbdtype, getrev.c_str(),desc);
+			int outputColumn1 = 0, outputValueCount1 = 0;
+			char*** outputValue1 = NULL;
+			printf("search3 ===> %s\n", selectRecord1);
+			QuerySQLNoInputParam(selectRecord1, &outputColumn1, &outputValueCount1, &outputValue1);
+
+			//����һ���µ����ݣ����Ҹ��°汾
+			if (outputValueCount1 > 0) {
+				
+				//��ȡ������İ汾
+				char* newStr = incrementChar(outputValue1[0][2]);
+				string insert = "INSERT INTO \"CHINT_ CUSQUOTATION_ DETAILS_TEMPLATE\" (\"cbdlx\",\"projectid\",\"revision\",\"matgroup\",\"mgsnumber\",\"matcname\",\"matcnumber\",\"matcatname\",\"specifications\",\"manufacturer\",\"nwquantity\",\"utirate\",\"unit\",\"amomoney\",\"unitprice\",\"no\",\"totalprice\") VALUES ('%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s')";
+				char selectRecord2[600];
+				for (int j = 0; j < outputValueCount1;j++) {
+					sprintf(selectRecord2, insert.c_str(), outputValue1[j][0], outputValue1[j][1], newStr, outputValue1[j][3], outputValue1[j][4], outputValue1[j][5], outputValue1[j][6], outputValue1[j][7], outputValue1[j][8], outputValue1[j][9], outputValue1[j][10], outputValue1[j][11], outputValue1[j][12], outputValue1[j][13], outputValue1[j][14], outputValue1[j][15], outputValue1[j][16]);
+					printf("selectRecord2 ===> %s\n", selectRecord2);
+					ExecuteSQLNoInputParam(selectRecord2);
+					ExecuteSQLNoInputParam("commit");
+				}
+				
+			}
+			DisConnServer();
+
+			
+			ECHO("=========================================================\n");
+			ECHO("���ݲ������\n");
+			ECHO("CHINT_cossheet_upgrade ִ�н���\n");
+			ECHO("=========================================================\n");
+			break;
+		}
+	}
+	
+
+
+
+
+	return 0;
+}
\ No newline at end of file
diff --git a/General/General/CRUL_server_call_httpserver.cpp b/General/General/CRUL_server_call_httpserver.cpp
new file mode 100644
index 0000000..33da4b8
--- /dev/null
+++ b/General/General/CRUL_server_call_httpserver.cpp
@@ -0,0 +1,250 @@
+#include "CRUL_server_call_httpserver.h"
+#include <map>
+#include <string>
+#include <sstream>
+#include <iostream>
+//#define HTTP_HOST "localhost"
+//#define HTTP_POST 9293
+//#include <boost/property_tree/ptree.hpp>
+//#include <boost/property_tree/json_parser.hpp>
+size_t write_data(void* ptr, size_t size, size_t nmemb, void* stream) {
+	string data((const char*)ptr, (size_t)size * nmemb);
+	*((stringstream*)stream) << data << endl;
+	return size * nmemb;
+}
+//string callHttpserver(string signinfoJsonString,string url)
+//{
+//	CURL* curl;
+//	CURLcode res;
+//	curl = curl_easy_init();
+//	printf("���͵�ַ��%s\n", url);
+//	std::stringstream out;
+//	if (curl) {
+//		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+//		curl_easy_setopt(curl, CURLOPT_URL, url.c_str());
+//		//curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+//		//curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+//		struct curl_slist* headers = NULL;
+//		headers = curl_slist_append(headers, "Accept-Charset: UTF-8");
+//		headers = curl_slist_append(headers, "Content-Type: application/json;charset=UTF-8");
+//		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+//		// ���ý������ݵĴ��������ʹ�ű���
+//		curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);
+//		curl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);
+//		printf("�������ݣ�%s\n", signinfoJsonString.c_str());
+//		//printf("data=>%s\n",signinfoJsonString.c_str());
+//		const char* data = signinfoJsonString.c_str();
+//		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+//		curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, 10);
+//		curl_easy_setopt(curl, CURLOPT_TIMEOUT, 20);
+//		res = curl_easy_perform(curl);
+//
+//		if (res != 0) {
+//			string errMessage = curl_easy_strerror(res);
+//		}
+//
+//		printf("����ֵ��%d\n", res);
+//	}
+//	string str_json = out.str();
+//	curl_easy_cleanup(curl);
+//	printf("str_json===>%s\n", str_json.c_str());
+//	return str_json;
+//}
+string callHttpserver(string signinfoJsonString, string url){
+	CURL *curl;
+	CURLcode res;
+	curl = curl_easy_init();
+	std::stringstream out;
+	if (curl) {
+		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+		curl_easy_setopt(curl, CURLOPT_URL, url.c_str());
+		curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+		curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+		struct curl_slist *headers = NULL;
+		curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);
+		curl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);
+		headers = curl_slist_append(headers, "Content-Type: application/json");
+		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+		const char *data = signinfoJsonString.c_str();
+		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+		res = curl_easy_perform(curl);
+		if (res != 0) {
+			string errMessage = curl_easy_strerror(res);
+		}
+		printf("����ֵ��%d\n", res);
+	}
+	string str_json = out.str();
+	curl_easy_cleanup(curl);
+	printf("str_json===>%s\n", str_json.c_str());
+	return str_json;
+}
+
+string sendOA() {
+	CURL *curl;
+	CURLcode res;
+	std::stringstream out;
+	curl = curl_easy_init();
+	if (curl) {
+		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+		curl_easy_setopt(curl, CURLOPT_URL, "https://bpmtest10.chint.com/Portal/Webservices/BPMExtendService.asmx/SetItemValues");
+		curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+		curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+		curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);
+		curl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);
+		struct curl_slist *headers = NULL;
+		headers = curl_slist_append(headers, "Content-Type: application/x-www-form-urlencoded");
+		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+		const char *data = "sfId=111177777&instanceId=3333&entityParamValues=ddd";
+		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+		res = curl_easy_perform(curl);
+	}
+	string str_json = out.str();
+	curl_easy_cleanup(curl);
+	printf("return Msg===>%s\n", str_json.c_str());
+}
+string callHttpGet(string url) {
+	void* curl = curl_easy_init();
+	// ����URL
+	std::stringstream out;
+	curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "GET");
+	curl_easy_setopt(curl, CURLOPT_URL, url.c_str());
+	// ���ý������ݵĴ��������ʹ�ű���
+	curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);
+	curl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);
+
+	// ִ��HTTP GET����
+	CURLcode res = curl_easy_perform(curl);
+	if (res != CURLE_OK) {
+		fprintf(stderr, "curl_easy_perform() failed: %s\n", curl_easy_strerror(res));
+	}
+
+	// �������ݴ����out�У����֮
+	//cout << out.str() << endl;
+	string str_json = out.str();
+	curl_easy_cleanup(curl);
+	printf("str_json===>%s\n", str_json.c_str());
+	return str_json;
+}
+string sendOA(string sfid, string instanceId, string entityParamValues, string url) {
+	CURL* curl;
+	CURLcode res;
+	std::stringstream out;
+	curl = curl_easy_init();
+	if (curl) {
+		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+		curl_easy_setopt(curl, CURLOPT_URL, url.c_str());
+		curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+		curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+		curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);
+		curl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);
+		struct curl_slist* headers = NULL;
+		headers = curl_slist_append(headers, "Content-Type: application/x-www-form-urlencoded");
+		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+		curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, false);
+		string temp;
+		temp.append("sfId=").append(sfid).append("&instanceId=").append(instanceId).append("&entityParamValues=").append(entityParamValues);
+		printf("temp=%s\n", temp.c_str());
+		const char* data = temp.c_str();
+		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+		res = curl_easy_perform(curl);
+		//curl_easy_strerror
+		printf("temp=%d\n", res);
+	}
+	string str_json = out.str();
+	curl_easy_cleanup(curl);
+	printf("return Msg===>%s\n", str_json.c_str());
+	return str_json;
+}
+/*���֪ͨ������OA
+*/
+string ecnSendOA(string instanceId, string entityParamValues, string url) {
+	CURL* curl;
+	CURLcode res;
+	std::stringstream out;
+	curl = curl_easy_init();
+	if (curl) {
+		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+		curl_easy_setopt(curl, CURLOPT_URL, url.c_str());
+		curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+		curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+		curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, write_data);
+		curl_easy_setopt(curl, CURLOPT_WRITEDATA, &out);
+		struct curl_slist* headers = NULL;
+		headers = curl_slist_append(headers, "Content-Type: application/x-www-form-urlencoded");
+		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+		curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, false);
+		string temp;
+		temp.append("workflowCode=EH_TE_ChangeNotice").append("&userCode=").
+			append(instanceId).append("&finishStart=true").append("&entityParamValues=").append(entityParamValues);
+		printf("temp=%s\n", temp.c_str());
+		const char* data = temp.c_str();
+		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+		res = curl_easy_perform(curl);
+		//curl_easy_strerror
+		printf("temp=%d\n", res);
+	}
+	string str_json = out.str();
+	curl_easy_cleanup(curl);
+	printf("return Msg===>%s\n", str_json.c_str());
+	return str_json;
+}
+//void callHttpserverDwgtopdf(string signinfoJsonString, char* HTTP_HOST)
+//{
+//	CURL* curl;
+//	CURLcode res;
+//	char httpUrl[1028] = "\0";
+//	curl = curl_easy_init();
+//	sprintf(httpUrl, "http://%s:%d/server/dwgtopdf", HTTP_HOST, HTTP_POST);
+//	if (curl) {
+//		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+//		curl_easy_setopt(curl, CURLOPT_URL, httpUrl);
+//		//curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+//		//curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+//		struct curl_slist* headers = NULL;
+//		headers = curl_slist_append(headers, "Accept-Charset: GBK");
+//		headers = curl_slist_append(headers, "Content-Type: application/json;charset=GBK");
+//		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+//		WriteLog("�������ݣ�%s\n", signinfoJsonString.c_str());
+////		printf("data=>%s\n", signinfoJsonString.c_str());
+//		const char* data = signinfoJsonString.c_str();
+//		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+//		curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, 10);
+//		curl_easy_setopt(curl, CURLOPT_TIMEOUT, 20);
+//		res = curl_easy_perform(curl);
+//		WriteLog("����ֵ��%d\n", res);
+//		
+//	}
+//	curl_easy_cleanup(curl);
+//}
+//
+//void callHttpserverMail(string signinfoJsonString, char* HTTP_HOST)
+//{
+//	CURL* curl;
+//	CURLcode res;
+//	char httpUrl[4096] = "\0";
+//	WriteLog("���ݳ���%d\n", signinfoJsonString.size());
+//	curl = curl_easy_init();
+//	sprintf(httpUrl, "http://%s:%d/server/sendmail", HTTP_HOST, HTTP_POST);
+////	printf("call=>%s \n", httpUrl);
+//	WriteLog("���͵�·����%s\n", httpUrl);
+//	if (curl) {
+//		curl_easy_setopt(curl, CURLOPT_CUSTOMREQUEST, "POST");
+//		curl_easy_setopt(curl, CURLOPT_URL, httpUrl);
+//		//curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+//		//curl_easy_setopt(curl, CURLOPT_DEFAULT_PROTOCOL, "https");
+//		struct curl_slist* headers = NULL;
+//		headers = curl_slist_append(headers, "Accept-Charset: GBK");
+//		headers = curl_slist_append(headers, "Content-Type: application/json;charset=GBK");
+//		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
+////		curl_easy_setopt(curl, CURLOPT_HTTPHEADER, "Expect:");
+//		WriteLog("�������ݣ�%s\n", signinfoJsonString.c_str());
+//	//	printf("data=>%s\n", signinfoJsonString.c_str());
+//		const char* data = signinfoJsonString.c_str();
+//		curl_easy_setopt(curl, CURLOPT_POSTFIELDS, data);
+//		curl_easy_setopt(curl, CURLOPT_CONNECTTIMEOUT, 10);
+//		curl_easy_setopt(curl, CURLOPT_TIMEOUT, 20);
+//		res = curl_easy_perform(curl);
+//		WriteLog("����ֵ��%d\n", res);
+//	}
+//	curl_easy_cleanup(curl);
+//}
\ No newline at end of file
diff --git a/General/General/CRUL_server_call_httpserver.h b/General/General/CRUL_server_call_httpserver.h
new file mode 100644
index 0000000..656a52d
--- /dev/null
+++ b/General/General/CRUL_server_call_httpserver.h
@@ -0,0 +1,8 @@
+#include <iostream>
+#include <Windows.h>
+#include <curl\curl.h>
+using namespace std;
+string callHttpserver(string signinfoJsonString, string url);
+string callHttpGet(string url);
+string sendOA(string sfid, string instanceId, string entityParamValues, string url);
+string ecnSendOA(string instanceId, string entityParamValues, string url);
\ No newline at end of file
diff --git a/General/General/CheckList.cpp b/General/General/CheckList.cpp
new file mode 100644
index 0000000..2dfe0b2
--- /dev/null
+++ b/General/General/CheckList.cpp
@@ -0,0 +1,46 @@
+// ������ DLL �ļ���
+
+#include "stdafx.h"
+
+#include "CheckList.h"
+#include <iostream>
+#include <string> 
+#include <stdio.h>
+#include <windows.h> 
+#include <shellapi.h> 
+#include <time.h>
+#include <epm/epm_task_template_itk.h>
+#include <tccore/aom_prop.h>
+
+
+using namespace std; 
+int hasFillInChechList(EPM_action_message_t msg)
+{
+	char* flagstring="";
+	int retCode=0;
+	printf("\n=======================���ڿ�ʼ==========================\n"); 
+	retCode =  AOM_UIF_ask_value (msg.task,"ip_classification",&flagstring);//����������汾��������������
+	if (retCode != ITK_ok)
+	{
+		printf("��ȡ��ʶ����ʧ��\n");
+		return retCode;
+	}
+	else
+	{
+		printf("\n=======================��ȡ���Գɹ�����ֵ�ǣ�%s==========================\n",flagstring);
+	}
+	if(strcmp(flagstring,"No")==0)
+	{
+		int retCode;
+		//retCode= EMH_store_initial_error(EMH_severity_user_error,HASNT_FILLIN_CHECKLIST);
+		//retCode= EMH_store_error(EMH_severity_user_error,HASNT_FILLIN_CHECKLIST );
+		//retCode = EMH_clear_errors(  );
+//		return HASNT_FILLIN_CHECKLIST;
+		return 0;
+	}
+	else
+	{
+		return ITK_ok;
+		
+	}
+}
\ No newline at end of file
diff --git a/General/General/CheckList.h b/General/General/CheckList.h
new file mode 100644
index 0000000..7bfeef0
--- /dev/null
+++ b/General/General/CheckList.h
@@ -0,0 +1,32 @@
+// CheckList.h
+#define IPLIB none
+
+#include <user_exits/user_exits.h>
+#include <itk/bmf.h>
+#include <tccore/custom.h>
+#include <user_exits/user_exit_msg.h>
+#include "epm/epm.h"
+//#include <tcfile.h>
+//#include <aom_prop.h>
+//#include <aom.h>
+//#include <dataset.h>
+//#include <datasettype.h> 
+//#include <aom_prop.h> 
+//#include <groupmember.h>
+//#include <grm.h>
+//#include <cr.h>
+//#include <string> 
+//#include <ICS.h>
+//#include <idm.h>
+//#include <emh.h>
+
+
+
+ 
+
+#ifndef CHECKLIST_H
+#define CHECKLIST_H
+	extern "C"  __declspec(dllexport)int hasFillInChechList(EPM_action_message_t msg);
+		//ʹ�������Կ��Ե��á�
+#endif
+
diff --git a/General/General/Check_range.cpp b/General/General/Check_range.cpp
new file mode 100644
index 0000000..86ff21e
--- /dev/null
+++ b/General/General/Check_range.cpp
@@ -0,0 +1,806 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include <fclasses\tc_date.h>
+#include "epm_handler_common.h"
+#include <chrono>
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <iostream>
+#include <sstream>
+#include <fstream>
+#include "ocilib.h"
+#include <tc/preferences.h>
+using namespace libxl;
+typedef struct{
+	string ITEM_ID;//id��
+}PROPERTY_STRUCT;
+string ws2s(const std::wstring& wstr)
+{
+	
+	if (wstr.empty()||wstr.length()==0) return std::string();
+	int size_needed = WideCharToMultiByte(CP_ACP, 0, &wstr[0], (int)wstr.size(), NULL, 0, NULL, NULL);
+	std::string strTo(size_needed, 0);
+	WideCharToMultiByte(CP_ACP, 0, &wstr[0], (int)wstr.size(), &strTo[0], size_needed, NULL, NULL);
+	return strTo;
+}
+std::string gettm(__int64 timestamp)
+{
+	__int64 milli = timestamp + (__int64)8 * 60 * 60 * 1000;
+	auto mTime = std::chrono::milliseconds(milli);
+	auto tp = std::chrono::time_point<std::chrono::system_clock, std::chrono::milliseconds>(mTime);
+	auto tt = std::chrono::system_clock::to_time_t(tp);
+	std::tm now;
+	::gmtime_s(&now, &tt);
+	char res[64] = { 0 };
+	sprintf_s(res, _countof(res), "%4d-%02d-%02d %02d:%02d:%02d.%03d", now.tm_year + 1900, now.tm_mon + 1, now.tm_mday, now.tm_hour, now.tm_min, now.tm_sec, static_cast<int>(milli % 100));
+	return std::string(res);
+}
+time_t getTimeStamp()
+{
+	std::chrono::time_point<std::chrono::system_clock, std::chrono::milliseconds> tp =
+		std::chrono::time_point_cast<std::chrono::milliseconds>(std::chrono::system_clock::now());
+	auto tmp = std::chrono::duration_cast<std::chrono::milliseconds>(tp.time_since_epoch());
+	time_t timestamp = tmp.count();
+	return timestamp;
+}
+
+string callHttpserver2(string jsonStr,string jarName) {
+
+	char date[128] = "";
+	time_t now = time(0);
+	tm* p = localtime(&now);
+	sprintf_s(date, "%04d%02d%02d%02d%02d%02d", 1900 + p->tm_year, p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
+
+	//��������д���ļ�
+	char data_file[256] = "";
+	strcat(data_file, getenv("temp"));
+	//strcat(data_file, "C:\\PLM\\sendyunpi");
+	strcat(data_file, "\\");
+	strcat(data_file, date);
+	strcat(data_file, ".txt");
+	//AE_ask_dataset_named_ref
+	ofstream file;
+	file.open(data_file);
+	file << jsonStr << endl; // ʹ����coutͬ���ķ�ʽ����д��
+	file.close();
+
+	string strResult;
+
+	//cmdָ��
+	char cmd[256] = "";
+	strcpy(cmd, "java -jar \"");
+	//strcat(cmd, jar_file);
+	strcat(cmd, getenv("TC_ROOT"));
+	strcat(cmd, "\\bin\\");
+	strcat(cmd, jarName.c_str());
+	strcat(cmd, "\" ");
+
+	//����
+	cout << data_file << endl;
+	strcat(cmd, data_file);
+
+	printf("·��:\n%s\n", cmd);
+	char buf[8000] = { 0 };
+	FILE* pf = NULL;
+	if ((pf = _popen(cmd, "r")) == NULL) {
+		printf("�ӿڷ���:\n%s", "1");
+	}
+
+	while (fgets(buf, sizeof buf, pf)) {
+		strResult += buf;
+	}
+	_pclose(pf);
+	return strResult;
+
+}
+
+int chint_getChgOrde(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	char tgt_type[WSO_name_size_c + 1] = "", type_class[TCTYPE_class_name_size_c + 1] = "";
+	//���̽ڵ����
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	current_task = msg.task;
+	int occur_of_counts;
+	tag_t *taskAttches;
+	//��ȡ����
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	for (int count = 0; count < occur_of_counts; count++) {
+		tag_t changeTag = taskAttches[count];
+		TCTYPE_ask_object_type(changeTag, &type_tag);
+		ifail = TCTYPE_ask_class_name(type_tag, type_class);
+		printf("type_class : %s", type_class);
+		if (strcmp(type_class, "ZT2_Change")==0) {
+			tag_t oGroup,user;
+			char * plant, *projn,*pcod,*chgorder,*duser,*chginfo;
+			string jsonStr, creationStr, zt2_ChangeStr;
+			date_t creation_date, zt2_ChangeDate;
+			jsonStr.append("[{");
+			AOM_ask_value_tag(changeTag,"owning_group", &oGroup);
+			AOM_ask_value_string(oGroup, "name", &plant);
+			AOM_ask_value_string(changeTag, "zt2_WBSNo", &projn);
+			AOM_ask_value_string(changeTag, "zt2_ContractNo", &pcod);
+			AOM_ask_value_string(changeTag, "item_id", &chgorder);
+			AOM_ask_value_tag(changeTag, "owning_user", &user);
+			AOM_ask_value_string(user,"user_name",&duser);
+			jsonStr.append("\"plant\":\"");
+			jsonStr.append(plant);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"projn\":\"");
+			jsonStr.append(projn);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"pcod\":\"");
+			jsonStr.append(pcod);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"chgorder\":\"");
+			jsonStr.append(chgorder);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"duser\":\"");
+			jsonStr.append(duser);
+			jsonStr.append("\",");
+
+			AOM_ask_value_date(changeTag, "creation_date", &creation_date);//zt2_ChangeDate
+			creationStr.append(to_string(creation_date.year)).append("-").
+				append(to_string(creation_date.month+1)).append("-").
+				append(to_string(creation_date.day)).append(" ").
+				append(to_string(creation_date.hour)).append(":").
+				append(to_string(creation_date.minute)).append(":").append(to_string(creation_date.second));
+
+			AOM_ask_value_date(changeTag, "zt2_ChangeDate", &zt2_ChangeDate);//zt2_ChangeDate
+			zt2_ChangeStr.append(to_string(creation_date.year)).append("-").
+				append(to_string(creation_date.month+1)).append("-").
+				append(to_string(creation_date.day)).append(" ").
+				append(to_string(creation_date.hour)).append(":").
+				append(to_string(creation_date.minute)).append(":").append(to_string(creation_date.second));
+			jsonStr.append("\"ctime\":\"");
+			jsonStr.append(creationStr);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"dtime\":\"");
+			jsonStr.append(zt2_ChangeStr);
+			jsonStr.append("\",");
+			char **depment; int numdes;
+			string depments;
+			AOM_ask_value_strings(changeTag, "zt2_ChangeUnit1",&numdes, &depment);
+			for (int i = 0; i < numdes; i++) {
+				if (i > 0) {
+					depments.append(";");
+				}
+				depments.append(depment[i]);
+			}
+			int num2; tag_t* second;
+			jsonStr.append("\"depment\":\"");
+			jsonStr.append(depments);
+			jsonStr.append("\",");
+			ITKCALL(ifail = AOM_ask_value_tags(changeTag, "IMAN_reference", &num2, &second));
+			char *uid;
+			if (num2 > 0) {
+				ITK__convert_tag_to_uid(second[0], &uid);
+			}
+
+			jsonStr.append("\"chginfo\":\"");
+			jsonStr.append(uid);
+			jsonStr.append("\"");
+			jsonStr.append("}]");
+			string mes = callHttpserver2(jsonStr, "SendMesChange.jar");
+			printf("mes==> %s ", mes.c_str());
+		}
+	}
+
+	return ifail;
+
+}
+
+int chint_getProduct(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	char tgt_type[WSO_name_size_c + 1] = "", type_class[TCTYPE_class_name_size_c + 1] = "";
+	//���̽ڵ����
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	current_task = msg.task;
+	int occur_of_counts;
+	tag_t *taskAttches;
+	//��ȡ����
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+
+
+	int url_num = 0;
+	char ** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4],(char *)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		ifail = 1;
+		return ifail;
+	}
+
+
+	for (int count = 0; count < occur_of_counts; count++) {
+		tag_t changeTag = taskAttches[count];
+		TCTYPE_ask_object_type(changeTag, &type_tag);
+		ifail = TCTYPE_ask_class_name(type_tag, type_class);
+		printf("type_class : %s", type_class);
+		if (strcmp(type_class, "ZT2_XXDRevision")==0) {
+			tag_t oGroup, user;
+			char * plant, *conlist,*version, *duser,*chgorder="";
+			string jsonStr, creationStr, zt2_ChangeStr;
+			date_t creation_date, zt2_ChangeDate;
+			jsonStr.append("[{");
+			AOM_ask_value_tag(changeTag, "owning_group", &oGroup);
+			AOM_ask_value_string(oGroup, "name", &plant);
+
+			AOM_ask_value_string(changeTag, "item_id", &conlist);
+			AOM_ask_value_string(changeTag, "item_revision_id", &version);
+			AOM_ask_value_tag(changeTag, "owning_user", &user);
+			AOM_ask_value_string(user, "user_name", &duser);
+			jsonStr.append("\"plant\":\"");
+			jsonStr.append(plant);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"conlist\":\"");
+			jsonStr.append(conlist);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"version\":\"");
+			jsonStr.append(version);
+			jsonStr.append("\",");
+
+			int n_references = 0;
+			int *levels = 0;
+			tag_t * references_tag = NULLTAG;
+			char ** relation_type_name = NULL;
+			//ͨ�����ù�ϵ���ҵ������
+			WSOM_where_referenced(changeTag, 1, &n_references, &levels, &references_tag, &relation_type_name);
+			printf("���ù�ϵ���ҵ��ĸ���Ϊ��%d\n", n_references);
+			//���ù�ϵ�ұ����
+			for (int i = 0; i < n_references; i++)
+			{
+				TCTYPE_ask_object_type(references_tag[i], &type_tag);
+				ifail = TCTYPE_ask_class_name(type_tag, type_class);
+				printf("type_class : %s", type_class);
+				if (strcmp(type_class, "ZT2_Change")==0) {
+					AOM_ask_value_string(references_tag[i],"item_id", &chgorder);
+				}
+			}
+			jsonStr.append("\"chgorder\":\"");
+			jsonStr.append(chgorder);
+			jsonStr.append("\",");
+			//���ݿ��� SELECT CPXH,CPMC,HTMC,HTH FROM "CHINT_XXD_000" where XXDH = 'YHX230027' and XXDBB = 'A'
+			string sql = "SELECT CPXH,CPMC,HTMC,HTH FROM \"CHINT_XXD_000\" where XXDH = '";
+			sql.append(conlist).append("' and XXDBB = '").append(version).append("'");
+			int colmun = 0, count = 0;
+			char ***outputValue = NULL;
+			QuerySQLNoInputParam((char *)sql.c_str(), &colmun, &count, &outputValue);
+			char *ccod="", *ctyp, *cnam, *hcod, *hnam,*projn;
+
+			if (count > 0) {
+				ctyp = outputValue[0][0];
+				cnam = outputValue[0][1];
+				hcod = outputValue[0][2];
+				hnam = outputValue[0][3];
+			}
+
+			jsonStr.append("\"ccod\":\"");
+			jsonStr.append(ccod);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"ctyp\":\"");
+			jsonStr.append(ctyp);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"cnam\":\"");
+			jsonStr.append(cnam);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"hcod\":\"");
+			jsonStr.append(hcod);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"hnam\":\"");
+			jsonStr.append(hnam);
+			jsonStr.append("\",");
+			string sql2 = "select WBS from CHINT_SCXXCDTZD where TYPE||TIME||FLOW||'-'||FLOW2 = '";
+			sql2.append(conlist).append("'");
+
+			int colmun2 = 0, count2 = 0;
+			char ***outputValue2 = NULL;
+			QuerySQLNoInputParam((char *)sql2.c_str(), &colmun2, &count2, &outputValue2);
+			if (count2 > 0) {
+				projn = outputValue2[0][0];
+				printf("projn==%s\n", projn);
+			}
+			jsonStr.append("\"projn\":\"");
+			jsonStr.append(projn);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"duser\":\"");
+			jsonStr.append(duser);
+			jsonStr.append("\",");
+
+			AOM_ask_value_date(changeTag, "creation_date", &creation_date);//zt2_ChangeDate
+			creationStr.append(to_string(creation_date.year)).append("-").
+				append(to_string(creation_date.month+1)).append("-").
+				append(to_string(creation_date.day)).append(" ").
+				append(to_string(creation_date.hour)).append(":").
+				append(to_string(creation_date.minute)).append(":").append(to_string(creation_date.second));
+
+			AOM_ask_value_date(changeTag, "date_released", &zt2_ChangeDate);//zt2_ChangeDate
+			zt2_ChangeStr.append(to_string(creation_date.year)).append("-").
+				append(to_string(creation_date.month+1)).append("-").
+				append(to_string(creation_date.day)).append(" ").
+				append(to_string(creation_date.hour)).append(":").
+				append(to_string(creation_date.minute)).append(":").append(to_string(creation_date.second));
+			jsonStr.append("\"ddate\":\"");
+			jsonStr.append(creationStr);
+			jsonStr.append("\",");
+			jsonStr.append("\"pdate\":\"");
+			jsonStr.append(zt2_ChangeStr);
+			jsonStr.append("\",");
+
+			int num2; tag_t* second;
+
+			ITKCALL(ifail = AOM_ask_value_tags(changeTag, "IMAN_specification", &num2, &second));
+			char *uid;
+			if (num2 > 0) {
+				ITK__convert_tag_to_uid(second[0], &uid);
+			}
+
+			jsonStr.append("\"cfile\":\"");
+			jsonStr.append(uid);
+			jsonStr.append("\"");
+			jsonStr.append("}]");
+
+			string mes = callHttpserver2(jsonStr, "SendMesXXD.jar");
+			printf("mes==> %s ", mes.c_str());
+
+		}
+	}
+
+	DisConnServer();
+	return ifail;
+
+}
+string getDateStr(tag_t changeTag,char *propName) {
+	date_t creation_date = NULLDATE;
+	string zt2_ChangeStr = "";
+	AOM_ask_value_date(changeTag, propName, &creation_date);//zt2_ChangeDate
+	char *date;
+	/*if (creation_date.year<=0) {
+		ITK_date_to_string(creation_date, &date);
+		zt2_ChangeStr.append(date);
+	}*/
+	if (creation_date.year >0) {
+		zt2_ChangeStr.append(to_string(creation_date.year)).append("-").
+			append(to_string(creation_date.month+1)).append("-").
+			append(to_string(creation_date.day)).append(" ").
+			append(to_string(creation_date.hour)).append(":").
+			append(to_string(creation_date.minute)).append(":").append(to_string(creation_date.second));
+	}
+	
+	return zt2_ChangeStr;
+}
+/*
+	�ж϶���objtag�Ƿ�����type_name����
+*/
+bool isTypeOf22(tag_t objtag, const char * type_name) {
+	bool is_type = false;
+	char *type_class;
+	if (objtag == NULLTAG) {
+		return is_type;
+	}
+	ITKCALL(AOM_ask_value_string(objtag,"object_type",&type_class));
+	printf("type_class : %s type_name %s \n", type_class, type_name);
+	if (type_class!=NULL && strcmp(type_name, type_class) == 0) {
+		is_type = true;
+	}
+	return is_type;
+}
+void Split(string strArg, string spliter, vector<string> &ans)
+{
+	ans.clear();
+	size_t index0;
+	string one_arg;
+	if (strArg.find_first_not_of(' ') == string::npos)
+		strArg = "";
+	while (strArg.size() > 0)
+	{
+		index0 = strArg.find(spliter);
+		if (index0 != string::npos)
+		{
+			one_arg = strArg.substr(0, index0);
+			strArg = strArg.substr(index0 + spliter.size());
+			ans.push_back(one_arg);
+		}
+		else
+		{
+			ans.push_back(strArg);
+			break;
+		}
+	}
+}
+string& replace_all(string& str, const  string& old_value, const  string& new_value)
+{
+	if (strstr(str.c_str(), old_value.c_str()) != NULL) {
+		vector<string> type_vec;
+		Split(str.c_str(), old_value.c_str(), type_vec);
+		char new_str[512] = "\0";
+		for (int i = 0; i < type_vec.size(); i++)
+		{
+			strcat(new_str, type_vec[i].c_str());
+			if (i < type_vec.size() - 1) {
+				strcat(new_str, new_value.c_str());
+			}
+		}
+		string new_value(new_str);
+		str = new_value.c_str();
+	}
+	return   str;
+}
+string getFacotryNoVal(string facNo) {
+	string strResult;
+
+	//cmdָ��
+	char cmd[256] = "";
+	strcpy(cmd, "java -jar \"");
+	//strcat(cmd, jar_file);
+	strcat(cmd, getenv("TC_ROOT"));
+	strcat(cmd, "\\bin\\");
+	strcat(cmd, "getFactoryNum.jar");
+	strcat(cmd, "\" ");
+
+	strcat(cmd, facNo.c_str());
+
+	printf("·��:\n%s\n", cmd);
+	char buf[8000] = { 0 };
+	FILE* pf = NULL;
+	if ((pf = _popen(cmd, "r")) == NULL) {
+		printf("�ӿڷ���:\n%s", "1");
+	}
+
+	while (fgets(buf, sizeof buf, pf)) {
+		strResult += buf;
+	}
+	_pclose(pf);
+	strResult = replace_all(strResult, "\n", "");
+	printf("strResult %s \n", strResult.c_str());
+	return strResult;
+}
+int chint_DesignProcess(EPM_action_message_t msg) {
+
+	
+	int ifail = ITK_ok;
+	char tgt_type[WSO_name_size_c + 1] = "", type_class[TCTYPE_class_name_size_c + 1] = "";
+	//���̽ڵ����
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	current_task = msg.task;
+	int occur_of_counts;
+	tag_t *scheduleTasks;
+	//��ȡ����
+	EPM_ask_root_task(msg.task, &root_task);
+	
+	AOM_ask_value_tags(current_task,"fnd0RootScheduleTask", &occur_of_counts,&scheduleTasks);
+	if (occur_of_counts > 0) {
+		tag_t scheduleTask = scheduleTasks[0], oGroup;
+		string jsonStr;
+		jsonStr.append("{\"ITEMS\":[{");
+		jsonStr.append("\"HEAD\":{");
+		char *plant;
+		AOM_ask_value_tag(scheduleTask, "owning_group", &oGroup);
+		AOM_ask_value_string(oGroup, "name", &plant);
+
+		//ZT2_ProjectItem 
+		tag_t parentTask;
+		AOM_ask_value_tag(scheduleTask, "fnd0ParentTask", &parentTask);
+		
+
+		int n_references = 0;
+		int *levels = NULL;
+		tag_t * references_tag = NULLTAG;
+		tag_t schedule_tag;
+		AOM_ask_value_tag(parentTask,"schedule_tag", &schedule_tag);
+		char **relations = NULL;
+		ITKCALL(WSOM_where_referenced(schedule_tag, 1, &n_references, &levels, &references_tag, &relations));
+		printf("���ù�ϵ���ҵ��ĸ���Ϊ��%d\n", n_references);
+		//���ù�ϵ�ұ����
+		for (int ii = 0; ii < n_references; ii++)
+		{
+			/*string relType = relations[ii];
+			printf("��ϵ��%s\n", relType.c_str());
+			if (strcmp(relType.c_str(),"contents") != 0 && strcmp(relType.c_str(), "����") != 0) {
+				continue;
+			}*/
+			char *name;
+			AOM_ask_value_string(references_tag[ii],"object_name",&name);
+			printf("name��%s\n", name);
+			if (isTypeOf22(references_tag[ii], "ZT2_ProjectFolder")) { //isTypeOf22(references_tag[ii], "ZT2_ProjectFolder")
+				//
+				int n_references2 = 0;
+				int *levels2 = 0;
+				tag_t * references_tag2 = NULLTAG;
+				char ** relation_type_name2 = NULL;
+				WSOM_where_referenced(references_tag[ii], 1, &n_references2, &levels2, &references_tag2, &relation_type_name2);
+				printf("���ù�ϵ���ҵ��ĸ���Ϊ��%d\n", n_references2);
+				for (int xx = 0; xx < n_references2; xx++)
+				{
+					printf("relation_type_name2��%s\n", relation_type_name2[xx]);
+					if (isTypeOf22(references_tag2[xx], "ZT2_ProjectItem")) {
+						char * zt2_WBSNo,*itemID;
+						AOM_ask_value_string(references_tag2[xx], "zt2_WBSNo", &zt2_WBSNo);
+						AOM_ask_value_string(references_tag2[xx], "item_id", &itemID);
+						printf("zt2_WBSNo %s \n", zt2_WBSNo);
+						/*AOM_ask_value_string(type_tag, "item_id", &chgorder);*/
+						jsonStr.append("\"projn\":\"");
+						jsonStr.append(zt2_WBSNo);
+						jsonStr.append("\",");
+						jsonStr.append("\"itemID\":\"");
+						jsonStr.append(itemID);
+						jsonStr.append("\",");
+						int num1; tag_t *founds1;
+						int cout = 0;
+						string facNo;
+						AOM_ask_value_tags(references_tag2[xx], "IMAN_reference", &num1, &founds1);
+						printf("num1%d\n", num1);
+						for (int t = 0; t < num1; t++) {
+							char *fName1;
+							AOM_ask_value_string(founds1[t], "object_name", &fName1);
+							printf("��Ŀ���� %s \n", fName1);
+							if (strcmp(fName1, "��Ŀ����") == 0) {
+								int num2; tag_t *founds2;
+								AOM_ask_value_tags(founds1[t], "contents", &num2, &founds2);
+								for (int j = 0; j < num2; j++) {
+									char *fName2;
+									AOM_ask_value_string(founds2[j], "object_name", &fName2);
+									if (strcmp(fName2, "�������") == 0) {
+										printf("�������\n");
+										int num3; tag_t *founds3;
+										AOM_ask_value_tags(founds2[j], "contents", &num3, &founds3);
+										printf("num3%d\n", num3);
+										for (int tt = 0; tt < num3; tt++) {
+
+											if (isTypeOf22(founds3[tt], "ZT2_FactoryNo")) {
+												
+												char *factoryNo;
+												AOM_ask_value_string(founds3[tt], "item_id", &factoryNo);
+												if (cout > 0) {
+													facNo.append(";");
+												}
+												cout = cout + 1;
+												facNo.append(factoryNo);
+												printf("factoryNo %s \n", factoryNo);
+											}
+										}
+									}
+								}
+							}
+						}
+						string facNoVal = getFacotryNoVal(facNo);
+						jsonStr.append("\"sernum\":\"");
+						jsonStr.append(facNoVal);
+						jsonStr.append("\",");
+
+						jsonStr.append("\"total\":\"");
+						jsonStr.append(to_string(cout));
+						jsonStr.append("\",");
+					}
+				}
+				break;
+			}
+		}
+		jsonStr.append("\"plant\":\"");
+		jsonStr.append(plant);
+		jsonStr.append("\",");
+
+		printf("plant %s\n", plant);
+
+		jsonStr.append("\"DESIGN_DETAIL\":[");
+		tag_t *tasks;
+		int taskConut;
+		AOM_ask_value_tags(parentTask, "child_task_taglist",&taskConut, &tasks);
+
+		printf("child_count %d\n", taskConut);
+
+		for (int i = 0; i < taskConut; i++)
+		{
+			char *design,*userName,*wbscod;
+			tag_t curTask = tasks[i],duser;
+			//actual_finish_date actual_start_date  //start_date finish_date 
+			//object_name design
+
+			if (i > 0) {
+				jsonStr.append(",");
+			}
+
+			jsonStr.append("{");
+			
+			AOM_ask_value_string(curTask,"object_name",&design);
+			string pstime = getDateStr(curTask, "start_date");
+			string rstime = getDateStr(curTask, "finish_date");
+			string ptime = getDateStr(curTask, "actual_start_date");
+			string rtime = getDateStr(curTask, "actual_finish_date");
+			tag_t *dusers;
+			int cot = 0;
+			AOM_ask_value_tags(curTask,"ResourceAssignment",&cot,&dusers);
+			if (cot > 0) {
+				AOM_ask_value_string(dusers[0], "user_name", &userName);
+			}
+			AOM_ask_value_string(curTask, "wbs_code", &wbscod);
+
+			jsonStr.append("\"design\":\"");
+			jsonStr.append(design);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"pstime\":\"");
+			jsonStr.append(pstime);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"rstime\":\"");
+			jsonStr.append(rstime);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"ptime\":\"");
+			jsonStr.append(ptime);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"rtime\":\"");
+			jsonStr.append(rtime);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"duser\":\"");
+			jsonStr.append(userName);
+			jsonStr.append("\",");
+
+			jsonStr.append("\"wbscod\":\"");
+			jsonStr.append(wbscod);
+			jsonStr.append("\"}");
+		}
+
+		jsonStr.append("]");
+		jsonStr.append("}}]}");
+
+		string mes = callHttpserver2(jsonStr, "SendDesignProcess.jar");
+		printf("mes==> %s ", mes.c_str());
+	}
+
+	return ifail;
+
+}
+
+
+int Check_range(EPM_rule_message_t msg)
+{
+	Book* book = nullptr;
+	book = xlCreateBook();//xls�ļ���xlCreateBook() �����򿪣�xlsx�ļ���xml�ṹ�����Ե���xlCreateXMLBook() �������򿪡�
+	book->setKey(L"Halil Kural", L"windows-2723210a07c4e90162b26966a8jcdboe");//��������˸ÿ⣬��������Ӧ��key����û�й�����������
+	EPM_decision_t decision = EPM_go;
+	int ifail = ITK_ok, arg_cnt = 0, i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	char * object_TYPE_1 = NULL;
+	char * object_string = NULL;
+	string value_type = "";
+	string value_property="";
+	
+	//��ȡ��ǰ����������
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+	ifail = EPM_ask_root_task(task_tag, &rootTask_tag);
+	//��ȡĿ�����ö���
+	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments);
+	//ѭ��Ŀ�����
+	for (i = 0; i < att_cnt; i++) {
+	//�������ݼ�
+		tag_t rev_tag=attachments[i];
+		AOM_ask_value_string(rev_tag,"object_type",&object_TYPE_1);
+		cout<<object_TYPE_1<<endl;
+	
+			cout<<"111111111111111111"<<endl;
+			tag_t relation_type_tag = NULLTAG;
+			ifail = GRM_find_relation_type("TC_Attaches", &relation_type_tag);
+			if (ifail != ITK_ok) { /* your error logic here */ }
+			   int n_specs = 0;
+			tag_t* specs = NULL;
+
+			ITKCALL(ifail = GRM_list_secondary_objects_only(rev_tag, relation_type_tag, &n_specs, &specs));
+			if (ifail != ITK_ok) { /* your error logic here */ }
+			for (int j = 0; j < n_specs; j++)
+			{
+				cout<<"2222222222222"<<endl;
+				 tag_t type_tag = NULLTAG; char type_name[TCTYPE_name_size_c+1] = "";
+				ifail = TCTYPE_ask_object_type (specs[j], &type_tag);
+				if (ifail != ITK_ok) { /* your error logic here */ }
+
+				ifail = TCTYPE_ask_name(type_tag, type_name);
+				if (ifail != ITK_ok) { /* your error logic here */ }
+				cout<<"type_name-----------"<<type_name<<endl;
+				if (strcmp(type_name, "MSExcel") == 0||strcmp(type_name, "MSExcelX") == 0)
+				{
+					cout<<"333333333333333"<<endl;
+					int n_refs = 0;
+					tag_t* refs = NULL;
+
+					ifail = AE_ask_all_dataset_named_refs(specs[j], "excel", &n_refs, &refs);
+					if (ifail != ITK_ok) { /* your error logic here */ }
+
+					ifail = AE_export_named_ref(specs[j], "excel", "C:\\TEMP\\export_text.xls");
+					if (ifail != ITK_ok) { /* your error logic here */ }
+					//����Ƿ���ڵ�Ԫ������Ϊ��xxxx��
+					wstringstream excel_path;
+					excel_path<<"C:\\TEMP\\export_text.xls";
+					if (book->load(excel_path.str().c_str()))
+					{
+						cout<<"88888888"<<endl;
+						Sheet* sheet = book->getSheet(0);//��õ�1��sheetҳ
+						string val ;
+						val = ws2s(sheet->readStr(0, 15));//��ȡÿ����Ԫ���ֵ
+						printf("val:%s\n", val.c_str());
+					
+							
+					}
+				}
+			}
+
+	
+		
+		
+	}
+	if (attachments != NULL)
+	{
+		MEM_free(attachments);
+		attachments = NULL;
+	}
+	if (object_TYPE_1 != NULL)
+	{
+		MEM_free(object_TYPE_1);
+		object_TYPE_1 = NULL;
+	}
+	if (object_string != NULL)
+	{
+		MEM_free(object_string);
+		object_string = NULL;
+	}
+	
+	return EPM_nogo;
+	
+		
+	}
+
diff --git a/General/General/ChintSendMessage.cpp b/General/General/ChintSendMessage.cpp
new file mode 100644
index 0000000..66b594a
--- /dev/null
+++ b/General/General/ChintSendMessage.cpp
@@ -0,0 +1,269 @@
+#include "tc_util.h"
+#include "chint_Handler.h"
+
+#include <stdlib.h>
+// #include "common_itk_util.h"
+#pragma warning(disable:4996)
+// #include "util.h"
+
+using namespace std;
+void sendMessage(string user_id, string messag, string method);
+
+int ChintSendMessage_1(EPM_action_message_t msg)
+{
+	// LINFO << "ChintSendMessage�����ı���Ϣ";
+	char *task_type, *user_id, *job_name, *task_userID;
+	tag_t task = msg.task;
+	char *argflag =NULL,*argvalue=NULL ,*arg = NULL,arg_type[20] = "";
+	int arg_cnt=0,i2=0,ifail=0;
+	// cout<<"1111"<<endl;
+
+	char *comments2=NULL;
+	date_t decision_date;
+	EPM_signoff_decision_t dec;
+	
+	arg_cnt = TC_number_of_arguments(msg.arguments);
+
+	for (i2=0;i2<arg_cnt;i2++)
+	{
+		arg = TC_next_argument(msg.arguments);
+		ITKCALL(ifail = ITK_ask_argument_named_value((const char*)arg, &argflag, &argvalue));
+		if (stricmp(argflag, "type") == 0)
+		{
+			if(argvalue != NULL)
+			{
+				strcpy(arg_type,argvalue);
+			}
+		}
+
+	}
+	
+	string code="1";
+	if(strcmp("start",arg_type)==0)
+	{
+		code="1";
+	}else if(strcmp("end",arg_type)==0)
+	{
+		code="2";
+	}
+	if(strcmp(code.c_str(),"1")==0)
+	{
+		ITKCALL(AOM_ask_value_string(task, "task_type", &task_type));
+		//printf("task_type:%s\r\n",task_type);
+		// LINFO << "�ڵ�task_type[" << task_type << "]";
+		POM_get_user_id(&user_id);
+		// LINFO << "��ǰ��¼�û�ID[" << user_id << "]";
+		tag_t user=NULL;
+		char	*sub_task_object_type, *task_name;
+		ITKCALL(AOM_ask_value_string(task, "object_type", &sub_task_object_type));
+		// LINFO << "�ڵ�Object_type[" << sub_task_object_type << "]";
+		ITKCALL(AOM_ask_value_string(task, "object_name", &job_name));
+		tag_t workflow;
+		ITKCALL(EPM_ask_root_task(task, &workflow));
+		ITKCALL(AOM_ask_value_string(workflow, "job_name", &task_name));
+		// LINFO << "�ڵ�����:" << job_name;
+		// LINFO << "�������ƣ�" << task_name;	
+		stringstream id;
+		if (strcmp(task_type, "EPMDoTask") == 0)
+		{
+			// LINFO << "DO�ڵ�";
+			// tag_t user;
+			EPM_ask_responsible_party(task, &user);
+
+			
+			if (user == NULL)
+			{
+				// LINFO << "DO�ڵ�δָ��������";
+				return 0;
+			}
+			POM_ask_user_id(user, &task_userID);
+			id << task_userID;
+		}
+		else if ((strstr(sub_task_object_type, "ReviewTask") != NULL) || (strstr(sub_task_object_type, "AcknowledgeTask") != NULL))
+		{
+			// LINFO << "���/�Ͽɽڵ�";
+			tag_t tmp_select_signoff_task;
+			ITKCALL(EPM_ask_sub_task(task, EPM_select_signoff_team_task, &tmp_select_signoff_task));
+			int user_count = 0;
+			tag_t  *signoffs;
+			ITKCALL(EPM_ask_task_reviewers_users(tmp_select_signoff_task, &user_count, &signoffs));
+			if (user_count == 0)
+			{
+				// LINFO << "��ǰ�ڵ�δָ���û�->" << job_name;
+				return 0;
+			}
+			else if (user_count>0)
+			{
+				id.str("");
+				for (int i = 0; i<user_count; i++)
+				{
+					if (signoffs[i] == NULL)
+					{
+						// LINFO<<"��";
+						continue;
+					}
+
+					ITKCALL(POM_ask_user_id(signoffs[i], &task_userID));
+					id << task_userID;
+					if (i != (user_count - 1))
+					{
+						id << ";";
+					}
+				}
+
+			}
+		}
+		else if (strcmp(task_type, "EPMPerformSignoffTask") == 0 || strcmp(task_type, "EPMSelectSignoffTask") == 0)
+		{
+			tag_t parent_task;
+			ITKCALL(EPM_ask_parent_task(task, &parent_task));
+			ITKCALL(AOM_ask_value_string(parent_task, "object_name", &job_name));
+			// LINFO << "���ڵ�����:" << job_name;
+			// LINFO << "ǩ��ڵ�";
+			int user_count = 0;
+			tag_t  *signoffs;
+			ITKCALL(EPM_ask_task_reviewers_users(task, &user_count, &signoffs));
+			if (user_count == 0)
+			{
+				// LINFO << "��ǰ�ڵ�δָ���û�->" << job_name;
+				return 0;
+			}
+			else if (user_count>0)
+			{
+				id.str("");
+				for (int i = 0; i<user_count; i++)
+				{
+					ITKCALL(POM_ask_user_id(signoffs[i], &task_userID));
+					id << task_userID;
+					if (i != (user_count - 1))
+					{
+						id << ";";
+					}
+				}
+
+			}
+		}
+		// LINFO << "ָ���û�ID��" << id.str();
+		//printf("����Ҫ���͵��û�ID:%s\r\n",user_id);	
+		string name = task_name;
+		if (name.find("\\") != string::npos)
+		{
+			name = name.replace(name.find("\\"), 1, "-");
+		}
+		if (name.find("/") != string::npos)
+		{
+			name = name.replace(name.find("/"), 1, "-");
+		}
+
+		string mess = "����һ���������Ĺ�������(";
+		mess.append(name);
+		mess.append("),�뾡���½PLMϵͳ������");
+		// sendMessage(id.str().c_str(), mess, "ChintSendMessage");
+		// LINFO << "ChintSendMessage�ı���Ϣ���ͽ���";
+	}else if(strcmp(code.c_str(),"2")==0)
+	{
+		ITKCALL(AOM_ask_value_string(task, "task_type", &task_type));
+		//printf("task_type:%s\r\n",task_type);
+		// LINFO << "�ڵ�task_type[" << task_type << "]";
+		POM_get_user_id(&user_id);
+		// LINFO << "��ǰ��¼�û�ID[" << user_id << "]";
+		tag_t user=NULL;
+		char	*sub_task_object_type=NULL, *task_name=NULL,*owningUserId=NULL;
+		tag_t owning_user=NULL;
+		ITKCALL(AOM_ask_value_string(task, "object_type", &sub_task_object_type));
+		// LINFO << "�ڵ�Object_type[" << sub_task_object_type << "]";
+		ITKCALL(AOM_ask_value_string(task, "object_name", &job_name));
+		tag_t workflow;
+		ITKCALL(EPM_ask_root_task(task, &workflow));
+		ITKCALL(AOM_ask_value_string(workflow, "job_name", &task_name));//��������
+		AOM_ask_value_tag(workflow,"owning_user",&owning_user);//���̷�����
+		AOM_UIF_ask_value(owning_user,"user_id",&owningUserId);
+
+		// LINFO << "�ڵ�����:" << job_name;
+		// LINFO << "�������ƣ�" << task_name;	
+		stringstream id;
+		cout<<"===="<<task_type<<endl;
+		if (strcmp(task_type, "EPMPerformSignoffTask") == 0 || strcmp(task_type, "EPMSelectSignoffTask") == 0)
+		{
+			//���̽ڵ�����
+			char *parent_name=NULL;
+			AOM_ask_value_string(task,"parent_name",&parent_name);
+
+			string trueName;
+			EPM_ask_signoff_decision(task, &dec, &comments2, &decision_date);
+			// cout<<"0"<<endl;
+			trueName.append("��������\"").append(task_name).append("\"��ͨ��\"").append(parent_name).append("\"��������");
+			// cout<<"1"<<trueName<<endl;
+		// EPM_ask_signoff_details()
+			// cout<<"dec======"<<dec<<endl;
+			
+				int user_count = 0;
+				tag_t  *reviewers=NULL;
+				ITKCALL(EPM_ask_task_reviewers_users(task, &user_count, &reviewers));
+				char *reviewerName=NULL;
+				if(user_count>0)
+				{
+					for(int j=0;j<user_count;j++)
+					{
+						AOM_UIF_ask_value(reviewers[j],"person",&reviewerName);
+						trueName.append(reviewerName).append("   ");
+
+					}
+				}
+				trueName.append("���뼰ʱ������");
+			/*if(dec=='Y')
+			{
+				cout<<"Y"<<endl;
+				int user_count = 0;
+				tag_t  *reviewers=NULL;
+				ITKCALL(EPM_ask_task_reviewers_users(task, &user_count, &reviewers));
+				char *reviewerName=NULL;
+				if(user_count>0)
+				{
+					for(int j=0;j<user_count;j++)
+					{
+						AOM_UIF_ask_value(reviewers[j],"person",&reviewerName);
+						trueName.append(reviewerName).append("   ");
+
+					}
+				}
+				trueName.append("���뼰ʱ������");
+				
+		cout<<trueName.c_str()<<endl;
+				// sendMessage(owningUserId, trueName, "ChintSendMessage");
+			}else if(dec=='N')
+			{
+				cout<<"N"<<endl;
+			}*/
+			// cout<<"2"<<endl;
+			cout<<"2"<<trueName<<endl;
+			// sendMessage(owningUserId, trueName, "ChintSendMessage");
+		}
+		
+	}
+
+	return 0;
+}
+
+void sendMessage(string user_id, string messag, string method)
+{
+	char cmd[256] = "";
+	string filesStr;
+	filesStr.append("\"");
+	filesStr.append(messag);
+	filesStr.append("\"");
+	char * tc_root_dir = getenv("TC_ROOT");
+	string execStr;
+	execStr.append("cmd.exe /c java -jar ");
+	execStr.append(tc_root_dir);
+	execStr.append("\\bin\\DesignTask.jar ");
+	execStr.append(method);
+	execStr.append(" ");
+	execStr.append(user_id);
+	execStr.append(" ");
+	execStr.append(filesStr);
+	// LINFO << "����jar=" << execStr.c_str();
+	printf("\n%s\n", execStr.c_str());
+	system(execStr.c_str());
+
+}
\ No newline at end of file
diff --git a/General/General/CloneProcess.cpp b/General/General/CloneProcess.cpp
new file mode 100644
index 0000000..08b0ea7
--- /dev/null
+++ b/General/General/CloneProcess.cpp
@@ -0,0 +1,1243 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ocilib.h"
+#include <cfm/cfm.h>
+#include <me/me.h>
+#include <property/nr.h>
+#include <tccore/aom.h>
+#include <tccore/item.h>
+#include <tccore/workspaceobject.h>
+using namespace std;
+
+typedef struct {
+	string cpxh;//��Ʒ�ͺ� �͡��С��ߡ�������
+	string dyxq;
+	string zyxq;
+	string gyxq;
+	string tyxq;
+	string wyxq;
+}ByqBean;
+typedef struct {
+	string rgsj;//��Ʒ�ͺ� �͡��С��ߡ�������
+	string jqsj;
+	string zbsj;
+	string zrsczq;
+}TimeBean;
+typedef struct {
+	string temGxCode;
+	string temGxName;
+
+}TemGxBean;
+struct FlBean
+{
+	tag_t flTag=NULLTAG;
+	string blQty;
+};
+string getCshVal(string name, string code);
+
+string sqlProTime = "select GYNAME,GXNAME from CHINT_WORKHOUR where \"PRODUCTXH\" = '%s' and GYID = '%s' and COMPANYCODE ='M060' and \"ProCycle\"<1 ";
+string sqlProTime2 = "select GYNAME,GXNAME from CHINT_WORKHOUR where \"PRODUCTXH\" = '%s' and GYID = '%s' and JSASK = '%s' and COMPANYCODE ='M060' and \"ProCycle\"<1 ";
+
+string sqlRxfs = "select \"TarGXCODE\", \"TarGXNAME\", \"TemGXCODE\", \"TemGXNAME\" from \"CHINT_WORKHOUR_WhGXName\" where \"WindStyle\" = '%s' and COMPANYCODE ='M060'";
+string sqlGyRule = "select GYID from \"CHINT_WORKHOUR_WhGYRule\" where \"ProductZu\" = '%s' and \"TuHao\" = '%s' and COMPANYCODE ='M060'";
+string sqlCpxh = "SELECT \"ProductZu\" FROM \"CHINT_WORKHOUR_WhProductXH\" where \"ProductXH\" = '%s' and COMPANYCODE ='M060' ";
+string sqlGxTime = "select GXCODE,ARTIFICIALTIME,MACHINETIME,READINESSTIME,\"ProCycle\" from CHINT_WORKHOUR where \"PRODUCTXH\" = '%s' and GYID = '%s' and COMPANYCODE ='M060'";
+string sqlGxTime2 = "select GXCODE,ARTIFICIALTIME,MACHINETIME,READINESSTIME,\"ProCycle\" from CHINT_WORKHOUR where \"PRODUCTXH\" = '%s' and GYID = '%s' and JSASK = '%s' and COMPANYCODE ='M060'";
+void save_representation2(tag_t primaryTag, tag_t secondTag, char* relationType)
+{
+	tag_t typeTag = NULLTAG;
+	ITKCALL(GRM_find_relation_type(relationType, &typeTag));
+
+	ITKCALL(AOM_refresh(primaryTag, TRUE));
+	ITKCALL(AOM_refresh(secondTag, TRUE));
+	tag_t relationTag = NULLTAG;
+	ITKCALL(GRM_create_relation(primaryTag, secondTag, typeTag, NULLTAG, &relationTag));//�����ϵ�Ѿ����ڣ���ô�������Ӷ���
+
+	ITKCALL(GRM_save_relation(relationTag));//�ܱ�Ҫ
+	ITKCALL(AOM_save(primaryTag));
+	ITKCALL(AOM_save(secondTag));
+	ITKCALL(AOM_refresh(primaryTag, FALSE));
+	ITKCALL(AOM_refresh(secondTag, FALSE));
+}
+void updateTemGxCode(tag_t processTag, map<string, TemGxBean> temGxMap) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(processTag, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGxLine = c_line_tags[i], *towGxLines, oneGx, gxItem;
+		char* gxbm1;
+		AOM_ask_value_string(oneGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm1);
+
+		printf("gxbm1===>%s\n", gxbm1);
+		if (temGxMap.count(gxbm1) > 0) {
+			char* oldName;
+			TemGxBean temGxBean = temGxMap[gxbm1];
+			AOM_lock(oneGxLine);
+			AOM_set_value_string(oneGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", temGxBean.temGxCode.c_str());
+			AOM_save(oneGxLine);
+			AOM_unlock(oneGxLine);
+			ITKCALL(AOM_ask_value_tag(oneGxLine, "bl_line_object", &oneGx));
+			ITKCALL(ITEM_ask_item_of_rev(oneGx, &gxItem));
+			ITKCALL(AOM_lock(gxItem));
+			ITKCALL(AOM_ask_value_string(gxItem, "object_name", &oldName));
+			ITKCALL(AOM_set_value_string(gxItem, "object_name", temGxBean.temGxName.c_str()));
+			ITKCALL(AOM_save(gxItem));
+			ITKCALL(AOM_unlock(gxItem));
+			ITKCALL(AOM_lock(oneGx));
+			ITKCALL(AOM_set_value_string(oneGx, "object_name", temGxBean.temGxName.c_str()));
+			ITKCALL(AOM_save(oneGx));
+			ITKCALL(AOM_unlock(oneGx));
+			printf("oldName===>%s\n", oldName);
+			printf("temGxName===>%s\n", temGxBean.temGxName.c_str());
+			printf("temGxCode===>%s\n", temGxBean.temGxCode.c_str());
+		}
+
+		int c_cnt = 0;
+		BOM_line_ask_all_child_lines(oneGxLine, &c_cnt, &towGxLines);
+		for (int j = 0; j < c_cnt; j++) {
+			tag_t towGxLine = towGxLines[j];
+			tag_t towGx, gxItem2;
+			char* gxbm2;
+			ITKCALL(AOM_ask_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm2));
+
+			printf("gxbm2===>%s\n", gxbm2);
+			if (temGxMap.count(gxbm2) > 0) {
+				TemGxBean temGxBean = temGxMap[gxbm2];
+				AOM_lock(towGxLine);
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", temGxBean.temGxCode.c_str()));
+				AOM_save(towGxLine);
+				AOM_unlock(towGxLine);
+				char* oldName, *oldName2;
+				ITKCALL(AOM_ask_value_tag(towGxLine, "bl_line_object", &towGx));
+				ITKCALL(ITEM_ask_item_of_rev(towGx, &gxItem2));
+				ITKCALL(AOM_lock(gxItem2));
+				ITKCALL(AOM_ask_value_string(gxItem2, "object_name", &oldName));
+				ITKCALL(AOM_set_value_string(gxItem2, "object_name", temGxBean.temGxName.c_str()));
+				ITKCALL(AOM_save(gxItem2));
+				ITKCALL(AOM_unlock(gxItem2));
+				ITKCALL(AOM_ask_value_string(gxItem2, "object_name", &oldName2));
+				printf("oldName===>%s\n", oldName);
+				printf("oldName2===>%s\n", oldName2);
+				printf("temGxName===>%s\n", temGxBean.temGxName.c_str());
+				printf("temGxCode===>%s\n", temGxBean.temGxCode.c_str());
+				ITKCALL(AOM_lock(towGx));
+				ITKCALL(AOM_set_value_string(towGx, "object_name", temGxBean.temGxName.c_str()));
+				ITKCALL(AOM_save(towGx));
+				ITKCALL(AOM_unlock(towGx));
+
+			}
+
+		}
+	}
+	BOM_close_window(ebom_window);
+}
+string getCshVal(string name,string code) {
+
+	string strResult;
+	string schVal = "";
+	//cmdָ��
+	char cmd[256] = "";
+	strcpy(cmd, "java -jar \"");
+	//strcat(cmd, jar_file);
+	strcat(cmd, getenv("TC_ROOT"));
+	strcat(cmd, "\\bin\\findCshSql.jar");
+	strcat(cmd, "\" ");
+	strcat(cmd, name.c_str());
+	strcat(cmd, "\" ");
+	strcat(cmd, code.c_str());
+	printf("·��:\n%s\n", cmd);
+	char buf[8000] = { 0 };
+	FILE* pf = NULL;
+	if ((pf = _popen(cmd, "r")) == NULL) {
+		printf("�ӿڷ���:\n%s", "1");
+	}
+
+	while (fgets(buf, sizeof buf, pf)) {
+		strResult += buf;
+	}
+	_pclose(pf);
+	vector<string> vec;
+	Split(strResult,"CSHVAL:[",vec);
+	if (vec.size() > 0) {
+		Split(vec[1], "]", vec);
+		schVal = vec[0];
+	}
+	
+	return schVal;
+}
+string getJdbVal(string name,string yqz,string checkcode,string draw,string modelVersion,string code,string checkCode) {
+	string drawingno = draw.append("-").append(name);
+	string getCode = "select checkno,NUMBEROFCHECKS from CHINT_CHECK_TITLE WHERE drawingno = '%s' and modelversion='%s' order by NUMBEROFCHECKS desc ";
+	string getNo = "select NO from CHINT_CHECK_DETAILS_TEMPLATE where code ='%s' and modelversion = '%s' and checkCode = '%s' ";
+	string val = "";
+	char selectRxfs[500];
+	sprintf(selectRxfs, getNo.c_str(), code.c_str(), modelVersion.c_str(), checkCode.c_str());
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	QuerySQLNoInputParam(selectRxfs, &outputColumn1, &outputValueCount1, &outputValue1);
+	printf("selectRxfs ===>%s\n", selectRxfs);
+	if (outputValueCount1 > 0) {
+		string no = outputValue1[0][0];
+		char selectRxfs2[500];
+		outputValueCount1 = 0;
+		outputColumn1 = 0;
+		outputValue1 = NULL;
+		sprintf(selectRxfs2, getCode.c_str(), drawingno.c_str(), modelVersion.c_str());
+		printf("selectRxfs2 ===>%s\n", selectRxfs2);
+		QuerySQLNoInputParam(selectRxfs2, &outputColumn1, &outputValueCount1, &outputValue1);
+		if (outputValueCount1 > 0) {
+			string checkNo = outputValue1[0][0];
+			string numofCheck = outputValue1[0][1];
+			string getNo = "select %s from CHINT_CHECK_DETAILS where no ='%s' and NUMBEROFCHECKS = '%s' and checkno = '%s' and modelversion = '%s' ";
+			char selectRxfs3[500];
+			sprintf(selectRxfs3, getNo.c_str(), yqz.c_str(), no.c_str(), numofCheck.c_str(), checkNo.c_str(), modelVersion.c_str());
+			printf("selectRxfs3 ===>%s\n", selectRxfs3);
+
+			int outputColumn2 = 0, outputValueCount2 = 0;
+			char*** outputValue2 = NULL;
+			QuerySQLNoInputParam(selectRxfs3, &outputColumn2, &outputValueCount2, &outputValue2);
+			if (outputValueCount1 > 0) {
+				val = outputValue2[0][0];
+			}
+		}
+	}
+	return val;
+}
+typedef struct {
+	string no;//��Ʒ�ͺ� �͡��С��ߡ�������
+	string mentNo;
+	string mentDesc;
+	string mentResult;
+}JYXBean;
+void setZljyx(string gxbm2, string th,string lastId,string name,tag_t towGx) {
+
+	string code;
+	printf("th == >%s \n", th.c_str());
+	if (strstr(th.c_str(),"-") != NULL) {
+		vector<string> vec;
+		Split(th, "-", vec);
+		code.append(vec[0]).append("-").append("X");
+	}
+	else {
+		code = th;
+	}
+	printf("code == >%s \n", code.c_str());
+	string sql = "select cqmodelnno,drawingno,cqmanagementno,cqmanagementdesc,cqmanagementresult,datasource, checkline, checkcode, parameterization, code, modelversion from CHINT_QUALITY_MANAGEMENT_SYSTEM where cpcmcode like '%s' and cdrawingno = '%s' order by cqmodelnno asc";
+	char selectRxfs[500];
+	string gxbmMsg;
+	gxbmMsg.append("%").append(gxbm2).append("%");
+	sprintf(selectRxfs, sql.c_str(), gxbmMsg.c_str(), code.c_str());
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	printf("search3 ===> %s\n", selectRxfs);
+	QuerySQLNoInputParam(selectRxfs, &outputColumn1, &outputValueCount1, &outputValue1);
+	printf("search result ===> %d\n", outputValueCount1);
+	vector< JYXBean> beans;
+
+	for (int num = 0; num < outputValueCount1; num++) {
+		//TarGXCODE\", \"TarGXNAME\", \"TemGXCODE\", \"TemGXNAME
+		JYXBean bean;
+		string cqmodelnno = outputValue1[num][0]; //���
+		string drawingno = outputValue1[num][1]; //У�Ա�ͼ��
+		string cqmanagementno = outputValue1[num][2]; //����no
+		string cqmanagementdesc = outputValue1[num][3]; //��������
+		string cqmanagementresult = outputValue1[num][4]; //����
+		string datasource = outputValue1[num][5]; //У�Ա��������
+		string checkline = outputValue1[num][6]; // Ҫ��ֵ�����ֵ designresult,PROOFREADRESULT
+		string checkcode = outputValue1[num][7]; //checkcode
+		string parameterization = outputValue1[num][8]; //code
+		string code = outputValue1[num][9]; //У�Ա�ģ��
+		string modelversion = outputValue1[num][10]; //У�Ա�ģ��汾
+		bean.mentDesc = cqmanagementdesc;
+		bean.mentNo = cqmanagementno;
+		bean.no = cqmodelnno;
+		if (cqmanagementresult.empty()) {
+
+			if (datasource.compare("У�Ա�") == 0) {
+			//	string getCode = "select code,NUMBEROFCHECKS from CHINT_CHECK_TITLE WHERE drawingno = '?' order by NUMBEROFCHECKS desc ";
+				if (checkline.compare("Ҫ��ֵ") == 0 && !checkcode.empty()) {
+					bean.mentResult = getJdbVal(lastId,"designresult", checkcode, drawingno, modelversion,code, checkcode); //designresult,PROOFREADRESULT
+				}
+				else if (checkline.compare("���ֵ") == 0 && !checkcode.empty()) {
+					bean.mentResult = getJdbVal(lastId, "PROOFREADRESULT", checkcode, drawingno, modelversion, code, checkcode);
+				}
+			}
+			else if (!parameterization.empty()) {
+				string csh = getCshVal(lastId, code);
+				bean.mentResult = csh;
+			}
+		}
+		else {
+			bean.mentResult = cqmanagementresult;
+		}
+		beans.push_back(bean);
+	}
+	tag_t item, rev;
+	string objName = "��������-";
+	objName.append(name);
+	
+	if (beans.size()>0) {
+		tag_t *tableRow;
+		ITEM_create_item(NULL, objName.c_str(), "ZT2_QCHECK", NULL, &item, &rev);
+		AOM_save(item);
+		AOM_save(rev);
+		AOM_lock(item);
+		AOM_lock(rev);
+		ITKCALL(AOM_insert_table_rows(rev, "zt2_QCHECKS", 0, beans.size(), &tableRow));
+		AOM_save(rev);
+		AOM_unlock(rev);
+		AOM_save(item);
+		AOM_unlock(item);
+		for (int i = 0; i < beans.size(); i++) {
+			tag_t table = tableRow[i];
+			AOM_lock(table);
+			AOM_set_value_string(table,"zt2_code", beans[i].no.c_str());
+			AOM_set_value_string(table, "zt2_jjxbh", beans[i].mentNo.c_str());
+			AOM_set_value_string(table, "zt2_jyxmc", beans[i].mentDesc.c_str());
+			AOM_set_value_string(table, "zt2_jyxsjjg", beans[i].mentResult.c_str());
+			AOM_save(table);
+			AOM_unlock(table);
+		}
+		AOM_save(towGx);
+		save_representation2(towGx, item, "ZT2_QualityCheckRelation");
+	}
+
+}
+void getGxbmMap(tag_t processTag, map<string, tag_t>& gxDocMap, map<string, TimeBean > timebeans,
+	map<string, vector<FlBean>> flBeanMap,string th,string lastId) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(processTag, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+
+	//�޸Ĺ�ʱ
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGx = c_line_tags[i], *towGxLines;
+		char* gxbm1;
+		AOM_ask_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm1);
+		if (timebeans.count(gxbm1) > 0) {
+			AOM_lock(oneGx);
+			TimeBean tbean = timebeans[gxbm1];
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ArtificialTime", tbean.rgsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_MachineTime", tbean.jqsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ReadinessTime", tbean.zbsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ProCycle", tbean.zrsczq.c_str()));
+			AOM_save(oneGx);
+			AOM_unlock(oneGx);
+		}
+		int c_cnt = 0;
+		BOM_line_ask_all_child_lines(oneGx, &c_cnt, &towGxLines);
+		for (int j = 0; j < c_cnt; j++) {
+			tag_t towGxLine = towGxLines[j];
+			tag_t towGx;
+			char* gxbm2;
+			ITKCALL(AOM_ask_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm2));
+			if (timebeans.count(gxbm2) > 0) {
+				AOM_lock(towGxLine);
+				TimeBean tbean = timebeans[gxbm2];
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ArtificialTime", tbean.rgsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_MachineTime", tbean.jqsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ReadinessTime", tbean.zbsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ProCycle", tbean.zrsczq.c_str()));
+				AOM_save(towGxLine);
+				AOM_unlock(towGxLine);
+			}
+			char *name;
+			ITKCALL(AOM_ask_value_tag(towGxLine, "bl_line_object", &towGx));
+			AOM_ask_value_string(towGx, "object_name", &name);
+			//�����ʼ���
+			//setZljyx(gxbm2,th, lastId, name, towGx);
+			if (flBeanMap.count(gxbm2) > 0) {
+				vector<FlBean> beansVec = flBeanMap[gxbm2];
+				printf("beansVec===>%d\n", beansVec.size());
+				if (beansVec.size() > 0) {
+					tag_t axqPmatnr;
+					AOM_ask_value_tag(towGxLine, "bl_line_object", &axqPmatnr);
+					(ITEM_rev_list_bom_view_revs(axqPmatnr, &bvr_count, &bvr_list));
+					printf("bvr_count=%d\n", bvr_count);
+					if (bvr_count == 0) {
+						tag_t newView, newViewBvr, pitem;
+						ITEM_ask_item_of_rev(axqPmatnr, &pitem);
+						ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+						AOM_save(newView);
+						ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, axqPmatnr, &newViewBvr));
+						AOM_save(newViewBvr);
+						AOM_save(axqPmatnr);
+					}
+				}
+				//Ͷ����
+				for (int n = 0; n < beansVec.size(); n++) {
+					tag_t cLine;
+					FlBean cBean = beansVec[n];
+					if (cBean.flTag == NULLTAG) {
+						continue;
+					}
+					ITKCALL(BOM_line_add(towGxLine, NULL, cBean.flTag, NULL, &cLine));
+					AOM_lock(cLine);
+					string num = cBean.blQty;
+					AOM_set_value_string(cLine, "bl_quantity", num.c_str());
+					string seqNo = to_string((n + 1) * 10);
+					AOM_set_value_string(cLine, "bl_sequence_no", seqNo.c_str());
+					AOM_set_value_string(cLine, "bl_occ_type", "ZT2_FuLiao");
+					AOM_save(cLine);
+					//���unlock
+					AOM_unlock(cLine);
+					AOM_refresh(cLine, FALSE);
+				}
+				
+			}
+			
+			gxDocMap[gxbm2] = towGx;
+		}
+	}
+	BOM_save_window(ebom_window);
+	BOM_close_window(ebom_window);
+}
+void getGxbmMap(tag_t processTag, map<string, tag_t>& gxDocMap, map<string, TimeBean > timebeans) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(processTag, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGx = c_line_tags[i], *towGxLines;
+		char* gxbm1;
+		AOM_ask_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm1);
+		if (timebeans.count(gxbm1) > 0) {
+			AOM_lock(oneGx);
+			TimeBean tbean = timebeans[gxbm1];
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ArtificialTime", tbean.rgsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_MachineTime", tbean.jqsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ReadinessTime", tbean.zbsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ProCycle", tbean.zrsczq.c_str()));
+			AOM_save(oneGx);
+			AOM_unlock(oneGx);
+		}
+		int c_cnt = 0;
+		BOM_line_ask_all_child_lines(oneGx, &c_cnt, &towGxLines);
+		for (int j = 0; j < c_cnt; j++) {
+			tag_t towGxLine = towGxLines[j];
+			tag_t towGx;
+			char* gxbm2;
+			ITKCALL(AOM_ask_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm2));
+			if (timebeans.count(gxbm2) > 0) {
+				AOM_lock(towGxLine);
+				TimeBean tbean = timebeans[gxbm2];
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ArtificialTime", tbean.rgsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_MachineTime", tbean.jqsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ReadinessTime", tbean.zbsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ProCycle", tbean.zrsczq.c_str()));
+				AOM_save(towGxLine);
+				AOM_unlock(towGxLine);
+			}
+			ITKCALL(AOM_ask_value_tag(towGxLine, "bl_line_object", &towGx));
+			gxDocMap[gxbm2] = towGx;
+		}
+	}
+	BOM_close_window(ebom_window);
+}
+tag_t clone_process_from_template(char* process_item_id, boolean isXq, string productZu, string xqfs,string th, string lastId)
+{
+	tag_t item_tag = NULLTAG;
+	ITKCALL(ITEM_find_item(process_item_id, &item_tag));
+	if (item_tag == NULLTAG)
+	{
+		printf("\n MEProcess NOT found! \n");
+		return NULLTAG;
+	}
+	tag_t revision_tag = NULLTAG;
+	ITKCALL(ITEM_ask_latest_rev(item_tag, &revision_tag));
+	char* nameOld, *item_revision_id;
+	AOM_ask_value_string(revision_tag, "item_revision_id", &item_revision_id);
+	AOM_ask_value_string(revision_tag, "object_name", &nameOld);
+	MEBOM_init_module();
+
+	tag_t window_tag = NULLTAG;
+	ITKCALL(ME_create_bop_window(&window_tag));
+
+	tag_t rule_tag = NULLTAG;
+	ITKCALL(CFM_find("Latest Working", &rule_tag));
+
+	ITKCALL(BOM_set_window_config_rule(window_tag, rule_tag));
+	//AOM_ask
+	char* next_id = NULL;
+	ITKCALL(NR_next_value("MEProcess", "item_id", NULLTAG, "", "", "",
+		NULLTAG, "", "", &next_id));
+
+	tag_t clone_tag = NULLTAG;
+	ITKCALL(ME_create_process_from_template(next_id, item_revision_id,
+		nameOld, "", revision_tag, rule_tag, window_tag,
+		"Process.Template.Mapping_Consumes", &clone_tag));
+
+	if (next_id) MEM_free(next_id);
+
+	ITKCALL(AOM_refresh(clone_tag, TRUE));
+	ITKCALL(AOM_save(clone_tag));
+	ITKCALL(AOM_refresh(clone_tag, FALSE));
+
+	char* item_id = NULL;
+	ITKCALL(WSOM_ask_id_string(clone_tag, &item_id));
+
+	printf("\n\t MEProcess Clone ID: %s\n", item_id);
+	ITKCALL(AOM_unload(clone_tag));
+
+	if (item_id != NULL)
+		MEM_free(item_id);
+
+	//���ơ��������򡱡���������ҵָ���顱
+
+	if (isXq) {
+		char selectRxfs[200];
+		sprintf(selectRxfs, sqlRxfs.c_str(), xqfs.c_str());
+		int outputColumn1 = 0, outputValueCount1 = 0;
+		char*** outputValue1 = NULL;
+		printf("search3 ===> %s\n", selectRxfs);
+		QuerySQLNoInputParam(selectRxfs, &outputColumn1, &outputValueCount1, &outputValue1);
+		map<string, TemGxBean> temGxMap;
+		printf("search result ===> %d\n", outputValueCount1);
+		for (int num = 0; num < outputValueCount1; num++) {
+			//TarGXCODE\", \"TarGXNAME\", \"TemGXCODE\", \"TemGXNAME
+			string tarGxCode = outputValue1[num][0];
+			string tarGxName = outputValue1[num][1];
+			string temGxCode = outputValue1[num][2];
+			TemGxBean bean;
+			bean.temGxCode = tarGxCode;
+			bean.temGxName = tarGxName;
+			temGxMap[temGxCode] = bean;
+		}
+		//���� �������ݿ����ø��¹�����������
+		updateTemGxCode(clone_tag, temGxMap);
+	}
+	//if (!isXq) {
+	map<string, tag_t> tmpProcessMap;
+	//vector<string> timeVec;
+	//����ģ��
+	map<string, TimeBean > beanMap;
+	//�������ݿ������޸Ĺ�ʱ
+	getGxbmMap(revision_tag, tmpProcessMap, beanMap);
+	map<string, tag_t> newProcessMap;
+	char selectGyId[200];
+	if (isXq) {
+		sprintf(selectGyId, sqlGxTime2.c_str(), productZu.c_str(), process_item_id, xqfs.c_str());
+	}
+	else {
+		sprintf(selectGyId, sqlGxTime.c_str(), productZu.c_str(), process_item_id);
+	}
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	string gyId;
+	printf("search3 ===> %s\n", selectGyId);
+	QuerySQLNoInputParam(selectGyId, &outputColumn1, &outputValueCount1, &outputValue1);
+	//��ѯ���
+	for (int num = 0; num < outputValueCount1; num++) {
+		string gxbm = outputValue1[num][0];
+		string rgsj = outputValue1[num][1];
+		if (rgsj.rfind(".", 0) == 0) {
+			string a = "0";
+			rgsj = a.append(rgsj);
+			printf("rgsj === >%s\n", rgsj.c_str());
+		}
+		string jqsj = outputValue1[num][2];
+		if (jqsj.rfind(".", 0) == 0) {
+			string a = "0";
+			jqsj = a.append(jqsj);
+		}
+		string zbsj = outputValue1[num][3];
+		if (zbsj.rfind(".", 0) == 0) {
+			string a = "0";
+			zbsj = a.append(zbsj);
+			printf("zbsj === >%s\n", zbsj.c_str());
+		}
+		string zrsczq = outputValue1[num][4];
+		if (zrsczq.rfind(".", 0) == 0) {
+			string a = "0";
+			zrsczq = a.append(zrsczq);
+			printf("zrsczq === >%s\n", zrsczq.c_str());
+		}
+		TimeBean bean;
+		bean.rgsj = rgsj;
+		bean.jqsj = jqsj;
+		bean.zbsj = zbsj;
+		bean.zrsczq = zrsczq;
+		beanMap[gxbm] = bean;
+	}
+	//��¡�����Ĺ���·��
+	regex qq_reg22("^1ZDB5.*\\d{2,}000X.*"); //\\d{5,}$
+	smatch result;
+	bool ret = regex_match(th, result, qq_reg22);
+	string searchTh = th;
+	if (ret) {
+		searchTh = "1ZDB5**000X";
+	}
+	string sqlFl = "select \"materialno\",\"EJBM\",\"quantity\",\"xuhao\" from CHINT_GYFL_001 where \"ProductZu\" = '%s' and \"TuHao\" ='%s' and \"quantity\" !='/' ORDER BY CAST(\"xuhao\" AS DECIMAL) asc";
+	char selectFlId[600];
+	sprintf(selectFlId, sqlFl.c_str(), productZu.c_str(), searchTh);
+	printf("selectFlId==>%s\n", selectFlId);
+	map<string, vector<FlBean>> flBeanMap;
+	{
+		int outputColumn3 = 0, outputValueCount3 = 0;
+		char*** outputValue3 = NULL;
+		QuerySQLNoInputParam(selectFlId, &outputColumn3, &outputValueCount3, &outputValue3);
+		for (int j = 0; j < outputValueCount3; j++) {
+			string materialno = outputValue3[j][0];
+			string ejbm = outputValue3[j][1];
+			string quantity = outputValue3[j][2];
+			tag_t fltag,flRev;
+			ITEM_find_item(materialno.c_str(),&fltag);
+			ITEM_ask_latest_rev(fltag,&flRev);
+			printf("materialno%s ejbm==%sEnd\n", materialno.c_str(), ejbm.c_str());
+			FlBean bean;
+			bean.blQty = quantity;
+			bean.flTag = flRev;
+			if (flBeanMap.count(ejbm) > 0) {
+				flBeanMap[ejbm].push_back(bean);
+			}
+			else {
+				vector<FlBean> beansVec;
+				beansVec.push_back(bean);
+				flBeanMap[ejbm] = beansVec;
+			}
+		}
+	}
+
+	getGxbmMap(clone_tag, newProcessMap, beanMap, flBeanMap,th, lastId);
+	map<string, tag_t>::iterator it;
+	//���ơ��������򡱡���������ҵָ���顱
+	for (it = tmpProcessMap.begin(); it != tmpProcessMap.end(); it++) {
+		string gxbm = it->first;
+		tag_t tmpGx = it->second;
+		if (newProcessMap.count(gxbm) != 0) {
+			tag_t* procGuidBooks, *processRules;
+			int cnt2 = 0, cnt3 = 0;
+			tag_t newGx = newProcessMap[gxbm];
+			ITKCALL(AOM_ask_value_tags(tmpGx, "ZT2_ProcGuidBookRelation", &cnt2, &procGuidBooks));
+			ITKCALL(AOM_ask_value_tags(tmpGx, "ZT2_ProcessRuleRelation", &cnt3, &processRules));
+			AOM_lock(newGx);
+			if (cnt2 > 0) {
+				ITKCALL(AOM_set_value_tags(newGx, "ZT2_ProcGuidBookRelation", cnt2, procGuidBooks));
+			}
+			if (cnt3 > 0) {
+				ITKCALL(AOM_set_value_tags(newGx, "ZT2_ProcessRuleRelation", cnt3, processRules));
+			}
+			AOM_save(newGx);
+			AOM_unlock(newGx);
+		}
+	}
+	//}
+	return clone_tag;
+}
+//ʵ������BOM����
+boolean isXn(tag_t matnr) {
+	int cnt2, numFac, cnt3;
+	boolean flag = false;
+	char** procureType, ** factorys, ** specialProcureType;
+	AOM_ask_value_strings(matnr, "zt2_SZSpecialProcuretype", &cnt3, &specialProcureType); //Ϊ/
+	AOM_ask_value_strings(matnr, "zt2_SZProcuretype", &cnt2, &procureType); //��������
+	AOM_ask_value_strings(matnr, "zt2_SZFactory", &numFac, &factorys);
+	for (int i = 0; i < numFac; i++) {
+		if (strcmp(factorys[i], "M060") == 0 && cnt2 > i && cnt3 > i) {
+			if (strstr(procureType[i], "����") != NULL && strcmp(specialProcureType[i], "/") == 0) {
+				flag = true;
+			}
+		}
+	}
+	return flag;
+}
+//��ȡ�������� �ж��Ƿ�����
+string getClassVal(tag_t top_rev_tag, string& errMessage, ByqBean &bean) {
+	//, string className
+	tag_t top_classificationObject, item;
+	ITKCALL(ITEM_ask_item_of_rev(top_rev_tag, &item));
+	ICS_ask_classification_object(item, &top_classificationObject);
+	if (top_classificationObject == NULL_TAG)
+	{
+		errMessage.append("�������û�з��͵�����\n");
+		return  "";
+	}
+	char* top_class_id = NULL, *top_class_name = NULL;
+	//ICS_ask_class_of_classification_obj(top_classificationObject, &top_class_tag);
+	//ICS_ask_id_name(top_class_tag, &top_class_id, &top_class_name);
+	printf("BOM TOP LINE CLASS ID = %s | NAME = %s \n", top_class_id, top_class_name);
+	int n_attrs;
+	char** attr_names;
+	char** attr_vals;
+	ITKCALL(ICS_ask_attributes_of_classification_obj(top_classificationObject, &n_attrs, &attr_names, &attr_vals));
+	cout << n_attrs << endl;
+	//	int num = 1;
+	string cpxh;
+	for (int ii = 0; ii < n_attrs; ii++)
+	{
+		if (strcmp(attr_names[ii], "��Ʒ�ͺ�") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				errMessage.append("�������Բ�Ʒ�ͺ�Ϊ�գ����顣\n");
+				return "";
+			}
+			else {
+				cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("�������Ե�ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.dyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("����������ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.zyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("�������Ը�ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.gyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("�������Ե�ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.tyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+			//	errMessage.append("����������ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.wyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		//��������
+		cout << attr_names[ii] << "\t"
+			<< attr_vals[ii] << endl;
+	}
+	return cpxh;
+}
+//������Ȧ
+
+//��������Ȧ
+void Split2(string strArg, string spliter, vector<string>& ans)
+{
+	ans.clear();
+	size_t index0 = 0;
+	string one_arg;
+	if (strArg.find_first_not_of(' ') == string::npos)
+		strArg = "";
+	while (strArg.size() > 0)
+	{
+		index0 = strArg.find_first_of(spliter);
+		if (index0 != string::npos)
+		{
+			one_arg = strArg.substr(0, index0);
+			strArg = strArg.substr(index0 + 1);
+			ans.push_back(one_arg);
+		}
+		else
+		{
+			ans.push_back(strArg);
+			break;
+		}
+	}
+}
+tag_t getTmpProcess(string cpxh, string th, string& errBuff, string& oldGyId, boolean isXq, string xqfs,string lastId) {
+	char selectCPZ[300], selectGyId[200];
+	sprintf(selectCPZ, sqlCpxh.c_str(), cpxh.c_str());
+	int outputColumn = 0, outputValueCount = 0;
+	char*** outputValue = NULL;
+	string productZu;
+	printf("search1 %s \n", selectCPZ);
+	QuerySQLNoInputParam(selectCPZ, &outputColumn, &outputValueCount, &outputValue);
+	printf("search11\n");
+	if (outputValueCount == 0) {
+		string buffMsg = "";
+		buffMsg.append("��ǰ��ѹ����Ʒ�ͺ�:").append(cpxh).append(",�����ݿ�����޶�Ӧ���Ͳ�Ʒ��ֵ������ϵ����Աά��.\n");
+		size_t found = errBuff.find(buffMsg);
+		if (found == std::string::npos) {
+			errBuff.append(buffMsg);
+		}
+		//errBuff.append("��ǰ��ѹ����Ʒ�ͺ�:").append(cpxh).append(",�����ݿ�����޶�Ӧ���Ͳ�Ʒ��ֵ������ϵ����Աά��.\n");
+		return NULLTAG;
+	}
+	for (int j = 0; j < outputValueCount; j++) {
+		productZu = outputValue[j][0];
+		printf("productZu===>%s\n", productZu.c_str());
+	}
+
+	sprintf(selectGyId, sqlGyRule.c_str(), productZu.c_str(), th.c_str());
+
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	string gyId;
+	printf("search2 %s \n", selectGyId);
+	QuerySQLNoInputParam(selectGyId, &outputColumn1, &outputValueCount1, &outputValue1);
+	if (outputValueCount1 == 0) {
+		errBuff.append("ͼ��:").append(th).append("�޶�Ӧ����ģ��ID,��ά������ָ�ɹ���·��.\n");
+		return NULLTAG;
+	}
+	printf("search22\n");
+	for (int j = 0; j < outputValueCount1; j++) {
+		gyId = outputValue1[j][0];
+		printf("gyId===>%s\n", gyId.c_str());
+	}
+	oldGyId = gyId;
+	//�����߼�У��ʱ������߷�ʽ
+	{
+		char selectGyId[200];
+		if (isXq) {
+			sprintf(selectGyId, sqlProTime2.c_str(), productZu.c_str(), (char*)gyId.c_str(), xqfs.c_str());
+		}
+		else {
+			sprintf(selectGyId, sqlProTime.c_str(), productZu.c_str(), (char*)gyId.c_str());
+		}
+		int outputColumn2 = 0, outputValueCount2 = 0;
+		char*** outputValue2 = NULL;
+		string gyId;
+		printf("search3 ===> %s\n", selectGyId);
+		boolean hasErr = false;
+		QuerySQLNoInputParam(selectGyId, &outputColumn2, &outputValueCount2, &outputValue2);
+		for (int t = 0; t < outputValueCount2; t++) {
+			string gyName = outputValue2[t][0];
+			string gxName = outputValue2[t][1];
+			errBuff.append("һ����������:").append(gyName).append(" ��Ӧ�Ķ�������:").append(gxName).append("����Ȼ�����������ݲ���ȷ���뼰ʱά��.\n");
+		}
+		if (outputValue2>0) {
+			hasErr = true;
+		}
+		if (isXq) {
+			char selectRxfs[200];
+			sprintf(selectRxfs, sqlRxfs.c_str(), xqfs.c_str());
+			int outputColumn3 = 0, outputValueCount3 = 0;
+			char*** outputValue3 = NULL;
+			printf("search3 ===> %s\n", selectRxfs);
+			QuerySQLNoInputParam(selectRxfs, &outputColumn3, &outputValueCount3, &outputValue3);
+			printf("search result ===> %d\n", outputValueCount3);
+			if (outputValueCount3 == 0) {
+				errBuff.append("���߷�ʽ:").append(xqfs).append(" δ��CHINT_WORKHOUR_WhGXName��������,�뼰ʱά��");
+				hasErr = true;
+			}
+		}
+		if (hasErr) {
+			return NULLTAG;
+		}
+	}
+	tag_t clone_tag = clone_process_from_template((char*)gyId.c_str(), isXq, productZu, xqfs, th, lastId);
+	printf("��¡���===>\n");
+	return clone_tag;
+}
+boolean isTcmOnNot(tag_t process) {
+	int structs = 0;
+	boolean flag = false;
+	tag_t *structure_revisions;
+	AOM_ask_value_tags(process, "structure_revisions", &structs, &structure_revisions);
+	if (structs > 0) {
+		int statusNum = 0;
+		char *revUid;
+		tag_t *release_status_list;
+		tag_t struct_revision = structure_revisions[0];
+		AOM_ask_value_tags(struct_revision, "release_status_list", &statusNum, &release_status_list);
+		if (statusNum > 0) {
+			flag = true;
+		}
+	}
+	return flag;
+}
+void readProcessBom(tag_t bom_line, string& errorBuff,boolean &flag,tag_t &topProcess,string &notTcmBuff) {
+
+	int c_line_count;
+	tag_t mantr, *c_line_tags;
+	ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	char *objName;
+	AOM_ask_value_string(mantr, "object_name", &objName);
+	if (c_line_count > 0 && (isXn(mantr)|| strstr(objName, "��ѹ��") != NULL)) {
+		printf("ʵ��\n");
+		flag = true;
+		//����Ƿ��й���·��
+		int n_references = 0;
+		int* levels = 0;
+		tag_t* references_tag = NULLTAG;
+		char** relation_type_name = NULL;
+		//ͨ�����ù�ϵ���ҵ������
+		ITKCALL(WSOM_where_referenced(mantr, 1, &n_references, &levels, &references_tag, &relation_type_name));
+		boolean hasProcess = false;
+		for (int i = 0; i < n_references; i++)
+		{
+			char* refType;
+			tag_t refTag = references_tag[i];
+			AOM_ask_value_string(refTag, "object_type", &refType);
+			if (strcmp(refType, "MEProcessRevision") == 0) {
+				hasProcess = true;
+				break;
+			}
+		}
+		if (!hasProcess) {
+			char* bl_desc,*itemID;
+			AOM_ask_value_string(mantr, "item_id", &itemID);
+			{
+				if (strstr(objName, "��ѹ��") != NULL) {
+					tag_t *byqRev;
+					string tmpGyId;
+					char *uid;
+					int cnt3 = 0;
+					AOM_ask_value_tags(mantr, "TC_Is_Represented_By", &cnt3, &byqRev);
+					ByqBean bean;
+					ITK__convert_tag_to_uid(byqRev[0], &uid);
+					printf("objName%s %s\n", objName, uid);
+					string cpxh = getClassVal(byqRev[0], errorBuff, bean);
+					char* thId;
+					AOM_ask_value_string(byqRev[0],"item_id",& thId);
+					printf("cpxh===>%s\n", cpxh.c_str());
+					tag_t processTag = NULLTAG;
+					if (strstr(objName, "��Ȧ") == NULL) {
+						vector<string> idVec;
+						Split2(thId, "-", idVec);
+						processTag = getTmpProcess(cpxh, "1ZDB300000P", errorBuff, tmpGyId, false, "", idVec[1]);
+						topProcess = processTag;
+						if (processTag != NULLTAG) {
+							save_representation2(processTag, mantr, "IMAN_METarget");
+						}
+					}
+				}
+				else {
+					AOM_ask_value_string(bom_line, "bl_rev_object_desc", &bl_desc);
+					vector<string> descVec1;
+					Split2(bl_desc, " ", descVec1);
+					if (descVec1.size() > 1) {
+						string drawNos = descVec1[1];
+						vector<string> drawNoVec1;
+						Split2(drawNos, "-", drawNoVec1);
+						if (drawNoVec1.size() > 1) {
+							string wordNo = drawNoVec1[1]; //���̺� ƴ��1ZDB300000P ���ҷ�������
+							string drawNo = drawNoVec1[0]; //ͼ��
+							if (drawNoVec1.size() == 3) {
+								drawNo = drawNoVec1[0].append("-").append(drawNoVec1[1]);
+								wordNo = drawNoVec1[2];
+							}
+							string byqId = "1ZDB300000P-", tmpGyId;
+							tag_t byqTag, byqRev;
+							byqId.append(wordNo);
+							ITKCALL(ITEM_find_item(byqId.c_str(), &byqTag));
+							ITKCALL(ITEM_ask_latest_rev(byqTag, &byqRev));
+							ByqBean bean;
+							string cpxh = getClassVal(byqRev, errorBuff, bean);
+							printf("cpxh===>%s\n", cpxh.c_str());
+							tag_t processTag = NULLTAG;
+							if (strstr(objName, "��Ȧ") == NULL) {
+								processTag = getTmpProcess(cpxh, drawNo, errorBuff, tmpGyId, false, "", wordNo);
+								if (processTag != NULLTAG) {
+									save_representation2(processTag, mantr, "IMAN_METarget");
+								}
+							}
+							else {
+								string xqfs;
+								if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+									//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+									if (bean.dyxq.empty()) {
+										errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+										return;
+									}
+									xqfs = bean.dyxq;
+								}
+								else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+									//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+									if (bean.zyxq.empty()) {
+										errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+										return;
+									}
+									xqfs = bean.zyxq;
+								}
+								else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+									//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+									if (bean.gyxq.empty()) {
+										errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+										return;
+									}
+									xqfs = bean.gyxq;
+								}
+								else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+									//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+									if (bean.tyxq.empty()) {
+										errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+										return;
+									}
+									xqfs = bean.tyxq;
+								}
+								else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+									//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+									if (bean.wyxq.empty()) {
+										errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+										return;
+									}
+									xqfs = bean.wyxq;
+								}
+								processTag = getTmpProcess(cpxh, drawNo, errorBuff, tmpGyId, true, xqfs, wordNo);
+								if (processTag != NULLTAG) {
+									save_representation2(processTag, mantr, "IMAN_METarget");
+								}
+							}
+						}
+					}
+				}
+			}
+		}
+	}
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t c_line_tag = c_line_tags[i];
+		readProcessBom(c_line_tag, errorBuff,flag, topProcess, notTcmBuff);
+	}
+}
+
+tag_t getProcess(tag_t designRev) {
+	int n_references = 0;
+	int* levels = 0;
+	tag_t process = NULLTAG;
+	tag_t* references_tag = NULLTAG;
+	char** relation_type_name = NULL;
+	//ͨ�����ù�ϵ���ҵ������
+	ITKCALL(WSOM_where_referenced(designRev, 1, &n_references, &levels, &references_tag, &relation_type_name));
+	boolean hasProcess = false;
+	for (int i = 0; i < n_references; i++)
+	{
+		char* refType;
+		tag_t refTag = references_tag[i];
+		AOM_ask_value_string(refTag, "object_type", &refType);
+		if (strcmp(refType, "MEProcessRevision") == 0) {
+			hasProcess = true;
+			process = refTag;
+			break;
+		}
+	}
+	return process;
+}
+int CloneTempProcess(void *returnValue)
+{
+	int ifail = ITK_ok;
+	char* sql = NULL, *revUid;
+	tag_t designRev;
+	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+	ITK__convert_uid_to_tag(revUid, &designRev);
+	int bvr_count = 0, c_line_count;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(designRev, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	string errorBuff;
+	string notTcmBuff;
+	char *bl_desc;
+	AOM_ask_value_string(bom_line, "bl_rev_object_desc", &bl_desc);
+
+	int n_references = 0;
+	int* levels = 0;
+	tag_t* references_tag = NULLTAG;
+	char** relation_type_name = NULL;
+	//ͨ�����ù�ϵ���ҵ������
+	ITKCALL(WSOM_where_referenced(designRev, 1, &n_references, &levels, &references_tag, &relation_type_name));
+	boolean hasProcess = false;
+	tag_t processTagTop = NULLTAG;
+	for (int i = 0; i < n_references; i++)
+	{
+		char* refType;
+		tag_t refTag = references_tag[i];
+		AOM_ask_value_string(refTag, "object_type", &refType);
+		if (strcmp(refType, "MEProcessRevision") == 0) {
+			hasProcess = true;
+			processTagTop = refTag;
+			break;
+		}
+	}
+	tag_t meProcess = NULLTAG;
+	char *objName,*topId;
+	AOM_ask_value_string(designRev, "object_name", &objName);
+	AOM_ask_value_string(designRev, "item_id", &topId);
+	map<string, tag_t> mapByq;
+	//����Dz���Ʒ�Ļ�, �ж��Ƿ���ڶ��P����
+	if (strstr(objName, "��ѹ��") != NULL) {
+		tag_t *topMatnrs,*pMaterials;
+		int num = 0, num2=0;
+		AOM_ask_value_tags(designRev, "TC_Is_Represented_By", &num, &topMatnrs);
+		printf("num===>%d\n", num);
+		if (num >= 1) {
+			tag_t tzRev = topMatnrs[0];
+			AOM_ask_value_tags(tzRev, "representation_for", &num2, &pMaterials);
+			for (int x = 0; x < num2; x++) {
+				char *pId,*zt2_ifpbom;
+				tag_t pMatr = pMaterials[x];
+				AOM_ask_value_string(pMatr, "item_id", &pId);
+				AOM_ask_value_string(pMatr, "zt2_ifpbom", &zt2_ifpbom);
+				if (strcmp(pId, topId) != 0 && strcmp(zt2_ifpbom,"P")==0) {
+					tag_t process = getProcess(pMatr);
+					if (process != NULLTAG) {
+						meProcess = process;
+					}
+					else {
+						mapByq[pId] = pMatr;
+					}
+				}
+			}
+		}
+		if (meProcess != NULLTAG) {
+			if (!hasProcess) {
+				save_representation2(meProcess, designRev, "IMAN_METarget");
+			}
+			map<string, tag_t>::iterator it;
+			//����ģ��ƥ��
+			for (it = mapByq.begin(); it != mapByq.end(); it++) {
+				string s = it->first;
+				tag_t matnrPrev = mapByq[s];
+				save_representation2(meProcess, matnrPrev, "IMAN_METarget");
+			}
+			printf("=======\n");
+			errorBuff = "��ǰѡ�е������Ѿ����ڹ���·��.\n";
+		}
+		else if (processTagTop != NULLTAG) {
+			map<string, tag_t>::iterator it;
+			printf("=======22\n");
+			//����ģ��ƥ��
+			for (it = mapByq.begin(); it != mapByq.end(); it++) {
+				string s = it->first;
+				tag_t matnrPrev = mapByq[s];
+				save_representation2(processTagTop, matnrPrev, "IMAN_METarget");
+			}
+			errorBuff = "��ǰѡ�е������Ѿ����ڹ���·��.\n";
+		}
+	}
+	printf("mapByq===>%d\n", mapByq.size());
+	if (hasProcess) {
+		errorBuff = "��ǰѡ�е������Ѿ����ڹ���·��.\n";
+	}else if ((strcmp(bl_desc, "") == 0 || strstr(bl_desc,"-")==NULL)&& strstr(objName, "��ѹ��") == NULL) {
+		errorBuff = "��ǰѡ�е����ϰ汾û��ͼ����Ϣ������.\n";
+	}
+	else {
+		POM_AM__set_application_bypass(true);
+		int url_num = 0;
+		char** url_vals = NULL;
+		PREF_ask_char_values("database_tc", &url_num, &url_vals);
+		string url = url_vals[0];
+		url.append("/").append(url_vals[2]);
+
+		//map<string,
+		printf("url ==> %s \n", url.c_str());
+		if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+		{
+			printf("��ʾ:�м����ݱ�����ʧ��\n");
+			ifail = 1;
+		}
+		tag_t topProcess = NULLTAG;
+		boolean flag = false;
+		printf("errorBuff==>%s\n", errorBuff.c_str());
+		readProcessBom(bom_line, errorBuff, flag, topProcess, notTcmBuff);
+		if (topProcess != NULLTAG) {
+			map<string, tag_t>::iterator it;
+			for (it = mapByq.begin(); it != mapByq.end(); it++) {
+				string s = it->first;
+				tag_t matnrPrev = mapByq[s];
+				save_representation2(topProcess, matnrPrev, "IMAN_METarget");
+			}
+		}
+		DisConnServer();
+		if (!flag) {
+			errorBuff = "��ǰѡ�е�PBOMû��ʵ��������������·��.";
+		}
+		POM_AM__set_application_bypass(false);
+	}
+	errorBuff.append(notTcmBuff);
+	if (errorBuff.empty()) {
+		errorBuff = "succ";
+	}
+	printf("errorBuff==>%s\n", errorBuff.c_str());
+	BOM_close_window(ebom_window);
+	*((char**)returnValue) = (char*)MEM_alloc((strlen(errorBuff.c_str()) + 1) * sizeof(char));
+	tc_strcpy(*((char**)returnValue), errorBuff.c_str());
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/DtoEBOM2.cpp b/General/General/DtoEBOM2.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/General/General/EbomToPMethod.cpp b/General/General/EbomToPMethod.cpp
new file mode 100644
index 0000000..cb302b0
--- /dev/null
+++ b/General/General/EbomToPMethod.cpp
@@ -0,0 +1,1804 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+#include <property/nr.h>
+#include "CRUL_server_call_httpserver.h"
+//�����ж��Ƿ�Ϊ ��Ȧ "1ZDB581000X-00055"; ��Ȧ����P����
+regex qq_reg("^1ZDB5.*\\d{1,}1000X.*"); //\\d{5,}$
+struct newCBean
+{
+	int num;
+	tag_t cLine;
+};
+struct EBomBean
+{
+	boolean istop = false;
+	vector<tag_t> topCcp;
+	tag_t eRev; //ԭ����e����
+	tag_t eBomline; //Ebom��
+	vector <tag_t> pRev; //�����P����
+	tag_t pBomline = NULL; //PBOM
+	tag_t designRev; //E���ϵ�ͼֽ
+	vector<EBomBean> parentBean; //����EBOMʱ��ĸ���
+	vector<newCBean> c_lines; //EBOM�е��Ӽ� ֻ����Ȧ��
+};
+
+/*
+primaryTag�汾
+secondTag���ݼ�
+relationType��ϵ
+*/
+string getRemarkMsg(string remark,int len);
+string Sql2 = "select t.PrhName,t.PrdLine,t.PrdNo,t.PrdFeatureCode,t.FeatureName,t.PrdCanInput,t.PrdSign from CcemVW_Prd t where t.prhcode = '%s' order by t.PrdNo";
+string Sql1 = "select t.PmpcPrhCode, t.PmpcPType,t.PmpcMType from CcemVW_Pmpc t where t.PmpcCode='%s'";
+string m_code1 = "230101001";
+string m_code2 = "220103001";
+
+struct PRD
+{
+	string prdFeatureCode;
+	string featureName;
+};
+struct PMPC
+{
+	string m_code;
+	string pmpcPrhCode;
+	string pmpcPType;
+	string pmpcMType;
+};
+PMPC pmpc;
+vector<PRD> prds;
+void save_representation2222(tag_t primaryTag, tag_t secondTag, char* relationType)
+{
+
+	//POM_AM__set_application_bypass(true);
+	tag_t typeTag = NULLTAG;
+	ITKCALL(GRM_find_relation_type(relationType, &typeTag));
+
+	ITKCALL(AOM_refresh(primaryTag, TRUE));
+	ITKCALL(AOM_refresh(secondTag, TRUE));
+	tag_t relationTag = NULLTAG;
+	ITKCALL(GRM_create_relation(primaryTag, secondTag, typeTag, NULLTAG, &relationTag));//�����ϵ�Ѿ����ڣ���ô�������Ӷ���
+
+	ITKCALL(GRM_save_relation(relationTag));//�ܱ�Ҫ
+	ITKCALL(AOM_save(primaryTag));
+	ITKCALL(AOM_save(secondTag));
+	ITKCALL(AOM_refresh(primaryTag, FALSE));
+	ITKCALL(AOM_refresh(secondTag, FALSE));
+	//POM_AM__set_application_bypass(false);
+
+}
+void replaceBom(tag_t newTopLine, tag_t newChild) {
+	int c_line_count, cnt2, numFac;
+	tag_t* c_line_tags;
+	char* uid1;
+	ITK__convert_tag_to_uid(newChild, &uid1);
+	ITKCALL(BOM_line_ask_all_child_lines(newTopLine, &c_line_count, &c_line_tags));
+	for (int t = 0; t < c_line_count; t++) {
+		tag_t c_line_tag = c_line_tags[t], eRev;
+		ITKCALL(AOM_ask_value_tag(c_line_tag, "bl_line_object", &eRev));
+		char* uid2;
+		ITK__convert_tag_to_uid(eRev, &uid2);
+		if (strcmp(uid2, uid1) == 0) {
+			BOM_line_replace(c_line_tag, NULLTAG, newChild, NULLTAG);
+		}
+	}
+
+}
+string sql_query = "select FeatureList from CcemVW_GoodsFeature where GoodsCode ='%s' ";
+void saveAsCycle(EBomBean& childPm, map<string, tag_t>& map, tag_t& topPrev) {
+	tag_t tcType, newItem, newRev;
+	char* newId;
+	if (childPm.parentBean.size() > 0) {
+		saveAsCycle(childPm.parentBean[0], map, topPrev);
+	}
+	printf("1===>%d\n", childPm.pRev.size());
+	char* eRevUid, *zt2_ifpbom;
+	AOM_ask_value_string(childPm.eRev, "zt2_ifpbom", &zt2_ifpbom);
+	if (strcmp(zt2_ifpbom, "P") == 0) {
+		if (childPm.pRev.size() == 0) {
+			childPm.pRev.push_back(childPm.eRev);
+		}
+		return;
+	}
+	ITK__convert_tag_to_uid(childPm.eRev, &eRevUid);
+	if (childPm.pRev.size() == 0) {
+		if (map.count(eRevUid) > 0) {
+			childPm.pRev.push_back(map[eRevUid]);
+		}
+		else {
+			char* newid = NULL;
+			logical isModified = FALSE;
+			tag_t item_type_tag;
+			TCTYPE_ask_type("Item", &item_type_tag);
+			ITKCALL(USER_new_item_id(NULLTAG, item_type_tag, &isModified, &newid));
+			/*ITKCALL(NR_next_value("MEProcess", "item_id", NULLTAG, "", "", "",
+				NULLTAG, "", "", &next_id));*/
+			printf("next_id==>%s\n", newid);
+			ITKCALL(ITEM_copy_item(childPm.eRev, newid, NULL, &newItem, &newRev));
+			//ITKCALL(AOM_set_value_string(newRev, "zt2_PMaterial", "PBOM"));
+			char* matnrNo;
+			AOM_ask_value_string(childPm.eRev, "zt2_MaterialNo", &matnrNo);
+			AOM_lock(newRev);
+
+			AOM_set_value_string(newRev, "zt2_ifpbom", "P");
+			AOM_set_value_string(newRev, "zt2_MaterialNo", matnrNo);
+			AOM_save(newRev);
+			AOM_unlock(newRev);
+			if (topPrev == NULLTAG) {
+				topPrev = newRev;
+			}
+			childPm.pRev.push_back(newRev);
+			map[eRevUid] = newRev;
+			int num = 0, revNum = 0, tagNum = 0;
+			tag_t* mantrs, dsuser, *structure_revisions, *bom_view_tags;
+			AOM_ask_value_tags(childPm.eRev, "TC_Is_Represented_By", &num, &mantrs);
+			if (num > 0) {
+				AOM_ask_value_tags(newRev, "structure_revisions", &revNum, &structure_revisions);
+				AOM_ask_value_tags(newRev, "bom_view_tags", &tagNum, &bom_view_tags);
+				AOM_ask_value_tag(mantrs[0], "owning_user", &dsuser);
+				tag_t defGroup;
+				ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+				ITKCALL(AOM_set_ownership(newItem, dsuser, defGroup));
+				ITKCALL(AOM_set_ownership(newRev, dsuser, defGroup));
+				if (revNum > 0) {
+					ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+				}
+				if (tagNum > 0) {
+					ITKCALL(AOM_set_ownership(bom_view_tags[0], dsuser, defGroup));
+				}
+			}
+		}
+	}
+	if (childPm.parentBean.size() > 0) {
+		EBomBean parentBean = childPm.parentBean[0];
+		vector <tag_t> pRevs = parentBean.pRev;
+		if (pRevs.size() > 0) {
+			int bvr_count = 0, c_line_count;
+			tag_t ebom_window = NULLTAG;
+			tag_t bom_line = NULLTAG, *c_line_tags;
+			(BOM_create_window(&ebom_window));
+			tag_t* bvr_list = NULL;
+			(ITEM_rev_list_bom_view_revs(pRevs[0], &bvr_count, &bvr_list));
+			printf("bvr_count=%d\n", bvr_count);
+
+			(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+			//ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+			ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+
+			for (int ind = 0; ind < c_line_count; ind++) {
+				tag_t c_line_tag = c_line_tags[ind], mantr;
+				AOM_ask_value_tag(c_line_tag, "bl_line_object", &mantr);
+				char* eRevUid2;
+				ITK__convert_tag_to_uid(mantr, &eRevUid2);
+				if (strcmp(eRevUid2, eRevUid) == 0) {
+					if (childPm.pRev.size() > 0) {
+						printf("eRevUid===>%s\n", eRevUid);
+						ITKCALL(BOM_line_replace(c_line_tag, NULLTAG, childPm.pRev[0], NULLTAG));
+					}
+				}
+			}
+			BOM_save_window(ebom_window);
+			BOM_close_window(ebom_window);
+		}
+	}
+}
+void getSpecs(tag_t rev, vector<string> &vec) {
+	tag_t* comps;
+	int cnt;
+	/*AOM_ask_value_string(line, "ZT2_TYSpecifications", &ZT2_TYSpecifications);
+	if (strcmp(ZT2_TYSpecifications, "") == 0) {*/
+	AOM_ask_value_tags(rev, "representation_for", &cnt, &comps);
+	char* zt2_Specifications;
+	//if (cnt == 0) {
+	AOM_ask_value_string(rev, "zt2_Specifications", &zt2_Specifications);
+	vec.push_back(zt2_Specifications);
+	//	//}
+	//}
+}
+string insertSql = "insert into chint_material(\"Code\",\"PUID\",\"PmpcCode\",\"GoodsCode\",\"GoodsName\",\"UnitCode\",\"CompanyCode\",\"BpNo\",\"Spec\",\"TeRe\",\"State\",\"User\",\"Time\",\"Condition\",\"Info\") values('%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s','%s',to_date('%s','yyyy-mm-dd HH24:mi:ss'),'%s','%s')";
+//�������������Ȧ�����������ϱ���
+tag_t send1(tag_t rev, string now,
+	char* user_id, vector<string>& jsons, string groupId, string spec, char* nameNum, char* idss, tag_t dcproxy) {
+	//map<tag_t, vector<string>>::iterator it;
+	//for (it = general_maps.begin(); it != general_maps.end(); it++) {
+	char* item_id, *object_name, *zt2_DrawingNo1, *zt2_MaterialMark, *zt2_ProductModel
+		, *object_desc, *zt2_SurfaceTreatment, *zt2_Source;
+	AOM_ask_value_string(rev, "item_id", &item_id); //groupId
+	AOM_ask_value_string(rev, "object_name", &object_name);
+	AOM_ask_value_string(rev, "zt2_DrawingNo", &zt2_DrawingNo1);
+	AOM_ask_value_string(rev, "zt2_MaterialMark", &zt2_MaterialMark);
+	AOM_ask_value_string(rev, "zt2_ProductModel", &zt2_ProductModel);
+	AOM_ask_value_string(rev, "object_desc", &object_desc);
+	AOM_ask_value_string(rev, "zt2_SurfaceTreatment", &zt2_SurfaceTreatment);
+	AOM_UIF_ask_value(rev, "zt2_Source", &zt2_Source);
+	PMPC m_pmpc;
+	vector<PRD> m_prds;
+	//if (strcmp(item_id, "1ZDB") == 0) {
+	m_prds = prds;
+	m_pmpc = pmpc;
+	printf("m_pmpc\n");
+	//}
+	string pmpcCode = m_pmpc.m_code;
+	string prhCode = m_pmpc.pmpcPrhCode;
+	string pmpcType = m_pmpc.pmpcMType;
+	printf("pmpcType===>%s\n", pmpcType.c_str());
+	if (pmpcType.length() == 0) {
+		return NULLTAG;
+	}
+	string goodsCode = ""; // ����ʱΪ��
+	string prefixName = nameNum;
+	string goodsName = prefixName.append(object_name);//rev.getProperty("object_name");
+	string unitCode = "ST"; // Ĭ�ϼ�����ʵֵST
+	string companyCode = groupId;
+	string mp = "M";
+	if (strcmp(zt2_Source, "�⹺") == 0) {
+		mp = "P";
+		pmpcType = m_pmpc.pmpcPType;
+	}
+	string bpNo = item_id;//rev.getProperty("item_id"); // �DZ���
+	string zt2_DrawingNo = zt2_DrawingNo1;//rev.getProperty("zt2_DrawingNo");
+	if (!zt2_DrawingNo.empty()) {
+		if (strcmp(item_id, zt2_DrawingNo1) != 0)
+			bpNo = zt2_DrawingNo1;
+	}
+	vector<string> vec2;
+	if (strstr(item_id, "-") != NULL) {
+		Split(item_id, "-", vec2);
+		string msg = vec2[0].append("-").append(idss).append("-").append(vec2[1]);
+		string queryMsg;
+		queryMsg.append("*").append(msg).append("*");
+		tag_t query = NULLTAG, *tags;
+		map<string, tag_t> map_revs;
+		//fields.put("����", "*" + item_id + "*" + zt2_TYJNo + "*");
+		ITKCALL(QRY_find2("chint_query_material_test", &query));
+		char* qry_entries[1] = { "����" }, *qry_values[1] = { (char *)queryMsg.c_str() };
+		int n_found;
+		ITKCALL(QRY_execute(query, 1, qry_entries, qry_values, &n_found, &tags));
+		printf("n_found===>%d %s \n", n_found, queryMsg.c_str());
+		if (n_found > 0) {
+			return tags[0];
+		}
+	}
+	if (strstr(bpNo.c_str(), "-") != NULL) {
+		Split(bpNo, "-", vec2);
+		bpNo = vec2[0].append("-").append(idss).append("-").append(vec2[1]);
+	}
+	string materialMark = zt2_MaterialMark;//rev.getProperty("zt2_MaterialMark"); // �DZ���
+
+	if (materialMark.compare("--") == 0) {
+		materialMark = "";
+	}
+	// ��Ʒ�ͺ� //������Ʒ
+	string productModel = zt2_ProductModel;//rev.getProperty("zt2_ProductModel");
+	string teRe = "";
+	string state = ""; // ����ʱΪ��
+	string wbs = "";
+	string product = "";
+	string user = user_id;
+	string time = now;
+	string condition = "�����";// Ĭ�������
+	string desc = object_desc;// properties[5];//rev.getProperty("object_desc");
+	//for (int i = 0; i < specs.size(); i++) {
+	string json = "{";
+	string sql22 = "select CHINT_MATERIAL_SEQ.nextval as sid from dual";
+	int colmun2 = 0, count2 = 0;
+	char*** outputValue2 = NULL;
+	printf("search1");
+	QuerySQLNoInputParam((char*)sql22.c_str(), &colmun2, &count2, &outputValue2);
+	char* projn = "";
+	if (count2 > 0) {
+		projn = outputValue2[0][0];
+	}
+	printf("projn===>%s\n", projn);
+	json.append("\"Code\":\"").append(projn).append("\",");
+	//string spec = specs[i]; // �DZ���
+	string feature = "\"Feature\":{";
+	for (int j = 0; j < m_prds.size(); j++) {
+		PRD prd = m_prds[j];
+		//System.out.println(prd.prdFeatureCode + "-" + prd.featureName);
+		if (strstr(prd.featureName.c_str(), "����") != NULL) {
+			feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+				.append(zt2_MaterialMark).append("\",");
+		}
+		else if (strstr(prd.featureName.c_str(), "����") != NULL) {
+			feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+				.append(goodsName).append("\",");
+		}
+		else if (strstr(prd.featureName.c_str(), "�ͺ�") != NULL || strstr(prd.featureName.c_str(), "���") != NULL) {
+			feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+				.append(spec).append("\",");
+		}
+		else if (strstr(prd.featureName.c_str(), "ͼ������") != NULL) {
+			feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+				.append(bpNo).append("\",");
+		}
+		else if (strstr(prd.featureName.c_str(), "������Ʒ") != NULL) {
+			feature.append("\"").append(prd.prdFeatureCode).append("\":\"")
+				.append(zt2_ProductModel).append("\",");
+		}
+		else {
+			feature.append("\"").append(prd.prdFeatureCode).append("\":\"").append("\",");
+		}
+	}
+	
+	if (strcmp(zt2_SurfaceTreatment, "") != 0) {
+		feature.append("\"").append("F067").append("\":\"").append(zt2_SurfaceTreatment).append("\"");
+	}
+	else {
+		feature = feature.substr(0, feature.length() - 1);
+	}
+	//feature.substr(0, feature.length());
+	feature.append("},");
+	string data = json;
+	data.append("\"Data\":[{");
+	data.append("\"PrhCode").append("\":\"").append(prhCode).append("\",");
+	data.append("\"PmpcCode").append("\":\"").append(pmpcCode).append("\",");
+	data.append("\"PmpcType").append("\":\"").append(pmpcType).append("\",");
+	data.append("\"UnitCode").append("\":\"").append(unitCode).append("\",");
+	data.append("\"CompanyCode").append("\":\"").append(companyCode).append("\",");
+	data.append("\"UserCode").append("\":\"").append(user).append("\",");
+	data.append("\"MP").append("\":\"").append(mp).append("\",");
+	data.append(feature);
+	data.append("\"ProductGroupCode").append("\":\"").append("\",");
+	data.append("\"AssistUnitCode").append("\":\"").append("\",");
+	data.append("\"UnitQty").append("\":\"").append("\",");
+	data.append("\"AssistUnitQty").append("\":\"").append("\",");
+	data.append("\"Desc").append("\":\"").append(desc).append("\"");
+	data.append("}]}");
+	jsons.push_back(data);
+	tag_t newItem, newRev, pitem;
+	ITKCALL(ITEM_create_item(NULL, goodsName.c_str(), "Part", NULL, &newItem, &newRev));
+	AOM_lock(newItem);
+	AOM_lock(newRev);
+	ITKCALL(AOM_set_value_string(newRev, "zt2_Factory", groupId.c_str()));
+	ITKCALL(AOM_set_value_string(newRev, "object_desc", spec.c_str()));
+	ITKCALL(AOM_set_value_string(newRev, "zt2_ClassificationCode", "230101001"));
+	char* zt2_unit, *newUid;
+	ITK__convert_tag_to_uid(newRev, &newUid);
+	ITEM_ask_item_of_rev(rev, &pitem);
+	ITKCALL(AOM_ask_value_string(pitem, "zt2_unit", &zt2_unit));
+	ITKCALL(AOM_set_value_string(newItem, "zt2_unit", zt2_unit));
+
+	tag_t defGroup;
+	ITKCALL(AOM_ask_value_tag(dcproxy, "default_group", &defGroup));
+	ITKCALL(AOM_set_ownership(newItem, dcproxy, defGroup));
+	ITKCALL(AOM_set_ownership(newRev, dcproxy, defGroup));
+	AOM_save(newRev);
+	AOM_unlock(newRev);
+	AOM_save(newItem);
+	AOM_unlock(newItem);
+	char selectGyId[400];
+	sprintf(selectGyId, insertSql.c_str(), projn, newUid, pmpcCode.c_str(), "", goodsName.c_str(), "ST", companyCode.c_str(),
+		bpNo.c_str(), spec.c_str(), "", "", user_id, now.c_str(), "�����", "");
+	ExecuteSQLNoInputParam(selectGyId);
+	ExecuteSQLNoInputParam("commit");
+	return newRev;
+	/*uid = "";
+	Object params[] = new Object[15];
+	params[0] = code;
+	params[1] = uid;
+	params[2] = pmpcCode;
+	params[3] = goodsCode;
+	params[4] = goodsName;
+	params[5] = unitCode;
+	params[6] = companyCode;
+	params[7] = bpNo;
+	params[8] = spec;
+	params[9] = teRe;
+	params[10] = state;
+	params[11] = user;
+	params[12] = time;
+	params[13] = condition;
+	params[14] = "";*/
+}
+string getXqName(char *name) {
+	string xq = "";
+	if (strstr(name, "A��")!=NULL) {
+		xq = "A";
+	}else if (strstr(name, "B��") != NULL) {
+		xq = "B";
+	}
+	else if (strstr(name, "C��") != NULL) {
+		xq = "C";
+	}
+	else if (strstr(name, "D��") != NULL) {
+		xq = "D";
+	}
+	else if (strstr(name, "E��") != NULL) {
+		xq = "E";
+	}
+	return xq;
+}
+
+//����A����Ȧ������
+void addToAmatnr(tag_t *c_line_tags, int c_line_count, int len, tag_t newPAmatnr,boolean lastFlag) {
+
+	tag_t mantr = newPAmatnr, ebom_window, bom_line;
+	tag_t* bvr_list = NULL;
+	int bvr_count;
+	ITKCALL(ITEM_rev_list_bom_view_revs(mantr, &bvr_count, &bvr_list));
+	if (bvr_count == 0) {
+		tag_t newView, newViewBvr, pitem;
+		ITEM_ask_item_of_rev(mantr, &pitem);
+		ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+		AOM_save(newView);
+		ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, mantr, &newViewBvr));
+		AOM_save(newViewBvr);
+		AOM_save(mantr);
+	}
+	
+	ITKCALL(BOM_create_window(&ebom_window));
+	ITKCALL(BOM_set_window_top_line(ebom_window, NULL, mantr, NULLTAG, &bom_line));
+	char *name;
+	AOM_ask_value_string(mantr,"object_name",&name);
+	string xqType = getXqName(name); //ABCDE
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t newChild;
+		char* oldQty,*seqNo,*remark,*bl_line_name;
+		AOM_ask_value_string(c_line_tags[i], "ZT2_Remark", &remark);
+		string msg = getRemarkMsg(remark,len);
+		int xqLen = len;
+		if (msg.length()>0) {
+			xqLen = msg.length();
+			if (strstr(msg.c_str(), xqType.c_str())==NULL) {
+				continue;
+			}
+		}
+		ITKCALL(BOM_line_copy(bom_line, c_line_tags[i], NULLTAG, &newChild));
+		AOM_ask_value_string(c_line_tags[i], "bl_quantity", &oldQty);
+		AOM_ask_value_string(c_line_tags[i], "bl_sequence_no", &seqNo);
+		AOM_ask_value_string(c_line_tags[i], "bl_line_name", &bl_line_name);
+		if (lastFlag && strstr(bl_line_name, "��") != NULL) {
+			double blQty = atof(oldQty);
+			int num = blQty / xqLen;
+			double fmodVal = fmod(blQty, xqLen);
+			double lastVal = num + fmodVal;
+			string numNew = to_string(lastVal);
+			AOM_lock(newChild);
+			AOM_set_value_string(newChild, "bl_quantity", numNew.c_str());
+			AOM_set_value_string(newChild, "bl_sequence_no", seqNo);
+			AOM_save(newChild);
+			AOM_unlock(newChild);
+		}
+		else {
+			int blQty = atoi(oldQty);
+			int num = blQty / xqLen;
+			string numNew = to_string(num);
+			AOM_lock(newChild);
+			AOM_set_value_string(newChild, "bl_quantity", numNew.c_str());
+			AOM_set_value_string(newChild, "bl_sequence_no", seqNo);
+			AOM_save(newChild);
+			AOM_unlock(newChild);
+		}
+		
+	}
+
+	ITKCALL(BOM_save_window(ebom_window));
+	ITKCALL(BOM_close_window(ebom_window));
+}
+char* G2U222(const char* gb2312)
+{
+	int len = MultiByteToWideChar(CP_ACP, 0, gb2312, -1, NULL, 0);
+	wchar_t* wstr = new wchar_t[len + 1];
+	memset(wstr, 0, len + 1);
+	MultiByteToWideChar(CP_ACP, 0, gb2312, -1, wstr, len);
+	len = WideCharToMultiByte(CP_UTF8, 0, wstr, -1, NULL, 0, NULL, NULL);
+	char* str = new char[len + 1];
+	memset(str, 0, len + 1);
+	WideCharToMultiByte(CP_UTF8, 0, wstr, -1, str, len, NULL, NULL);
+	if (wstr) delete[] wstr;
+	return str;
+}
+//childPm�����Ȧ��E���ϣ�P����
+void replaceBom(EBomBean& childPm, map<string, tag_t>& map, int len, tag_t dcproxy, tag_t &topPrev) {
+
+	vector<EBomBean> parentBeans = childPm.parentBean;
+
+	//����P���� �ŵ���ϵ�ļ�����
+	saveAsCycle(childPm, map, topPrev);
+
+	printf("saveAsCycle OVER \n");
+	tag_t owning_group, owning_user;
+	char* grpId, *user_id,*uidTest;
+	int num = 0;
+	tag_t* mantrs, designRev;
+	string errBuff;
+	ITK__convert_tag_to_uid(childPm.eRev, &uidTest);
+	printf("uidTest OVER %s \n", uidTest);
+	ITKCALL(AOM_ask_value_tags(childPm.eRev, "TC_Is_Represented_By", &num, &mantrs));
+	if (num > 0) {
+		tag_t tzRev = mantrs[0];
+		ITKCALL(AOM_ask_value_tag(tzRev, "owning_user", &owning_user));
+		ITKCALL(AOM_ask_value_tag(tzRev, "owning_group", &owning_group));
+		ITKCALL(AOM_ask_value_string(owning_group, "name", &grpId));
+		ITKCALL(AOM_ask_value_string(owning_user, "user_id", &user_id));
+		vector<string> specs;
+		getSpecs(tzRev, specs);
+		printf("��ȡ������ \n");
+		time_t now;
+		struct tm* p;
+		time(&now);
+		p = localtime(&now);
+		char buffer[80];
+		sprintf_s(buffer, "%04d%02d%02d %02d:%02d:%02d", 1900 + p->tm_year, p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
+		string now1 = buffer;
+		vector<string> jsons;
+		char* names[5] = { "A��","B��","C��","D��","E��" };
+		char* idss[5] = { "A","B","C","D","E" };
+		tag_t axqPmatnr = childPm.pRev[0]; //�������ȦP����
+
+		int bvr_count = 0, c_line_count;
+		tag_t ebom_window = NULLTAG;
+		tag_t bom_line = NULLTAG, *c_line_tags;
+		tag_t* bvr_list = NULL;
+		(ITEM_rev_list_bom_view_revs(axqPmatnr, &bvr_count, &bvr_list));
+		printf("bvr_count=%d\n", bvr_count);
+
+		if (bvr_count == 0) {
+			tag_t newView, newViewBvr, pitem;
+			ITEM_ask_item_of_rev(axqPmatnr, &pitem);
+			ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+			AOM_save(newView);
+			ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, axqPmatnr, &newViewBvr));
+			AOM_save(newViewBvr);
+			AOM_save(axqPmatnr);
+			tag_t dsuser, *structure_revisions, *bom_view_tags;
+			AOM_ask_value_tag(tzRev, "owning_user", &dsuser);
+			tag_t defGroup;
+			ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+			ITKCALL(AOM_set_ownership(newView, dsuser, defGroup));
+			ITKCALL(AOM_set_ownership(newViewBvr, dsuser, defGroup));
+			//return;
+			(ITEM_rev_list_bom_view_revs(axqPmatnr, &bvr_count, &bvr_list));
+		}
+		(BOM_create_window(&ebom_window));
+		(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+		//ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+		ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+		printf("int===>%d\n", len);
+		vector<tag_t> newPAmatnrs;
+		for (int i = 0; i < len; i++) {
+			//����A������
+			printf("names[i]===>%s\n", names[i]);
+			tag_t newPAmatnr = send1(tzRev, now1, user_id, jsons, grpId, specs[0], names[i], idss[i], dcproxy);
+			newPAmatnrs.push_back(newPAmatnr);
+			//��������а��� �ߵ� ��ֺ����ķŵ����
+			boolean lastFlag = false;
+			if (i == len - 1) {
+				lastFlag = true;
+			}
+			addToAmatnr(c_line_tags, c_line_count, len, newPAmatnr, lastFlag);
+			//ITKCALL(BOM_line_add(bom_line, NULLTAG, newPAmatnr, NULLTAG, &bomLineAdd));
+		}
+		for (int i = 0; i < c_line_count; i++) {
+			ITKCALL(BOM_line_cut(c_line_tags[i]));
+		}
+		for (int t = 0; t < newPAmatnrs.size(); t++) {
+			tag_t bomLineAdd;
+			ITKCALL(BOM_line_add(bom_line, NULLTAG, newPAmatnrs[t], NULLTAG, &bomLineAdd));
+		}
+		//ITKCALL(AOM_save(bom_line));
+		ITKCALL(BOM_save_window(ebom_window));
+		ITKCALL(BOM_close_window(ebom_window));
+		for (int i = 0; i < jsons.size(); i++) {
+			printf("jsons ===> %s \n", jsons[i].c_str());
+			string url = "http://10.128.20.35:9002/Post/PLM_Goods";
+			string jsonUf = G2U222(jsons[i].c_str());
+			string msg = callHttpserver(jsonUf, url);
+		}
+	}
+}
+//��ȡ�������� �ж��Ƿ�����
+int getClassVal2(tag_t topItem, string& errMessage) {
+	tag_t top_classificationObject;
+	ICS_ask_classification_object(topItem, &top_classificationObject);
+	if (top_classificationObject == NULL_TAG)
+	{
+		errMessage.append("�������û�з��͵�����\n");
+		return  0;
+	}
+	char* top_class_id = NULL, *top_class_name = NULL;
+	//ICS_ask_class_of_classification_obj(top_classificationObject, &top_class_tag);
+	//ICS_ask_id_name(top_class_tag, &top_class_id, &top_class_name);
+	printf("BOM TOP LINE CLASS ID = %s | NAME = %s \n", top_class_id, top_class_name);
+	int n_attrs;
+	char** attr_names;
+	char** attr_vals;
+	ITKCALL(ICS_ask_attributes_of_classification_obj(top_classificationObject, &n_attrs, &attr_names, &attr_vals));
+	cout << n_attrs << endl;
+	int num = 1;
+	for (int ii = 0; ii < n_attrs; ii++)
+	{
+		printf("attr_names[ii]==>%sTTT\n", attr_names[ii]);
+		printf("attr_vals[ii]==>%sTTT\n", attr_vals[ii]);
+		if (strcmp(attr_names[ii], "����") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				errMessage.append("������������Ϊ�գ����顣\n");
+				return 0;
+			}
+			else {
+				printf("111[ii]==TTT\n");
+				if (strstr(attr_vals[ii],"3") != NULL) {
+					num = 3;
+				}else if (strstr(attr_vals[ii], "1") != NULL) {
+					num = 1;
+				}
+				else if (strstr(attr_vals[ii], "5") != NULL) {
+					num = 5;
+				}
+				//num = atoi(attr_vals[ii]);
+			}
+			break;
+		}
+	}
+	return num;
+}
+
+string getRemarkMsg(string remark,int len) {
+	char* idss[5] = { (char*)"A",(char*)"B",(char*)"C",(char*)"D",(char*)"E" };
+	//tring x = "9A9.1B2C3";
+	string xs = "";
+	for (int i = 0; i < len; i++) {
+		if (strstr(remark.c_str(), idss[i]) != NULL) {
+			xs.append(idss[i]);
+		}
+	}
+	return xs;
+}
+
+void recyReadEBom(tag_t pLine, EBomBean parentBean, vector<EBomBean>& beans, int len, tag_t pErev, string& errBuff) {
+
+	int c_line_count, cnt2, numFac, cnt3;
+	tag_t* c_line_tags;
+	ITKCALL(BOM_line_ask_all_child_lines(pLine, &c_line_count, &c_line_tags));
+	char* sffc, *name, *pRevId, ** sealeds, ** factorys,**procureType;
+	ITKCALL(AOM_ask_value_string(pErev, "item_id", &pRevId));
+	ITKCALL(AOM_ask_value_string(pErev, "object_name", &name));
+	ITKCALL(AOM_ask_value_string(pErev, "zt2_State", &sffc));
+	if (strcmp(sffc, "D1") == 0 || strcmp(sffc, "���") == 0) {
+		errBuff.append("����:").append(pRevId).append("/").append(name).append("�ѷ���޷�ת��PBOM.\n");
+		//return;
+	}
+	AOM_ask_value_strings(pErev, "zt2_SZProcuretype", &cnt3, &procureType); //��������
+	AOM_ask_value_strings(pErev, "zt2_SZSealedornot", &cnt2, &sealeds);
+	AOM_ask_value_strings(pErev, "zt2_SZFactory", &numFac, &factorys);
+	boolean flagWh = false;
+	//��������Ƿ��������
+	for (int i = 0; i < numFac; i++) {
+		if (strcmp(factorys[i], "M060") == 0 && cnt2 > i) {
+			flagWh = true;
+			if (strcmp(sealeds[i], "Y") == 0) {
+				errBuff.append("����:").append(pRevId).append("/").append(name).append("�ѷ���޷�ת��PBOM.\n");
+				//return;
+			}
+			if (cnt3 > i && strcmp(procureType[i], "/") == 0) {
+				errBuff.append("����:").append(pRevId).append("/").append(name).append("���ϲ������޷�ת��PBOM.\n");
+			}
+		}
+	}
+	if (!flagWh && strstr(name,"��װͼ")==NULL) {
+		//errBuff.append("����:").append(pRevId).append("/").append(name).append("������ͼû��ά��,����.\n");
+	}
+	for (int i = 0; i < c_line_count; i++) {
+
+		tag_t c_line_tag = c_line_tags[i], eRev;
+		ITKCALL(AOM_ask_value_tag(c_line_tag, "bl_line_object", &eRev));
+		EBomBean cBean;
+		cBean.eRev = eRev;
+		cBean.eBomline = c_line_tag;
+		cBean.parentBean.push_back(parentBean);
+		//��ȡͼֽ���� �ж��Ƿ�����Ȧ����ȦҪ����
+		//����ж��������ʽͨ�� �ӵ�beans��������������
+		int num = 0;
+		tag_t* mantrs;
+		ITKCALL(AOM_ask_value_tags(eRev, "TC_Is_Represented_By", &num, &mantrs));
+		if (num == 1) {
+			char* id;
+			AOM_ask_value_string(mantrs[0], "item_id", &id);
+			string item_id = id;
+			smatch result;//regex qq_reg("^1ZDB5.*\\d{1,}1000X.*");
+			bool ret = regex_match(item_id, result, qq_reg);
+			if (ret) {
+				char *zt2_ifpbom;
+				AOM_ask_value_string(eRev, "zt2_ifpbom", &zt2_ifpbom);
+				if (zt2_ifpbom!=NULL&&strcmp(zt2_ifpbom, "P") == 0) {
+					continue;
+				}
+				int cc_cnt;
+				tag_t* cc_lines;
+				BOM_line_ask_all_child_lines(c_line_tag, &cc_cnt, &cc_lines);
+				
+				//��Ȧ�¶������Ƿ�������� ȡ��װͼ����������Ȧ����  �����߼� ���ZT2_Remark�ϰ���ABC�� 
+				//12.4���� �������Ӽ����ƴ� �� �ģ�11.3 �ֳ�3��3��5.3
+				for (int tt = 0; tt < cc_cnt; tt++) {
+					tag_t cc_line = cc_lines[tt], c_eRev;
+					char* bl_quantity, *pId, *c_pId,*remark,*bl_line_name;
+					AOM_ask_value_string(eRev, "item_id", &pId);
+					AOM_ask_value_string(cc_line, "bl_quantity", &bl_quantity);
+					AOM_ask_value_string(cc_line, "ZT2_Remark", &remark);
+					AOM_ask_value_string(cc_line, "bl_line_name", &bl_line_name);
+					ITKCALL(AOM_ask_value_tag(cc_line, "bl_line_object", &c_eRev));
+					AOM_ask_value_string(c_eRev, "item_id", &c_pId);
+					printf("c_pId===>  %s bl_quantity ==> %s  len==> %d \n", c_pId, bl_quantity, len);
+					if (strcmp("bl_quantity", "") == 0) {
+						errBuff.append("P������:").append(pId).append("���Ӽ�").append(c_pId)
+							.append("�޷����������顣").append("\n");
+					}
+					else {
+						string markMsg = getRemarkMsg(remark, len);
+						printf("markMsg===>  %s \n", markMsg.c_str());
+						if (markMsg.length() == 0) {
+							int blQty = atoi(bl_quantity);
+							if (blQty % len != 0 && strstr(bl_line_name,"��")==NULL) {
+								errBuff.append("P������:").append(pId).append("���Ӽ�").append(c_pId)
+									.append("�޷����������顣").append("\n");
+							}
+							else {
+								newCBean aBean;
+								aBean.num = blQty / len;
+								aBean.cLine = cc_line;
+								cBean.c_lines.push_back(aBean);
+							}
+						}
+						else {
+							int blQty = atoi(bl_quantity);
+							if (blQty % markMsg.length() != 0 && strstr(bl_line_name, "��") == NULL) {
+								errBuff.append("P������:").append(pId).append("���Ӽ�").append(c_pId)
+									.append("�޷����������顣").append("\n");
+							}
+							else {
+								newCBean aBean;
+								aBean.num = blQty / markMsg.length();
+								aBean.cLine = cc_line;
+								cBean.c_lines.push_back(aBean);
+							}
+						}
+						
+					}
+				}
+				beans.push_back(cBean);
+				continue;
+			}
+		}
+		recyReadEBom(c_line_tag, cBean, beans, len, eRev, errBuff);
+		//�ж��Ӽ������Ƿ����� ��Ȧ����
+	}
+
+}
+tag_t findDcUser() {
+	tag_t* tags;
+	tag_t query = NULLTAG;
+	//��ѯ���з��ϵ����ϱ���
+	ITKCALL(QRY_find2("__WEB_find_user", &query));
+	if (query == NULLTAG) {
+		cout << "û���ҵ���ǰ��ѯ" << endl;
+	}
+	int cnt;
+	char** qry_entries1, **qry_values2;
+	QRY_find_user_entries(query, &cnt, &qry_entries1, &qry_values2);
+	char * qry_values[1] = { "dcproxy" };
+	int n_found;
+	ITKCALL(QRY_execute(query, 1, qry_entries1, qry_values, &n_found, &tags));
+	if (n_found == 0) {
+		return NULLTAG;
+	}
+	else {
+		return tags[0];
+	}
+}
+class E2PBean //��class ��ͷ
+{
+public:
+	string key;//wbs��+���Ϻ���ɵı�ʶ
+	tag_t pMantr=NULLTAG; // p���� �������棬û�������£�ȡ���°汾 (����P���Ƴ�����)
+	string revId = "";
+	tag_t eMantr; // e����
+public:
+	//�����Ա����
+	void isSameKey(string newKey)
+	{
+		if (key.compare(newKey) == 0) {
+			//һ����
+		}
+	}
+
+};
+struct EBomUpBean
+{
+	string matnrNo;
+	tag_t bomline;
+	vector<EBomUpBean> parentBean; //����EBOMʱ��ĸ���
+	vector<newCBean> c_lines; //EBOM�е��Ӽ� ֻ����Ȧ��
+};
+//����EBOM �������EBOM��
+void updatePbomCycle(tag_t eLine, string &errBuff, int len, EBomUpBean &upBean) {
+	int c_line_count;
+	tag_t *c_line_tags;
+	ITKCALL(BOM_line_ask_all_child_lines(eLine, &c_line_count, &c_line_tags));
+	//printf("upBean===>%s\n", upBean.matnrNo.c_str());
+	for (int i = 0; i < c_line_count; i++) {
+		char* ifpBom, *matnrNo;
+		tag_t c_line_tag = c_line_tags[i], eRev;
+		ITKCALL(AOM_ask_value_tag(c_line_tag, "bl_line_object", &eRev));
+		AOM_ask_value_string(eRev, "zt2_ifpbom", &ifpBom);
+		AOM_ask_value_string(eRev, "zt2_MaterialNo", &matnrNo);
+
+		EBomUpBean cBean;
+		cBean.matnrNo = matnrNo;
+		//printf("CChild===>%s\n", matnrNo);
+		cBean.bomline = c_line_tag;
+		int num = 0;
+		tag_t* mantrs;
+		ITKCALL(AOM_ask_value_tags(eRev, "TC_Is_Represented_By", &num, &mantrs));
+		if (num == 1) {
+			char* id;
+			AOM_ask_value_string(mantrs[0], "item_id", &id);
+			string item_id = id;
+			smatch result;
+			bool ret = regex_match(item_id, result, qq_reg);
+			if (ret) {
+				char* zt2_ifpbom;
+				AOM_ask_value_string(eRev, "zt2_ifpbom", &zt2_ifpbom);
+				if (zt2_ifpbom != NULL && strcmp(zt2_ifpbom, "P") == 0) {
+					continue;
+				}
+				int cc_cnt;
+				tag_t* cc_lines;
+				BOM_line_ask_all_child_lines(c_line_tag, &cc_cnt, &cc_lines);
+				printf("cc_cnt===>  %d item_id ==> %s \n", cc_cnt, id);
+				//�����߼�
+				for (int tt = 0; tt < cc_cnt; tt++) {
+					tag_t cc_line = cc_lines[tt], c_eRev;
+					char* bl_quantity, *pId, *c_pId,*bl_line_name,*remark;
+					AOM_ask_value_string(eRev, "item_id", &pId);
+					AOM_ask_value_string(cc_line, "bl_quantity", &bl_quantity);
+					ITKCALL(AOM_ask_value_tag(cc_line, "bl_line_object", &c_eRev));
+					AOM_ask_value_string(cc_line, "bl_line_name", &bl_line_name);
+					AOM_ask_value_string(c_eRev, "item_id", &c_pId);
+					AOM_ask_value_string(cc_line, "ZT2_Remark", &remark);
+					printf("c_pId===>  %s bl_quantity ==> %s  len==> %d \n", c_pId, bl_quantity, len);
+					if (strcmp("bl_quantity", "") == 0) {
+						errBuff.append("P������:").append(pId).append("���Ӽ�").append(c_pId)
+							.append("�޷����������顣").append("\n");
+					}
+					else {
+						string markMsg = getRemarkMsg(remark, len);
+						printf("markMsg===>  %s \n", markMsg.c_str());
+						if (markMsg.length() == 0) {
+							int blQty = atoi(bl_quantity);
+							if (blQty % len != 0 && strstr(bl_line_name, "��") == NULL) {
+								errBuff.append("P������:").append(pId).append("���Ӽ�").append(c_pId)
+									.append("�޷����������顣").append("\n");
+							}
+							else {
+								newCBean aBean;
+								aBean.num = blQty / len;
+								aBean.cLine = cc_line;
+								cBean.c_lines.push_back(aBean);
+							}
+						}
+						else {
+							int blQty = atoi(bl_quantity);
+							if (blQty % len != 0 && strstr(bl_line_name, "��") == NULL) {
+								errBuff.append("P������:").append(pId).append("���Ӽ�").append(c_pId)
+									.append("�޷����������顣").append("\n");
+							}
+							else {
+								newCBean aBean;
+								aBean.num = blQty / len;
+								aBean.cLine = cc_line;
+								cBean.c_lines.push_back(aBean);
+							}
+						}
+					}
+				}
+				//beans.push_back(cBean);
+				//continue;
+			}
+		}
+		updatePbomCycle(c_line_tag, errBuff, len, cBean);
+		upBean.parentBean.push_back(cBean);
+	}
+}
+boolean checkName(char* name) {
+
+	if (strstr(name, "A��") != NULL || strstr(name, "B��") != NULL || strstr(name, "C��") != NULL
+		|| strstr(name, "E��") != NULL || strstr(name, "D��") != NULL) {
+		return true;
+	}
+	else {
+		return false;
+	}
+}
+tag_t saveAsUpdate(tag_t eRev, char *uid, tag_t pLine) {
+	char* newid = NULL;
+	logical isModified = FALSE;
+	tag_t item_type_tag, newItem, newRev;
+	TCTYPE_ask_type("Item", &item_type_tag);
+	ITKCALL(USER_new_item_id(NULLTAG, item_type_tag, &isModified, &newid));
+	/*ITKCALL(NR_next_value("MEProcess", "item_id", NULLTAG, "", "", "",
+		NULLTAG, "", "", &next_id));*/
+	printf("next_id==>%s\n", newid);
+	ITKCALL(ITEM_copy_item(eRev, newid, NULL, &newItem, &newRev));
+	//ITKCALL(AOM_set_value_string(newRev, "zt2_PMaterial", "PBOM"));
+	char* matnrNo;
+	AOM_ask_value_string(eRev, "zt2_MaterialNo", &matnrNo);
+	AOM_lock(newRev);
+
+	AOM_set_value_string(newRev, "zt2_ifpbom", "P");
+	AOM_set_value_string(newRev, "zt2_MaterialNo", matnrNo);
+	AOM_save(newRev);
+	AOM_unlock(newRev);
+
+	int num = 0, revNum = 0, tagNum = 0;
+	tag_t* mantrs, dsuser, *structure_revisions, *bom_view_tags;
+	AOM_ask_value_tags(eRev, "TC_Is_Represented_By", &num, &mantrs);
+	if (num > 0) {
+		AOM_ask_value_tags(newRev, "structure_revisions", &revNum, &structure_revisions);
+		AOM_ask_value_tags(newRev, "bom_view_tags", &tagNum, &bom_view_tags);
+		AOM_ask_value_tag(mantrs[0], "owning_user", &dsuser);
+		tag_t defGroup;
+		ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+		ITKCALL(AOM_set_ownership(newItem, dsuser, defGroup));
+		ITKCALL(AOM_set_ownership(newRev, dsuser, defGroup));
+		if (revNum > 0) {
+			ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+		}
+		if (tagNum > 0) {
+			ITKCALL(AOM_set_ownership(bom_view_tags[0], dsuser, defGroup));
+		}
+	}
+	{
+		//ITKCALL(BOM_line_replace(newChild, NULLTAG, newRev, NULLTAG));
+		int bvr_count = 0, c_line_count;
+		tag_t ebom_window = NULLTAG;
+		tag_t bom_line = NULLTAG, *c_line_tags;
+		(BOM_create_window(&ebom_window));
+		tag_t* bvr_list = NULL;
+		(ITEM_rev_list_bom_view_revs(pLine, &bvr_count, &bvr_list));
+		printf("bvr_count=%d\n", bvr_count);
+
+		(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+		//ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+		ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+
+		for (int ind = 0; ind < c_line_count; ind++) {
+			tag_t c_line_tag = c_line_tags[ind], mantr;
+			AOM_ask_value_tag(c_line_tag, "bl_line_object", &mantr);
+			char* eRevUid2;
+			ITK__convert_tag_to_uid(mantr, &eRevUid2);
+			if (strcmp(eRevUid2, uid) == 0) {
+				ITKCALL(BOM_line_replace(c_line_tag, NULLTAG, newRev, NULLTAG));
+			}
+		}
+		BOM_save_window(ebom_window);
+		BOM_close_window(ebom_window);
+	}
+	return newRev;
+}
+tag_t saveAsUpdate(tag_t eRev, tag_t newChild) {
+	char* newid = NULL;
+	logical isModified = FALSE;
+	tag_t item_type_tag, newItem, newRev;
+	TCTYPE_ask_type("Item", &item_type_tag);
+	ITKCALL(USER_new_item_id(NULLTAG, item_type_tag, &isModified, &newid));
+	/*ITKCALL(NR_next_value("MEProcess", "item_id", NULLTAG, "", "", "",
+		NULLTAG, "", "", &next_id));*/
+	printf("next_id==>%s\n", newid);
+	ITKCALL(ITEM_copy_item(eRev, newid, NULL, &newItem, &newRev));
+	//ITKCALL(AOM_set_value_string(newRev, "zt2_PMaterial", "PBOM"));
+	char* matnrNo;
+	AOM_ask_value_string(eRev, "zt2_MaterialNo", &matnrNo);
+	AOM_lock(newRev);
+
+	AOM_set_value_string(newRev, "zt2_ifpbom", "P");
+	AOM_set_value_string(newRev, "zt2_MaterialNo", matnrNo);
+	AOM_save(newRev);
+	AOM_unlock(newRev);
+
+	int num = 0, revNum = 0, tagNum = 0;
+	tag_t* mantrs, dsuser, *structure_revisions, *bom_view_tags;
+	AOM_ask_value_tags(eRev, "TC_Is_Represented_By", &num, &mantrs);
+	if (num > 0) {
+		AOM_ask_value_tags(newRev, "structure_revisions", &revNum, &structure_revisions);
+		AOM_ask_value_tags(newRev, "bom_view_tags", &tagNum, &bom_view_tags);
+		AOM_ask_value_tag(mantrs[0], "owning_user", &dsuser);
+		tag_t defGroup;
+		ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+		ITKCALL(AOM_set_ownership(newItem, dsuser, defGroup));
+		ITKCALL(AOM_set_ownership(newRev, dsuser, defGroup));
+		if (revNum > 0) {
+			ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+		}
+		if (tagNum > 0) {
+			ITKCALL(AOM_set_ownership(bom_view_tags[0], dsuser, defGroup));
+		}
+	}
+	{
+		ITKCALL(BOM_line_replace(newChild, NULLTAG, newRev, NULLTAG));
+		//int bvr_count = 0, c_line_count;
+		//tag_t ebom_window = NULLTAG;
+		//tag_t bom_line = NULLTAG, * c_line_tags;
+		//(BOM_create_window(&ebom_window));
+		//tag_t* bvr_list = NULL;
+		//(ITEM_rev_list_bom_view_revs(pRevs[0], &bvr_count, &bvr_list));
+		//printf("bvr_count=%d\n", bvr_count);
+
+		//(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+		////ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+		//ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+
+		//for (int ind = 0; ind < c_line_count; ind++) {
+		//	tag_t c_line_tag = c_line_tags[ind], mantr;
+		//	AOM_ask_value_tag(c_line_tag, "bl_line_object", &mantr);
+		//	char* eRevUid2;
+		//	ITK__convert_tag_to_uid(mantr, &eRevUid2);
+		//	if (strcmp(eRevUid2, eRevUid) == 0) {
+		//		if (childPm.pRev.size() > 0) {
+		//			printf("eRevUid===>%s\n", eRevUid);
+		//			ITKCALL(BOM_line_replace(c_line_tag, NULLTAG, childPm.pRev[0], NULLTAG));
+		//		}
+		//	}
+		//}
+		//BOM_save_window(ebom_window);
+		//BOM_close_window(ebom_window);
+	}
+	return newRev;
+}
+
+void createAXxq(tag_t eRev, tag_t pRev, int len, tag_t dcproxy) {
+	tag_t owning_group, owning_user;
+	char* grpId, *user_id;
+	int num = 0;
+	tag_t* mantrs, designRev;
+	string errBuff;
+	ITKCALL(AOM_ask_value_tags(eRev, "TC_Is_Represented_By", &num, &mantrs));
+	if (num > 0) {
+		tag_t tzRev = mantrs[0];
+		ITKCALL(AOM_ask_value_tag(tzRev, "owning_user", &owning_user));
+		ITKCALL(AOM_ask_value_tag(tzRev, "owning_group", &owning_group));
+		ITKCALL(AOM_ask_value_string(owning_group, "name", &grpId));
+		ITKCALL(AOM_ask_value_string(owning_user, "user_id", &user_id));
+		vector<string> specs;
+		getSpecs(tzRev, specs);
+		printf("��ȡ������ \n");
+		time_t now;
+		struct tm* p;
+		time(&now);
+		p = localtime(&now);
+		char buffer[80];
+		sprintf_s(buffer, "%04d%02d%02d %02d:%02d:%02d", 1900 + p->tm_year, p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
+		string now1 = buffer;
+		vector<string> jsons;
+		char* names[5] = { "A��","B��","C��","D��","E��" };
+		char* idss[5] = { "A","B","C","D","E" };
+		tag_t axqPmatnr = pRev; //�������ȦP����
+
+		int bvr_count = 0, c_line_count;
+		tag_t ebom_window = NULLTAG;
+		tag_t bom_line = NULLTAG, *c_line_tags;
+		tag_t* bvr_list = NULL;
+		(ITEM_rev_list_bom_view_revs(axqPmatnr, &bvr_count, &bvr_list));
+		printf("bvr_count=%d\n", bvr_count);
+
+		if (bvr_count == 0) {
+			tag_t newView, newViewBvr, pitem;
+			ITEM_ask_item_of_rev(axqPmatnr, &pitem);
+			ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+			AOM_save(newView);
+			ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, axqPmatnr, &newViewBvr));
+			AOM_save(newViewBvr);
+			AOM_save(axqPmatnr);
+			//return;
+			tag_t dsuser, *structure_revisions, *bom_view_tags;
+			AOM_ask_value_tag(tzRev, "owning_user", &dsuser);
+			tag_t defGroup;
+			ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+			ITKCALL(AOM_set_ownership(newView, dsuser, defGroup));
+			ITKCALL(AOM_set_ownership(newViewBvr, dsuser, defGroup));
+			(ITEM_rev_list_bom_view_revs(axqPmatnr, &bvr_count, &bvr_list));
+		}
+		(BOM_create_window(&ebom_window));
+		(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+		//ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+		ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+		printf("int===>%d\n", len);
+		vector<tag_t> newPAmatnrs;
+		for (int i = 0; i < len; i++) {
+			//����A������ idss[i]
+			printf("names[i]===>%s\n", names[i]);
+			tag_t newPAmatnr = send1(tzRev, now1, user_id, jsons, grpId, specs[0], names[i], idss[i], dcproxy);
+			newPAmatnrs.push_back(newPAmatnr);
+			boolean lastFlag = false;
+			if (i == len - 1) {
+				lastFlag = true;
+			}
+			addToAmatnr(c_line_tags, c_line_count, len, newPAmatnr, lastFlag);
+			//ITKCALL(BOM_line_add(bom_line, NULLTAG, newPAmatnr, NULLTAG, &bomLineAdd));
+		}
+		for (int i = 0; i < c_line_count; i++) {
+			ITKCALL(BOM_line_cut(c_line_tags[i]));
+		}
+		for (int t = 0; t < newPAmatnrs.size(); t++) {
+			tag_t bomLineAdd;
+			ITKCALL(BOM_line_add(bom_line, NULLTAG, newPAmatnrs[t], NULLTAG, &bomLineAdd));
+		}
+		//ITKCALL(AOM_save(bom_line));
+		ITKCALL(BOM_save_window(ebom_window));
+		ITKCALL(BOM_close_window(ebom_window));
+		for (int i = 0; i < jsons.size(); i++) {
+			printf("jsons ===> %s \n", jsons[i].c_str());
+			string url = "http://10.128.20.35:9002/Post/PLM_Goods";
+			string jsonUf = G2U222(jsons[i].c_str());
+			string msg = callHttpserver(jsonUf, url);
+		}
+	}
+}
+//����A����Ȧ������
+void addToAmatnrUp(vector<EBomUpBean> vecs, int len, tag_t newPAmatnr, boolean lastFlag) {
+
+	tag_t mantr = newPAmatnr, ebom_window, bom_line;
+	tag_t* bvr_list = NULL;
+	int bvr_count;
+	ITKCALL(ITEM_rev_list_bom_view_revs(mantr, &bvr_count, &bvr_list));
+	if (bvr_count == 0) {
+		tag_t newView, newViewBvr, pitem;
+		ITEM_ask_item_of_rev(mantr, &pitem);
+		ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+		AOM_save(newView);
+		ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, mantr, &newViewBvr));
+		AOM_save(newViewBvr);
+		AOM_save(mantr);
+	}
+	ITKCALL(BOM_create_window(&ebom_window));
+	ITKCALL(BOM_set_window_top_line(ebom_window, NULL, mantr, NULLTAG, &bom_line));
+	char *name;
+	AOM_ask_value_string(mantr, "object_name", &name);
+	string xqType = getXqName(name); //ABCDE
+	for (int i = 0; i < vecs.size(); i++) {
+		tag_t newChild;
+		tag_t cline = vecs[i].bomline;
+
+		char* oldQty, *seqNo, *remark,*bl_line_name;
+		AOM_ask_value_string(cline, "ZT2_Remark", &remark);
+		string msg = getRemarkMsg(remark, len);
+		int xqLen = len;
+		if (msg.length() > 0) {
+			xqLen = msg.length();
+			if (strstr(msg.c_str(), xqType.c_str()) != NULL) {
+				continue;
+			}
+		}
+		ITKCALL(BOM_line_copy(bom_line, cline, NULLTAG, &newChild));
+		AOM_ask_value_string(cline, "bl_quantity", &oldQty);
+		AOM_ask_value_string(cline, "bl_sequence_no", &seqNo);
+		AOM_ask_value_string(cline, "bl_line_name", &bl_line_name);
+		if (lastFlag && strstr(bl_line_name,"��")!=NULL) {
+			double blQty = atof(oldQty);
+			int num = blQty / xqLen;
+			double fmodVal = fmod(blQty, xqLen);
+			double lastVal = num + fmodVal;
+			string numNew = to_string(lastVal);
+			AOM_lock(newChild);
+			AOM_set_value_string(newChild, "bl_quantity", numNew.c_str());
+			AOM_set_value_string(newChild, "bl_sequence_no", seqNo);
+			AOM_save(newChild);
+			AOM_unlock(newChild);
+		}
+		else {
+			int blQty = atoi(oldQty);
+			int num = blQty / len;
+			string numNew = to_string(num);
+			AOM_lock(newChild);
+			AOM_set_value_string(newChild, "bl_quantity", numNew.c_str());
+			AOM_set_value_string(newChild, "bl_sequence_no", seqNo);
+			AOM_save(newChild);
+			AOM_unlock(newChild);
+		}
+	}
+
+	ITKCALL(BOM_save_window(ebom_window));
+	ITKCALL(BOM_close_window(ebom_window));
+}
+void startUpdate(EBomUpBean upBean, tag_t bom_line, int len, tag_t dcproxy,tag_t ebom_window2) {
+	vector<EBomUpBean> vecs = upBean.parentBean;
+	int c_line_count = 0;
+	tag_t* c_line_tags;
+	vector<string> matnrVec;
+	vector<tag_t> xqTagVec;
+	map<string, tag_t> pBomMap;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	for (int i = 0; i < c_line_count; i++) {
+		char* ifpBom, *matnrNo, *name;
+		tag_t c_line_tag = c_line_tags[i], eRev;
+		ITKCALL(AOM_ask_value_tag(c_line_tag, "bl_line_object", &eRev));
+		AOM_ask_value_string(eRev, "zt2_ifpbom", &ifpBom);
+		AOM_ask_value_string(eRev, "zt2_MaterialNo", &matnrNo);
+		AOM_ask_value_string(eRev, "object_name", &name);
+		//�Ƴ�PBOM
+		printf("zt2_MaterialNo ===>%s ifpBom==>%s\n", matnrNo, ifpBom);
+		if (strcmp(ifpBom, "P") == 0) {
+			matnrVec.push_back(matnrNo);
+			pBomMap[matnrNo] = c_line_tag;
+			//BOM_line_cut(c_line_tag);
+		}
+		else if (!checkName(name)) {
+			BOM_line_cut(c_line_tag);//pBomMap[matnrNo] = c_line_tag;
+		}
+		else if (checkName(name)) {
+			xqTagVec.push_back(c_line_tag);
+		}
+	}
+	//�Ƴ����з�P �ٴ�EBOM����
+	printf("xqTagVec===>%d\n", xqTagVec.size());
+	for (int i = 0; i < xqTagVec.size(); i++) {
+		tag_t xqLine = xqTagVec[i],*c_xqLine_tags, newPAmatnr;
+		int c_line_countXq = 0;
+		ITKCALL(BOM_line_ask_all_child_lines(xqLine, &c_line_countXq, &c_xqLine_tags));
+		printf("c_line_countXq===>%d\n", c_line_countXq);
+		for (int j = 0; j < c_line_countXq; j++) {
+			BOM_line_cut(c_xqLine_tags[j]);
+		}
+		ITKCALL(AOM_ask_value_tag(xqLine, "bl_line_object", &newPAmatnr));
+		//������Ȧ�µĶ���
+		boolean lastFlag = false;
+		if (i == xqTagVec.size() - 1) {
+			lastFlag = true;
+		}
+		addToAmatnrUp(vecs, len, newPAmatnr, lastFlag);
+		/*for (int i = 0; i < vecs.size(); i++) {
+			EBomUpBean cupBean = vecs[i];
+			if (std::find(xqTagVec.begin(), xqTagVec.end(), cupBean.matnrNo) != xqTagVec.end()) {
+				tag_t c_line_tag = pBomMap[cupBean.matnrNo];
+			}
+		}*/
+		
+	}
+	if (xqTagVec.size() == 0) {
+		printf("vecs===>%d\n", vecs.size());
+		for (int i = 0; i < vecs.size(); i++) {
+			EBomUpBean cupBean = vecs[i];
+			//���¸���
+			if (std::find(matnrVec.begin(), matnrVec.end(), cupBean.matnrNo) != matnrVec.end()) {
+				tag_t c_line_tag = pBomMap[cupBean.matnrNo];
+				tag_t c_Rev, bomView = NULLTAG;
+				ITKCALL(AOM_ask_value_tag(c_line_tag, "bl_line_object", &c_Rev));
+				boolean flagAs = false;
+				{
+					int structs = 0, statusNum = 0;
+					tag_t* structure_revisions, *release_status_list;
+					AOM_ask_value_tags(c_Rev, "structure_revisions", &structs, &structure_revisions);
+					if (structs > 0) {
+						AOM_ask_value_tags(structure_revisions[0], "release_status_list", &statusNum, &release_status_list);
+						if (statusNum > 0) {
+							tag_t* mantrsAs, dsuser, pBomTop, *bvr_list;
+							int revNum = 0, num = 0, bvr_count = 0;
+							ITEM_copy_rev(c_Rev, NULL, &pBomTop);
+							flagAs = true;
+							AOM_ask_value_tags(c_Rev, "TC_Is_Represented_By", &num, &mantrsAs);
+							AOM_ask_value_tag(mantrsAs[0], "owning_user", &dsuser);
+							tag_t defGroup;
+							ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+							ITKCALL(AOM_set_ownership(pBomTop, dsuser, defGroup));
+							if (num > 0) {
+								AOM_ask_value_tags(pBomTop, "structure_revisions", &revNum, &structure_revisions);
+								if (revNum > 0) {
+									ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+								}
+							}
+							(BOM_create_window(&bomView));
+							(ITEM_rev_list_bom_view_revs(pBomTop, &bvr_count, &bvr_list));
+							printf("bvr_count=%d \n", bvr_count);
+							if (bvr_count == 0) {
+								//errBuff.append("������EBOM����\n");
+							}
+							ITKCALL(BOM_set_window_top_line_bvr(bomView, bvr_list[0], &c_line_tag)); //����bom��ȡ
+						}
+					}
+				}
+				printf("matnrVec ===>%s\n", cupBean.matnrNo.c_str());
+				startUpdate(cupBean, c_line_tag, len, dcproxy, ebom_window2);
+				if (bomView != NULLTAG && flagAs) {
+					BOM_save_window(bomView);
+					BOM_close_window(bomView);
+				}
+			}
+			else {
+				boolean flagLc = false;
+				char* seq;
+				printf("matnrVecNotP===>%s\n", cupBean.matnrNo.c_str());
+				tag_t cline = cupBean.bomline;
+				tag_t newChild;
+				ITKCALL(BOM_line_copy(bom_line, cline, NULLTAG, &newChild));
+				AOM_ask_value_string(cline, "bl_sequence_no", &seq);
+				AOM_lock(newChild);
+				AOM_set_value_string(newChild, "bl_sequence_no", seq);
+				AOM_save(newChild);
+				AOM_unlock(newChild);
+				tag_t c_Rev;
+				ITKCALL(AOM_ask_value_tag(cline, "bl_line_object", &c_Rev));
+
+				vector<EBomUpBean> ccBeans = cupBean.parentBean;
+				//��Ȧװ��
+				for (int j = 0; j < ccBeans.size(); j++) {
+					EBomUpBean ccBean = ccBeans[j];
+					if (ccBean.c_lines.size() > 0) {
+						//Ҫ�������
+						char* uid;
+						tag_t cc_Rev;
+						tag_t newPrev = saveAsUpdate(c_Rev, newChild);
+						ITKCALL(AOM_ask_value_tag(ccBean.bomline, "bl_line_object", &cc_Rev));
+						ITK__convert_tag_to_uid(cc_Rev, &uid);
+						tag_t cc_PRev = saveAsUpdate(cc_Rev, uid, newPrev);
+						createAXxq(cc_Rev, cc_PRev, len, dcproxy);
+					}
+				}
+			}
+		}
+	}
+	//�Ƴ����з�P �ٴ�EBOM����
+	
+	ITKCALL(BOM_save_window(ebom_window2));
+}
+void copyBomLine(tag_t matnrTop, tag_t otherPbom) {
+	tag_t ebom_window, ebom_window2, *bvr_list, *bvr_list2, bom_line, bom_line2, *c_line_tags, *c_line_tags2;
+	int bvr_count = 0, bvr_count2 = 0, c_line_count, c_line_count2;
+	(BOM_create_window(&ebom_window));
+	(ITEM_rev_list_bom_view_revs(matnrTop, &bvr_count, &bvr_list));
+	printf("bvr_count=%d \n", bvr_count);
+	if (bvr_count == 0) {
+		//errBuff.append("������EBOM����\n");
+	}
+	ITKCALL(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	printf("����bom��ȡ\n");
+	//ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+
+
+	(ITEM_rev_list_bom_view_revs(otherPbom, &bvr_count2, &bvr_list2));
+	if (bvr_count2 == 0) {
+		tag_t newView, newViewBvr, pitem;
+		ITEM_ask_item_of_rev(otherPbom, &pitem);
+		ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+		AOM_save(newView);
+		ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, otherPbom, &newViewBvr));
+		AOM_save(newViewBvr);
+		AOM_save(otherPbom);
+		//return;
+		(ITEM_rev_list_bom_view_revs(otherPbom, &bvr_count2, &bvr_list2));
+	}
+	(BOM_create_window(&ebom_window2));
+	(BOM_set_window_top_line_bvr(ebom_window2, bvr_list2[0], &bom_line2)); //����bom��ȡ
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line2, &c_line_count2, &c_line_tags2));
+	for (int i = 0; i < c_line_count2; i++) {
+		BOM_line_cut(c_line_tags2[i]);
+	}
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t newChild;
+		char *bl_seqNo;
+		ITKCALL(BOM_line_copy(bom_line2, c_line_tags[i], NULLTAG, &newChild));
+		AOM_ask_value_string(c_line_tags[i], "bl_sequence_no", &bl_seqNo);
+		AOM_lock(newChild);
+		AOM_set_value_string(newChild, "bl_sequence_no", bl_seqNo);
+		AOM_save(newChild);
+		//���unlock
+		AOM_unlock(newChild);
+	}
+	//tag_t newChild;
+	//ITKCALL(BOM_line_copy(bom_line2, c_line_tags[i], NULLTAG, &newChild));
+
+	ITKCALL(BOM_save_window(ebom_window2));
+	BOM_close_window(ebom_window2);
+	BOM_close_window(ebom_window);
+}
+int EbomToPMethod(void* returnValue) {
+	int ifail = ITK_ok;
+	char *sql = NULL, *revUid;
+	tag_t matnrRev1;
+	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+	ITK__convert_uid_to_tag(revUid, &matnrRev1);
+	
+	if (open("PLMUser", "PLMUser", "BDP2020", "10.128.20.35")) {
+		printf("����SQLSERVERʧ��\n");
+	}
+	else {
+		printf("����SQLSERVER�ɹ�\n");
+	}
+	{
+		char selectRecord[200], selectRecord1[200];
+		sprintf(selectRecord, Sql1.c_str(), m_code1.c_str());
+		printf("ִ�в�ѯ %s\n", selectRecord);
+		int outputColumn = 0, outputValueCount = 0;
+		char*** outputValue = NULL;
+		ado_QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+		prds.clear();
+		string pmpcPrhCode, pmpcPType, pmpcMType;
+		for (int j = 0; j < outputValueCount; j++) {
+			pmpcPrhCode = outputValue[j][0];
+			pmpcPType = outputValue[j][1];
+			pmpcMType = outputValue[j][2];
+			pmpc.m_code = m_code1;
+			pmpc.pmpcPrhCode = pmpcPrhCode;
+			pmpc.pmpcPType = pmpcPType;
+			pmpc.pmpcMType = pmpcMType;
+			printf("pmpcMType====>%s\n", outputValue[j][2]);
+		}
+		sprintf(selectRecord1, Sql2.c_str(), pmpcPrhCode.c_str());
+		int outputColumn1 = 0, outputValueCount1 = 0;
+		char*** outputValue1 = NULL;
+		printf("ִ�в�ѯ %s\n", selectRecord1);
+		ado_QuerySQLNoInputParam(selectRecord1, &outputColumn1, &outputValueCount1, &outputValue1);
+		for (int j = 0; j < outputValueCount1; j++) {
+			string prdFeatureCode = outputValue1[j][3];
+			string featureName = outputValue1[j][4];
+			PRD prd;
+			prd.prdFeatureCode = prdFeatureCode;
+			prd.featureName = featureName;
+			prds.push_back(prd);
+		}
+	}
+
+	close();
+	//����design BOM ��ȡ������Ϣ
+	int bvr_count = 0, c_line_count;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	
+	int num = 0,num2=0;
+	tag_t* mantrs, designRev;
+	string errBuff;
+	ITKCALL(AOM_ask_value_tags(matnrRev1, "TC_Is_Represented_By", &num, &mantrs));
+	int len = 1;
+	if (num >= 1) {
+		//�ҵ�ͼֽ��ȡ�������з���������E���Ϻ�P�������о͸���
+		designRev = mantrs[0];
+		tag_t designItem;
+		ITEM_ask_item_of_rev(designRev,&designItem);
+		ITEM_ask_latest_rev(designItem,&designRev);
+		char* itemId;
+		AOM_ask_value_string(designRev, "item_id", &itemId);
+		vector<string> vec2;
+		Split(itemId, "-", vec2);
+		string idTop = "1ZDB300000P";
+		if (vec2.size() > 0) {
+			idTop = idTop.append("-").append(vec2[1]);
+		}
+		tag_t topItem, topDesginRev;
+		ITEM_find_item(idTop.c_str(), &topItem);
+		ITEM_ask_latest_rev(topItem, &topDesginRev);
+		len = getClassVal2(topItem, errBuff);
+		printf("len%d\n", len);
+		if (len > 0) {
+			boolean isUpdate = false;
+
+			tag_t* bvr_list = NULL, *topMatnrs;
+			ITKCALL(AOM_ask_value_tags(topDesginRev, "representation_for", &num2, &topMatnrs));
+			//tag_t matnrTop = NULLTAG;
+			printf("num2===>%d\n", num2);
+			map<string, E2PBean> wlbmMap;
+			//������ѹ��ͼֽ��ȡ���°汾��E��P����
+			for (int t = 0; t < num2; t++) {
+				char* isPm, *zt2_MaterialNo, *zt2_WBSNo;
+				AOM_ask_value_string(topMatnrs[t], "zt2_WBSNo", &zt2_WBSNo);
+				AOM_ask_value_string(topMatnrs[t], "zt2_MaterialNo", &zt2_MaterialNo);
+				AOM_ask_value_string(topMatnrs[t], "zt2_ifpbom", &isPm);
+				string key = "";
+				key.append(zt2_WBSNo).append(zt2_MaterialNo);
+
+				if (wlbmMap.count(key) > 0) {
+					E2PBean &bean = wlbmMap[key];
+					if (strcmp(isPm, "P") == 0) {
+						char* revId;
+						//��ȡ���µİ汾
+						AOM_ask_value_string(topMatnrs[t], "item_revision_id", &revId);
+						if (strcmp(revId, bean.revId.c_str()) > 0) {
+							bean.pMantr = topMatnrs[t];
+							bean.revId = revId;
+						}
+					}
+					else {
+						bean.eMantr = topMatnrs[t];
+					}
+				}
+				else {
+					E2PBean bean;
+					bean.key = key;
+					if (strcmp(isPm, "P") == 0) {
+						char* revId;
+						AOM_ask_value_string(topMatnrs[t], "item_revision_id", &revId);
+						bean.pMantr = topMatnrs[t];
+						bean.revId = revId;
+					}
+					else {
+						printf("2\n");
+						bean.eMantr = topMatnrs[t];
+					}
+					wlbmMap[key] = bean;
+				}
+				if (strcmp(isPm, "P") == 0) {
+					isUpdate = true;
+				}
+			}
+			POM_AM__set_application_bypass(true);
+			tag_t dcproxy = findDcUser();
+			//����PBOMԭ���߼�
+			if (!isUpdate && wlbmMap.size() > 0) {
+				printf("wlbmMap.size()===>%d\n", wlbmMap.size());
+				map<string, E2PBean>::iterator it;
+				map<string, E2PBean>::iterator it2;
+				//����ģ��ƥ��
+				tag_t matnrTop = NULLTAG;
+				string keyNum = "";
+				//��һ���������������ƾ���
+				for (it = wlbmMap.begin(); it != wlbmMap.end(); it++) {
+					string s = it->first;
+					keyNum = s;
+					E2PBean tagBean = wlbmMap[s];
+					printf("tagBean.key.c_str()=%s \n", tagBean.key.c_str()); //tagBean.key.c_str()
+					matnrTop = tagBean.eMantr;
+					break;
+				}
+				char* uida;
+				ITK__convert_tag_to_uid(matnrTop, &uida);
+				printf("uida=%s \n", uida);
+				//ֻ��E�����½����߼�
+				(BOM_create_window(&ebom_window));
+				(ITEM_rev_list_bom_view_revs(matnrTop, &bvr_count, &bvr_list));
+				printf("bvr_count=%d \n", bvr_count);
+				if (bvr_count == 0) {
+					errBuff.append("������EBOM����\n");
+				}
+				ITKCALL(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+				printf("����bom��ȡ\n");
+				EBomBean topBean;
+				topBean.eRev = matnrTop;
+				topBean.eBomline = bom_line;
+				//����EBOM��ȡP����
+				vector<EBomBean> beans;
+				//����BOM
+				recyReadEBom(bom_line, topBean, beans, len, matnrTop, errBuff);
+				printf("read end %d\n", beans.size());
+
+				BOM_close_window(ebom_window);
+				//�BOM
+
+				printf("buff %s==>\n", errBuff.c_str());
+				tag_t topPrev = NULLTAG;
+				if (errBuff.empty()) {
+					map<string, tag_t> map;
+
+					int url_num = 0;
+					char** url_vals = NULL;
+					PREF_ask_char_values("database_tc", &url_num, &url_vals);
+					string url = url_vals[0];
+					url.append("/").append(url_vals[2]);
+					printf("url ==> %s \n", url.c_str());
+					if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+					{
+						printf("��ʾ:�м����ݱ�����ʧ��\n");
+						ifail = 1;
+					}
+					for (int t = 0; t < beans.size(); t++) {
+						replaceBom(beans[t], map, len, dcproxy, topPrev);
+					}
+					DisConnServer();
+					for (it2 = wlbmMap.begin(); it2 != wlbmMap.end(); it2++) {
+						string ss = it2->first;
+						tag_t eMantr = wlbmMap[ss].eMantr;
+						if (keyNum.compare(ss) == 0) {
+							continue;
+						}
+						char* newid = NULL;
+						logical isModified = FALSE;
+						tag_t item_type_tag, newRev, newItem;
+						TCTYPE_ask_type("Item", &item_type_tag);
+						ITKCALL(USER_new_item_id(NULLTAG, item_type_tag, &isModified, &newid));
+						/*ITKCALL(NR_next_value("MEProcess", "item_id", NULLTAG, "", "", "",
+							NULLTAG, "", "", &next_id));*/
+						printf("next_id==>%s\n", newid);
+						ITKCALL(ITEM_copy_item(eMantr, newid, NULL, &newItem, &newRev));
+						//ITKCALL(AOM_set_value_string(newRev, "zt2_PMaterial", "PBOM"));
+						char* matnrNo;
+						AOM_ask_value_string(eMantr, "zt2_MaterialNo", &matnrNo);
+						AOM_lock(newRev);
+						AOM_set_value_string(newRev, "zt2_ifpbom", "P");
+						AOM_set_value_string(newRev, "zt2_MaterialNo", matnrNo);
+						AOM_save(newRev);
+						AOM_unlock(newRev);
+						tag_t *structure_revisions,* bom_view_tags, dsuser;
+						int revNum = 0, tagNum=0;
+						AOM_ask_value_tags(eMantr, "TC_Is_Represented_By", &num, &mantrs);
+						//��Ȩ��
+						if (num > 0) {
+							AOM_ask_value_tags(newRev, "structure_revisions", &revNum, &structure_revisions);
+							AOM_ask_value_tags(newRev, "bom_view_tags", &tagNum, &bom_view_tags);
+							AOM_ask_value_tag(mantrs[0], "owning_user", &dsuser);
+							tag_t defGroup;
+							ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+							ITKCALL(AOM_set_ownership(newItem, dsuser, defGroup));
+							ITKCALL(AOM_set_ownership(newRev, dsuser, defGroup));
+							if (revNum > 0) {
+								ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+							}
+							if (tagNum > 0) {
+								ITKCALL(AOM_set_ownership(bom_view_tags[0], dsuser, defGroup));
+							}
+						}
+						//����һ��
+						copyBomLine(topPrev, newRev);
+					}
+				}
+			}
+			else {
+				//�����߼� ����Ebom ����P�ĺʹ�P�� Ŀǰ�����߼��Ƴ�������������
+				tag_t matnrTop = NULLTAG;
+				tag_t pBomTop = NULLTAG;
+				map<string, E2PBean>::iterator it;
+				//��һ���������������ƾ���
+				string keyNum = "";
+				for (it = wlbmMap.begin(); it != wlbmMap.end(); it++) {
+					string s = it->first;
+					keyNum = s;
+					//printf("newRev===>%s\n", tagBean.revId.c_str());
+					E2PBean tagBean = wlbmMap[s];
+					matnrTop = tagBean.eMantr;
+					pBomTop = tagBean.pMantr;
+					//�жϰ汾��ͼ�Ƿ񷢲�����������ˣ�����
+					int structs = 0, statusNum = 0;
+					tag_t *structure_revisions, *release_status_list;
+					AOM_ask_value_tags(pBomTop, "structure_revisions", &structs, &structure_revisions);
+					if (structs > 0) {
+						AOM_ask_value_tags(structure_revisions[0], "release_status_list", &statusNum, &release_status_list);
+						if (statusNum > 0) {
+							tag_t *mantrsAs, dsuser;
+							int revNum;
+							ITEM_copy_rev(pBomTop, NULL, &pBomTop);
+							AOM_ask_value_tags(matnrTop, "TC_Is_Represented_By", &num, &mantrsAs);
+							AOM_ask_value_tag(mantrsAs[0], "owning_user", &dsuser);
+							tag_t defGroup;
+							ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+							ITKCALL(AOM_set_ownership(pBomTop, dsuser, defGroup));
+							if (num > 0) {
+								AOM_ask_value_tags(pBomTop, "structure_revisions", &revNum, &structure_revisions);
+								if (revNum > 0) {
+									ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+								}
+							}
+
+						}
+					}
+					break;
+				}
+				(BOM_create_window(&ebom_window));
+				(ITEM_rev_list_bom_view_revs(matnrTop, &bvr_count, &bvr_list));
+				printf("bvr_count=%d \n", bvr_count);
+				if (bvr_count == 0) {
+					errBuff.append("������EBOM����\n");
+				}
+				ITKCALL(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+				printf("����bom��ȡ\n");
+				EBomUpBean upBean;
+				upBean.bomline = bom_line;
+				updatePbomCycle(bom_line, errBuff, len, upBean);
+				tag_t ebom_window2, *bvr_list2, bom_line2;
+				int bvr_count2 = 0;
+				char* revIdP;
+				
+				(BOM_create_window(&ebom_window2));
+				(ITEM_rev_list_bom_view_revs(pBomTop, &bvr_count2, &bvr_list2));
+				AOM_ask_value_string(pBomTop, "item_revision_id", &revIdP);
+				printf("bvr_count=%d revIdP==>%s \n", bvr_count2, revIdP);
+				if (bvr_count2 == 0) {
+					errBuff.append("������EBOM����\n");
+				}
+				ITKCALL(BOM_set_window_top_line_bvr(ebom_window2, bvr_list2[0], &bom_line2)); //����bom��ȡ
+				//AOM_lock(ebom_window2);
+				int url_num = 0;
+				char** url_vals = NULL;
+				PREF_ask_char_values("database_tc", &url_num, &url_vals);
+				string url = url_vals[0];
+				url.append("/").append(url_vals[2]);
+				printf("url ==> %s \n", url.c_str());
+				if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+				{
+					printf("��ʾ:�м����ݱ�����ʧ��\n");
+					ifail = 1;
+				}
+				startUpdate(upBean, bom_line2, len, dcproxy, ebom_window2);
+				DisConnServer();
+
+				ITKCALL(BOM_save_window(ebom_window2));
+				//ITKCALL(AOM_unlock(ebom_window2));
+				ITKCALL(BOM_close_window(ebom_window2));
+
+				ITKCALL(BOM_close_window(ebom_window));
+				printf("keyNum===>%s\n", keyNum.c_str());
+				map<string, E2PBean>::iterator it2;
+				for (it2 = wlbmMap.begin(); it2 != wlbmMap.end(); it2++) {
+					string ss = it2->first;
+					E2PBean tagBean = wlbmMap[ss];
+					printf("ss===>%s\n", ss.c_str());
+					if (keyNum.compare(ss) == 0) {
+						continue;
+					}
+					tag_t newRev = tagBean.pMantr;
+					printf("newRev===>%s\n", tagBean.revId.c_str());
+					int structs = 0, statusNum = 0;
+					tag_t* structure_revisions, *release_status_list;
+					AOM_ask_value_tags(newRev, "structure_revisions", &structs, &structure_revisions);
+					if (structs > 0) {
+						AOM_ask_value_tags(structure_revisions[0], "release_status_list", &statusNum, &release_status_list);
+						if (statusNum > 0) {
+							int revNum = 0;
+							tag_t *mantrsAs, dsuser;
+							ITKCALL(ITEM_copy_rev(newRev, NULL, &newRev));
+							AOM_ask_value_tags(matnrTop, "TC_Is_Represented_By", &num, &mantrsAs);
+							AOM_ask_value_tag(mantrsAs[0], "owning_user", &dsuser);
+							tag_t defGroup;
+							ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+							ITKCALL(AOM_set_ownership(newRev, dsuser, defGroup));
+							if (num > 0) {
+								AOM_ask_value_tags(newRev, "structure_revisions", &revNum, &structure_revisions);
+								if (revNum > 0) {
+									ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+								}
+							}
+						}
+					}
+					copyBomLine(pBomTop, newRev);
+				}
+			}
+
+			POM_AM__set_application_bypass(false);
+		}
+	}
+	string buff = errBuff;
+	if (buff.empty()) {
+		buff = "succ";
+	}
+	*((char**)returnValue) = (char*)MEM_alloc((strlen(buff.c_str()) + 1) * sizeof(char));
+	tc_strcpy(*((char**)returnValue), buff.c_str());
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/General.cpp b/General/General/General.cpp
new file mode 100644
index 0000000..4fffb63
--- /dev/null
+++ b/General/General/General.cpp
@@ -0,0 +1,6 @@
+// General.cpp : ���� DLL Ӧ�ó���ĵ���������
+//
+
+#include "stdafx.h"
+
+
diff --git a/General/General/General.vcxproj b/General/General/General.vcxproj
new file mode 100644
index 0000000..c880789
--- /dev/null
+++ b/General/General/General.vcxproj
@@ -0,0 +1,235 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" ToolsVersion="15.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <ProjectGuid>{69AF44E1-87DF-4DE6-B996-699B397016E8}</ProjectGuid>
+    <Keyword>Win32Proj</Keyword>
+    <RootNamespace>General</RootNamespace>
+    <ProjectName>General</ProjectName>
+    <WindowsTargetPlatformVersion>10.0.19041.0</WindowsTargetPlatformVersion>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>DynamicLibrary</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v141</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="PropertySheets">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <LinkIncremental>true</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <LinkIncremental>true</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <LinkIncremental>false</LinkIncremental>
+  </PropertyGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <PrecompiledHeader>Use</PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>WIN32;_DEBUG;_WINDOWS;_USRDLL;GENERAL_EXPORTS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <SDLCheck>true</SDLCheck>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <PrecompiledHeader>Use</PrecompiledHeader>
+      <WarningLevel>Level3</WarningLevel>
+      <Optimization>Disabled</Optimization>
+      <PreprocessorDefinitions>WIN32;_DEBUG;_WINDOWS;_USRDLL;GENERAL_EXPORTS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <SDLCheck>true</SDLCheck>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>Use</PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>WIN32;NDEBUG;_WINDOWS;_USRDLL;GENERAL_EXPORTS;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <SDLCheck>true</SDLCheck>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <PrecompiledHeader>NotUsing</PrecompiledHeader>
+      <Optimization>MaxSpeed</Optimization>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;IPLIB=none;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <SDLCheck>false</SDLCheck>
+      <AdditionalIncludeDirectories>D:\curl-7.84.0\curl-7.84.0\builds\libcurl-vc15-x64-release-dll-ipv6-sspi-schannel\include;D:\include13\11\11\include;D:\include13\11\11\include_cpp;D:\dflittk\oci\include;%(AdditionalIncludeDirectories)</AdditionalIncludeDirectories>
+    </ClCompile>
+    <Link>
+      <SubSystem>Windows</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <AdditionalDependencies>D:\include13\11\11\lib\*.lib;%(AdditionalDependencies)</AdditionalDependencies>
+      <AdditionalLibraryDirectories>D:\include13\11\11\lib</AdditionalLibraryDirectories>
+      <IgnoreSpecificDefaultLibraries>libuser_exits.ar.lib</IgnoreSpecificDefaultLibraries>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemGroup>
+    <Text Include="ReadMe.txt" />
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="ado.h" />
+    <ClInclude Include="CheckList.h" />
+    <ClInclude Include="chint_Handler.h" />
+    <ClInclude Include="cJSON.h" />
+    <ClInclude Include="common_itk_util.h" />
+    <ClInclude Include="CRUL_server_call_httpserver.h" />
+    <ClInclude Include="epm_handler_common.h" />
+    <ClInclude Include="epm_register_handler.h" />
+    <ClInclude Include="error_handling.h" />
+    <ClInclude Include="ocilib.h" />
+    <ClInclude Include="Remove_release_Status.h" />
+    <ClInclude Include="stdafx.h" />
+    <ClInclude Include="string_utils.h" />
+    <ClInclude Include="targetver.h" />
+    <ClInclude Include="tc_log.h" />
+    <ClInclude Include="tc_util.h" />
+    <ClInclude Include="util.h" />
+    <ClInclude Include="w2_Clear_Form_PropValue.h" />
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="AddReleaseStatus.cpp" />
+    <ClCompile Include="AddTime.cpp" />
+    <ClCompile Include="ado.cxx" />
+    <ClCompile Include="ApplyMatnrCode.cpp" />
+    <ClCompile Include="AutoFeeding.cpp" />
+    <ClCompile Include="AutomaticRelease.cpp" />
+    <ClCompile Include="CheckList.cpp" />
+    <ClCompile Include="Check_range.cpp" />
+    <ClCompile Include="chintProperty.cpp" />
+    <ClCompile Include="ChintSendMessage.cpp" />
+    <ClCompile Include="chintSignChange.cpp" />
+    <ClCompile Include="chint_add_to_workflow.cpp" />
+    <ClCompile Include="chint_check_exist_ebom.cpp" />
+    <ClCompile Include="CHINT_cossheet_upgrade.cpp" />
+    <ClCompile Include="CHINT_GetFrock.cpp" />
+    <ClCompile Include="CHINT_SendOAMaterial.cpp" />
+    <ClCompile Include="chint_set_prop.cpp" />
+    <ClCompile Include="chint_signoff_dataset.cpp" />
+    <ClCompile Include="cJSON.c" />
+    <ClCompile Include="CloneProcess.cpp" />
+    <ClCompile Include="common_itk_util.c" />
+    <ClCompile Include="connor_sign_pdf.cpp" />
+    <ClCompile Include="CRUL_server_call_httpserver.cpp" />
+    <ClCompile Include="dllmain.cpp">
+      <CompileAsManaged Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">false</CompileAsManaged>
+      <CompileAsManaged Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">false</CompileAsManaged>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+      </PrecompiledHeader>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+      </PrecompiledHeader>
+      <CompileAsManaged Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">false</CompileAsManaged>
+      <CompileAsManaged Condition="'$(Configuration)|$(Platform)'=='Release|x64'">false</CompileAsManaged>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+      </PrecompiledHeader>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+      </PrecompiledHeader>
+    </ClCompile>
+    <ClCompile Include="DtoEBOM2.cpp" />
+    <ClCompile Include="EbomToPMethod.cpp" />
+    <ClCompile Include="epm_register_handler.cpp" />
+    <ClCompile Include="General.cpp" />
+    <ClCompile Include="HXC_create_item_post.cpp" />
+    <ClCompile Include="libGeneral_custom_main.cpp" />
+    <ClCompile Include="Modify_Attributes.cpp" />
+    <ClCompile Include="chintP.cpp" />
+    <ClCompile Include="ocilib.cpp" />
+    <ClCompile Include="Remove_Release_Status.cpp" />
+    <ClCompile Include="SendToPi.cpp" />
+    <ClCompile Include="string_utils.cxx" />
+    <ClCompile Include="tc_util.cpp" />
+    <ClCompile Include="UpdateEtoP.cpp" />
+    <ClCompile Include="UpdateWorkTime.cpp" />
+    <ClCompile Include="w2_Clear_Form_PropValue.cpp" />
+    <ClCompile Include="WX_Check_Property.cxx" />
+    <ClCompile Include="stdafx.cpp">
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">Create</PrecompiledHeader>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">Create</PrecompiledHeader>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">Create</PrecompiledHeader>
+      <PrecompiledHeader Condition="'$(Configuration)|$(Platform)'=='Release|x64'">Create</PrecompiledHeader>
+    </ClCompile>
+  </ItemGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>
\ No newline at end of file
diff --git a/General/General/General.vcxproj.filters b/General/General/General.vcxproj.filters
new file mode 100644
index 0000000..bc08890
--- /dev/null
+++ b/General/General/General.vcxproj.filters
@@ -0,0 +1,210 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="源文件">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+    <Filter Include="头文件">
+      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
+      <Extensions>h;hpp;hxx;hm;inl;inc;xsd</Extensions>
+    </Filter>
+    <Filter Include="资源文件">
+      <UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
+      <Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
+    </Filter>
+    <Filter Include="epm-handler">
+      <UniqueIdentifier>{b9ad1b64-72a3-4d05-b765-ffad84e233c3}</UniqueIdentifier>
+    </Filter>
+    <Filter Include="common">
+      <UniqueIdentifier>{84744647-9762-4536-baad-96572c04ee93}</UniqueIdentifier>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <Text Include="ReadMe.txt" />
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="stdafx.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
+    <ClInclude Include="targetver.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
+    <ClInclude Include="epm_handler_common.h">
+      <Filter>epm-handler</Filter>
+    </ClInclude>
+    <ClInclude Include="epm_register_handler.h">
+      <Filter>epm-handler</Filter>
+    </ClInclude>
+    <ClInclude Include="error_handling.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="Remove_release_Status.h">
+      <Filter>epm-handler</Filter>
+    </ClInclude>
+    <ClInclude Include="string_utils.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="common_itk_util.h">
+      <Filter>epm-handler</Filter>
+    </ClInclude>
+    <ClInclude Include="CheckList.h">
+      <Filter>epm-handler</Filter>
+    </ClInclude>
+    <ClInclude Include="tc_util.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="chint_Handler.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="tc_log.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="util.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="w2_Clear_Form_PropValue.h">
+      <Filter>epm-handler</Filter>
+    </ClInclude>
+    <ClInclude Include="ocilib.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="ado.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
+    <ClInclude Include="CRUL_server_call_httpserver.h">
+      <Filter>common</Filter>
+    </ClInclude>
+    <ClInclude Include="cJSON.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="stdafx.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="General.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="dllmain.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="epm_register_handler.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="WX_Check_Property.cxx">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="libGeneral_custom_main.cpp">
+      <Filter>common</Filter>
+    </ClCompile>
+    <ClCompile Include="Remove_Release_Status.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="AddReleaseStatus.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="AutomaticRelease.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="string_utils.cxx">
+      <Filter>common</Filter>
+    </ClCompile>
+    <ClCompile Include="HXC_create_item_post.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="Modify_Attributes.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="Check_range.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="AddTime.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="CheckList.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="chint_set_prop.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="tc_util.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="ChintSendMessage.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="chintP.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="chintProperty.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="chintSignChange.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="chint_signoff_dataset.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="w2_Clear_Form_PropValue.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="ocilib.cpp">
+      <Filter>epm-handler</Filter>
+    </ClCompile>
+    <ClCompile Include="ado.cxx">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="EbomToPMethod.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="ApplyMatnrCode.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="CloneProcess.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="AutoFeeding.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="connor_sign_pdf.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="SendToPi.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="CRUL_server_call_httpserver.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="chint_add_to_workflow.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="UpdateEtoP.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="DtoEBOM2.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="chint_check_exist_ebom.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="UpdateWorkTime.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="CHINT_cossheet_upgrade.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="CHINT_GetFrock.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="CHINT_SendOAMaterial.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="cJSON.c">
+      <Filter>源文件</Filter>
+    </ClCompile>
+    <ClCompile Include="common_itk_util.c">
+      <Filter>源文件</Filter>
+    </ClCompile>
+  </ItemGroup>
+</Project>
\ No newline at end of file
diff --git a/General/General/HXC_create_item_post.cpp b/General/General/HXC_create_item_post.cpp
new file mode 100644
index 0000000..106a65a
--- /dev/null
+++ b/General/General/HXC_create_item_post.cpp
@@ -0,0 +1,256 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <tccore/item_errors.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include "common_itk_util.h"
+#include <fclasses/tc_date.h>
+#include "string_utils.h"
+#include <tc/folder.h>
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+/*
+ * ����������½����������Ϊ"Hxc8XM"�������ɺ󣬽������͵��ļ�����
+ */
+int HXC_create_item_post(METHOD_message_t* msg , va_list va)
+{
+    fprintf(stdout,"get into post method HXC_create_item_post====================== \n");
+    int ifail = ITK_ok ;
+	char  *object_type=NULL;//����
+	char  *hxc8nianfen=NULL;//���
+	char  *hxc8type=NULL;//��Ŀ����
+	char  localization_status;
+	logical  master  ; 
+    char  new_item_rev_name[ITEM_type_size_c+1] = "";
+	char errorStr[10240] = "\0";
+	string error_string;
+    //	logical istrue = FALSE;
+    const char* item_id = va_arg(va,const char*); 
+    const char* item_name = va_arg(va,const char*);
+    const char* item_type = va_arg(va,const char*);
+    const char* rev_id = va_arg(va,const char*);
+    tag_t* item_tag = va_arg(va,tag_t*);
+	cout<<"item_type------"<<item_type<<endl;
+	//�Զ������һ��
+	if(strcmp(item_type,"Hxc8XM")!=0)
+	{
+		return  ifail;
+	}
+   // tag_t* rev_tag = va_arg(va,tag_t*);
+	char * name=NULL;
+	ITKCALL(AOM_ask_value_string(*item_tag,"object_name",&name));
+	cout<<"name------------------------>"<<name<<endl;
+	//��ñ��ػ�������ֵ  object_type�����ͣ� hxc8nianfen����ݣ� hxc8type����Ŀ���ͣ�
+//	ITKCALL(ifail = AOM_UIF_ask_localized_value_string(* item_tag,"object_type","zh_CN",&object_type,&localization_status,&master));//��Ŀ�ȼ�LOV
+	ITKCALL(ifail = AOM_UIF_ask_localized_value_string(* item_tag,"hxc8nianfen","zh_CN",&hxc8nianfen,&localization_status,&master));//ninfen
+	ITKCALL(ifail = AOM_UIF_ask_localized_value_string(* item_tag,"hxc8type","zh_CN",&hxc8type,&localization_status,&master));//��Ŀ�ȼ�LOV
+	
+	ITKCALL(ifail = AOM_ask_value_string(* item_tag,"hxc8nianfen",&hxc8nianfen));//ninfen
+	ITKCALL(ifail = AOM_ask_value_string(* item_tag,"hxc8type",&hxc8type));//ninfen
+	cout<<"hxc8nianfen------------------>"<<hxc8nianfen<<endl;
+	cout<<"hxc8type------------------>"<<hxc8type<<endl;
+
+	string depart=hxc8type;
+	string year=hxc8nianfen;
+	char** entries;
+	char** values;
+	
+    if(*item_tag != NULLTAG && strcmp(item_type,"Hxc8XM")==0){
+		int count = 0 ,entry_count = 0,status = 0,num_found=0;
+		char ** values_list = NULL ;//** values = NULL, ** entries = NULL;
+
+		tag_t query_tag = NULLTAG ,*results = NULL;
+		
+		//������
+		ITKCALL(QRY_find("����...",&query_tag));
+		if(query_tag==NULLTAG)
+		{
+			printf("û�ҵ� [%s]��ѯ��������\n","����.." );
+			return 0;
+		}
+		printf("�ҵ� [%s]��ѯ��������\n","����.." );
+		
+		ITKCALL(QRY_find_user_entries(query_tag,&entry_count,&entries,&values));//entries����ѯ��������ʽ��values����ѯ����ֵ��MEM_free�ͷţ�
+	if(entry_count==0)
+	{
+		cout<<"��ѯ��������û�����ò�ѯ������"<<endl;
+		ITK_exit_module(1);
+		if(entries!=NULL){
+			MEM_free(entries);
+			entries= NULL;
+		}
+		if(values!=NULL){
+			MEM_free(values);
+			values= NULL;
+		}
+		return 0;
+	}
+	for(int n=0;n<entry_count;n++)
+		{
+		cout<<"��ѯ��������"<<endl;	
+		printf("entries[%d]=%s\n",n,entries[n]);
+
+			printf("values[%d]=%s\n",n,values[n]);
+
+		}
+
+			char *other_values[2] ;
+			char *other_entrys[2] ;
+			other_values[0]= (char*)calloc(48,sizeof(char));
+			other_values[1]= (char*)calloc(48,sizeof(char));
+			other_entrys[0] = (char*)calloc(48,sizeof(char));
+			other_entrys[1] = (char*)calloc(48,sizeof(char));
+			tc_strcpy(other_entrys[0],"����");
+			tc_strcpy(other_entrys[1],"����");
+			tc_strcpy(other_values[0],"��Э����Ŀ�ļ���");
+			tc_strcpy(other_values[1],"��Э����Ŀ��");
+//			printf("ִ�в�ѯ[%s][%s]\n",other_entrys[0],other_values[0]);
+			ITKCALL(status = QRY_execute(query_tag,2,other_entrys,other_values,&num_found,&results));
+			printf("ִ�в�ѯ���[%d]\n",status);
+			free(other_values[0]);
+			free(other_values[1]);
+			free(other_entrys[0]);
+			free(other_entrys[1]);
+			//printf("11111111111111\n");
+			if(status !=ITK_ok){
+				char * message =NULL;
+				EMH_ask_error_text(status, &message);
+				printf("��ѯ�쳣 : \"%d\",\"%s\"\n",status,message);
+				MEM_free(message);
+				message =NULL;
+				return 0;
+			}
+			
+		int counnt1=0;
+		int counnt2=0;
+		tag_t * folders1=NULLTAG;
+		tag_t * folders2=NULLTAG;
+		char * name0=NULL;
+		char * name1=NULL;
+		char * name2=NULL;
+		cout<<"00000000000000000"<<endl;
+		for(int j =0;j < num_found;j++){
+			//��¼������Ϣ
+			cout<<"111111111111111"<<endl;
+			tag_t  folder=NULLTAG;
+			folder=results[j];
+//			ITKCALL(status=AOM_ask_value_string(folder,"object_name",&name0));
+//			if(strcmp(type.c_str(),name0)==0)
+//			{
+				AOM_ask_value_tags(folder,"contents",&counnt1,&folders1);
+
+				for (int q=0;q<counnt1;q++)
+				{
+					cout<<"22222222222222222222"<<endl;
+					ITKCALL(status=AOM_ask_value_string(folders1[q],"object_name",&name1));
+					if(strcmp(depart.c_str(),name1)==0)
+					{
+						ITKCALL(status=AOM_ask_value_tags(folders1[q],"contents",&counnt2,&folders2));
+						for (int w=0;w<counnt2;w++)
+						{
+							cout<<"33333333333333"<<endl;
+							ITKCALL(status=AOM_ask_value_string(folders2[w],"object_name",&name2));
+							cout<<"name2"<<endl;
+							if(strcmp(year.c_str(),name2)==0)
+							{
+								cout<<"444444444444444444444"<<endl;
+								POM_AM__set_application_bypass(true);
+								ITKCALL(status=(FL_insert(folders2[w],*item_tag,999)));
+								//����
+								ITKCALL(status=AOM_save(folders2[w]));
+								POM_AM__set_application_bypass(false);
+							}
+						}
+
+					}
+				}
+//			}
+
+
+
+			if(results!=NULL){
+				MEM_free(results);
+				results =NULL;
+			}
+
+		}
+		if(folders1!=NULL){
+			MEM_free(folders1);
+			folders1 =NULL;
+		}
+		if(folders2!=NULL){
+			MEM_free(folders2);
+			folders2 =NULL;
+		}	
+		if(name0!=NULL){
+			MEM_free(name0);
+			name0 =NULL;
+		}
+		if(name1!=NULL){
+			MEM_free(name1);
+			name1 =NULL;
+		}
+		if(name2!=NULL){
+			MEM_free(name2);
+			name2 =NULL;
+		}
+		if(object_type!=NULL){
+			MEM_free(object_type);
+			object_type =NULL;
+		}
+		if(hxc8nianfen!=NULL){
+			MEM_free(hxc8nianfen);
+			hxc8nianfen =NULL;
+		}
+		if(hxc8type!=NULL){
+			MEM_free(hxc8type);
+			hxc8type =NULL;
+		}
+
+
+		//�ͷ�����
+		
+		if(values_list!=NULL){
+			for(int i = 0 ;i < count;i++){
+				if(values_list[i]!=NULL){
+					MEM_free(values_list[i]);
+					values_list[i] = NULL;
+				}
+			}
+			MEM_free(values_list);
+			values_list =NULL;	
+		}
+    }
+	if(ITEM_unable_to_create == ifail){
+		//	���Ӵ�����Ϣ
+		EMH_store_error_s1(EMH_severity_user_error,ERROR_QRY_NOT_FOUND,error_string.c_str());
+		error_string.clear();
+	}
+    	
+    
+    return ifail;
+}
diff --git a/General/General/Modify_Attributes.cpp b/General/General/Modify_Attributes.cpp
new file mode 100644
index 0000000..840e995
--- /dev/null
+++ b/General/General/Modify_Attributes.cpp
@@ -0,0 +1,255 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+using namespace libxl;
+typedef struct{
+	string ITEM_ID;//id��
+}PROPERTY_STRUCT;
+string wsTos(const std::wstring& wstr)
+{
+	
+	if (wstr.empty()||wstr.length()==0) return std::string();
+	int size_needed = WideCharToMultiByte(CP_ACP, 0, &wstr[0], (int)wstr.size(), NULL, 0, NULL, NULL);
+	std::string strTo(size_needed, 0);
+	WideCharToMultiByte(CP_ACP, 0, &wstr[0], (int)wstr.size(), &strTo[0], size_needed, NULL, NULL);
+	return strTo;
+}
+
+int search(string item_id,string rev,string object_name)
+{
+	char** entries;
+	char** values;
+	int count = 0 ,entry_count = 0,status = 0,num_found=0;
+	char ** values_list = NULL ;//** values = NULL, ** entries = NULL;
+	tag_t query_tag = NULLTAG ,*results = NULL;
+
+	//������
+	ITKCALL(QRY_find("������汾...",&query_tag));
+	if(query_tag==NULLTAG)
+	{
+		printf("û�ҵ� [%s]��ѯ��������\n","������汾..." );
+		return 0;
+	}
+	printf("�ҵ� [%s]��ѯ��������\n","������汾..." );
+
+	ITKCALL(QRY_find_user_entries(query_tag,&entry_count,&entries,&values));//entries����ѯ��������ʽ��values����ѯ����ֵ��MEM_free�ͷţ�
+	if(entry_count==0)
+	{
+		cout<<"��ѯ��������û�����ò�ѯ������"<<endl;
+		ITK_exit_module(1);
+		if(entries!=NULL){
+			MEM_free(entries);
+			entries= NULL;
+		}
+		if(values!=NULL){
+			MEM_free(values);
+			values= NULL;
+		}
+		return 0;
+	}
+	for(int n=0;n<entry_count;n++)
+	{
+//		cout<<"��ѯ��������"<<endl;	
+//		printf("entries[%d]=%s\n",n,entries[n]);
+//
+//		printf("values[%d]=%s\n",n,values[n]);
+
+	}
+
+	char *other_values[2] ;
+	char *other_entrys[2] ;
+	other_values[0]= (char*)calloc(48,sizeof(char));
+	other_values[1]= (char*)calloc(48,sizeof(char));
+	other_entrys[0] = (char*)calloc(48,sizeof(char));
+	other_entrys[1] = (char*)calloc(48,sizeof(char));
+	tc_strcpy(other_entrys[0],"����� ID");
+	tc_strcpy(other_entrys[1],"�汾");
+
+	tc_strcpy(other_values[0],item_id.c_str());
+	tc_strcpy(other_values[1],rev.c_str());
+	//			printf("ִ�в�ѯ[%s][%s]\n",other_entrys[0],other_values[0]);
+	ITKCALL(status = QRY_execute(query_tag,2,other_entrys,other_values,&num_found,&results));
+	printf("ִ�в�ѯ���[%d]\n",status);
+	printf("��ѯ������%d��",num_found);
+	free(other_values[0]);
+	free(other_values[1]);
+	free(other_entrys[0]);
+	free(other_entrys[1]);
+	if(status !=ITK_ok){
+		char * message =NULL;
+		EMH_ask_error_text(status, &message);
+		printf("��ѯ�쳣 : \"%d\",\"%s\"\n",status,message);
+		MEM_free(message);
+		message =NULL;
+		return 0;
+	}
+	for(int n=0;n<num_found;n++)
+	{
+		cout<<"------>modify"<<endl;
+		tag_t obj=results[n];
+		ITKCALL(status=AOM_load(obj));
+		ITKCALL(status=AOM_lock(obj));
+		ITKCALL(status=AOM_refresh(obj,1));
+		POM_AM__set_application_bypass(true);
+		ITKCALL(AOM_set_value_string(obj,"object_name",object_name.c_str()));
+		POM_AM__set_application_bypass(false);
+		ITKCALL(status=(AOM_save(obj)));  
+		ITKCALL(status=(AOM_refresh(obj,0)));  
+		ITKCALL(status=(AOM_unlock(obj)));  
+	}
+	return 0;
+}
+
+/*
+ * ���ذ汾���ӹ�ϵ�µ����ݼ���xls�͵ı��񣬶�ȡ�������ݣ�Ȼ���޸İ汾��object_name
+ */
+int Modify_Attributes(EPM_rule_message_t msg)
+{
+	Book* book = nullptr;
+	book = xlCreateBook();//xls�ļ���xlCreateBook() �����򿪣�xlsx�ļ���xml�ṹ�����Ե���xlCreateXMLBook() �������򿪡�
+	book->setKey(L"Halil Kural", L"windows-2723210a07c4e90162b26966a8jcdboe");//��������˸ÿ⣬��������Ӧ��key����û�й�����������
+	EPM_decision_t decision = EPM_go;
+	int ifail = ITK_ok, arg_cnt = 0, i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	char * object_TYPE_1 = NULL;
+	char * object_string = NULL;
+	string value_type = "";
+	string value_property="";
+	
+	//��ȡ��ǰ����������
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+	ifail = EPM_ask_root_task(task_tag, &rootTask_tag);
+	//��ȡĿ�����ö���
+	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments);
+	//ѭ��Ŀ�����
+	for (i = 0; i < att_cnt; i++) {
+	//�������ݼ�
+		tag_t rev_tag=attachments[i];
+		AOM_ask_value_string(rev_tag,"object_type",&object_TYPE_1);
+		cout<<object_TYPE_1<<endl;
+	
+			cout<<"111111111111111111"<<endl;
+			tag_t relation_type_tag = NULLTAG;
+			ifail = GRM_find_relation_type("TC_Attaches", &relation_type_tag);
+			if (ifail != ITK_ok) { /* your error logic here */ }
+			   int n_specs = 0;
+			tag_t* specs = NULL;
+
+			ITKCALL(ifail = GRM_list_secondary_objects_only(rev_tag, relation_type_tag, &n_specs, &specs));
+			if (ifail != ITK_ok) { /* your error logic here */ }
+			for (int j = 0; j < n_specs; j++)
+			{
+				cout<<"2222222222222"<<endl;
+				 tag_t type_tag = NULLTAG; char type_name[TCTYPE_name_size_c+1] = "";
+				ifail = TCTYPE_ask_object_type (specs[j], &type_tag);
+				if (ifail != ITK_ok) { /* your error logic here */ }
+
+				ifail = TCTYPE_ask_name(type_tag, type_name);
+				if (ifail != ITK_ok) { /* your error logic here */ }
+				cout<<"type_name-----------"<<type_name<<endl;
+				if (strcmp(type_name, "MSExcel") == 0||strcmp(type_name, "MSExcelX") == 0)
+				{
+					cout<<"333333333333333"<<endl;
+					int n_refs = 0;
+					tag_t* refs = NULL;
+
+					ITKCALL(ifail = AE_ask_all_dataset_named_refs(specs[j], "excel", &n_refs, &refs));
+					if (ifail != ITK_ok) { /* your error logic here */ }
+
+					ITKCALL(ifail = AE_export_named_ref(specs[j], "excel", "D:\\TEMP\\Ctest.xls"));
+					if (ifail != ITK_ok) { /* your error logic here */ }
+					//����Ƿ���ڵ�Ԫ������Ϊ��xxxx��
+					wstringstream excel_path;
+					excel_path<<"D:\\TEMP\\Ctest.xls";
+					if (book->load(excel_path.str().c_str()))//��֧�������ַ����Ƶ��ļ�����
+					{
+						cout<<"88888888"<<endl;
+						Sheet* sheet = book->getSheet(0);//��õ�1��sheetҳ
+						for(int k=1;k<2001;k++)
+						{
+							cout<<k<<endl;
+							string itemid_val ;
+							string rev_value;
+							string name_value;
+							itemid_val = wsTos(sheet->readStr(k, 0));
+							rev_value=wsTos(sheet->readStr(k, 1));
+							name_value=wsTos(sheet->readStr(k, 2));
+							printf("id:%s\n", itemid_val.c_str());
+							printf("�汾:%s\n", rev_value.c_str());
+							printf("����:%s\n", name_value.c_str());
+							//��ѯ��������ѯ���ϰ汾���޸�
+							search(itemid_val,rev_value,name_value);
+							
+						}
+
+					
+							
+					}
+				}
+			}
+
+	
+		
+		
+	}
+	if (attachments != NULL)
+	{
+		MEM_free(attachments);
+		attachments = NULL;
+	}
+	if (object_TYPE_1 != NULL)
+	{
+		MEM_free(object_TYPE_1);
+		object_TYPE_1 = NULL;
+	}
+	if (object_string != NULL)
+	{
+		MEM_free(object_string);
+		object_string = NULL;
+	}
+	 time_t t;
+    struct tm * lt;
+    time (&t);//��ȡUnixʱ�����
+    lt = localtime (&t);//תΪʱ��ṹ��
+    printf ( "%d/%d/%d %d:%d:%d\n",lt->tm_year+1900, lt->tm_mon, lt->tm_mday, lt->tm_hour, lt->tm_min, lt->tm_sec);//������
+	return EPM_nogo;
+	
+		
+	}
+
diff --git a/General/General/ReadMe.txt b/General/General/ReadMe.txt
new file mode 100644
index 0000000..f37d330
--- /dev/null
+++ b/General/General/ReadMe.txt
@@ -0,0 +1,32 @@
+========================================================================
+    动态链接库：General 项目概述
+========================================================================
+
+应用程序向导已为您创建了此 General DLL。
+
+本文件概要介绍组成 General 应用程序的每个文件的内容。
+
+
+General.vcxproj
+    这是使用应用程序向导生成的 VC++ 项目的主项目文件，其中包含生成该文件的 Visual C++ 的版本信息，以及有关使用应用程序向导选择的平台、配置和项目功能的信息。
+
+General.vcxproj.filters
+    这是使用“应用程序向导”生成的 VC++ 项目筛选器文件。它包含有关项目文件与筛选器之间的关联信息。在 IDE 中，通过这种关联，在特定节点下以分组形式显示具有相似扩展名的文件。例如，“.cpp”文件与“源文件”筛选器关联。
+
+General.cpp
+    这是主 DLL 源文件。
+
+	此 DLL 在创建时不导出任何符号。因此，生成时不会产生 .lib 文件。如果希望此项目成为其他某个项目的项目依赖项，则需要添加代码以从 DLL 导出某些符号，以便产生一个导出库，或者，也可以在项目“属性页”对话框中的“链接器”文件夹中，将“常规”属性页上的“忽略输入库”属性设置为“是”。
+
+/////////////////////////////////////////////////////////////////////////////
+其他标准文件:
+
+StdAfx.h, StdAfx.cpp
+    这些文件用于生成名为 General.pch 的预编译头 (PCH) 文件和名为 StdAfx.obj 的预编译类型文件。
+
+/////////////////////////////////////////////////////////////////////////////
+其他注释:
+
+应用程序向导使用“TODO:”注释来指示应添加或自定义的源代码部分。
+
+/////////////////////////////////////////////////////////////////////////////
diff --git a/General/General/Remove_Release_Status.cpp b/General/General/Remove_Release_Status.cpp
new file mode 100644
index 0000000..95868ed
--- /dev/null
+++ b/General/General/Remove_Release_Status.cpp
@@ -0,0 +1,233 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <epm/epm_task_template_itk.h>
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include "error_handling.h"
+#include "Remove_Release_Status.h"
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+
+int Remove_Release_Status(EPM_action_message_t msg)
+{
+	cout<<"ɾ������״̬"<<endl;
+
+	int ifail = ITK_ok,  i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	tag_t *release_status=NULL;int rs_num=0;
+	char *value=NULL;
+	tag_t *targets=NULLTAG;
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+	vector<tag_t>	target_vec;
+	ITKCALL(	ifail = EPM_ask_root_task(task_tag, &rootTask_tag));
+	//��ȡĿ�����ö���
+	ITKCALL(	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments));
+	//ѭ��Ŀ�����	
+	for (int i=0;i<att_cnt;i++)
+	{
+		//			ifail = AOM_ask_value_tags(attachments[i],"release_status_list",&rs_num,&release_status);
+//		ITKCALL(ifail =AOM_ask_value_string(attachments[i],"object_string",&value));
+	
+//		target_vec.push_back(attachments[i]);
+			int num1=0;
+			ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"revision_list",&num1,&targets));
+				for (int s=0;s<num1;s++)
+				{
+						target_vec.push_back(targets[s]);
+				}
+//		cout<<value<<endl;
+//		ITKCALL(ifail=CR_ask_release_statuses(attachments[i],&rs_num,&release_status));
+//			ITKCALL(ifail=WSOM_ask_release_status_list(attachments[i],&rs_num,&release_status));
+//			
+//		cout<<"rs_num--------"<<rs_num<<endl;
+//		WSOM_status_ask_effectivities()
+//		for (int j=0;j<rs_num;j++)
+//		{
+//			ITKCALL(ifail =AOM_ask_value_string(release_status[j],"object_name",&value));
+//			int num1=0;
+//			ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"revision_list",&num1,&targets));
+//				for (int s=0;s<num1;s++)
+//				{
+//						target_vec.push_back(targets[s]);
+//				}
+//
+//
+//
+////			cout<<"object_name"<<value<<endl;
+////			if(strcmp(value,"TCM Released")==0)
+////			{
+////				cout<<""<<"bon"<<endl;
+////				POM_AM__set_application_bypass(true);
+//////				ifail=EPM_remove_status_from_targets(release_status[j],rootTask_tag);//ֻ��ɾ���������״̬
+////				ITKCALL(ifail=EPM_remove_status_from_targets(release_status[j],attachments[i]));
+////				ITKCALL(ifail=AOM_ask_value_tags(attachments[i],"revision_list",&num1,&targets));
+////				for (int s=0;s<num1;s++)
+////				{
+////					ITKCALL(ifail=EPM_remove_status_from_targets(release_status[j],targets[s]));
+////				}
+////				POM_AM__set_application_bypass(false);
+////			}
+//			
+//
+//
+//
+////			cout<<"object_name"<<value<<endl;
+////			if(strcmp(value,"TCM Released")==0)
+////			{
+////				//����·
+////				POM_AM__set_application_bypass(true);
+////				ITKCALL(ifail=EPM_remove_release_status(attachments[i],release_status[j]));
+////				//					ifail = AOM_set_value_tags(attachments[i],"release_status_list",0,NULL);//ɾ��������ʾ���ԡ�����״̬�������޸�
+////				POM_AM__set_application_bypass(false);
+////				cout<<"ɾ�����"<<endl;
+////				//					break;
+////			}
+//		}
+
+	}
+	POM_AM__set_application_bypass(true);
+//	removeReleaseStatus("ɾ��״̬����",target_vec);
+	removeReleaseStatusByName("TCM Released",rootTask_tag,target_vec);
+	removeRevFromTask(rootTask_tag,target_vec);
+	POM_AM__set_application_bypass(false);
+	if (value != NULL)
+	{
+		MEM_free(value);
+		value = NULL;
+	}
+	if (attachments != NULL)
+	{
+		MEM_free(attachments);
+		attachments = NULL;
+	}
+	if (release_status != NULL)
+	{
+		MEM_free(release_status);
+		release_status = NULL;
+	}
+	if (targets != NULL)
+	{
+		MEM_free(targets);
+		targets = NULL;
+	}
+	return ifail;
+}
+
+
+
+void removeReleaseStatus(string process_name,vector<tag_t> wf_it){
+	if(wf_it.size()<1){
+		return ;
+	}
+	
+	tag_t template_tag =NULLTAG,new_process=NULLTAG;
+	tag_t * attachments = NULL;
+	int *att_types=NULL;
+	att_types = (int*) MEM_alloc (sizeof(int) * ( wf_it.size() ));
+	attachments = (tag_t*) MEM_alloc (sizeof(tag_t) * ( wf_it.size() ));
+	for ( int indx = 0; indx < wf_it.size(); indx++ )
+	{
+		att_types[indx] = EPM_target_attachment;//EPM_reference_attachment;
+		attachments[indx] = wf_it[indx];
+	}
+	
+	ITKCALL( EPM_find_template( process_name.c_str(),PROCESS_TEMPLATE, &template_tag ) );
+	if( template_tag != NULLTAG )
+	{
+		ITKCALL( EPM_create_process(process_name.c_str(), "", template_tag, wf_it.size(), attachments, att_types, &new_process));
+	}
+	if(att_types)										
+	{											
+		MEM_free(att_types);							
+		att_types = NULL;								
+	}
+	if(attachments)										
+	{											
+		MEM_free(attachments);							
+		attachments = NULL;								
+	}
+}
+void removeReleaseStatusByName(string statusName,tag_t rootTask){
+	tag_t release_status =NULLTAG;
+	ITKCALL(CR_create_release_status(statusName.c_str(),&release_status));
+	if(release_status!=NULLTAG){
+		ITKCALL(EPM_remove_status_from_targets(release_status,rootTask));
+	}
+}
+
+void removeReleaseStatusByName(string statusName,tag_t rootTask,vector<tag_t> revVec){
+	tag_t release_status =NULLTAG;
+	tag_t * attachments = NULL;
+	int *att_types=NULL;
+	att_types = (int*) MEM_alloc (sizeof(int) * ( revVec.size() ));
+	attachments = (tag_t*) MEM_alloc (sizeof(tag_t) * ( revVec.size() ));
+	//�ƶ�Ŀ�꣬����ת��
+	for ( int indx = 0; indx < revVec.size(); indx++ )
+	{
+		att_types[indx] = EPM_target_attachment;//EPM_reference_attachment;
+		attachments[indx] = revVec[indx];
+	}
+	//�����еİ汾�����ӵ�������
+	ITKCALL(EPM_add_attachments(rootTask,revVec.size(),attachments,att_types));
+	ITKCALL(CR_create_release_status(statusName.c_str(),&release_status));
+	if(release_status!=NULLTAG){
+		ITKCALL(EPM_remove_status_from_targets(release_status,rootTask));
+	}
+	if(att_types)										
+	{											
+		MEM_free(att_types);							
+		att_types = NULL;								
+	}
+	if(attachments)										
+	{											
+		MEM_free(attachments);							
+		attachments = NULL;								
+	}
+
+}
+
+void removeRevFromTask(tag_t rootTask,vector<tag_t> revVec){
+	cout<<"enter  removeRevFromTask "<<endl;
+	tag_t * attachments = NULL;
+	
+	attachments = (tag_t*) MEM_alloc (sizeof(tag_t) * ( revVec.size() ));
+	//�ƶ�Ŀ�꣬����ת��
+	for ( int indx = 0; indx < revVec.size(); indx++ )
+	{
+		//att_types[indx] = EPM_target_attachment;//EPM_reference_attachment;
+		attachments[indx] = revVec[indx];
+	}
+	cout<<"mark1"<<endl;
+	AOM_refresh(rootTask,0);
+	ITKCALL(EPM_remove_attachments(rootTask,revVec.size(),attachments));
+		cout<<"mark2"<<endl;
+	if(attachments)										
+	{											
+		MEM_free(attachments);							
+		attachments = NULL;								
+	}
+}
\ No newline at end of file
diff --git a/General/General/Remove_release_Status.h b/General/General/Remove_release_Status.h
new file mode 100644
index 0000000..c65716d
--- /dev/null
+++ b/General/General/Remove_release_Status.h
@@ -0,0 +1,47 @@
+#include <ict/ict_userservice.h>
+#include <tccore/item.h>
+#include <ae/ae.h>
+#include <tc/folder.h>
+#include <tccore/aom.h>
+#include <pom/pom/pom.h>
+#include <sa/sa.h>
+#include <tccore/aom_prop.h>
+#include <property/prop_errors.h>
+#include <tccore/workspaceobject.h>
+#include <tc/preferences.h>
+#include <tccore/imantype.h>
+#include <tccore//grm.h>
+#include <tccore/grmtype.h>
+#include <sa/am.h>
+#include <cfm/cfm.h>
+#include <bom/bom.h>
+#include <tccore/uom.h>
+#include <ps/ps.h>
+#include <epm/signoff.h>
+#include <epm/epm_task_template_itk.h>
+#include <fclasses/tc_date.h>
+#include <tcinit/tcinit.h>
+#include <ics/ics.h>
+#include <ics/ics2.h>
+#include <pom/enq/enq.h>
+#include <rdv/arch.h>
+#include <tc/envelope.h>
+#include <epm/distributionlist.h>
+#include <sa/user.h>
+#include <time.h>
+#include <string>
+#include <vector>
+#include <map>
+#include <fstream>
+#include <iostream>
+#include <algorithm>
+#include <io.h>
+#include <direct.h>
+using namespace std;
+
+
+
+void removeReleaseStatus(string process_name,vector<tag_t> wf_it);
+void removeReleaseStatusByName(string statusName,tag_t rootTask);
+void removeReleaseStatusByName(string statusName,tag_t rootTask,vector<tag_t> revVec);
+void removeRevFromTask(tag_t rootTask,vector<tag_t> revVec);
\ No newline at end of file
diff --git a/General/General/SendToPi.cpp b/General/General/SendToPi.cpp
new file mode 100644
index 0000000..8ab9b53
--- /dev/null
+++ b/General/General/SendToPi.cpp
@@ -0,0 +1,89 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+//#include ""
+#include "CRUL_server_call_httpserver.h"
+using namespace std;
+
+//http://localhost:8080/api/open/task/modStatus/{{taskUid}}
+int chint_updateToPi(EPM_action_message_t msg) {
+	int ifail = ITK_ok;
+
+	//���̽ڵ����
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0,occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+
+	current_task = msg.task;
+	ECHO("=========================================================\n");
+	ECHO("chint_updateToPi ��ʼִ��\n");
+	ECHO("=========================================================\n");
+
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	int url_num;
+	char **url_vals;
+	PREF_ask_char_values("CHINT_PIUrl", &url_num, &url_vals);
+	string url = "";
+	if (url_num > 0) {
+		url.append(url_vals[0]).append("/api/open/task/modStatus/");
+	}
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		//ITKCALL(TCTYPE_ask_object_type(taskAttches[count], &type_tag));
+		char *type,*piUid;
+		tag_t taskTag = taskAttches[count];
+		AOM_ask_value_string(taskTag,"object_type",&type);
+		if (strcmp(type, "ZT2_YPTask") == 0) {
+			AOM_ask_value_string(taskTag,"zt2_YPUID",&piUid);
+			url.append(piUid);
+			printf("url===>%s\n", url.c_str());
+			string result = callHttpGet(url);
+		}
+	}
+
+	return ifail;
+}
+
+
diff --git a/General/General/UpdateEtoP.cpp b/General/General/UpdateEtoP.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/General/General/UpdateWorkTime.cpp b/General/General/UpdateWorkTime.cpp
new file mode 100644
index 0000000..a7e1039
--- /dev/null
+++ b/General/General/UpdateWorkTime.cpp
@@ -0,0 +1,543 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ocilib.h"
+#include <cfm/cfm.h>
+#include <me/me.h>
+#include <property/nr.h>
+#include <tccore/aom.h>
+#include <tccore/item.h>
+#include <tccore/workspaceobject.h>
+using namespace std;
+
+typedef struct {
+	string cpxh;//��Ʒ�ͺ� �͡��С��ߡ�������
+	string dyxq;
+	string zyxq;
+	string gyxq;
+	string tyxq;
+	string wyxq;
+}ByqBean2;
+typedef struct {
+	string rgsj;//��Ʒ�ͺ� �͡��С��ߡ�������
+	string jqsj;
+	string zbsj;
+	string zrsczq;
+}TimeBean2;
+typedef struct {
+	string temGxCode;
+	string temGxName;
+
+}TemGxBean2;
+//��ȡ�������� �ж��Ƿ�����
+string getClassVal2(tag_t top_rev_tag, string& errMessage, ByqBean2 &bean) {
+	//, string className
+	tag_t top_classificationObject, item;
+	ITKCALL(ITEM_ask_item_of_rev(top_rev_tag, &item));
+	ICS_ask_classification_object(item, &top_classificationObject);
+	if (top_classificationObject == NULL_TAG)
+	{
+		errMessage.append("�������û�з��͵�����\n");
+		return  "";
+	}
+	char* top_class_id = NULL, *top_class_name = NULL;
+	//ICS_ask_class_of_classification_obj(top_classificationObject, &top_class_tag);
+	//ICS_ask_id_name(top_class_tag, &top_class_id, &top_class_name);
+	printf("BOM TOP LINE CLASS ID = %s | NAME = %s \n", top_class_id, top_class_name);
+	int n_attrs;
+	char** attr_names;
+	char** attr_vals;
+	ITKCALL(ICS_ask_attributes_of_classification_obj(top_classificationObject, &n_attrs, &attr_names, &attr_vals));
+	cout << n_attrs << endl;
+	//	int num = 1;
+	string cpxh;
+	for (int ii = 0; ii < n_attrs; ii++)
+	{
+		if (strcmp(attr_names[ii], "��Ʒ�ͺ�") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				errMessage.append("�������Բ�Ʒ�ͺ�Ϊ�գ����顣\n");
+				//return "";
+			}
+			else {
+				cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("�������Ե�ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.dyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("����������ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.zyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("�������Ը�ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.gyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//errMessage.append("�������Ե�ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.tyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		else if (strcmp(attr_names[ii], "��ѹ��Ȧ���߷�ʽ") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				//	errMessage.append("����������ѹ��Ȧ���߷�ʽΪ�գ����顣\n");
+				//return "";
+			}
+			else {
+				bean.wyxq = attr_vals[ii];//cpxh = (attr_vals[ii]);
+			}
+			//break;
+		}
+		//��������
+		cout << attr_names[ii] << "\t"
+			<< attr_vals[ii] << endl;
+	}
+	return cpxh;
+}
+//ʵ������BOM����
+boolean isXnj(tag_t matnr) {
+	int cnt2, numFac, cnt3;
+	boolean flag = false;
+	char** procureType, ** factorys, ** specialProcureType;
+	AOM_ask_value_strings(matnr, "zt2_SZSpecialProcuretype", &cnt3, &specialProcureType); //Ϊ/
+	AOM_ask_value_strings(matnr, "zt2_SZProcuretype", &cnt2, &procureType); //��������
+	AOM_ask_value_strings(matnr, "zt2_SZFactory", &numFac, &factorys);
+	for (int i = 0; i < numFac; i++) {
+		if (strcmp(factorys[i], "M060") == 0 && cnt2 > i && cnt3 > i) {
+			if (strstr(procureType[i], "����") != NULL && strcmp(specialProcureType[i], "/") == 0) {
+				flag = true;
+			}
+		}
+	}
+	return flag;
+}
+string sqlGyRule2 = "select GYID from \"CHINT_WORKHOUR_WhGYRule\" where \"ProductZu\" = '%s' and \"TuHao\" = '%s' and COMPANYCODE ='M060'";
+string sqlCpxh2 = "SELECT \"ProductZu\" FROM \"CHINT_WORKHOUR_WhProductXH\" where \"ProductXH\" = '%s' and COMPANYCODE ='M060'";
+string sqlGxTime2Nor = "select GXCODE,ARTIFICIALTIME,MACHINETIME,READINESSTIME,\"ProCycle\" from CHINT_WORKHOUR where \"PRODUCTXH\" = '%s' and GYID = '%s' and COMPANYCODE ='M060'";
+string sqlGxTime2Xq = "select GXCODE,ARTIFICIALTIME,MACHINETIME,READINESSTIME,\"ProCycle\" from CHINT_WORKHOUR where \"PRODUCTXH\" = '%s' and GYID = '%s' and JSASK = '%s' and COMPANYCODE ='M060'";
+
+void getGxbmMap22(tag_t processTag, map<string, TimeBean2 > timebeans) {
+	int bvr_count = 0;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(processTag, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	//bom_line����
+	int c_line_count;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags)); // һ������
+
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t oneGx = c_line_tags[i], *towGxLines;
+		char* gxbm1;
+		AOM_ask_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm1);
+		if (timebeans.count(gxbm1) > 0) {
+			AOM_lock(oneGx);
+			TimeBean2 tbean = timebeans[gxbm1];
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ArtificialTime", tbean.rgsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_MachineTime", tbean.jqsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ReadinessTime", tbean.zbsj.c_str()));
+			ITKCALL(AOM_set_value_string(oneGx, "bl_ZT2_FirstOPRevision_zt2_ProCycle", tbean.zrsczq.c_str()));
+			AOM_save(oneGx);
+			AOM_unlock(oneGx);
+		}
+		int c_cnt = 0;
+		BOM_line_ask_all_child_lines(oneGx, &c_cnt, &towGxLines);
+		for (int j = 0; j < c_cnt; j++) {
+			tag_t towGxLine = towGxLines[j];
+			tag_t towGx;
+			char* gxbm2;
+			ITKCALL(AOM_ask_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ClassificationCode", &gxbm2));
+			if (timebeans.count(gxbm2) > 0) {
+				AOM_lock(towGxLine);
+				TimeBean2 tbean = timebeans[gxbm2];
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ArtificialTime", tbean.rgsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_MachineTime", tbean.jqsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ReadinessTime", tbean.zbsj.c_str()));
+				ITKCALL(AOM_set_value_string(towGxLine, "bl_ZT2_FirstOPRevision_zt2_ProCycle", tbean.zrsczq.c_str()));
+				AOM_save(towGxLine);
+				AOM_unlock(towGxLine);
+			}
+		}
+	}
+	BOM_save_window(ebom_window);
+	BOM_close_window(ebom_window);
+}
+void updateTime(char* process_item_id, boolean isXq, string productZu, string xqfs, string th,tag_t processTag)
+{
+	char selectGyId[200];
+	if (isXq) {
+		sprintf(selectGyId, sqlGxTime2Xq.c_str(), productZu.c_str(), process_item_id, xqfs.c_str());
+	}
+	else {
+		sprintf(selectGyId, sqlGxTime2Nor.c_str(), productZu.c_str(), process_item_id);
+	}
+
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	string gyId;
+	printf("search3 ===> %s\n", selectGyId);
+	map<string, TimeBean2 > beanMap;
+	QuerySQLNoInputParam(selectGyId, &outputColumn1, &outputValueCount1, &outputValue1);
+	//��ѯ���
+	for (int num = 0; num < outputValueCount1; num++) {
+		string gxbm = outputValue1[num][0];
+		string rgsj = outputValue1[num][1];
+		if (rgsj.rfind(".", 0) == 0) {
+			string a = "0";
+			rgsj = a.append(rgsj);
+			printf("rgsj === >%s\n", rgsj.c_str());
+		}
+		string jqsj = outputValue1[num][2];
+		if (jqsj.rfind(".", 0) == 0) {
+			string a = "0";
+			jqsj = a.append(jqsj);
+			printf("jqsj === >%s\n", jqsj.c_str());
+		}
+		string zbsj = outputValue1[num][3];
+		if (zbsj.rfind(".", 0) == 0) {
+			string a = "0";
+			zbsj = a.append(zbsj);
+			printf("zbsj === >%s\n", zbsj.c_str());
+		}
+		string zrsczq = outputValue1[num][4];
+		if (zrsczq.rfind(".", 0) == 0) {
+			string a = "0";
+			zrsczq = a.append(zrsczq);
+			printf("zrsczq === >%s\n", zrsczq.c_str());
+		}
+		TimeBean2 bean;
+		bean.rgsj = rgsj;
+		bean.jqsj = jqsj;
+		bean.zbsj = zbsj;
+		bean.zrsczq = zrsczq;
+		beanMap[gxbm] = bean;
+	}
+	getGxbmMap22(processTag, beanMap);
+
+	return;
+}
+
+void getTmpProcessUp(string cpxh, string th, string& errBuff, boolean isXq, string xqfs, tag_t processTag) {
+	char selectCPZ[200], selectGyId[200];
+	sprintf(selectCPZ, sqlCpxh2.c_str(), cpxh.c_str());
+	int outputColumn = 0, outputValueCount = 0;
+	char*** outputValue = NULL;
+	string productZu;
+	printf("search1\n");
+	QuerySQLNoInputParam(selectCPZ, &outputColumn, &outputValueCount, &outputValue);
+	printf("search11\n");
+	if (outputValueCount == 0) {
+		string buffMsg = "";
+		buffMsg.append("��ǰ��ѹ����Ʒ�ͺ�:").append(cpxh).append(",�����ݿ�����޶�Ӧ���Ͳ�Ʒ��ֵ������ϵ����Աά��.\n");
+		size_t found = errBuff.find(buffMsg);
+		if (found == std::string::npos) {
+			errBuff.append(buffMsg);
+		}
+		//errBuff.append("��ǰ��ѹ����Ʒ�ͺ�:").append(cpxh).append(",�����ݿ�����޶�Ӧ���Ͳ�Ʒ��ֵ������ϵ����Աά��.\n");
+		return;
+	}
+	for (int j = 0; j < outputValueCount; j++) {
+		productZu = outputValue[j][0];
+		printf("productZu===>%s\n", productZu.c_str());
+	}
+
+	sprintf(selectGyId, sqlGyRule2.c_str(), productZu.c_str(), th.c_str());
+
+	int outputColumn1 = 0, outputValueCount1 = 0;
+	char*** outputValue1 = NULL;
+	string gyId;
+	printf("search2 %s \n", selectGyId);
+	QuerySQLNoInputParam(selectGyId, &outputColumn1, &outputValueCount1, &outputValue1);
+	if (outputValueCount1 == 0) {
+		errBuff.append("ͼ��:").append(th).append("�޶�Ӧ����ģ��ID,��ά�����ٸ���.\n");
+		return;
+	}
+	for (int j = 0; j < outputValueCount1; j++) {
+		gyId = outputValue1[j][0];
+		printf("gyId===>%s\n", gyId.c_str());
+	}
+	updateTime((char*)gyId.c_str(), isXq, productZu, xqfs, th, processTag);
+	//tag_t clone_tag = clone_process_from_template((char*)gyId.c_str(), isXq, productZu, xqfs, th);
+	return;
+}
+
+void updateAllProcess(tag_t bom_line, string& errorBuff) {
+
+	int c_line_count;
+	tag_t mantr, *c_line_tags;
+	ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	if (c_line_count > 0 && isXnj(mantr)) {
+		printf("ʵ��\n");
+		//����Ƿ��й���·��
+		int n_references = 0;
+		int* levels = 0;
+		tag_t* references_tag = NULLTAG;
+		char** relation_type_name = NULL;
+		//ͨ�����ù�ϵ���ҵ������
+		ITKCALL(WSOM_where_referenced(mantr, 1, &n_references, &levels, &references_tag, &relation_type_name));
+		boolean hasProcess = false;
+		char* bl_desc, *objName, *itemID;
+		AOM_ask_value_string(mantr, "object_name", &objName);
+		AOM_ask_value_string(mantr, "item_id", &itemID);
+		tag_t processTag;
+		for (int i = 0; i < n_references; i++)
+		{
+			char* refType;
+			tag_t refTag = references_tag[i];
+			AOM_ask_value_string(refTag, "object_type", &refType);
+			if (strcmp(refType, "MEProcessRevision") == 0) {
+				hasProcess = true;
+				processTag = refTag;
+				break;
+			}
+		}
+		if (!hasProcess) {
+			errorBuff.append("ʵ��δָ�ɹ���·��,����:").append(itemID).append("/").append(objName);
+		}
+		else {
+			if (strstr(objName, "��ѹ��") != NULL) {
+				tag_t *byqRev;
+				char *uid;
+				int cnt3 = 0;
+				AOM_ask_value_tags(mantr, "TC_Is_Represented_By", &cnt3, &byqRev);
+				ByqBean2 bean;
+				ITK__convert_tag_to_uid(byqRev[0], &uid);
+				printf("objName%s %s\n", objName, uid);
+				string cpxh = getClassVal2(byqRev[0], errorBuff, bean);
+				printf("cpxh===>%s\n", cpxh.c_str());
+				if (strstr(objName, "��Ȧ") == NULL) {
+					getTmpProcessUp(cpxh, "1ZDB300000P", errorBuff, false, "", processTag);
+					//processTag = getTmpProcessUp(cpxh, "1ZDB300000P", errorBuff, tmpGyId, false, "");
+				}
+			}
+			else {
+				AOM_ask_value_string(bom_line, "bl_rev_object_desc", &bl_desc);
+				vector<string> descVec1;
+				Split(bl_desc, " ", descVec1);
+				if (descVec1.size() > 1) {
+					string drawNos = descVec1[1];
+					vector<string> drawNoVec1;
+					Split(drawNos, "-", drawNoVec1);
+					if (drawNoVec1.size() > 1) {
+						string wordNo = drawNoVec1[1]; //���̺� ƴ��1ZDB300000P ���ҷ�������
+						string drawNo = drawNoVec1[0]; //ͼ��
+						if (drawNoVec1.size() == 3) {
+							drawNo = drawNoVec1[0].append("-").append(drawNoVec1[1]);
+							wordNo = drawNoVec1[2];
+						}
+						string byqId = "1ZDB300000P-", tmpGyId;
+						tag_t byqTag, byqRev;
+						byqId.append(wordNo);
+						ITKCALL(ITEM_find_item(byqId.c_str(), &byqTag));
+						ITKCALL(ITEM_ask_latest_rev(byqTag, &byqRev));
+						ByqBean2 bean;
+						string cpxh = getClassVal2(byqRev, errorBuff, bean);
+						printf("cpxh===>%s\n", cpxh.c_str());
+						//��ȡ��ѯģ��
+						if (strstr(objName, "��Ȧ") == NULL) {
+							getTmpProcessUp(cpxh, drawNo, errorBuff, false, "", processTag);
+						}
+						else {
+							string xqfs;
+							if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+								//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+								if (bean.dyxq.empty()) {
+									errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+									return;
+								}
+								xqfs = bean.dyxq;
+							}
+							else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+								//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+								if (bean.zyxq.empty()) {
+									errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+									return;
+								}
+								xqfs = bean.zyxq;
+							}
+							else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+								//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+								if (bean.gyxq.empty()) {
+									errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+									return;
+								}
+								xqfs = bean.gyxq;
+							}
+							else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+								//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+								if (bean.tyxq.empty()) {
+									errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+									return;
+								}
+								xqfs = bean.tyxq;
+							}
+							else if (strstr(objName, "��ѹ��Ȧ") != NULL) {
+								//��ǰXXX��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��
+								if (bean.wyxq.empty()) {
+									errorBuff.append("��ǰ��ѹ��Ȧδ�ڱ�ѹ����������ά�����߷�ʽ�������ԣ���ǰ��ά��\n");
+									return;
+								}
+								xqfs = bean.wyxq;
+							}
+							getTmpProcessUp(cpxh, drawNo, errorBuff, true, xqfs, processTag);
+						}
+					}
+				}
+			}
+		}
+	}
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t c_line_tag = c_line_tags[i];
+		updateAllProcess(c_line_tag, errorBuff);
+	}
+}
+
+int UpdateWorkTime(void *returnValue)
+{
+	int ifail = ITK_ok;
+	char* sql = NULL, *revUid;
+	tag_t designRev;
+	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+	ITK__convert_uid_to_tag(revUid, &designRev);
+	int bvr_count = 0, c_line_count;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(designRev, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	string errorBuff;
+	//char *bl_desc;
+//	AOM_ask_value_string(bom_line, "bl_rev_object_desc", &bl_desc);
+
+	//int n_references = 0;
+	//int* levels = 0;
+	//tag_t* references_tag = NULLTAG;
+	//char** relation_type_name = NULL;
+	//ͨ�����ù�ϵ���ҵ������
+	//ITKCALL(WSOM_where_referenced(designRev, 1, &n_references, &levels, &references_tag, &relation_type_name));
+	/*boolean hasProcess = false;
+	tag_t processTagTop = NULLTAG;
+	for (int i = 0; i < n_references; i++)
+	{
+		char* refType;
+		tag_t refTag = references_tag[i];
+		AOM_ask_value_string(refTag, "object_type", &refType);
+		if (strcmp(refType, "MEProcessRevision") == 0) {
+			hasProcess = true;
+			processTagTop = refTag;
+			break;
+		}
+	}*/
+	//tag_t meProcess = NULLTAG;
+	/*char *objName, *topId;
+	AOM_ask_value_string(designRev, "object_name", &objName);
+	AOM_ask_value_string(designRev, "item_id", &topId);
+	map<string, tag_t> mapByq;
+
+	printf("mapByq===>%d\n", mapByq.size());*/
+	//������ȡ����·��
+	{
+		POM_AM__set_application_bypass(true);
+		int url_num = 0;
+		char** url_vals = NULL;
+		PREF_ask_char_values("database_tc", &url_num, &url_vals);
+		string url = url_vals[0];
+		url.append("/").append(url_vals[2]);
+
+		//map<string,
+		printf("url ==> %s \n", url.c_str());
+		if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+		{
+			printf("��ʾ:�м����ݱ�����ʧ��\n");
+			ifail = 1;
+		}
+		tag_t topProcess = NULLTAG;
+
+		printf("errorBuff==>%s\n", errorBuff.c_str());
+		updateAllProcess(bom_line, errorBuff);
+
+		DisConnServer();
+		POM_AM__set_application_bypass(false);
+	}
+
+	if (errorBuff.empty()) {
+		errorBuff = "succ";
+	}
+	printf("errorBuff==>%s\n", errorBuff.c_str());
+	BOM_close_window(ebom_window);
+	*((char**)returnValue) = (char*)MEM_alloc((strlen(errorBuff.c_str()) + 1) * sizeof(char));
+	tc_strcpy(*((char**)returnValue), errorBuff.c_str());
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/WX_Check_Property.cxx b/General/General/WX_Check_Property.cxx
new file mode 100644
index 0000000..84e90e5
--- /dev/null
+++ b/General/General/WX_Check_Property.cxx
@@ -0,0 +1,119 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+typedef struct{
+	string ITEM_ID;//id��
+}PROPERTY_STRUCT;
+int WX_Check_Property(EPM_rule_message_t msg)
+{
+	EPM_decision_t decision = EPM_go;
+	int ifail = ITK_ok, arg_cnt = 0, i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	char * object_TYPE_1 = NULL;
+	char * object_string = NULL;
+	string value_type = "";
+	string value_property="";
+	TC_argument_t *args;//����
+	args = msg.arguments->arguments;//->ȡָ���ͽṹ��ij�Ա������ȡ���������õIJ���
+	for (auto i = 0; i<msg.arguments->number_of_arguments; i++)
+	{
+		string val(args[i].val_union.str_value);
+		int index = val.find('=');//�ҵ�=���ڵ�λ��
+		string val_t = val.substr(0, index);//����val��λ��0��ʼ����Ϊindex���ַ���
+		string args = "-object_type";
+		string args2 = "-property_name";
+		if (args.compare(val_t) == 0)
+		{
+			value_type = val.substr(index + 1);//����=�Ժ���ַ�����
+			cout<<"��������---------"<<value_type.c_str()<<endl;
+		}
+		if (args2.compare(val_t) == 0)
+		{
+			value_property= val.substr(index + 1);
+			cout<<"��������---------"<<value_property.c_str()<<endl;
+		}
+
+	}
+	vector<PROPERTY_STRUCT>	item_vec;
+	//��ȡ��ǰ����������
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+	ifail = EPM_ask_root_task(task_tag, &rootTask_tag);
+	//��ȡĿ�����ö���
+	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments);
+	//ѭ��Ŀ�����
+	for (i = 0; i < att_cnt; i++) {
+	
+
+		ifail = AOM_ask_value_string(attachments[i], "object_type", &object_TYPE_1);//��������
+		cout << object_TYPE_1;
+		cout << endl;
+		if(strcmp(value_type.c_str(),object_TYPE_1)==0)
+		{
+		ifail = AOM_ask_value_string(attachments[i], value_property.c_str(), &object_string);//��������
+			if(std::strlen(object_string)==0)
+			{
+				PROPERTY_STRUCT elements ;
+				decision=EPM_nogo;
+				ifail = AOM_ask_value_string(attachments[i], "object_string", &object_TYPE_1);//��������
+				elements.ITEM_ID.assign(object_TYPE_1);
+				item_vec.push_back(elements);
+				
+			}
+		}
+		
+	}
+	if (attachments != NULL)
+	{
+		MEM_free(attachments);
+		attachments = NULL;
+	}
+	if (object_TYPE_1 != NULL)
+	{
+		MEM_free(object_TYPE_1);
+		object_TYPE_1 = NULL;
+	}
+	if (object_string != NULL)
+	{
+		MEM_free(object_string);
+		object_string = NULL;
+	}
+	
+	if(decision==EPM_nogo)
+	{
+		string name="���¶����\""+value_property+"\"����û����д:\n";
+	for (int i=0;i<item_vec.size();i++)
+	{
+		name=name+item_vec[i].ITEM_ID+"\n";
+	}
+	EMH_store_error_s1(EMH_severity_warning, EMH_AE_error_base, name.c_str());
+		
+	}
+	return decision;
+}
\ No newline at end of file
diff --git a/General/General/ado.cxx b/General/General/ado.cxx
new file mode 100644
index 0000000..286e6d7
--- /dev/null
+++ b/General/General/ado.cxx
@@ -0,0 +1,164 @@
+#include "ado.h"
+#include <stdio.h>
+#include <ctype.h>
+#include <string.h>
+
+#include <string>
+#include <iostream>
+#include <iterator>
+#include <map>
+#include <vector>
+#include <sstream>
+#include <fstream>
+
+#ifdef WIN32
+#include <io.h>
+#include <direct.h>
+#else
+#include <unistd.h>
+#endif
+
+using namespace std;
+
+_ConnectionPtr m_pConnection;
+_RecordsetPtr m_pRecordset;
+HRESULT hr;
+
+bool open(char* username, char* password, char* dbname, char* ip)
+{
+	try
+	{
+		::CoInitialize(NULL); //��ʼ��COM����
+		m_pConnection.CreateInstance(__uuidof(Connection)); //�������Ӷ���
+		char connStr[200] = "";
+		sprintf(connStr, "Provider=SQLOLEDB;Data Source=%s;Initial Catalog=%s;", ip, dbname);
+		cout << connStr << endl;
+		hr = m_pConnection->Open(connStr, username, password, -1);
+		if (hr != S_OK)
+			return true;
+	}
+	catch (_com_error e)
+	{
+		cout << e.Description() << endl;
+		return true;
+	}
+	return false;
+}
+
+// ����������IJ�ѯ
+int ado_QuerySQL(char *SQL, int inputValueCount, char ** inputValue, int * outputColumn, int * outputValueCount, char **** outputValue)
+{
+	Fields *  fields = NULL;
+	long ColCount = 0;
+	long RowCount = 0;
+
+	*outputColumn = 0;
+	*outputValueCount = 0;
+
+	m_pRecordset.CreateInstance(__uuidof(Recordset));
+
+	m_pRecordset->Open(SQL, m_pConnection.GetInterfacePtr(), adOpenStatic, adLockOptimistic, adCmdText);
+
+	hr = m_pRecordset->get_Fields(&fields);	//�õ���¼�����ֶμ���	
+
+	if (SUCCEEDED(hr))
+	{
+		RowCount = m_pRecordset->GetRecordCount();
+
+		ColCount = m_pRecordset->Fields->Count;
+
+		*outputValueCount = (int)RowCount;
+		*outputColumn = (int)ColCount;
+	}
+
+	if (*outputValueCount <= 0)
+	{
+		return 0;
+	}
+	int index = 0;
+	// ��ʼ�����ڴ沢�Ҵ洢
+	*outputValue = (char ***)calloc(RowCount + 1, sizeof(char**));
+	while (!m_pRecordset->adoEOF)
+	{
+		(*outputValue)[index] = (char **)calloc(ColCount + 1, sizeof(char *));
+		for (long i = 0; i < ColCount; i++)
+		{
+			BSTR bstrColName;
+			fields->Item[i]->get_Name(&bstrColName);
+			_variant_t taskStyle = NULL;
+			taskStyle = m_pRecordset->GetCollect(bstrColName);
+			if (taskStyle.vt != VT_NULL) {
+				const char* str = NULL;
+
+
+
+				_bstr_t bst_t = (_bstr_t)taskStyle;
+
+				str = (const char*)bst_t;
+
+				(*outputValue)[index][i] = (char *)calloc(strlen(str) + 1, sizeof(char));
+				strcpy((*outputValue)[index][i], str);
+
+			}
+			else
+			{
+				//printf("NULL\n");
+				(*outputValue)[index][i] = (char *)calloc(10000, sizeof(char));
+				strcpy((*outputValue)[index][i], "");
+			}
+
+
+		}
+		m_pRecordset->MoveNext();///�Ƶ���һ����¼
+		index++;
+	}
+	return 0;
+}
+
+// ����������IJ�ѯ
+int ado_QuerySQLNoInputParam(char *SQL, int * outputColumn, int * outputValueCount, char **** outputValue)
+{
+	return ado_QuerySQL(SQL, 0, NULL, outputColumn, outputValueCount, outputValue);
+}
+
+// �޲�������
+int ado_ExecuteSQLNoInputParam(char *SQL)
+{
+	return ado_ExecuteSQL(SQL, 0, NULL);
+}
+
+// ִ�������
+int ado_ExecuteSQL(char *SQL, int valueCount, char **value)
+{
+	try
+	{
+		m_pConnection->Execute(_bstr_t(SQL), 0, adCmdText);
+		printf("ɾ������\n");
+		//LogInsert ("����!");
+	}
+	catch (_com_error e)
+	{
+		printf(e.Description());
+		return -1;
+	}
+
+	return 0;
+}
+
+void close(void)
+{
+
+	try
+	{
+		if (m_pRecordset != NULL) {
+			m_pRecordset->Close();
+			m_pConnection->Close();
+		}
+		printf("2222");
+		//::CoUninitialize(); //�ͷŻ���
+	}
+	catch (_com_error e)
+	{
+		cout << e.Description() << endl;
+	}
+}
\ No newline at end of file
diff --git a/General/General/ado.h b/General/General/ado.h
new file mode 100644
index 0000000..f48c526
--- /dev/null
+++ b/General/General/ado.h
@@ -0,0 +1,35 @@
+#import "c:\program files\common files\system\ado\msado15.dll" no_namespace rename("EOF", "adoEOF")
+
+bool open(char* username, char* password, char* dbname, char* ip);
+_RecordsetPtr& execute(_bstr_t SQL);
+/**
+* ����������IJ�ѯSQL���.
+* @param SQL					 - <I> SQL���
+* @param inputValueCount         - <I> �����������
+* @param inputValue			     - <I> �������ֵ
+* @param outputColumn			 - <O> ������������
+* @param outputValueCount        - <O> ������������
+* @param outputValue			 - <O> ���������
+* @return - OCI_OK or error code
+*
+*    ORACLE ���ݿ���������װ����
+*/
+int ado_QuerySQL(char *SQL, int inputValueCount, char ** inputValue, int * outputColumn, int * outputValueCount, char **** outputValue);
+
+int ado_QuerySQLNoInputParam(char *SQL, int * outputColumn, int * outputValueCount, char **** outputValue);
+// ִ�������
+int ado_ExecuteSQL(char *SQL, int valueCount, char **value);
+/**
+* �������������ִ��SQL���.
+* @param SQL			- <I> SQL���
+* @return - OCI_OK or error code
+*
+*    ORACLE ���ݿ���������װ����
+*/
+int ado_ExecuteSQLNoInputParam(char *SQL);
+/**
+* �Ͽ����ݿ�����.
+*
+*    ORACLE ���ݿ���������װ����
+*/
+void close();
diff --git a/General/General/cJSON.c b/General/General/cJSON.c
new file mode 100644
index 0000000..b4d6136
--- /dev/null
+++ b/General/General/cJSON.c
@@ -0,0 +1,758 @@
+#pragma once
+/*
+  Copyright (c) 2009 Dave Gamble
+
+  Permission is hereby granted, free of charge, to any person obtaining a copy
+  of this software and associated documentation files (the "Software"), to deal
+  in the Software without restriction, including without limitation the rights
+  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the Software is
+  furnished to do so, subject to the following conditions:
+
+  The above copyright notice and this permission notice shall be included in
+  all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+  THE SOFTWARE.
+*/
+
+/* cJSON */
+/* JSON parser in C. */
+
+#include <string.h>
+#include <stdio.h>
+#include <math.h>
+#include <stdlib.h>
+#include <float.h>
+#include <limits.h>
+#include <ctype.h>
+#include "cJSON.h"
+#pragma warning(disable : 4996)
+static const char* ep;
+
+const char* cJSON_GetErrorPtr(void) { return ep; }
+
+static int cJSON_strcasecmp(const char* s1, const char* s2)
+{
+	if (!s1) return (s1 == s2) ? 0 : 1;if (!s2) return 1;
+	for (; tolower(*s1) == tolower(*s2); ++s1, ++s2)	if (*s1 == 0)	return 0;
+	return tolower(*(const unsigned char*)s1) - tolower(*(const unsigned char*)s2);
+}
+
+static void* (*cJSON_malloc)(size_t sz) = malloc;
+static void (*cJSON_free)(void* ptr) = free;
+
+static char* cJSON_strdup(const char* str)
+{
+	size_t len;
+	char* copy;
+
+	len = strlen(str) + 1;
+	if (!(copy = (char*)cJSON_malloc(len))) return 0;
+	memcpy(copy, str, len);
+	return copy;
+}
+
+void cJSON_InitHooks(cJSON_Hooks* hooks)
+{
+	if (!hooks) { /* Reset hooks */
+		cJSON_malloc = malloc;
+		cJSON_free = free;
+		return;
+	}
+
+	cJSON_malloc = (hooks->malloc_fn) ? hooks->malloc_fn : malloc;
+	cJSON_free = (hooks->free_fn) ? hooks->free_fn : free;
+}
+
+/* Internal constructor. */
+static cJSON* cJSON_New_Item(void)
+{
+	cJSON* node = (cJSON*)cJSON_malloc(sizeof(cJSON));
+	if (node) memset(node, 0, sizeof(cJSON));
+	return node;
+}
+
+/* Delete a cJSON structure. */
+void cJSON_Delete(cJSON* c)
+{
+	cJSON* next;
+	while (c)
+	{
+		next = c->next;
+		if (!(c->type & cJSON_IsReference) && c->child) cJSON_Delete(c->child);
+		if (!(c->type & cJSON_IsReference) && c->valuestring) cJSON_free(c->valuestring);
+		if (!(c->type & cJSON_StringIsConst) && c->string) cJSON_free(c->string);
+		cJSON_free(c);
+		c = next;
+	}
+}
+
+/* Parse the input text to generate a number, and populate the result into item. */
+static const char* parse_number(cJSON* item, const char* num)
+{
+	double n = 0, sign = 1, scale = 0;int subscale = 0, signsubscale = 1;
+
+	if (*num == '-') sign = -1, num++;	/* Has sign? */
+	if (*num == '0') num++;			/* is zero */
+	if (*num >= '1' && *num <= '9')	do	n = (n * 10.0) + (*num++ - '0');	while (*num >= '0' && *num <= '9');	/* Number? */
+	if (*num == '.' && num[1] >= '0' && num[1] <= '9') { num++;		do	n = (n * 10.0) + (*num++ - '0'), scale--; while (*num >= '0' && *num <= '9'); }	/* Fractional part? */
+	if (*num == 'e' || *num == 'E')		/* Exponent? */
+	{
+		num++;if (*num == '+') num++;	else if (*num == '-') signsubscale = -1, num++;		/* With sign? */
+		while (*num >= '0' && *num <= '9') subscale = (subscale * 10) + (*num++ - '0');	/* Number? */
+	}
+
+	n = sign * n * pow(10.0, (scale + subscale * signsubscale));	/* number = +/- number.fraction * 10^+/- exponent */
+
+	item->valuedouble = n;
+	item->valueint = (int)n;
+	item->type = cJSON_Number;
+	return num;
+}
+
+static int pow2gt(int x) { --x;	x |= x >> 1;	x |= x >> 2;	x |= x >> 4;	x |= x >> 8;	x |= x >> 16;	return x + 1; }
+
+typedef struct { char* buffer; int length; int offset; } printbuffer;
+
+static char* ensure(printbuffer* p, int needed)
+{
+	char* newbuffer;int newsize;
+	if (!p || !p->buffer) return 0;
+	needed += p->offset;
+	if (needed <= p->length) return p->buffer + p->offset;
+
+	newsize = pow2gt(needed);
+	newbuffer = (char*)cJSON_malloc(newsize);
+	if (!newbuffer) { cJSON_free(p->buffer);p->length = 0, p->buffer = 0;return 0; }
+	if (newbuffer) memcpy(newbuffer, p->buffer, p->length);
+	cJSON_free(p->buffer);
+	p->length = newsize;
+	p->buffer = newbuffer;
+	return newbuffer + p->offset;
+}
+
+static int update(printbuffer* p)
+{
+	char* str;
+	if (!p || !p->buffer) return 0;
+	str = p->buffer + p->offset;
+	return p->offset + strlen(str);
+}
+
+/* Render the number nicely from the given item into a string. */
+static char* print_number(cJSON* item, printbuffer* p)
+{
+	char* str = 0;
+	double d = item->valuedouble;
+	if (d == 0)
+	{
+		if (p)	str = ensure(p, 2);
+		else	str = (char*)cJSON_malloc(2);	/* special case for 0. */
+		if (str) strcpy(str, "0");
+	}
+	else if (fabs(((double)item->valueint) - d) <= DBL_EPSILON && d <= INT_MAX && d >= INT_MIN)
+	{
+		if (p)	str = ensure(p, 21);
+		else	str = (char*)cJSON_malloc(21);	/* 2^64+1 can be represented in 21 chars. */
+		if (str)	sprintf(str, "%d", item->valueint);
+	}
+	else
+	{
+		if (p)	str = ensure(p, 64);
+		else	str = (char*)cJSON_malloc(64);	/* This is a nice tradeoff. */
+		if (str)
+		{
+			if (fabs(floor(d) - d) <= DBL_EPSILON && fabs(d) < 1.0e60)sprintf(str, "%.0f", d);
+			else if (fabs(d) < 1.0e-6 || fabs(d) > 1.0e9)			sprintf(str, "%e", d);
+			else												sprintf(str, "%f", d);
+		}
+	}
+	return str;
+}
+
+static unsigned parse_hex4(const char* str)
+{
+	unsigned h = 0;
+	if (*str >= '0' && *str <= '9') h += (*str) - '0'; else if (*str >= 'A' && *str <= 'F') h += 10 + (*str) - 'A'; else if (*str >= 'a' && *str <= 'f') h += 10 + (*str) - 'a'; else return 0;
+	h = h << 4;str++;
+	if (*str >= '0' && *str <= '9') h += (*str) - '0'; else if (*str >= 'A' && *str <= 'F') h += 10 + (*str) - 'A'; else if (*str >= 'a' && *str <= 'f') h += 10 + (*str) - 'a'; else return 0;
+	h = h << 4;str++;
+	if (*str >= '0' && *str <= '9') h += (*str) - '0'; else if (*str >= 'A' && *str <= 'F') h += 10 + (*str) - 'A'; else if (*str >= 'a' && *str <= 'f') h += 10 + (*str) - 'a'; else return 0;
+	h = h << 4;str++;
+	if (*str >= '0' && *str <= '9') h += (*str) - '0'; else if (*str >= 'A' && *str <= 'F') h += 10 + (*str) - 'A'; else if (*str >= 'a' && *str <= 'f') h += 10 + (*str) - 'a'; else return 0;
+	return h;
+}
+
+/* Parse the input text into an unescaped cstring, and populate item. */
+static const unsigned char firstByteMark[7] = { 0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC };
+static const char* parse_string(cJSON* item, const char* str)
+{
+	const char* ptr = str + 1;char* ptr2;char* out;int len = 0;unsigned uc, uc2;
+	if (*str != '\"') { ep = str;return 0; }	/* not a string! */
+
+	while (*ptr != '\"' && *ptr && ++len) if (*ptr++ == '\\') ptr++;	/* Skip escaped quotes. */
+
+	out = (char*)cJSON_malloc(len + 1);	/* This is how long we need for the string, roughly. */
+	if (!out) return 0;
+
+	ptr = str + 1;ptr2 = out;
+	while (*ptr != '\"' && *ptr)
+	{
+		if (*ptr != '\\') *ptr2++ = *ptr++;
+		else
+		{
+			ptr++;
+			switch (*ptr)
+			{
+			case 'b': *ptr2++ = '\b';	break;
+			case 'f': *ptr2++ = '\f';	break;
+			case 'n': *ptr2++ = '\n';	break;
+			case 'r': *ptr2++ = '\r';	break;
+			case 't': *ptr2++ = '\t';	break;
+			case 'u':	 /* transcode utf16 to utf8. */
+				uc = parse_hex4(ptr + 1);ptr += 4;	/* get the unicode char. */
+
+				if ((uc >= 0xDC00 && uc <= 0xDFFF) || uc == 0)	break;	/* check for invalid.	*/
+
+				if (uc >= 0xD800 && uc <= 0xDBFF)	/* UTF16 surrogate pairs.	*/
+				{
+					if (ptr[1] != '\\' || ptr[2] != 'u')	break;	/* missing second-half of surrogate.	*/
+					uc2 = parse_hex4(ptr + 3);ptr += 6;
+					if (uc2 < 0xDC00 || uc2>0xDFFF)		break;	/* invalid second-half of surrogate.	*/
+					uc = 0x10000 + (((uc & 0x3FF) << 10) | (uc2 & 0x3FF));
+				}
+
+				len = 4;if (uc < 0x80) len = 1;else if (uc < 0x800) len = 2;else if (uc < 0x10000) len = 3; ptr2 += len;
+
+				switch (len) {
+				case 4: *--ptr2 = ((uc | 0x80) & 0xBF); uc >>= 6;
+				case 3: *--ptr2 = ((uc | 0x80) & 0xBF); uc >>= 6;
+				case 2: *--ptr2 = ((uc | 0x80) & 0xBF); uc >>= 6;
+				case 1: *--ptr2 = (uc | firstByteMark[len]);
+				}
+				ptr2 += len;
+				break;
+			default:  *ptr2++ = *ptr; break;
+			}
+			ptr++;
+		}
+	}
+	*ptr2 = 0;
+	if (*ptr == '\"') ptr++;
+	item->valuestring = out;
+	item->type = cJSON_String;
+	return ptr;
+}
+
+/* Render the cstring provided to an escaped version that can be printed. */
+static char* print_string_ptr(const char* str, printbuffer* p)
+{
+	const char* ptr;char* ptr2, * out;int len = 0, flag = 0;unsigned char token;
+
+	for (ptr = str;*ptr;ptr++) flag |= ((*ptr > 0 && *ptr < 32) || (*ptr == '\"') || (*ptr == '\\')) ? 1 : 0;
+	if (!flag)
+	{
+		len = ptr - str;
+		if (p) out = ensure(p, len + 3);
+		else		out = (char*)cJSON_malloc(len + 3);
+		if (!out) return 0;
+		ptr2 = out;*ptr2++ = '\"';
+		strcpy(ptr2, str);
+		ptr2[len] = '\"';
+		ptr2[len + 1] = 0;
+		return out;
+	}
+
+	if (!str)
+	{
+		if (p)	out = ensure(p, 3);
+		else	out = (char*)cJSON_malloc(3);
+		if (!out) return 0;
+		strcpy(out, "\"\"");
+		return out;
+	}
+	ptr = str;while ((token = *ptr) && ++len) { if (strchr("\"\\\b\f\n\r\t", token)) len++; else if (token < 32) len += 5;ptr++; }
+
+	if (p)	out = ensure(p, len + 3);
+	else	out = (char*)cJSON_malloc(len + 3);
+	if (!out) return 0;
+
+	ptr2 = out;ptr = str;
+	*ptr2++ = '\"';
+	while (*ptr)
+	{
+		if ((unsigned char)*ptr > 31 && *ptr != '\"' && *ptr != '\\') *ptr2++ = *ptr++;
+		else
+		{
+			*ptr2++ = '\\';
+			switch (token = *ptr++)
+			{
+			case '\\':	*ptr2++ = '\\';	break;
+			case '\"':	*ptr2++ = '\"';	break;
+			case '\b':	*ptr2++ = 'b';	break;
+			case '\f':	*ptr2++ = 'f';	break;
+			case '\n':	*ptr2++ = 'n';	break;
+			case '\r':	*ptr2++ = 'r';	break;
+			case '\t':	*ptr2++ = 't';	break;
+			default: sprintf(ptr2, "u%04x", token);ptr2 += 5;	break;	/* escape and print */
+			}
+		}
+	}
+	*ptr2++ = '\"';*ptr2++ = 0;
+	return out;
+}
+/* Invote print_string_ptr (which is useful) on an item. */
+static char* print_string(cJSON* item, printbuffer* p) { return print_string_ptr(item->valuestring, p); }
+
+/* Predeclare these prototypes. */
+static const char* parse_value(cJSON* item, const char* value);
+static char* print_value(cJSON* item, int depth, int fmt, printbuffer* p);
+static const char* parse_array(cJSON* item, const char* value);
+static char* print_array(cJSON* item, int depth, int fmt, printbuffer* p);
+static const char* parse_object(cJSON* item, const char* value);
+static char* print_object(cJSON* item, int depth, int fmt, printbuffer* p);
+
+/* Utility to jump whitespace and cr/lf */
+static const char* skip(const char* in) { while (in && *in && (unsigned char)*in <= 32) in++; return in; }
+
+/* Parse an object - create a new root, and populate. */
+cJSON* cJSON_ParseWithOpts(const char* value, const char** return_parse_end, int require_null_terminated)
+{
+	const char* end = 0;
+	cJSON* c = cJSON_New_Item();
+	ep = 0;
+	if (!c) return 0;       /* memory fail */
+
+	end = parse_value(c, skip(value));
+	if (!end) { cJSON_Delete(c);return 0; }	/* parse failure. ep is set. */
+
+	/* if we require null-terminated JSON without appended garbage, skip and then check for a null terminator */
+	if (require_null_terminated) { end = skip(end);if (*end) { cJSON_Delete(c);ep = end;return 0; } }
+	if (return_parse_end) *return_parse_end = end;
+	return c;
+}
+/* Default options for cJSON_Parse */
+cJSON* cJSON_Parse(const char* value) { return cJSON_ParseWithOpts(value, 0, 0); }
+
+/* Render a cJSON item/entity/structure to text. */
+char* cJSON_Print(cJSON* item) { return print_value(item, 0, 1, 0); }
+char* cJSON_PrintUnformatted(cJSON* item) { return print_value(item, 0, 0, 0); }
+
+char* cJSON_PrintBuffered(cJSON* item, int prebuffer, int fmt)
+{
+	printbuffer p;
+	p.buffer = (char*)cJSON_malloc(prebuffer);
+	p.length = prebuffer;
+	p.offset = 0;
+	return print_value(item, 0, fmt, &p);
+	return p.buffer;
+}
+
+
+/* Parser core - when encountering text, process appropriately. */
+static const char* parse_value(cJSON* item, const char* value)
+{
+	if (!value)						return 0;	/* Fail on null. */
+	if (!strncmp(value, "null", 4)) { item->type = cJSON_NULL;  return value + 4; }
+	if (!strncmp(value, "false", 5)) { item->type = cJSON_False; return value + 5; }
+	if (!strncmp(value, "true", 4)) { item->type = cJSON_True; item->valueint = 1;	return value + 4; }
+	if (*value == '\"') { return parse_string(item, value); }
+	if (*value == '-' || (*value >= '0' && *value <= '9')) { return parse_number(item, value); }
+	if (*value == '[') { return parse_array(item, value); }
+	if (*value == '{') { return parse_object(item, value); }
+
+	ep = value;return 0;	/* failure. */
+}
+
+/* Render a value to text. */
+static char* print_value(cJSON* item, int depth, int fmt, printbuffer* p)
+{
+	char* out = 0;
+	if (!item) return 0;
+	if (p)
+	{
+		switch ((item->type) & 255)
+		{
+		case cJSON_NULL: {out = ensure(p, 5);	if (out) strcpy(out, "null");	break;}
+		case cJSON_False: {out = ensure(p, 6);	if (out) strcpy(out, "false");	break;}
+		case cJSON_True: {out = ensure(p, 5);	if (out) strcpy(out, "true");	break;}
+		case cJSON_Number:	out = print_number(item, p);break;
+		case cJSON_String:	out = print_string(item, p);break;
+		case cJSON_Array:	out = print_array(item, depth, fmt, p);break;
+		case cJSON_Object:	out = print_object(item, depth, fmt, p);break;
+		}
+	}
+	else
+	{
+		switch ((item->type) & 255)
+		{
+		case cJSON_NULL:	out = cJSON_strdup("null");	break;
+		case cJSON_False:	out = cJSON_strdup("false");break;
+		case cJSON_True:	out = cJSON_strdup("true"); break;
+		case cJSON_Number:	out = print_number(item, 0);break;
+		case cJSON_String:	out = print_string(item, 0);break;
+		case cJSON_Array:	out = print_array(item, depth, fmt, 0);break;
+		case cJSON_Object:	out = print_object(item, depth, fmt, 0);break;
+		}
+	}
+	return out;
+}
+
+/* Build an array from input text. */
+static const char* parse_array(cJSON* item, const char* value)
+{
+	cJSON* child;
+	if (*value != '[') { ep = value;return 0; }	/* not an array! */
+
+	item->type = cJSON_Array;
+	value = skip(value + 1);
+	if (*value == ']') return value + 1;	/* empty array. */
+
+	item->child = child = cJSON_New_Item();
+	if (!item->child) return 0;		 /* memory fail */
+	value = skip(parse_value(child, skip(value)));	/* skip any spacing, get the value. */
+	if (!value) return 0;
+
+	while (*value == ',')
+	{
+		cJSON* new_item;
+		if (!(new_item = cJSON_New_Item())) return 0; 	/* memory fail */
+		child->next = new_item;new_item->prev = child;child = new_item;
+		value = skip(parse_value(child, skip(value + 1)));
+		if (!value) return 0;	/* memory fail */
+	}
+
+	if (*value == ']') return value + 1;	/* end of array */
+	ep = value;return 0;	/* malformed. */
+}
+
+/* Render an array to text */
+static char* print_array(cJSON* item, int depth, int fmt, printbuffer* p)
+{
+	char** entries;
+	char* out = 0, * ptr, * ret;int len = 5;
+	cJSON* child = item->child;
+	int numentries = 0, i = 0, fail = 0;
+	size_t tmplen = 0;
+
+	/* How many entries in the array? */
+	while (child) numentries++, child = child->next;
+	/* Explicitly handle numentries==0 */
+	if (!numentries)
+	{
+		if (p)	out = ensure(p, 3);
+		else	out = (char*)cJSON_malloc(3);
+		if (out) strcpy(out, "[]");
+		return out;
+	}
+
+	if (p)
+	{
+		/* Compose the output array. */
+		i = p->offset;
+		ptr = ensure(p, 1);if (!ptr) return 0;	*ptr = '[';	p->offset++;
+		child = item->child;
+		while (child && !fail)
+		{
+			print_value(child, depth + 1, fmt, p);
+			p->offset = update(p);
+			if (child->next) { len = fmt ? 2 : 1;ptr = ensure(p, len + 1);if (!ptr) return 0;*ptr++ = ',';if (fmt)*ptr++ = ' ';*ptr = 0;p->offset += len; }
+			child = child->next;
+		}
+		ptr = ensure(p, 2);if (!ptr) return 0;	*ptr++ = ']';*ptr = 0;
+		out = (p->buffer) + i;
+	}
+	else
+	{
+		/* Allocate an array to hold the values for each */
+		entries = (char**)cJSON_malloc(numentries * sizeof(char*));
+		if (!entries) return 0;
+		memset(entries, 0, numentries * sizeof(char*));
+		/* Retrieve all the results: */
+		child = item->child;
+		while (child && !fail)
+		{
+			ret = print_value(child, depth + 1, fmt, 0);
+			entries[i++] = ret;
+			if (ret) len += strlen(ret) + 2 + (fmt ? 1 : 0); else fail = 1;
+			child = child->next;
+		}
+
+		/* If we didn't fail, try to malloc the output string */
+		if (!fail)	out = (char*)cJSON_malloc(len);
+		/* If that fails, we fail. */
+		if (!out) fail = 1;
+
+		/* Handle failure. */
+		if (fail)
+		{
+			for (i = 0;i < numentries;i++) if (entries[i]) cJSON_free(entries[i]);
+			cJSON_free(entries);
+			return 0;
+		}
+
+		/* Compose the output array. */
+		*out = '[';
+		ptr = out + 1;*ptr = 0;
+		for (i = 0;i < numentries;i++)
+		{
+			tmplen = strlen(entries[i]);memcpy(ptr, entries[i], tmplen);ptr += tmplen;
+			if (i != numentries - 1) { *ptr++ = ',';if (fmt)*ptr++ = ' ';*ptr = 0; }
+			cJSON_free(entries[i]);
+		}
+		cJSON_free(entries);
+		*ptr++ = ']';*ptr++ = 0;
+	}
+	return out;
+}
+
+/* Build an object from the text. */
+static const char* parse_object(cJSON* item, const char* value)
+{
+	cJSON* child;
+	if (*value != '{') { ep = value;return 0; }	/* not an object! */
+
+	item->type = cJSON_Object;
+	value = skip(value + 1);
+	if (*value == '}') return value + 1;	/* empty array. */
+
+	item->child = child = cJSON_New_Item();
+	if (!item->child) return 0;
+	value = skip(parse_string(child, skip(value)));
+	if (!value) return 0;
+	child->string = child->valuestring;child->valuestring = 0;
+	if (*value != ':') { ep = value;return 0; }	/* fail! */
+	value = skip(parse_value(child, skip(value + 1)));	/* skip any spacing, get the value. */
+	if (!value) return 0;
+
+	while (*value == ',')
+	{
+		cJSON* new_item;
+		if (!(new_item = cJSON_New_Item()))	return 0; /* memory fail */
+		child->next = new_item;new_item->prev = child;child = new_item;
+		value = skip(parse_string(child, skip(value + 1)));
+		if (!value) return 0;
+		child->string = child->valuestring;child->valuestring = 0;
+		if (*value != ':') { ep = value;return 0; }	/* fail! */
+		value = skip(parse_value(child, skip(value + 1)));	/* skip any spacing, get the value. */
+		if (!value) return 0;
+	}
+
+	if (*value == '}') return value + 1;	/* end of array */
+	ep = value;return 0;	/* malformed. */
+}
+
+/* Render an object to text. */
+static char* print_object(cJSON* item, int depth, int fmt, printbuffer* p)
+{
+	char** entries = 0, ** names = 0;
+	char* out = 0, * ptr, * ret, * str;int len = 7, i = 0, j;
+	cJSON* child = item->child;
+	int numentries = 0, fail = 0;
+	size_t tmplen = 0;
+	/* Count the number of entries. */
+	while (child) numentries++, child = child->next;
+	/* Explicitly handle empty object case */
+	if (!numentries)
+	{
+		if (p) out = ensure(p, fmt ? depth + 4 : 3);
+		else	out = (char*)cJSON_malloc(fmt ? depth + 4 : 3);
+		if (!out)	return 0;
+		ptr = out;*ptr++ = '{';
+		if (fmt) { *ptr++ = '\n';for (i = 0;i < depth - 1;i++) *ptr++ = '\t'; }
+		*ptr++ = '}';*ptr++ = 0;
+		return out;
+	}
+	if (p)
+	{
+		/* Compose the output: */
+		i = p->offset;
+		len = fmt ? 2 : 1;	ptr = ensure(p, len + 1);	if (!ptr) return 0;
+		*ptr++ = '{';	if (fmt) *ptr++ = '\n';	*ptr = 0;	p->offset += len;
+		child = item->child;depth++;
+		while (child)
+		{
+			if (fmt)
+			{
+				ptr = ensure(p, depth);	if (!ptr) return 0;
+				for (j = 0;j < depth;j++) *ptr++ = '\t';
+				p->offset += depth;
+			}
+			print_string_ptr(child->string, p);
+			p->offset = update(p);
+
+			len = fmt ? 2 : 1;
+			ptr = ensure(p, len);	if (!ptr) return 0;
+			*ptr++ = ':';if (fmt) *ptr++ = '\t';
+			p->offset += len;
+
+			print_value(child, depth, fmt, p);
+			p->offset = update(p);
+
+			len = (fmt ? 1 : 0) + (child->next ? 1 : 0);
+			ptr = ensure(p, len + 1); if (!ptr) return 0;
+			if (child->next) *ptr++ = ',';
+			if (fmt) *ptr++ = '\n';*ptr = 0;
+			p->offset += len;
+			child = child->next;
+		}
+		ptr = ensure(p, fmt ? (depth + 1) : 2);	 if (!ptr) return 0;
+		if (fmt)	for (i = 0;i < depth - 1;i++) *ptr++ = '\t';
+		*ptr++ = '}';*ptr = 0;
+		out = (p->buffer) + i;
+	}
+	else
+	{
+		/* Allocate space for the names and the objects */
+		entries = (char**)cJSON_malloc(numentries * sizeof(char*));
+		if (!entries) return 0;
+		names = (char**)cJSON_malloc(numentries * sizeof(char*));
+		if (!names) { cJSON_free(entries);return 0; }
+		memset(entries, 0, sizeof(char*) * numentries);
+		memset(names, 0, sizeof(char*) * numentries);
+
+		/* Collect all the results into our arrays: */
+		child = item->child;depth++;if (fmt) len += depth;
+		while (child)
+		{
+			names[i] = str = print_string_ptr(child->string, 0);
+			entries[i++] = ret = print_value(child, depth, fmt, 0);
+			if (str && ret) len += strlen(ret) + strlen(str) + 2 + (fmt ? 2 + depth : 0); else fail = 1;
+			child = child->next;
+		}
+
+		/* Try to allocate the output string */
+		if (!fail)	out = (char*)cJSON_malloc(len);
+		if (!out) fail = 1;
+
+		/* Handle failure */
+		if (fail)
+		{
+			for (i = 0;i < numentries;i++) { if (names[i]) cJSON_free(names[i]);if (entries[i]) cJSON_free(entries[i]); }
+			cJSON_free(names);cJSON_free(entries);
+			return 0;
+		}
+
+		/* Compose the output: */
+		*out = '{';ptr = out + 1;if (fmt)*ptr++ = '\n';*ptr = 0;
+		for (i = 0;i < numentries;i++)
+		{
+			if (fmt) for (j = 0;j < depth;j++) *ptr++ = '\t';
+			tmplen = strlen(names[i]);memcpy(ptr, names[i], tmplen);ptr += tmplen;
+			*ptr++ = ':';if (fmt) *ptr++ = '\t';
+			strcpy(ptr, entries[i]);ptr += strlen(entries[i]);
+			if (i != numentries - 1) *ptr++ = ',';
+			if (fmt) *ptr++ = '\n';*ptr = 0;
+			cJSON_free(names[i]);cJSON_free(entries[i]);
+		}
+
+		cJSON_free(names);cJSON_free(entries);
+		if (fmt) for (i = 0;i < depth - 1;i++) *ptr++ = '\t';
+		*ptr++ = '}';*ptr++ = 0;
+	}
+	return out;
+}
+
+/* Get Array size/item / object item. */
+int    cJSON_GetArraySize(cJSON* array) { cJSON* c = array->child;int i = 0;while (c)i++, c = c->next;return i; }
+cJSON* cJSON_GetArrayItem(cJSON* array, int item) { cJSON* c = array->child;  while (c && item > 0) item--, c = c->next; return c; }
+cJSON* cJSON_GetObjectItem(cJSON* object, const char* string) { cJSON* c = object->child; while (c && cJSON_strcasecmp(c->string, string)) c = c->next; return c; }
+
+/* Utility for array list handling. */
+static void suffix_object(cJSON* prev, cJSON* item) { prev->next = item;item->prev = prev; }
+/* Utility for handling references. */
+static cJSON* create_reference(cJSON* item) { cJSON* ref = cJSON_New_Item();if (!ref) return 0;memcpy(ref, item, sizeof(cJSON));ref->string = 0;ref->type |= cJSON_IsReference;ref->next = ref->prev = 0;return ref; }
+
+/* Add item to array/object. */
+void   cJSON_AddItemToArray(cJSON* array, cJSON* item) { cJSON* c = array->child;if (!item) return; if (!c) { array->child = item; } else { while (c && c->next) c = c->next; suffix_object(c, item); } }
+void   cJSON_AddItemToObject(cJSON* object, const char* string, cJSON* item) { if (!item) return; if (item->string) cJSON_free(item->string);item->string = cJSON_strdup(string);cJSON_AddItemToArray(object, item); }
+void   cJSON_AddItemToObjectCS(cJSON* object, const char* string, cJSON* item) { if (!item) return; if (!(item->type & cJSON_StringIsConst) && item->string) cJSON_free(item->string);item->string = (char*)string;item->type |= cJSON_StringIsConst;cJSON_AddItemToArray(object, item); }
+void	cJSON_AddItemReferenceToArray(cJSON* array, cJSON* item) { cJSON_AddItemToArray(array, create_reference(item)); }
+void	cJSON_AddItemReferenceToObject(cJSON* object, const char* string, cJSON* item) { cJSON_AddItemToObject(object, string, create_reference(item)); }
+
+cJSON* cJSON_DetachItemFromArray(cJSON* array, int which) {
+	cJSON* c = array->child;while (c && which > 0) c = c->next, which--;if (!c) return 0;
+	if (c->prev) c->prev->next = c->next;if (c->next) c->next->prev = c->prev;if (c == array->child) array->child = c->next;c->prev = c->next = 0;return c;
+}
+void   cJSON_DeleteItemFromArray(cJSON* array, int which) { cJSON_Delete(cJSON_DetachItemFromArray(array, which)); }
+cJSON* cJSON_DetachItemFromObject(cJSON* object, const char* string) { int i = 0;cJSON* c = object->child;while (c && cJSON_strcasecmp(c->string, string)) i++, c = c->next;if (c) return cJSON_DetachItemFromArray(object, i);return 0; }
+void   cJSON_DeleteItemFromObject(cJSON* object, const char* string) { cJSON_Delete(cJSON_DetachItemFromObject(object, string)); }
+
+/* Replace array/object items with new ones. */
+void   cJSON_InsertItemInArray(cJSON* array, int which, cJSON* newitem) {
+	cJSON* c = array->child;while (c && which > 0) c = c->next, which--;if (!c) { cJSON_AddItemToArray(array, newitem);return; }
+	newitem->next = c;newitem->prev = c->prev;c->prev = newitem;if (c == array->child) array->child = newitem; else newitem->prev->next = newitem;
+}
+void   cJSON_ReplaceItemInArray(cJSON* array, int which, cJSON* newitem) {
+	cJSON* c = array->child;while (c && which > 0) c = c->next, which--;if (!c) return;
+	newitem->next = c->next;newitem->prev = c->prev;if (newitem->next) newitem->next->prev = newitem;
+	if (c == array->child) array->child = newitem; else newitem->prev->next = newitem;c->next = c->prev = 0;cJSON_Delete(c);
+}
+void   cJSON_ReplaceItemInObject(cJSON* object, const char* string, cJSON* newitem) { int i = 0;cJSON* c = object->child;while (c && cJSON_strcasecmp(c->string, string))i++, c = c->next;if (c) { newitem->string = cJSON_strdup(string);cJSON_ReplaceItemInArray(object, i, newitem); } }
+
+/* Create basic types: */
+cJSON* cJSON_CreateNull(void) { cJSON* item = cJSON_New_Item();if (item)item->type = cJSON_NULL;return item; }
+cJSON* cJSON_CreateTrue(void) { cJSON* item = cJSON_New_Item();if (item)item->type = cJSON_True;return item; }
+cJSON* cJSON_CreateFalse(void) { cJSON* item = cJSON_New_Item();if (item)item->type = cJSON_False;return item; }
+cJSON* cJSON_CreateBool(int b) { cJSON* item = cJSON_New_Item();if (item)item->type = b ? cJSON_True : cJSON_False;return item; }
+cJSON* cJSON_CreateNumber(double num) { cJSON* item = cJSON_New_Item();if (item) { item->type = cJSON_Number;item->valuedouble = num;item->valueint = (int)num; }return item; }
+cJSON* cJSON_CreateString(const char* string) { cJSON* item = cJSON_New_Item();if (item) { item->type = cJSON_String;item->valuestring = cJSON_strdup(string); }return item; }
+cJSON* cJSON_CreateArray(void) { cJSON* item = cJSON_New_Item();if (item)item->type = cJSON_Array;return item; }
+cJSON* cJSON_CreateObject(void) { cJSON* item = cJSON_New_Item();if (item)item->type = cJSON_Object;return item; }
+
+/* Create Arrays: */
+cJSON* cJSON_CreateIntArray(const int* numbers, int count) { int i;cJSON* n = 0, * p = 0, * a = cJSON_CreateArray();for (i = 0;a && i < count;i++) { n = cJSON_CreateNumber(numbers[i]);if (!i)a->child = n;else suffix_object(p, n);p = n; }return a; }
+cJSON* cJSON_CreateFloatArray(const float* numbers, int count) { int i;cJSON* n = 0, * p = 0, * a = cJSON_CreateArray();for (i = 0;a && i < count;i++) { n = cJSON_CreateNumber(numbers[i]);if (!i)a->child = n;else suffix_object(p, n);p = n; }return a; }
+cJSON* cJSON_CreateDoubleArray(const double* numbers, int count) { int i;cJSON* n = 0, * p = 0, * a = cJSON_CreateArray();for (i = 0;a && i < count;i++) { n = cJSON_CreateNumber(numbers[i]);if (!i)a->child = n;else suffix_object(p, n);p = n; }return a; }
+cJSON* cJSON_CreateStringArray(const char** strings, int count) { int i;cJSON* n = 0, * p = 0, * a = cJSON_CreateArray();for (i = 0;a && i < count;i++) { n = cJSON_CreateString(strings[i]);if (!i)a->child = n;else suffix_object(p, n);p = n; }return a; }
+
+/* Duplication */
+cJSON* cJSON_Duplicate(cJSON* item, int recurse)
+{
+	cJSON* newitem, * cptr, * nptr = 0, * newchild;
+	/* Bail on bad ptr */
+	if (!item) return 0;
+	/* Create new item */
+	newitem = cJSON_New_Item();
+	if (!newitem) return 0;
+	/* Copy over all vars */
+	newitem->type = item->type & (~cJSON_IsReference), newitem->valueint = item->valueint, newitem->valuedouble = item->valuedouble;
+	if (item->valuestring) { newitem->valuestring = cJSON_strdup(item->valuestring);	if (!newitem->valuestring) { cJSON_Delete(newitem);return 0; } }
+	if (item->string) { newitem->string = cJSON_strdup(item->string);			if (!newitem->string) { cJSON_Delete(newitem);return 0; } }
+	/* If non-recursive, then we're done! */
+	if (!recurse) return newitem;
+	/* Walk the ->next chain for the child. */
+	cptr = item->child;
+	while (cptr)
+	{
+		newchild = cJSON_Duplicate(cptr, 1);		/* Duplicate (with recurse) each item in the ->next chain */
+		if (!newchild) { cJSON_Delete(newitem);return 0; }
+		if (nptr) { nptr->next = newchild, newchild->prev = nptr;nptr = newchild; }	/* If newitem->child already set, then crosswire ->prev and ->next and move on */
+		else { newitem->child = newchild;nptr = newchild; }					/* Set newitem->child and move to it */
+		cptr = cptr->next;
+	}
+	return newitem;
+}
+
+void cJSON_Minify(char* json)
+{
+	char* into = json;
+	while (*json)
+	{
+		if (*json == ' ') json++;
+		else if (*json == '\t') json++;	/* Whitespace characters. */
+		else if (*json == '\r') json++;
+		else if (*json == '\n') json++;
+		else if (*json == '/' && json[1] == '/')  while (*json && *json != '\n') json++;	/* double-slash comments, to end of line. */
+		else if (*json == '/' && json[1] == '*') { while (*json && !(*json == '*' && json[1] == '/')) json++;json += 2; }	/* multiline comments. */
+		else if (*json == '\"') { *into++ = *json++;while (*json && *json != '\"') { if (*json == '\\') *into++ = *json++;*into++ = *json++; }*into++ = *json++; } /* string literals, which are \" sensitive. */
+		else *into++ = *json++;			/* All other characters. */
+	}
+	*into = 0;	/* and null-terminate. */
+}
diff --git a/General/General/cJSON.h b/General/General/cJSON.h
new file mode 100644
index 0000000..84f0fc8
--- /dev/null
+++ b/General/General/cJSON.h
@@ -0,0 +1,149 @@
+/*
+  Copyright (c) 2009 Dave Gamble
+
+  Permission is hereby granted, free of charge, to any person obtaining a copy
+  of this software and associated documentation files (the "Software"), to deal
+  in the Software without restriction, including without limitation the rights
+  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+  copies of the Software, and to permit persons to whom the Software is
+  furnished to do so, subject to the following conditions:
+
+  The above copyright notice and this permission notice shall be included in
+  all copies or substantial portions of the Software.
+
+  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+  THE SOFTWARE.
+*/
+
+#ifndef cJSON__h
+#define cJSON__h
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+
+	/* cJSON Types: */
+#define cJSON_False 0
+#define cJSON_True 1
+#define cJSON_NULL 2
+#define cJSON_Number 3
+#define cJSON_String 4
+#define cJSON_Array 5
+#define cJSON_Object 6
+
+#define cJSON_IsReference 256
+#define cJSON_StringIsConst 512
+
+/* The cJSON structure: */
+	typedef struct cJSON {
+		struct cJSON* next, * prev;	/* next/prev allow you to walk array/object chains. Alternatively, use GetArraySize/GetArrayItem/GetObjectItem */
+		struct cJSON* child;		/* An array or object item will have a child pointer pointing to a chain of the items in the array/object. */
+
+		int type;					/* The type of the item, as above. */
+
+		char* valuestring;			/* The item's string, if type==cJSON_String */
+		int valueint;				/* The item's number, if type==cJSON_Number */
+		double valuedouble;			/* The item's number, if type==cJSON_Number */
+
+		char* string;				/* The item's name string, if this item is the child of, or is in the list of subitems of an object. */
+	} cJSON;
+
+	typedef struct cJSON_Hooks {
+		void* (*malloc_fn)(size_t sz);
+		void (*free_fn)(void* ptr);
+	} cJSON_Hooks;
+
+	/* Supply malloc, realloc and free functions to cJSON */
+	extern void cJSON_InitHooks(cJSON_Hooks* hooks);
+
+
+	/* Supply a block of JSON, and this returns a cJSON object you can interrogate. Call cJSON_Delete when finished. */
+	extern cJSON* cJSON_Parse(const char* value);
+	/* Render a cJSON entity to text for transfer/storage. Free the char* when finished. */
+	extern char* cJSON_Print(cJSON* item);
+	/* Render a cJSON entity to text for transfer/storage without any formatting. Free the char* when finished. */
+	extern char* cJSON_PrintUnformatted(cJSON* item);
+	/* Render a cJSON entity to text using a buffered strategy. prebuffer is a guess at the final size. guessing well reduces reallocation. fmt=0 gives unformatted, =1 gives formatted */
+	extern char* cJSON_PrintBuffered(cJSON* item, int prebuffer, int fmt);
+	/* Delete a cJSON entity and all subentities. */
+	extern void   cJSON_Delete(cJSON* c);
+
+	/* Returns the number of items in an array (or object). */
+	extern int	  cJSON_GetArraySize(cJSON* array);
+	/* Retrieve item number "item" from array "array". Returns NULL if unsuccessful. */
+	extern cJSON* cJSON_GetArrayItem(cJSON* array, int item);
+	/* Get item "string" from object. Case insensitive. */
+	extern cJSON* cJSON_GetObjectItem(cJSON* object, const char* string);
+
+	/* For analysing failed parses. This returns a pointer to the parse error. You'll probably need to look a few chars back to make sense of it. Defined when cJSON_Parse() returns 0. 0 when cJSON_Parse() succeeds. */
+	extern const char* cJSON_GetErrorPtr(void);
+
+	/* These calls create a cJSON item of the appropriate type. */
+	extern cJSON* cJSON_CreateNull(void);
+	extern cJSON* cJSON_CreateTrue(void);
+	extern cJSON* cJSON_CreateFalse(void);
+	extern cJSON* cJSON_CreateBool(int b);
+	extern cJSON* cJSON_CreateNumber(double num);
+	extern cJSON* cJSON_CreateString(const char* string);
+	extern cJSON* cJSON_CreateArray(void);
+	extern cJSON* cJSON_CreateObject(void);
+
+	/* These utilities create an Array of count items. */
+	extern cJSON* cJSON_CreateIntArray(const int* numbers, int count);
+	extern cJSON* cJSON_CreateFloatArray(const float* numbers, int count);
+	extern cJSON* cJSON_CreateDoubleArray(const double* numbers, int count);
+	extern cJSON* cJSON_CreateStringArray(const char** strings, int count);
+
+	/* Append item to the specified array/object. */
+	extern void cJSON_AddItemToArray(cJSON* array, cJSON* item);
+	extern void	cJSON_AddItemToObject(cJSON* object, const char* string, cJSON* item);
+	extern void	cJSON_AddItemToObjectCS(cJSON* object, const char* string, cJSON* item);	/* Use this when string is definitely const (i.e. a literal, or as good as), and will definitely survive the cJSON object */
+	/* Append reference to item to the specified array/object. Use this when you want to add an existing cJSON to a new cJSON, but don't want to corrupt your existing cJSON. */
+	extern void cJSON_AddItemReferenceToArray(cJSON* array, cJSON* item);
+	extern void	cJSON_AddItemReferenceToObject(cJSON* object, const char* string, cJSON* item);
+
+	/* Remove/Detatch items from Arrays/Objects. */
+	extern cJSON* cJSON_DetachItemFromArray(cJSON* array, int which);
+	extern void   cJSON_DeleteItemFromArray(cJSON* array, int which);
+	extern cJSON* cJSON_DetachItemFromObject(cJSON* object, const char* string);
+	extern void   cJSON_DeleteItemFromObject(cJSON* object, const char* string);
+
+	/* Update array items. */
+	extern void cJSON_InsertItemInArray(cJSON* array, int which, cJSON* newitem);	/* Shifts pre-existing items to the right. */
+	extern void cJSON_ReplaceItemInArray(cJSON* array, int which, cJSON* newitem);
+	extern void cJSON_ReplaceItemInObject(cJSON* object, const char* string, cJSON* newitem);
+
+	/* Duplicate a cJSON item */
+	extern cJSON* cJSON_Duplicate(cJSON* item, int recurse);
+	/* Duplicate will create a new, identical cJSON item to the one you pass, in new memory that will
+	need to be released. With recurse!=0, it will duplicate any children connected to the item.
+	The item->next and ->prev pointers are always zero on return from Duplicate. */
+
+	/* ParseWithOpts allows you to require (and check) that the JSON is null terminated, and to retrieve the pointer to the final byte parsed. */
+	extern cJSON* cJSON_ParseWithOpts(const char* value, const char** return_parse_end, int require_null_terminated);
+
+	extern void cJSON_Minify(char* json);
+
+	/* Macros for creating things quickly. */
+#define cJSON_AddNullToObject(object,name)		cJSON_AddItemToObject(object, name, cJSON_CreateNull())
+#define cJSON_AddTrueToObject(object,name)		cJSON_AddItemToObject(object, name, cJSON_CreateTrue())
+#define cJSON_AddFalseToObject(object,name)		cJSON_AddItemToObject(object, name, cJSON_CreateFalse())
+#define cJSON_AddBoolToObject(object,name,b)	cJSON_AddItemToObject(object, name, cJSON_CreateBool(b))
+#define cJSON_AddNumberToObject(object,name,n)	cJSON_AddItemToObject(object, name, cJSON_CreateNumber(n))
+#define cJSON_AddStringToObject(object,name,s)	cJSON_AddItemToObject(object, name, cJSON_CreateString(s))
+
+/* When assigning an integer value, it needs to be propagated to valuedouble too. */
+#define cJSON_SetIntValue(object,val)			((object)?(object)->valueint=(object)->valuedouble=(val):(val))
+#define cJSON_SetNumberValue(object,val)		((object)?(object)->valueint=(object)->valuedouble=(val):(val))
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/General/General/chintP.cpp b/General/General/chintP.cpp
new file mode 100644
index 0000000..f75bd6b
--- /dev/null
+++ b/General/General/chintP.cpp
@@ -0,0 +1,29 @@
+#include <ostream>
+#include <iostream>
+#include <epm/signoff.h>
+#include "epm_handler_common.h"
+int chintP(EPM_action_message_t msg)
+{
+	tag_t task = msg.task;
+	std::cout<<"1111"<< std::endl;
+
+	char *comments2=NULL;
+	date_t decision_date;
+	EPM_signoff_decision_t dec;
+	EPM_ask_signoff_decision(task, &dec, &comments2, &decision_date);
+
+
+	if(dec==78)
+	{
+		std::cout<<"78�ܾ�"<< std::endl;
+		
+	}else if(dec==0)
+	{
+		std::cout<<"0"<< std::endl;
+	}else if(dec==89)
+	{
+		std::cout<<"89��׼"<< std::endl;
+		
+	}
+	return 0;
+}
diff --git a/General/General/chintProperty.cpp b/General/General/chintProperty.cpp
new file mode 100644
index 0000000..1d0bc85
--- /dev/null
+++ b/General/General/chintProperty.cpp
@@ -0,0 +1,774 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+
+#include <cstdio>
+
+
+#include <epm/epm.h>
+#include <ict/ict_userservice.h>
+#include <tccore/item.h>
+#include <ae/ae.h>
+#include <tc/folder.h>
+#include <tccore/aom.h>
+#include <sa/sa.h>
+#include <tccore/aom_prop.h>
+#include <tccore/workspaceobject.h>
+#include <tccore//grm.h>
+#include <tccore/grmtype.h>
+#include <bom/bom.h>
+#include <fclasses/tc_date.h>
+// #include <stdio.h>
+// #include <string.h>
+#include <vector>
+#include "error_handling.h"
+#include "common_itk_util.h"
+#include "epm_handler_common.h"
+#include <epm/signoff.h>
+#include <iostream>
+#include "tc_util.h"
+#include "string_utils.h"
+using namespace std;
+//���̽ڵ���Ϣ
+struct TXFLOWNODEINFOS
+{
+	char taskname[128];
+	char username[128];
+	char timeinfo[128];
+	//2019.12.2����ע�ͣ�ע��ֻ�������У���û��
+	char commentsinfo[256];
+	char group[128];
+}flownode_s[64];
+
+//������Ա��Ϣ
+struct TXUSERINFOS
+{
+	char taskname[128];
+	char propertyname[128];
+	char group[128];
+}userinfo_s[64];
+//�����Ѿ�����Ϣ
+struct TXCOMMENTSINFOS
+{
+	char taskname[128];
+	char propertyname[128];
+	char group[128];
+}commentsinfo_s[64];
+//����������Ϣ
+struct TXTIMEINFOS
+{
+	char taskname[128];
+	char propertyname[128];
+	char group[128];
+}timeinfo_s[64];
+
+
+
+int txnodecount = 0;
+int txuserinfoscount = 0;
+int txtimeinfoscount = 0;
+int txcommentsinfoscount = 0;
+
+typedef struct{
+	string TaskUserName;
+	string TaskTimeName;
+	string UserName;
+	string TimeStr;
+	string GroupName;
+	string PropUserName;
+	string PropTimeName;
+}TXNOTICE_NODE;
+void txSplitUserInfo(char *userinfo)
+{
+	char* token = NULL, *ptr = NULL, temp[512] = "";
+
+	token = strtok( userinfo, ";");
+	while( token != NULL )
+	{
+		/* While there are tokens in "string" */
+		strcpy(temp,token);
+		ECHO( "token=%s\n", token );
+		ptr = strstr(temp, "=");
+		if (ptr != NULL)
+		{	
+			strcpy(userinfo_s[txuserinfoscount].propertyname, ptr +1);
+			strcpy(ptr,"\0");
+			strcpy(userinfo_s[txuserinfoscount].taskname ,temp);
+			ECHO("\nuserinfo_s[userinfoscount].taskname=%s,userinfo_s[userinfoscount].propertyname=%s\n",
+				userinfo_s[txuserinfoscount].taskname,userinfo_s[txuserinfoscount].propertyname);
+		}
+		txuserinfoscount ++;
+		/* Get next token: */
+		token = strtok( NULL, ";");
+	}
+}
+void txSplitCommentsInfo(char *commentsInfo)
+{
+	char* token = NULL, *ptr = NULL, temp[512] = "";
+
+	token = strtok( commentsInfo, ";");
+	while( token != NULL )
+	{
+		/* While there are tokens in "string" */
+		strcpy(temp,token);
+		ECHO( "token=%s\n", token );
+		ptr = strstr(temp, "=");
+		if (ptr != NULL)
+		{	
+			strcpy(commentsinfo_s[txcommentsinfoscount].propertyname, ptr +1);
+			strcpy(ptr,"\0");
+			strcpy(commentsinfo_s[txcommentsinfoscount].taskname ,temp);
+			ECHO("\ncommentsinfo_s[userinfoscount].taskname=%s,commentsinfo_s[userinfoscount].propertyname=%s\n",
+				commentsinfo_s[txcommentsinfoscount].taskname,commentsinfo_s[txcommentsinfoscount].propertyname);
+		}
+		txcommentsinfoscount ++;
+		/* Get next token: */
+		token = strtok( NULL, ";");
+	}
+}
+void txSplitTimeInfo(char *userinfo)
+{
+	char* token = NULL, *ptr = NULL, temp[512] = "";
+
+	token = strtok( userinfo, ";");
+	while( token != NULL )
+	{
+		/* While there are tokens in "string" */
+		strcpy(temp,token);
+		ECHO( "token=%s\n", token );
+		ptr = strstr(temp, "=");
+		if (ptr != NULL)
+		{	
+			strcpy(timeinfo_s[txtimeinfoscount].propertyname, ptr +1);
+			strcpy(ptr,"\0");
+			strcpy(timeinfo_s[txtimeinfoscount].taskname ,temp);
+			ECHO("\ntimeinfo_s[txtimeinfoscount].taskname=%s,timeinfo_s[txtimeinfoscount].propertyname=%s\n",timeinfo_s[txtimeinfoscount].taskname,timeinfo_s[txtimeinfoscount].propertyname);
+
+		}
+		txtimeinfoscount ++;
+		/* Get next token: */
+		token = strtok( NULL, ";");
+	}
+}
+int tx_ORIGIN_ask_sign_info(tag_t task_node, char *output_str,char *task_name,char *arg3value,char *arg4value)
+{
+	int ifail = ITK_ok;
+	tag_t cur_perform_task = NULLTAG,tempTask = NULLTAG;
+	char cur_task_name[WSO_name_size_c+1]="",buf[128] = "";
+	//�����жϱ���
+	int s = 0;
+	EPM_decision_t decision = EPM_nogo;
+	char* userName;
+	char *timeinfo1 = "",person_name[SA_name_size_c+1]="",*prop_name = "last_mod_date";
+	tag_t aUserTag = NULLTAG,responsibleParty = NULLTAG;
+	date_t decision_date;
+	//�����ڵ����
+	int perform_count = 0;
+	int *attach_type;
+	tag_t *perform_attaches = NULLTAG;
+	tag_t memberTag = NULLTAG;
+	SIGNOFF_TYPE_t memberType;
+	CR_signoff_decision_t signoff_decision;
+	EPM_signoff_decision_t dec;
+	char *timeinfo="",*group_full_name = NULL;
+	tag_t user_tag=NULLTAG, group_tag = NULLTAG;
+	//ѭ���жϱ���
+	int i=0;
+
+	EPM_ask_name( task_node, cur_task_name ) ; 
+	ECHO("cur_task_name = %s\n",cur_task_name);
+	if ( stricmp( cur_task_name, "perform-signoffs" ) == 0 )
+	{
+		cur_perform_task = task_node;
+		//�õ����ڵ�
+		EPM_ask_parent_task( cur_perform_task, &tempTask );
+		EPM_ask_name( tempTask, cur_task_name );
+	}
+	else if( strcmp( cur_task_name, "����" ) == 0 || strcmp( cur_task_name, "���" ) == 0)
+	{
+		cur_perform_task = task_node;
+	}else if(strcmp( cur_task_name, "��ǩ" ) == 0)
+	{
+		//EPM_Review
+		//tag_t reviem_task;
+		//EPM_ask_sub_task(task_node, "Review Task", &reviem_task) ;
+		//if(reviem_task!=NULLTAG)
+		//{
+		EPM_ask_sub_task(task_node, "perform-signoffs", &cur_perform_task) ;
+		//}
+		ECHO("��û�ǩ��˽ڵ�");
+		if (cur_perform_task != NULLTAG)
+		{
+			EPM_ask_name(task_node, cur_task_name);
+
+			ECHO("--------->		cur_task_name = %s\n", cur_task_name);
+
+		}
+	}
+	else
+	{
+		
+		EPM_ask_sub_task(task_node, "perform-signoffs", &cur_perform_task) ;
+		if ( cur_perform_task != NULLTAG )
+		{
+			EPM_ask_name( task_node, cur_task_name  );
+
+			ECHO( "--------->		cur_task_name = %s\n" , cur_task_name );
+
+		}
+	}
+
+	if(cur_perform_task != NULLTAG )
+	{
+		char type[WSO_name_size_c+1] = "";
+		WSOM_ask_object_type(cur_perform_task,type);
+		ECHO("current task type = %s\n", type);
+		cout<<"type--------"<<type<<endl;
+		if( strcmp( cur_task_name, "����" ) == 0||strcmp( cur_task_name, "���" ) == 0 )
+		{
+			tag_t owner = NULLTAG;
+			ECHO("task_name=%s\n",task_name);
+			cout<<"����type--------"<<type<<endl;
+			s = EPM_ask_responsible_party(cur_perform_task,&responsibleParty);
+			//EPM_ask_reviewers();
+			if(responsibleParty != NULLTAG)
+			{
+				decision = EPM_go;
+			}
+			AOM_ask_owner( cur_perform_task, &owner);
+			//s = POM_get_user(&userName,&aUserTag);
+			if( owner != NULLTAG )
+				SA_ask_user_person_name(owner, person_name);
+			ECHO("person_name=%s\n",person_name);
+			strcat(output_str, cur_task_name);
+			strcat(output_str, "=");
+			strcat(output_str, person_name);
+			strcat(output_str, "|");
+			strcat(output_str, cur_task_name);
+			strcat(output_str, "����=");
+			AOM_ask_value_date(cur_perform_task,prop_name,&decision_date);
+			DATE_date_to_string(decision_date,arg3value,&timeinfo1);
+			ECHO("\n-------\ntimeinfo 111 : %s\n------------\n",timeinfo1);
+			//ITK_date_to_string (decision_date, &timeinfo1);  2017.11.23 ����ʱ�串�ǵ���,ע��
+			strcat( output_str, timeinfo1 );
+			strcat(output_str,"|");
+			char *comments=NULL;
+			AOM_ask_value_string(cur_perform_task,"comments",&comments);
+			strcat(output_str, cur_task_name);
+			strcat(output_str, "ע��");
+			strcat(output_str, "=");
+			strcat(output_str, comments);
+			strcat(output_str, "|");
+			ECHO("timeinfo : %s",timeinfo1);
+			strcpy(flownode_s[txnodecount].taskname,cur_task_name);
+			strcpy(flownode_s[txnodecount].username,person_name);
+			strcpy(flownode_s[txnodecount].commentsinfo,comments);
+			strcpy(flownode_s[txnodecount].timeinfo,timeinfo1);
+			txnodecount = txnodecount + 1;
+			if(comments!=	NULL)
+			{
+				MEM_free(comments);
+				comments=NULL;
+			}
+			//MEM_free(userName);
+		}
+		else
+		{
+			//�����˼�������
+			tag_t owner = NULLTAG;
+			date_t date;
+			logical is_valid;
+			char *d_value = NULL;
+			AOM_ask_owner( cur_perform_task, &owner);
+			if( owner != NULLTAG )
+				SA_ask_user_person_name(owner, person_name);
+			AOM_ask_value_date(cur_perform_task,"creation_date", &date);//fnd0StartDate
+			DATE_date_to_string(date,arg3value,&d_value);
+			//ITKCALL(AOM_UIF_ask_value( cur_perform_task, "fnd0StartDate", &d_value));
+			ECHO("d_value : %s",d_value);
+			/*	strcat(output_str, "���");
+			strcat(output_str, "=");
+			strcat(output_str, person_name);
+			strcat(output_str, "|");
+			strcat(output_str, "�������=");
+			//CALL(DATE_date_to_string(date,arg3value,&timeinfo));
+			//ITKCALL(DATE_string_to_date_t(d_value, &is_valid,&date)); 
+			//CALL(DATE_date_to_string(date,arg3value,&timeinfo));
+			//ECHO("timeinfo : %s",timeinfo);
+			//vector<string> ans;
+			//if( d_value != NULL )
+			//{
+			//	Split(d_value, ' ', ans);
+			//	if(ans.size() > 1)
+			//		strcat(output_str,ans[0].c_str());
+			//}
+			strcat(output_str,d_value);
+			//DOFREE(timeinfo);
+			strcat(output_str, "|");
+			strcpy(flownode_s[txnodecount].taskname,"���");
+			strcpy(flownode_s[txnodecount].username,person_name);
+			//if(ans.size() > 1)
+			strcpy(flownode_s[txnodecount].timeinfo,d_value);
+			txnodecount = txnodecount + 1;*/
+			ECHO("output_str=%s",output_str);
+			EPM_ask_all_attachments(cur_perform_task,&perform_count,&perform_attaches,&attach_type);
+			ECHO("EPM_signoff_attachment Counts = %d", perform_count);
+
+			for(i=0;i<perform_count;i++)
+			{
+				EPM_ask_signoff_member(perform_attaches[i], &memberTag, &memberType);
+				// CR_ask_signoff_decision(perform_attaches[i], &signoff_decision, comments, &decision_date);
+
+				// cout<<"ע��1-------------"<<comments<<endl;
+				char *comments2=NULL;
+				EPM_ask_signoff_decision(perform_attaches[i], &dec, &comments2, &decision_date);
+				cout<<"ע��2-------------"<<comments2<<endl;
+
+				if(memberType == SIGNOFF_GROUPMEMBER)
+				{
+					ECHO("cur_task_name = %s",cur_task_name);
+					SA_ask_groupmember_user(memberTag, &user_tag);
+					SA_ask_user_person_name(user_tag, person_name);
+					strcat(output_str, cur_task_name);
+					strcat(output_str, "=");
+					strcat(output_str, person_name);
+					strcat(output_str, "|");
+					strcat(output_str, cur_task_name);
+					strcat(output_str, "����=");
+					char date_buf[128]="";
+					DATE_date_to_string(decision_date,arg3value,&timeinfo);
+					//ITKCALL(ITK_date_to_string(decision_date, &timeinfo));
+					//sprintf( date_buf, "%4d-%02d-%02d", decision_date.year, decision_date.month+1, decision_date.day );
+					ECHO("\n--------\ntimeinfo : %s\n---------\n",timeinfo);
+					strcat(output_str,timeinfo);
+					strcat(output_str, "|");
+					if(arg4value!=NULL)
+					{
+						strcat(output_str, cur_task_name);
+						strcat(output_str, "ע��=");
+						strcat(output_str, comments2);
+						strcat(output_str, "|");
+					}
+					strcpy(flownode_s[txnodecount].taskname,cur_task_name);
+					strcpy(flownode_s[txnodecount].username,person_name);
+					strcpy(flownode_s[txnodecount].timeinfo,timeinfo);
+					strcpy(flownode_s[txnodecount].commentsinfo,comments2);
+					txnodecount = txnodecount + 1;
+				}
+				if(comments2!=NULL)
+				{
+					MEM_free(comments2);
+					comments2=NULL;
+				}
+			}
+		}
+	}
+
+	ECHO("output_str=%s",output_str);
+	return ifail;
+}
+int chintProperty(EPM_action_message_t msg)
+{
+	//EPM_rule_message_t rul_msg;
+	int ifail = ITK_ok, rcode = 0;
+	//�������
+	char arg1value[1024] = "",arg2value[1024] = "",arg3value[1024]="",arg4value[1024]="",
+		signcounter_info[1024] = "";
+	char *argflag =NULL,*argvalue=NULL ,*arg = NULL;
+	BOOL bypass = FALSE,setboth = TRUE,signPic=FALSE;
+	int arg_cnt = 0;
+	//���̽ڵ����
+	tag_t root_task = NULLTAG,*sub_tasks = NULL,current_task = NULLTAG,type_tag = NULLTAG;
+	int sub_task_count = 0;
+	char root_task_name[128]="",task_name[128] = "";
+	int occur_of_counts = 0;
+	tag_t *taskAttches = NULLTAG;
+	char tgt_type[WSO_name_size_c+1]="",type_class[TCTYPE_class_name_size_c+1]="";
+	////ѭ���ڲ�����
+	tag_t cur_task = NULLTAG;
+	char task_type[WSO_name_size_c+1] = "";
+	//ѭ������
+	int i=0, j=0, k=0, count = 0, n = 0;
+	//�ڵ���Ϣ����
+	char sign_info[2048]="";
+	//�ڵ�ѭ����������
+	tag_t itemrevision = NULLTAG;
+	char rev_id[ITEM_id_size_c+1]="";
+	char item_id[ITEM_id_size_c+1]="";
+	int form_count = 0;
+	tag_t master_form = NULLTAG;
+	char local_path[128]="";
+	//���ƽڵ�
+	int s=0;
+	char *timeinfo2="";
+	EPM_decision_t decision = EPM_nogo;
+	tag_t aUserTag,responsibleParty;
+	char *userName;
+	date_t decision_date;
+	char person_name[SA_name_size_c + 1] = "";
+	char *prop_name="last_mod_date";
+	////��¼��Ϣ
+	//char *user_name = NULL, *group_full_name = NULL;
+	//tag_t user_tag = NULLTAG, group_tag = NULLTAG;
+
+	//char *txtfile = NULL;
+	//��ǩ���
+	int n_prop=0, q = 0;
+	char **prop_names=NULL, hq_name[128] = "", hq_time_name[128] = "", *hq_value=NULL;
+	char exclude_type[256]="", item_type[ITEM_type_size_c+ 1]= "";
+	tag_t item = NULLTAG;
+	logical is_sign = false;
+
+	//�õ������˺����Ľڵ�
+	current_task = msg.task;
+	//CreateLogFile("PLA8_signoff",&txtfile);
+	ECHO("=========================================================\n");
+	ECHO("chintProperty ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	//��ȡhandler�IJ����ĸ���
+	arg_cnt = TC_number_of_arguments(msg.arguments);
+	ECHO("����������%d\n",arg_cnt);
+	if (arg_cnt > 0)
+	{
+		for (i=0;i<arg_cnt;i++)
+		{
+			//��ȡ��һ����������0��ʼ��
+			arg = TC_next_argument(msg.arguments);
+			//��ȡ���������ƺ�ֵ
+			ifail = ITK_ask_argument_named_value((const char*)arg, &argflag, &argvalue);
+			if (stricmp(argflag, "SignUserName") == 0)
+			{
+				//strcmp("","");
+				if(argvalue != NULL)
+				{
+					strcpy(arg1value,argvalue);
+				}
+			}
+			else if(stricmp(argflag, "SignDate") == 0)
+			{
+				if(argvalue != NULL)
+				{
+					strcpy(arg2value,argvalue);
+				}
+			}
+			else if(stricmp(argflag,"SignDateFormate") == 0)
+			{
+				if(argvalue != NULL)
+				{
+					strcpy(arg3value,argvalue);
+				}
+			}
+			else if(stricmp(argflag,"bypass") == 0)
+			{
+				bypass = TRUE;
+			}else if(stricmp(argflag,"setboth") == 0){
+				setboth = FALSE;
+			}
+			
+
+
+		}
+		MEM_free(argflag);
+		MEM_free(argvalue);
+	}
+	ITK_set_bypass(TRUE);
+	ECHO("SignUserName : %s\n",arg1value);
+	ECHO("SignDate : %s\n",arg2value);
+	txSplitUserInfo(arg1value);
+	ECHO("2222\n");
+	txSplitTimeInfo(arg2value);
+	// txSplitCommentsInfo(arg4value);
+	//getCounterinfo(signcounter_info);
+	ECHO("3333\n");
+	vector<string> type_vec;
+
+	//Split(exclude_type,";",type_vec);
+	//20200522 ��ѡ�����ʽ
+vector<string> pref_vec;
+	getPrefStrings1("Chint_Object_Type",TC_preference_site, pref_vec);
+	
+	ECHO("����1������%d\n",txuserinfoscount);
+	cout<<endl;
+	ECHO("����2������%d\n",txtimeinfoscount);
+	cout<<endl;
+	// ECHO("����3������%d\n",txcommentsinfoscount);
+	// cout<<endl;
+	//�õ�����handler�Ľڵ�
+	msg.task;
+	//ͨ���ڵ��ȡ������
+	EPM_ask_root_task( msg.task, &root_task );
+	//�õ��������µ����е�һ���ڵ�
+	EPM_ask_sub_tasks( root_task, &sub_task_count, &sub_tasks); 
+	//�õ������̵�����
+	EPM_ask_name( root_task, root_task_name );
+	//
+	ECHO("root_task_name=%s\n",root_task_name);
+	EPM_ask_name( current_task, task_name  );
+	ECHO( "sub_task_count = %d\n", sub_task_count );
+
+	cout<<"task_name======20200520===="<<task_name<<endl;
+
+	//��������DO�ڵ�
+	if(strcmp(task_name,"����") == 0||strcmp(task_name,"���") == 0)
+	{
+		cout<<"===========20200520disign============"<<endl;
+		ECHO("task_name:%s",task_name);
+		cout<<endl;
+		//��ȡ������
+		s = EPM_ask_responsible_party(current_task,&responsibleParty);
+		if(responsibleParty != NULLTAG)
+		{
+			decision = EPM_go;
+		}
+		//��ȡ��ǰ���û�
+		s = POM_get_user(&userName,&aUserTag);
+		//��ȡpersonname
+		SA_ask_user_person_name(aUserTag,person_name);
+		strcat(sign_info,task_name);
+		strcat(sign_info,"=");
+		strcat(sign_info,person_name);
+		strcat(sign_info,"|");
+		strcat(sign_info,task_name);
+		strcat(sign_info,"����=");
+		//POM_ask_v
+		//��ȡ�����ʱ�����ԣ�����1�����󣬲���2���������ƣ�����3����ȡ����ʱ������ֵ
+		AOM_ask_value_date(current_task,prop_name,&decision_date);
+		//AOM_UIF_ask_value(current_task,prop_name, &timeinfo2);
+		//��ʱ��ṹ��ת����Ϊij��ʱ���ʽ���ַ���
+		DATE_date_to_string(decision_date,arg3value,&timeinfo2);
+		ECHO("\n--------------\n timeinfo2=%s\n------------\n",timeinfo2);
+		strcat(sign_info,timeinfo2);
+		strcat(sign_info,"|");
+		
+		strcpy(flownode_s[txnodecount].taskname,task_name);
+		strcpy(flownode_s[txnodecount].username,person_name);
+		strcpy(flownode_s[txnodecount].timeinfo,timeinfo2);
+		strcpy(flownode_s[txnodecount].commentsinfo,timeinfo2);
+		txnodecount = txnodecount + 1;
+
+	}
+	else //perform�ڵ�
+	{
+		for(i=0;i<sub_task_count;i++)
+		{
+			cur_task = sub_tasks[i];
+			WSOM_ask_object_type(cur_task,task_type);
+			ECHO("current task type = %s\n", task_type);
+			cout<<endl;
+			tx_ORIGIN_ask_sign_info( cur_task, sign_info, task_name,arg3value,arg4value); 
+		}
+	}
+
+	ECHO("sign_info = %s\n", sign_info);
+	cout<<endl;
+	ECHO("the node number is %d",txnodecount);
+	cout<<endl;
+
+	/*
+	for(j=0; j<txuserinfoscount; j++)
+	{
+		char t_tt_name[1024] = "";
+		cout<<"txnodecount-------------------------"<<txnodecount<<endl;
+		for(k=0; k<txnodecount; k++)
+		{
+			ECHO("userinfo_s[%d].taskname=%s, flownode_s[%d].taskname=%s, flownode_s[%d].username=%s\n",j,userinfo_s[j].taskname,k,flownode_s[k].taskname,k,flownode_s[k].username);
+		}
+	}
+	if(1==1)
+		return ITK_ok;
+	*/
+
+
+	if(current_task != NULLTAG)
+	{
+		EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+		ECHO("%d target attachment found",occur_of_counts);
+		cout<<endl;
+		for( count=0; count<occur_of_counts; count++ )
+		{
+			ECHO("the %dth work",count);
+			cout<<endl;
+			char *changeType=NULL;
+			AOM_ask_value_string(taskAttches[count],"object_type",&changeType);
+			cout<<changeType<<endl;
+			logical  okSign=false;
+			for(int i = 0 ;i < pref_vec.size();i++){
+				if(strcmp(pref_vec[i].c_str(),changeType)==0)
+				{
+					okSign=true;
+					break;
+				}
+				
+			}
+			// strcmp(changeType,"ZT2_Change")==0||strcmp(changeType,"DocumentRevision")==0
+			if(okSign==true)
+			{
+				is_sign = true;
+				master_form = taskAttches[count];//form_list[0]; //�����������
+
+				cout<<"Begin set properties for name\n"<<endl;
+				AOM_load (master_form);
+				POM_AM__set_application_bypass(true);
+
+				if(setboth){
+					ECHO("Begin set both\n");
+					cout<<endl;
+					for(j=0; j<txuserinfoscount; j++)
+					{
+						char t_tt_name[1024] = "";
+						cout<<"txnodecount-------------------------"<<txnodecount<<endl;
+						for(k=0; k<txnodecount; k++)
+						{
+							ECHO("userinfo_s[%d].taskname=%s, flownode_s[%d].taskname=%s, flownode_s[%d].username=%s\n",j,userinfo_s[j].taskname,k,flownode_s[k].taskname,k,flownode_s[k].username);
+
+							if(strcmp(userinfo_s[j].taskname,flownode_s[k].taskname) == 0)
+							{
+								char  t_name[512]="\0";
+								sprintf(t_name,"%s",flownode_s[k].username);
+
+								if(strcmp(t_tt_name,"\0")==0){
+									strcat(t_tt_name,t_name);
+								}else{
+									strcat(t_tt_name,",");
+									strcat(t_tt_name,t_name);
+								}
+
+							}
+							
+						}
+
+						//POM_AM__set_application_bypass(true);
+						//��lock
+						if(strcmp(t_tt_name,"")!=0){
+							ECHO("t_tt_name_________= %s\n",t_tt_name);
+							AOM_lock(master_form);
+							ECHO("set prop %s=%s\n",userinfo_s[j].propertyname,userinfo_s[j].taskname);
+							//��set
+
+							AOM_set_value_string( master_form, userinfo_s[j].propertyname, t_tt_name) ;
+							//��save
+							AOM_save( master_form ) ;
+							//���unlock
+							AOM_unlock( master_form ) ;
+							//break;
+						}
+					}
+				
+					ECHO("Begin set properties for time\n");
+					POM_AM__set_application_bypass(true);
+
+					for(j=0;j< txtimeinfoscount;j++)
+					{
+
+						//ECHO("%s : ",timeinfo_s[j].taskname);
+						for(k=0;k<txnodecount;k++)
+						{
+							//printf("group_full_name =%s, timeinfo_s[j].taskname=%s\n",group_full_name,timeinfo_s[j].taskname);
+							ECHO("timeinfo_s[%d].taskname=%s, flownode_s[%d].taskname=%s,flownode_s[%d].username=%s\n",j,timeinfo_s[j].taskname,k, flownode_s[k].taskname,k,flownode_s[k].username);
+							if(strcmp(timeinfo_s[j].taskname,flownode_s[k].taskname) == 0)
+							{
+								ECHO("set time prop:%s value:%s\n",timeinfo_s[j].propertyname,flownode_s[k].timeinfo);
+								//POM_AM__set_application_bypass(true);
+								AOM_lock(master_form);
+								PROP_value_type_t valtype;
+								char *valtype_n = NULL;
+								AOM_ask_value_type( master_form, timeinfo_s[j].propertyname, &valtype, &valtype_n);
+								if( valtype == PROP_date )
+								{
+									date_t a_date;
+									ITK_string_to_date(flownode_s[k].timeinfo, &a_date);
+									EMH_clear_errors();
+									AOM_set_value_date(master_form, timeinfo_s[j].propertyname, a_date);
+									//ITKCALL(AOM_UIF_set_value(itemrevision, timeinfo_s[j].propertyname,flownode_s[k].timeinfo));
+								}
+								else
+									AOM_set_value_string( master_form, timeinfo_s[j].propertyname, flownode_s[k].timeinfo);
+								DOFREE(valtype_n);
+								AOM_save( master_form );
+								AOM_unlock( master_form );
+								//break;
+							}
+							
+						}
+					}
+				}
+				
+				/*else{
+					ECHO("Begin not set both\n");
+					for(j=0; j<txuserinfoscount; j++)
+					{
+						//ECHO("userinfo_s[j].taskname:%s",userinfo_s[j].taskname);
+						for(k=0; k<txnodecount; k++)
+						{
+							ECHO("userinfo_s[%d].taskname=%s, flownode_s[%d].taskname=%s, flownode_s[%d].username=%s\n",j,userinfo_s[j].taskname,k,flownode_s[k].taskname,k,flownode_s[k].username);
+
+							if(strcmp(userinfo_s[j].taskname,flownode_s[k].taskname) == 0)
+							{
+								char propbothvalue[600] ="\0"; 
+								//POM_AM__set_application_bypass(true);
+								AOM_lock(master_form);
+								ECHO("set prop %s=%s\n",userinfo_s[j].propertyname,flownode_s[k].username);
+								ECHO("set time prop:%s value:%s\n",timeinfo_s[j].propertyname,flownode_s[k].timeinfo);
+								//���⴦��
+								strcat(propbothvalue,flownode_s[k].username);
+								strcat(propbothvalue,"/");
+								strcat(propbothvalue,flownode_s[k].timeinfo);
+								AOM_set_value_string( master_form, userinfo_s[j].propertyname, propbothvalue );
+								//ITKCALL( AOM_set_value_string( master_form, userinfo_s[j].propertyname, flownode_s[k].username) );
+								AOM_save( master_form );
+								AOM_unlock( master_form  );
+								//break;
+							}
+							else if (strcmp(userinfo_s[j].taskname,flownode_s[k].taskname) != 0 
+								//&& strstr(flownode_s[k].taskname, userinfo_s[j].taskname) != NULL
+								//&& strstr(userinfo_s[j].taskname,group_full_name) != NULL
+								&& strstr(userinfo_s[j].taskname,flownode_s[k].group) != NULL)
+							{
+								//printf("flownode_s[k].username=%s\n",flownode_s[k].username);
+								//set_bypass(true);
+								char propbothvalue[600] ="\0";
+								CALL(AOM_lock(master_form));
+								ECHO("set prop %s=%s\n",userinfo_s[j].propertyname,flownode_s[k].username);
+								ECHO("set time prop:%s value:%s\n",timeinfo_s[j].propertyname,flownode_s[k].timeinfo);
+								//���⴦��
+								strcat(propbothvalue,flownode_s[k].username);
+								strcat(propbothvalue,"/");
+								strcat(propbothvalue,flownode_s[k].timeinfo);
+							}
+						}
+					}
+
+
+
+				}*/
+				ECHO("==================WORK  END====================\n");
+			}
+			if(changeType!=NULL)
+			{
+				MEM_free(changeType);
+				changeType=NULL;
+			}
+
+		}
+		ECHO("close bypass...\n");
+		POM_AM__set_application_bypass(false);
+	}
+	EMH_clear_errors();
+	//CloseLog();
+	txnodecount = 0;
+	txuserinfoscount = 0;
+	txtimeinfoscount = 0;
+	txcommentsinfoscount = 0;
+	end_handler:
+	//CloseLog();
+	DOFREE(taskAttches);
+	//DOFREE(pref_values);
+
+	//if (debug)
+	{
+		printf("=========================================================\n");
+		printf("hander chintProperty ִ�����\n");
+		printf("=========================================================\n");
+	}
+	return rcode;
+}
+
diff --git a/General/General/chintSignChange.cpp b/General/General/chintSignChange.cpp
new file mode 100644
index 0000000..f9046d8
--- /dev/null
+++ b/General/General/chintSignChange.cpp
@@ -0,0 +1,2135 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+#include <epm/epm_task_template_itk.h>
+#include <tc/tc.h>
+#include <ics/ics.h>
+#include "epm_handler_common.h"
+#include "ado.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include <regex>
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include "ocilib.h"
+static void get_current_time(char *date_time)
+{
+    time_t the_time;
+    struct tm *time_ptr;
+    char *time_format = "%Y-%m-%d %H-%M-%S ";
+
+    the_time = time((time_t *)0);
+    time_ptr = localtime (&the_time);
+    strftime(date_time, 128, time_format, time_ptr);
+}
+// ��char *ת��ΪTCHAR *��WCHAR *
+TCHAR convertTemp3[256] = {0};
+TCHAR convertTemp4[256] = {0};
+bool convertBufferSwitch2(false);
+TCHAR* Char2Tchar(const char* str, int len)
+{
+	#ifdef _UNICODE 
+	TCHAR* temp = convertBufferSwitch2 ? convertTemp3 : convertTemp4; 
+	convertBufferSwitch2 = !convertBufferSwitch2; 
+	memset(temp, 0, sizeof(convertTemp3)); 
+	MultiByteToWideChar(CP_UTF8, 0, str, len, temp, 256); 
+	return temp;
+	#else 
+	return str;
+	#endif
+}
+
+int create_dataset(char *type_name, const char *name,  tag_t excelTag)
+{
+	
+	// cout<<"������������------------------"<<endl;
+	tag_t spec_dataset_rev = NULLTAG,
+		ref_object = NULLTAG;
+	AE_reference_type_t reference_type;
+	ITKCALL(AE_ask_dataset_latest_rev(excelTag, &spec_dataset_rev));//������ݼ������°汾
+	char ref_name[WSO_name_size_c + 1] = "excel";
+	ITKCALL(AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object));//������ݼ��������õ��ļ�����
+
+	// cout<<"��ʼ����----------------"<<endl;
+		//pdf��ϵͳ·��
+		char *temp_dir = getenv("temp");//��û���·��
+		
+		char output_file[SS_MAXPATHLEN] = "";
+		strcpy(output_file, temp_dir);
+		strcat(output_file, "\\");
+//		strcat(output_file, newDatasetName.c_str());
+		strcat(output_file, name);
+
+		// cout<<"����-----------"<<name<<endl;
+		tag_t new_file_tag1 = NULLTAG;
+		IMF_file_t file_descriptor1;	
+		int ifail=0;
+		ITKCALL(ifail=IMF_import_file(output_file, name, SS_BINARY, &new_file_tag1, &file_descriptor1));//������·�������ɵ��ļ�����tc�����tc�е�����ļ�����
+//		ITKCALL(ifail=IMF_set_original_file_name(new_file_tag1, origin_file_name));//�����ļ���������ݼ���ԭʼ�ļ�����
+		ITKCALL(ifail=IMF_set_original_file_name(new_file_tag1, name));//�����ļ���������ݼ���ԭʼ�ļ�����
+		ITKCALL(ifail=IMF_close_file(file_descriptor1));
+		ITKCALL(ifail=AOM_save(new_file_tag1));
+		ITKCALL(ifail=AOM_unlock(new_file_tag1));
+
+		ITKCALL(ifail=AOM_lock(spec_dataset_rev));
+			ITKCALL(ifail=AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object));//ɾ�����ݼ����������ö���
+		ITKCALL(ifail=AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag1));
+		ITKCALL(ifail=AOM_save(spec_dataset_rev));
+		ITKCALL(ifail=AOM_unlock(spec_dataset_rev));
+
+    ITKCALL(AOM_save(excelTag));
+	return 0;
+}
+string GenerateGuid()
+{
+    GUID guid;
+    CoCreateGuid(&guid);
+    char cBuffer[64] = {0};
+    sprintf_s(cBuffer, sizeof(cBuffer),
+    "{%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X}",
+    guid.Data1, guid.Data2,
+    guid.Data3, guid.Data4[0],
+    guid.Data4[1], guid.Data4[2],
+    guid.Data4[3], guid.Data4[4],
+    guid.Data4[5], guid.Data4[6],
+    guid.Data4[7]);
+    return string(cBuffer);
+}
+
+
+int writeToExcel(int page,tag_t excelTag,const char *zt2_Design,const char *zt2_DesignTime,const char *zt2_Proofread,
+				 const char *zt2_ProofreadTime,const char *zt2_Normalization,
+				 const char *zt2_NormalizationTime,const char *zt2_Review,const char *zt2_ReviewTime,
+				 const char *zt2_Approve,const char *zt2_ApproveTime,
+				 const char *zt2_Countersign,const char *zt2_CountersignTime)
+{
+	int ifail=0;
+	libxl::Book* book = nullptr;
+	book = xlCreateBook();//xls�ļ���xlCreateBook() �����򿪣�xlsx�ļ���xml�ṹ�����Ե���xlCreateXMLBook() �������򿪡�
+	book->setKey(L"Halil Kural", L"windows-2723210a07c4e90162b26966a8jcdboe");//��������˸ÿ⣬��������Ӧ��key����û�й�����������
+	  // book->setKey(L"TommoT", L"windows-2421220b07c2e10a6eb96768a2p7r6gc");//�°�
+	int n_refs = 0;
+	tag_t* refs = NULL;
+
+	ifail = AE_ask_all_dataset_named_refs(excelTag, "excel", &n_refs, &refs);
+	if (ifail != ITK_ok) { /* your error logic here */ }
+
+	char current_date_time_str[128 + 1] = {"\0"};
+	get_current_time(current_date_time_str);
+	
+
+	string time_now=current_date_time_str;
+	string sGuid = GenerateGuid();
+	string datasetName=time_now;
+	datasetName=datasetName.append(sGuid);
+	datasetName=datasetName.append(".xls");
+	time_now= getenv("temp");
+	time_now=time_now.append("\\").append(datasetName);
+
+	cout<<"�ļ�·��----------"<<time_now<<endl;
+	cout<<"-------1----------"<<endl;
+	ifail = AE_export_named_ref(excelTag, "excel", time_now.c_str());
+	cout<<"--------2---------"<<endl;
+	if (ifail != ITK_ok) { /* your error logic here */ }
+	//����Ƿ���ڵ�Ԫ������Ϊ��xxxx��
+	wstringstream excel_path;
+	
+//	excel_path<<"C:\\TEMP\\export_text.xls";
+	excel_path<<time_now.c_str();
+	cout<<"--------3---------"<<endl;
+	libxl::Sheet* sheet=NULL;
+	cout<<"---------4--------"<<endl;
+	if (book->load(excel_path.str().c_str()))
+	{
+		 sheet = book->getSheet(0);//��õ�1��sheetҳ
+	}
+	cout<<"--------5---------"<<endl;
+	//�������
+	TCHAR array2[100];
+	cout<<"---------6--------"<<endl;
+	string value = zt2_Countersign;
+	vector<string> vecs ;
+	Split(value,",",vecs);
+	if(page==0)
+	{
+		MultiByteToWideChar(CP_ACP, 0, zt2_Design, -1, array2, 100);
+		sheet->writeStr(21, 8,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_DesignTime, -1, array2, 100);
+		sheet->writeStr(22, 8,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Proofread, -1, array2, 100);
+		sheet->writeStr(21, 9,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ProofreadTime, -1, array2, 100);
+		sheet->writeStr(22, 9,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Normalization, -1, array2, 100);
+		sheet->writeStr(21, 10,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_NormalizationTime, -1, array2, 100);
+		sheet->writeStr(22, 10,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Review, -1, array2, 100);
+		sheet->writeStr(21, 12,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ReviewTime, -1, array2, 100);
+		sheet->writeStr(22, 12,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Approve, -1, array2, 100);
+		sheet->writeStr(21, 14,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ApproveTime, -1, array2, 100);
+		sheet->writeStr(22, 14,array2 );
+		for(int j=0;j<vecs.size();j++)
+		{
+			switch (j)
+			{
+			case 0:
+			case 1:
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(21, j+2,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(21, j+2,array2 );
+				break;
+			case 2:
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(21, 6,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(21, 6,array2 );
+				break;
+			default:
+				break;
+			}
+		}
+	}
+	cout<<"-------7----------"<<endl;
+	for (int i=0;i<page;i++)
+	{
+		MultiByteToWideChar(CP_ACP, 0, zt2_Design, -1, array2, 100);
+		sheet->writeStr(i*23+21, 8,array2 );	
+		MultiByteToWideChar(CP_ACP, 0, zt2_DesignTime, -1, array2, 100);
+		sheet->writeStr(i*23+22, 8,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Proofread, -1, array2, 100);
+		sheet->writeStr(i*23+21, 9,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ProofreadTime, -1, array2, 100);
+		sheet->writeStr(i*23+22, 9,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Normalization, -1, array2, 100);
+		sheet->writeStr(i*23+21, 10,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_NormalizationTime, -1, array2, 100);
+		sheet->writeStr(i*23+22, 10,array2 );
+
+		MultiByteToWideChar(CP_ACP, 0, zt2_Review, -1, array2, 100);
+		sheet->writeStr(i*23+21, 12,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ReviewTime, -1, array2, 100);
+		sheet->writeStr(i*23+22, 12,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Approve, -1, array2, 100);
+		sheet->writeStr(i*23+21, 14,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ApproveTime, -1, array2, 100);
+		sheet->writeStr(i*23+22, 14,array2 );			
+		for(int j=0;j<vecs.size();j++)
+		{
+			switch (j)
+			{
+			case 0:
+			case 1:
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(i*23+21, j+2,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(i*23+22, j+2,array2 );
+				break;
+			case 2:
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(i*23+21, 6,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(i*23+22, 6,array2 );
+				break;
+			default:
+				break;
+			}
+		}
+	}
+	cout<<"---------8--------"<<endl;
+	if (book->save(excel_path.str().c_str()))//���浽example.xls
+	{
+		//.....
+	}
+	else
+	{
+		std::cout << book->errorMessage() << std::endl;
+	}
+	book->release();//�ͷŶ��󣡣�����
+	//�������ݼ����ҵ��汾�Ĺ淶��ϵ��
+	cout<<"---------9--------"<<endl;
+	create_dataset("MSExcel",datasetName.c_str(),excelTag);//���ݼ�����(object_type)�����ݼ����ƣ��汾
+	return 0;
+}
+
+
+//������Ϣ����֪ͨ��
+int writeToExcel2(int page,tag_t excelTag,const char *zt2_Design,const char *zt2_DesignTime,const char *zt2_Proofread,
+				 const char *zt2_ProofreadTime,const char *zt2_Normalization,
+				 const char *zt2_NormalizationTime,const char *zt2_Review,const char *zt2_ReviewTime,
+				 const char *zt2_Approve,const char *zt2_ApproveTime,
+				 const char *zt2_Technology,char *zt2_TechnologyTime,
+				 const char *zt2_Countersign,const char *zt2_CountersignTime)
+{
+	cout<<"writeToExcel2 start"<<endl;
+	int ifail=0;
+	libxl::Book* book = nullptr;
+	book = xlCreateBook();//xls�ļ���xlCreateBook() �����򿪣�xlsx�ļ���xml�ṹ�����Ե���xlCreateXMLBook() �������򿪡�
+	book->setKey(L"Halil Kural", L"windows-2723210a07c4e90162b26966a8jcdboe");//��������˸ÿ⣬��������Ӧ��key����û�й�����������
+	  // book->setKey(L"TommoT", L"windows-2421220b07c2e10a6eb96768a2p7r6gc");//�°�
+	int n_refs = 0;
+	tag_t* refs = NULL;
+
+	ifail = AE_ask_all_dataset_named_refs(excelTag, "excel", &n_refs, &refs);
+	if (ifail != ITK_ok) { /* your error logic here */ }
+
+	char current_date_time_str[128 + 1] = {"\0"};
+	get_current_time(current_date_time_str);
+	
+
+	string time_now=current_date_time_str;
+	string sGuid = GenerateGuid();
+	string datasetName=time_now;
+	datasetName=datasetName.append(sGuid);
+	datasetName=datasetName.append(".xls");
+	time_now= getenv("temp");
+	time_now=time_now.append("\\").append(datasetName);
+
+	cout<<"�ļ�·��----------"<<time_now<<endl;
+	cout<<"-------1----------"<<endl;
+	ifail = AE_export_named_ref(excelTag, "excel", time_now.c_str());
+	cout<<"--------2---------"<<endl;
+	if (ifail != ITK_ok) { /* your error logic here */ }
+	//����Ƿ���ڵ�Ԫ������Ϊ��xxxx��
+	wstringstream excel_path;
+	
+//	excel_path<<"C:\\TEMP\\export_text.xls";
+	excel_path<<time_now.c_str();
+	cout<<"--------3---------"<<endl;
+	libxl::Sheet* sheet=NULL;
+	cout<<"---------4--------"<<endl;
+	if (book->load(excel_path.str().c_str()))
+	{
+		 sheet = book->getSheet(0);//��õ�1��sheetҳ
+	}
+	cout<<"--------5---------"<<endl;
+	//�������
+	TCHAR array2[100];
+	cout<<"---------6--------"<<endl;
+	if(page==0)
+	{
+		try{
+		//����
+		MultiByteToWideChar(CP_ACP, 0, zt2_Design, -1, array2, 100);
+		sheet->writeStr(23, 9,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_DesignTime, -1, array2, 100);
+		sheet->writeStr(24, 9,array2 );
+		//��
+		MultiByteToWideChar(CP_ACP, 0, zt2_Proofread, -1, array2, 100);
+		sheet->writeStr(23, 10,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ProofreadTime, -1, array2, 100);
+		sheet->writeStr(24, 10,array2 );
+		//����
+		MultiByteToWideChar(CP_ACP, 0, zt2_Technology, -1, array2, 100);
+		sheet->writeStr(23, 12,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_TechnologyTime, -1, array2, 100);
+		sheet->writeStr(24, 12,array2 );
+		//��
+		MultiByteToWideChar(CP_ACP, 0, zt2_Review, -1, array2, 100);
+		sheet->writeStr(23, 14,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ReviewTime, -1, array2, 100);
+		sheet->writeStr(24, 14,array2 );
+		//��׼
+		MultiByteToWideChar(CP_ACP, 0, zt2_Approve, -1, array2, 100);
+		sheet->writeStr(23, 15, array2);
+		MultiByteToWideChar(CP_ACP, 0, zt2_ApproveTime, -1, array2, 100);
+		sheet->writeStr(24, 15, array2);
+		string value = zt2_Countersign;
+		vector<string> vecs ;
+		Split(value,",",vecs);
+		for(int j=0;j<vecs.size();j++)
+		{
+			if(j<3)
+			{
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(22+j%3, 2,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(22+j%3, 3,array2 );
+			}else if(3<=j && j<=5)
+			{
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(22+j%3, 6,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(22+j%3, 8,array2 );			
+			}
+		}
+
+
+
+
+		}catch(exception e)
+		{
+			cout<<"-------�쳣----------"<<e.what()<<endl;
+		}
+	}
+	cout<<"-------7----------"<<endl;
+	for (int i=0;i<page;i++)
+	{
+		cout<<"-------7-1----------"<<endl;
+		MultiByteToWideChar(CP_ACP, 0, zt2_Design, -1, array2, 100);
+		cout<<"-------7-2----------"<<endl;
+		try{
+		sheet->writeStr(i*24+23, 9,array2 );	
+		MultiByteToWideChar(CP_ACP, 0, zt2_DesignTime, -1, array2, 100);
+		sheet->writeStr(i*24+24, 9,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_Proofread, -1, array2, 100);
+		sheet->writeStr(i*24+23, 10,array2 );
+		MultiByteToWideChar(CP_ACP, 0, zt2_ProofreadTime, -1, array2, 100);
+		sheet->writeStr(i*24+24, 10,array2 ) ;
+		MultiByteToWideChar(CP_ACP, 0, zt2_Technology, -1, array2, 100);
+		sheet->writeStr(i*24+23, 12,array2 ) ;
+		MultiByteToWideChar(CP_ACP, 0, zt2_TechnologyTime, -1, array2, 100);
+		sheet->writeStr(i*24+24, 12,array2 ) ;
+		MultiByteToWideChar(CP_ACP, 0, zt2_Review, -1, array2, 100);
+		sheet->writeStr(i*24+23, 14,array2 ) ;
+		MultiByteToWideChar(CP_ACP, 0, zt2_ReviewTime, -1, array2, 100);
+		sheet->writeStr(i*24+24, 14,array2 ) ;
+		//��׼
+		MultiByteToWideChar(CP_ACP, 0, zt2_Approve, -1, array2, 100);
+		sheet->writeStr(i * 24 + 23, 15, array2);
+		MultiByteToWideChar(CP_ACP, 0, zt2_ApproveTime, -1, array2, 100);
+		sheet->writeStr(i * 24 + 24, 15, array2);
+
+
+
+
+		string value = zt2_Countersign;
+		vector<string> vecs ;
+		Split(value,",",vecs);
+		for(int j=0;j<vecs.size();j++)
+		{
+			if(j<3)
+			{
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(i*24+22+j%3, 2,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(i*24+22+j%3, 3,array2 );
+			}else if(3<=j && j<=5)
+			{
+				MultiByteToWideChar(CP_ACP, 0, vecs[j].c_str(), -1, array2, 100);
+				sheet->writeStr(i*24+22+j%3, 6,array2 );
+				MultiByteToWideChar(CP_ACP, 0, zt2_CountersignTime, -1, array2, 100);
+				sheet->writeStr(i*24+22+j%3, 8,array2 );			
+			}
+		}
+
+
+		}catch(exception e)
+		{
+			cout<<"-------�쳣----------"<<e.what()<<endl;
+		}
+			
+	}
+	cout<<"---------8--------"<<endl;
+	if (book->save(excel_path.str().c_str()))//���浽example.xls
+	{
+		//.....
+	}
+	else
+	{
+		std::cout << book->errorMessage() << std::endl;
+	}
+	book->release();//�ͷŶ��󣡣�����
+	//�������ݼ����ҵ��汾�Ĺ淶��ϵ��
+	cout<<"---------9--------"<<endl;
+	create_dataset("MSExcel",datasetName.c_str(),excelTag);//���ݼ�����(object_type)�����ݼ����ƣ��汾
+	cout<<"writeToExcel2 end"<<endl;
+	return 0;
+}
+
+struct NodeBean
+{
+	int topNum = 1;
+	int packNum = 0;
+	string revUid;
+	tag_t designRev;
+	tag_t mantr = NULLTAG;
+	string bl_quantity;
+	char* bl_plmxml_occ_xform;
+	string bl_sequence_no;
+	vector<NodeBean> childs;
+	vector<tag_t> ccps;
+	int xnNum = 1;
+};
+boolean isTcm(tag_t mantr) {
+	int releaseCount = 0;
+	tag_t* releaseTags = NULL;
+	//�ж��Ӽ��Ƿ񷢲�
+	AOM_ask_value_tags(mantr, "release_status_list", &releaseCount, &releaseTags);
+	if (releaseCount > 0) {
+		return true;
+	}
+	else {
+		return false;
+	}
+}
+bool myCompare(string o1, string o2) {
+	if (o1.rfind("3", 0) == 0) {
+		cout << o1.c_str() << endl;
+		return 1;
+	}
+	return 0;
+}
+vector<string> KeySet(map<string, tag_t> test)
+{
+	vector<string> keys;
+	for (map<string, tag_t>::iterator it = test.begin(); it != test.end(); ++it) {
+		keys.push_back(it->first);
+	}
+	return keys;
+}
+string& replace_all2(string& str, const  string& old_value, const  string& new_value)
+{
+	if (strstr(str.c_str(), old_value.c_str()) != NULL) {
+		vector<string> type_vec;
+		Split(str.c_str(), old_value.c_str(), type_vec);
+		char new_str[512] = "\0";
+		for (int i = 0; i < type_vec.size(); i++)
+		{
+			strcat(new_str, type_vec[i].c_str());
+			if (i < type_vec.size() - 1) {
+				strcat(new_str, new_value.c_str());
+			}
+		}
+		string new_value(new_str);
+		str = new_value.c_str();
+	}
+	return   str;
+}
+tag_t getSapPart(tag_t designRevLine, tag_t designRev, string& errBuff, NodeBean& bean) {
+	int num = 0;
+	tag_t* mantrs;
+	char *type,*item_id;
+	AOM_ask_value_string(designRev,"object_type",&type);
+	AOM_ask_value_string(designRev, "item_id", &item_id);
+	if (strcmp(type, "Part Revision") == 0) {
+		return designRev;
+	}
+	ITKCALL(AOM_ask_value_tags(designRev, "representation_for", &num, &mantrs));
+	//printf("num===>%d\n", num);
+	vector<tag_t> parts;
+	if (strstr(item_id, "1ZDB300000P") != NULL) {
+		map<string,tag_t> partsCcp;
+		for (int i = 0; i < num; i++) {
+			char* type, *zt2_ifpbom,*itemId;
+			AOM_ask_value_string(mantrs[i], "object_type", &type);
+			AOM_ask_value_string(mantrs[i], "zt2_ifpbom", &zt2_ifpbom);
+			AOM_ask_value_string(mantrs[i], "item_id", &itemId);
+			if (strstr(type, "Part") != NULL && strcmp(zt2_ifpbom, "P") != 0) { //
+				tag_t matnrItem;
+				ITEM_ask_item_of_rev(mantrs[i], &matnrItem);
+				partsCcp[itemId] = matnrItem;
+				//partsCcp.push_back();
+				/*if (parts.size()==0) {
+					parts.push_back(mantrs[i]);
+				}
+				else {
+					printf("===========\n");
+					bean.ccps.push_back(mantrs[i]);
+				}*/
+			}
+		}
+		map<string, tag_t>::iterator it;
+		for (it = partsCcp.begin(); it != partsCcp.end(); it++) {
+			string s = it->first;
+			tag_t partLast = partsCcp[s],partRevLast;
+			ITEM_ask_latest_rev(partLast,&partRevLast);
+			if (parts.size() == 0) {
+				parts.push_back(partRevLast);
+			}
+			else {
+				printf("===========\n");
+				bean.ccps.push_back(partRevLast);
+			}
+		}
+	}
+	else {
+		for (int i = 0; i < num; i++) {
+			char* type, *zt2_ifpbom;
+			AOM_ask_value_string(mantrs[i], "object_type", &type);
+			AOM_ask_value_string(mantrs[i], "zt2_ifpbom", &zt2_ifpbom);
+			if (strstr(type, "Part") != NULL && strcmp(zt2_ifpbom, "P") != 0) { //
+				parts.push_back(mantrs[i]);
+			}
+		}
+	}
+	if (parts.size() == 1) {
+		return parts[0];
+	}
+	string searchId;
+	char* id, *zt2_TYJNo, *spec, *zt2_Diagram;
+	AOM_ask_value_string(designRev, "zt2_Diagram", &zt2_Diagram);
+	AOM_ask_value_string(designRev, "item_id", &id);
+	//AOM_ask_value_string(designRev, "zt2_DrawingNo", &zt2_DrawingNo);
+	/*if (strcmp(zt2_DrawingNo,"") != 0 && strcmp(zt2_DrawingNo, id) != 0) {
+		searchId = zt2_DrawingNo;
+	}
+	else {*/
+	searchId = id;
+	//}
+	AOM_ask_value_string(designRevLine, "ZT2_TYSpecifications", &zt2_TYJNo);
+	AOM_ask_value_string(designRev, "zt2_Specifications", &spec);
+	if (strcmp(zt2_TYJNo, "") != 0) {
+		string qryVal;
+		tag_t query = NULLTAG, *tags;
+		map<string, tag_t> map_revs;
+		qryVal.append("* ").append(zt2_TYJNo).append("*");
+		//fields.put("����", "*" + item_id + "*" + zt2_TYJNo + "*");
+		ITKCALL(QRY_find2("chint_query_material_test", &query));
+		char* qry_entries[2] = { "����" ,"������ͼ��" }, *qry_values[2] = { (char *)qryVal.c_str(),id };
+		int n_found;
+		ITKCALL(QRY_execute(query, 2, qry_entries, qry_values, &n_found, &tags));
+		printf("n_found===>%d\n", n_found);
+		for (int t = 0; t < n_found; t++) {
+			tag_t rev = tags[t];
+			if (isTcm(rev)) {
+				char* zt2_MaterialNo;
+				AOM_ask_value_string(rev, "zt2_MaterialNo", &zt2_MaterialNo);
+				map_revs[zt2_MaterialNo] = rev;
+			}
+		}
+		vector<string> keySet = KeySet(map_revs);
+		sort(keySet.begin(), keySet.end(), myCompare);
+		for (int i = 0; i < keySet.size(); i++) {
+			string materialNo = keySet[i];
+			string sql_query = "select FeatureList from CcemVW_GoodsFeature where GoodsCode ='";
+			sql_query.append(materialNo).append("'");
+			printf("sql_query===>%s\n", sql_query.c_str());
+			int outputColumn = 0, outputValueCount = 0;
+			char*** outputValue = NULL;
+			ado_QuerySQLNoInputParam((char*)sql_query.c_str(), &outputColumn, &outputValueCount, &outputValue);
+			for (int j = 0; j < outputValueCount; j++) {
+				char* val = outputValue[j][0];
+				vector<string> vals;
+				Split(val, ",", vals);
+				for (int k = 0; k < vals.size(); k++) {
+					printf("vals===>%s\n", vals[k].c_str());
+					if (vals[k].rfind("F064:", 0) == 0) {
+						string temp = replace_all2(vals[k], "F064:", "");
+						printf("temp===>%s\n", temp.c_str());
+						if (strstr(zt2_TYJNo, temp.c_str()) != NULL) {
+							return map_revs[materialNo];
+						}
+						break;
+					}
+				}
+			}
+		}
+		if (!strcmp(zt2_Diagram, "Y") == 0 && !strcmp(zt2_Diagram, "��") == 0) {
+			string buffErr = "";
+			buffErr.append("ȱ�����ϱ���[�Ҳ�����ͨ�ü������ƥ�������-(*").append(searchId)
+				.append("*").append(zt2_TYJNo).append(")];\n");
+			size_t found = errBuff.find(buffErr);
+			if (found == std::string::npos) {
+				errBuff.append(buffErr);
+			}
+			return NULLTAG;
+		}
+	}
+
+	for (int i = 0; i < parts.size(); i++) {
+		tag_t part = parts[i];
+		char* specPart;
+		AOM_ask_value_string(part, "zt2_Specifications", &specPart);
+		if (strcmp(specPart, spec) == 0) {
+			return part;
+		}
+		/*String spec2 = parts.get(i).getProperty("zt2_Specifications");
+		if (spec.equals(spec2)) {
+			return parts.get(i);
+		}*/
+	}
+	if (!strcmp(zt2_Diagram, "Y") == 0 && !strcmp(zt2_Diagram, "��") == 0) {
+		//errBuff.append("ȱ�����ϱ���[�Ҳ�����ͬ��������(").append(spec).append(")];");
+		string buffErr = "";
+		buffErr.append("ȱ�����ϱ���[�Ҳ�����ͬ��������(").append(spec).append(")];");
+		size_t found = errBuff.find(buffErr);
+		if (found == std::string::npos) {
+			errBuff.append(buffErr);
+		}
+		return NULLTAG;
+	}
+
+	return NULLTAG;
+	/*else{
+		return NULLTAG;
+	}*/
+}
+void askLineVal(NodeBean& bean, tag_t bom_line, tag_t designRev, string& errBuff,boolean &flagMat) {
+	char* bl_quantity, *bl_plmxml_occ_xform, *bl_sequence_no,*sffc;
+	ITKCALL(AOM_ask_value_string(bom_line, "bl_sequence_no", &bl_sequence_no));
+	//printf("revUid===>%s\n", bl_sequence_no);
+	ITKCALL(AOM_ask_value_string(bom_line, "bl_quantity", &bl_quantity));
+	//printf("revUid===>%s\n", bl_quantity);
+	ITKCALL(AOM_ask_value_string(bom_line, "bl_plmxml_occ_xform", &bl_plmxml_occ_xform));
+	//printf("revUid===>%s\n", bl_plmxml_occ_xform);
+	if (strcmp(bl_quantity, "") == 0) {
+		bl_quantity = "1";
+	}
+
+	bean.bl_plmxml_occ_xform = bl_plmxml_occ_xform;
+	if (bean.xnNum > 1) {
+		int qtyCut = atoi(bl_quantity);
+		bean.bl_quantity = to_string(qtyCut*bean.xnNum);
+	}
+	else {
+		bean.bl_quantity = bl_quantity;
+	}
+	if (strcmp(bean.bl_sequence_no.c_str(), "") == 0) {
+		bean.bl_sequence_no = bl_sequence_no;
+	}
+	
+	tag_t part = getSapPart(bom_line, designRev, errBuff, bean);
+	//printf("11111111\n");
+	if (part != NULLTAG) {
+		//BOM_writer
+		char* name,*partId,**sealeds,**factorys,*matnr,**procureType;
+		AOM_refresh(part, false);
+		AOM_ask_value_string(part, "object_name", &name);
+		printf("name%s\n", name);
+		int cnt2,numFac, cnt3;
+		ITKCALL(AOM_ask_value_string(part, "item_id", &partId));
+		AOM_ask_value_string(part, "zt2_MaterialNo", &matnr);
+		if (strcmp(matnr, "") == 0) {
+			string buffErr = "";
+			buffErr.append("����:").append(partId).append("/").append(name).append("û�����ϱ���.\n");
+			size_t found = errBuff.find(buffErr);
+			if (found == std::string::npos) {
+				errBuff.append(buffErr);
+			}
+			//errBuff.append("����:").append(partId).append("/").append(name).append("û�����ϱ���.\n");
+			//return;
+		}
+		boolean numFlag = true;
+		AOM_ask_value_strings(part, "zt2_SZSealedornot", &cnt2, &sealeds);
+		AOM_ask_value_strings(part, "zt2_SZFactory", &numFac, &factorys);
+		AOM_ask_value_strings(part, "zt2_SZProcuretype", &cnt3, &procureType); //��������
+		for (int i = 0; i < numFac; i++) {
+			if (strcmp(factorys[i], "M060") == 0) {
+				numFlag = false;
+			}
+			if (strcmp(factorys[i],"M060") == 0 && cnt2>i) {
+				if (strcmp(sealeds[i],"Y") == 0) {
+					//errBuff.append("����:").append(partId).append("/").append(name).append("�ѷ���޷�ת��EBOM.\n");
+					string buffErr = "";
+					buffErr.append("����:").append(partId).append("/").append(name).append("�ѷ���޷�ת��EBOM.\n");
+					size_t found = errBuff.find(buffErr);
+					if (found == std::string::npos) {
+						errBuff.append(buffErr);
+					}
+				}
+				if (cnt3 > i && strstr(procureType[i], "����") != NULL) {
+					flagMat = true;
+				}
+			}
+		}
+		if (numFlag && (strstr(partId,"2ZD")!=NULL|| strstr(partId, "4ZD") != NULL)) {
+			string buffErr = "";
+			buffErr.append("����:").append(partId).append("/").append(name).append("������ͼû��ά��,����.\n");
+			size_t found = errBuff.find(buffErr);
+			if (found == std::string::npos) {
+				errBuff.append(buffErr);
+			}
+			//errBuff.append("����:").append(partId).append("/").append(name).append("������ͼû��ά��,����.\n");
+		}
+		ITKCALL(AOM_ask_value_string(part, "zt2_State", &sffc));
+		if (strcmp(sffc, "D1") == 0 || strcmp(sffc, "���") == 0) {
+			string buffErr = "";
+			buffErr.append("����:").append(partId).append("/").append(name).append("�ѷ���޷�ת��EBOM.\n");
+			size_t found = errBuff.find(buffErr);
+			if (found == std::string::npos) {
+				errBuff.append(buffErr);
+			}
+		}
+		bean.mantr = part;
+	}
+	else {
+		char *partId,*name;
+		AOM_ask_value_string(designRev,"item_id",&partId);
+		AOM_ask_value_string(designRev, "object_name", &name);
+
+		string buffErr = "";
+		buffErr.append("ͼֽ:").append(partId).append("/").append(name).append("��δ�ҵ����϶���.\n");
+		size_t found = errBuff.find(buffErr);
+		if (found == std::string::npos) {
+			errBuff.append(buffErr);
+		}
+	//	errBuff.append("ͼֽ:").append(partId).append("/").append(name).append("��δ�ҵ����϶���.\n");
+	}
+}
+string getTyjZl(tag_t bom_line,string materialutilization,tag_t desginRev,string &errMessage) {
+	char *ZT2_TYSpecifications,*ZT2_TYWeight,*item_id;
+	AOM_ask_value_string(bom_line, "item_id", &item_id);
+	AOM_ask_value_string(bom_line,"ZT2_TYSpecifications",&ZT2_TYSpecifications);
+	double lyl = 0.85;
+	char strff[21];
+	if (!materialutilization.empty()) {
+		lyl = stod(materialutilization);
+	}
+	if (strcmp(ZT2_TYSpecifications,"")==0) {
+		double weight = 0;
+		AOM_ask_value_double(desginRev,"zt2_DesignWeight",&weight);
+		if (weight == 0) {
+			errMessage.append(item_id).append("δ��д�������;\n");
+			return "0";
+		}
+		double two = weight / lyl;
+		sprintf(strff, "%.3f", two);
+	}
+	else {
+		AOM_ask_value_string(bom_line, "ZT2_TYWeight", &ZT2_TYWeight);
+		if (strcmp(ZT2_TYWeight, "") == 0) {
+			errMessage.append(item_id).append("δ��дͨ�ü�����;\n");
+			return "0";
+		}
+		double weight = stod(ZT2_TYWeight);
+		double two = weight / lyl;
+		sprintf(strff, "%.3f", two);
+	}
+	return strff;
+}
+
+void getRemarkMsg(string remark, int len,string &errBuff,char*bl_quantity,char* pId,
+	char*c_pId,char*bl_line_name) {
+	char* idss[5] = { (char*)"A",(char*)"B",(char*)"C",(char*)"D",(char*)"E" };
+	//tring x = "9A9.1B2C3";
+	string markMsg = "";
+	for (int i = 0; i < len; i++) {
+		if (strstr(remark.c_str(), idss[i]) != NULL) {
+			markMsg.append(idss[i]);
+		}
+	}
+	if (markMsg.length() == 0) {
+		int blQty = atoi(bl_quantity);
+		if (blQty % len != 0 
+			&& strstr(bl_line_name, "��") == NULL) {
+			errBuff.append("ͼֽ:").append(pId).append("���Ӽ�").append(c_pId)
+				.append("�޷����������顣").append("\n");
+		}
+	}
+	else {
+		int blQty = atoi(bl_quantity);
+		if (blQty % markMsg.length() != 0 
+			&& strstr(bl_line_name, "��") == NULL) {
+			errBuff.append("ͼֽ:").append(pId).append("���Ӽ�").append(c_pId)
+				.append("�޷����������顣").append("\n");
+		}
+	}
+}
+
+int xsLen = 0;
+void getAllXnj(vector<tag_t> xnzjbVec, int maxNum, int &xxt,
+	string& errBuff, string dbName, NodeBean& pBean, int qtyXn,char *loginUserId);
+void getAllXnj(vector<tag_t> xnzjbVec, int maxNum, int &xxt,
+	string& errBuff, string dbName, NodeBean& pBean, int qtyXn, vector<string> idVector);
+void recyReadBom(tag_t bom_line, NodeBean& pBean, string& errBuff,string dbName, char *loginUserId)
+{
+	int c_line_count;
+	char* uid, *type, *zt2_Diagram,*source,*itemId,*object_name;
+	//ͼֽ�汾������
+	tag_t designRev, *c_line_tags;
+	ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &designRev));
+	//printf("1222");
+	ITK__convert_tag_to_uid(designRev, &uid);
+	//printf("revUid===>%s\n", uid);
+	pBean.revUid = uid;
+	pBean.designRev = designRev;
+	ITKCALL(AOM_ask_value_string(designRev, "object_type", &type));
+	ITKCALL(AOM_ask_value_string(designRev, "item_id", &itemId));
+	ITKCALL(AOM_ask_value_string(designRev, "object_name", &object_name));
+	//printf("type===>%s\n", type);
+	if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+		AOM_ask_value_string(designRev, "zt2_Diagram", &zt2_Diagram);
+		if (strcmp(zt2_Diagram, "Y") == 0 || strcmp(zt2_Diagram, "��") == 0) {
+			return;
+		}
+	}
+	//�ж������Ƿ�Ϊ Part Revision ZT2_Design3DRevision  ZT2_XNZJB ���DZ���
+	if (strcmp(type, "ZT2_Design3DRevision") != 0 
+		&& strcmp(type, "Part Revision") != 0 && strcmp(type, "ZT2_XNZJBRevision") != 0) {
+		string buffErr = "";
+		buffErr.append("���������쳣:").append(itemId).append("/").append(object_name).append("/").append(type).append("\n");
+		size_t found = errBuff.find(buffErr);
+		if (found == std::string::npos) {
+			errBuff.append(buffErr);
+		}
+		return;
+	}
+
+	boolean flagMat = false;
+	askLineVal(pBean, bom_line, designRev, errBuff, flagMat);
+	tag_t tagUser;
+	char *tagId;
+	AOM_ask_value_tag(designRev, "owning_user", &tagUser);
+	AOM_ask_value_string(tagUser, "user_id", &tagId);
+	if (strcmp(type, "ZT2_Design3DRevision") == 0 && strcmp(loginUserId, tagId) != 0 && strstr(itemId, "2ZD") == NULL) {
+		return;
+	}
+	if (strcmp(type, "ZT2_XNZJBRevision") == 0) {
+		return;
+	}
+	//�⹺ ��չ���Ӽ�
+	if (strstr(itemId, "2ZD") != NULL || strstr(itemId, "4ZD") != NULL) {
+		if (!flagMat) {
+			return;
+		}
+	}
+	if (strstr(itemId, "1ZD") != NULL) {
+		AOM_ask_value_string(designRev, "zt2_Source", &source);
+		if (strcmp(source, "S2") == 0 || strcmp(source, "�⹺") == 0) {
+			return;
+		}
+	}
+
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	for (int i = 0; i < c_line_count; i++) {
+		logical flag;
+		BOM_line_is_packed(c_line_tags[i], &flag);
+		if (flag) {
+			BOM_line_unpack(c_line_tags[i]);
+		}
+	}
+	AOM_refresh(bom_line, FALSE);
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	//ת��ʱԭ����չ���߼�
+	if (c_line_count == 0 && !dbName.empty() &&(strstr(itemId, "1ZD") != NULL||
+		strstr(itemId, "2ZD") != NULL || strstr(itemId, "4ZD") != NULL)) {
+		//ԭ����չ��
+		char *zt2_MaterialMark;
+		AOM_ask_value_string(designRev,"zt2_MaterialMark",&zt2_MaterialMark);
+		//String zt2_MaterialMark = rev.getProperty("zt2_MaterialMark")
+		string sql = "select materialno, materialutilization, materialunit FROM %s where materialmark = '%s'";
+		char selectRxfs[500];
+		sprintf(selectRxfs, sql.c_str(), dbName.c_str(), zt2_MaterialMark);
+		int outputColumn1 = 0, outputValueCount1 = 0;
+		char*** outputValue1 = NULL;
+		printf("search3 ===> %s\n", selectRxfs);
+		QuerySQLNoInputParam(selectRxfs, &outputColumn1, &outputValueCount1, &outputValue1);
+		if (outputValueCount1 == 0 && strcmp(zt2_MaterialMark, "") != 0) {
+			string buffErr = "";
+			buffErr.append("ͼֽ:").append(itemId).append("-").
+				append(object_name).append(zt2_MaterialMark).append("���ϱ��û��ά��.\n");
+			size_t found = errBuff.find(buffErr);
+			if (found ==std::string::npos) {
+				errBuff.append(buffErr);
+			}
+			
+		}
+		for (int t = 0; t < outputValueCount1; t++) {
+			string materialno = outputValue1[t][0];
+			string materialutilization = outputValue1[t][1];
+			string materialunit = outputValue1[t][2];
+			tag_t material, materialRev;
+			ITEM_find_item(materialno.c_str(),&material);
+			ITEM_ask_latest_rev(material, &materialRev);
+			string bl_qty = getTyjZl(bom_line, materialutilization, designRev, errBuff);
+			printf("bl_qty%s\n", bl_qty.c_str());
+			NodeBean cBean;
+			cBean.bl_quantity = bl_qty;
+			cBean.bl_sequence_no = "10";
+			cBean.bl_plmxml_occ_xform = "";
+			cBean.mantr = materialRev;
+			pBean.childs.push_back(cBean);
+		}
+	}
+	string maxSeqNo;
+	vector<tag_t> xnzjbVec;
+	string item_id = itemId;
+	smatch result;//
+	regex qq_reg2("^1ZDB5.*\\d{1,}1000X.*");
+	bool ret = regex_match(item_id, result, qq_reg2);
+	for (int i = 0; i < c_line_count; i++) {
+		logical suppressed;
+		AOM_ask_value_logical(c_line_tags[i],"bl_is_occ_suppressed",&suppressed);
+		if (suppressed) {
+			continue;
+		}
+		//�޸Ĺ�֮��֮ǰ�Ѿ��ǽ����״̬�� 
+		logical flag;
+		BOM_line_is_packed(c_line_tags[i], &flag);
+		//printf("flag===>%d\n", flag);
+		if (flag) {
+			int count = 0;
+			char *topNum;
+			AOM_ask_value_string(c_line_tags[i],"bl_quantity",&topNum);
+			tag_t* packLines;
+			BOM_line_ask_packed_lines(c_line_tags[i], &count, &packLines);
+			for (int t = 0; t < count; t++) {
+				tag_t c_Rev;
+				ITKCALL(AOM_ask_value_tag(packLines[t], "bl_line_object", &c_Rev));
+				char* cUid;
+				ITK__convert_tag_to_uid(c_Rev, &cUid);
+				NodeBean cBean;
+				cBean.revUid = cUid;
+				cBean.designRev = c_Rev;
+				cBean.packNum = count+1;
+				cBean.topNum = atoi(topNum);
+				recyReadBom(c_line_tags[i], cBean, errBuff, dbName, loginUserId);
+				pBean.childs.push_back(cBean);
+			}
+			AOM_refresh(c_line_tags[i], FALSE);
+			tag_t c_Rev;
+			ITKCALL(AOM_ask_value_tag(c_line_tags[i], "bl_line_object", &c_Rev));
+			char* cUid;
+			ITK__convert_tag_to_uid(c_Rev, &cUid);
+			NodeBean cBean;
+			cBean.revUid = cUid;
+			cBean.designRev = c_Rev;
+			cBean.packNum = count+1;
+			cBean.topNum = atoi(topNum);
+			recyReadBom(c_line_tags[i], cBean, errBuff, dbName, loginUserId);
+			pBean.childs.push_back(cBean);
+
+		}
+		else {
+			//���EתPʱ�IJ���߼�
+			tag_t c_Rev;
+			char *seqNo,*c_type,*remark,*bl_quantity,*bl_line_name;
+			ITKCALL(AOM_ask_value_tag(c_line_tags[i], "bl_line_object", &c_Rev));
+			char* id;
+			AOM_ask_value_string(c_Rev, "item_id", &id);
+			//��ȡBOM�е�REMARK
+			if (ret) {
+				AOM_ask_value_string(c_line_tags[i], "ZT2_Remark", &remark);
+				AOM_ask_value_string(c_line_tags[i], "bl_quantity", &bl_quantity);
+				AOM_ask_value_string(c_line_tags[i], "bl_line_name", &bl_line_name);
+				getRemarkMsg(remark,xsLen, errBuff, bl_quantity, itemId, id, bl_line_name);
+			}
+			//�����߼� ��ǰ��������ΪZT2_XNZJB ���������ʱ �������㴦�� ����*���������
+			AOM_ask_value_string(c_Rev,"object_type",&c_type);
+			if (strcmp(c_type, "ZT2_XNZJBRevision") == 0) {
+				xnzjbVec.push_back(c_line_tags[i]);
+				continue;
+			}
+			AOM_ask_value_string(c_line_tags[i], "bl_sequence_no", &seqNo);
+			maxSeqNo = seqNo;
+			char* cUid;
+			ITK__convert_tag_to_uid(c_Rev, &cUid);
+			NodeBean cBean;
+			cBean.revUid = cUid;
+			cBean.designRev = c_Rev;
+			recyReadBom(c_line_tags[i], cBean, errBuff, dbName, loginUserId);
+			pBean.childs.push_back(cBean);
+		}
+	}
+	int maxNum = atoi(maxSeqNo.c_str());
+	int xxt = 1;
+	printf("xnzjbVec ===> %d\n", xnzjbVec.size());
+	
+	getAllXnj(xnzjbVec, maxNum, xxt, errBuff,dbName,pBean,1, loginUserId);
+}
+void recyReadBom(tag_t bom_line, NodeBean& pBean, string& errBuff, string dbName, vector<string> idVector)
+{
+	int c_line_count;
+	char* uid, *type, *zt2_Diagram, *source, *itemId, *object_name;
+	//ͼֽ�汾������
+	tag_t designRev, *c_line_tags;
+	ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &designRev));
+	//printf("1222");
+	ITK__convert_tag_to_uid(designRev, &uid);
+	//printf("revUid===>%s\n", uid);
+	pBean.revUid = uid;
+	pBean.designRev = designRev;
+	ITKCALL(AOM_ask_value_string(designRev, "object_type", &type));
+	ITKCALL(AOM_ask_value_string(designRev, "item_id", &itemId));
+	ITKCALL(AOM_ask_value_string(designRev, "object_name", &object_name));
+	//printf("type===>%s\n", type);
+	if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+		AOM_ask_value_string(designRev, "zt2_Diagram", &zt2_Diagram);
+		if (strcmp(zt2_Diagram, "Y") == 0 || strcmp(zt2_Diagram, "��") == 0) {
+			return;
+		}
+	}
+	//�ж������Ƿ�Ϊ Part Revision ZT2_Design3DRevision  ZT2_XNZJB ���DZ���
+	if (strcmp(type, "ZT2_Design3DRevision") != 0
+		&& strcmp(type, "Part Revision") != 0 && strcmp(type, "ZT2_XNZJBRevision") != 0) {
+		string buffErr = "";
+		buffErr.append("���������쳣:").append(itemId).append("/").append(object_name).append("/").append(type).append("\n");
+		size_t found = errBuff.find(buffErr);
+		if (found == std::string::npos) {
+			errBuff.append(buffErr);
+		}
+		return;
+	}
+
+	boolean flagMat = false;
+	askLineVal(pBean, bom_line, designRev, errBuff, flagMat);
+	vector<string> idVec;
+	Split(itemId, "-", idVec);
+	if (std::find(idVector.begin(), idVector.end(), idVec[0]) == idVector.end()) {
+		return;
+	}
+	if (strcmp(type, "ZT2_XNZJBRevision") == 0) {
+		return;
+	}
+	//�⹺ ��չ���Ӽ�
+	if (strstr(itemId, "2ZD") != NULL || strstr(itemId, "4ZD") != NULL) {
+		if (!flagMat) {
+			return;
+		}
+	}
+	if (strstr(itemId, "1ZD") != NULL) {
+		AOM_ask_value_string(designRev, "zt2_Source", &source);
+		if (strcmp(source, "S2") == 0 || strcmp(source, "�⹺") == 0) {
+			return;
+		}
+	}
+
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	for (int i = 0; i < c_line_count; i++) {
+		logical flag;
+		BOM_line_is_packed(c_line_tags[i], &flag);
+		if (flag) {
+			BOM_line_unpack(c_line_tags[i]);
+		}
+	}
+	AOM_refresh(bom_line, FALSE);
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	//ת��ʱԭ����չ���߼�
+	if (c_line_count == 0 && !dbName.empty() && (strstr(itemId, "1ZD") != NULL ||
+		strstr(itemId, "2ZD") != NULL || strstr(itemId, "4ZD") != NULL)) {
+		//ԭ����չ��
+		char *zt2_MaterialMark;
+		AOM_ask_value_string(designRev, "zt2_MaterialMark", &zt2_MaterialMark);
+		//String zt2_MaterialMark = rev.getProperty("zt2_MaterialMark")
+		string sql = "select materialno, materialutilization, materialunit FROM %s where materialmark = '%s'";
+		char selectRxfs[500];
+		sprintf(selectRxfs, sql.c_str(), dbName.c_str(), zt2_MaterialMark);
+		int outputColumn1 = 0, outputValueCount1 = 0;
+		char*** outputValue1 = NULL;
+		printf("search3 ===> %s\n", selectRxfs);
+		QuerySQLNoInputParam(selectRxfs, &outputColumn1, &outputValueCount1, &outputValue1);
+		if (outputValueCount1 == 0 && strcmp(zt2_MaterialMark, "") != 0) {
+			string buffErr = "";
+			buffErr.append("ͼֽ:").append(itemId).append("-").
+				append(object_name).append(zt2_MaterialMark).append("���ϱ��û��ά��.\n");
+			size_t found = errBuff.find(buffErr);
+			if (found == std::string::npos) {
+				errBuff.append(buffErr);
+			}
+
+		}
+		for (int t = 0; t < outputValueCount1; t++) {
+			string materialno = outputValue1[t][0];
+			string materialutilization = outputValue1[t][1];
+			string materialunit = outputValue1[t][2];
+			tag_t material, materialRev;
+			ITEM_find_item(materialno.c_str(), &material);
+			ITEM_ask_latest_rev(material, &materialRev);
+			string bl_qty = getTyjZl(bom_line, materialutilization, designRev, errBuff);
+			printf("bl_qty%s\n", bl_qty.c_str());
+			NodeBean cBean;
+			cBean.bl_quantity = bl_qty;
+			cBean.bl_sequence_no = "10";
+			cBean.bl_plmxml_occ_xform = "";
+			cBean.mantr = materialRev;
+			pBean.childs.push_back(cBean);
+		}
+	}
+	string maxSeqNo;
+	vector<tag_t> xnzjbVec;
+	for (int i = 0; i < c_line_count; i++) {
+		logical suppressed;
+		AOM_ask_value_logical(c_line_tags[i], "bl_is_occ_suppressed", &suppressed);
+		if (suppressed) {
+			continue;
+		}
+		//�޸Ĺ�֮��֮ǰ�Ѿ��ǽ����״̬�� 
+		logical flag;
+		BOM_line_is_packed(c_line_tags[i], &flag);
+		//printf("flag===>%d\n", flag);
+		if (flag) {
+			int count = 0;
+			char *topNum;
+			AOM_ask_value_string(c_line_tags[i], "bl_quantity", &topNum);
+			tag_t* packLines;
+			BOM_line_ask_packed_lines(c_line_tags[i], &count, &packLines);
+			for (int t = 0; t < count; t++) {
+				tag_t c_Rev;
+				ITKCALL(AOM_ask_value_tag(packLines[t], "bl_line_object", &c_Rev));
+				char* cUid;
+				ITK__convert_tag_to_uid(c_Rev, &cUid);
+				NodeBean cBean;
+				cBean.revUid = cUid;
+				cBean.designRev = c_Rev;
+				cBean.packNum = count + 1;
+				cBean.topNum = atoi(topNum);
+				recyReadBom(c_line_tags[i], cBean, errBuff, dbName, idVector);
+				pBean.childs.push_back(cBean);
+			}
+			AOM_refresh(c_line_tags[i], FALSE);
+			tag_t c_Rev;
+			ITKCALL(AOM_ask_value_tag(c_line_tags[i], "bl_line_object", &c_Rev));
+			char* cUid;
+			ITK__convert_tag_to_uid(c_Rev, &cUid);
+			NodeBean cBean;
+			cBean.revUid = cUid;
+			cBean.designRev = c_Rev;
+			cBean.packNum = count + 1;
+			cBean.topNum = atoi(topNum);
+			recyReadBom(c_line_tags[i], cBean, errBuff, dbName, idVector);
+			pBean.childs.push_back(cBean);
+
+		}
+		else {
+			tag_t c_Rev;
+			char *seqNo, *c_type;
+			ITKCALL(AOM_ask_value_tag(c_line_tags[i], "bl_line_object", &c_Rev));
+			//�����߼� ��ǰ��������ΪZT2_XNZJB ���������ʱ �������㴦�� ����*���������
+			AOM_ask_value_string(c_Rev, "object_type", &c_type);
+			if (strcmp(c_type, "ZT2_XNZJBRevision") == 0) {
+				xnzjbVec.push_back(c_line_tags[i]);
+				continue;
+			}
+			AOM_ask_value_string(c_line_tags[i], "bl_sequence_no", &seqNo);
+			maxSeqNo = seqNo;
+			char* cUid;
+			ITK__convert_tag_to_uid(c_Rev, &cUid);
+			NodeBean cBean;
+			cBean.revUid = cUid;
+			cBean.designRev = c_Rev;
+			recyReadBom(c_line_tags[i], cBean, errBuff, dbName, idVector);
+			pBean.childs.push_back(cBean);
+		}
+	}
+	int maxNum = atoi(maxSeqNo.c_str());
+	int xxt = 1;
+	printf("xnzjbVec ===> %d\n", xnzjbVec.size());
+
+	getAllXnj(xnzjbVec, maxNum, xxt, errBuff, dbName, pBean, 1, idVector);
+}
+void getAllXnj(vector<tag_t> xnzjbVec, int maxNum, int &xxt,
+	string& errBuff, string dbName, NodeBean& pBean, int qtyXn, vector<string> idVector) {
+
+
+	for (int t = 0; t < xnzjbVec.size(); t++) {
+		tag_t c_line_tag = xnzjbVec[t], *cc_line_tags;
+		int cc_line_count;
+		ITKCALL(BOM_line_ask_all_child_lines(c_line_tag, &cc_line_count, &cc_line_tags));
+		char *cnt, *c_type;
+		int qtyPXn = 1;
+		AOM_ask_value_string(c_line_tag, "bl_quantity", &cnt);
+		if (strcmp(cnt, "") != 0) {
+			qtyPXn = atoi(cnt);
+		}
+		//qtyPXn = qtyPXn * qtyXn;
+		vector<tag_t> xnzjbVec2;
+		for (int j = 0; j < cc_line_count; j++) {
+			tag_t c_Rev;
+			char *itemId, *object_name;
+			ITKCALL(AOM_ask_value_tag(cc_line_tags[j], "bl_line_object", &c_Rev));
+			AOM_ask_value_string(c_Rev, "object_type", &c_type);
+			AOM_ask_value_string(c_Rev, "item_id", &itemId);
+			AOM_ask_value_string(c_Rev, "object_name", &object_name);
+			if (strcmp(c_type, "ZT2_XNZJBRevision") == 0) {
+				printf("itemId===>%s\n", itemId);
+				xnzjbVec2.push_back(cc_line_tags[j]);
+				continue;
+			}
+			//�ж������Ƿ�Ϊ Part Revision ZT2_Design3DRevision  ZT2_XNZJB ���DZ���
+			if (strcmp(c_type, "ZT2_Design3DRevision") != 0
+				&& strcmp(c_type, "Part Revision") != 0) {
+				string buffErr = "";
+				buffErr.append("���������쳣:").append(itemId).append("/").append(object_name).append("/").append(c_type).append("\n");
+				size_t found = errBuff.find(buffErr);
+				if (found == std::string::npos) {
+					errBuff.append(buffErr);
+				}
+			}
+			NodeBean cBean;
+			char* cUid;
+			ITK__convert_tag_to_uid(c_Rev, &cUid);
+			cBean.revUid = cUid;
+			cBean.designRev = c_Rev;
+			cBean.xnNum = qtyXn * qtyPXn;
+			int srqNum = maxNum + xxt * 10;
+			string lastnum = to_string(srqNum);
+			xxt = xxt + 1;
+			cBean.bl_sequence_no = lastnum;
+			recyReadBom(cc_line_tags[j], cBean, errBuff, dbName, idVector);
+			pBean.childs.push_back(cBean);
+		}
+		printf("xnzjbVec2 ===> %d ==>%d \n", xnzjbVec2.size(), qtyPXn);
+		if (xnzjbVec2.size() > 0) {
+			getAllXnj(xnzjbVec2, maxNum, xxt, errBuff, dbName, pBean, qtyPXn, idVector);
+		}
+	}
+}
+void getAllXnj(vector<tag_t> xnzjbVec, int maxNum, int &xxt,
+	string& errBuff, string dbName, NodeBean& pBean, int qtyXn,char *loginUserId) {
+	
+	for (int t = 0; t < xnzjbVec.size(); t++) {
+		tag_t c_line_tag = xnzjbVec[t], *cc_line_tags;
+		int cc_line_count;
+		ITKCALL(BOM_line_ask_all_child_lines(c_line_tag, &cc_line_count, &cc_line_tags));
+		char *cnt, *c_type;
+		int qtyPXn = 1;
+		AOM_ask_value_string(c_line_tag, "bl_quantity", &cnt);
+		if (strcmp(cnt, "") != 0) {
+			qtyPXn = atoi(cnt);
+		}
+		//qtyPXn = qtyPXn * qtyXn;
+		vector<tag_t> xnzjbVec2;
+		for (int j = 0; j < cc_line_count; j++) {
+			tag_t c_Rev;
+			char *itemId, *object_name;
+			ITKCALL(AOM_ask_value_tag(cc_line_tags[j], "bl_line_object", &c_Rev));
+			AOM_ask_value_string(c_Rev, "object_type", &c_type);
+			AOM_ask_value_string(c_Rev, "item_id", &itemId);
+			AOM_ask_value_string(c_Rev, "object_name", &object_name);
+			if (strcmp(c_type, "ZT2_XNZJBRevision") == 0) {
+				printf("itemId===>%s\n", itemId);
+				xnzjbVec2.push_back(cc_line_tags[j]);
+				continue;
+			}
+			//�ж������Ƿ�Ϊ Part Revision ZT2_Design3DRevision  ZT2_XNZJB ���DZ���
+			if (strcmp(c_type, "ZT2_Design3DRevision") != 0
+				&& strcmp(c_type, "Part Revision") != 0) {
+				string buffErr = "";
+				buffErr.append("���������쳣:").append(itemId).append("/").append(object_name).append("/").append(c_type).append("\n");
+				size_t found = errBuff.find(buffErr);
+				if (found == std::string::npos) {
+					errBuff.append(buffErr);
+				}
+			}
+			NodeBean cBean;
+			char* cUid;
+			ITK__convert_tag_to_uid(c_Rev, &cUid);
+			cBean.revUid = cUid;
+			cBean.designRev = c_Rev;
+			cBean.xnNum = qtyXn * qtyPXn;
+			int srqNum = maxNum + xxt * 10;
+			string lastnum = to_string(srqNum);
+			xxt = xxt + 1;
+			cBean.bl_sequence_no = lastnum;
+			recyReadBom(cc_line_tags[j], cBean, errBuff, dbName, loginUserId);
+			pBean.childs.push_back(cBean);
+		}
+		printf("xnzjbVec2 ===> %d ==>%d \n", xnzjbVec2.size(), qtyPXn);
+		if (xnzjbVec2.size()>0) {
+			getAllXnj(xnzjbVec2, maxNum, xxt, errBuff, dbName, pBean, qtyPXn, loginUserId);
+		}
+	}
+}
+string GBKToUTF8(const std::string& strGBK)
+{
+	string strOutUTF8 = "";
+	WCHAR * str1;
+	int n = MultiByteToWideChar(CP_ACP, 0, strGBK.c_str(), -1, NULL, 0);
+	str1 = new WCHAR[n];
+	MultiByteToWideChar(CP_ACP, 0, strGBK.c_str(), -1, str1, n);
+	n = WideCharToMultiByte(CP_UTF8, 0, str1, -1, NULL, 0, NULL, NULL);
+	char * str2 = new char[n];
+	WideCharToMultiByte(CP_UTF8, 0, str1, -1, str2, n, NULL, NULL);
+	strOutUTF8 = str2;
+	delete[]str1;
+	str1 = NULL;
+	delete[]str2;
+	str2 = NULL;
+	return strOutUTF8;
+}
+string proProcessCreate(tag_t rev, string process_name)
+{
+	tag_t template_tag = NULLTAG;
+	EPM_find_template2(process_name.c_str(), PROCESS_TEMPLATE, &template_tag);
+	tag_t new_process = NULLTAG;
+	int *tagType = (int *)MEM_alloc(1024 * sizeof(int));//EPM_reference_attachment
+	tag_t * itemTag = (tag_t *)MEM_alloc(1024 * sizeof(tag_t));
+	tagType[0] = EPM_target_attachment;
+	itemTag[0] = rev;
+	EPM_create_process("���ٷ���", "", template_tag, 1, itemTag, tagType, &new_process);
+	return "1";
+}
+
+boolean firstRevision(tag_t designRev, tag_t mantr) {
+	char *revId;
+	int revNum = 0, statusNum=0;
+	tag_t *structure_revisions;
+	AOM_ask_value_string(designRev,"item_revision_id",&revId);
+	AOM_ask_value_tags(mantr, "structure_revisions", &revNum, &structure_revisions);
+	if (revNum > 0) {
+		tag_t struct_revision = structure_revisions[0],*release_status_list;
+		AOM_ask_value_tags(struct_revision, "release_status_list", &statusNum, &release_status_list);
+		if (statusNum == 0) {
+			return false;
+		}
+	}
+	if (strcmp(revId,"V01") > 0) {
+		return true;
+	}
+	else {
+		return false;
+	}
+}
+map<string, int> getBomMsg(tag_t mantrRev) {
+	map<string, int> bomMsgMap;
+	tag_t* bvr_list = NULL, bom_line, ebom_window;
+	int bvr_count=0;
+	ITKCALL(ITEM_rev_list_bom_view_revs(mantrRev, &bvr_count, &bvr_list));
+	//û��BOM��ͼ����
+	if (bvr_count == 0) {
+		return bomMsgMap;
+	}
+	ITKCALL(BOM_create_window(&ebom_window));
+	//�Ƴ�ԭ����
+	ITKCALL(BOM_set_window_top_line(ebom_window, NULL, mantrRev, NULLTAG, &bom_line));
+	int c_line_count;
+	tag_t* c_line_tags;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	printf("c_line_count===>%d\n", c_line_count);
+	for (int t = 0; t < c_line_count; t++) {
+		tag_t c_Rev;
+		char *matnrNo,*cnt;
+		ITKCALL(AOM_ask_value_tag(c_line_tags[t], "bl_line_object", &c_Rev));
+		AOM_ask_value_string(c_Rev,"zt2_MaterialNo",&matnrNo);
+		printf("zt2_MaterialNo===>%s\n", matnrNo);
+		int qtyPXn = 1;
+		AOM_ask_value_string(c_line_tags[t], "bl_quantity", &cnt);
+		if (strcmp(cnt, "") != 0) {
+			qtyPXn = atoi(cnt);
+		}
+		if (bomMsgMap.count(matnrNo)>0) {
+			bomMsgMap[matnrNo] = bomMsgMap[matnrNo] + qtyPXn;
+		}
+		else {
+			bomMsgMap[matnrNo] = qtyPXn;
+		}
+	}
+
+	BOM_close_window(ebom_window);
+	return bomMsgMap;
+}
+//�Ա�Ebom��Dbom
+boolean combEAndDbom(map<string, int> dMap, map<string, int> eMap) {
+	map<string, int>::iterator it;
+	//����ģ��ƥ��
+	for (it = dMap.begin(); it != dMap.end(); it++) {
+		string s = it->first;
+		int dnum = dMap[s];
+		if (eMap.count(s) == 0) {
+			return true;
+		}
+		else if(dnum!= eMap[s]){
+			return true;
+		}
+	}
+	return false;
+}
+void TCMAndOwner(tag_t matnrTop) {
+	int num = 0, revNum;
+	tag_t *mantrsAs, dsuser,*structure_revisions;
+	AOM_ask_value_tags(matnrTop, "TC_Is_Represented_By", &num, &mantrsAs);
+	AOM_ask_value_tag(mantrsAs[0], "owning_user", &dsuser);
+	tag_t defGroup;
+	ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+	ITKCALL(AOM_set_ownership(matnrTop, dsuser, defGroup));
+	if (num > 0) {
+		AOM_ask_value_tags(matnrTop, "structure_revisions", &revNum, &structure_revisions);
+		if (revNum > 0) {
+			ITKCALL(AOM_set_ownership(structure_revisions[0], dsuser, defGroup));
+		}
+	}
+	string process_name = "TCM Release Process";
+	proProcessCreate(matnrTop, process_name);
+}
+void createEbom(NodeBean topBean,boolean isTop,string &hasChange)
+{
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	vector<NodeBean> childs = topBean.childs;
+	//printf("��line���� %d \n", childs.size());
+	tag_t desBean = topBean.designRev;
+	char* id;
+	AOM_ask_value_string(desBean, "item_id", &id);
+	printf("id %s \n", id);
+	tag_t mantr = topBean.mantr;
+	//�ж��Ƿ�����汾 ���Ǿͺ͵�ǰ��EBOM���бȽ� 
+	//��ͬ�����������桢��ͬ�����桢ֻ�Ƚ�����
+	//ITEM_ask_f
+	boolean flagChange = true;
+	
+	if (mantr != NULLTAG && childs.size() > 0) {
+		printf("-----");
+		tag_t* bvr_list = NULL;
+		int bvr_count;
+		ITKCALL(ITEM_rev_list_bom_view_revs(mantr, &bvr_count, &bvr_list));
+		//û��BOM��ͼ����
+		if (bvr_count == 0) {
+			tag_t newView, newViewBvr, pitem,dsuser;
+			ITEM_ask_item_of_rev(mantr, &pitem);
+			ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+			AOM_save(newView);
+			ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, mantr, &newViewBvr));
+			AOM_save(newViewBvr);
+			AOM_save(mantr);
+			AOM_ask_value_tag(desBean,"owning_user", &dsuser);
+			tag_t defGroup;
+			ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+			ITKCALL(AOM_set_ownership(newView, dsuser, defGroup));
+			ITKCALL(AOM_set_ownership(newViewBvr, dsuser, defGroup));
+		}
+		ITKCALL(BOM_create_window(&ebom_window));
+		//�Ƴ�ԭ����
+		ITKCALL(BOM_set_window_top_line(ebom_window, NULL, mantr, NULLTAG, &bom_line));
+		//�����ǰBOM�㼶 �ѷ����IJ���Ҫ����
+		if(flagChange){
+			if (bvr_count > 0) {
+				int c_line_count;
+				tag_t* c_line_tags;
+				ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+				for (int t = 0; t < c_line_count; t++) {
+					char* val;
+					AOM_ask_value_string(c_line_tags[t], "bl_occ_zt2_DtoE", &val);
+					if (strcmp(val, "DBOMת��") == 0) {
+						BOM_line_cut(c_line_tags[t]);
+					}
+				}
+			}
+			for (int i = 0; i < childs.size(); i++) {
+				NodeBean cBean = childs[i];
+				if (cBean.mantr != NULLTAG) {
+					tag_t cLine;
+					ITKCALL(BOM_line_add(bom_line, NULL, cBean.mantr, NULL, &cLine));
+					AOM_lock(cLine);
+					if (cBean.packNum > 0) {
+						string num = cBean.bl_quantity;
+						num = to_string(cBean.topNum / cBean.packNum);
+						ITKCALL(AOM_set_value_string(cLine, "bl_quantity", num.c_str()));
+					}
+					else {
+						printf("num %s \n", cBean.bl_quantity.c_str());
+						ITKCALL(AOM_set_value_string(cLine, "bl_quantity", cBean.bl_quantity.c_str()));
+					}
+
+
+					AOM_set_value_string(cLine, "bl_plmxml_occ_xform", cBean.bl_plmxml_occ_xform);
+					AOM_set_value_string(cLine, "bl_sequence_no", cBean.bl_sequence_no.c_str());
+					ITKCALL(AOM_set_value_string(cLine, "bl_occ_zt2_DtoE", "DBOMת��"));
+					AOM_save(cLine);
+					//���unlock
+					AOM_unlock(cLine);
+					AOM_refresh(cLine, FALSE);
+				}
+				else {
+					printf("eeeeee\n");
+				}
+			}
+			ITKCALL(BOM_save_window(ebom_window));
+		}
+		BOM_close_window(ebom_window);
+		for (int i = 0; i < childs.size(); i++) {
+			NodeBean cBean = childs[i];
+			createEbom(cBean,false,hasChange);
+		}
+	}
+	else {
+		printf("topBean.mantr == NULLTAG\n");
+	}
+
+}
+void copyEBomLine(tag_t matnrTop, tag_t otherPbom) {
+	tag_t ebom_window, ebom_window2, *bvr_list, *bvr_list2, bom_line, bom_line2, *c_line_tags, *c_line_tags2;
+	int bvr_count = 0, bvr_count2 = 0, c_line_count, c_line_count2;
+	(BOM_create_window(&ebom_window));
+	(ITEM_rev_list_bom_view_revs(matnrTop, &bvr_count, &bvr_list));
+	printf("bvr_count=%d \n", bvr_count);
+	if (bvr_count == 0) {
+		//errBuff.append("������EBOM����\n");
+	}
+	ITKCALL(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	printf("����bom��ȡ\n");
+	//ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &mantr));
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+
+
+	(ITEM_rev_list_bom_view_revs(otherPbom, &bvr_count2, &bvr_list2));
+	if (bvr_count2 == 0) {
+		tag_t newView, newViewBvr, pitem;
+		ITEM_ask_item_of_rev(otherPbom, &pitem);
+		ITKCALL(PS_create_bom_view(NULL, NULL, NULL, pitem, &newView));
+		AOM_save(newView);
+		ITKCALL(PS_create_bvr(newView, NULL, NULL, FALSE, otherPbom, &newViewBvr));
+		AOM_save(newViewBvr);
+		AOM_save(otherPbom);
+		int num = 0;
+		tag_t dsuser, *structure_revisions, *bom_view_tags, *mantrs;
+		ITKCALL(AOM_ask_value_tags(otherPbom, "TC_Is_Represented_By", &num, &mantrs));
+		if (num == 1) {
+			AOM_ask_value_tag(mantrs[0], "owning_user", &dsuser);
+			tag_t defGroup;
+			ITKCALL(AOM_ask_value_tag(dsuser, "default_group", &defGroup));
+			ITKCALL(AOM_set_ownership(newView, dsuser, defGroup));
+			ITKCALL(AOM_set_ownership(newViewBvr, dsuser, defGroup));
+		}
+		//return;
+		(ITEM_rev_list_bom_view_revs(otherPbom, &bvr_count2, &bvr_list2));
+	}
+	(BOM_create_window(&ebom_window2));
+	(BOM_set_window_top_line_bvr(ebom_window2, bvr_list2[0], &bom_line2)); //����bom��ȡ
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line2, &c_line_count2, &c_line_tags2));
+	for (int i = 0; i < c_line_count2; i++) {
+		BOM_line_cut(c_line_tags2[i]);
+	}
+	for (int i = 0; i < c_line_count; i++) {
+		tag_t newChild; char *bl_seqNo;
+		ITKCALL(BOM_line_copy(bom_line2, c_line_tags[i], NULLTAG, &newChild));
+		AOM_ask_value_string(c_line_tags[i],"bl_sequence_no",&bl_seqNo);
+		AOM_lock(newChild);
+		AOM_set_value_string(newChild, "bl_sequence_no", bl_seqNo);
+		AOM_save(newChild);
+		//���unlock
+		AOM_unlock(newChild);
+	}
+	//tag_t newChild;
+	//ITKCALL(BOM_line_copy(bom_line2, c_line_tags[i], NULLTAG, &newChild));
+
+	ITKCALL(BOM_save_window(ebom_window2));
+	BOM_close_window(ebom_window2);
+	BOM_close_window(ebom_window);
+}
+//��ȡ�������� �ж��Ƿ�����
+int getClassValByTop(tag_t item, string& errMessage) {
+	char*id;
+	AOM_ask_value_string(item,"item_id",&id);
+	vector<string> vec;
+	Split(id, "-", vec);
+	tag_t topItem;
+	if (vec.size() > 1) {
+		string topId;
+		topId.append("1ZDB300000P-").append(vec[1]);
+		ITEM_find_item(topId.c_str(),&topItem);
+	}
+	else {
+		return 1;
+	}
+	tag_t top_classificationObject;
+	ICS_ask_classification_object(topItem, &top_classificationObject);
+	if (top_classificationObject == NULL_TAG)
+	{
+		errMessage.append("�������û�з��͵�����\n");
+		return  0;
+	}
+	char* top_class_id = NULL, *top_class_name = NULL;
+	//ICS_ask_class_of_classification_obj(top_classificationObject, &top_class_tag);
+	//ICS_ask_id_name(top_class_tag, &top_class_id, &top_class_name);
+	printf("BOM TOP LINE CLASS ID = %s | NAME = %s \n", top_class_id, top_class_name);
+	int n_attrs;
+	char** attr_names;
+	char** attr_vals;
+	ITKCALL(ICS_ask_attributes_of_classification_obj(top_classificationObject, &n_attrs, &attr_names, &attr_vals));
+	cout << n_attrs << endl;
+	int num = 1;
+	for (int ii = 0; ii < n_attrs; ii++)
+	{
+		printf("attr_names[ii]==>%sTTT\n", attr_names[ii]);
+		printf("attr_vals[ii]==>%sTTT\n", attr_vals[ii]);
+		if (strcmp(attr_names[ii], "����") == 0) {
+			if (strcmp(attr_vals[ii], "") == 0) {
+				errMessage.append("������������Ϊ�գ����顣\n");
+				return 0;
+			}
+			else {
+				printf("111[ii]==TTT\n");
+				if (strstr(attr_vals[ii], "3") != NULL) {
+					num = 3;
+				}
+				else if (strstr(attr_vals[ii], "1") != NULL) {
+					num = 1;
+				}
+				else if (strstr(attr_vals[ii], "5") != NULL) {
+					num = 5;
+				}
+				//num = atoi(attr_vals[ii]);
+			}
+			break;
+		}
+	}
+	return num;
+}
+int DbomToEMethod(void* returnValue) {
+	int ifail = ITK_ok;
+	char *sql = NULL,*revUid;
+	tag_t designRev,item;
+	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+	ITK__convert_uid_to_tag(revUid, &designRev);
+	ITEM_ask_item_of_rev(designRev,&item);
+	ITEM_ask_latest_rev(item,&designRev);
+	if (open("PLMUser", "PLMUser", "BDP2020", "10.128.20.35")) {
+		printf("����SQLSERVERʧ��\n");
+	}
+	else {
+		printf("����SQLSERVER�ɹ�\n");
+	}
+	//����design BOM ��ȡ������Ϣ
+	int bvr_count = 0, c_line_count;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(designRev, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	printf("����bom��ȡ\n");
+
+	//(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	NodeBean topBean;
+	//����
+	string errBuff;
+	//xsLen = 1;
+	xsLen = getClassValByTop(designRev, errBuff);
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+
+	//map<string,
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		ifail = 1;
+	}
+	string dbName;
+	int url_num2 = 0;
+	char** url_vals2 = NULL;
+	PREF_ask_char_values("CHINT_MATERIAL_RAW", &url_num2, &url_vals2);
+	for (int t = 0; t < url_num2; t++) {
+		vector<string> vec;
+		Split(url_vals2[t], ":", vec);
+		if (vec[0].compare("M060") == 0) {
+			dbName = vec[1];
+		}
+	}
+	char *loginUserId;
+	printf("dbName===%s\n", dbName.c_str());
+	POM_get_user_id(&loginUserId);
+	recyReadBom(bom_line, topBean, errBuff, dbName, loginUserId);
+	DisConnServer();
+	BOM_close_window(ebom_window);
+	//�BOM
+	POM_AM__set_application_bypass(true);
+	printf("error %s \n", errBuff.c_str());
+	if (errBuff.empty()) {
+		string hasChange="";
+		createEbom(topBean,true, hasChange);
+		printf("topBean.ccps.size()====>%d\n", topBean.ccps.size());
+		//û�и���ֱ������
+		if (topBean.ccps.size()>0 && hasChange.compare("no")!=0) {
+			tag_t desBean = topBean.designRev;
+			//vector<NodeBean> childs = topBean.childs;
+			/*map<string, int> dMap;
+			for (int i = 0; i < childs.size(); i++) {
+				NodeBean cBean = childs[i];
+				char *matnrNo, *uid;
+				AOM_ask_value_string(cBean.mantr, "zt2_MaterialNo", &matnrNo);
+				ITK__convert_tag_to_uid(cBean.mantr, &uid);
+				printf("uid[%s]\n", uid);
+				printf("matnrNo[%s]\n", matnrNo);
+				int qtyPXn = 1;
+				string cnt = cBean.bl_quantity;
+				if (strcmp(cnt.c_str(), "") != 0) {
+					qtyPXn = atoi(cnt.c_str());
+				}
+				if (dMap.count(matnrNo) > 0) {
+					dMap[matnrNo] = dMap[matnrNo] + qtyPXn;
+				}
+				else {
+					dMap[matnrNo] = qtyPXn;
+				}
+			}
+			printf("dMap[%d]", dMap.size());*/
+			for (int t = 0; t < topBean.ccps.size();t++) {
+				tag_t mantr = topBean.ccps[t];
+				boolean flagChange = true;
+				//if (firstRevision(desBean, mantr)) {
+				//	map<string, int> eMap = getBomMsg(mantr);
+				//	printf("eMap[%d]", eMap.size());
+				//	boolean needAs = false;
+				//	if (dMap.size() != eMap.size()) {
+				//		//���� + ����
+				//		needAs = true;
+				//	}
+				//	else if (combEAndDbom(dMap, eMap)) {
+				//		//���� + ����
+				//		needAs = true;
+				//	}
+				//	if (needAs) {
+				//		printf("=======TEST======\n");
+				//		//���沢����
+				//		ITKCALL(ITEM_copy_rev(mantr, NULL, &mantr));
+				//		TCMAndOwner(mantr);
+				//		//return;
+				//	}
+				//	else {
+				//		flagChange = false;
+				//	}
+				//}
+				if (flagChange) {
+					tag_t topItem,topRev;
+					ITEM_ask_item_of_rev(topBean.mantr, &topItem);
+					ITEM_ask_latest_rev(topItem,&topRev);
+					copyEBomLine(topRev, mantr);
+				}
+			}
+		}
+		errBuff = "succ";
+	}
+	/*else {
+		printf(errBuff.c_str());
+	}*/
+
+	POM_AM__set_application_bypass(false);
+	
+	close();
+	printf("�ͷ����ݿ�ɹ�\n");
+	printf("��line���� %d \n", topBean.childs.size());
+	string buff = errBuff;
+	*((char**)returnValue) = (char*)MEM_alloc((strlen(buff.c_str()) + 1) * sizeof(char));
+	tc_strcpy(*((char**)returnValue), buff.c_str());
+	return ifail;
+}
+
+int DbomToEMethodUser(void* returnValue) {
+	int ifail = ITK_ok;
+	char *sql = NULL, *revUid;
+	tag_t designRev;
+	ITKCALL(ifail = USERARG_get_string_argument(&revUid));
+	ITK__convert_uid_to_tag(revUid, &designRev);
+
+	if (open("PLMUser", "PLMUser", "BDP2020", "10.128.20.35")) {
+		printf("����SQLSERVERʧ��\n");
+	}
+	else {
+		printf("����SQLSERVER�ɹ�\n");
+	}
+	//����design BOM ��ȡ������Ϣ
+	int bvr_count = 0, c_line_count;
+	tag_t ebom_window = NULLTAG;
+	tag_t bom_line = NULLTAG;
+	tag_t item_tag = NULLTAG, *c_line_tags;
+	(BOM_create_window(&ebom_window));
+	tag_t* bvr_list = NULL;
+	(ITEM_rev_list_bom_view_revs(designRev, &bvr_count, &bvr_list));
+	printf("bvr_count=%d", bvr_count);
+
+	(BOM_set_window_top_line_bvr(ebom_window, bvr_list[0], &bom_line)); //����bom��ȡ
+	printf("����bom��ȡ\n");
+
+	//(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	NodeBean topBean;
+	//����
+	string errBuff;
+
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+
+	//map<string,
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		ifail = 1;
+	}
+	string dbName;
+	int url_num2 = 0, url_num3=0;
+	char** url_vals2 = NULL,**url_vals3=NULL;
+	PREF_ask_char_values("CHINT_MATERIAL_RAW", &url_num2, &url_vals2);
+	for (int t = 0; t < url_num2; t++) {
+		vector<string> vec;
+		Split(url_vals2[t], ":", vec);
+		if (vec[0].compare("M060") == 0) {
+			dbName = vec[1];
+		}
+	}
+	PREF_ask_char_values("CHINT_M060_KJTOSAP", &url_num3, &url_vals3);
+	vector<string> idVector;
+	if (url_num3>0) {
+		Split(url_vals3[0], ";", idVector);
+	} 
+
+	//if (std::find(v.begin(), v.end(), key) != v.end()) {
+
+	//}
+	recyReadBom(bom_line, topBean, errBuff, dbName, idVector);
+	DisConnServer();
+	BOM_close_window(ebom_window);
+	//�BOM
+	POM_AM__set_application_bypass(true);
+	printf("error %s \n", errBuff.c_str());
+	if (errBuff.empty()) {
+		string change;
+		createEbom(topBean,false, change);
+		printf("topBean.ccps.size()====>%d\n", topBean.ccps.size());
+		if (topBean.ccps.size() > 0) {
+			for (int t = 0; t < topBean.ccps.size(); t++) {
+				copyEBomLine(topBean.mantr, topBean.ccps[t]);
+			}
+		}
+		errBuff = "succ";
+	}
+	/*else {
+		printf(errBuff.c_str());
+	}*/
+
+	POM_AM__set_application_bypass(false);
+
+	close();
+	printf("�ͷ����ݿ�ɹ�\n");
+	printf("��line���� %d \n", topBean.childs.size());
+	string buff = errBuff;
+	*((char**)returnValue) = (char*)MEM_alloc((strlen(buff.c_str()) + 1) * sizeof(char));
+	tc_strcpy(*((char**)returnValue), buff.c_str());
+	return ifail;
+}
+
+int chintSignChange(EPM_action_message_t msg)
+{
+
+	cout<<"chintSignChange start"<<endl;
+	//20200113
+	POM_AM__set_application_bypass(true);
+
+	EPM_decision_t decision = EPM_go;
+	int ifail = ITK_ok, arg_cnt = 0, i = 0, att_cnt = 0;
+	tag_t task_tag = NULLTAG, rootTask_tag = NULLTAG, *attachments = NULL;
+	// char * ref_type=NULL;
+	// int actualNum=0;
+	//��ȡ��ǰ����������
+	task_tag = msg.task;
+	//��ȡ�����̽ڵ�
+	ifail = EPM_ask_root_task(task_tag, &rootTask_tag);
+	//��ȡĿ�����ö���
+	ifail = EPM_ask_attachments(rootTask_tag, EPM_target_attachment, &att_cnt, &attachments);
+	int reference_count=0;tag_t * reference_attachment=NULLTAG;
+	ifail = EPM_ask_attachments(rootTask_tag, EPM_reference_attachment, &reference_count, &reference_attachment);
+	map<tag_t,string>	rev_map;
+	char *zt2_Design=NULL;
+	char *zt2_DesignTime=NULL;
+	char *zt2_Proofread=NULL;
+	char *zt2_ProofreadTime=NULL;
+	char *zt2_Normalization=NULL;
+	char *zt2_NormalizationTime=NULL;
+	char *zt2_Review=NULL;
+	char *zt2_ReviewTime=NULL;
+	char *zt2_Approve=NULL;
+	char *zt2_ApproveTime =NULL;
+	char *zt2_Technology=NULL;
+	char *zt2_TechnologyTime =NULL;
+	char *zt2_Countersign = NULL;
+	char *zt2_CountersignTime = NULL;
+
+	int eCount=0;
+	tag_t *eTag=NULLTAG;
+//	vector.clear();//�������Ԫ��
+	//ѭ��Ŀ�����
+	for (i = 0; i < att_cnt; i++)
+	{
+		tag_t  targetTag=attachments[i];
+		//����ǰ汾���͵ľͲ����ϲ�
+		char * object_type=NULL;
+		ITKCALL(ifail=AOM_ask_value_string(targetTag,"object_type",&object_type));
+		cout<<i<<"--object_type:"<<object_type<<endl;
+		if(strstr(object_type,"ZT2_Change")!=NULL)
+		{
+			//��ȡ�������ǩ������
+
+			AOM_ask_value_string(targetTag,"zt2_Design",&zt2_Design);
+			AOM_ask_value_string(targetTag,"zt2_DesignTime",&zt2_DesignTime);
+			AOM_ask_value_string(targetTag,"zt2_Proofread",&zt2_Proofread);
+			AOM_ask_value_string(targetTag,"zt2_ProofreadTime",&zt2_ProofreadTime);
+			AOM_ask_value_string(targetTag,"zt2_Normalization",&zt2_Normalization);
+			AOM_ask_value_string(targetTag,"zt2_NormalizationTime",&zt2_NormalizationTime);
+			AOM_ask_value_string(targetTag,"zt2_Review",&zt2_Review);
+			AOM_ask_value_string(targetTag,"zt2_ReviewTime",&zt2_ReviewTime);
+			AOM_ask_value_string(targetTag,"zt2_Approve",&zt2_Approve);
+			AOM_ask_value_string(targetTag,"zt2_ApproveTime",&zt2_ApproveTime);
+			AOM_ask_value_string(targetTag,"zt2_Countersign",&zt2_Countersign);
+			AOM_ask_value_string(targetTag,"zt2_CountersignTime",&zt2_CountersignTime);
+			//��ȡ��������ݼ�
+
+			AOM_ask_value_tags(targetTag,"IMAN_reference",&eCount,&eTag);
+			for(int j=0;j<eCount;j++)
+			{
+				char *eType=NULL;
+				AOM_ask_value_string(eTag[j],"object_type",&eType);
+
+				if(strcmp(eType,"MSExcel")==0)
+				{
+					int num=0;
+					char**values=NULL;
+					AOM_ask_value_strings(targetTag,"zt2_ChangeDrawingNo",&num,&values);
+					int modules=num%5;
+					int delivery=num/5;
+					int page=0;
+					if(modules>0)
+					{
+						page=delivery+1;
+					}else
+					{
+						page=delivery;
+					}
+					writeToExcel(page,eTag[j],zt2_Design,zt2_DesignTime,zt2_Proofread,zt2_ProofreadTime,zt2_Normalization,
+						zt2_NormalizationTime,zt2_Review,zt2_ReviewTime,zt2_Approve,zt2_ApproveTime,zt2_Countersign,zt2_CountersignTime);
+					if(values!=NULL)
+					{
+						for(int t=0;t<num;t++)
+						{
+							if(values[t]!=NULL)
+							{
+								MEM_free(values[t]);
+								values[t]=NULL;
+							}
+						}
+						values=NULL;
+
+					}
+					
+				}
+				DOFREE(eType);
+			}
+		}else if(strstr(object_type,"ZT2_SCXXCDTZD")!=NULL)
+		{
+			//��ȡ�������ǩ������
+
+			AOM_ask_value_string(targetTag,"zt2_Design",&zt2_Design);
+			AOM_ask_value_string(targetTag,"zt2_DesignTime",&zt2_DesignTime);
+			AOM_ask_value_string(targetTag,"zt2_Proofread",&zt2_Proofread);
+			AOM_ask_value_string(targetTag,"zt2_ProofreadTime",&zt2_ProofreadTime);
+			AOM_ask_value_string(targetTag,"zt2_Normalization",&zt2_Normalization);
+			AOM_ask_value_string(targetTag,"zt2_NormalizationTime",&zt2_NormalizationTime);
+			AOM_ask_value_string(targetTag,"zt2_Review",&zt2_Review);
+			AOM_ask_value_string(targetTag,"zt2_ReviewTime",&zt2_ReviewTime);
+			AOM_ask_value_string(targetTag,"zt2_Approve",&zt2_Approve);
+			AOM_ask_value_string(targetTag,"zt2_ApproveTime",&zt2_ApproveTime);
+			AOM_ask_value_string(targetTag,"zt2_Technology",&zt2_Technology);
+			AOM_ask_value_string(targetTag,"zt2_TechnologyTime",&zt2_TechnologyTime);
+			AOM_ask_value_string(targetTag,"zt2_Countersign",&zt2_Countersign);
+			AOM_ask_value_string(targetTag,"zt2_CountersignTime",&zt2_CountersignTime);
+			//��ȡ��������ݼ�
+
+			AOM_ask_value_tags(targetTag,"IMAN_reference",&eCount,&eTag);
+			tag_t rev = NULLTAG;
+			ITEM_ask_latest_rev(targetTag,&rev);
+			char *object_desc = NULL;
+			AOM_ask_value_string(rev,"object_desc",&object_desc);
+			string desc = object_desc;
+			int pages = 0;
+			if(!desc.empty())
+			{
+				pages = atol(desc.c_str());
+			}
+			cout<<"ZT2_SCXXCDTZD--eCount:"<<eCount<<endl;
+			for(int j=0;j<eCount;j++)
+			{
+				char *eType=NULL;
+				AOM_ask_value_string(eTag[j],"object_type",&eType);
+				cout<<j<<"--eType:"<<eType<<endl;
+				if(strcmp(eType,"MSExcel")==0)
+				{
+					int num=0;
+					char**values=NULL;
+					/*
+					AOM_ask_value_strings(targetTag,"zt2_ChangeDrawingNo",&num,&values);
+					int modules=num%5;
+					int delivery=num/5;
+					int page=0;
+					if(modules>0)
+					{
+						page=delivery+1;
+					}else
+					{
+						page=delivery;
+					}
+					*/
+					
+					writeToExcel2(pages,eTag[j],zt2_Design,zt2_DesignTime,zt2_Proofread,zt2_ProofreadTime,
+						zt2_Normalization,zt2_NormalizationTime,zt2_Review,zt2_ReviewTime,
+						zt2_Approve,zt2_ApproveTime,zt2_Technology,zt2_TechnologyTime,zt2_Countersign,zt2_CountersignTime);
+					if(values!=NULL)
+					{
+						for(int t=0;t<num;t++)
+						{
+							if(values[t]!=NULL)
+							{
+								MEM_free(values[t]);
+								values[t]=NULL;
+							}
+						}
+						values=NULL;
+
+					}
+					
+				}
+				DOFREE(eType);
+			}
+		
+		
+		}
+
+		if(object_type!=NULL)
+		{
+			MEM_free(object_type);
+			object_type=NULL;
+		}
+	}
+
+	DOFREE(eTag);
+	DOFREE(zt2_Design);
+	DOFREE(zt2_DesignTime);
+	DOFREE(zt2_Proofread);
+	DOFREE(zt2_ProofreadTime);
+	DOFREE(zt2_Normalization);
+	DOFREE(zt2_NormalizationTime);
+	DOFREE(zt2_Review);
+	DOFREE(zt2_ReviewTime);
+	DOFREE(zt2_Approve);
+	DOFREE(zt2_ApproveTime);
+	DOFREE(zt2_Technology);
+	DOFREE(zt2_TechnologyTime);
+	cout<<"chintSignChange end"<<endl;
+	// CloseLog_jk();
+	POM_AM__set_application_bypass(false);
+	return 0;
+}
\ No newline at end of file
diff --git a/General/General/chint_Handler.h b/General/General/chint_Handler.h
new file mode 100644
index 0000000..6d4f88c
--- /dev/null
+++ b/General/General/chint_Handler.h
@@ -0,0 +1,7 @@
+#include "tc_log.h"
+#include "tc_util.h"
+#include <tccore\item_msg.h>
+
+
+int ChintSendMessage_1(EPM_action_message_t msg);
+int chint_set_prop_1(EPM_action_message_t msg);
diff --git a/General/General/chint_add_to_workflow.cpp b/General/General/chint_add_to_workflow.cpp
new file mode 100644
index 0000000..0b41882
--- /dev/null
+++ b/General/General/chint_add_to_workflow.cpp
@@ -0,0 +1,538 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <sa/workcontext.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+#include <property/nr.h>
+#include "CRUL_server_call_httpserver.h"
+
+void addToFlow(tag_t bom_line,tag_t rootTask_tag, map<string, string> &uidMap) {
+
+	int structs=0;
+	tag_t rev, *structure_revisions;
+	ITKCALL(AOM_ask_value_tag(bom_line, "bl_line_object", &rev));
+	int attachment_types = EPM_reference_attachment;
+	int attachment_types2 = EPM_target_attachment;
+	//�汾��BOM��ͼ�ҷ���
+	AOM_ask_value_tags(rev,"structure_revisions", &structs,&structure_revisions);
+	if (structs > 0) {
+		int statusNum = 0, statusNum2=0;
+		char *revUid;
+		tag_t *release_status_list,*release_status_list2;
+		tag_t struct_revision = structure_revisions[0];
+		AOM_ask_value_tags(struct_revision,"release_status_list",&statusNum,&release_status_list);
+		ITK__convert_tag_to_uid(rev,&revUid);
+		printf("revUid%s\n", revUid);
+		if (statusNum==0 && uidMap.count(revUid)==0) {
+			uidMap[revUid] = "1";
+			tag_t *stageTags;
+			int stageNum = 0;
+			AOM_ask_value_tags(struct_revision, "process_stage_list", &stageNum, &stageTags);
+			if (stageNum > 0) {
+				EPM_add_attachments(rootTask_tag, 1, &struct_revision, &attachment_types);
+			}
+			else {
+				EPM_add_attachments(rootTask_tag, 1, &struct_revision, &attachment_types2);
+			}
+			EPM_add_attachments(rootTask_tag, 1, &rev, &attachment_types);
+		}
+	}
+	
+	int c_line_count;
+	tag_t * c_line_tags;
+	ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+	for (int num = 0; num < c_line_count; num++) {
+		addToFlow(c_line_tags[num], rootTask_tag, uidMap);
+	}
+
+}
+string getPrefVal(char *url_vals,char *itemId) {
+	vector<string> taskComps;
+	string name;
+	Split(url_vals, ";", taskComps);
+	for (int i = 0; i < taskComps.size(); i++) {
+		string taskComp = taskComps[i];
+		if (strstr(taskComp.c_str(), itemId) != NULL) {
+			vector<string> names;
+			Split(taskComp, "=", names);
+			name = names[1];
+		}
+	}
+	return name;
+}
+int CHINT_task_complete(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	ECHO("=========================================================\n");
+	ECHO("CHINT_task_complete ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+	char* jobName;
+	current_task = msg.task;
+	AOM_ask_value_string(current_task, "job_name", &jobName);
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	int url_num = 0;
+	char** url_vals = NULL,*uid;
+	PREF_ask_char_values("CHINT_TaskComplete", &url_num, &url_vals);
+	char* userName;
+	int numl;
+	tag_t workContents,userTag,*task_list;
+	//EPM_inbox_query
+	POM_get_user(&userName, &userTag);
+	ITKCALL(EPM_ask_assigned_tasks(userTag, 2, &numl,&task_list));
+	printf("��ʾ:uid%d\n", numl);
+	//��ȡ��ǰ�ڵ���Ϣ 00089 �� IDǰ׺
+	vector<string>nameVec;
+	Split(jobName, "/", nameVec);
+	vector<string> projectVec;
+	Split(nameVec[0], "-", projectVec);
+	//SA_workcontext_invalid_group_member
+	tag_t query = NULLTAG, *tags;
+	//fields.put("����", "*" + item_id + "*" + zt2_TYJNo + "*");
+	ITKCALL(QRY_find2("��ѯ��Ŀ", &query));
+	char* qry_entries[1] = { "���̱��" }, *qry_values[1] = { (char*)projectVec[1].c_str() };
+	int n_found;
+	ITKCALL(QRY_execute(query, 1, qry_entries, qry_values, &n_found, &tags));
+	printf("n_found===>%d\n", n_found);
+	for (int t = 0; t < n_found; t++) {
+		tag_t rev = tags[t];
+		char *id;
+		AOM_ask_value_string(rev, "item_id", &id);
+		string names = getPrefVal(url_vals[0], (char*)projectVec[0].c_str());
+		vector<string> nameVec;
+		Split(names,"&", nameVec);
+		for (int i = 0; i < nameVec.size(); i++) {
+			string projName = id;
+			projName.append("-").append(nameVec[i]);
+			printf("projName %s \n", projName.c_str());
+			for (int j = 0; j < numl; j++) {
+				tag_t taskTag = task_list[j];
+				char *taskName;
+				AOM_ask_value_string(taskTag, "job_name", &taskName);
+				printf("taskName %s \n", taskName);
+				if (strstr(taskName, projName.c_str())!=NULL) {
+					ITKCALL(EPM_set_task_result(taskTag, EPM_RESULT_Completed));
+					ITKCALL(EPM_trigger_action(taskTag, EPM_complete_action, ""));
+				}
+			}
+		}
+	}
+	return ifail;
+}
+int chint_CheckTable_State(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	ECHO("=========================================================\n");
+	ECHO("chint_CheckTable_State ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+	char* taskName;
+	current_task = msg.task;
+	AOM_ask_value_string(current_task,"object_name",&taskName);
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		ifail = 1;
+	}
+	string errmsg;
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		char *type, *itemId;
+		tag_t taskTag = taskAttches[count];
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+			AOM_ask_value_string(taskTag, "item_id", &itemId);
+			//����Ƿ���ҪУ�Ա� 
+			vector<string> vec;
+			Split(itemId,"-",vec);
+			string sql = "select * from CHINT_CHECK_TITLE_TEMPLATE where drawingno = '%s' ";
+			char selectRecord[400];
+			sprintf(selectRecord, sql.c_str(), vec[0]);
+			printf("selectRecord ===> %s\n", selectRecord);
+			int outputColumn = 0, outputValueCount = 0;
+			char*** outputValue = NULL;
+			QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+			if (outputValueCount > 0) {
+				/*select * from CHINT_CHECK_TITLE where DRAWINGNO = '1ZDB530000X-PLM21' and
+					AUDITDATE is not NULL and NUMBEROFCHECKS = (select max(NUMBEROFCHECKS)from CHINT_CHECK_TITLE where DRAWINGNO = '1ZDB530000X-PLM21')*/
+				string sqlTitle = "select datastatus,%s from CHINT_CHECK_TITLE where DRAWINGNO = '%s' order by NUMBEROFCHECKS desc ";
+				char selectRecord2[400];
+				string taskCol = "";
+				if (strcmp(taskName, "���") == 0) {
+					//���
+					taskCol = "DESIGNDATE"; //PROOFREADDATE AUDITDATE
+				}else if (strcmp(taskName, "��") == 0) {
+					taskCol = "PROOFREADDATE"; //PROOFREADDATE AUDITDATE
+				}
+				else if (strcmp(taskName, "���") == 0) {
+					taskCol = "AUDITDATE"; //PROOFREADDATE AUDITDATE
+				}
+				sprintf(selectRecord2, sqlTitle.c_str(), taskCol.c_str(), itemId);
+				int outputColumn1 = 0, outputValueCount1 = 0;
+				char*** outputValue1 = NULL;
+				printf("selectRecord2 ===> %s\n", selectRecord2);
+				QuerySQLNoInputParam(selectRecord2, &outputColumn1, &outputValueCount1, &outputValue1);
+				if (outputValueCount1>0) {
+					string status = outputValue1[0][0];
+					string date = outputValue1[0][1];
+					if (status.compare("��ʽ�ύ") != 0 || date.empty()) {
+						ifail = 1;
+						errmsg.append("ͼֽ:").append(itemId).append(" У�Ա�û����ʽ�ύ,����.\n");
+					}
+				}
+				else {
+					ifail = 1;
+					errmsg.append("ͼֽ:").append(itemId).append(" û��У�Ա�,����.\n");
+				}
+			}
+		}
+	}
+	DisConnServer();
+	if (ifail == 1) {
+		EMH_store_error_s1(EMH_severity_user_error, EMH_USER_error_base, errmsg.c_str());
+	}
+	return ifail;
+}
+int chint_check_ZC_ZJ_BOM(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	ECHO("=========================================================\n");
+	ECHO("chint_check_ZC_ZJ_BOM ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+
+	current_task = msg.task;
+
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	string errmsg;
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		char *type, *itemId;
+		tag_t taskTag = taskAttches[count],ebom_window,bom_line;
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		if (strstr(type, "ZT2_MainMat") != NULL) {
+			//����BOM���BOM������ZT2_REMARK
+
+			ITKCALL(BOM_create_window(&ebom_window));
+			ITKCALL(BOM_set_window_top_line(ebom_window, NULL, taskTag, NULLTAG, &bom_line));
+			boolean flag = false;
+			int c_line_count;
+			tag_t * c_line_tags;
+			ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+			for (int i = 0; i < c_line_count; i++) {
+				char*ztRemark;
+				tag_t line = c_line_tags[i];
+				AOM_ask_value_string(line,"ZT2_Remark",&ztRemark);
+				if (strcmp(ztRemark, "") != 0) {
+					flag = true;
+				}
+			}
+			if (!flag) {
+				ifail = 1;
+				char*itemID;
+				AOM_ask_value_string(taskTag, "item_id", &itemID);
+				errmsg.append("����BOM:").append(itemID).append(" δ��д��ע������д��ע������ִ��.\n");
+				//��ǰ����δ��д��ע������д��ע������ִ��
+			}
+			ITKCALL(BOM_close_window(ebom_window));
+		}
+		else if (strcmp(type, "ZT2_RequisitionRevision") == 0) {
+			//��ǰ�빺�������������û������BOM
+			ITKCALL(BOM_create_window(&ebom_window));
+			ITKCALL(BOM_set_window_top_line(ebom_window, NULL, taskTag, NULLTAG, &bom_line));
+			int c_line_count;
+			tag_t * c_line_tags;
+			boolean flag = false;
+			ITKCALL(BOM_line_ask_all_child_lines(bom_line, &c_line_count, &c_line_tags));
+			for (int i = 0; i < c_line_count; i++) {
+				char*ztRemark;
+				tag_t line = c_line_tags[i];
+				AOM_ask_value_string(line, "fnd0bl_line_object_type", &ztRemark);
+				if (strcmp(ztRemark, "ZT2_MainMatRevision") == 0) {
+					flag = true;
+				}
+			}
+			if (!flag) {
+				ifail = 1;
+				char*itemID;
+				AOM_ask_value_string(taskTag, "item_id", &itemID);
+				errmsg.append("��ǰ�빺���BOM:").append(itemID).append(" ȱ������BOM�ɷ�,����BOM,������ִ��.\n");
+				//��ǰ����δ��д��ע������д��ע������ִ��
+			}
+			ITKCALL(BOM_close_window(ebom_window));
+		}
+		
+	}
+	if (ifail == 1) {
+		EMH_store_error_s1(EMH_severity_user_error, EMH_USER_error_base, errmsg.c_str());
+	}
+	return ifail;
+}
+int chint_backCheckTable(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	ECHO("=========================================================\n");
+	ECHO("chint_backCheckTable ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+
+	current_task = msg.task;
+
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("database_tc", &url_num, &url_vals);
+	string url = url_vals[0];
+	url.append("/").append(url_vals[2]);
+	printf("url ==> %s \n", url.c_str());
+	if (ConnServer(url_vals[3], url_vals[4], (char*)url.c_str()) == -1)
+	{
+		printf("��ʾ:�м����ݱ�����ʧ��\n");
+		ifail = 1;
+	}
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		char *type,*itemId;
+		tag_t taskTag = taskAttches[count];
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+			AOM_ask_value_string(taskTag, "item_id", &itemId);
+			string sqlTitle = "select CHECKNO,NUMBEROFCHECKS from CHINT_CHECK_TITLE where DRAWINGNO = '%s' order by NUMBEROFCHECKS desc";
+			char selectRecord[400];
+			sprintf(selectRecord, sqlTitle.c_str(), itemId);
+			int outputColumn = 0, outputValueCount = 0;
+			char*** outputValue = NULL;
+			printf("search3 ===> %s\n", selectRecord);
+			QuerySQLNoInputParam(selectRecord, &outputColumn, &outputValueCount, &outputValue);
+			if (outputValueCount > 0) {
+				printf("outputValueCount ===> %d\n", outputValueCount);
+				string code = outputValue[0][0];
+				string cnt = outputValue[0][1];
+				printf("code,cnt ===> %s %s \n", code.c_str(), cnt.c_str());
+				int num = atoi(cnt.c_str())+1;
+				string newCnt = to_string(num);
+				string title = "INSERT INTO CHINT_CHECK_TITLE (CHECKNO,CODE, MODELVERSION, NAME, DRAWINGNO,SPEC,WORKING,VERSION , CREATEDATE , OWNINGUSER , MODEDATE , NUMBEROFCHECKS , DATASTATUS , DESIGNDATE , PROOFREADDATE , AUDITDATE , PROOFREADISSUE , AUDITISSUE , DESIGNISSUE,drawingversion) SELECT CHECKNO, CODE, MODELVERSION, NAME, DRAWINGNO, SPEC, WORKING, VERSION, CREATEDATE, OWNINGUSER, MODEDATE, %s, '��������', '', '', '', PROOFREADISSUE, AUDITISSUE, DESIGNISSUE,drawingversion FROM CHINT_CHECK_TITLE WHERE CHECKNO = '%s' and NUMBEROFCHECKS = %s ";
+				char selectRecord2[600];
+				sprintf(selectRecord2, title.c_str(), newCnt.c_str(), code.c_str(),cnt.c_str());
+				printf("selectRecord2 ===> %s\n", selectRecord2);
+				ExecuteSQLNoInputParam(selectRecord2);
+				ExecuteSQLNoInputParam("commit");
+				string details = "INSERT INTO CHINT_CHECK_DETAILS (CHECKNO,CODE,MODELVERSION , NUMBEROFCHECKS , NO , IMCHECKPROJECT , IPCHECKDETIALS , DESIGNRESULT , DESIGNRESULTRULE , PROOFREADRESULT , PROOFREADRESULTRULE 	, ISSTRONGCHECK , DESIGN , DESIGNDATE , PROOFREAD , PROOFREADDATE , \"AUDIT\", AUDITDATE) 	SELECT CHECKNO, CODE, MODELVERSION,%s, NO, IMCHECKPROJECT , IPCHECKDETIALS, DESIGNRESULT, DESIGNRESULTRULE , PROOFREADRESULT, PROOFREADRESULTRULE, ISSTRONGCHECK , DESIGN, DESIGNDATE, PROOFREAD, PROOFREADDATE, \"AUDIT\", AUDITDATE FROM CHINT_CHECK_DETAILS WHERE CHECKNO = '%s' and NUMBEROFCHECKS = %s ";
+				char selectRecord3[600];
+				sprintf(selectRecord3, details.c_str(), newCnt.c_str(), code.c_str(), cnt.c_str());
+				printf("selectRecord3 ===> %s\n", selectRecord3);
+				ExecuteSQLNoInputParam(selectRecord3);
+				ExecuteSQLNoInputParam("commit");
+			}
+		}
+	}
+	DisConnServer();
+	return ifail;
+}
+int chint_add_to_workflow(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG;
+
+	current_task = msg.task;
+	ECHO("=========================================================\n");
+	ECHO("chint_add_to_workflow ��ʼִ��\n");
+	ECHO("=========================================================\n");
+
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	map<string, tag_t> itemMap;
+	map<string, string> uidMap;
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		char *uid;
+		tag_t taskTag = taskAttches[count];
+		ITK__convert_tag_to_uid(taskTag, &uid);
+		uidMap[uid] = "1";
+	}
+	
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		//ITKCALL(TCTYPE_ask_object_type(taskAttches[count], &type_tag));
+		char *type;
+		tag_t taskTag = taskAttches[count];
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		if (strcmp(type, "Part Revision") == 0) {
+			tag_t itemTag;
+			char *itemId;
+			AOM_ask_value_string(taskTag, "item_id", &itemId);
+			ITEM_ask_item_of_rev(taskTag, &itemTag);
+			itemMap[itemId] = itemTag;
+			break;
+		}
+		else if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+			tag_t* comps;
+			int cnt;
+			AOM_ask_value_tags(taskTag, "representation_for", &cnt, &comps);
+			for (int i = 0; i < cnt; i++) {
+				tag_t comp = comps[i];
+				char *partType,*zt2_ifpbom;
+				AOM_ask_value_string(comp, "object_type", &partType);
+				AOM_ask_value_string(comp, "zt2_ifpbom", &zt2_ifpbom);
+				if (strcmp(partType, "Part Revision") == 0 && strcmp(zt2_ifpbom,"P")!=0) {
+					char *itemId;
+					tag_t itemTag;
+					AOM_ask_value_string(comp, "item_id", &itemId);
+					ITEM_ask_item_of_rev(comp, &itemTag);
+					if (itemMap.count(itemId) == 0) {
+						itemMap[itemId] = itemTag;
+					}
+				}
+			}
+		}
+	}
+	map<string, tag_t>::iterator it;
+	//����ģ��ƥ��
+	for (it = itemMap.begin(); it != itemMap.end(); it++) {
+		string s = it->first;
+		tag_t part = itemMap[s];
+
+		//����BOM��ȡ����ҪͶ�ϵ�
+		tag_t* bvr_list = NULL, ebom_window, bom_line, partRev;
+		int bvr_count;
+		ITEM_ask_latest_rev(part, &partRev);
+		ITKCALL(ITEM_rev_list_bom_view_revs(partRev, &bvr_count, &bvr_list));
+		ITKCALL(BOM_create_window(&ebom_window));
+		ITKCALL(BOM_set_window_top_line(ebom_window, NULL, partRev, NULLTAG, &bom_line));
+
+		addToFlow(bom_line,root_task, uidMap);
+
+		ITKCALL(BOM_close_window(ebom_window));
+	}
+	return ifail;
+}
+
+int chint_remove_other_deisgndata(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0, occur_of_counts2 = 0;
+	tag_t* taskAttches = NULLTAG, *taskAttches2 = NULLTAG;
+	tag_t cur_task = NULLTAG, owning_user;
+
+	current_task = msg.task;
+	ECHO("=========================================================\n");
+	ECHO("chint_remove_other_deisgndata ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+
+	EPM_ask_attachments(root_task, EPM_reference_attachment, &occur_of_counts2, &taskAttches2);
+	AOM_ask_value_tag(root_task, "owning_user", &owning_user);
+	char *userId;
+	AOM_ask_value_string(owning_user,"user_id",&userId);
+	for (int count = 0; count < occur_of_counts2; count++)
+	{
+		//ITKCALL(TCTYPE_ask_object_type(taskAttches[count], &type_tag));
+		char *type, *tagId;
+		tag_t taskTag = taskAttches2[count], tagUser;
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		printf("type===>%s\n", type);
+		AOM_ask_value_tag(taskTag, "owning_user", &tagUser);
+		AOM_ask_value_string(tagUser, "user_id", &tagId);
+		if (strcmp(tagId, userId) != 0) {
+			ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+			/*if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+				ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+			}
+			else if (strcmp(type, "BOMView Revision") == 0) {
+				ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+			}*/
+		}
+	}
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		//ITKCALL(TCTYPE_ask_object_type(taskAttches[count], &type_tag));
+		char *type,*tagId;
+		tag_t taskTag = taskAttches[count],tagUser;
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		printf("type===>%s\n", type);
+		AOM_ask_value_tag(taskTag, "owning_user", &tagUser);
+		AOM_ask_value_string(tagUser, "user_id", &tagId);
+		if (strcmp(tagId, userId)!=0) {
+			ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+			/*if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+				ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+			}
+			else if (strcmp(type, "BOMView Revision") == 0) {
+				ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+			}*/
+		}
+	}
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/chint_check_exist_ebom.cpp b/General/General/chint_check_exist_ebom.cpp
new file mode 100644
index 0000000..e80c26f
--- /dev/null
+++ b/General/General/chint_check_exist_ebom.cpp
@@ -0,0 +1,110 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+
+int chint_check_exist_ebom(EPM_action_message_t msg) {
+
+	int ifail = ITK_ok;
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0, occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	tag_t cur_task = NULLTAG, owning_user;
+
+	current_task = msg.task;
+	ECHO("=========================================================\n");
+	ECHO("chint_check_exist_ebom ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	AOM_ask_value_tag(root_task, "owning_user", &owning_user);
+	char *userId;
+	AOM_ask_value_string(owning_user, "user_id", &userId);
+	string return_data;
+	return_data.append("\n����ͼֽû��EBOM,��ת��EBOM֮��ִ��:\n");
+	for (int count = 0; count < occur_of_counts; count++)
+	{
+		//ITKCALL(TCTYPE_ask_object_type(taskAttches[count], &type_tag));
+		char *type,*idItem;
+		tag_t taskTag = taskAttches[count];
+		AOM_ask_value_string(taskTag, "object_type", &type);
+		
+		printf("type===>%s\n", type);
+		//ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+		if (strcmp(type, "ZT2_Design3DRevision") == 0) {
+			AOM_ask_value_string(taskTag, "item_id", &idItem);
+			printf("v===%s\n", idItem);
+			if (strstr(idItem, "1ZD") != NULL) {
+				char *source;
+				AOM_ask_value_string(taskTag, "zt2_Source", &source);
+				printf("source===%s\n", source);
+				if (strcmp(source, "S1") == 0 || strcmp(source, "����") == 0) {
+					tag_t* mantrs;
+					int num = 0;
+					ITKCALL(AOM_ask_value_tags(taskTag, "representation_for", &num, &mantrs));
+					for (int n = 0; n < num;n++) {
+						tag_t mantr = mantrs[n],*structure_revisions;
+						int revNum = 0;
+						char *zt2_ifpbom;
+						AOM_ask_value_string(mantr, "zt2_ifpbom", &zt2_ifpbom);
+						printf("zt2_ifpbom===%s\n", zt2_ifpbom);
+						if (strcmp(zt2_ifpbom,"P") == 0) {
+							continue;
+						}
+						AOM_ask_value_tags(mantr, "structure_revisions", &revNum, &structure_revisions);
+						printf("revNum===%d\n", revNum);
+						if (revNum == 0) {
+							char *objName;
+							AOM_ask_value_string(taskTag, "object_name", &objName);
+							ifail = 1;
+							return_data.append(idItem).append("/").append(objName).append(".\n");
+						}
+					}
+				}
+			}
+			//ITKCALL(EPM_remove_attachments(root_task, 1, &taskTag));
+		}
+	}
+	if (ifail==1) {
+		EMH_store_error_s1(EMH_severity_user_error, EMH_USER_error_base, return_data.c_str());
+	}
+	return ifail;
+}
+
diff --git a/General/General/chint_set_prop.cpp b/General/General/chint_set_prop.cpp
new file mode 100644
index 0000000..a624b38
--- /dev/null
+++ b/General/General/chint_set_prop.cpp
@@ -0,0 +1,66 @@
+#include "tc_util.h"
+#include "chint_Handler.h"
+// #include <easylogging++.h>
+// #include "util.h"
+
+
+int chint_set_prop_1(EPM_action_message_t msg)
+{
+	// LINFO << "  chint_set_prop    begin";
+	tag_t root_task, *att, *ref;
+	TC_argument_list_t * arguments = msg.arguments;
+	int arg_cnt = TC_number_of_arguments(arguments);
+
+	map<string, string> val_map1;
+	map<string, string> val_map2;
+	int n_cnt, n_ref;
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &n_cnt, &att);
+	//AOM_ask_value_tags(root_task,"root_reference_attachments",&n_ref,&ref);
+	EPM_ask_attachments(root_task, EPM_reference_attachment, &n_ref, &ref);
+	map<string, map<string, string> > prop_map;
+	for (auto i = 0; i < arg_cnt; i++)
+	{
+		int index_key1;
+		char *temp_key, *temp_val;
+		ITKCALL(ITK_ask_argument_named_value(TC_next_argument(arguments), &temp_key, &temp_val));
+		printf("key:%s | value:%s\r\n",temp_key,temp_val);
+		string temp_k(temp_key);
+		string temp_v(temp_val);
+		index_key1 = temp_k.find('.');
+		if (index_key1 == -1)
+			continue;
+		string type = temp_k.substr(0,index_key1);
+		string prop = temp_k.substr(index_key1+1);
+		printf("����:%s ������:%s ����ֵ:%s\r\n", type, prop, temp_v);
+		prop_map[type][prop] = temp_v;
+
+	}
+	POM_AM__set_application_bypass(true);
+	for (auto i = 0; i < n_cnt; i++)
+	{
+		for (auto it = prop_map.begin(); it != prop_map.end(); it++)
+		{
+			string type = it->first;
+			// item_ask_type
+
+			if (isTypeOf(att[i], type.c_str()))
+			{
+				map<string, string> prop_vals = it->second;
+				ITKCALL(AOM_lock(att[i]));
+				for (auto it2 = prop_vals.begin(); it2 != prop_vals.end(); it2++)
+				{
+					ITKCALL(AOM_set_value_string(att[i], it2->first.c_str(), it2->second.c_str()));
+				}
+				ITKCALL(AOM_save(att[i]));
+				ITKCALL(AOM_unlock(att[i]));
+				break;
+			}
+		}
+	}
+	POM_AM__set_application_bypass(false);
+	// LINFO << "  chint_set_prop    end";
+
+	return 0;
+}
+
diff --git a/General/General/chint_signoff_dataset.cpp b/General/General/chint_signoff_dataset.cpp
new file mode 100644
index 0000000..8d6f535
--- /dev/null
+++ b/General/General/chint_signoff_dataset.cpp
@@ -0,0 +1,666 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include "ae/dataset.h"
+#include <stdlib.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+#include "chint_Handler.h"
+#include "string_utils.h"
+using namespace std;
+typedef struct 
+{
+	string name;
+	string value;
+}CAD_ATTR_STRUCT;
+int signoff_msexcel(tag_t dataset, char *dat_file, char *ext)
+{
+	tag_t spec_dataset_rev = NULLTAG,
+		ref_object = NULLTAG;
+
+	AE_reference_type_t reference_type;
+
+	AE_ask_dataset_latest_rev(dataset, &spec_dataset_rev);
+
+	char ref_name[WSO_name_size_c + 1] = "excel";
+	AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+	if(reference_type == AE_PART_OF)
+	{
+		char pathname[SS_MAXPATHLEN] = "";
+		IMF_ask_file_pathname(ref_object, SS_WNT_MACHINE, pathname);
+		char origin_file_name[IMF_filename_size_c + 1] = "";
+		IMF_ask_original_file_name(ref_object, origin_file_name);
+
+		char new_ds_name[WSO_name_size_c + 1] = "";
+		char *new_file_name = USER_new_file_name(new_ds_name, ref_name, ext, 0);
+		char *temp_dir = getenv("temp");
+		temp_dir="D:\\TEMP";
+		char temp_file[SS_MAXPATHLEN] = "";
+		strcpy(temp_file, temp_dir);
+		strcat(temp_file, "\\");
+		strcat(temp_file, new_file_name);
+
+		IMF_export_file(ref_object, temp_file);
+
+
+		int   iCnt;
+		char *user_lib_env,pTempStr[500];
+		char local_path[MAX_PATH] = "";
+		char cmd[256] = "";
+		/*user_lib_env = getenv("TC_USER_LIB"); 
+		strcpy(local_path, user_lib_env);
+
+		iCnt = strlen(user_lib_env);
+		while( user_lib_env[iCnt] != '\\' )
+		{
+			iCnt--;
+		}
+		strcpy(pTempStr,"");
+		strcpy(pTempStr,&user_lib_env[iCnt+1]);
+
+		if( strcmp(pTempStr,"SubstMacros-MSExcel.wsf") != 0 )
+		{
+			strcat( user_lib_env, "\\SubstMacros-MSExcel.wsf" ); 
+		}*/
+		//strcpy( cmd, user_lib_env );
+		strcpy( cmd, "SubstMacros-MSExcel.wsf" );
+		strcat( cmd, " \"" ); 
+		strcat( cmd, temp_file ); 
+		strcat( cmd, "\" \"" );
+		strcat( cmd, dat_file ); 
+		strcat( cmd, "\"" );
+		printf( "\n%s\n",cmd );
+		system( cmd );
+
+		//strcpy(user_lib_env, local_path);
+
+
+		tag_t new_file_tag = NULLTAG;
+		IMF_file_t file_descriptor;	
+		IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+		IMF_set_original_file_name(new_file_tag, origin_file_name);
+		IMF_close_file(file_descriptor);
+		AOM_save(new_file_tag);
+		AOM_unlock(new_file_tag);
+
+		AOM_lock(spec_dataset_rev);
+		//CALL(AOM_load (dataset));
+		//CALL(AOM_load(spec_dataset_rev));
+		AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object);
+		AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+		AOM_save(spec_dataset_rev);
+		AOM_unlock(spec_dataset_rev);
+	}
+
+	return ITK_ok;
+}
+int create_signinfo_file(char *file_content,char *item_id, char **file_name)
+{
+	time_t now;
+	struct tm *p;
+	FILE *filePtr = NULL;
+
+	char *temp_dir = getenv("TEMP");
+	char local_path[MAX_PATH] = "";
+
+	time(&now);
+	p = localtime(&now);
+	if(temp_dir[strlen(temp_dir) - 1] == '\\')
+	{
+		sprintf_s(local_path, "%s%s-%d-%d-%d-%d-%d-%d.dat", temp_dir,item_id,
+			1900+p->tm_year,p->tm_mon+1 ,p->tm_mday+1 ,p->tm_hour,p->tm_min ,p->tm_sec);
+	}
+	else
+	{
+		sprintf_s(local_path, "%s\\%s-%d-%d-%d-%d-%d-%d.dat", temp_dir,item_id,
+			1900+p->tm_year,p->tm_mon+1 ,p->tm_mday+1 ,p->tm_hour,p->tm_min ,p->tm_sec);
+	}
+
+	if((filePtr = fopen(local_path, "wt")) == NULL)
+	{
+		printf("Can not create the temp dat file!\n");
+		return -1;
+	}
+	*file_name = (char *)MEM_alloc(sizeof(char)*512);
+	strcpy((*file_name), local_path);
+
+	fwrite(file_content, sizeof(char), strlen(file_content), filePtr);
+	fclose(filePtr);
+
+	return ITK_ok;
+}
+int signoff_msword(tag_t dataset, char *dat_file,char *ext)
+{
+	tag_t spec_dataset_rev = NULLTAG , ref_object = NULLTAG;
+	AE_reference_type_t reference_type;
+	//printf("\n111111111111\n");
+	AE_ask_dataset_latest_rev(dataset, &spec_dataset_rev);
+
+	char ref_name[WSO_name_size_c + 1] = "word";
+	//printf("\n22222222222\n");
+	AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+	if(reference_type == AE_PART_OF)
+	{
+		//printf("\n3333333333333\n");
+		char pathname[SS_MAXPATHLEN] = "";
+		IMF_ask_file_pathname(ref_object, SS_WNT_MACHINE, pathname);
+		char origin_file_name[IMF_filename_size_c + 1] = "";
+		IMF_ask_original_file_name(ref_object, origin_file_name);
+		//printf("\n44444444444444\n");
+		char new_ds_name[WSO_name_size_c + 1] = "";
+		char *new_file_name = USER_new_file_name(new_ds_name, ref_name, ext, 0);
+		char *temp_dir = getenv("temp");
+		temp_dir="D:\\TEMP";
+		//printf("\n555555555555\n");
+		char temp_file[SS_MAXPATHLEN] = "";
+		strcpy(temp_file, temp_dir);
+		strcat(temp_file, "\\");
+		strcat(temp_file, new_file_name);
+
+		IMF_export_file(ref_object, temp_file);
+		//printf("\n66666666666666\n");
+
+		int   iCnt;
+		char *user_lib_env,pTempStr[500];
+		char local_path[MAX_PATH] = "";
+		char cmd[256] = "";
+		//user_lib_env = getenv("TC_USER_LIB"); 
+		//strcpy(local_path, user_lib_env);
+
+		//iCnt = strlen(user_lib_env);
+		//while( user_lib_env[iCnt] != '\\' )
+		//{
+		//	iCnt--;
+		//}
+
+		//strcpy(pTempStr,"");
+		//strcpy(pTempStr,&user_lib_env[iCnt+1]);
+
+		//if( strcmp(pTempStr,"SubstMacros-MSWord.wsf") != 0 )
+		//{
+		//	strcat( user_lib_env, "\\SubstMacros-MSWord.wsf" ); 
+		//}
+
+		//strcpy( cmd, user_lib_env );
+		strcpy( cmd, "SubstMacros-MSWord.wsf" );
+		strcat( cmd, " \"" ); 
+		strcat( cmd, temp_file ); 
+		strcat( cmd, "\" \"" );
+		strcat( cmd, dat_file ); 
+		strcat( cmd, "\"" );
+		printf( "\n%s\n",cmd );
+		system( cmd );
+//printf("\n777777777777\n");
+		//strcpy(user_lib_env, local_path);
+
+
+		tag_t new_file_tag = NULLTAG;
+		IMF_file_t file_descriptor;	
+		IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+		IMF_set_original_file_name(new_file_tag, origin_file_name);
+		IMF_close_file(file_descriptor);
+		AOM_save(new_file_tag);
+		AOM_unlock(new_file_tag);
+
+		AOM_lock(spec_dataset_rev);
+		
+		AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object);
+		
+		AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+		AOM_save(spec_dataset_rev);
+		AOM_unlock(spec_dataset_rev);
+	}
+	return ITK_ok;
+}
+int chint_signoff_dataset( EPM_action_message_t msg )
+{
+	int ifail = ITK_ok, rcode = 0;
+	//�������
+	char arg1value[1024] = "",arg2value[1024] = "",arg3value[1024]="",arg4value[1024]="",
+		signcounter_info[1024] = "", *value = NULL;
+	char *argflag =NULL,*argvalue=NULL ,*arg = NULL;
+	BOOL bypass = FALSE;
+	int arg_cnt = 0;
+	//���̽ڵ����
+	tag_t root_task = NULLTAG,*sub_tasks = NULL,current_task = NULLTAG,type_tag = NULLTAG;
+	int sub_task_count = 0;
+	char root_task_name[128]="",task_name[128] = "";
+	int occur_of_counts = 0;
+	tag_t *taskAttches = NULLTAG;
+	char tgt_type[WSO_name_size_c+1]="",type_class[TCTYPE_class_name_size_c+1]="";
+	////ѭ���ڲ�����
+	tag_t cur_task = NULLTAG;
+	char task_type[WSO_name_size_c+1] = "";
+	//ѭ������
+	int i=0, j=0, k=0, count = 0, n = 0;
+	//�ڵ���Ϣ����
+	char sign_info[2048]="";
+	//�ڵ�ѭ����������
+	tag_t itemrevision = NULLTAG,master_form_rel_type = NULLTAG;
+	// char rev_id[ITEM_id_size_c+1]="";
+	// char item_id[ITEM_id_size_c+1]="";
+	char * uid=NULL;
+	int form_count = 0;
+	tag_t *form_list = NULL,master_form = NULLTAG;
+	char local_path[128]="";
+	//���ƽڵ�
+	int s=0;
+	char *timeinfo2="";
+	EPM_decision_t decision = EPM_nogo;
+	tag_t aUserTag,responsibleParty;
+	char *userName;
+	date_t decision_date;
+	char person_name[SA_name_size_c + 1] = "";
+	char *prop_name="last_mod_date";
+	//��ǩ���
+	int n_prop=0, q = 0;
+	char **prop_names=NULL, hq_name[128] = "", hq_time_name[128] = "", *hq_value=NULL;
+	char exclude_type[256]="", item_type[ITEM_type_size_c+ 1]= "";
+	tag_t item = NULLTAG;
+	logical is_sign = false;
+
+	map<string,CAD_ATTR_STRUCT> sign_map;
+	vector<string> prop_vec;
+	current_task = msg.task;
+	//CreateLogFile("PLA8_signoff",&txtfile);
+	ECHO("=========================================================\n");
+	ECHO("chint_signoff_dataset ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	vector<string> pref_vec;
+	getPrefStrings1("Chint_Object_Type",TC_preference_site, pref_vec);
+	
+	arg_cnt = TC_number_of_arguments(msg.arguments);
+	ECHO("����������%d\n",arg_cnt);
+	POM_AM__set_application_bypass(true);
+	if (arg_cnt > 0)
+	{
+		for (i=0;i<arg_cnt;i++)
+		{
+			arg = TC_next_argument(msg.arguments);
+			ifail = ITK_ask_argument_named_value((const char*)arg, &argflag, &argvalue);
+			if (stricmp(argflag, "SignName") == 0)
+			{
+				if(argvalue != NULL)
+				{
+					//strcpy(arg1value,argvalue);
+					vector<string> ans,ans1;
+					Split(argvalue,";",ans);
+					for( j = 0; j <ans.size(); j++ )
+					{
+						CAD_ATTR_STRUCT	one_elem;
+						Split(ans[j],"=",ans1);
+						if( ans1.size() > 1 )
+						{
+							one_elem.name = ans1[1];
+							sign_map.insert(pair<string,CAD_ATTR_STRUCT>(ans1[0],one_elem));
+						}
+					}
+				}
+			}
+			else if(stricmp(argflag,"bypass") == 0)
+			{
+				bypass = TRUE;
+			}
+			
+			//else if(stricmp(argflag,"exclude_type") == 0)
+			//{
+			//	if(argvalue != NULL)
+			//	{
+			//		strcpy(exclude_type,argvalue);
+			//	}
+			//} 
+
+		}
+		MEM_free(argflag);
+		MEM_free(argvalue);
+	}
+
+	//��ȡ����
+	 EPM_ask_root_task( msg.task, &root_task );
+	 EPM_ask_sub_tasks( root_task, &sub_task_count, &sub_tasks); 
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	ECHO("%d target attachment found",occur_of_counts);
+		
+	for( count=0; count<occur_of_counts; count++ )
+	{
+		ECHO("the %dth work",count);
+		TCTYPE_ask_object_type(taskAttches[count], &type_tag);
+		ifail = TCTYPE_ask_class_name(type_tag, type_class);
+		ECHO("type_class : %s",type_class);
+		logical  okSign=false;
+		for(int i = 0 ;i < pref_vec.size();i++){
+			if(strcmp(pref_vec[i].c_str(),type_class)==0)
+			{
+				okSign=true;
+				break;
+			}
+
+		}
+		if(okSign==true)
+		{
+		
+			itemrevision = taskAttches[count];
+			
+			ITK__convert_tag_to_uid(itemrevision,&uid);
+			
+			master_form = itemrevision;// form_list[0]; 
+			map<string,CAD_ATTR_STRUCT>::iterator it;
+			for( it = sign_map.begin(); it != sign_map.end(); it ++ )
+			{
+				CAD_ATTR_STRUCT one_elem;
+				AOM_ask_value_string( master_form, it->first.c_str(), &value);
+				one_elem.name = it->second.name;
+				one_elem.value.assign(value);
+				it->second = one_elem;
+			}
+			DOFREE(form_list);
+			//��form����д���ı��ļ�
+			string info;
+			map<string,CAD_ATTR_STRUCT>::iterator buf_it;
+			for( it = sign_map.begin(); it != sign_map.end(); it ++ )
+			{
+				info.append(it->second.name);
+				info.append("=");
+				info.append(it->second.value);
+				info.append("|");
+			}
+			ECHO("\n info: %s",info.c_str());
+			char *data_file = NULL;
+			create_signinfo_file((char*)info.c_str(),uid, &data_file);
+			if( data_file == NULL )
+			{
+
+				continue;
+			}
+			ECHO("\n �����ı��ļ�%s\n",data_file);
+			//������ݼ�
+			tag_t relation_type=NULLTAG;
+			//tag_t attach_relation_type = NULLTAG;
+			GRM_find_relation_type(TC_specification_rtype, &relation_type);
+			tag_t *secondary_objects=NULLTAG;
+			int ds_count = 0;
+			char *dataset_type = NULL, *desc_value=NULL,*file_path = NULL,*desc_path;
+			
+			GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects);
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��1\n");
+				AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+				int des_count=0;
+				tag_t *dess=NULL;
+				char  *name;
+				if(!(strcmp(dataset_type, "JK8_AutoCAD") == 0||
+					strcmp(dataset_type, "MSWord") ==0||
+					strcmp(dataset_type, "MSWordX") ==0||
+					strcmp(dataset_type, "MSExcel") ==0||
+					strcmp(dataset_type, "MSExcelX") ==0||
+					strcmp(dataset_type, "PDF") ==0)){
+						if(dataset_type!=NULL){
+							MEM_free(dataset_type);
+							dataset_type =NULL;
+						}
+				
+					continue;
+				}
+
+
+
+
+				AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count,&dess);
+				if(des_count<1){
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				
+				printf("��ʼ�ж�����\n");
+				if(strcmp(dataset_type, "JK8_AutoCAD") == 0) 
+				{
+					printf("cad����\n");
+				//	ECHO("����dwg...\n");
+				//	POM_AM__set_application_bypass(true);
+				//	ifail = export_dataset_file(dataset_list[j], "PDF_Reference", "dwg", &filename,&original_name);
+					// if( data_file != NULL )
+					// signoff_acad(secondary_objects[j],data_file);
+				}
+				else if(strcmp(dataset_type, "MSWord") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"doc");
+				}
+				else if(strcmp(dataset_type, "MSWordX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					/*if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}*/
+					signoff_msword(secondary_objects[j],data_file,"docx");
+				}
+				else if(strcmp(dataset_type, "MSExcel") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xls");
+				}
+				else if(strcmp(dataset_type, "MSExcelX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					/*if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}*/
+					signoff_msexcel(secondary_objects[j],data_file,"xlsx");
+				}else if(strcmp(dataset_type, "PDF") ==0){
+					// signoff_pdf(secondary_objects[j],data_file,"pdf");
+				}
+				MEM_free(dataset_type);
+
+			}
+			DOFREE(secondary_objects);
+
+			GRM_find_relation_type(TC_attaches_rtype, &relation_type);//�ĵ��ڰ汾��
+
+			GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects);
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��2\n");
+				AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+				int des_count=0;
+				tag_t *dess=NULL;
+				char  *name;
+
+				if(!(strcmp(dataset_type, "JK8_AutoCAD") == 0||
+					strcmp(dataset_type, "MSWord") ==0||
+					strcmp(dataset_type, "MSWordX") ==0||
+					strcmp(dataset_type, "MSExcel") ==0||
+					strcmp(dataset_type, "MSExcelX") ==0||
+					strcmp(dataset_type, "PDF") ==0)){
+						if(dataset_type!=NULL){
+							MEM_free(dataset_type);
+							dataset_type =NULL;
+						}
+				
+					continue;
+				}
+				AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count,&dess);
+				if(des_count<1){
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				
+				if(strcmp(dataset_type, "JK8_AutoCAD") == 0) 
+				{
+				//	ECHO("����dwg...\n");
+				//	POM_AM__set_application_bypass(true);
+				//	ifail = export_dataset_file(dataset_list[j], "PDF_Reference", "dwg", &filename,&original_name);
+					// if( data_file != NULL )
+					// signoff_acad(secondary_objects[j],data_file);
+				}
+				else if(strcmp(dataset_type, "MSWord") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"doc");
+				}
+				else if(strcmp(dataset_type, "MSWordX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docm") != NULL)||(strstr(name,"xlsm") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"docx");
+				}
+				else if(strcmp(dataset_type, "MSExcel") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xls");
+				}
+				else if(strcmp(dataset_type, "MSExcelX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docm") != NULL)||(strstr(name,"xlsm") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xlsx");
+				}else if(strcmp(dataset_type, "PDF") ==0){
+					// signoff_pdf(secondary_objects[j],data_file,"pdf");
+				}
+				MEM_free(dataset_type);
+			}
+
+			DOFREE(secondary_objects);
+
+			GRM_find_relation_type("IMAN_reference", &relation_type);//�ĵ��ڶ�����
+
+			GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects);
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��3\n");
+				AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+				int des_count=0;
+				tag_t *dess=NULL;
+				char  *name;
+
+				if(!(strcmp(dataset_type, "JK8_AutoCAD") == 0||
+					strcmp(dataset_type, "MSWord") ==0||
+					strcmp(dataset_type, "MSWordX") ==0||
+					strcmp(dataset_type, "MSExcel") ==0||
+					strcmp(dataset_type, "MSExcelX") ==0||
+					strcmp(dataset_type, "PDF") ==0)){
+						if(dataset_type!=NULL){
+							MEM_free(dataset_type);
+							dataset_type =NULL;
+						}
+				
+					continue;
+				}
+				AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count,&dess);
+				if(des_count<1){
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				if(strcmp(dataset_type, "MSWord") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"doc");
+				}
+				else if(strcmp(dataset_type, "MSWordX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docm") != NULL)||(strstr(name,"xlsm") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"docx");
+				}
+				else if(strcmp(dataset_type, "MSExcel") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xls");
+				}
+				else if(strcmp(dataset_type, "MSExcelX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docm") != NULL)||(strstr(name,"xlsm") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xlsx");
+				}else if(strcmp(dataset_type, "PDF") ==0){
+					// signoff_pdf(secondary_objects[j],data_file,"pdf");
+				}
+				MEM_free(dataset_type);
+			}
+			DOFREE(secondary_objects);
+			DOFREE(uid);
+
+		}
+	}
+	POM_AM__set_application_bypass(false);
+	DOFREE(taskAttches);
+	ECHO("=========================================================\n");
+	ECHO("chint_signoff_dataset ִ�н���\n");
+	ECHO("=========================================================\n");
+	return rcode;
+}
diff --git a/General/General/common_itk_util.c b/General/General/common_itk_util.c
new file mode 100644
index 0000000..5e5b334
--- /dev/null
+++ b/General/General/common_itk_util.c
@@ -0,0 +1,289 @@
+/**
+* @file common_itk_util.cpp
+* @brief itk warpper utility function 
+* @author James
+* @history
+* ===================================================================================
+* Date             Name                   Description of Change
+* 18-July-2008     James                  
+*/
+
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+
+#include <epm/epm.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <ict/ict_userservice.h>
+#include <tccore/item.h>
+#include <ae/ae.h>
+#include <tc/folder.h>
+#include <tccore/aom.h>
+#include <sa/sa.h>
+#include <tccore/aom_prop.h>
+#include <property/prop_errors.h>
+#include <tccore/workspaceobject.h>
+#include <tc/preferences.h>
+#include <tccore/imantype.h>
+#include <tccore//grm.h>
+#include <tccore/grmtype.h>
+#include <sa/am.h>
+#include <cfm/cfm.h>
+#include <bom/bom.h>
+#include <tccore/uom.h>
+#include <ps/ps.h>
+#include <epm/signoff.h>
+#include <fclasses/tc_date.h>
+//#include <tccore/imantype.h>
+//#include <textsrv/textserver.h>
+//#include <user_exits/epm_toolkit_utils.h>
+//#include <ss/ss_errors.h>
+
+#include <stdlib.h>
+//#include <io.h>
+#include <stdio.h>
+#include <time.h>
+//#include <direct.h>
+//#include <unistd.h>
+#include "error_handling.h"
+#include "common_itk_util.h"
+
+#ifdef WIN32
+#include <io.h>
+#include <direct.h>
+#else
+#include <unistd.h>
+#endif
+
+
+#define ARGS_LENGTH 200
+#define ARGS_NAME_DEBUG "-debug"
+#define DEBUG "-debug="
+#define MAX_PRINTLINE_LENGTH 2000
+#define MAX_PATH_LENGTH 2000
+#define MAX_ARGUMENT_LENGTH 400
+#define MAX_PARAMNAME_LENGTH 50
+#define MAX_FILE_EXT_LENGTH 10
+#define TRUE_FLAG 1
+#define FALSE_FLAG 0
+#define DETAILLOG 1
+
+
+void ECHO(char *format, ...)
+{
+    //if( !YFJC_OPT_DEBUG )
+    //    return; 
+
+    char msg[4000];
+    va_list args;
+
+    va_start( args, format );
+    vsprintf( msg, format, args );
+    va_end( args );
+
+    printf( msg );
+    TC_write_syslog( msg );
+}
+
+FILE* logFile = NULL;
+
+void set_bypass(logical bypass)
+{
+	AM__set_application_bypass(bypass);
+}
+/*=============================================================================*
+ * FUNCTION: current_time
+ * PURPOSE : get the current datetime
+ * INPUT: 
+ *     date_t* date_tag  	// current date time tag
+ *
+ * RETURN: 
+ *     void
+ *============================================================================*/
+void current_time( date_t * date_tag )
+{
+	time_t ltime;
+	struct tm *today ;
+
+	// Set time zone from TZ environment variable. If TZ is not set,
+	// the operating system is queried to obtain the default value 
+	// for the variable. 
+	//
+	//_tzset();
+	
+	// Get UNIX-style time and display as number and string.
+	time( &ltime );
+	
+	today = localtime( &ltime );
+	date_tag->year = today->tm_year + 1900 ;
+	date_tag->month = today->tm_mon ;
+	date_tag->day = today->tm_mday ;
+	date_tag->hour = today->tm_hour ;
+	date_tag->minute = today->tm_min ;
+	date_tag->second = today->tm_sec ;
+}
+/*=============================================================================*
+ * FUNCTION: CreateLogFile
+ * PURPOSE : create log file
+ * INPUT: 
+ *     char* FunctionName  	// the funtion which need to create log file
+ *     FILE** logFile		// out: the log file pointer
+ *	
+ * RETURN: 
+ *     void
+ *============================================================================*/
+void CreateLogFile(char* FunctionName, char **fullname)
+{
+	int i=0, ifail = ITK_ok;
+	//date_t status_now;
+	//char* date_string = NULL;
+	char date_string[MAX_PATH_LENGTH];
+	char logFileDir[MAX_PATH_LENGTH];
+	char logFileName[MAX_PATH_LENGTH];
+
+	char* session_uid = NULL;
+	tag_t session_tag = NULLTAG;
+	time_t now;
+	struct tm *p;
+
+	time(&now);
+
+	logFile = NULL;
+	//current_time(&status_now);
+	p=localtime(&now); 
+
+	memset(date_string, 0, sizeof(date_string));
+	sprintf(date_string,"%4d%02d%02d%02d%02d%02d",1900+p->tm_year,p->tm_mon+1 ,p->tm_mday ,p->tm_hour,p->tm_min ,p->tm_sec );
+	//if( DATE_date_to_string( status_now, "%Y%m%d%H%M%S", &date_string) != ITK_ok )
+	//ifail = ITK_date_to_string (status_now, &date_string );
+	//if (ifail)
+	//{
+	//	printf("!*ERROR*!: Failed to get current date time\n");
+	//	goto CLEANUP;
+	//}
+
+	memset(logFileDir, 0, sizeof(logFileDir));
+	memset(logFileName, 0, sizeof(logFileName));
+	//get log dir
+	sprintf(logFileDir, "%s", getenv("TEMP"));
+	printf("\n log file dir: %s\n", logFileDir);
+	//try to change dir to TC_USER_LOG_DIR
+	if(chdir(logFileDir)!=ITK_ok)
+	{
+		//not set TC_USER_LOG_DIR
+		//log in to default TC_LOG
+		memset(logFileDir, 0, sizeof(logFileDir));
+		sprintf(logFileDir, "%s", getenv("TC_LOG"));
+		printf("\n TC_USER_LOG_DIR invalide, log file dir: %s\n", logFileDir);
+		if(chdir(logFileDir)!=ITK_ok)
+		{
+			//still can not change to log dir
+			printf("!*ERROR*!: Failed to change dir to TC_USER_LOG_DIR\n");
+			goto CLEANUP;
+		}
+	}
+	
+	//get session_uid to make sure the log file name unique
+	POM_ask_session(&session_tag);
+	ITK__convert_tag_to_uid(session_tag, &session_uid);
+	
+
+	//get logFileName
+	sprintf(logFileName, "%s_%s_%s.log", FunctionName, session_uid, date_string);
+	printf("log file name: %s\n", logFileName);
+
+	*fullname = (char *)MEM_alloc(sizeof(char)*512);
+	sprintf(*fullname,"%s\\%s",logFileDir,logFileName);
+
+	//for(i = 0; _access((char *)logFileName, 4) == 0; i++)
+	/*{
+		memset(logFileName, 0, sizeof(logFileName));
+		sprintf(logFileName, "%s_%s_%s_%d.log", FunctionName, session_uid, date_string, i);
+	}
+	printf("final log file name: %s\n", logFileName);*/
+
+	//create log file
+	logFile = fopen(logFileName, "w");	
+
+CLEANUP:
+	//DOFREE(date_string);
+	DOFREE(session_uid);
+}
+
+
+/*=============================================================================*
+ * FUNCTION: WriteLog
+ * PURPOSE : write log, if debug log File not null, write log message to log File
+ * INPUT: 
+ *     const char* format // debug message string
+ *
+ * RETURN: 
+ *     void
+ *============================================================================*/
+void WriteLog(const char* format, ...)
+{
+	va_list arg;
+	char tmp[MAX_PRINTLINE_LENGTH];
+
+	if(logFile)
+	{
+		//get the message
+		memset(tmp, 0, sizeof(tmp));
+		va_start(arg, format);
+		vsprintf(tmp, format, arg);
+		va_end(arg);
+
+		//----------print to command window for trace--------//
+		printf("%s\n", tmp);
+			
+		//print message to log file
+		fprintf(logFile, "%s\n", tmp);
+		fflush(logFile);
+	}
+	else
+	{
+		printf("*!Error!*: Log File Not Exist\n");
+	}
+}
+
+void CloseLog(void)
+{
+	if(logFile)
+	{
+		fclose(logFile);
+		logFile = NULL;
+	}
+}
+
+//void getTypeinfo(char *type)
+//{
+//	int ulen = 0,i=0,tempcount=0,asd=0;
+//
+//	char temp[128]="";
+//	ulen = strlen(type);
+//	asd = ulen-1;
+//	for(i=0;i < ulen;i++)
+//	{
+//		if(type[i] == ';')
+//		{
+//			temp[tempcount] = '\0';
+//			strcpy(excludetypes[typecount].type,temp);
+//			strcpy(temp,"");
+//			tempcount = 0;
+//			typecount = typecount + 1;
+//		}
+//		else
+//		{
+//
+//			temp[tempcount] = type[i];
+//			tempcount = tempcount + 1;
+//			if(i==asd)
+//			{
+//			temp[tempcount] = '\0';
+//			strcpy(excludetypes[typecount].type,temp);
+//			typecount = typecount + 1;
+//			}
+//		
+//		}
+//    
+//	}
+//}
\ No newline at end of file
diff --git a/General/General/common_itk_util.h b/General/General/common_itk_util.h
new file mode 100644
index 0000000..79360ab
--- /dev/null
+++ b/General/General/common_itk_util.h
@@ -0,0 +1,41 @@
+/**
+* @file common_itk_util.h
+* @brief itk warpper utility function 
+* @author James
+* @history
+* ===================================================================================
+* Date             Name                   Description of Change
+* 09-July-2008     James                  
+*/
+
+#ifndef COMMON_ITK_UTIL
+#define COMMON_ITK_UTIL
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define DOFREE(obj)								\
+{												\
+	if(obj)										\
+	{											\
+		MEM_free(obj);							\
+		obj = NULL;								\
+	}											\
+}
+void ECHO(char *format, ...);
+void CreateLogFile(char* FunctionName, char **fullname);
+void WriteLog(const char* format, ...);
+void CloseLog(void);
+//void set_bypass(logical bypass);
+//void current_time( date_t * date_tag );
+//int FindDatasetReferenceExt( tag_t datasettype, const char *datasettype_ref, char ext[10] );
+//int CompareDate( date_t date1, date_t date2 );
+//int GetRandomTempFile( char tempFile[256] );
+//logical IsItemRevisionType( char object_type[WSO_name_size_c + 1] );
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
\ No newline at end of file
diff --git a/General/General/connor_sign_pdf.cpp b/General/General/connor_sign_pdf.cpp
new file mode 100644
index 0000000..834c564
--- /dev/null
+++ b/General/General/connor_sign_pdf.cpp
@@ -0,0 +1,282 @@
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include <codecvt>
+#include "ae/dataset.h"
+#include <iostream>
+#include <stdlib.h>
+#include <tccore/aom.h>
+#include <tc/emh.h>
+#include <ict/ict_userservice.h>
+#include <tc/tc.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+// #include "hx_custom.h"
+#include "tc_log.h"
+// #include "jk_custom.h"
+#include "chint_Handler.h"
+#include "tc_util.h"
+#include <regex>
+#include <ics/ics.h>
+#include "ado.h"
+#include "ocilib.h"
+using namespace std;
+
+//����ǩ��
+int chint_pdf_signoff(EPM_action_message_t msg) {
+	int ifail = ITK_ok;
+
+	//���̽ڵ����
+	tag_t root_task = NULLTAG, *sub_tasks = NULL, current_task = NULLTAG, type_tag = NULLTAG;
+	int sub_task_count = 0;
+	char root_task_name[128] = "", task_name[128] = "";
+	int occur_of_counts = 0;
+	tag_t* taskAttches = NULLTAG;
+	char tgt_type[WSO_name_size_c + 1] = "", *type_class;
+	////ѭ���ڲ�����
+	tag_t cur_task = NULLTAG;
+	//ѭ������
+	int count = 0;
+
+	//�ڵ�ѭ����������
+	tag_t itemrevision = NULLTAG, master_form_rel_type = NULLTAG;
+	int form_count = 0;
+	tag_t* form_list = NULL, master_form = NULLTAG;
+
+	current_task = msg.task;
+	//CreateLogFile("PLA8_signoff",&txtfile);
+	ECHO("=========================================================\n");
+	ECHO("����ǩ�� ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	//�������
+
+	POM_AM__set_application_bypass(true);
+
+	int url_num = 0;
+	char** url_vals = NULL;
+	PREF_ask_char_values("CHINT_SignPic", &url_num, &url_vals);
+	tag_t group;
+	char *groupId;
+	AOM_ask_value_tag(msg.task, "owning_group", &group);
+	AOM_ask_value_string(group,"name", &groupId);
+	printf("groupId==>%s\n", groupId);
+	map<string, tag_t> typeUidMap;
+	for (int i = 0; i < url_num;i++) {
+		vector<string> vec2;
+		Split(url_vals[i], ";", vec2);
+		if (vec2.size() == 3 && vec2[0].compare(groupId)==0) {
+			tag_t tz_target;
+			ITK__convert_uid_to_tag(vec2[2].c_str(), &tz_target);
+			typeUidMap[vec2[1]] = tz_target;
+		}
+	}
+
+	//��ȡ����
+	EPM_ask_root_task(msg.task, &root_task);
+	EPM_ask_sub_tasks(root_task, &sub_task_count, &sub_tasks);
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	ECHO("%d target attachment found", occur_of_counts);
+
+	for (count = 0; count < occur_of_counts; count++)
+	{
+		ITKCALL(TCTYPE_ask_object_type(taskAttches[count], &type_tag));
+		ITKCALL(ifail = TCTYPE_ask_class_name2(type_tag, &type_class));
+
+		//���˵��ǰ汾����
+		if (typeUidMap.count(type_class)>0)
+		{
+			tag_t tz_target = typeUidMap[type_class];
+			char tz_path[512] = "";
+			int target_count = 0;
+			tag_t* target_tags = NULL;
+			char* target_type;
+			ITKCALL(AOM_ask_value_tags(tz_target, "ref_list", &target_count, &target_tags));
+			ITKCALL(AOM_ask_value_string(target_tags[0], "file_ext", &target_type));
+			time_t now;
+			struct tm* p;
+			time(&now);
+			p = localtime(&now);
+
+			sprintf_s(tz_path, "%s\\TZ_[%d-%d-%d-%d-%02d-%02d].%s", getenv("TEMP"), 1900 + p->tm_year, p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec, target_type);
+
+			IMF_export_file(target_tags[0], tz_path);
+
+			itemrevision = taskAttches[count];
+			ITKCALL(GRM_find_relation_type(TC_master_form_rtype, &master_form_rel_type));
+			ITKCALL(GRM_list_secondary_objects_only(itemrevision, master_form_rel_type, &form_count, &form_list));
+			//������ݼ�
+			tag_t relation_type = NULLTAG;
+			//tag_t attach_relation_type = NULLTAG;
+			ITKCALL(GRM_find_relation_type(TC_specification_rtype, &relation_type));
+			tag_t* secondary_objects = NULLTAG;
+			int ds_count = 0;
+			char* dataset_type = NULL, *desc_value = NULL, *file_path = NULL, *desc_path;
+
+			ITKCALL(GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects));
+
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��1\n");
+				ITKCALL(AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type));
+				int des_count = 0;
+				tag_t* dess = NULL;
+
+				printf("dataset_type=%s\n", dataset_type);
+				if (strcmp(dataset_type, "PDF") != 0) {
+					if (dataset_type != NULL) {
+						MEM_free(dataset_type);
+						dataset_type = NULL;
+					}
+
+					continue;
+				}
+				ITKCALL(AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count, &dess));
+				if (des_count < 1) {
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				else {
+					char* sizeFile;
+					AOM_ask_value_string(dess[0], "file_size", &sizeFile);
+					printf("sizeFile %s \n", sizeFile);
+					if (strcmp(sizeFile, "0 bytes") == 0) {
+						printf("�ļ���С��0bytes\n");
+						continue;
+					}
+				}
+				tag_t spec_dataset_rev = NULLTAG,
+					ref_object = NULLTAG;
+				char* ref_object_name = NULL;
+				AE_reference_type_t reference_type;
+				char* datasetName = NULL;
+				char* pathname;
+				char* origin_file_name;
+				vector<string> type_vec;
+				printf("��ʼ�ж�����\n");
+				if (strcmp(dataset_type, "PDF") == 0) {
+					printf("pdf����\n");
+
+					AOM_ask_value_string(secondary_objects[j], "object_name", &datasetName);
+					AE_ask_dataset_latest_rev(secondary_objects[j], &spec_dataset_rev);
+					AOM_ask_value_string(spec_dataset_rev, "object_name", &ref_object_name);
+					printf("ref_object_name=%s\n", ref_object_name);
+					char ref_name[WSO_name_size_c + 1] = "PDF_Reference";
+
+					AE_ask_dataset_named_ref2(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+					if (ref_object == NULLTAG)
+					{
+						printf("\nref_object is NULLTAG\n");
+						return ITK_ok;
+					}
+					printf("reference_type=%d\n", reference_type);
+					if (reference_type == AE_PART_OF)
+					{
+						ITKCALL(IMF_ask_file_pathname2(ref_object, SS_WNT_MACHINE, &pathname));
+						IMF_ask_original_file_name2(ref_object, &origin_file_name);
+						char new_ds_name[WSO_name_size_c + 1] = "";
+						char* new_file_name = USER_new_file_name(new_ds_name, ref_name, "pdf", 0);
+						char* temp_dir = getenv("temp");
+						char temp_file[SS_MAXPATHLEN] = "";
+						char temp_file2[SS_MAXPATHLEN] = "";
+						strcpy(temp_file, temp_dir);
+						strcat(temp_file, "\\");
+						strcat(temp_file, new_file_name);
+						IMF_export_file(ref_object, temp_file);
+						
+						if (strstr(new_file_name, ".pdf") != NULL) {
+							sprintf(temp_file2, "%s\\1%s", temp_dir, new_file_name);
+						}
+						else {
+							sprintf(temp_file2, "%s\\1%s.pdf", temp_dir, new_file_name);
+						}
+						//sprintf(temp_file2, "%s.pdf", temp_file);
+						printf("\ntemp_file=%s\n", temp_file);
+						char cmd[256] = "";
+						char* tc_root_dir = getenv("tc_root");
+						strcpy(cmd, "java -jar ");
+						strcat(cmd, tc_root_dir);
+						strcat(cmd, "\\bin\\CHINT_PDFSignoff.jar");
+						strcat(cmd, " \"");
+						/*strcat(cmd, path);
+						strcat(cmd, "\" \"");*/
+						strcat(cmd, temp_file);
+						strcat(cmd, "\" \"");
+						strcat(cmd, temp_file2);
+						strcat(cmd, "\" \"");
+						strcat(cmd, tz_path);
+						strcat(cmd, "\"");
+						printf("\n%s\n", cmd);
+						system(cmd);
+						/*char txtPath[256] = "";
+						strcpy(txtPath, "DEL /f ");
+						strcat(txtPath, path);
+						system(txtPath);*/
+						tag_t new_file_tag = NULLTAG;
+						IMF_file_t file_descriptor;
+						if (temp_file2 != NULL) {
+							IMF_import_file(temp_file2, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+						}
+						else
+						{
+							IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+						}
+						IMF_set_original_file_name2(new_file_tag, origin_file_name);
+						IMF_close_file(file_descriptor);
+						AOM_save(new_file_tag);
+						AOM_unlock(new_file_tag);
+
+						AOM_lock(spec_dataset_rev);
+
+						AE_remove_dataset_named_ref_by_tag2(spec_dataset_rev, ref_name, ref_object);
+
+						AE_add_dataset_named_ref2(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+						AOM_save(spec_dataset_rev);
+						AOM_unlock(spec_dataset_rev);
+						char tempPath[256] = "";
+						char tempPath2[256] = "";
+						char tempPath3[256] = "";
+						strcpy(tempPath, "DEL /f ");
+						strcat(tempPath, temp_file);
+						system(tempPath);
+						strcpy(tempPath2, "DEL /f ");
+						strcat(tempPath2, temp_file2);
+						system(tempPath2);
+						/*strcpy(tempPath3, "DEL /f ");
+						strcat(tempPath3, tz_path);
+						system(tempPath3);*/
+						//ITKCALL(ifail = import_dataset_file(secondary_objects[j], "T2_DWG", "dwg", temp_file, datasetName));
+					}
+				}
+				MEM_free(dataset_type);
+			}
+			DOFREE(secondary_objects);
+		}
+	}
+
+	POM_AM__set_application_bypass(false);
+	DOFREE(taskAttches);
+	ECHO("=========================================================\n");
+	ECHO("����ǩ�� ����\n");
+	ECHO("=========================================================\n");
+	return ifail;
+}
\ No newline at end of file
diff --git a/General/General/ct_signoff_dataset.cpp b/General/General/ct_signoff_dataset.cpp
new file mode 100644
index 0000000..6fdd4d3
--- /dev/null
+++ b/General/General/ct_signoff_dataset.cpp
@@ -0,0 +1,670 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include <tc/tc.h>
+#include "epm_handler_common.h"
+
+#include <ict/ict_userservice.h>
+#include <tccore/custom.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <tccore/aom.h>
+#include <tccore/aom_prop.h>
+#include <tccore/item.h>
+#include <bom/bom.h>
+#include "ps/ps.h";
+#include "ps/vrule.h"
+#include "sstream"
+#include <tccore/grm.h>
+#include "epm/epm.h"
+#include "sa/sa.h"
+#include "libxl.h"
+#include <map>
+#include "epm/signoff.h"
+#include <ctime>
+#include <vector>
+#include <locale>
+#include "ae/dataset.h"
+#include <stdlib.h>
+#include <tccore/tctype.h>
+#include <sa/tcfile.h>
+#include <ss/ss_errors.h>
+#include <ae/datasettype.h>
+#include "chint_Handler.h"
+#include "string_utils.h"
+using namespace std;
+typedef struct 
+{
+	string name;
+	string value;
+}CAD_ATTR_STRUCT;
+int signoff_msexcel(tag_t dataset, char *dat_file, char *ext)
+{
+	tag_t spec_dataset_rev = NULLTAG,
+		ref_object = NULLTAG;
+
+	AE_reference_type_t reference_type;
+
+	AE_ask_dataset_latest_rev(dataset, &spec_dataset_rev);
+
+	char ref_name[WSO_name_size_c + 1] = "excel";
+	AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+	if(reference_type == AE_PART_OF)
+	{
+		char pathname[SS_MAXPATHLEN] = "";
+		IMF_ask_file_pathname(ref_object, SS_WNT_MACHINE, pathname);
+		char origin_file_name[IMF_filename_size_c + 1] = "";
+		IMF_ask_original_file_name(ref_object, origin_file_name);
+
+		char new_ds_name[WSO_name_size_c + 1] = "";
+		char *new_file_name = USER_new_file_name(new_ds_name, ref_name, ext, 0);
+		char *temp_dir = getenv("temp");
+		temp_dir="E:\\TEMP";
+		char temp_file[SS_MAXPATHLEN] = "";
+		strcpy(temp_file, temp_dir);
+		strcat(temp_file, "\\");
+		strcat(temp_file, new_file_name);
+
+		IMF_export_file(ref_object, temp_file);
+
+
+		int   iCnt;
+		char *user_lib_env,pTempStr[500];
+		char local_path[MAX_PATH] = "";
+		char cmd[256] = "";
+		/*user_lib_env = getenv("TC_USER_LIB"); 
+		strcpy(local_path, user_lib_env);
+
+		iCnt = strlen(user_lib_env);
+		while( user_lib_env[iCnt] != '\\' )
+		{
+			iCnt--;
+		}
+		strcpy(pTempStr,"");
+		strcpy(pTempStr,&user_lib_env[iCnt+1]);
+
+		if( strcmp(pTempStr,"SubstMacros-MSExcel.wsf") != 0 )
+		{
+			strcat( user_lib_env, "\\SubstMacros-MSExcel.wsf" ); 
+		}*/
+		//strcpy( cmd, user_lib_env );
+		strcpy( cmd, "SubstMacros-MSExcel.wsf" );
+		strcat( cmd, " \"" ); 
+		strcat( cmd, temp_file ); 
+		strcat( cmd, "\" \"" );
+		strcat( cmd, dat_file ); 
+		strcat( cmd, "\"" );
+		printf( "\n%s\n",cmd );
+		system( cmd );
+
+		//strcpy(user_lib_env, local_path);
+
+
+		tag_t new_file_tag = NULLTAG;
+		IMF_file_t file_descriptor;	
+		IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+		IMF_set_original_file_name(new_file_tag, origin_file_name);
+		IMF_close_file(file_descriptor);
+		AOM_save(new_file_tag);
+		AOM_unlock(new_file_tag);
+
+		AOM_lock(spec_dataset_rev);
+		//CALL(AOM_load (dataset));
+		//CALL(AOM_load(spec_dataset_rev));
+		AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object);
+		AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+		AOM_save(spec_dataset_rev);
+		AOM_unlock(spec_dataset_rev);
+	}
+
+	return ITK_ok;
+}
+int create_signinfo_file(char *file_content,char *item_id, char **file_name)
+{
+	time_t now;
+	struct tm *p;
+	FILE *filePtr = NULL;
+
+	char *temp_dir = getenv("TEMP");
+	char local_path[MAX_PATH] = "";
+
+	time(&now);
+	p = localtime(&now);
+	if(temp_dir[strlen(temp_dir) - 1] == '\\')
+	{
+		sprintf_s(local_path, "%s%s-%d-%d-%d-%d-%d-%d.dat", temp_dir,item_id,
+			1900+p->tm_year,p->tm_mon+1 ,p->tm_mday+1 ,p->tm_hour,p->tm_min ,p->tm_sec);
+	}
+	else
+	{
+		sprintf_s(local_path, "%s\\%s-%d-%d-%d-%d-%d-%d.dat", temp_dir,item_id,
+			1900+p->tm_year,p->tm_mon+1 ,p->tm_mday+1 ,p->tm_hour,p->tm_min ,p->tm_sec);
+	}
+
+	if((filePtr = fopen(local_path, "wt")) == NULL)
+	{
+		printf("Can not create the temp dat file!\n");
+		return -1;
+	}
+	*file_name = (char *)MEM_alloc(sizeof(char)*512);
+	strcpy((*file_name), local_path);
+
+	fwrite(file_content, sizeof(char), strlen(file_content), filePtr);
+	fclose(filePtr);
+
+	return ITK_ok;
+}
+int signoff_msword(tag_t dataset, char *dat_file,char *ext)
+{
+	tag_t spec_dataset_rev = NULLTAG , ref_object = NULLTAG;
+	AE_reference_type_t reference_type;
+	//printf("\n111111111111\n");
+	AE_ask_dataset_latest_rev(dataset, &spec_dataset_rev);
+
+	char ref_name[WSO_name_size_c + 1] = "Fnd0word";
+	//printf("\n22222222222\n");
+	AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+	if(reference_type == AE_PART_OF)
+	{
+		//printf("\n3333333333333\n");
+		char pathname[SS_MAXPATHLEN] = "";
+		IMF_ask_file_pathname(ref_object, SS_WNT_MACHINE, pathname);
+		char origin_file_name[IMF_filename_size_c + 1] = "";
+		IMF_ask_original_file_name(ref_object, origin_file_name);
+		//printf("\n44444444444444\n");
+		char new_ds_name[WSO_name_size_c + 1] = "";
+		char *new_file_name = USER_new_file_name(new_ds_name, ref_name, ext, 0);
+		char *temp_dir = getenv("temp");
+		temp_dir="E:\\TEMP";
+		//printf("\n555555555555\n");
+		char temp_file[SS_MAXPATHLEN] = "";
+		strcpy(temp_file, temp_dir);
+		strcat(temp_file, "\\");
+		strcat(temp_file, new_file_name);
+
+		IMF_export_file(ref_object, temp_file);
+		//printf("\n66666666666666\n");
+
+		int   iCnt;
+		char *user_lib_env,pTempStr[500];
+		char local_path[MAX_PATH] = "";
+		char cmd[256] = "";
+		//user_lib_env = getenv("TC_USER_LIB"); 
+		//strcpy(local_path, user_lib_env);
+
+		//iCnt = strlen(user_lib_env);
+		//while( user_lib_env[iCnt] != '\\' )
+		//{
+		//	iCnt--;
+		//}
+
+		//strcpy(pTempStr,"");
+		//strcpy(pTempStr,&user_lib_env[iCnt+1]);
+
+		//if( strcmp(pTempStr,"SubstMacros-MSWord.wsf") != 0 )
+		//{
+		//	strcat( user_lib_env, "\\SubstMacros-MSWord.wsf" ); 
+		//}
+
+		//strcpy( cmd, user_lib_env );
+		strcpy( cmd, "SubstMacros-MSWord.wsf" );
+		strcat( cmd, " \"" ); 
+		strcat( cmd, temp_file ); 
+		strcat( cmd, "\" \"" );
+		strcat( cmd, dat_file ); 
+		strcat( cmd, "\"" );
+		printf( "\n%s\n",cmd );
+		system( cmd );
+//printf("\n777777777777\n");
+		//strcpy(user_lib_env, local_path);
+
+
+		tag_t new_file_tag = NULLTAG;
+		IMF_file_t file_descriptor;	
+		IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+		IMF_set_original_file_name(new_file_tag, origin_file_name);
+		IMF_close_file(file_descriptor);
+		AOM_save(new_file_tag);
+		AOM_unlock(new_file_tag);
+
+		AOM_lock(spec_dataset_rev);
+		
+		AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object);
+		
+		AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+		AOM_save(spec_dataset_rev);
+		AOM_unlock(spec_dataset_rev);
+	}
+	return ITK_ok;
+}
+int jf_signoff_dataset( EPM_action_message_t msg )
+{
+	int ifail = ITK_ok, rcode = 0;
+	//�������
+	char arg1value[1024] = "",arg2value[1024] = "",arg3value[1024]="",arg4value[1024]="",
+		signcounter_info[1024] = "", *value = NULL;
+	char *argflag =NULL,*argvalue=NULL ,*arg = NULL;
+	BOOL bypass = FALSE;
+	int arg_cnt = 0;
+	//���̽ڵ����
+	tag_t root_task = NULLTAG,*sub_tasks = NULL,current_task = NULLTAG,type_tag = NULLTAG;
+	int sub_task_count = 0;
+	char root_task_name[128]="",task_name[128] = "";
+	int occur_of_counts = 0;
+	tag_t *taskAttches = NULLTAG;
+	char tgt_type[WSO_name_size_c+1]="",type_class[TCTYPE_class_name_size_c+1]="";
+	////ѭ���ڲ�����
+	tag_t cur_task = NULLTAG;
+	char task_type[WSO_name_size_c+1] = "";
+	//ѭ������
+	int i=0, j=0, k=0, count = 0, n = 0;
+	//�ڵ���Ϣ����
+	char sign_info[2048]="";
+	//�ڵ�ѭ����������
+	tag_t itemrevision = NULLTAG,master_form_rel_type = NULLTAG;
+	char rev_id[ITEM_id_size_c+1]="";
+	char item_id[ITEM_id_size_c+1]="";
+	int form_count = 0;
+	tag_t *form_list = NULL,master_form = NULLTAG;
+	char local_path[128]="";
+	//���ƽڵ�
+	int s=0;
+	char *timeinfo2="";
+	EPM_decision_t decision = EPM_nogo;
+	tag_t aUserTag,responsibleParty;
+	char *userName;
+	date_t decision_date;
+	char person_name[SA_name_size_c + 1] = "";
+	char *prop_name="last_mod_date";
+	//��ǩ���
+	int n_prop=0, q = 0;
+	char **prop_names=NULL, hq_name[128] = "", hq_time_name[128] = "", *hq_value=NULL;
+	char exclude_type[256]="", item_type[ITEM_type_size_c+ 1]= "";
+	tag_t item = NULLTAG;
+	logical is_sign = false;
+
+	map<string,CAD_ATTR_STRUCT> sign_map;
+	vector<string> prop_vec;
+	current_task = msg.task;
+	//CreateLogFile("PLA8_signoff",&txtfile);
+	ECHO("=========================================================\n");
+	ECHO("jf_signoff_dataset ��ʼִ��\n");
+	ECHO("=========================================================\n");
+	
+	arg_cnt = TC_number_of_arguments(msg.arguments);
+	ECHO("����������%d\n",arg_cnt);
+	POM_AM__set_application_bypass(true);
+	if (arg_cnt > 0)
+	{
+		for (i=0;i<arg_cnt;i++)
+		{
+			arg = TC_next_argument(msg.arguments);
+			ifail = ITK_ask_argument_named_value((const char*)arg, &argflag, &argvalue);
+			if (stricmp(argflag, "SignName") == 0)
+			{
+				if(argvalue != NULL)
+				{
+					//strcpy(arg1value,argvalue);
+					vector<string> ans,ans1;
+					Split(argvalue,";",ans);
+					for( j = 0; j <ans.size(); j++ )
+					{
+						CAD_ATTR_STRUCT	one_elem;
+						Split(ans[j],"=",ans1);
+						if( ans1.size() > 1 )
+						{
+							one_elem.name = ans1[1];
+							sign_map.insert(pair<string,CAD_ATTR_STRUCT>(ans1[0],one_elem));
+						}
+					}
+				}
+			}
+			else if(stricmp(argflag,"bypass") == 0)
+			{
+				bypass = TRUE;
+			}
+			//else if(stricmp(argflag,"exclude_type") == 0)
+			//{
+			//	if(argvalue != NULL)
+			//	{
+			//		strcpy(exclude_type,argvalue);
+			//	}
+			//} 
+
+		}
+		MEM_free(argflag);
+		MEM_free(argvalue);
+	}
+
+	//��ȡ����
+	 EPM_ask_root_task( msg.task, &root_task );
+	 EPM_ask_sub_tasks( root_task, &sub_task_count, &sub_tasks); 
+	EPM_ask_attachments(root_task, EPM_target_attachment, &occur_of_counts, &taskAttches);
+	ECHO("%d target attachment found",occur_of_counts);
+		
+	for( count=0; count<occur_of_counts; count++ )
+	{
+		ECHO("the %dth work",count);
+		TCTYPE_ask_object_type(taskAttches[count], &type_tag);
+		ifail = TCTYPE_ask_class_name(type_tag, type_class);
+		ECHO("type_class : %s",type_class);
+			
+		//���˵��ǰ汾����
+		if (((strstr(type_class,"Revision") != NULL) || (strstr(type_class,"revision") != NULL))
+			&&(strstr(type_class,"Master") == NULL) &&(strstr(type_class,"master") == NULL)
+			&& (strstr(type_class,"BOM") ==NULL) && (strstr(type_class,"bom") ==NULL) && (strstr(type_class,"Bom") == NULL))	
+		{
+			itemrevision = taskAttches[count];
+			ITEM_ask_rev_id(itemrevision,rev_id);
+			ITEM_ask_item_of_rev( itemrevision, &item);
+			ITEM_ask_id(item, item_id);
+			GRM_find_relation_type( TC_master_form_rtype, &master_form_rel_type  );
+			GRM_list_secondary_objects_only(itemrevision, master_form_rel_type, &form_count, &form_list );
+			if( form_count ==0 )
+			{
+				ECHO("δ�ҵ�ǩ��form,����...");
+				continue;
+			}
+			master_form = itemrevision;// form_list[0]; 
+			map<string,CAD_ATTR_STRUCT>::iterator it;
+			for( it = sign_map.begin(); it != sign_map.end(); it ++ )
+			{
+				CAD_ATTR_STRUCT one_elem;
+				AOM_ask_value_string( master_form, it->first.c_str(), &value);
+				one_elem.name = it->second.name;
+				one_elem.value.assign(value);
+				it->second = one_elem;
+			}
+			DOFREE(form_list);
+			//��form����д���ı��ļ�
+			string info;
+			map<string,CAD_ATTR_STRUCT>::iterator buf_it;
+			for( it = sign_map.begin(); it != sign_map.end(); it ++ )
+			{
+				info.append(it->second.name);
+				info.append("=");
+				info.append(it->second.value);
+				info.append("|");
+			}
+			ECHO("\n info: %s",info.c_str());
+			char *data_file = NULL;
+			create_signinfo_file((char*)info.c_str(),item_id, &data_file);
+			if( data_file == NULL )
+			{
+
+				continue;
+			}
+			ECHO("\n �����ı��ļ�%s\n",data_file);
+			//������ݼ�
+			tag_t relation_type=NULLTAG;
+			//tag_t attach_relation_type = NULLTAG;
+			GRM_find_relation_type(TC_specification_rtype, &relation_type);
+			tag_t *secondary_objects=NULLTAG;
+			int ds_count = 0;
+			char *dataset_type = NULL, *desc_value=NULL,*file_path = NULL,*desc_path;
+			
+			GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects);
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��1\n");
+				AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+				int des_count=0;
+				tag_t *dess=NULL;
+				char  *name;
+				if(!(strcmp(dataset_type, "JK8_AutoCAD") == 0||
+					strcmp(dataset_type, "MSWord") ==0||
+					strcmp(dataset_type, "MSWordX") ==0||
+					strcmp(dataset_type, "MSExcel") ==0||
+					strcmp(dataset_type, "MSExcelX") ==0||
+					strcmp(dataset_type, "PDF") ==0)){
+						if(dataset_type!=NULL){
+							MEM_free(dataset_type);
+							dataset_type =NULL;
+						}
+				
+					continue;
+				}
+
+
+
+
+				AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count,&dess);
+				if(des_count<1){
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				
+				printf("��ʼ�ж�����\n");
+				if(strcmp(dataset_type, "JK8_AutoCAD") == 0) 
+				{
+					printf("cad����\n");
+				//	ECHO("����dwg...\n");
+				//	POM_AM__set_application_bypass(true);
+				//	ifail = export_dataset_file(dataset_list[j], "PDF_Reference", "dwg", &filename,&original_name);
+					// if( data_file != NULL )
+					// signoff_acad(secondary_objects[j],data_file);
+				}
+				else if(strcmp(dataset_type, "MSWord") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"doc");
+				}
+				else if(strcmp(dataset_type, "MSWordX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"docm");
+				}
+				else if(strcmp(dataset_type, "MSExcel") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xls");
+				}
+				else if(strcmp(dataset_type, "MSExcelX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xlsm");
+				}else if(strcmp(dataset_type, "PDF") ==0){
+					// signoff_pdf(secondary_objects[j],data_file,"pdf");
+				}
+				MEM_free(dataset_type);
+
+			}
+			DOFREE(secondary_objects);
+
+			GRM_find_relation_type(TC_attaches_rtype, &relation_type);
+
+			GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects);
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��2\n");
+				AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+				int des_count=0;
+				tag_t *dess=NULL;
+				char  *name;
+
+				if(!(strcmp(dataset_type, "JK8_AutoCAD") == 0||
+					strcmp(dataset_type, "MSWord") ==0||
+					strcmp(dataset_type, "MSWordX") ==0||
+					strcmp(dataset_type, "MSExcel") ==0||
+					strcmp(dataset_type, "MSExcelX") ==0||
+					strcmp(dataset_type, "PDF") ==0)){
+						if(dataset_type!=NULL){
+							MEM_free(dataset_type);
+							dataset_type =NULL;
+						}
+				
+					continue;
+				}
+				AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count,&dess);
+				if(des_count<1){
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				
+				if(strcmp(dataset_type, "JK8_AutoCAD") == 0) 
+				{
+				//	ECHO("����dwg...\n");
+				//	POM_AM__set_application_bypass(true);
+				//	ifail = export_dataset_file(dataset_list[j], "PDF_Reference", "dwg", &filename,&original_name);
+					// if( data_file != NULL )
+					// signoff_acad(secondary_objects[j],data_file);
+				}
+				else if(strcmp(dataset_type, "MSWord") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"doc");
+				}
+				else if(strcmp(dataset_type, "MSWordX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"docx");
+				}
+				else if(strcmp(dataset_type, "MSExcel") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xls");
+				}
+				else if(strcmp(dataset_type, "MSExcelX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xlsx");
+				}else if(strcmp(dataset_type, "PDF") ==0){
+					// signoff_pdf(secondary_objects[j],data_file,"pdf");
+				}
+				MEM_free(dataset_type);
+			}
+
+			DOFREE(secondary_objects);
+
+			GRM_find_relation_type("IMAN_Rendering", &relation_type);
+
+			GRM_list_secondary_objects_only(itemrevision, relation_type, &ds_count, &secondary_objects);
+			for (int j = 0; j < ds_count; j++)
+			{
+				printf("��3\n");
+				AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+				int des_count=0;
+				tag_t *dess=NULL;
+				char  *name;
+
+				if(!(strcmp(dataset_type, "JK8_AutoCAD") == 0||
+					strcmp(dataset_type, "MSWord") ==0||
+					strcmp(dataset_type, "MSWordX") ==0||
+					strcmp(dataset_type, "MSExcel") ==0||
+					strcmp(dataset_type, "MSExcelX") ==0||
+					strcmp(dataset_type, "PDF") ==0)){
+						if(dataset_type!=NULL){
+							MEM_free(dataset_type);
+							dataset_type =NULL;
+						}
+				
+					continue;
+				}
+				AOM_ask_value_tags(secondary_objects[j], "ref_list", &des_count,&dess);
+				if(des_count<1){
+					printf("�����ݼ�������������\n");
+					continue;
+				}
+				if(strcmp(dataset_type, "JK8_AutoCAD") == 0) 
+				{
+				//	ECHO("����dwg...\n");
+				//	POM_AM__set_application_bypass(true);
+				//	ifail = export_dataset_file(dataset_list[j], "PDF_Reference", "dwg", &filename,&original_name);
+					// if( data_file != NULL )
+					// signoff_acad(secondary_objects[j],data_file);
+				}
+				else if(strcmp(dataset_type, "MSWord") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"doc");
+				}
+				else if(strcmp(dataset_type, "MSWordX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msword(secondary_objects[j],data_file,"docx");
+				}
+				else if(strcmp(dataset_type, "MSExcel") ==0 )
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xls");
+				}
+				else if(strcmp(dataset_type, "MSExcelX") ==0)
+				{
+					AOM_ask_value_string(dess[0], "original_file_name", &name);
+					printf("name=%s\n",name);
+					if ((strstr(name,"docx") != NULL)||(strstr(name,"xlsx") != NULL)){
+						printf("��׺Ϊdocx��xlsx�˳�\n");
+						continue;
+					}
+					signoff_msexcel(secondary_objects[j],data_file,"xlsx");
+				}else if(strcmp(dataset_type, "PDF") ==0){
+					// signoff_pdf(secondary_objects[j],data_file,"pdf");
+				}
+				MEM_free(dataset_type);
+			}
+			DOFREE(secondary_objects);
+
+		}
+	}
+	POM_AM__set_application_bypass(false);
+	DOFREE(taskAttches);
+	ECHO("=========================================================\n");
+	ECHO("jf_signoff_dataset ִ�н���\n");
+	ECHO("=========================================================\n");
+	return rcode;
+}
diff --git a/General/General/dllmain.cpp b/General/General/dllmain.cpp
new file mode 100644
index 0000000..260abc6
--- /dev/null
+++ b/General/General/dllmain.cpp
@@ -0,0 +1,19 @@
+// dllmain.cpp : ���� DLL Ӧ�ó������ڵ㡣
+#include "stdafx.h"
+
+BOOL APIENTRY DllMain( HMODULE hModule,
+                       DWORD  ul_reason_for_call,
+                       LPVOID lpReserved
+					 )
+{
+	switch (ul_reason_for_call)
+	{
+	case DLL_PROCESS_ATTACH:
+	case DLL_THREAD_ATTACH:
+	case DLL_THREAD_DETACH:
+	case DLL_PROCESS_DETACH:
+		break;
+	}
+	return TRUE;
+}
+
diff --git a/General/General/epm_handler_common.h b/General/General/epm_handler_common.h
new file mode 100644
index 0000000..15d011f
--- /dev/null
+++ b/General/General/epm_handler_common.h
@@ -0,0 +1,72 @@
+
+#ifndef EPM_HANDLER_COMMON
+#define EPM_HANDLER_COMMON
+
+#include <epm/epm.h>
+#include <string>
+#include <map>
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+	using namespace std;
+
+	#define ERROR_QRY_NOT_FOUND (EMH_USER_error_base + 120)
+#define TC_specification	"IMAN_specification"
+int WX_Check_Property(EPM_rule_message_t msg);
+int Modify_Attributes(EPM_rule_message_t msg);
+int Check_range(EPM_rule_message_t msg);
+int chint_getChgOrde(EPM_action_message_t msg);
+int chint_getProduct(EPM_action_message_t msg);
+int Remove_Release_Status(EPM_action_message_t msg);
+int AddTime(EPM_action_message_t msg);
+int AddReleaseStatus(EPM_action_message_t msg);
+int AutomaticRelease(EPM_action_message_t msg);
+int hasFillInChechList(EPM_action_message_t msg);
+// int chintP(EPM_action_message_t msg);
+int chintProperty(EPM_action_message_t msg);
+int chint_signoff_dataset(EPM_action_message_t msg);
+int chint_DesignProcess(EPM_action_message_t msg);
+int chintSignChange(EPM_action_message_t msg);
+int DbomToEMethod(void *returnValue);
+int DbomToEMethodUser(void *returnValue);
+int CloneTempProcess(void *returnValue);
+int EbomToPMethod(void *returnValue);
+int HXC_create_item_post(METHOD_message_t* msg , va_list va);//�����
+int AutoFeeding(void *returnValue);
+int chint_pdf_signoff(EPM_action_message_t msg);
+int chint_updateToPi(EPM_action_message_t msg);
+int chint_add_to_workflow(EPM_action_message_t msg);
+int chint_backCheckTable(EPM_action_message_t msg);
+int chint_remove_other_deisgndata(EPM_action_message_t msg);
+int chint_CheckTable_State(EPM_action_message_t msg); 
+int chint_check_ZC_ZJ_BOM(EPM_action_message_t msg);
+int chint_check_exist_ebom(EPM_action_message_t msg);
+int UpdateWorkTime(void *returnValue);
+int CHINT_task_complete(EPM_action_message_t msg);
+int CHINT_cossheet_upgrade(EPM_action_message_t msg);
+int CHINT_SendOAMaterial(EPM_action_message_t msg);
+int CHINT_GetFrock(EPM_action_message_t msg);
+	//user service end
+#ifdef __cplusplus
+}
+#endif
+
+#endif 
+
+#define ITKCALL( argument )                                             \
+{                                                                       \
+	int retcode = argument;                                             \
+	if ( retcode != ITK_ok ) {                                          \
+	char* s;                                                        \
+	printf( " "#argument "\n" );                                    \
+	printf( "  returns [%d]\n", retcode );                          \
+	EMH_ask_error_text (retcode, &s);                               \
+	TC_printf( "  Teamcenter ERROR: [%s]\n", s);           \
+	printf( "  in file ["__FILE__"], line [%d]\n\n", __LINE__ );    \
+	if (s != 0) MEM_free (s);                                       \
+	}                                                                   \
+}
\ No newline at end of file
diff --git a/General/General/epm_register_handler.cpp b/General/General/epm_register_handler.cpp
new file mode 100644
index 0000000..af20a22
--- /dev/null
+++ b/General/General/epm_register_handler.cpp
@@ -0,0 +1,392 @@
+
+#pragma warning (disable: 4819) 
+
+
+
+#include <server_exits/user_server_exits.h>
+#include <tccore/custom.h>
+#include <tccore/item_msg.h>
+#include <epm/epm.h>
+
+/**
+* @headerfile			standard c & cpp header files
+*/
+#include <stdio.h>
+#include <stdlib.h>
+#include <ctype.h>
+#include <string.h>
+#include <time.h>
+#include <tc/tc.h>
+#include <tccore/method.h>
+
+
+/**
+* @headerfile			user's header files
+*/
+#include "epm_register_handler.h"//��������ͷ�ļ�
+#include "epm_handler_common.h"
+#include <iostream>
+#include "chint_Handler.h"
+
+#define LIMITDAY 2016
+
+
+
+//�����̵��õ�
+// ��׼��ע�ṩ���̵��÷���handler����� TC_save_msg
+extern DLLAPI int USERSERVICE_custom_register_handlers(int *decision, va_list args)
+{
+	int ifail = ITK_ok, n=0;
+
+	//��׼��ע��action_handler�����
+	
+		*decision = ALL_CUSTOMIZATIONS;
+	//��׼��ע��action_handler�����
+	//�����
+	/*METHOD_id_t mth_tag;
+	(ifail = METHOD_find_method("Item",ITEM_create_msg,&mth_tag));
+	cout<<"mth_tag.id------------------>"<<mth_tag.id<<endl;
+	if (mth_tag.id != 0){
+		(ifail = METHOD_add_action(mth_tag, METHOD_post_action_type, HXC_create_item_post, NULL));
+		fprintf(stdout,"regist HXC_create_item_post post_action successfully  !\n");
+		printf("��Ŀ��������ע��ɹ�  !\n");
+	}else{
+		fprintf(stdout,"regist HXC_create_item_post post_action fiald  !\n");
+		printf("��Ŀ��������ע��ʧ��  !\n");
+	}
+	
+	( ifail = EPM_register_rule_handler("WX_Check_Property", "��������Ƿ�Ϊ��",(EPM_rule_handler_t) WX_Check_Property));//���ܱ�
+	if(ifail==0) {
+		printf("Registering rule handler WX_Check_Property successful\n");
+	} else {
+		printf("Registering rule handler WX_Check_Property failed %d\n", ifail);
+	}
+	( ifail = EPM_register_rule_handler("Modify_Attributes", "�����޸�����",(EPM_rule_handler_t) Modify_Attributes));//���ܱ�
+	if(ifail==0) {
+		printf("Registering rule handler Modify_Attributes successful\n");
+	} else {
+		printf("Registering rule handler Modify_Attributes failed %d\n", ifail);
+	}	
+	( ifail = EPM_register_rule_handler("Check_range", "���excelij����Ԫ���Ƿ���ֵ",(EPM_rule_handler_t) Check_range));//���ܱ�
+	if(ifail==0) {
+		printf("Registering rule handler Check_range successful\n");
+	} else {
+		printf("Registering rule handler Check_range failed %d\n", ifail);
+	}
+
+
+	( ifail = EPM_register_action_handler("Remove_Release_Status", "�Ƴ�����״̬",(EPM_action_handler_t) Remove_Release_Status));//handler���ƣ�handler������handler��ע��ָ��
+	if(ifail==0) {
+		printf("Registering action handler Remove_Release_Status successful\n");
+	} else {
+		printf("Registering action handler Remove_Release_Status failed %d\n", ifail);
+	}
+
+( ifail = EPM_register_action_handler("AddReleaseStatus", "���ӷ���״̬",(EPM_action_handler_t) AddReleaseStatus));//handler���ƣ�handler������handler��ע��ָ��
+	if(ifail==0) {
+		printf("Registering action handler AddReleaseStatus successful\n");
+	} else {
+		printf("Registering action handler AddReleaseStatus failed %d\n", ifail);
+	}
+
+	( ifail = EPM_register_action_handler("AutomaticRelease", "����������Զ�����",(EPM_action_handler_t) AutomaticRelease));//handler���ƣ�handler������handler��ע��ָ��
+	if(ifail==0) {
+		printf("Registering action handler AutomaticRelease successful\n");
+	} else {
+		printf("Registering action handler AutomaticRelease failed %d\n", ifail);
+	}*/
+
+	/*( ifail = EPM_register_action_handler("AddTime", "����ʱ��",(EPM_action_handler_t) AddTime));//handler���ƣ�handler������handler��ע��ָ��
+	if(ifail==0) {
+		printf("Registering action handler AddTime successful\n");
+	} else {
+		printf("Registering action handler AddTime failed %d\n", ifail);
+	}*/
+		/*ifail = EPM_register_action_handler("chint_set_prop_1", "�޸�����Ŀ������1", (EPM_action_handler_t)chint_set_prop_1);
+	if(ifail==0) {
+		printf("Registering action handler chint_set_prop_1 successful\n");
+	} else {
+		printf("Registering action handler chint_set_prop_1 failed %d\n", ifail);
+	}	
+	ifail = EPM_register_action_handler("ChintSendMessage_1", "PLM-AM1", (EPM_action_handler_t)ChintSendMessage_1);
+	if(ifail==0) {
+		printf("Registering action handler ChintSendMessage_1 successful\n");
+	} else {
+		printf("Registering action handler ChintSendMessage_1 failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("chintP", "chintP", (EPM_action_handler_t)chintP);
+	if(ifail==0) {
+		printf("Registering action handler chintP successful\n");
+	} else {
+		printf("Registering action handler chintP failed %d\n", ifail);
+	}*/
+	ifail = EPM_register_action_handler("chintProperty", "chintProperty", (EPM_action_handler_t)chintProperty);
+	if(ifail==0) {
+		printf("Registering action handler chintProperty successful\n");
+	} else {
+		printf("Registering action handler chintProperty failed %d\n", ifail);
+	}	
+	
+	ifail = EPM_register_action_handler("chintSignChange", "chintSignChange", (EPM_action_handler_t)chintSignChange);
+	if(ifail==0) {
+		printf("Registering action handler chintSignChange successful\n");
+	} else {
+		printf("Registering action handler chintSignChange failed %d\n", ifail);
+	}
+	
+	ifail = EPM_register_action_handler("chint_signoff_dataset", "chint_signoff_dataset", (EPM_action_handler_t)chint_signoff_dataset);
+	if(ifail==0) {
+		printf("Registering action handler chint_signoff_dataset successful\n");
+	} else {
+		printf("Registering action handler chint_signoff_dataset failed %d\n", ifail);
+	}	
+
+	ifail = EPM_register_action_handler("chint_getChgOrde", "chint_getChgOrde", (EPM_action_handler_t)chint_getChgOrde);
+	if (ifail == 0) {
+		printf("Registering action handler chint_getChgOrde successful\n");
+	}
+	else {
+		printf("Registering action handler chint_getChgOrde failed %d\n", ifail);
+	}
+
+	ifail = EPM_register_action_handler("chint_getProduct", "chint_getProduct", (EPM_action_handler_t)chint_getProduct);
+	if (ifail == 0) {
+		printf("Registering action handler chint_getProduct successful\n");
+	}
+	else {
+		printf("Registering action handler chint_getProduct failed %d\n", ifail);
+	}
+
+	ifail = EPM_register_action_handler("chint_DesignProcess", "chint_DesignProcess", (EPM_action_handler_t)chint_DesignProcess);
+	if (ifail == 0) {
+		printf("Registering action handler chint_DesignProcess successful\n");
+	}
+	else {
+		printf("Registering action handler chint_DesignProcess failed %d\n", ifail);
+	}
+
+	ifail = EPM_register_action_handler("chint_pdf_signoff", "chint_pdf_signoff", (EPM_action_handler_t)chint_pdf_signoff);
+	if (ifail == 0) {
+		printf("Registering action handler chint_pdf_signoff successful\n");
+	}
+	else {
+		printf("Registering action handler chint_pdf_signoff failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("chint_updateToPi", "chint_updateToPi", (EPM_action_handler_t)chint_updateToPi);
+	if (ifail == 0) {
+		printf("Registering action handler chint_updateToPi successful\n");
+	}
+	else {
+		printf("Registering action handler chint_updateToPi failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("chint_add_to_workflow", "chint_add_to_workflow", (EPM_action_handler_t)chint_add_to_workflow);
+	if (ifail == 0) {
+		printf("Registering action handler chint_add_to_workflow successful\n");
+	}
+	else {
+		printf("Registering action handler chint_remove_other_deisgndata failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("chint_remove_other_deisgndata", "chint_remove_other_deisgndata", (EPM_action_handler_t)chint_remove_other_deisgndata);
+	if (ifail == 0) {
+		printf("Registering action handler chint_remove_other_deisgndata successful\n");
+	}
+	else {
+		printf("Registering action handler chint_remove_other_deisgndata failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("chint_check_exist_ebom", "chint_check_exist_ebom", (EPM_action_handler_t)chint_check_exist_ebom);
+	if (ifail == 0) {
+		printf("Registering action handler chint_check_exist_ebom successful\n");
+	}
+	else {
+		printf("Registering action handler chint_check_exist_ebom failed %d\n", ifail);
+	}
+
+	ifail = EPM_register_action_handler("chint_backCheckTable", "chint_backCheckTable", (EPM_action_handler_t)chint_backCheckTable);
+	if (ifail == 0) {
+		printf("Registering action handler chint_backCheckTable successful\n");
+	}
+	else {
+		printf("Registering action handler chint_backCheckTable failed %d\n", ifail);
+	}
+
+	ifail = EPM_register_action_handler("chint_CheckTable_State", "chint_CheckTable_State", (EPM_action_handler_t)chint_CheckTable_State);
+	if (ifail == 0) {
+		printf("Registering action handler chint_CheckTable_State successful\n");
+	}
+	else {
+		printf("Registering action handler chint_CheckTable_State failed %d\n", ifail);
+	}
+	
+	ifail = EPM_register_action_handler("chint_check_ZC_ZJ_BOM", "chint_check_ZC_ZJ_BOM", (EPM_action_handler_t)chint_check_ZC_ZJ_BOM);
+	if (ifail == 0) {
+		printf("Registering action handler chint_check_ZC_ZJ_BOM successful\n");
+	}
+	else {
+		printf("Registering action handler chint_check_ZC_ZJ_BOM failed %d\n", ifail);
+	}
+
+	ifail = EPM_register_action_handler("CHINT_task_complete", "CHINT_task_complete", (EPM_action_handler_t)CHINT_task_complete);
+	if (ifail == 0) {
+		printf("Registering action handler CHINT_task_complete successful\n");
+	}
+	else {
+		printf("Registering action handler CHINT_task_complete failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("CHINT_cossheet_upgrade", "CHINT_cossheet_upgrade", (EPM_action_handler_t)CHINT_cossheet_upgrade);
+	if (ifail == 0) {
+		printf("Registering action handler CHINT_cossheet_upgrade successful\n");
+	}
+	else {
+		printf("Registering action handler CHINT_cossheet_upgrade failed %d\n", ifail);
+	}
+	ifail = EPM_register_action_handler("CHINT_SendOAMaterial", "CHINT_SendOAMaterial", (EPM_action_handler_t)CHINT_SendOAMaterial);
+	if (ifail == 0) {
+		printf("Registering action handler CHINT_SendOAMaterial successful\n");
+	}
+	else {
+		printf("Registering action handler CHINT_SendOAMaterial failed %d\n", ifail);
+	}
+	//oa �汾��������
+	ifail = EPM_register_action_handler("CHINT_GetFrock", "CHINT_GetFrock", (EPM_action_handler_t)CHINT_GetFrock);
+	if (ifail == 0) {
+		printf("Registering action handler CHINT_GetFrock successful\n");
+	}
+	else {
+		printf("Registering action handler CHINT_GetFrock failed %d\n", ifail);
+	}
+	return ifail;
+}
+//
+//ע��JAVA���õķ���(����˵����Java����õĿ����߹���·�����÷���״̬�ķ������������д��������)
+//register service method
+extern DLLAPI int USERSERVICE_custom_register_methods(int *decision, va_list args)
+{
+
+	{
+		int  numberOfArguments = 1;
+		int  returnValueType = USERARG_STRING_TYPE;
+		int *argumentList = NULL;
+		USER_function_t functionPtr = NULL;
+		functionPtr = DbomToEMethod;
+		argumentList = (int*)MEM_alloc(numberOfArguments * sizeof(int));
+		argumentList[0] = USERARG_STRING_TYPE;
+		//argumentList[1] = USERARG_STRING_TYPE;
+		int status = USERSERVICE_register_method("DbomToEMethod", functionPtr, numberOfArguments, argumentList, returnValueType);
+		if (status == ITK_ok)
+		{
+			fprintf(stdout, "Registering DbomToEMethod finished\n");
+		}
+		else
+		{
+			fprintf(stdout, "Registering DbomToEMethod failed %d\n", status);
+		}
+		MEM_free(argumentList);
+	}
+	{
+		int  numberOfArguments = 1;
+		int  returnValueType = USERARG_STRING_TYPE;
+		int *argumentList = NULL;
+		USER_function_t functionPtr = NULL;
+		functionPtr = DbomToEMethodUser;
+		argumentList = (int*)MEM_alloc(numberOfArguments * sizeof(int));
+		argumentList[0] = USERARG_STRING_TYPE;
+		//argumentList[1] = USERARG_STRING_TYPE;
+		int status = USERSERVICE_register_method("DbomToEMethodUser", functionPtr, numberOfArguments, argumentList, returnValueType);
+		if (status == ITK_ok)
+		{
+			fprintf(stdout, "Registering DbomToEMethodUser finished\n");
+		}
+		else
+		{
+			fprintf(stdout, "Registering DbomToEMethodUser failed %d\n", status);
+		}
+		MEM_free(argumentList);
+	}
+	{
+		int  numberOfArguments = 1;
+		int  returnValueType = USERARG_STRING_TYPE;
+		int *argumentList = NULL;
+		USER_function_t functionPtr = NULL;
+		functionPtr = EbomToPMethod;
+		argumentList = (int*)MEM_alloc(numberOfArguments * sizeof(int));
+		argumentList[0] = USERARG_STRING_TYPE;
+
+		int status = USERSERVICE_register_method("EbomToPMethod", functionPtr, 
+			numberOfArguments, argumentList, returnValueType);
+		if (status == ITK_ok)
+		{
+			fprintf(stdout, "Registering EbomToPMethod finished\n");
+		}
+		else
+		{
+			fprintf(stdout, "Registering EbomToPMethod failed %d\n", status);
+		}
+		MEM_free(argumentList);
+	}
+	{
+		int  numberOfArguments = 1;
+		int  returnValueType = USERARG_STRING_TYPE;
+		int *argumentList = NULL;
+		USER_function_t functionPtr = NULL;
+		functionPtr = CloneTempProcess;
+		argumentList = (int*)MEM_alloc(numberOfArguments * sizeof(int));
+		argumentList[0] = USERARG_STRING_TYPE;
+
+		int status = USERSERVICE_register_method("CloneTempProcess", functionPtr,
+			numberOfArguments, argumentList, returnValueType);
+		if (status == ITK_ok)
+		{
+			fprintf(stdout, "Registering CloneTempProcess finished\n");
+		}
+		else
+		{
+			fprintf(stdout, "Registering CloneTempProcess failed %d\n", status);
+		}
+		MEM_free(argumentList);
+	}
+	{
+		int  numberOfArguments = 1;
+		int  returnValueType = USERARG_STRING_TYPE;
+		int *argumentList = NULL;
+		USER_function_t functionPtr = NULL;
+		functionPtr = UpdateWorkTime;
+		argumentList = (int*)MEM_alloc(numberOfArguments * sizeof(int));
+		argumentList[0] = USERARG_STRING_TYPE;
+
+		int status = USERSERVICE_register_method("UpdateWorkTime", functionPtr,
+			numberOfArguments, argumentList, returnValueType);
+		if (status == ITK_ok)
+		{
+			fprintf(stdout, "Registering UpdateWorkTime finished\n");
+		}
+		else
+		{
+			fprintf(stdout, "Registering UpdateWorkTime failed %d\n", status);
+		}
+		MEM_free(argumentList);
+	}
+	{
+		int  numberOfArguments = 1;
+		int  returnValueType = USERARG_STRING_TYPE;
+		int *argumentList = NULL;
+		USER_function_t functionPtr = NULL;
+		functionPtr = AutoFeeding;
+		argumentList = (int*)MEM_alloc(numberOfArguments * sizeof(int));
+		argumentList[0] = USERARG_STRING_TYPE;
+
+		int status = USERSERVICE_register_method("AutoFeeding", functionPtr,
+			numberOfArguments, argumentList, returnValueType);
+		if (status == ITK_ok)
+		{
+			fprintf(stdout, "Registering AutoFeeding finished\n");
+		}
+		else
+		{
+			fprintf(stdout, "Registering AutoFeeding failed %d\n", status);
+		}
+		MEM_free(argumentList);
+	}
+	return ITK_ok;
+}
+
+
diff --git a/General/General/epm_register_handler.h b/General/General/epm_register_handler.h
new file mode 100644
index 0000000..f21e4cd
--- /dev/null
+++ b/General/General/epm_register_handler.h
@@ -0,0 +1,37 @@
+
+/*=================================================================================
+* @file					epm_register_handler.h
+* @brief				itk user exits function declation, to register custom handlers
+* @date					2009/2/13
+* @author				Ray Li
+* @history
+* ===================================================================================
+* Date					Name				Description
+* 13-Feb-2009			Ray				created
+*===================================================================================*/
+
+
+#ifndef EPM_REGISTER_HANDLER_CUSTOM
+#define EPM_REGISTER_HANDLER_CUSTOM
+
+#include <epm/epm.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+extern DLLAPI int USERSERVICE_custom_register_handlers(int *, va_list);
+extern DLLAPI int USERSERVICE_custom_register_methods(int *decision, va_list args);
+extern  int Register_revise_msg( void );
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif 
+
+
+/**
+* @}
+*/
\ No newline at end of file
diff --git a/General/General/error_handling.h b/General/General/error_handling.h
new file mode 100644
index 0000000..05d9d62
--- /dev/null
+++ b/General/General/error_handling.h
@@ -0,0 +1,162 @@
+/*!
+* @addtogroup common
+* \file error_handling.h
+* \brief ����������
+* \date 2008/6/10
+* \author Ray Li
+*/
+
+#ifndef SIMPLE_ERR_H_INCLUDED
+#define SIMPLE_ERR_H_INCLUDED
+
+
+#include <itk/mem.h>
+#include <tc/iman.h>
+#include <tc/emh.h>
+#include <pom/pom/pom_errors.h>
+#include <tc/emh_const.h>
+#include <tc/tc.h>
+#include <pom/pom/pom.h>
+
+#include <stdio.h>
+#include <time.h>
+
+#define BUFSIZE				512
+
+
+//
+#define HANDLER_ARGUMENT_ERROR					EMH_USER_error_base + 1
+//#define WORKFLOW_NODE_IS_NOT_VALID				EMH_USER_error_base + 2
+
+#define ERROR_STATUS_ERROR				EMH_USER_error_base + 2
+//#define HANDLER_PLACED_INVALID					EMH_USER_error_base + 3
+//
+////user errors define
+////<error id="100">��վ���ļ���ȱ�� %1$ ���ã������������������</error>
+//#define ERROR_PREFERENCE_NOT_FOUND (EMH_USER_error_base + 100)
+
+
+#define DOFREE(obj)								\
+{												\
+	if(obj)										\
+	{											\
+		MEM_free(obj);							\
+		obj = NULL;								\
+	}											\
+}
+
+
+
+//#define ECHO(X)      printf X;
+#define SYS_LOG(X)   IMAN_write_syslog X;
+#define LOG_ECHO(X)  printf X; IMAN_write_syslog X;
+
+
+
+/*!
+* \def CALL(x)
+* ��ӡ������Ϣ
+*/
+#define CALL(x) {               \
+	int stat;                     \
+	char *err_string;             \
+	if( (stat = (x)) != ITK_ok)   \
+	{                             \
+	EMH_ask_error_text (stat, &err_string);              \
+	LOG_ECHO( ("ERROR: %d ERROR MSG: %s.\n",stat, err_string) )	\
+	LOG_ECHO( ("Function: %s FILE: %s LINE: %d\n", #x, __FILE__, __LINE__ ) )	\
+	MEM_free (err_string);   \
+	return (stat);          \
+	}                         \
+}
+
+/*!
+* \def DO(x)
+* ��ӡ������Ϣ
+*/
+#define DO(x) {             \
+	int stat;                     \
+	char *err_string;             \
+	if( (stat = (x)) != POM_ok)   \
+	{                             \
+	EMH_ask_error_text (stat, &err_string);              \
+	printf ("ERROR: %d ERROR MSG: %s.\n", stat, err_string);        \
+	printf ("Function: %s FILE: %s LINE: %d\n",#x, __FILE__, __LINE__);             \
+	MEM_free (err_string);   \
+	}                         \
+}
+
+/*!
+* \def CALLRNULL(x)
+* ��ӡ������Ϣ
+*/
+#define CALLRNULL(x) {              \
+	int stat;                     \
+	char *err_string;             \
+	if( (stat = (x)) != ITK_ok)   \
+	{                             \
+	EMH_ask_error_text (stat, &err_string);              \
+	printf ("ERROR: %d ERROR MSG: %s.\n", stat, err_string);        \
+	printf ("Function: %s FILE: %s LINE: %d\n",#x, __FILE__, __LINE__);             \
+	MEM_free (err_string);   \
+	return ((char *)NULL);  \
+	}                         \
+}
+
+/*!
+* \def CALL2(x)
+* ��ӡ������Ϣ
+*/
+#define CALL2(x) { \
+	int stat, n_ifails, *serverities, *ifails, err_count;  \
+	char *err_string, **texts;                             \
+	if( (stat = (x)) != ITK_ok)                            \
+	{                                                      \
+	printf ("Function: %s FILE: %s LINE: %d\n",#x, __FILE__, __LINE__);             \
+	EMH_ask_errors( &n_ifails, (const int**)(&serverities), (const int**)(&ifails), (const char***)(&texts)  );\
+	for( err_count=0; err_count<n_ifails; err_count++ ) \
+		{                                                   \
+		printf( "ERROR: %d ERROR MSG: %s.\n", ifails[i], texts[i] );              \
+		}                                                   \
+		MEM_free( serverities );                            \
+		MEM_free( ifails );                                 \
+		MEM_free( texts );                                  \
+		return (stat);                                      \
+	}                                                       \
+}                                                           \
+
+#define CHECK_FILE(x,ret) { \
+	FILE *stream = NULL;	\
+	if( (stream = fopen(x,"rb")) == NULL ) {	\
+	printf( "%s doesn't exists, please check!\n", x );		\
+	IMAN_write_syslog( "%s doesn't exists, please check!\n", x)	;	\
+	ret = -1;	\
+	}	\
+	else {	\
+	fclose(stream);	\
+	stream = NULL;	\
+	ret = 0;	\
+	}	\
+}	\
+
+
+#define CHECK_FILE_NOT_EXISTS(x,ret) { \
+	FILE *stream = NULL;	\
+	if( (stream = fopen(x,"rb")) != NULL ) {	\
+	fclose(stream);	\
+	stream = NULL;	\
+	printf( "%s exists, please check!\n", x );		\
+	IMAN_write_syslog( "%s exists, please check!\n", x)	;	\
+	ret = -1;	\
+	}	\
+	else {	\
+	ret = 0;	\
+	}	\
+}	\
+
+
+
+
+
+
+#endif  
diff --git a/General/General/include/rapidjson/allocators.h b/General/General/include/rapidjson/allocators.h
new file mode 100644
index 0000000..ddcf478
--- /dev/null
+++ b/General/General/include/rapidjson/allocators.h
@@ -0,0 +1,693 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ALLOCATORS_H_
+#define RAPIDJSON_ALLOCATORS_H_
+
+#include "rapidjson.h"
+#include "internal/meta.h"
+
+#include <memory>
+#include <limits>
+
+#if RAPIDJSON_HAS_CXX11
+#include <type_traits>
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// Allocator
+
+/*! \class rapidjson::Allocator
+    \brief Concept for allocating, resizing and freeing memory block.
+    
+    Note that Malloc() and Realloc() are non-static but Free() is static.
+    
+    So if an allocator need to support Free(), it needs to put its pointer in 
+    the header of memory block.
+
+\code
+concept Allocator {
+    static const bool kNeedFree;    //!< Whether this allocator needs to call Free().
+
+    // Allocate a memory block.
+    // \param size of the memory block in bytes.
+    // \returns pointer to the memory block.
+    void* Malloc(size_t size);
+
+    // Resize a memory block.
+    // \param originalPtr The pointer to current memory block. Null pointer is permitted.
+    // \param originalSize The current size in bytes. (Design issue: since some allocator may not book-keep this, explicitly pass to it can save memory.)
+    // \param newSize the new size in bytes.
+    void* Realloc(void* originalPtr, size_t originalSize, size_t newSize);
+
+    // Free a memory block.
+    // \param pointer to the memory block. Null pointer is permitted.
+    static void Free(void *ptr);
+};
+\endcode
+*/
+
+
+/*! \def RAPIDJSON_ALLOCATOR_DEFAULT_CHUNK_CAPACITY
+    \ingroup RAPIDJSON_CONFIG
+    \brief User-defined kDefaultChunkCapacity definition.
+
+    User can define this as any \c size that is a power of 2.
+*/
+
+#ifndef RAPIDJSON_ALLOCATOR_DEFAULT_CHUNK_CAPACITY
+#define RAPIDJSON_ALLOCATOR_DEFAULT_CHUNK_CAPACITY (64 * 1024)
+#endif
+
+
+///////////////////////////////////////////////////////////////////////////////
+// CrtAllocator
+
+//! C-runtime library allocator.
+/*! This class is just wrapper for standard C library memory routines.
+    \note implements Allocator concept
+*/
+class CrtAllocator {
+public:
+    static const bool kNeedFree = true;
+    void* Malloc(size_t size) { 
+        if (size) //  behavior of malloc(0) is implementation defined.
+            return RAPIDJSON_MALLOC(size);
+        else
+            return NULL; // standardize to returning NULL.
+    }
+    void* Realloc(void* originalPtr, size_t originalSize, size_t newSize) {
+        (void)originalSize;
+        if (newSize == 0) {
+            RAPIDJSON_FREE(originalPtr);
+            return NULL;
+        }
+        return RAPIDJSON_REALLOC(originalPtr, newSize);
+    }
+    static void Free(void *ptr) RAPIDJSON_NOEXCEPT { RAPIDJSON_FREE(ptr); }
+
+    bool operator==(const CrtAllocator&) const RAPIDJSON_NOEXCEPT {
+        return true;
+    }
+    bool operator!=(const CrtAllocator&) const RAPIDJSON_NOEXCEPT {
+        return false;
+    }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// MemoryPoolAllocator
+
+//! Default memory allocator used by the parser and DOM.
+/*! This allocator allocate memory blocks from pre-allocated memory chunks. 
+
+    It does not free memory blocks. And Realloc() only allocate new memory.
+
+    The memory chunks are allocated by BaseAllocator, which is CrtAllocator by default.
+
+    User may also supply a buffer as the first chunk.
+
+    If the user-buffer is full then additional chunks are allocated by BaseAllocator.
+
+    The user-buffer is not deallocated by this allocator.
+
+    \tparam BaseAllocator the allocator type for allocating memory chunks. Default is CrtAllocator.
+    \note implements Allocator concept
+*/
+template <typename BaseAllocator = CrtAllocator>
+class MemoryPoolAllocator {
+    //! Chunk header for perpending to each chunk.
+    /*! Chunks are stored as a singly linked list.
+    */
+    struct ChunkHeader {
+        size_t capacity;    //!< Capacity of the chunk in bytes (excluding the header itself).
+        size_t size;        //!< Current size of allocated memory in bytes.
+        ChunkHeader *next;  //!< Next chunk in the linked list.
+    };
+
+    struct SharedData {
+        ChunkHeader *chunkHead;  //!< Head of the chunk linked-list. Only the head chunk serves allocation.
+        BaseAllocator* ownBaseAllocator; //!< base allocator created by this object.
+        size_t refcount;
+        bool ownBuffer;
+    };
+
+    static const size_t SIZEOF_SHARED_DATA = RAPIDJSON_ALIGN(sizeof(SharedData));
+    static const size_t SIZEOF_CHUNK_HEADER = RAPIDJSON_ALIGN(sizeof(ChunkHeader));
+
+    static inline ChunkHeader *GetChunkHead(SharedData *shared)
+    {
+        return reinterpret_cast<ChunkHeader*>(reinterpret_cast<uint8_t*>(shared) + SIZEOF_SHARED_DATA);
+    }
+    static inline uint8_t *GetChunkBuffer(SharedData *shared)
+    {
+        return reinterpret_cast<uint8_t*>(shared->chunkHead) + SIZEOF_CHUNK_HEADER;
+    }
+
+    static const size_t kDefaultChunkCapacity = RAPIDJSON_ALLOCATOR_DEFAULT_CHUNK_CAPACITY; //!< Default chunk capacity.
+
+public:
+    static const bool kNeedFree = false;    //!< Tell users that no need to call Free() with this allocator. (concept Allocator)
+    static const bool kRefCounted = true;   //!< Tell users that this allocator is reference counted on copy
+
+    //! Constructor with chunkSize.
+    /*! \param chunkSize The size of memory chunk. The default is kDefaultChunkSize.
+        \param baseAllocator The allocator for allocating memory chunks.
+    */
+    explicit
+    MemoryPoolAllocator(size_t chunkSize = kDefaultChunkCapacity, BaseAllocator* baseAllocator = 0) : 
+        chunk_capacity_(chunkSize),
+        baseAllocator_(baseAllocator ? baseAllocator : RAPIDJSON_NEW(BaseAllocator)()),
+        shared_(static_cast<SharedData*>(baseAllocator_ ? baseAllocator_->Malloc(SIZEOF_SHARED_DATA + SIZEOF_CHUNK_HEADER) : 0))
+    {
+        RAPIDJSON_ASSERT(baseAllocator_ != 0);
+        RAPIDJSON_ASSERT(shared_ != 0);
+        if (baseAllocator) {
+            shared_->ownBaseAllocator = 0;
+        }
+        else {
+            shared_->ownBaseAllocator = baseAllocator_;
+        }
+        shared_->chunkHead = GetChunkHead(shared_);
+        shared_->chunkHead->capacity = 0;
+        shared_->chunkHead->size = 0;
+        shared_->chunkHead->next = 0;
+        shared_->ownBuffer = true;
+        shared_->refcount = 1;
+    }
+
+    //! Constructor with user-supplied buffer.
+    /*! The user buffer will be used firstly. When it is full, memory pool allocates new chunk with chunk size.
+
+        The user buffer will not be deallocated when this allocator is destructed.
+
+        \param buffer User supplied buffer.
+        \param size Size of the buffer in bytes. It must at least larger than sizeof(ChunkHeader).
+        \param chunkSize The size of memory chunk. The default is kDefaultChunkSize.
+        \param baseAllocator The allocator for allocating memory chunks.
+    */
+    MemoryPoolAllocator(void *buffer, size_t size, size_t chunkSize = kDefaultChunkCapacity, BaseAllocator* baseAllocator = 0) :
+        chunk_capacity_(chunkSize),
+        baseAllocator_(baseAllocator),
+        shared_(static_cast<SharedData*>(AlignBuffer(buffer, size)))
+    {
+        RAPIDJSON_ASSERT(size >= SIZEOF_SHARED_DATA + SIZEOF_CHUNK_HEADER);
+        shared_->chunkHead = GetChunkHead(shared_);
+        shared_->chunkHead->capacity = size - SIZEOF_SHARED_DATA - SIZEOF_CHUNK_HEADER;
+        shared_->chunkHead->size = 0;
+        shared_->chunkHead->next = 0;
+        shared_->ownBaseAllocator = 0;
+        shared_->ownBuffer = false;
+        shared_->refcount = 1;
+    }
+
+    MemoryPoolAllocator(const MemoryPoolAllocator& rhs) RAPIDJSON_NOEXCEPT :
+        chunk_capacity_(rhs.chunk_capacity_),
+        baseAllocator_(rhs.baseAllocator_),
+        shared_(rhs.shared_)
+    {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        ++shared_->refcount;
+    }
+    MemoryPoolAllocator& operator=(const MemoryPoolAllocator& rhs) RAPIDJSON_NOEXCEPT
+    {
+        RAPIDJSON_NOEXCEPT_ASSERT(rhs.shared_->refcount > 0);
+        ++rhs.shared_->refcount;
+        this->~MemoryPoolAllocator();
+        baseAllocator_ = rhs.baseAllocator_;
+        chunk_capacity_ = rhs.chunk_capacity_;
+        shared_ = rhs.shared_;
+        return *this;
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    MemoryPoolAllocator(MemoryPoolAllocator&& rhs) RAPIDJSON_NOEXCEPT :
+        chunk_capacity_(rhs.chunk_capacity_),
+        baseAllocator_(rhs.baseAllocator_),
+        shared_(rhs.shared_)
+    {
+        RAPIDJSON_NOEXCEPT_ASSERT(rhs.shared_->refcount > 0);
+        rhs.shared_ = 0;
+    }
+    MemoryPoolAllocator& operator=(MemoryPoolAllocator&& rhs) RAPIDJSON_NOEXCEPT
+    {
+        RAPIDJSON_NOEXCEPT_ASSERT(rhs.shared_->refcount > 0);
+        this->~MemoryPoolAllocator();
+        baseAllocator_ = rhs.baseAllocator_;
+        chunk_capacity_ = rhs.chunk_capacity_;
+        shared_ = rhs.shared_;
+        rhs.shared_ = 0;
+        return *this;
+    }
+#endif
+
+    //! Destructor.
+    /*! This deallocates all memory chunks, excluding the user-supplied buffer.
+    */
+    ~MemoryPoolAllocator() RAPIDJSON_NOEXCEPT {
+        if (!shared_) {
+            // do nothing if moved
+            return;
+        }
+        if (shared_->refcount > 1) {
+            --shared_->refcount;
+            return;
+        }
+        Clear();
+        BaseAllocator *a = shared_->ownBaseAllocator;
+        if (shared_->ownBuffer) {
+            baseAllocator_->Free(shared_);
+        }
+        RAPIDJSON_DELETE(a);
+    }
+
+    //! Deallocates all memory chunks, excluding the first/user one.
+    void Clear() RAPIDJSON_NOEXCEPT {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        for (;;) {
+            ChunkHeader* c = shared_->chunkHead;
+            if (!c->next) {
+                break;
+            }
+            shared_->chunkHead = c->next;
+            baseAllocator_->Free(c);
+        }
+        shared_->chunkHead->size = 0;
+    }
+
+    //! Computes the total capacity of allocated memory chunks.
+    /*! \return total capacity in bytes.
+    */
+    size_t Capacity() const RAPIDJSON_NOEXCEPT {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        size_t capacity = 0;
+        for (ChunkHeader* c = shared_->chunkHead; c != 0; c = c->next)
+            capacity += c->capacity;
+        return capacity;
+    }
+
+    //! Computes the memory blocks allocated.
+    /*! \return total used bytes.
+    */
+    size_t Size() const RAPIDJSON_NOEXCEPT {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        size_t size = 0;
+        for (ChunkHeader* c = shared_->chunkHead; c != 0; c = c->next)
+            size += c->size;
+        return size;
+    }
+
+    //! Whether the allocator is shared.
+    /*! \return true or false.
+    */
+    bool Shared() const RAPIDJSON_NOEXCEPT {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        return shared_->refcount > 1;
+    }
+
+    //! Allocates a memory block. (concept Allocator)
+    void* Malloc(size_t size) {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        if (!size)
+            return NULL;
+
+        size = RAPIDJSON_ALIGN(size);
+        if (RAPIDJSON_UNLIKELY(shared_->chunkHead->size + size > shared_->chunkHead->capacity))
+            if (!AddChunk(chunk_capacity_ > size ? chunk_capacity_ : size))
+                return NULL;
+
+        void *buffer = GetChunkBuffer(shared_) + shared_->chunkHead->size;
+        shared_->chunkHead->size += size;
+        return buffer;
+    }
+
+    //! Resizes a memory block (concept Allocator)
+    void* Realloc(void* originalPtr, size_t originalSize, size_t newSize) {
+        if (originalPtr == 0)
+            return Malloc(newSize);
+
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        if (newSize == 0)
+            return NULL;
+
+        originalSize = RAPIDJSON_ALIGN(originalSize);
+        newSize = RAPIDJSON_ALIGN(newSize);
+
+        // Do not shrink if new size is smaller than original
+        if (originalSize >= newSize)
+            return originalPtr;
+
+        // Simply expand it if it is the last allocation and there is sufficient space
+        if (originalPtr == GetChunkBuffer(shared_) + shared_->chunkHead->size - originalSize) {
+            size_t increment = static_cast<size_t>(newSize - originalSize);
+            if (shared_->chunkHead->size + increment <= shared_->chunkHead->capacity) {
+                shared_->chunkHead->size += increment;
+                return originalPtr;
+            }
+        }
+
+        // Realloc process: allocate and copy memory, do not free original buffer.
+        if (void* newBuffer = Malloc(newSize)) {
+            if (originalSize)
+                std::memcpy(newBuffer, originalPtr, originalSize);
+            return newBuffer;
+        }
+        else
+            return NULL;
+    }
+
+    //! Frees a memory block (concept Allocator)
+    static void Free(void *ptr) RAPIDJSON_NOEXCEPT { (void)ptr; } // Do nothing
+
+    //! Compare (equality) with another MemoryPoolAllocator
+    bool operator==(const MemoryPoolAllocator& rhs) const RAPIDJSON_NOEXCEPT {
+        RAPIDJSON_NOEXCEPT_ASSERT(shared_->refcount > 0);
+        RAPIDJSON_NOEXCEPT_ASSERT(rhs.shared_->refcount > 0);
+        return shared_ == rhs.shared_;
+    }
+    //! Compare (inequality) with another MemoryPoolAllocator
+    bool operator!=(const MemoryPoolAllocator& rhs) const RAPIDJSON_NOEXCEPT {
+        return !operator==(rhs);
+    }
+
+private:
+    //! Creates a new chunk.
+    /*! \param capacity Capacity of the chunk in bytes.
+        \return true if success.
+    */
+    bool AddChunk(size_t capacity) {
+        if (!baseAllocator_)
+            shared_->ownBaseAllocator = baseAllocator_ = RAPIDJSON_NEW(BaseAllocator)();
+        if (ChunkHeader* chunk = static_cast<ChunkHeader*>(baseAllocator_->Malloc(SIZEOF_CHUNK_HEADER + capacity))) {
+            chunk->capacity = capacity;
+            chunk->size = 0;
+            chunk->next = shared_->chunkHead;
+            shared_->chunkHead = chunk;
+            return true;
+        }
+        else
+            return false;
+    }
+
+    static inline void* AlignBuffer(void* buf, size_t &size)
+    {
+        RAPIDJSON_NOEXCEPT_ASSERT(buf != 0);
+        const uintptr_t mask = sizeof(void*) - 1;
+        const uintptr_t ubuf = reinterpret_cast<uintptr_t>(buf);
+        if (RAPIDJSON_UNLIKELY(ubuf & mask)) {
+            const uintptr_t abuf = (ubuf + mask) & ~mask;
+            RAPIDJSON_ASSERT(size >= abuf - ubuf);
+            buf = reinterpret_cast<void*>(abuf);
+            size -= abuf - ubuf;
+        }
+        return buf;
+    }
+
+    size_t chunk_capacity_;     //!< The minimum capacity of chunk when they are allocated.
+    BaseAllocator* baseAllocator_;  //!< base allocator for allocating memory chunks.
+    SharedData *shared_;        //!< The shared data of the allocator
+};
+
+namespace internal {
+    template<typename, typename = void>
+    struct IsRefCounted :
+        public FalseType
+    { };
+    template<typename T>
+    struct IsRefCounted<T, typename internal::EnableIfCond<T::kRefCounted>::Type> :
+        public TrueType
+    { };
+}
+
+template<typename T, typename A>
+inline T* Realloc(A& a, T* old_p, size_t old_n, size_t new_n)
+{
+    RAPIDJSON_NOEXCEPT_ASSERT(old_n <= std::numeric_limits<size_t>::max() / sizeof(T) && new_n <= std::numeric_limits<size_t>::max() / sizeof(T));
+    return static_cast<T*>(a.Realloc(old_p, old_n * sizeof(T), new_n * sizeof(T)));
+}
+
+template<typename T, typename A>
+inline T *Malloc(A& a, size_t n = 1)
+{
+    return Realloc<T, A>(a, NULL, 0, n);
+}
+
+template<typename T, typename A>
+inline void Free(A& a, T *p, size_t n = 1)
+{
+    static_cast<void>(Realloc<T, A>(a, p, n, 0));
+}
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++) // std::allocator can safely be inherited
+#endif
+
+template <typename T, typename BaseAllocator = CrtAllocator>
+class StdAllocator :
+    public std::allocator<T>
+{
+    typedef std::allocator<T> allocator_type;
+#if RAPIDJSON_HAS_CXX11
+    typedef std::allocator_traits<allocator_type> traits_type;
+#else
+    typedef allocator_type traits_type;
+#endif
+
+public:
+    typedef BaseAllocator BaseAllocatorType;
+
+    StdAllocator() RAPIDJSON_NOEXCEPT :
+        allocator_type(),
+        baseAllocator_()
+    { }
+
+    StdAllocator(const StdAllocator& rhs) RAPIDJSON_NOEXCEPT :
+        allocator_type(rhs),
+        baseAllocator_(rhs.baseAllocator_)
+    { }
+
+    template<typename U>
+    StdAllocator(const StdAllocator<U, BaseAllocator>& rhs) RAPIDJSON_NOEXCEPT :
+        allocator_type(rhs),
+        baseAllocator_(rhs.baseAllocator_)
+    { }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    StdAllocator(StdAllocator&& rhs) RAPIDJSON_NOEXCEPT :
+        allocator_type(std::move(rhs)),
+        baseAllocator_(std::move(rhs.baseAllocator_))
+    { }
+#endif
+#if RAPIDJSON_HAS_CXX11
+    using propagate_on_container_move_assignment = std::true_type;
+    using propagate_on_container_swap = std::true_type;
+#endif
+
+    /* implicit */
+    StdAllocator(const BaseAllocator& allocator) RAPIDJSON_NOEXCEPT :
+        allocator_type(),
+        baseAllocator_(allocator)
+    { }
+
+    ~StdAllocator() RAPIDJSON_NOEXCEPT
+    { }
+
+    template<typename U>
+    struct rebind {
+        typedef StdAllocator<U, BaseAllocator> other;
+    };
+
+    typedef typename traits_type::size_type         size_type;
+    typedef typename traits_type::difference_type   difference_type;
+
+    typedef typename traits_type::value_type        value_type;
+    typedef typename traits_type::pointer           pointer;
+    typedef typename traits_type::const_pointer     const_pointer;
+
+#if RAPIDJSON_HAS_CXX11
+
+    typedef typename std::add_lvalue_reference<value_type>::type &reference;
+    typedef typename std::add_lvalue_reference<typename std::add_const<value_type>::type>::type &const_reference;
+
+    pointer address(reference r) const RAPIDJSON_NOEXCEPT
+    {
+        return std::addressof(r);
+    }
+    const_pointer address(const_reference r) const RAPIDJSON_NOEXCEPT
+    {
+        return std::addressof(r);
+    }
+
+    size_type max_size() const RAPIDJSON_NOEXCEPT
+    {
+        return traits_type::max_size(*this);
+    }
+
+    template <typename ...Args>
+    void construct(pointer p, Args&&... args)
+    {
+        traits_type::construct(*this, p, std::forward<Args>(args)...);
+    }
+    void destroy(pointer p)
+    {
+        traits_type::destroy(*this, p);
+    }
+
+#else // !RAPIDJSON_HAS_CXX11
+
+    typedef typename allocator_type::reference       reference;
+    typedef typename allocator_type::const_reference const_reference;
+
+    pointer address(reference r) const RAPIDJSON_NOEXCEPT
+    {
+        return allocator_type::address(r);
+    }
+    const_pointer address(const_reference r) const RAPIDJSON_NOEXCEPT
+    {
+        return allocator_type::address(r);
+    }
+
+    size_type max_size() const RAPIDJSON_NOEXCEPT
+    {
+        return allocator_type::max_size();
+    }
+
+    void construct(pointer p, const_reference r)
+    {
+        allocator_type::construct(p, r);
+    }
+    void destroy(pointer p)
+    {
+        allocator_type::destroy(p);
+    }
+
+#endif // !RAPIDJSON_HAS_CXX11
+
+    template <typename U>
+    U* allocate(size_type n = 1, const void* = 0)
+    {
+        return RAPIDJSON_NAMESPACE::Malloc<U>(baseAllocator_, n);
+    }
+    template <typename U>
+    void deallocate(U* p, size_type n = 1)
+    {
+        RAPIDJSON_NAMESPACE::Free<U>(baseAllocator_, p, n);
+    }
+
+    pointer allocate(size_type n = 1, const void* = 0)
+    {
+        return allocate<value_type>(n);
+    }
+    void deallocate(pointer p, size_type n = 1)
+    {
+        deallocate<value_type>(p, n);
+    }
+
+#if RAPIDJSON_HAS_CXX11
+    using is_always_equal = std::is_empty<BaseAllocator>;
+#endif
+
+    template<typename U>
+    bool operator==(const StdAllocator<U, BaseAllocator>& rhs) const RAPIDJSON_NOEXCEPT
+    {
+        return baseAllocator_ == rhs.baseAllocator_;
+    }
+    template<typename U>
+    bool operator!=(const StdAllocator<U, BaseAllocator>& rhs) const RAPIDJSON_NOEXCEPT
+    {
+        return !operator==(rhs);
+    }
+
+    //! rapidjson Allocator concept
+    static const bool kNeedFree = BaseAllocator::kNeedFree;
+    static const bool kRefCounted = internal::IsRefCounted<BaseAllocator>::Value;
+    void* Malloc(size_t size)
+    {
+        return baseAllocator_.Malloc(size);
+    }
+    void* Realloc(void* originalPtr, size_t originalSize, size_t newSize)
+    {
+        return baseAllocator_.Realloc(originalPtr, originalSize, newSize);
+    }
+    static void Free(void *ptr) RAPIDJSON_NOEXCEPT
+    {
+        BaseAllocator::Free(ptr);
+    }
+
+private:
+    template <typename, typename>
+    friend class StdAllocator; // access to StdAllocator<!T>.*
+
+    BaseAllocator baseAllocator_;
+};
+
+#if !RAPIDJSON_HAS_CXX17 // std::allocator<void> deprecated in C++17
+template <typename BaseAllocator>
+class StdAllocator<void, BaseAllocator> :
+    public std::allocator<void>
+{
+    typedef std::allocator<void> allocator_type;
+
+public:
+    typedef BaseAllocator BaseAllocatorType;
+
+    StdAllocator() RAPIDJSON_NOEXCEPT :
+        allocator_type(),
+        baseAllocator_()
+    { }
+
+    StdAllocator(const StdAllocator& rhs) RAPIDJSON_NOEXCEPT :
+        allocator_type(rhs),
+        baseAllocator_(rhs.baseAllocator_)
+    { }
+
+    template<typename U>
+    StdAllocator(const StdAllocator<U, BaseAllocator>& rhs) RAPIDJSON_NOEXCEPT :
+        allocator_type(rhs),
+        baseAllocator_(rhs.baseAllocator_)
+    { }
+
+    /* implicit */
+    StdAllocator(const BaseAllocator& baseAllocator) RAPIDJSON_NOEXCEPT :
+        allocator_type(),
+        baseAllocator_(baseAllocator)
+    { }
+
+    ~StdAllocator() RAPIDJSON_NOEXCEPT
+    { }
+
+    template<typename U>
+    struct rebind {
+        typedef StdAllocator<U, BaseAllocator> other;
+    };
+
+    typedef typename allocator_type::value_type value_type;
+
+private:
+    template <typename, typename>
+    friend class StdAllocator; // access to StdAllocator<!T>.*
+
+    BaseAllocator baseAllocator_;
+};
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_ENCODINGS_H_
diff --git a/General/General/include/rapidjson/cursorstreamwrapper.h b/General/General/include/rapidjson/cursorstreamwrapper.h
new file mode 100644
index 0000000..fd6513d
--- /dev/null
+++ b/General/General/include/rapidjson/cursorstreamwrapper.h
@@ -0,0 +1,78 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_CURSORSTREAMWRAPPER_H_
+#define RAPIDJSON_CURSORSTREAMWRAPPER_H_
+
+#include "stream.h"
+
+#if defined(__GNUC__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#if defined(_MSC_VER) && _MSC_VER <= 1800
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4702)  // unreachable code
+RAPIDJSON_DIAG_OFF(4512)  // assignment operator could not be generated
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+
+//! Cursor stream wrapper for counting line and column number if error exists.
+/*!
+    \tparam InputStream     Any stream that implements Stream Concept
+*/
+template <typename InputStream, typename Encoding = UTF8<> >
+class CursorStreamWrapper : public GenericStreamWrapper<InputStream, Encoding> {
+public:
+    typedef typename Encoding::Ch Ch;
+
+    CursorStreamWrapper(InputStream& is):
+        GenericStreamWrapper<InputStream, Encoding>(is), line_(1), col_(0) {}
+
+    // counting line and column number
+    Ch Take() {
+        Ch ch = this->is_.Take();
+        if(ch == '\n') {
+            line_ ++;
+            col_ = 0;
+        } else {
+            col_ ++;
+        }
+        return ch;
+    }
+
+    //! Get the error line number, if error exists.
+    size_t GetLine() const { return line_; }
+    //! Get the error column number, if error exists.
+    size_t GetColumn() const { return col_; }
+
+private:
+    size_t line_;   //!< Current Line
+    size_t col_;    //!< Current Column
+};
+
+#if defined(_MSC_VER) && _MSC_VER <= 1800
+RAPIDJSON_DIAG_POP
+#endif
+
+#if defined(__GNUC__)
+RAPIDJSON_DIAG_POP
+#endif
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_CURSORSTREAMWRAPPER_H_
diff --git a/General/General/include/rapidjson/document.h b/General/General/include/rapidjson/document.h
new file mode 100644
index 0000000..4f1e246
--- /dev/null
+++ b/General/General/include/rapidjson/document.h
@@ -0,0 +1,3043 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_DOCUMENT_H_
+#define RAPIDJSON_DOCUMENT_H_
+
+/*! \file document.h */
+
+#include "reader.h"
+#include "internal/meta.h"
+#include "internal/strfunc.h"
+#include "memorystream.h"
+#include "encodedstream.h"
+#include <new>      // placement new
+#include <limits>
+#ifdef __cpp_lib_three_way_comparison
+#include <compare>
+#endif
+
+RAPIDJSON_DIAG_PUSH
+#ifdef __clang__
+RAPIDJSON_DIAG_OFF(padded)
+RAPIDJSON_DIAG_OFF(switch-enum)
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_OFF(4127) // conditional expression is constant
+RAPIDJSON_DIAG_OFF(4244) // conversion from kXxxFlags to 'uint16_t', possible loss of data
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_OFF(effc++)
+#endif // __GNUC__
+
+#ifdef GetObject
+// see https://github.com/Tencent/rapidjson/issues/1448
+// a former included windows.h might have defined a macro called GetObject, which affects
+// GetObject defined here. This ensures the macro does not get applied
+#pragma push_macro("GetObject")
+#define RAPIDJSON_WINDOWS_GETOBJECT_WORKAROUND_APPLIED
+#undef GetObject
+#endif
+
+#ifndef RAPIDJSON_NOMEMBERITERATORCLASS
+#include <iterator> // std::random_access_iterator_tag
+#endif
+
+#if RAPIDJSON_USE_MEMBERSMAP
+#include <map> // std::multimap
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+// Forward declaration.
+template <typename Encoding, typename Allocator>
+class GenericValue;
+
+template <typename Encoding, typename Allocator, typename StackAllocator>
+class GenericDocument;
+
+/*! \def RAPIDJSON_DEFAULT_ALLOCATOR
+    \ingroup RAPIDJSON_CONFIG
+    \brief Allows to choose default allocator.
+
+    User can define this to use CrtAllocator or MemoryPoolAllocator.
+*/
+#ifndef RAPIDJSON_DEFAULT_ALLOCATOR
+#define RAPIDJSON_DEFAULT_ALLOCATOR ::RAPIDJSON_NAMESPACE::MemoryPoolAllocator<::RAPIDJSON_NAMESPACE::CrtAllocator>
+#endif
+
+/*! \def RAPIDJSON_DEFAULT_STACK_ALLOCATOR
+    \ingroup RAPIDJSON_CONFIG
+    \brief Allows to choose default stack allocator for Document.
+
+    User can define this to use CrtAllocator or MemoryPoolAllocator.
+*/
+#ifndef RAPIDJSON_DEFAULT_STACK_ALLOCATOR
+#define RAPIDJSON_DEFAULT_STACK_ALLOCATOR ::RAPIDJSON_NAMESPACE::CrtAllocator
+#endif
+
+/*! \def RAPIDJSON_VALUE_DEFAULT_OBJECT_CAPACITY
+    \ingroup RAPIDJSON_CONFIG
+    \brief User defined kDefaultObjectCapacity value.
+
+    User can define this as any natural number.
+*/
+#ifndef RAPIDJSON_VALUE_DEFAULT_OBJECT_CAPACITY
+// number of objects that rapidjson::Value allocates memory for by default
+#define RAPIDJSON_VALUE_DEFAULT_OBJECT_CAPACITY 16
+#endif
+
+/*! \def RAPIDJSON_VALUE_DEFAULT_ARRAY_CAPACITY
+    \ingroup RAPIDJSON_CONFIG
+    \brief User defined kDefaultArrayCapacity value.
+
+    User can define this as any natural number.
+*/
+#ifndef RAPIDJSON_VALUE_DEFAULT_ARRAY_CAPACITY
+// number of array elements that rapidjson::Value allocates memory for by default
+#define RAPIDJSON_VALUE_DEFAULT_ARRAY_CAPACITY 16
+#endif
+
+//! Name-value pair in a JSON object value.
+/*!
+    This class was internal to GenericValue. It used to be a inner struct.
+    But a compiler (IBM XL C/C++ for AIX) have reported to have problem with that so it moved as a namespace scope struct.
+    https://code.google.com/p/rapidjson/issues/detail?id=64
+*/
+template <typename Encoding, typename Allocator> 
+class GenericMember {
+public:
+    GenericValue<Encoding, Allocator> name;     //!< name of member (must be a string)
+    GenericValue<Encoding, Allocator> value;    //!< value of member.
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Move constructor in C++11
+    GenericMember(GenericMember&& rhs) RAPIDJSON_NOEXCEPT
+        : name(std::move(rhs.name)),
+          value(std::move(rhs.value))
+    {
+    }
+
+    //! Move assignment in C++11
+    GenericMember& operator=(GenericMember&& rhs) RAPIDJSON_NOEXCEPT {
+        return *this = static_cast<GenericMember&>(rhs);
+    }
+#endif
+
+    //! Assignment with move semantics.
+    /*! \param rhs Source of the assignment. Its name and value will become a null value after assignment.
+    */
+    GenericMember& operator=(GenericMember& rhs) RAPIDJSON_NOEXCEPT {
+        if (RAPIDJSON_LIKELY(this != &rhs)) {
+            name = rhs.name;
+            value = rhs.value;
+        }
+        return *this;
+    }
+
+    // swap() for std::sort() and other potential use in STL.
+    friend inline void swap(GenericMember& a, GenericMember& b) RAPIDJSON_NOEXCEPT {
+        a.name.Swap(b.name);
+        a.value.Swap(b.value);
+    }
+
+private:
+    //! Copy constructor is not permitted.
+    GenericMember(const GenericMember& rhs);
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericMemberIterator
+
+#ifndef RAPIDJSON_NOMEMBERITERATORCLASS
+
+//! (Constant) member iterator for a JSON object value
+/*!
+    \tparam Const Is this a constant iterator?
+    \tparam Encoding    Encoding of the value. (Even non-string values need to have the same encoding in a document)
+    \tparam Allocator   Allocator type for allocating memory of object, array and string.
+
+    This class implements a Random Access Iterator for GenericMember elements
+    of a GenericValue, see ISO/IEC 14882:2003(E) C++ standard, 24.1 [lib.iterator.requirements].
+
+    \note This iterator implementation is mainly intended to avoid implicit
+        conversions from iterator values to \c NULL,
+        e.g. from GenericValue::FindMember.
+
+    \note Define \c RAPIDJSON_NOMEMBERITERATORCLASS to fall back to a
+        pointer-based implementation, if your platform doesn't provide
+        the C++ <iterator> header.
+
+    \see GenericMember, GenericValue::MemberIterator, GenericValue::ConstMemberIterator
+ */
+template <bool Const, typename Encoding, typename Allocator>
+class GenericMemberIterator {
+
+    friend class GenericValue<Encoding,Allocator>;
+    template <bool, typename, typename> friend class GenericMemberIterator;
+
+    typedef GenericMember<Encoding,Allocator> PlainType;
+    typedef typename internal::MaybeAddConst<Const,PlainType>::Type ValueType;
+
+public:
+    //! Iterator type itself
+    typedef GenericMemberIterator Iterator;
+    //! Constant iterator type
+    typedef GenericMemberIterator<true,Encoding,Allocator>  ConstIterator;
+    //! Non-constant iterator type
+    typedef GenericMemberIterator<false,Encoding,Allocator> NonConstIterator;
+
+    /** \name std::iterator_traits support */
+    //@{
+    typedef ValueType      value_type;
+    typedef ValueType *    pointer;
+    typedef ValueType &    reference;
+    typedef std::ptrdiff_t difference_type;
+    typedef std::random_access_iterator_tag iterator_category;
+    //@}
+
+    //! Pointer to (const) GenericMember
+    typedef pointer         Pointer;
+    //! Reference to (const) GenericMember
+    typedef reference       Reference;
+    //! Signed integer type (e.g. \c ptrdiff_t)
+    typedef difference_type DifferenceType;
+
+    //! Default constructor (singular value)
+    /*! Creates an iterator pointing to no element.
+        \note All operations, except for comparisons, are undefined on such values.
+     */
+    GenericMemberIterator() : ptr_() {}
+
+    //! Iterator conversions to more const
+    /*!
+        \param it (Non-const) iterator to copy from
+
+        Allows the creation of an iterator from another GenericMemberIterator
+        that is "less const".  Especially, creating a non-constant iterator
+        from a constant iterator are disabled:
+        \li const -> non-const (not ok)
+        \li const -> const (ok)
+        \li non-const -> const (ok)
+        \li non-const -> non-const (ok)
+
+        \note If the \c Const template parameter is already \c false, this
+            constructor effectively defines a regular copy-constructor.
+            Otherwise, the copy constructor is implicitly defined.
+    */
+    GenericMemberIterator(const NonConstIterator & it) : ptr_(it.ptr_) {}
+    Iterator& operator=(const NonConstIterator & it) { ptr_ = it.ptr_; return *this; }
+
+    //! @name stepping
+    //@{
+    Iterator& operator++(){ ++ptr_; return *this; }
+    Iterator& operator--(){ --ptr_; return *this; }
+    Iterator  operator++(int){ Iterator old(*this); ++ptr_; return old; }
+    Iterator  operator--(int){ Iterator old(*this); --ptr_; return old; }
+    //@}
+
+    //! @name increment/decrement
+    //@{
+    Iterator operator+(DifferenceType n) const { return Iterator(ptr_+n); }
+    Iterator operator-(DifferenceType n) const { return Iterator(ptr_-n); }
+
+    Iterator& operator+=(DifferenceType n) { ptr_+=n; return *this; }
+    Iterator& operator-=(DifferenceType n) { ptr_-=n; return *this; }
+    //@}
+
+    //! @name relations
+    //@{
+    template <bool Const_> bool operator==(const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ == that.ptr_; }
+    template <bool Const_> bool operator!=(const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ != that.ptr_; }
+    template <bool Const_> bool operator<=(const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ <= that.ptr_; }
+    template <bool Const_> bool operator>=(const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ >= that.ptr_; }
+    template <bool Const_> bool operator< (const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ < that.ptr_; }
+    template <bool Const_> bool operator> (const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ > that.ptr_; }
+
+#ifdef __cpp_lib_three_way_comparison
+    template <bool Const_> std::strong_ordering operator<=>(const GenericMemberIterator<Const_, Encoding, Allocator>& that) const { return ptr_ <=> that.ptr_; }
+#endif
+    //@}
+
+    //! @name dereference
+    //@{
+    Reference operator*() const { return *ptr_; }
+    Pointer   operator->() const { return ptr_; }
+    Reference operator[](DifferenceType n) const { return ptr_[n]; }
+    //@}
+
+    //! Distance
+    DifferenceType operator-(ConstIterator that) const { return ptr_-that.ptr_; }
+
+private:
+    //! Internal constructor from plain pointer
+    explicit GenericMemberIterator(Pointer p) : ptr_(p) {}
+
+    Pointer ptr_; //!< raw pointer
+};
+
+#else // RAPIDJSON_NOMEMBERITERATORCLASS
+
+// class-based member iterator implementation disabled, use plain pointers
+
+template <bool Const, typename Encoding, typename Allocator>
+class GenericMemberIterator;
+
+//! non-const GenericMemberIterator
+template <typename Encoding, typename Allocator>
+class GenericMemberIterator<false,Encoding,Allocator> {
+public:
+    //! use plain pointer as iterator type
+    typedef GenericMember<Encoding,Allocator>* Iterator;
+};
+//! const GenericMemberIterator
+template <typename Encoding, typename Allocator>
+class GenericMemberIterator<true,Encoding,Allocator> {
+public:
+    //! use plain const pointer as iterator type
+    typedef const GenericMember<Encoding,Allocator>* Iterator;
+};
+
+#endif // RAPIDJSON_NOMEMBERITERATORCLASS
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericStringRef
+
+//! Reference to a constant string (not taking a copy)
+/*!
+    \tparam CharType character type of the string
+
+    This helper class is used to automatically infer constant string
+    references for string literals, especially from \c const \b (!)
+    character arrays.
+
+    The main use is for creating JSON string values without copying the
+    source string via an \ref Allocator.  This requires that the referenced
+    string pointers have a sufficient lifetime, which exceeds the lifetime
+    of the associated GenericValue.
+
+    \b Example
+    \code
+    Value v("foo");   // ok, no need to copy & calculate length
+    const char foo[] = "foo";
+    v.SetString(foo); // ok
+
+    const char* bar = foo;
+    // Value x(bar); // not ok, can't rely on bar's lifetime
+    Value x(StringRef(bar)); // lifetime explicitly guaranteed by user
+    Value y(StringRef(bar, 3));  // ok, explicitly pass length
+    \endcode
+
+    \see StringRef, GenericValue::SetString
+*/
+template<typename CharType>
+struct GenericStringRef {
+    typedef CharType Ch; //!< character type of the string
+
+    //! Create string reference from \c const character array
+#ifndef __clang__ // -Wdocumentation
+    /*!
+        This constructor implicitly creates a constant string reference from
+        a \c const character array.  It has better performance than
+        \ref StringRef(const CharType*) by inferring the string \ref length
+        from the array length, and also supports strings containing null
+        characters.
+
+        \tparam N length of the string, automatically inferred
+
+        \param str Constant character array, lifetime assumed to be longer
+            than the use of the string in e.g. a GenericValue
+
+        \post \ref s == str
+
+        \note Constant complexity.
+        \note There is a hidden, private overload to disallow references to
+            non-const character arrays to be created via this constructor.
+            By this, e.g. function-scope arrays used to be filled via
+            \c snprintf are excluded from consideration.
+            In such cases, the referenced string should be \b copied to the
+            GenericValue instead.
+     */
+#endif
+    template<SizeType N>
+    GenericStringRef(const CharType (&str)[N]) RAPIDJSON_NOEXCEPT
+        : s(str), length(N-1) {}
+
+    //! Explicitly create string reference from \c const character pointer
+#ifndef __clang__ // -Wdocumentation
+    /*!
+        This constructor can be used to \b explicitly  create a reference to
+        a constant string pointer.
+
+        \see StringRef(const CharType*)
+
+        \param str Constant character pointer, lifetime assumed to be longer
+            than the use of the string in e.g. a GenericValue
+
+        \post \ref s == str
+
+        \note There is a hidden, private overload to disallow references to
+            non-const character arrays to be created via this constructor.
+            By this, e.g. function-scope arrays used to be filled via
+            \c snprintf are excluded from consideration.
+            In such cases, the referenced string should be \b copied to the
+            GenericValue instead.
+     */
+#endif
+    explicit GenericStringRef(const CharType* str)
+        : s(str), length(NotNullStrLen(str)) {}
+
+    //! Create constant string reference from pointer and length
+#ifndef __clang__ // -Wdocumentation
+    /*! \param str constant string, lifetime assumed to be longer than the use of the string in e.g. a GenericValue
+        \param len length of the string, excluding the trailing NULL terminator
+
+        \post \ref s == str && \ref length == len
+        \note Constant complexity.
+     */
+#endif
+    GenericStringRef(const CharType* str, SizeType len)
+        : s(RAPIDJSON_LIKELY(str) ? str : emptyString), length(len) { RAPIDJSON_ASSERT(str != 0 || len == 0u); }
+
+    GenericStringRef(const GenericStringRef& rhs) : s(rhs.s), length(rhs.length) {}
+
+    //! implicit conversion to plain CharType pointer
+    operator const Ch *() const { return s; }
+
+    const Ch* const s; //!< plain CharType pointer
+    const SizeType length; //!< length of the string (excluding the trailing NULL terminator)
+
+private:
+    SizeType NotNullStrLen(const CharType* str) {
+        RAPIDJSON_ASSERT(str != 0);
+        return internal::StrLen(str);
+    }
+
+    /// Empty string - used when passing in a NULL pointer
+    static const Ch emptyString[];
+
+    //! Disallow construction from non-const array
+    template<SizeType N>
+    GenericStringRef(CharType (&str)[N]) /* = delete */;
+    //! Copy assignment operator not permitted - immutable type
+    GenericStringRef& operator=(const GenericStringRef& rhs) /* = delete */;
+};
+
+template<typename CharType>
+const CharType GenericStringRef<CharType>::emptyString[] = { CharType() };
+
+//! Mark a character pointer as constant string
+/*! Mark a plain character pointer as a "string literal".  This function
+    can be used to avoid copying a character string to be referenced as a
+    value in a JSON GenericValue object, if the string's lifetime is known
+    to be valid long enough.
+    \tparam CharType Character type of the string
+    \param str Constant string, lifetime assumed to be longer than the use of the string in e.g. a GenericValue
+    \return GenericStringRef string reference object
+    \relatesalso GenericStringRef
+
+    \see GenericValue::GenericValue(StringRefType), GenericValue::operator=(StringRefType), GenericValue::SetString(StringRefType), GenericValue::PushBack(StringRefType, Allocator&), GenericValue::AddMember
+*/
+template<typename CharType>
+inline GenericStringRef<CharType> StringRef(const CharType* str) {
+    return GenericStringRef<CharType>(str);
+}
+
+//! Mark a character pointer as constant string
+/*! Mark a plain character pointer as a "string literal".  This function
+    can be used to avoid copying a character string to be referenced as a
+    value in a JSON GenericValue object, if the string's lifetime is known
+    to be valid long enough.
+
+    This version has better performance with supplied length, and also
+    supports string containing null characters.
+
+    \tparam CharType character type of the string
+    \param str Constant string, lifetime assumed to be longer than the use of the string in e.g. a GenericValue
+    \param length The length of source string.
+    \return GenericStringRef string reference object
+    \relatesalso GenericStringRef
+*/
+template<typename CharType>
+inline GenericStringRef<CharType> StringRef(const CharType* str, size_t length) {
+    return GenericStringRef<CharType>(str, SizeType(length));
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+//! Mark a string object as constant string
+/*! Mark a string object (e.g. \c std::string) as a "string literal".
+    This function can be used to avoid copying a string to be referenced as a
+    value in a JSON GenericValue object, if the string's lifetime is known
+    to be valid long enough.
+
+    \tparam CharType character type of the string
+    \param str Constant string, lifetime assumed to be longer than the use of the string in e.g. a GenericValue
+    \return GenericStringRef string reference object
+    \relatesalso GenericStringRef
+    \note Requires the definition of the preprocessor symbol \ref RAPIDJSON_HAS_STDSTRING.
+*/
+template<typename CharType>
+inline GenericStringRef<CharType> StringRef(const std::basic_string<CharType>& str) {
+    return GenericStringRef<CharType>(str.data(), SizeType(str.size()));
+}
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericValue type traits
+namespace internal {
+
+template <typename T, typename Encoding = void, typename Allocator = void>
+struct IsGenericValueImpl : FalseType {};
+
+// select candidates according to nested encoding and allocator types
+template <typename T> struct IsGenericValueImpl<T, typename Void<typename T::EncodingType>::Type, typename Void<typename T::AllocatorType>::Type>
+    : IsBaseOf<GenericValue<typename T::EncodingType, typename T::AllocatorType>, T>::Type {};
+
+// helper to match arbitrary GenericValue instantiations, including derived classes
+template <typename T> struct IsGenericValue : IsGenericValueImpl<T>::Type {};
+
+} // namespace internal
+
+///////////////////////////////////////////////////////////////////////////////
+// TypeHelper
+
+namespace internal {
+
+template <typename ValueType, typename T>
+struct TypeHelper {};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, bool> {
+    static bool Is(const ValueType& v) { return v.IsBool(); }
+    static bool Get(const ValueType& v) { return v.GetBool(); }
+    static ValueType& Set(ValueType& v, bool data) { return v.SetBool(data); }
+    static ValueType& Set(ValueType& v, bool data, typename ValueType::AllocatorType&) { return v.SetBool(data); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, int> {
+    static bool Is(const ValueType& v) { return v.IsInt(); }
+    static int Get(const ValueType& v) { return v.GetInt(); }
+    static ValueType& Set(ValueType& v, int data) { return v.SetInt(data); }
+    static ValueType& Set(ValueType& v, int data, typename ValueType::AllocatorType&) { return v.SetInt(data); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, unsigned> {
+    static bool Is(const ValueType& v) { return v.IsUint(); }
+    static unsigned Get(const ValueType& v) { return v.GetUint(); }
+    static ValueType& Set(ValueType& v, unsigned data) { return v.SetUint(data); }
+    static ValueType& Set(ValueType& v, unsigned data, typename ValueType::AllocatorType&) { return v.SetUint(data); }
+};
+
+#ifdef _MSC_VER
+RAPIDJSON_STATIC_ASSERT(sizeof(long) == sizeof(int));
+template<typename ValueType>
+struct TypeHelper<ValueType, long> {
+    static bool Is(const ValueType& v) { return v.IsInt(); }
+    static long Get(const ValueType& v) { return v.GetInt(); }
+    static ValueType& Set(ValueType& v, long data) { return v.SetInt(data); }
+    static ValueType& Set(ValueType& v, long data, typename ValueType::AllocatorType&) { return v.SetInt(data); }
+};
+
+RAPIDJSON_STATIC_ASSERT(sizeof(unsigned long) == sizeof(unsigned));
+template<typename ValueType>
+struct TypeHelper<ValueType, unsigned long> {
+    static bool Is(const ValueType& v) { return v.IsUint(); }
+    static unsigned long Get(const ValueType& v) { return v.GetUint(); }
+    static ValueType& Set(ValueType& v, unsigned long data) { return v.SetUint(data); }
+    static ValueType& Set(ValueType& v, unsigned long data, typename ValueType::AllocatorType&) { return v.SetUint(data); }
+};
+#endif
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, int64_t> {
+    static bool Is(const ValueType& v) { return v.IsInt64(); }
+    static int64_t Get(const ValueType& v) { return v.GetInt64(); }
+    static ValueType& Set(ValueType& v, int64_t data) { return v.SetInt64(data); }
+    static ValueType& Set(ValueType& v, int64_t data, typename ValueType::AllocatorType&) { return v.SetInt64(data); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, uint64_t> {
+    static bool Is(const ValueType& v) { return v.IsUint64(); }
+    static uint64_t Get(const ValueType& v) { return v.GetUint64(); }
+    static ValueType& Set(ValueType& v, uint64_t data) { return v.SetUint64(data); }
+    static ValueType& Set(ValueType& v, uint64_t data, typename ValueType::AllocatorType&) { return v.SetUint64(data); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, double> {
+    static bool Is(const ValueType& v) { return v.IsDouble(); }
+    static double Get(const ValueType& v) { return v.GetDouble(); }
+    static ValueType& Set(ValueType& v, double data) { return v.SetDouble(data); }
+    static ValueType& Set(ValueType& v, double data, typename ValueType::AllocatorType&) { return v.SetDouble(data); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, float> {
+    static bool Is(const ValueType& v) { return v.IsFloat(); }
+    static float Get(const ValueType& v) { return v.GetFloat(); }
+    static ValueType& Set(ValueType& v, float data) { return v.SetFloat(data); }
+    static ValueType& Set(ValueType& v, float data, typename ValueType::AllocatorType&) { return v.SetFloat(data); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, const typename ValueType::Ch*> {
+    typedef const typename ValueType::Ch* StringType;
+    static bool Is(const ValueType& v) { return v.IsString(); }
+    static StringType Get(const ValueType& v) { return v.GetString(); }
+    static ValueType& Set(ValueType& v, const StringType data) { return v.SetString(typename ValueType::StringRefType(data)); }
+    static ValueType& Set(ValueType& v, const StringType data, typename ValueType::AllocatorType& a) { return v.SetString(data, a); }
+};
+
+#if RAPIDJSON_HAS_STDSTRING
+template<typename ValueType> 
+struct TypeHelper<ValueType, std::basic_string<typename ValueType::Ch> > {
+    typedef std::basic_string<typename ValueType::Ch> StringType;
+    static bool Is(const ValueType& v) { return v.IsString(); }
+    static StringType Get(const ValueType& v) { return StringType(v.GetString(), v.GetStringLength()); }
+    static ValueType& Set(ValueType& v, const StringType& data, typename ValueType::AllocatorType& a) { return v.SetString(data, a); }
+};
+#endif
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, typename ValueType::Array> {
+    typedef typename ValueType::Array ArrayType;
+    static bool Is(const ValueType& v) { return v.IsArray(); }
+    static ArrayType Get(ValueType& v) { return v.GetArray(); }
+    static ValueType& Set(ValueType& v, ArrayType data) { return v = data; }
+    static ValueType& Set(ValueType& v, ArrayType data, typename ValueType::AllocatorType&) { return v = data; }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, typename ValueType::ConstArray> {
+    typedef typename ValueType::ConstArray ArrayType;
+    static bool Is(const ValueType& v) { return v.IsArray(); }
+    static ArrayType Get(const ValueType& v) { return v.GetArray(); }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, typename ValueType::Object> {
+    typedef typename ValueType::Object ObjectType;
+    static bool Is(const ValueType& v) { return v.IsObject(); }
+    static ObjectType Get(ValueType& v) { return v.GetObject(); }
+    static ValueType& Set(ValueType& v, ObjectType data) { return v = data; }
+    static ValueType& Set(ValueType& v, ObjectType data, typename ValueType::AllocatorType&) { return v = data; }
+};
+
+template<typename ValueType> 
+struct TypeHelper<ValueType, typename ValueType::ConstObject> {
+    typedef typename ValueType::ConstObject ObjectType;
+    static bool Is(const ValueType& v) { return v.IsObject(); }
+    static ObjectType Get(const ValueType& v) { return v.GetObject(); }
+};
+
+} // namespace internal
+
+// Forward declarations
+template <bool, typename> class GenericArray;
+template <bool, typename> class GenericObject;
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericValue
+
+//! Represents a JSON value. Use Value for UTF8 encoding and default allocator.
+/*!
+    A JSON value can be one of 7 types. This class is a variant type supporting
+    these types.
+
+    Use the Value if UTF8 and default allocator
+
+    \tparam Encoding    Encoding of the value. (Even non-string values need to have the same encoding in a document)
+    \tparam Allocator   Allocator type for allocating memory of object, array and string.
+*/
+template <typename Encoding, typename Allocator = RAPIDJSON_DEFAULT_ALLOCATOR >
+class GenericValue {
+public:
+    //! Name-value pair in an object.
+    typedef GenericMember<Encoding, Allocator> Member;
+    typedef Encoding EncodingType;                  //!< Encoding type from template parameter.
+    typedef Allocator AllocatorType;                //!< Allocator type from template parameter.
+    typedef typename Encoding::Ch Ch;               //!< Character type derived from Encoding.
+    typedef GenericStringRef<Ch> StringRefType;     //!< Reference to a constant string
+    typedef typename GenericMemberIterator<false,Encoding,Allocator>::Iterator MemberIterator;  //!< Member iterator for iterating in object.
+    typedef typename GenericMemberIterator<true,Encoding,Allocator>::Iterator ConstMemberIterator;  //!< Constant member iterator for iterating in object.
+    typedef GenericValue* ValueIterator;            //!< Value iterator for iterating in array.
+    typedef const GenericValue* ConstValueIterator; //!< Constant value iterator for iterating in array.
+    typedef GenericValue<Encoding, Allocator> ValueType;    //!< Value type of itself.
+    typedef GenericArray<false, ValueType> Array;
+    typedef GenericArray<true, ValueType> ConstArray;
+    typedef GenericObject<false, ValueType> Object;
+    typedef GenericObject<true, ValueType> ConstObject;
+
+    //!@name Constructors and destructor.
+    //@{
+
+    //! Default constructor creates a null value.
+    GenericValue() RAPIDJSON_NOEXCEPT : data_() { data_.f.flags = kNullFlag; }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Move constructor in C++11
+    GenericValue(GenericValue&& rhs) RAPIDJSON_NOEXCEPT : data_(rhs.data_) {
+        rhs.data_.f.flags = kNullFlag; // give up contents
+    }
+#endif
+
+private:
+    //! Copy constructor is not permitted.
+    GenericValue(const GenericValue& rhs);
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Moving from a GenericDocument is not permitted.
+    template <typename StackAllocator>
+    GenericValue(GenericDocument<Encoding,Allocator,StackAllocator>&& rhs);
+
+    //! Move assignment from a GenericDocument is not permitted.
+    template <typename StackAllocator>
+    GenericValue& operator=(GenericDocument<Encoding,Allocator,StackAllocator>&& rhs);
+#endif
+
+public:
+
+    //! Constructor with JSON value type.
+    /*! This creates a Value of specified type with default content.
+        \param type Type of the value.
+        \note Default content for number is zero.
+    */
+    explicit GenericValue(Type type) RAPIDJSON_NOEXCEPT : data_() {
+        static const uint16_t defaultFlags[] = {
+            kNullFlag, kFalseFlag, kTrueFlag, kObjectFlag, kArrayFlag, kShortStringFlag,
+            kNumberAnyFlag
+        };
+        RAPIDJSON_NOEXCEPT_ASSERT(type >= kNullType && type <= kNumberType);
+        data_.f.flags = defaultFlags[type];
+
+        // Use ShortString to store empty string.
+        if (type == kStringType)
+            data_.ss.SetLength(0);
+    }
+
+    //! Explicit copy constructor (with allocator)
+    /*! Creates a copy of a Value by using the given Allocator
+        \tparam SourceAllocator allocator of \c rhs
+        \param rhs Value to copy from (read-only)
+        \param allocator Allocator for allocating copied elements and buffers. Commonly use GenericDocument::GetAllocator().
+        \param copyConstStrings Force copying of constant strings (e.g. referencing an in-situ buffer)
+        \see CopyFrom()
+    */
+    template <typename SourceAllocator>
+    GenericValue(const GenericValue<Encoding,SourceAllocator>& rhs, Allocator& allocator, bool copyConstStrings = false) {
+        switch (rhs.GetType()) {
+        case kObjectType:
+            DoCopyMembers(rhs, allocator, copyConstStrings);
+            break;
+        case kArrayType: {
+                SizeType count = rhs.data_.a.size;
+                GenericValue* le = reinterpret_cast<GenericValue*>(allocator.Malloc(count * sizeof(GenericValue)));
+                const GenericValue<Encoding,SourceAllocator>* re = rhs.GetElementsPointer();
+                for (SizeType i = 0; i < count; i++)
+                    new (&le[i]) GenericValue(re[i], allocator, copyConstStrings);
+                data_.f.flags = kArrayFlag;
+                data_.a.size = data_.a.capacity = count;
+                SetElementsPointer(le);
+            }
+            break;
+        case kStringType:
+            if (rhs.data_.f.flags == kConstStringFlag && !copyConstStrings) {
+                data_.f.flags = rhs.data_.f.flags;
+                data_  = *reinterpret_cast<const Data*>(&rhs.data_);
+            }
+            else
+                SetStringRaw(StringRef(rhs.GetString(), rhs.GetStringLength()), allocator);
+            break;
+        default:
+            data_.f.flags = rhs.data_.f.flags;
+            data_  = *reinterpret_cast<const Data*>(&rhs.data_);
+            break;
+        }
+    }
+
+    //! Constructor for boolean value.
+    /*! \param b Boolean value
+        \note This constructor is limited to \em real boolean values and rejects
+            implicitly converted types like arbitrary pointers.  Use an explicit cast
+            to \c bool, if you want to construct a boolean JSON value in such cases.
+     */
+#ifndef RAPIDJSON_DOXYGEN_RUNNING // hide SFINAE from Doxygen
+    template <typename T>
+    explicit GenericValue(T b, RAPIDJSON_ENABLEIF((internal::IsSame<bool, T>))) RAPIDJSON_NOEXCEPT  // See #472
+#else
+    explicit GenericValue(bool b) RAPIDJSON_NOEXCEPT
+#endif
+        : data_() {
+            // safe-guard against failing SFINAE
+            RAPIDJSON_STATIC_ASSERT((internal::IsSame<bool,T>::Value));
+            data_.f.flags = b ? kTrueFlag : kFalseFlag;
+    }
+
+    //! Constructor for int value.
+    explicit GenericValue(int i) RAPIDJSON_NOEXCEPT : data_() {
+        data_.n.i64 = i;
+        data_.f.flags = (i >= 0) ? (kNumberIntFlag | kUintFlag | kUint64Flag) : kNumberIntFlag;
+    }
+
+    //! Constructor for unsigned value.
+    explicit GenericValue(unsigned u) RAPIDJSON_NOEXCEPT : data_() {
+        data_.n.u64 = u; 
+        data_.f.flags = (u & 0x80000000) ? kNumberUintFlag : (kNumberUintFlag | kIntFlag | kInt64Flag);
+    }
+
+    //! Constructor for int64_t value.
+    explicit GenericValue(int64_t i64) RAPIDJSON_NOEXCEPT : data_() {
+        data_.n.i64 = i64;
+        data_.f.flags = kNumberInt64Flag;
+        if (i64 >= 0) {
+            data_.f.flags |= kNumberUint64Flag;
+            if (!(static_cast<uint64_t>(i64) & RAPIDJSON_UINT64_C2(0xFFFFFFFF, 0x00000000)))
+                data_.f.flags |= kUintFlag;
+            if (!(static_cast<uint64_t>(i64) & RAPIDJSON_UINT64_C2(0xFFFFFFFF, 0x80000000)))
+                data_.f.flags |= kIntFlag;
+        }
+        else if (i64 >= static_cast<int64_t>(RAPIDJSON_UINT64_C2(0xFFFFFFFF, 0x80000000)))
+            data_.f.flags |= kIntFlag;
+    }
+
+    //! Constructor for uint64_t value.
+    explicit GenericValue(uint64_t u64) RAPIDJSON_NOEXCEPT : data_() {
+        data_.n.u64 = u64;
+        data_.f.flags = kNumberUint64Flag;
+        if (!(u64 & RAPIDJSON_UINT64_C2(0x80000000, 0x00000000)))
+            data_.f.flags |= kInt64Flag;
+        if (!(u64 & RAPIDJSON_UINT64_C2(0xFFFFFFFF, 0x00000000)))
+            data_.f.flags |= kUintFlag;
+        if (!(u64 & RAPIDJSON_UINT64_C2(0xFFFFFFFF, 0x80000000)))
+            data_.f.flags |= kIntFlag;
+    }
+
+    //! Constructor for double value.
+    explicit GenericValue(double d) RAPIDJSON_NOEXCEPT : data_() { data_.n.d = d; data_.f.flags = kNumberDoubleFlag; }
+
+    //! Constructor for float value.
+    explicit GenericValue(float f) RAPIDJSON_NOEXCEPT : data_() { data_.n.d = static_cast<double>(f); data_.f.flags = kNumberDoubleFlag; }
+
+    //! Constructor for constant string (i.e. do not make a copy of string)
+    GenericValue(const Ch* s, SizeType length) RAPIDJSON_NOEXCEPT : data_() { SetStringRaw(StringRef(s, length)); }
+
+    //! Constructor for constant string (i.e. do not make a copy of string)
+    explicit GenericValue(StringRefType s) RAPIDJSON_NOEXCEPT : data_() { SetStringRaw(s); }
+
+    //! Constructor for copy-string (i.e. do make a copy of string)
+    GenericValue(const Ch* s, SizeType length, Allocator& allocator) : data_() { SetStringRaw(StringRef(s, length), allocator); }
+
+    //! Constructor for copy-string (i.e. do make a copy of string)
+    GenericValue(const Ch*s, Allocator& allocator) : data_() { SetStringRaw(StringRef(s), allocator); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Constructor for copy-string from a string object (i.e. do make a copy of string)
+    /*! \note Requires the definition of the preprocessor symbol \ref RAPIDJSON_HAS_STDSTRING.
+     */
+    GenericValue(const std::basic_string<Ch>& s, Allocator& allocator) : data_() { SetStringRaw(StringRef(s), allocator); }
+#endif
+
+    //! Constructor for Array.
+    /*!
+        \param a An array obtained by \c GetArray().
+        \note \c Array is always pass-by-value.
+        \note the source array is moved into this value and the sourec array becomes empty.
+    */
+    GenericValue(Array a) RAPIDJSON_NOEXCEPT : data_(a.value_.data_) {
+        a.value_.data_ = Data();
+        a.value_.data_.f.flags = kArrayFlag;
+    }
+
+    //! Constructor for Object.
+    /*!
+        \param o An object obtained by \c GetObject().
+        \note \c Object is always pass-by-value.
+        \note the source object is moved into this value and the sourec object becomes empty.
+    */
+    GenericValue(Object o) RAPIDJSON_NOEXCEPT : data_(o.value_.data_) {
+        o.value_.data_ = Data();
+        o.value_.data_.f.flags = kObjectFlag;
+    }
+
+    //! Destructor.
+    /*! Need to destruct elements of array, members of object, or copy-string.
+    */
+    ~GenericValue() {
+        // With RAPIDJSON_USE_MEMBERSMAP, the maps need to be destroyed to release
+        // their Allocator if it's refcounted (e.g. MemoryPoolAllocator).
+        if (Allocator::kNeedFree || (RAPIDJSON_USE_MEMBERSMAP+0 &&
+                                     internal::IsRefCounted<Allocator>::Value)) {
+            switch(data_.f.flags) {
+            case kArrayFlag:
+                {
+                    GenericValue* e = GetElementsPointer();
+                    for (GenericValue* v = e; v != e + data_.a.size; ++v)
+                        v->~GenericValue();
+                    if (Allocator::kNeedFree) { // Shortcut by Allocator's trait
+                        Allocator::Free(e);
+                    }
+                }
+                break;
+
+            case kObjectFlag:
+                DoFreeMembers();
+                break;
+
+            case kCopyStringFlag:
+                if (Allocator::kNeedFree) { // Shortcut by Allocator's trait
+                    Allocator::Free(const_cast<Ch*>(GetStringPointer()));
+                }
+                break;
+
+            default:
+                break;  // Do nothing for other types.
+            }
+        }
+    }
+
+    //@}
+
+    //!@name Assignment operators
+    //@{
+
+    //! Assignment with move semantics.
+    /*! \param rhs Source of the assignment. It will become a null value after assignment.
+    */
+    GenericValue& operator=(GenericValue& rhs) RAPIDJSON_NOEXCEPT {
+        if (RAPIDJSON_LIKELY(this != &rhs)) {
+            // Can't destroy "this" before assigning "rhs", otherwise "rhs"
+            // could be used after free if it's an sub-Value of "this",
+            // hence the temporary danse.
+            GenericValue temp;
+            temp.RawAssign(rhs);
+            this->~GenericValue();
+            RawAssign(temp);
+        }
+        return *this;
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Move assignment in C++11
+    GenericValue& operator=(GenericValue&& rhs) RAPIDJSON_NOEXCEPT {
+        return *this = rhs.Move();
+    }
+#endif
+
+    //! Assignment of constant string reference (no copy)
+    /*! \param str Constant string reference to be assigned
+        \note This overload is needed to avoid clashes with the generic primitive type assignment overload below.
+        \see GenericStringRef, operator=(T)
+    */
+    GenericValue& operator=(StringRefType str) RAPIDJSON_NOEXCEPT {
+        GenericValue s(str);
+        return *this = s;
+    }
+
+    //! Assignment with primitive types.
+    /*! \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t
+        \param value The value to be assigned.
+
+        \note The source type \c T explicitly disallows all pointer types,
+            especially (\c const) \ref Ch*.  This helps avoiding implicitly
+            referencing character strings with insufficient lifetime, use
+            \ref SetString(const Ch*, Allocator&) (for copying) or
+            \ref StringRef() (to explicitly mark the pointer as constant) instead.
+            All other pointer types would implicitly convert to \c bool,
+            use \ref SetBool() instead.
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::IsPointer<T>), (GenericValue&))
+    operator=(T value) {
+        GenericValue v(value);
+        return *this = v;
+    }
+
+    //! Deep-copy assignment from Value
+    /*! Assigns a \b copy of the Value to the current Value object
+        \tparam SourceAllocator Allocator type of \c rhs
+        \param rhs Value to copy from (read-only)
+        \param allocator Allocator to use for copying
+        \param copyConstStrings Force copying of constant strings (e.g. referencing an in-situ buffer)
+     */
+    template <typename SourceAllocator>
+    GenericValue& CopyFrom(const GenericValue<Encoding, SourceAllocator>& rhs, Allocator& allocator, bool copyConstStrings = false) {
+        RAPIDJSON_ASSERT(static_cast<void*>(this) != static_cast<void const*>(&rhs));
+        this->~GenericValue();
+        new (this) GenericValue(rhs, allocator, copyConstStrings);
+        return *this;
+    }
+
+    //! Exchange the contents of this value with those of other.
+    /*!
+        \param other Another value.
+        \note Constant complexity.
+    */
+    GenericValue& Swap(GenericValue& other) RAPIDJSON_NOEXCEPT {
+        GenericValue temp;
+        temp.RawAssign(*this);
+        RawAssign(other);
+        other.RawAssign(temp);
+        return *this;
+    }
+
+    //! free-standing swap function helper
+    /*!
+        Helper function to enable support for common swap implementation pattern based on \c std::swap:
+        \code
+        void swap(MyClass& a, MyClass& b) {
+            using std::swap;
+            swap(a.value, b.value);
+            // ...
+        }
+        \endcode
+        \see Swap()
+     */
+    friend inline void swap(GenericValue& a, GenericValue& b) RAPIDJSON_NOEXCEPT { a.Swap(b); }
+
+    //! Prepare Value for move semantics
+    /*! \return *this */
+    GenericValue& Move() RAPIDJSON_NOEXCEPT { return *this; }
+    //@}
+
+    //!@name Equal-to and not-equal-to operators
+    //@{
+    //! Equal-to operator
+    /*!
+        \note If an object contains duplicated named member, comparing equality with any object is always \c false.
+        \note Complexity is quadratic in Object's member number and linear for the rest (number of all values in the subtree and total lengths of all strings).
+    */
+    template <typename SourceAllocator>
+    bool operator==(const GenericValue<Encoding, SourceAllocator>& rhs) const {
+        typedef GenericValue<Encoding, SourceAllocator> RhsType;
+        if (GetType() != rhs.GetType())
+            return false;
+
+        switch (GetType()) {
+        case kObjectType: // Warning: O(n^2) inner-loop
+            if (data_.o.size != rhs.data_.o.size)
+                return false;           
+            for (ConstMemberIterator lhsMemberItr = MemberBegin(); lhsMemberItr != MemberEnd(); ++lhsMemberItr) {
+                typename RhsType::ConstMemberIterator rhsMemberItr = rhs.FindMember(lhsMemberItr->name);
+                if (rhsMemberItr == rhs.MemberEnd() || lhsMemberItr->value != rhsMemberItr->value)
+                    return false;
+            }
+            return true;
+            
+        case kArrayType:
+            if (data_.a.size != rhs.data_.a.size)
+                return false;
+            for (SizeType i = 0; i < data_.a.size; i++)
+                if ((*this)[i] != rhs[i])
+                    return false;
+            return true;
+
+        case kStringType:
+            return StringEqual(rhs);
+
+        case kNumberType:
+            if (IsDouble() || rhs.IsDouble()) {
+                double a = GetDouble();     // May convert from integer to double.
+                double b = rhs.GetDouble(); // Ditto
+                return a >= b && a <= b;    // Prevent -Wfloat-equal
+            }
+            else
+                return data_.n.u64 == rhs.data_.n.u64;
+
+        default:
+            return true;
+        }
+    }
+
+    //! Equal-to operator with const C-string pointer
+    bool operator==(const Ch* rhs) const { return *this == GenericValue(StringRef(rhs)); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Equal-to operator with string object
+    /*! \note Requires the definition of the preprocessor symbol \ref RAPIDJSON_HAS_STDSTRING.
+     */
+    bool operator==(const std::basic_string<Ch>& rhs) const { return *this == GenericValue(StringRef(rhs)); }
+#endif
+
+    //! Equal-to operator with primitive types
+    /*! \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t, \c double, \c true, \c false
+    */
+    template <typename T> RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>,internal::IsGenericValue<T> >), (bool)) operator==(const T& rhs) const { return *this == GenericValue(rhs); }
+
+    //! Not-equal-to operator
+    /*! \return !(*this == rhs)
+     */
+    template <typename SourceAllocator>
+    bool operator!=(const GenericValue<Encoding, SourceAllocator>& rhs) const { return !(*this == rhs); }
+
+    //! Not-equal-to operator with const C-string pointer
+    bool operator!=(const Ch* rhs) const { return !(*this == rhs); }
+
+    //! Not-equal-to operator with arbitrary types
+    /*! \return !(*this == rhs)
+     */
+    template <typename T> RAPIDJSON_DISABLEIF_RETURN((internal::IsGenericValue<T>), (bool)) operator!=(const T& rhs) const { return !(*this == rhs); }
+
+#ifndef __cpp_impl_three_way_comparison
+    //! Equal-to operator with arbitrary types (symmetric version)
+    /*! \return (rhs == lhs)
+     */
+    template <typename T> friend RAPIDJSON_DISABLEIF_RETURN((internal::IsGenericValue<T>), (bool)) operator==(const T& lhs, const GenericValue& rhs) { return rhs == lhs; }
+
+    //! Not-Equal-to operator with arbitrary types (symmetric version)
+    /*! \return !(rhs == lhs)
+     */
+    template <typename T> friend RAPIDJSON_DISABLEIF_RETURN((internal::IsGenericValue<T>), (bool)) operator!=(const T& lhs, const GenericValue& rhs) { return !(rhs == lhs); }
+    //@}
+#endif
+
+    //!@name Type
+    //@{
+
+    Type GetType()  const { return static_cast<Type>(data_.f.flags & kTypeMask); }
+    bool IsNull()   const { return data_.f.flags == kNullFlag; }
+    bool IsFalse()  const { return data_.f.flags == kFalseFlag; }
+    bool IsTrue()   const { return data_.f.flags == kTrueFlag; }
+    bool IsBool()   const { return (data_.f.flags & kBoolFlag) != 0; }
+    bool IsObject() const { return data_.f.flags == kObjectFlag; }
+    bool IsArray()  const { return data_.f.flags == kArrayFlag; }
+    bool IsNumber() const { return (data_.f.flags & kNumberFlag) != 0; }
+    bool IsInt()    const { return (data_.f.flags & kIntFlag) != 0; }
+    bool IsUint()   const { return (data_.f.flags & kUintFlag) != 0; }
+    bool IsInt64()  const { return (data_.f.flags & kInt64Flag) != 0; }
+    bool IsUint64() const { return (data_.f.flags & kUint64Flag) != 0; }
+    bool IsDouble() const { return (data_.f.flags & kDoubleFlag) != 0; }
+    bool IsString() const { return (data_.f.flags & kStringFlag) != 0; }
+
+    // Checks whether a number can be losslessly converted to a double.
+    bool IsLosslessDouble() const {
+        if (!IsNumber()) return false;
+        if (IsUint64()) {
+            uint64_t u = GetUint64();
+            volatile double d = static_cast<double>(u);
+            return (d >= 0.0)
+                && (d < static_cast<double>((std::numeric_limits<uint64_t>::max)()))
+                && (u == static_cast<uint64_t>(d));
+        }
+        if (IsInt64()) {
+            int64_t i = GetInt64();
+            volatile double d = static_cast<double>(i);
+            return (d >= static_cast<double>((std::numeric_limits<int64_t>::min)()))
+                && (d < static_cast<double>((std::numeric_limits<int64_t>::max)()))
+                && (i == static_cast<int64_t>(d));
+        }
+        return true; // double, int, uint are always lossless
+    }
+
+    // Checks whether a number is a float (possible lossy).
+    bool IsFloat() const  {
+        if ((data_.f.flags & kDoubleFlag) == 0)
+            return false;
+        double d = GetDouble();
+        return d >= -3.4028234e38 && d <= 3.4028234e38;
+    }
+    // Checks whether a number can be losslessly converted to a float.
+    bool IsLosslessFloat() const {
+        if (!IsNumber()) return false;
+        double a = GetDouble();
+        if (a < static_cast<double>(-(std::numeric_limits<float>::max)())
+                || a > static_cast<double>((std::numeric_limits<float>::max)()))
+            return false;
+        double b = static_cast<double>(static_cast<float>(a));
+        return a >= b && a <= b;    // Prevent -Wfloat-equal
+    }
+
+    //@}
+
+    //!@name Null
+    //@{
+
+    GenericValue& SetNull() { this->~GenericValue(); new (this) GenericValue(); return *this; }
+
+    //@}
+
+    //!@name Bool
+    //@{
+
+    bool GetBool() const { RAPIDJSON_ASSERT(IsBool()); return data_.f.flags == kTrueFlag; }
+    //!< Set boolean value
+    /*! \post IsBool() == true */
+    GenericValue& SetBool(bool b) { this->~GenericValue(); new (this) GenericValue(b); return *this; }
+
+    //@}
+
+    //!@name Object
+    //@{
+
+    //! Set this value as an empty object.
+    /*! \post IsObject() == true */
+    GenericValue& SetObject() { this->~GenericValue(); new (this) GenericValue(kObjectType); return *this; }
+
+    //! Get the number of members in the object.
+    SizeType MemberCount() const { RAPIDJSON_ASSERT(IsObject()); return data_.o.size; }
+
+    //! Get the capacity of object.
+    SizeType MemberCapacity() const { RAPIDJSON_ASSERT(IsObject()); return data_.o.capacity; }
+
+    //! Check whether the object is empty.
+    bool ObjectEmpty() const { RAPIDJSON_ASSERT(IsObject()); return data_.o.size == 0; }
+
+    //! Get a value from an object associated with the name.
+    /*! \pre IsObject() == true
+        \tparam T Either \c Ch or \c const \c Ch (template used for disambiguation with \ref operator[](SizeType))
+        \note In version 0.1x, if the member is not found, this function returns a null value. This makes issue 7.
+        Since 0.2, if the name is not correct, it will assert.
+        If user is unsure whether a member exists, user should use HasMember() first.
+        A better approach is to use FindMember().
+        \note Linear time complexity.
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::NotExpr<internal::IsSame<typename internal::RemoveConst<T>::Type, Ch> >),(GenericValue&)) operator[](T* name) {
+        GenericValue n(StringRef(name));
+        return (*this)[n];
+    }
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::NotExpr<internal::IsSame<typename internal::RemoveConst<T>::Type, Ch> >),(const GenericValue&)) operator[](T* name) const { return const_cast<GenericValue&>(*this)[name]; }
+
+    //! Get a value from an object associated with the name.
+    /*! \pre IsObject() == true
+        \tparam SourceAllocator Allocator of the \c name value
+
+        \note Compared to \ref operator[](T*), this version is faster because it does not need a StrLen().
+        And it can also handle strings with embedded null characters.
+
+        \note Linear time complexity.
+    */
+    template <typename SourceAllocator>
+    GenericValue& operator[](const GenericValue<Encoding, SourceAllocator>& name) {
+        MemberIterator member = FindMember(name);
+        if (member != MemberEnd())
+            return member->value;
+        else {
+            RAPIDJSON_ASSERT(false);    // see above note
+
+#if RAPIDJSON_HAS_CXX11
+            // Use thread-local storage to prevent races between threads.
+            // Use static buffer and placement-new to prevent destruction, with
+            // alignas() to ensure proper alignment.
+            alignas(GenericValue) thread_local static char buffer[sizeof(GenericValue)];
+            return *new (buffer) GenericValue();
+#elif defined(_MSC_VER) && _MSC_VER < 1900
+            // There's no way to solve both thread locality and proper alignment
+            // simultaneously.
+            __declspec(thread) static char buffer[sizeof(GenericValue)];
+            return *new (buffer) GenericValue();
+#elif defined(__GNUC__) || defined(__clang__)
+            // This will generate -Wexit-time-destructors in clang, but that's
+            // better than having under-alignment.
+            __thread static GenericValue buffer;
+            return buffer;
+#else
+            // Don't know what compiler this is, so don't know how to ensure
+            // thread-locality.
+            static GenericValue buffer;
+            return buffer;
+#endif
+        }
+    }
+    template <typename SourceAllocator>
+    const GenericValue& operator[](const GenericValue<Encoding, SourceAllocator>& name) const { return const_cast<GenericValue&>(*this)[name]; }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Get a value from an object associated with name (string object).
+    GenericValue& operator[](const std::basic_string<Ch>& name) { return (*this)[GenericValue(StringRef(name))]; }
+    const GenericValue& operator[](const std::basic_string<Ch>& name) const { return (*this)[GenericValue(StringRef(name))]; }
+#endif
+
+    //! Const member iterator
+    /*! \pre IsObject() == true */
+    ConstMemberIterator MemberBegin() const { RAPIDJSON_ASSERT(IsObject()); return ConstMemberIterator(GetMembersPointer()); }
+    //! Const \em past-the-end member iterator
+    /*! \pre IsObject() == true */
+    ConstMemberIterator MemberEnd() const   { RAPIDJSON_ASSERT(IsObject()); return ConstMemberIterator(GetMembersPointer() + data_.o.size); }
+    //! Member iterator
+    /*! \pre IsObject() == true */
+    MemberIterator MemberBegin()            { RAPIDJSON_ASSERT(IsObject()); return MemberIterator(GetMembersPointer()); }
+    //! \em Past-the-end member iterator
+    /*! \pre IsObject() == true */
+    MemberIterator MemberEnd()              { RAPIDJSON_ASSERT(IsObject()); return MemberIterator(GetMembersPointer() + data_.o.size); }
+
+    //! Request the object to have enough capacity to store members.
+    /*! \param newCapacity  The capacity that the object at least need to have.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \note Linear time complexity.
+    */
+    GenericValue& MemberReserve(SizeType newCapacity, Allocator &allocator) {
+        RAPIDJSON_ASSERT(IsObject());
+        DoReserveMembers(newCapacity, allocator);
+        return *this;
+    }
+
+    //! Check whether a member exists in the object.
+    /*!
+        \param name Member name to be searched.
+        \pre IsObject() == true
+        \return Whether a member with that name exists.
+        \note It is better to use FindMember() directly if you need the obtain the value as well.
+        \note Linear time complexity.
+    */
+    bool HasMember(const Ch* name) const { return FindMember(name) != MemberEnd(); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Check whether a member exists in the object with string object.
+    /*!
+        \param name Member name to be searched.
+        \pre IsObject() == true
+        \return Whether a member with that name exists.
+        \note It is better to use FindMember() directly if you need the obtain the value as well.
+        \note Linear time complexity.
+    */
+    bool HasMember(const std::basic_string<Ch>& name) const { return FindMember(name) != MemberEnd(); }
+#endif
+
+    //! Check whether a member exists in the object with GenericValue name.
+    /*!
+        This version is faster because it does not need a StrLen(). It can also handle string with null character.
+        \param name Member name to be searched.
+        \pre IsObject() == true
+        \return Whether a member with that name exists.
+        \note It is better to use FindMember() directly if you need the obtain the value as well.
+        \note Linear time complexity.
+    */
+    template <typename SourceAllocator>
+    bool HasMember(const GenericValue<Encoding, SourceAllocator>& name) const { return FindMember(name) != MemberEnd(); }
+
+    //! Find member by name.
+    /*!
+        \param name Member name to be searched.
+        \pre IsObject() == true
+        \return Iterator to member, if it exists.
+            Otherwise returns \ref MemberEnd().
+
+        \note Earlier versions of Rapidjson returned a \c NULL pointer, in case
+            the requested member doesn't exist. For consistency with e.g.
+            \c std::map, this has been changed to MemberEnd() now.
+        \note Linear time complexity.
+    */
+    MemberIterator FindMember(const Ch* name) {
+        GenericValue n(StringRef(name));
+        return FindMember(n);
+    }
+
+    ConstMemberIterator FindMember(const Ch* name) const { return const_cast<GenericValue&>(*this).FindMember(name); }
+
+    //! Find member by name.
+    /*!
+        This version is faster because it does not need a StrLen(). It can also handle string with null character.
+        \param name Member name to be searched.
+        \pre IsObject() == true
+        \return Iterator to member, if it exists.
+            Otherwise returns \ref MemberEnd().
+
+        \note Earlier versions of Rapidjson returned a \c NULL pointer, in case
+            the requested member doesn't exist. For consistency with e.g.
+            \c std::map, this has been changed to MemberEnd() now.
+        \note Linear time complexity.
+    */
+    template <typename SourceAllocator>
+    MemberIterator FindMember(const GenericValue<Encoding, SourceAllocator>& name) {
+        RAPIDJSON_ASSERT(IsObject());
+        RAPIDJSON_ASSERT(name.IsString());
+        return DoFindMember(name);
+    }
+    template <typename SourceAllocator> ConstMemberIterator FindMember(const GenericValue<Encoding, SourceAllocator>& name) const { return const_cast<GenericValue&>(*this).FindMember(name); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Find member by string object name.
+    /*!
+        \param name Member name to be searched.
+        \pre IsObject() == true
+        \return Iterator to member, if it exists.
+            Otherwise returns \ref MemberEnd().
+    */
+    MemberIterator FindMember(const std::basic_string<Ch>& name) { return FindMember(GenericValue(StringRef(name))); }
+    ConstMemberIterator FindMember(const std::basic_string<Ch>& name) const { return FindMember(GenericValue(StringRef(name))); }
+#endif
+
+    //! Add a member (name-value pair) to the object.
+    /*! \param name A string value as name of member.
+        \param value Value of any type.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \note The ownership of \c name and \c value will be transferred to this object on success.
+        \pre  IsObject() && name.IsString()
+        \post name.IsNull() && value.IsNull()
+        \note Amortized Constant time complexity.
+    */
+    GenericValue& AddMember(GenericValue& name, GenericValue& value, Allocator& allocator) {
+        RAPIDJSON_ASSERT(IsObject());
+        RAPIDJSON_ASSERT(name.IsString());
+        DoAddMember(name, value, allocator);
+        return *this;
+    }
+
+    //! Add a constant string value as member (name-value pair) to the object.
+    /*! \param name A string value as name of member.
+        \param value constant string reference as value of member.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \pre  IsObject()
+        \note This overload is needed to avoid clashes with the generic primitive type AddMember(GenericValue&,T,Allocator&) overload below.
+        \note Amortized Constant time complexity.
+    */
+    GenericValue& AddMember(GenericValue& name, StringRefType value, Allocator& allocator) {
+        GenericValue v(value);
+        return AddMember(name, v, allocator);
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Add a string object as member (name-value pair) to the object.
+    /*! \param name A string value as name of member.
+        \param value constant string reference as value of member.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \pre  IsObject()
+        \note This overload is needed to avoid clashes with the generic primitive type AddMember(GenericValue&,T,Allocator&) overload below.
+        \note Amortized Constant time complexity.
+    */
+    GenericValue& AddMember(GenericValue& name, std::basic_string<Ch>& value, Allocator& allocator) {
+        GenericValue v(value, allocator);
+        return AddMember(name, v, allocator);
+    }
+#endif
+
+    //! Add any primitive value as member (name-value pair) to the object.
+    /*! \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t
+        \param name A string value as name of member.
+        \param value Value of primitive type \c T as value of member
+        \param allocator Allocator for reallocating memory. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \pre  IsObject()
+
+        \note The source type \c T explicitly disallows all pointer types,
+            especially (\c const) \ref Ch*.  This helps avoiding implicitly
+            referencing character strings with insufficient lifetime, use
+            \ref AddMember(StringRefType, GenericValue&, Allocator&) or \ref
+            AddMember(StringRefType, StringRefType, Allocator&).
+            All other pointer types would implicitly convert to \c bool,
+            use an explicit cast instead, if needed.
+        \note Amortized Constant time complexity.
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (GenericValue&))
+    AddMember(GenericValue& name, T value, Allocator& allocator) {
+        GenericValue v(value);
+        return AddMember(name, v, allocator);
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericValue& AddMember(GenericValue&& name, GenericValue&& value, Allocator& allocator) {
+        return AddMember(name, value, allocator);
+    }
+    GenericValue& AddMember(GenericValue&& name, GenericValue& value, Allocator& allocator) {
+        return AddMember(name, value, allocator);
+    }
+    GenericValue& AddMember(GenericValue& name, GenericValue&& value, Allocator& allocator) {
+        return AddMember(name, value, allocator);
+    }
+    GenericValue& AddMember(StringRefType name, GenericValue&& value, Allocator& allocator) {
+        GenericValue n(name);
+        return AddMember(n, value, allocator);
+    }
+#endif // RAPIDJSON_HAS_CXX11_RVALUE_REFS
+
+
+    //! Add a member (name-value pair) to the object.
+    /*! \param name A constant string reference as name of member.
+        \param value Value of any type.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \note The ownership of \c value will be transferred to this object on success.
+        \pre  IsObject()
+        \post value.IsNull()
+        \note Amortized Constant time complexity.
+    */
+    GenericValue& AddMember(StringRefType name, GenericValue& value, Allocator& allocator) {
+        GenericValue n(name);
+        return AddMember(n, value, allocator);
+    }
+
+    //! Add a constant string value as member (name-value pair) to the object.
+    /*! \param name A constant string reference as name of member.
+        \param value constant string reference as value of member.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \pre  IsObject()
+        \note This overload is needed to avoid clashes with the generic primitive type AddMember(StringRefType,T,Allocator&) overload below.
+        \note Amortized Constant time complexity.
+    */
+    GenericValue& AddMember(StringRefType name, StringRefType value, Allocator& allocator) {
+        GenericValue v(value);
+        return AddMember(name, v, allocator);
+    }
+
+    //! Add any primitive value as member (name-value pair) to the object.
+    /*! \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t
+        \param name A constant string reference as name of member.
+        \param value Value of primitive type \c T as value of member
+        \param allocator Allocator for reallocating memory. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \pre  IsObject()
+
+        \note The source type \c T explicitly disallows all pointer types,
+            especially (\c const) \ref Ch*.  This helps avoiding implicitly
+            referencing character strings with insufficient lifetime, use
+            \ref AddMember(StringRefType, GenericValue&, Allocator&) or \ref
+            AddMember(StringRefType, StringRefType, Allocator&).
+            All other pointer types would implicitly convert to \c bool,
+            use an explicit cast instead, if needed.
+        \note Amortized Constant time complexity.
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (GenericValue&))
+    AddMember(StringRefType name, T value, Allocator& allocator) {
+        GenericValue n(name);
+        return AddMember(n, value, allocator);
+    }
+
+    //! Remove all members in the object.
+    /*! This function do not deallocate memory in the object, i.e. the capacity is unchanged.
+        \note Linear time complexity.
+    */
+    void RemoveAllMembers() {
+        RAPIDJSON_ASSERT(IsObject()); 
+        DoClearMembers();
+    }
+
+    //! Remove a member in object by its name.
+    /*! \param name Name of member to be removed.
+        \return Whether the member existed.
+        \note This function may reorder the object members. Use \ref
+            EraseMember(ConstMemberIterator) if you need to preserve the
+            relative order of the remaining members.
+        \note Linear time complexity.
+    */
+    bool RemoveMember(const Ch* name) {
+        GenericValue n(StringRef(name));
+        return RemoveMember(n);
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    bool RemoveMember(const std::basic_string<Ch>& name) { return RemoveMember(GenericValue(StringRef(name))); }
+#endif
+
+    template <typename SourceAllocator>
+    bool RemoveMember(const GenericValue<Encoding, SourceAllocator>& name) {
+        MemberIterator m = FindMember(name);
+        if (m != MemberEnd()) {
+            RemoveMember(m);
+            return true;
+        }
+        else
+            return false;
+    }
+
+    //! Remove a member in object by iterator.
+    /*! \param m member iterator (obtained by FindMember() or MemberBegin()).
+        \return the new iterator after removal.
+        \note This function may reorder the object members. Use \ref
+            EraseMember(ConstMemberIterator) if you need to preserve the
+            relative order of the remaining members.
+        \note Constant time complexity.
+    */
+    MemberIterator RemoveMember(MemberIterator m) {
+        RAPIDJSON_ASSERT(IsObject());
+        RAPIDJSON_ASSERT(data_.o.size > 0);
+        RAPIDJSON_ASSERT(GetMembersPointer() != 0);
+        RAPIDJSON_ASSERT(m >= MemberBegin() && m < MemberEnd());
+        return DoRemoveMember(m);
+    }
+
+    //! Remove a member from an object by iterator.
+    /*! \param pos iterator to the member to remove
+        \pre IsObject() == true && \ref MemberBegin() <= \c pos < \ref MemberEnd()
+        \return Iterator following the removed element.
+            If the iterator \c pos refers to the last element, the \ref MemberEnd() iterator is returned.
+        \note This function preserves the relative order of the remaining object
+            members. If you do not need this, use the more efficient \ref RemoveMember(MemberIterator).
+        \note Linear time complexity.
+    */
+    MemberIterator EraseMember(ConstMemberIterator pos) {
+        return EraseMember(pos, pos +1);
+    }
+
+    //! Remove members in the range [first, last) from an object.
+    /*! \param first iterator to the first member to remove
+        \param last  iterator following the last member to remove
+        \pre IsObject() == true && \ref MemberBegin() <= \c first <= \c last <= \ref MemberEnd()
+        \return Iterator following the last removed element.
+        \note This function preserves the relative order of the remaining object
+            members.
+        \note Linear time complexity.
+    */
+    MemberIterator EraseMember(ConstMemberIterator first, ConstMemberIterator last) {
+        RAPIDJSON_ASSERT(IsObject());
+        RAPIDJSON_ASSERT(data_.o.size > 0);
+        RAPIDJSON_ASSERT(GetMembersPointer() != 0);
+        RAPIDJSON_ASSERT(first >= MemberBegin());
+        RAPIDJSON_ASSERT(first <= last);
+        RAPIDJSON_ASSERT(last <= MemberEnd());
+        return DoEraseMembers(first, last);
+    }
+
+    //! Erase a member in object by its name.
+    /*! \param name Name of member to be removed.
+        \return Whether the member existed.
+        \note Linear time complexity.
+    */
+    bool EraseMember(const Ch* name) {
+        GenericValue n(StringRef(name));
+        return EraseMember(n);
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    bool EraseMember(const std::basic_string<Ch>& name) { return EraseMember(GenericValue(StringRef(name))); }
+#endif
+
+    template <typename SourceAllocator>
+    bool EraseMember(const GenericValue<Encoding, SourceAllocator>& name) {
+        MemberIterator m = FindMember(name);
+        if (m != MemberEnd()) {
+            EraseMember(m);
+            return true;
+        }
+        else
+            return false;
+    }
+
+    Object GetObject() { RAPIDJSON_ASSERT(IsObject()); return Object(*this); }
+    Object GetObj() { RAPIDJSON_ASSERT(IsObject()); return Object(*this); }
+    ConstObject GetObject() const { RAPIDJSON_ASSERT(IsObject()); return ConstObject(*this); }
+    ConstObject GetObj() const { RAPIDJSON_ASSERT(IsObject()); return ConstObject(*this); }
+
+    //@}
+
+    //!@name Array
+    //@{
+
+    //! Set this value as an empty array.
+    /*! \post IsArray == true */
+    GenericValue& SetArray() { this->~GenericValue(); new (this) GenericValue(kArrayType); return *this; }
+
+    //! Get the number of elements in array.
+    SizeType Size() const { RAPIDJSON_ASSERT(IsArray()); return data_.a.size; }
+
+    //! Get the capacity of array.
+    SizeType Capacity() const { RAPIDJSON_ASSERT(IsArray()); return data_.a.capacity; }
+
+    //! Check whether the array is empty.
+    bool Empty() const { RAPIDJSON_ASSERT(IsArray()); return data_.a.size == 0; }
+
+    //! Remove all elements in the array.
+    /*! This function do not deallocate memory in the array, i.e. the capacity is unchanged.
+        \note Linear time complexity.
+    */
+    void Clear() {
+        RAPIDJSON_ASSERT(IsArray()); 
+        GenericValue* e = GetElementsPointer();
+        for (GenericValue* v = e; v != e + data_.a.size; ++v)
+            v->~GenericValue();
+        data_.a.size = 0;
+    }
+
+    //! Get an element from array by index.
+    /*! \pre IsArray() == true
+        \param index Zero-based index of element.
+        \see operator[](T*)
+    */
+    GenericValue& operator[](SizeType index) {
+        RAPIDJSON_ASSERT(IsArray());
+        RAPIDJSON_ASSERT(index < data_.a.size);
+        return GetElementsPointer()[index];
+    }
+    const GenericValue& operator[](SizeType index) const { return const_cast<GenericValue&>(*this)[index]; }
+
+    //! Element iterator
+    /*! \pre IsArray() == true */
+    ValueIterator Begin() { RAPIDJSON_ASSERT(IsArray()); return GetElementsPointer(); }
+    //! \em Past-the-end element iterator
+    /*! \pre IsArray() == true */
+    ValueIterator End() { RAPIDJSON_ASSERT(IsArray()); return GetElementsPointer() + data_.a.size; }
+    //! Constant element iterator
+    /*! \pre IsArray() == true */
+    ConstValueIterator Begin() const { return const_cast<GenericValue&>(*this).Begin(); }
+    //! Constant \em past-the-end element iterator
+    /*! \pre IsArray() == true */
+    ConstValueIterator End() const { return const_cast<GenericValue&>(*this).End(); }
+
+    //! Request the array to have enough capacity to store elements.
+    /*! \param newCapacity  The capacity that the array at least need to have.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \note Linear time complexity.
+    */
+    GenericValue& Reserve(SizeType newCapacity, Allocator &allocator) {
+        RAPIDJSON_ASSERT(IsArray());
+        if (newCapacity > data_.a.capacity) {
+            SetElementsPointer(reinterpret_cast<GenericValue*>(allocator.Realloc(GetElementsPointer(), data_.a.capacity * sizeof(GenericValue), newCapacity * sizeof(GenericValue))));
+            data_.a.capacity = newCapacity;
+        }
+        return *this;
+    }
+
+    //! Append a GenericValue at the end of the array.
+    /*! \param value        Value to be appended.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \pre IsArray() == true
+        \post value.IsNull() == true
+        \return The value itself for fluent API.
+        \note The ownership of \c value will be transferred to this array on success.
+        \note If the number of elements to be appended is known, calls Reserve() once first may be more efficient.
+        \note Amortized constant time complexity.
+    */
+    GenericValue& PushBack(GenericValue& value, Allocator& allocator) {
+        RAPIDJSON_ASSERT(IsArray());
+        if (data_.a.size >= data_.a.capacity)
+            Reserve(data_.a.capacity == 0 ? kDefaultArrayCapacity : (data_.a.capacity + (data_.a.capacity + 1) / 2), allocator);
+        GetElementsPointer()[data_.a.size++].RawAssign(value);
+        return *this;
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericValue& PushBack(GenericValue&& value, Allocator& allocator) {
+        return PushBack(value, allocator);
+    }
+#endif // RAPIDJSON_HAS_CXX11_RVALUE_REFS
+
+    //! Append a constant string reference at the end of the array.
+    /*! \param value        Constant string reference to be appended.
+        \param allocator    Allocator for reallocating memory. It must be the same one used previously. Commonly use GenericDocument::GetAllocator().
+        \pre IsArray() == true
+        \return The value itself for fluent API.
+        \note If the number of elements to be appended is known, calls Reserve() once first may be more efficient.
+        \note Amortized constant time complexity.
+        \see GenericStringRef
+    */
+    GenericValue& PushBack(StringRefType value, Allocator& allocator) {
+        return (*this).template PushBack<StringRefType>(value, allocator);
+    }
+
+    //! Append a primitive value at the end of the array.
+    /*! \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t
+        \param value Value of primitive type T to be appended.
+        \param allocator    Allocator for reallocating memory. It must be the same one as used before. Commonly use GenericDocument::GetAllocator().
+        \pre IsArray() == true
+        \return The value itself for fluent API.
+        \note If the number of elements to be appended is known, calls Reserve() once first may be more efficient.
+
+        \note The source type \c T explicitly disallows all pointer types,
+            especially (\c const) \ref Ch*.  This helps avoiding implicitly
+            referencing character strings with insufficient lifetime, use
+            \ref PushBack(GenericValue&, Allocator&) or \ref
+            PushBack(StringRefType, Allocator&).
+            All other pointer types would implicitly convert to \c bool,
+            use an explicit cast instead, if needed.
+        \note Amortized constant time complexity.
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (GenericValue&))
+    PushBack(T value, Allocator& allocator) {
+        GenericValue v(value);
+        return PushBack(v, allocator);
+    }
+
+    //! Remove the last element in the array.
+    /*!
+        \note Constant time complexity.
+    */
+    GenericValue& PopBack() {
+        RAPIDJSON_ASSERT(IsArray());
+        RAPIDJSON_ASSERT(!Empty());
+        GetElementsPointer()[--data_.a.size].~GenericValue();
+        return *this;
+    }
+
+    //! Remove an element of array by iterator.
+    /*!
+        \param pos iterator to the element to remove
+        \pre IsArray() == true && \ref Begin() <= \c pos < \ref End()
+        \return Iterator following the removed element. If the iterator pos refers to the last element, the End() iterator is returned.
+        \note Linear time complexity.
+    */
+    ValueIterator Erase(ConstValueIterator pos) {
+        return Erase(pos, pos + 1);
+    }
+
+    //! Remove elements in the range [first, last) of the array.
+    /*!
+        \param first iterator to the first element to remove
+        \param last  iterator following the last element to remove
+        \pre IsArray() == true && \ref Begin() <= \c first <= \c last <= \ref End()
+        \return Iterator following the last removed element.
+        \note Linear time complexity.
+    */
+    ValueIterator Erase(ConstValueIterator first, ConstValueIterator last) {
+        RAPIDJSON_ASSERT(IsArray());
+        RAPIDJSON_ASSERT(data_.a.size > 0);
+        RAPIDJSON_ASSERT(GetElementsPointer() != 0);
+        RAPIDJSON_ASSERT(first >= Begin());
+        RAPIDJSON_ASSERT(first <= last);
+        RAPIDJSON_ASSERT(last <= End());
+        ValueIterator pos = Begin() + (first - Begin());
+        for (ValueIterator itr = pos; itr != last; ++itr)
+            itr->~GenericValue();
+        std::memmove(static_cast<void*>(pos), last, static_cast<size_t>(End() - last) * sizeof(GenericValue));
+        data_.a.size -= static_cast<SizeType>(last - first);
+        return pos;
+    }
+
+    Array GetArray() { RAPIDJSON_ASSERT(IsArray()); return Array(*this); }
+    ConstArray GetArray() const { RAPIDJSON_ASSERT(IsArray()); return ConstArray(*this); }
+
+    //@}
+
+    //!@name Number
+    //@{
+
+    int GetInt() const          { RAPIDJSON_ASSERT(data_.f.flags & kIntFlag);   return data_.n.i.i;   }
+    unsigned GetUint() const    { RAPIDJSON_ASSERT(data_.f.flags & kUintFlag);  return data_.n.u.u;   }
+    int64_t GetInt64() const    { RAPIDJSON_ASSERT(data_.f.flags & kInt64Flag); return data_.n.i64; }
+    uint64_t GetUint64() const  { RAPIDJSON_ASSERT(data_.f.flags & kUint64Flag); return data_.n.u64; }
+
+    //! Get the value as double type.
+    /*! \note If the value is 64-bit integer type, it may lose precision. Use \c IsLosslessDouble() to check whether the converison is lossless.
+    */
+    double GetDouble() const {
+        RAPIDJSON_ASSERT(IsNumber());
+        if ((data_.f.flags & kDoubleFlag) != 0)                return data_.n.d;   // exact type, no conversion.
+        if ((data_.f.flags & kIntFlag) != 0)                   return data_.n.i.i; // int -> double
+        if ((data_.f.flags & kUintFlag) != 0)                  return data_.n.u.u; // unsigned -> double
+        if ((data_.f.flags & kInt64Flag) != 0)                 return static_cast<double>(data_.n.i64); // int64_t -> double (may lose precision)
+        RAPIDJSON_ASSERT((data_.f.flags & kUint64Flag) != 0);  return static_cast<double>(data_.n.u64); // uint64_t -> double (may lose precision)
+    }
+
+    //! Get the value as float type.
+    /*! \note If the value is 64-bit integer type, it may lose precision. Use \c IsLosslessFloat() to check whether the converison is lossless.
+    */
+    float GetFloat() const {
+        return static_cast<float>(GetDouble());
+    }
+
+    GenericValue& SetInt(int i)             { this->~GenericValue(); new (this) GenericValue(i);    return *this; }
+    GenericValue& SetUint(unsigned u)       { this->~GenericValue(); new (this) GenericValue(u);    return *this; }
+    GenericValue& SetInt64(int64_t i64)     { this->~GenericValue(); new (this) GenericValue(i64);  return *this; }
+    GenericValue& SetUint64(uint64_t u64)   { this->~GenericValue(); new (this) GenericValue(u64);  return *this; }
+    GenericValue& SetDouble(double d)       { this->~GenericValue(); new (this) GenericValue(d);    return *this; }
+    GenericValue& SetFloat(float f)         { this->~GenericValue(); new (this) GenericValue(static_cast<double>(f)); return *this; }
+
+    //@}
+
+    //!@name String
+    //@{
+
+    const Ch* GetString() const { RAPIDJSON_ASSERT(IsString()); return DataString(data_); }
+
+    //! Get the length of string.
+    /*! Since rapidjson permits "\\u0000" in the json string, strlen(v.GetString()) may not equal to v.GetStringLength().
+    */
+    SizeType GetStringLength() const { RAPIDJSON_ASSERT(IsString()); return DataStringLength(data_); }
+
+    //! Set this value as a string without copying source string.
+    /*! This version has better performance with supplied length, and also support string containing null character.
+        \param s source string pointer. 
+        \param length The length of source string, excluding the trailing null terminator.
+        \return The value itself for fluent API.
+        \post IsString() == true && GetString() == s && GetStringLength() == length
+        \see SetString(StringRefType)
+    */
+    GenericValue& SetString(const Ch* s, SizeType length) { return SetString(StringRef(s, length)); }
+
+    //! Set this value as a string without copying source string.
+    /*! \param s source string reference
+        \return The value itself for fluent API.
+        \post IsString() == true && GetString() == s && GetStringLength() == s.length
+    */
+    GenericValue& SetString(StringRefType s) { this->~GenericValue(); SetStringRaw(s); return *this; }
+
+    //! Set this value as a string by copying from source string.
+    /*! This version has better performance with supplied length, and also support string containing null character.
+        \param s source string. 
+        \param length The length of source string, excluding the trailing null terminator.
+        \param allocator Allocator for allocating copied buffer. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \post IsString() == true && GetString() != s && strcmp(GetString(),s) == 0 && GetStringLength() == length
+    */
+    GenericValue& SetString(const Ch* s, SizeType length, Allocator& allocator) { return SetString(StringRef(s, length), allocator); }
+
+    //! Set this value as a string by copying from source string.
+    /*! \param s source string. 
+        \param allocator Allocator for allocating copied buffer. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \post IsString() == true && GetString() != s && strcmp(GetString(),s) == 0 && GetStringLength() == length
+    */
+    GenericValue& SetString(const Ch* s, Allocator& allocator) { return SetString(StringRef(s), allocator); }
+
+    //! Set this value as a string by copying from source string.
+    /*! \param s source string reference
+        \param allocator Allocator for allocating copied buffer. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \post IsString() == true && GetString() != s.s && strcmp(GetString(),s) == 0 && GetStringLength() == length
+    */
+    GenericValue& SetString(StringRefType s, Allocator& allocator) { this->~GenericValue(); SetStringRaw(s, allocator); return *this; }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Set this value as a string by copying from source string.
+    /*! \param s source string.
+        \param allocator Allocator for allocating copied buffer. Commonly use GenericDocument::GetAllocator().
+        \return The value itself for fluent API.
+        \post IsString() == true && GetString() != s.data() && strcmp(GetString(),s.data() == 0 && GetStringLength() == s.size()
+        \note Requires the definition of the preprocessor symbol \ref RAPIDJSON_HAS_STDSTRING.
+    */
+    GenericValue& SetString(const std::basic_string<Ch>& s, Allocator& allocator) { return SetString(StringRef(s), allocator); }
+#endif
+
+    //@}
+
+    //!@name Array
+    //@{
+
+    //! Templated version for checking whether this value is type T.
+    /*!
+        \tparam T Either \c bool, \c int, \c unsigned, \c int64_t, \c uint64_t, \c double, \c float, \c const \c char*, \c std::basic_string<Ch>
+    */
+    template <typename T>
+    bool Is() const { return internal::TypeHelper<ValueType, T>::Is(*this); }
+
+    template <typename T>
+    T Get() const { return internal::TypeHelper<ValueType, T>::Get(*this); }
+
+    template <typename T>
+    T Get() { return internal::TypeHelper<ValueType, T>::Get(*this); }
+
+    template<typename T>
+    ValueType& Set(const T& data) { return internal::TypeHelper<ValueType, T>::Set(*this, data); }
+
+    template<typename T>
+    ValueType& Set(const T& data, AllocatorType& allocator) { return internal::TypeHelper<ValueType, T>::Set(*this, data, allocator); }
+
+    //@}
+
+    //! Generate events of this value to a Handler.
+    /*! This function adopts the GoF visitor pattern.
+        Typical usage is to output this JSON value as JSON text via Writer, which is a Handler.
+        It can also be used to deep clone this value via GenericDocument, which is also a Handler.
+        \tparam Handler type of handler.
+        \param handler An object implementing concept Handler.
+    */
+    template <typename Handler>
+    bool Accept(Handler& handler) const {
+        switch(GetType()) {
+        case kNullType:     return handler.Null();
+        case kFalseType:    return handler.Bool(false);
+        case kTrueType:     return handler.Bool(true);
+
+        case kObjectType:
+            if (RAPIDJSON_UNLIKELY(!handler.StartObject()))
+                return false;
+            for (ConstMemberIterator m = MemberBegin(); m != MemberEnd(); ++m) {
+                RAPIDJSON_ASSERT(m->name.IsString()); // User may change the type of name by MemberIterator.
+                if (RAPIDJSON_UNLIKELY(!handler.Key(m->name.GetString(), m->name.GetStringLength(), (m->name.data_.f.flags & kCopyFlag) != 0)))
+                    return false;
+                if (RAPIDJSON_UNLIKELY(!m->value.Accept(handler)))
+                    return false;
+            }
+            return handler.EndObject(data_.o.size);
+
+        case kArrayType:
+            if (RAPIDJSON_UNLIKELY(!handler.StartArray()))
+                return false;
+            for (ConstValueIterator v = Begin(); v != End(); ++v)
+                if (RAPIDJSON_UNLIKELY(!v->Accept(handler)))
+                    return false;
+            return handler.EndArray(data_.a.size);
+    
+        case kStringType:
+            return handler.String(GetString(), GetStringLength(), (data_.f.flags & kCopyFlag) != 0);
+    
+        default:
+            RAPIDJSON_ASSERT(GetType() == kNumberType);
+            if (IsDouble())         return handler.Double(data_.n.d);
+            else if (IsInt())       return handler.Int(data_.n.i.i);
+            else if (IsUint())      return handler.Uint(data_.n.u.u);
+            else if (IsInt64())     return handler.Int64(data_.n.i64);
+            else                    return handler.Uint64(data_.n.u64);
+        }
+    }
+
+private:
+    template <typename, typename> friend class GenericValue;
+    template <typename, typename, typename> friend class GenericDocument;
+
+    enum {
+        kBoolFlag       = 0x0008,
+        kNumberFlag     = 0x0010,
+        kIntFlag        = 0x0020,
+        kUintFlag       = 0x0040,
+        kInt64Flag      = 0x0080,
+        kUint64Flag     = 0x0100,
+        kDoubleFlag     = 0x0200,
+        kStringFlag     = 0x0400,
+        kCopyFlag       = 0x0800,
+        kInlineStrFlag  = 0x1000,
+
+        // Initial flags of different types.
+        kNullFlag = kNullType,
+        // These casts are added to suppress the warning on MSVC about bitwise operations between enums of different types.
+        kTrueFlag = static_cast<int>(kTrueType) | static_cast<int>(kBoolFlag),
+        kFalseFlag = static_cast<int>(kFalseType) | static_cast<int>(kBoolFlag),
+        kNumberIntFlag = static_cast<int>(kNumberType) | static_cast<int>(kNumberFlag | kIntFlag | kInt64Flag),
+        kNumberUintFlag = static_cast<int>(kNumberType) | static_cast<int>(kNumberFlag | kUintFlag | kUint64Flag | kInt64Flag),
+        kNumberInt64Flag = static_cast<int>(kNumberType) | static_cast<int>(kNumberFlag | kInt64Flag),
+        kNumberUint64Flag = static_cast<int>(kNumberType) | static_cast<int>(kNumberFlag | kUint64Flag),
+        kNumberDoubleFlag = static_cast<int>(kNumberType) | static_cast<int>(kNumberFlag | kDoubleFlag),
+        kNumberAnyFlag = static_cast<int>(kNumberType) | static_cast<int>(kNumberFlag | kIntFlag | kInt64Flag | kUintFlag | kUint64Flag | kDoubleFlag),
+        kConstStringFlag = static_cast<int>(kStringType) | static_cast<int>(kStringFlag),
+        kCopyStringFlag = static_cast<int>(kStringType) | static_cast<int>(kStringFlag | kCopyFlag),
+        kShortStringFlag = static_cast<int>(kStringType) | static_cast<int>(kStringFlag | kCopyFlag | kInlineStrFlag),
+        kObjectFlag = kObjectType,
+        kArrayFlag = kArrayType,
+
+        kTypeMask = 0x07
+    };
+
+    static const SizeType kDefaultArrayCapacity = RAPIDJSON_VALUE_DEFAULT_ARRAY_CAPACITY;
+    static const SizeType kDefaultObjectCapacity = RAPIDJSON_VALUE_DEFAULT_OBJECT_CAPACITY;
+
+    struct Flag {
+#if RAPIDJSON_48BITPOINTER_OPTIMIZATION
+        char payload[sizeof(SizeType) * 2 + 6];     // 2 x SizeType + lower 48-bit pointer
+#elif RAPIDJSON_64BIT
+        char payload[sizeof(SizeType) * 2 + sizeof(void*) + 6]; // 6 padding bytes
+#else
+        char payload[sizeof(SizeType) * 2 + sizeof(void*) + 2]; // 2 padding bytes
+#endif
+        uint16_t flags;
+    };
+
+    struct String {
+        SizeType length;
+        SizeType hashcode;  //!< reserved
+        const Ch* str;
+    };  // 12 bytes in 32-bit mode, 16 bytes in 64-bit mode
+
+    // implementation detail: ShortString can represent zero-terminated strings up to MaxSize chars
+    // (excluding the terminating zero) and store a value to determine the length of the contained
+    // string in the last character str[LenPos] by storing "MaxSize - length" there. If the string
+    // to store has the maximal length of MaxSize then str[LenPos] will be 0 and therefore act as
+    // the string terminator as well. For getting the string length back from that value just use
+    // "MaxSize - str[LenPos]".
+    // This allows to store 13-chars strings in 32-bit mode, 21-chars strings in 64-bit mode,
+    // 13-chars strings for RAPIDJSON_48BITPOINTER_OPTIMIZATION=1 inline (for `UTF8`-encoded strings).
+    struct ShortString {
+        enum { MaxChars = sizeof(static_cast<Flag*>(0)->payload) / sizeof(Ch), MaxSize = MaxChars - 1, LenPos = MaxSize };
+        Ch str[MaxChars];
+
+        inline static bool Usable(SizeType len) { return                       (MaxSize >= len); }
+        inline void     SetLength(SizeType len) { str[LenPos] = static_cast<Ch>(MaxSize -  len); }
+        inline SizeType GetLength() const       { return  static_cast<SizeType>(MaxSize -  str[LenPos]); }
+    };  // at most as many bytes as "String" above => 12 bytes in 32-bit mode, 16 bytes in 64-bit mode
+
+    // By using proper binary layout, retrieval of different integer types do not need conversions.
+    union Number {
+#if RAPIDJSON_ENDIAN == RAPIDJSON_LITTLEENDIAN
+        struct I {
+            int i;
+            char padding[4];
+        }i;
+        struct U {
+            unsigned u;
+            char padding2[4];
+        }u;
+#else
+        struct I {
+            char padding[4];
+            int i;
+        }i;
+        struct U {
+            char padding2[4];
+            unsigned u;
+        }u;
+#endif
+        int64_t i64;
+        uint64_t u64;
+        double d;
+    };  // 8 bytes
+
+    struct ObjectData {
+        SizeType size;
+        SizeType capacity;
+        Member* members;
+    };  // 12 bytes in 32-bit mode, 16 bytes in 64-bit mode
+
+    struct ArrayData {
+        SizeType size;
+        SizeType capacity;
+        GenericValue* elements;
+    };  // 12 bytes in 32-bit mode, 16 bytes in 64-bit mode
+
+    union Data {
+        String s;
+        ShortString ss;
+        Number n;
+        ObjectData o;
+        ArrayData a;
+        Flag f;
+    };  // 16 bytes in 32-bit mode, 24 bytes in 64-bit mode, 16 bytes in 64-bit with RAPIDJSON_48BITPOINTER_OPTIMIZATION
+
+    static RAPIDJSON_FORCEINLINE const Ch* DataString(const Data& data) {
+        return (data.f.flags & kInlineStrFlag) ? data.ss.str : RAPIDJSON_GETPOINTER(Ch, data.s.str);
+    }
+    static RAPIDJSON_FORCEINLINE SizeType DataStringLength(const Data& data) {
+        return (data.f.flags & kInlineStrFlag) ? data.ss.GetLength() : data.s.length;
+    }
+
+    RAPIDJSON_FORCEINLINE const Ch* GetStringPointer() const { return RAPIDJSON_GETPOINTER(Ch, data_.s.str); }
+    RAPIDJSON_FORCEINLINE const Ch* SetStringPointer(const Ch* str) { return RAPIDJSON_SETPOINTER(Ch, data_.s.str, str); }
+    RAPIDJSON_FORCEINLINE GenericValue* GetElementsPointer() const { return RAPIDJSON_GETPOINTER(GenericValue, data_.a.elements); }
+    RAPIDJSON_FORCEINLINE GenericValue* SetElementsPointer(GenericValue* elements) { return RAPIDJSON_SETPOINTER(GenericValue, data_.a.elements, elements); }
+    RAPIDJSON_FORCEINLINE Member* GetMembersPointer() const { return RAPIDJSON_GETPOINTER(Member, data_.o.members); }
+    RAPIDJSON_FORCEINLINE Member* SetMembersPointer(Member* members) { return RAPIDJSON_SETPOINTER(Member, data_.o.members, members); }
+
+#if RAPIDJSON_USE_MEMBERSMAP
+
+    struct MapTraits {
+        struct Less {
+            bool operator()(const Data& s1, const Data& s2) const {
+                SizeType n1 = DataStringLength(s1), n2 = DataStringLength(s2);
+                int cmp = std::memcmp(DataString(s1), DataString(s2), sizeof(Ch) * (n1 < n2 ? n1 : n2));
+                return cmp < 0 || (cmp == 0 && n1 < n2);
+            }
+        };
+        typedef std::pair<const Data, SizeType> Pair;
+        typedef std::multimap<Data, SizeType, Less, StdAllocator<Pair, Allocator> > Map;
+        typedef typename Map::iterator Iterator;
+    };
+    typedef typename MapTraits::Map         Map;
+    typedef typename MapTraits::Less        MapLess;
+    typedef typename MapTraits::Pair        MapPair;
+    typedef typename MapTraits::Iterator    MapIterator;
+
+    //
+    // Layout of the members' map/array, re(al)located according to the needed capacity:
+    //
+    //    {Map*}<>{capacity}<>{Member[capacity]}<>{MapIterator[capacity]}
+    //
+    // (where <> stands for the RAPIDJSON_ALIGN-ment, if needed)
+    //
+
+    static RAPIDJSON_FORCEINLINE size_t GetMapLayoutSize(SizeType capacity) {
+        return RAPIDJSON_ALIGN(sizeof(Map*)) +
+               RAPIDJSON_ALIGN(sizeof(SizeType)) +
+               RAPIDJSON_ALIGN(capacity * sizeof(Member)) +
+               capacity * sizeof(MapIterator);
+    }
+
+    static RAPIDJSON_FORCEINLINE SizeType &GetMapCapacity(Map* &map) {
+        return *reinterpret_cast<SizeType*>(reinterpret_cast<uintptr_t>(&map) +
+                                            RAPIDJSON_ALIGN(sizeof(Map*)));
+    }
+
+    static RAPIDJSON_FORCEINLINE Member* GetMapMembers(Map* &map) {
+        return reinterpret_cast<Member*>(reinterpret_cast<uintptr_t>(&map) +
+                                         RAPIDJSON_ALIGN(sizeof(Map*)) +
+                                         RAPIDJSON_ALIGN(sizeof(SizeType)));
+    }
+
+    static RAPIDJSON_FORCEINLINE MapIterator* GetMapIterators(Map* &map) {
+        return reinterpret_cast<MapIterator*>(reinterpret_cast<uintptr_t>(&map) +
+                                              RAPIDJSON_ALIGN(sizeof(Map*)) +
+                                              RAPIDJSON_ALIGN(sizeof(SizeType)) +
+                                              RAPIDJSON_ALIGN(GetMapCapacity(map) * sizeof(Member)));
+    }
+
+    static RAPIDJSON_FORCEINLINE Map* &GetMap(Member* members) {
+        RAPIDJSON_ASSERT(members != 0);
+        return *reinterpret_cast<Map**>(reinterpret_cast<uintptr_t>(members) -
+                                        RAPIDJSON_ALIGN(sizeof(SizeType)) -
+                                        RAPIDJSON_ALIGN(sizeof(Map*)));
+    }
+
+    // Some compilers' debug mechanisms want all iterators to be destroyed, for their accounting..
+    RAPIDJSON_FORCEINLINE MapIterator DropMapIterator(MapIterator& rhs) {
+#if RAPIDJSON_HAS_CXX11
+        MapIterator ret = std::move(rhs);
+#else
+        MapIterator ret = rhs;
+#endif
+        rhs.~MapIterator();
+        return ret;
+    }
+
+    Map* &DoReallocMap(Map** oldMap, SizeType newCapacity, Allocator& allocator) {
+        Map **newMap = static_cast<Map**>(allocator.Malloc(GetMapLayoutSize(newCapacity)));
+        GetMapCapacity(*newMap) = newCapacity;
+        if (!oldMap) {
+            *newMap = new (allocator.Malloc(sizeof(Map))) Map(MapLess(), allocator);
+        }
+        else {
+            *newMap = *oldMap;
+            size_t count = (*oldMap)->size();
+            std::memcpy(static_cast<void*>(GetMapMembers(*newMap)),
+                        static_cast<void*>(GetMapMembers(*oldMap)),
+                        count * sizeof(Member));
+            MapIterator *oldIt = GetMapIterators(*oldMap),
+                        *newIt = GetMapIterators(*newMap);
+            while (count--) {
+                new (&newIt[count]) MapIterator(DropMapIterator(oldIt[count]));
+            }
+            Allocator::Free(oldMap);
+        }
+        return *newMap;
+    }
+
+    RAPIDJSON_FORCEINLINE Member* DoAllocMembers(SizeType capacity, Allocator& allocator) {
+        return GetMapMembers(DoReallocMap(0, capacity, allocator));
+    }
+
+    void DoReserveMembers(SizeType newCapacity, Allocator& allocator) {
+        ObjectData& o = data_.o;
+        if (newCapacity > o.capacity) {
+            Member* oldMembers = GetMembersPointer();
+            Map **oldMap = oldMembers ? &GetMap(oldMembers) : 0,
+                *&newMap = DoReallocMap(oldMap, newCapacity, allocator);
+            RAPIDJSON_SETPOINTER(Member, o.members, GetMapMembers(newMap));
+            o.capacity = newCapacity;
+        }
+    }
+
+    template <typename SourceAllocator>
+    MemberIterator DoFindMember(const GenericValue<Encoding, SourceAllocator>& name) {
+        if (Member* members = GetMembersPointer()) {
+            Map* &map = GetMap(members);
+            MapIterator mit = map->find(reinterpret_cast<const Data&>(name.data_));
+            if (mit != map->end()) {
+                return MemberIterator(&members[mit->second]);
+            }
+        }
+        return MemberEnd();
+    }
+
+    void DoClearMembers() {
+        if (Member* members = GetMembersPointer()) {
+            Map* &map = GetMap(members);
+            MapIterator* mit = GetMapIterators(map);
+            for (SizeType i = 0; i < data_.o.size; i++) {
+                map->erase(DropMapIterator(mit[i]));
+                members[i].~Member();
+            }
+            data_.o.size = 0;
+        }
+    }
+
+    void DoFreeMembers() {
+        if (Member* members = GetMembersPointer()) {
+            GetMap(members)->~Map();
+            for (SizeType i = 0; i < data_.o.size; i++) {
+                members[i].~Member();
+            }
+            if (Allocator::kNeedFree) { // Shortcut by Allocator's trait
+                Map** map = &GetMap(members);
+                Allocator::Free(*map);
+                Allocator::Free(map);
+            }
+        }
+    }
+
+#else // !RAPIDJSON_USE_MEMBERSMAP
+
+    RAPIDJSON_FORCEINLINE Member* DoAllocMembers(SizeType capacity, Allocator& allocator) {
+        return Malloc<Member>(allocator, capacity);
+    }
+
+    void DoReserveMembers(SizeType newCapacity, Allocator& allocator) {
+        ObjectData& o = data_.o;
+        if (newCapacity > o.capacity) {
+            Member* newMembers = Realloc<Member>(allocator, GetMembersPointer(), o.capacity, newCapacity);
+            RAPIDJSON_SETPOINTER(Member, o.members, newMembers);
+            o.capacity = newCapacity;
+        }
+    }
+
+    template <typename SourceAllocator>
+    MemberIterator DoFindMember(const GenericValue<Encoding, SourceAllocator>& name) {
+        MemberIterator member = MemberBegin();
+        for ( ; member != MemberEnd(); ++member)
+            if (name.StringEqual(member->name))
+                break;
+        return member;
+    }
+
+    void DoClearMembers() {
+        for (MemberIterator m = MemberBegin(); m != MemberEnd(); ++m)
+            m->~Member();
+        data_.o.size = 0;
+    }
+
+    void DoFreeMembers() {
+        for (MemberIterator m = MemberBegin(); m != MemberEnd(); ++m)
+            m->~Member();
+        Allocator::Free(GetMembersPointer());
+    }
+
+#endif // !RAPIDJSON_USE_MEMBERSMAP
+
+    void DoAddMember(GenericValue& name, GenericValue& value, Allocator& allocator) {
+        ObjectData& o = data_.o;
+        if (o.size >= o.capacity)
+            DoReserveMembers(o.capacity ? (o.capacity + (o.capacity + 1) / 2) : kDefaultObjectCapacity, allocator);
+        Member* members = GetMembersPointer();
+        Member* m = members + o.size;
+        m->name.RawAssign(name);
+        m->value.RawAssign(value);
+#if RAPIDJSON_USE_MEMBERSMAP
+        Map* &map = GetMap(members);
+        MapIterator* mit = GetMapIterators(map);
+        new (&mit[o.size]) MapIterator(map->insert(MapPair(m->name.data_, o.size)));
+#endif
+        ++o.size;
+    }
+
+    MemberIterator DoRemoveMember(MemberIterator m) {
+        ObjectData& o = data_.o;
+        Member* members = GetMembersPointer();
+#if RAPIDJSON_USE_MEMBERSMAP
+        Map* &map = GetMap(members);
+        MapIterator* mit = GetMapIterators(map);
+        SizeType mpos = static_cast<SizeType>(&*m - members);
+        map->erase(DropMapIterator(mit[mpos]));
+#endif
+        MemberIterator last(members + (o.size - 1));
+        if (o.size > 1 && m != last) {
+#if RAPIDJSON_USE_MEMBERSMAP
+            new (&mit[mpos]) MapIterator(DropMapIterator(mit[&*last - members]));
+            mit[mpos]->second = mpos;
+#endif
+            *m = *last; // Move the last one to this place
+        }
+        else {
+            m->~Member(); // Only one left, just destroy
+        }
+        --o.size;
+        return m;
+    }
+
+    MemberIterator DoEraseMembers(ConstMemberIterator first, ConstMemberIterator last) {
+        ObjectData& o = data_.o;
+        MemberIterator beg = MemberBegin(),
+                       pos = beg + (first - beg),
+                       end = MemberEnd();
+#if RAPIDJSON_USE_MEMBERSMAP
+        Map* &map = GetMap(GetMembersPointer());
+        MapIterator* mit = GetMapIterators(map);
+#endif
+        for (MemberIterator itr = pos; itr != last; ++itr) {
+#if RAPIDJSON_USE_MEMBERSMAP
+            map->erase(DropMapIterator(mit[itr - beg]));
+#endif
+            itr->~Member();
+        }
+#if RAPIDJSON_USE_MEMBERSMAP
+        if (first != last) {
+            // Move remaining members/iterators
+            MemberIterator next = pos + (last - first);
+            for (MemberIterator itr = pos; next != end; ++itr, ++next) {
+                std::memcpy(static_cast<void*>(&*itr), &*next, sizeof(Member));
+                SizeType mpos = static_cast<SizeType>(itr - beg);
+                new (&mit[mpos]) MapIterator(DropMapIterator(mit[next - beg]));
+                mit[mpos]->second = mpos;
+            }
+        }
+#else
+        std::memmove(static_cast<void*>(&*pos), &*last,
+                     static_cast<size_t>(end - last) * sizeof(Member));
+#endif
+        o.size -= static_cast<SizeType>(last - first);
+        return pos;
+    }
+
+    template <typename SourceAllocator>
+    void DoCopyMembers(const GenericValue<Encoding,SourceAllocator>& rhs, Allocator& allocator, bool copyConstStrings) {
+        RAPIDJSON_ASSERT(rhs.GetType() == kObjectType);
+
+        data_.f.flags = kObjectFlag;
+        SizeType count = rhs.data_.o.size;
+        Member* lm = DoAllocMembers(count, allocator);
+        const typename GenericValue<Encoding,SourceAllocator>::Member* rm = rhs.GetMembersPointer();
+#if RAPIDJSON_USE_MEMBERSMAP
+        Map* &map = GetMap(lm);
+        MapIterator* mit = GetMapIterators(map);
+#endif
+        for (SizeType i = 0; i < count; i++) {
+            new (&lm[i].name) GenericValue(rm[i].name, allocator, copyConstStrings);
+            new (&lm[i].value) GenericValue(rm[i].value, allocator, copyConstStrings);
+#if RAPIDJSON_USE_MEMBERSMAP
+            new (&mit[i]) MapIterator(map->insert(MapPair(lm[i].name.data_, i)));
+#endif
+        }
+        data_.o.size = data_.o.capacity = count;
+        SetMembersPointer(lm);
+    }
+
+    // Initialize this value as array with initial data, without calling destructor.
+    void SetArrayRaw(GenericValue* values, SizeType count, Allocator& allocator) {
+        data_.f.flags = kArrayFlag;
+        if (count) {
+            GenericValue* e = static_cast<GenericValue*>(allocator.Malloc(count * sizeof(GenericValue)));
+            SetElementsPointer(e);
+            std::memcpy(static_cast<void*>(e), values, count * sizeof(GenericValue));
+        }
+        else
+            SetElementsPointer(0);
+        data_.a.size = data_.a.capacity = count;
+    }
+
+    //! Initialize this value as object with initial data, without calling destructor.
+    void SetObjectRaw(Member* members, SizeType count, Allocator& allocator) {
+        data_.f.flags = kObjectFlag;
+        if (count) {
+            Member* m = DoAllocMembers(count, allocator);
+            SetMembersPointer(m);
+            std::memcpy(static_cast<void*>(m), members, count * sizeof(Member));
+#if RAPIDJSON_USE_MEMBERSMAP
+            Map* &map = GetMap(m);
+            MapIterator* mit = GetMapIterators(map);
+            for (SizeType i = 0; i < count; i++) {
+                new (&mit[i]) MapIterator(map->insert(MapPair(m[i].name.data_, i)));
+            }
+#endif
+        }
+        else
+            SetMembersPointer(0);
+        data_.o.size = data_.o.capacity = count;
+    }
+
+    //! Initialize this value as constant string, without calling destructor.
+    void SetStringRaw(StringRefType s) RAPIDJSON_NOEXCEPT {
+        data_.f.flags = kConstStringFlag;
+        SetStringPointer(s);
+        data_.s.length = s.length;
+    }
+
+    //! Initialize this value as copy string with initial data, without calling destructor.
+    void SetStringRaw(StringRefType s, Allocator& allocator) {
+        Ch* str = 0;
+        if (ShortString::Usable(s.length)) {
+            data_.f.flags = kShortStringFlag;
+            data_.ss.SetLength(s.length);
+            str = data_.ss.str;
+        } else {
+            data_.f.flags = kCopyStringFlag;
+            data_.s.length = s.length;
+            str = static_cast<Ch *>(allocator.Malloc((s.length + 1) * sizeof(Ch)));
+            SetStringPointer(str);
+        }
+        std::memcpy(str, s, s.length * sizeof(Ch));
+        str[s.length] = '\0';
+    }
+
+    //! Assignment without calling destructor
+    void RawAssign(GenericValue& rhs) RAPIDJSON_NOEXCEPT {
+        data_ = rhs.data_;
+        // data_.f.flags = rhs.data_.f.flags;
+        rhs.data_.f.flags = kNullFlag;
+    }
+
+    template <typename SourceAllocator>
+    bool StringEqual(const GenericValue<Encoding, SourceAllocator>& rhs) const {
+        RAPIDJSON_ASSERT(IsString());
+        RAPIDJSON_ASSERT(rhs.IsString());
+
+        const SizeType len1 = GetStringLength();
+        const SizeType len2 = rhs.GetStringLength();
+        if(len1 != len2) { return false; }
+
+        const Ch* const str1 = GetString();
+        const Ch* const str2 = rhs.GetString();
+        if(str1 == str2) { return true; } // fast path for constant string
+
+        return (std::memcmp(str1, str2, sizeof(Ch) * len1) == 0);
+    }
+
+    Data data_;
+};
+
+//! GenericValue with UTF8 encoding
+typedef GenericValue<UTF8<> > Value;
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericDocument 
+
+//! A document for parsing JSON text as DOM.
+/*!
+    \note implements Handler concept
+    \tparam Encoding Encoding for both parsing and string storage.
+    \tparam Allocator Allocator for allocating memory for the DOM
+    \tparam StackAllocator Allocator for allocating memory for stack during parsing.
+    \warning Although GenericDocument inherits from GenericValue, the API does \b not provide any virtual functions, especially no virtual destructor.  To avoid memory leaks, do not \c delete a GenericDocument object via a pointer to a GenericValue.
+*/
+template <typename Encoding, typename Allocator = RAPIDJSON_DEFAULT_ALLOCATOR, typename StackAllocator = RAPIDJSON_DEFAULT_STACK_ALLOCATOR >
+class GenericDocument : public GenericValue<Encoding, Allocator> {
+public:
+    typedef typename Encoding::Ch Ch;                       //!< Character type derived from Encoding.
+    typedef GenericValue<Encoding, Allocator> ValueType;    //!< Value type of the document.
+    typedef Allocator AllocatorType;                        //!< Allocator type from template parameter.
+    typedef StackAllocator StackAllocatorType;              //!< StackAllocator type from template parameter.
+
+    //! Constructor
+    /*! Creates an empty document of specified type.
+        \param type             Mandatory type of object to create.
+        \param allocator        Optional allocator for allocating memory.
+        \param stackCapacity    Optional initial capacity of stack in bytes.
+        \param stackAllocator   Optional allocator for allocating memory for stack.
+    */
+    explicit GenericDocument(Type type, Allocator* allocator = 0, size_t stackCapacity = kDefaultStackCapacity, StackAllocator* stackAllocator = 0) :
+        GenericValue<Encoding, Allocator>(type),  allocator_(allocator), ownAllocator_(0), stack_(stackAllocator, stackCapacity), parseResult_()
+    {
+        if (!allocator_)
+            ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+    }
+
+    //! Constructor
+    /*! Creates an empty document which type is Null. 
+        \param allocator        Optional allocator for allocating memory.
+        \param stackCapacity    Optional initial capacity of stack in bytes.
+        \param stackAllocator   Optional allocator for allocating memory for stack.
+    */
+    GenericDocument(Allocator* allocator = 0, size_t stackCapacity = kDefaultStackCapacity, StackAllocator* stackAllocator = 0) : 
+        allocator_(allocator), ownAllocator_(0), stack_(stackAllocator, stackCapacity), parseResult_()
+    {
+        if (!allocator_)
+            ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Move constructor in C++11
+    GenericDocument(GenericDocument&& rhs) RAPIDJSON_NOEXCEPT
+        : ValueType(std::forward<ValueType>(rhs)), // explicit cast to avoid prohibited move from Document
+          allocator_(rhs.allocator_),
+          ownAllocator_(rhs.ownAllocator_),
+          stack_(std::move(rhs.stack_)),
+          parseResult_(rhs.parseResult_)
+    {
+        rhs.allocator_ = 0;
+        rhs.ownAllocator_ = 0;
+        rhs.parseResult_ = ParseResult();
+    }
+#endif
+
+    ~GenericDocument() {
+        // Clear the ::ValueType before ownAllocator is destroyed, ~ValueType()
+        // runs last and may access its elements or members which would be freed
+        // with an allocator like MemoryPoolAllocator (CrtAllocator does not
+        // free its data when destroyed, but MemoryPoolAllocator does).
+        if (ownAllocator_) {
+            ValueType::SetNull();
+        }
+        Destroy();
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Move assignment in C++11
+    GenericDocument& operator=(GenericDocument&& rhs) RAPIDJSON_NOEXCEPT
+    {
+        // The cast to ValueType is necessary here, because otherwise it would
+        // attempt to call GenericValue's templated assignment operator.
+        ValueType::operator=(std::forward<ValueType>(rhs));
+
+        // Calling the destructor here would prematurely call stack_'s destructor
+        Destroy();
+
+        allocator_ = rhs.allocator_;
+        ownAllocator_ = rhs.ownAllocator_;
+        stack_ = std::move(rhs.stack_);
+        parseResult_ = rhs.parseResult_;
+
+        rhs.allocator_ = 0;
+        rhs.ownAllocator_ = 0;
+        rhs.parseResult_ = ParseResult();
+
+        return *this;
+    }
+#endif
+
+    //! Exchange the contents of this document with those of another.
+    /*!
+        \param rhs Another document.
+        \note Constant complexity.
+        \see GenericValue::Swap
+    */
+    GenericDocument& Swap(GenericDocument& rhs) RAPIDJSON_NOEXCEPT {
+        ValueType::Swap(rhs);
+        stack_.Swap(rhs.stack_);
+        internal::Swap(allocator_, rhs.allocator_);
+        internal::Swap(ownAllocator_, rhs.ownAllocator_);
+        internal::Swap(parseResult_, rhs.parseResult_);
+        return *this;
+    }
+
+    // Allow Swap with ValueType.
+    // Refer to Effective C++ 3rd Edition/Item 33: Avoid hiding inherited names.
+    using ValueType::Swap;
+
+    //! free-standing swap function helper
+    /*!
+        Helper function to enable support for common swap implementation pattern based on \c std::swap:
+        \code
+        void swap(MyClass& a, MyClass& b) {
+            using std::swap;
+            swap(a.doc, b.doc);
+            // ...
+        }
+        \endcode
+        \see Swap()
+     */
+    friend inline void swap(GenericDocument& a, GenericDocument& b) RAPIDJSON_NOEXCEPT { a.Swap(b); }
+
+    //! Populate this document by a generator which produces SAX events.
+    /*! \tparam Generator A functor with <tt>bool f(Handler)</tt> prototype.
+        \param g Generator functor which sends SAX events to the parameter.
+        \return The document itself for fluent API.
+    */
+    template <typename Generator>
+    GenericDocument& Populate(Generator& g) {
+        ClearStackOnExit scope(*this);
+        if (g(*this)) {
+            RAPIDJSON_ASSERT(stack_.GetSize() == sizeof(ValueType)); // Got one and only one root object
+            ValueType::operator=(*stack_.template Pop<ValueType>(1));// Move value from stack to document
+        }
+        return *this;
+    }
+
+    //!@name Parse from stream
+    //!@{
+
+    //! Parse JSON text from an input stream (with Encoding conversion)
+    /*! \tparam parseFlags Combination of \ref ParseFlag.
+        \tparam SourceEncoding Encoding of input stream
+        \tparam InputStream Type of input stream, implementing Stream concept
+        \param is Input stream to be parsed.
+        \return The document itself for fluent API.
+    */
+    template <unsigned parseFlags, typename SourceEncoding, typename InputStream>
+    GenericDocument& ParseStream(InputStream& is) {
+        GenericReader<SourceEncoding, Encoding, StackAllocator> reader(
+            stack_.HasAllocator() ? &stack_.GetAllocator() : 0);
+        ClearStackOnExit scope(*this);
+        parseResult_ = reader.template Parse<parseFlags>(is, *this);
+        if (parseResult_) {
+            RAPIDJSON_ASSERT(stack_.GetSize() == sizeof(ValueType)); // Got one and only one root object
+            ValueType::operator=(*stack_.template Pop<ValueType>(1));// Move value from stack to document
+        }
+        return *this;
+    }
+
+    //! Parse JSON text from an input stream
+    /*! \tparam parseFlags Combination of \ref ParseFlag.
+        \tparam InputStream Type of input stream, implementing Stream concept
+        \param is Input stream to be parsed.
+        \return The document itself for fluent API.
+    */
+    template <unsigned parseFlags, typename InputStream>
+    GenericDocument& ParseStream(InputStream& is) {
+        return ParseStream<parseFlags, Encoding, InputStream>(is);
+    }
+
+    //! Parse JSON text from an input stream (with \ref kParseDefaultFlags)
+    /*! \tparam InputStream Type of input stream, implementing Stream concept
+        \param is Input stream to be parsed.
+        \return The document itself for fluent API.
+    */
+    template <typename InputStream>
+    GenericDocument& ParseStream(InputStream& is) {
+        return ParseStream<kParseDefaultFlags, Encoding, InputStream>(is);
+    }
+    //!@}
+
+    //!@name Parse in-place from mutable string
+    //!@{
+
+    //! Parse JSON text from a mutable string
+    /*! \tparam parseFlags Combination of \ref ParseFlag.
+        \param str Mutable zero-terminated string to be parsed.
+        \return The document itself for fluent API.
+    */
+    template <unsigned parseFlags>
+    GenericDocument& ParseInsitu(Ch* str) {
+        GenericInsituStringStream<Encoding> s(str);
+        return ParseStream<parseFlags | kParseInsituFlag>(s);
+    }
+
+    //! Parse JSON text from a mutable string (with \ref kParseDefaultFlags)
+    /*! \param str Mutable zero-terminated string to be parsed.
+        \return The document itself for fluent API.
+    */
+    GenericDocument& ParseInsitu(Ch* str) {
+        return ParseInsitu<kParseDefaultFlags>(str);
+    }
+    //!@}
+
+    //!@name Parse from read-only string
+    //!@{
+
+    //! Parse JSON text from a read-only string (with Encoding conversion)
+    /*! \tparam parseFlags Combination of \ref ParseFlag (must not contain \ref kParseInsituFlag).
+        \tparam SourceEncoding Transcoding from input Encoding
+        \param str Read-only zero-terminated string to be parsed.
+    */
+    template <unsigned parseFlags, typename SourceEncoding>
+    GenericDocument& Parse(const typename SourceEncoding::Ch* str) {
+        RAPIDJSON_ASSERT(!(parseFlags & kParseInsituFlag));
+        GenericStringStream<SourceEncoding> s(str);
+        return ParseStream<parseFlags, SourceEncoding>(s);
+    }
+
+    //! Parse JSON text from a read-only string
+    /*! \tparam parseFlags Combination of \ref ParseFlag (must not contain \ref kParseInsituFlag).
+        \param str Read-only zero-terminated string to be parsed.
+    */
+    template <unsigned parseFlags>
+    GenericDocument& Parse(const Ch* str) {
+        return Parse<parseFlags, Encoding>(str);
+    }
+
+    //! Parse JSON text from a read-only string (with \ref kParseDefaultFlags)
+    /*! \param str Read-only zero-terminated string to be parsed.
+    */
+    GenericDocument& Parse(const Ch* str) {
+        return Parse<kParseDefaultFlags>(str);
+    }
+
+    template <unsigned parseFlags, typename SourceEncoding>
+    GenericDocument& Parse(const typename SourceEncoding::Ch* str, size_t length) {
+        RAPIDJSON_ASSERT(!(parseFlags & kParseInsituFlag));
+        MemoryStream ms(reinterpret_cast<const char*>(str), length * sizeof(typename SourceEncoding::Ch));
+        EncodedInputStream<SourceEncoding, MemoryStream> is(ms);
+        ParseStream<parseFlags, SourceEncoding>(is);
+        return *this;
+    }
+
+    template <unsigned parseFlags>
+    GenericDocument& Parse(const Ch* str, size_t length) {
+        return Parse<parseFlags, Encoding>(str, length);
+    }
+    
+    GenericDocument& Parse(const Ch* str, size_t length) {
+        return Parse<kParseDefaultFlags>(str, length);
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    template <unsigned parseFlags, typename SourceEncoding>
+    GenericDocument& Parse(const std::basic_string<typename SourceEncoding::Ch>& str) {
+        // c_str() is constant complexity according to standard. Should be faster than Parse(const char*, size_t)
+        return Parse<parseFlags, SourceEncoding>(str.c_str());
+    }
+
+    template <unsigned parseFlags>
+    GenericDocument& Parse(const std::basic_string<Ch>& str) {
+        return Parse<parseFlags, Encoding>(str.c_str());
+    }
+
+    GenericDocument& Parse(const std::basic_string<Ch>& str) {
+        return Parse<kParseDefaultFlags>(str);
+    }
+#endif // RAPIDJSON_HAS_STDSTRING    
+
+    //!@}
+
+    //!@name Handling parse errors
+    //!@{
+
+    //! Whether a parse error has occurred in the last parsing.
+    bool HasParseError() const { return parseResult_.IsError(); }
+
+    //! Get the \ref ParseErrorCode of last parsing.
+    ParseErrorCode GetParseError() const { return parseResult_.Code(); }
+
+    //! Get the position of last parsing error in input, 0 otherwise.
+    size_t GetErrorOffset() const { return parseResult_.Offset(); }
+
+    //! Implicit conversion to get the last parse result
+#ifndef __clang // -Wdocumentation
+    /*! \return \ref ParseResult of the last parse operation
+
+        \code
+          Document doc;
+          ParseResult ok = doc.Parse(json);
+          if (!ok)
+            printf( "JSON parse error: %s (%u)\n", GetParseError_En(ok.Code()), ok.Offset());
+        \endcode
+     */
+#endif
+    operator ParseResult() const { return parseResult_; }
+    //!@}
+
+    //! Get the allocator of this document.
+    Allocator& GetAllocator() {
+        RAPIDJSON_ASSERT(allocator_);
+        return *allocator_;
+    }
+
+    //! Get the capacity of stack in bytes.
+    size_t GetStackCapacity() const { return stack_.GetCapacity(); }
+
+private:
+    // clear stack on any exit from ParseStream, e.g. due to exception
+    struct ClearStackOnExit {
+        explicit ClearStackOnExit(GenericDocument& d) : d_(d) {}
+        ~ClearStackOnExit() { d_.ClearStack(); }
+    private:
+        ClearStackOnExit(const ClearStackOnExit&);
+        ClearStackOnExit& operator=(const ClearStackOnExit&);
+        GenericDocument& d_;
+    };
+
+    // callers of the following private Handler functions
+    // template <typename,typename,typename> friend class GenericReader; // for parsing
+    template <typename, typename> friend class GenericValue; // for deep copying
+
+public:
+    // Implementation of Handler
+    bool Null() { new (stack_.template Push<ValueType>()) ValueType(); return true; }
+    bool Bool(bool b) { new (stack_.template Push<ValueType>()) ValueType(b); return true; }
+    bool Int(int i) { new (stack_.template Push<ValueType>()) ValueType(i); return true; }
+    bool Uint(unsigned i) { new (stack_.template Push<ValueType>()) ValueType(i); return true; }
+    bool Int64(int64_t i) { new (stack_.template Push<ValueType>()) ValueType(i); return true; }
+    bool Uint64(uint64_t i) { new (stack_.template Push<ValueType>()) ValueType(i); return true; }
+    bool Double(double d) { new (stack_.template Push<ValueType>()) ValueType(d); return true; }
+
+    bool RawNumber(const Ch* str, SizeType length, bool copy) { 
+        if (copy) 
+            new (stack_.template Push<ValueType>()) ValueType(str, length, GetAllocator());
+        else
+            new (stack_.template Push<ValueType>()) ValueType(str, length);
+        return true;
+    }
+
+    bool String(const Ch* str, SizeType length, bool copy) { 
+        if (copy) 
+            new (stack_.template Push<ValueType>()) ValueType(str, length, GetAllocator());
+        else
+            new (stack_.template Push<ValueType>()) ValueType(str, length);
+        return true;
+    }
+
+    bool StartObject() { new (stack_.template Push<ValueType>()) ValueType(kObjectType); return true; }
+    
+    bool Key(const Ch* str, SizeType length, bool copy) { return String(str, length, copy); }
+
+    bool EndObject(SizeType memberCount) {
+        typename ValueType::Member* members = stack_.template Pop<typename ValueType::Member>(memberCount);
+        stack_.template Top<ValueType>()->SetObjectRaw(members, memberCount, GetAllocator());
+        return true;
+    }
+
+    bool StartArray() { new (stack_.template Push<ValueType>()) ValueType(kArrayType); return true; }
+    
+    bool EndArray(SizeType elementCount) {
+        ValueType* elements = stack_.template Pop<ValueType>(elementCount);
+        stack_.template Top<ValueType>()->SetArrayRaw(elements, elementCount, GetAllocator());
+        return true;
+    }
+
+private:
+    //! Prohibit copying
+    GenericDocument(const GenericDocument&);
+    //! Prohibit assignment
+    GenericDocument& operator=(const GenericDocument&);
+
+    void ClearStack() {
+        if (Allocator::kNeedFree)
+            while (stack_.GetSize() > 0)    // Here assumes all elements in stack array are GenericValue (Member is actually 2 GenericValue objects)
+                (stack_.template Pop<ValueType>(1))->~ValueType();
+        else
+            stack_.Clear();
+        stack_.ShrinkToFit();
+    }
+
+    void Destroy() {
+        RAPIDJSON_DELETE(ownAllocator_);
+    }
+
+    static const size_t kDefaultStackCapacity = 1024;
+    Allocator* allocator_;
+    Allocator* ownAllocator_;
+    internal::Stack<StackAllocator> stack_;
+    ParseResult parseResult_;
+};
+
+//! GenericDocument with UTF8 encoding
+typedef GenericDocument<UTF8<> > Document;
+
+
+//! Helper class for accessing Value of array type.
+/*!
+    Instance of this helper class is obtained by \c GenericValue::GetArray().
+    In addition to all APIs for array type, it provides range-based for loop if \c RAPIDJSON_HAS_CXX11_RANGE_FOR=1.
+*/
+template <bool Const, typename ValueT>
+class GenericArray {
+public:
+    typedef GenericArray<true, ValueT> ConstArray;
+    typedef GenericArray<false, ValueT> Array;
+    typedef ValueT PlainType;
+    typedef typename internal::MaybeAddConst<Const,PlainType>::Type ValueType;
+    typedef ValueType* ValueIterator;  // This may be const or non-const iterator
+    typedef const ValueT* ConstValueIterator;
+    typedef typename ValueType::AllocatorType AllocatorType;
+    typedef typename ValueType::StringRefType StringRefType;
+
+    template <typename, typename>
+    friend class GenericValue;
+
+    GenericArray(const GenericArray& rhs) : value_(rhs.value_) {}
+    GenericArray& operator=(const GenericArray& rhs) { value_ = rhs.value_; return *this; }
+    ~GenericArray() {}
+
+    operator ValueType&() const { return value_; }
+    SizeType Size() const { return value_.Size(); }
+    SizeType Capacity() const { return value_.Capacity(); }
+    bool Empty() const { return value_.Empty(); }
+    void Clear() const { value_.Clear(); }
+    ValueType& operator[](SizeType index) const {  return value_[index]; }
+    ValueIterator Begin() const { return value_.Begin(); }
+    ValueIterator End() const { return value_.End(); }
+    GenericArray Reserve(SizeType newCapacity, AllocatorType &allocator) const { value_.Reserve(newCapacity, allocator); return *this; }
+    GenericArray PushBack(ValueType& value, AllocatorType& allocator) const { value_.PushBack(value, allocator); return *this; }
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericArray PushBack(ValueType&& value, AllocatorType& allocator) const { value_.PushBack(value, allocator); return *this; }
+#endif // RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericArray PushBack(StringRefType value, AllocatorType& allocator) const { value_.PushBack(value, allocator); return *this; }
+    template <typename T> RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (const GenericArray&)) PushBack(T value, AllocatorType& allocator) const { value_.PushBack(value, allocator); return *this; }
+    GenericArray PopBack() const { value_.PopBack(); return *this; }
+    ValueIterator Erase(ConstValueIterator pos) const { return value_.Erase(pos); }
+    ValueIterator Erase(ConstValueIterator first, ConstValueIterator last) const { return value_.Erase(first, last); }
+
+#if RAPIDJSON_HAS_CXX11_RANGE_FOR
+    ValueIterator begin() const { return value_.Begin(); }
+    ValueIterator end() const { return value_.End(); }
+#endif
+
+private:
+    GenericArray();
+    GenericArray(ValueType& value) : value_(value) {}
+    ValueType& value_;
+};
+
+//! Helper class for accessing Value of object type.
+/*!
+    Instance of this helper class is obtained by \c GenericValue::GetObject().
+    In addition to all APIs for array type, it provides range-based for loop if \c RAPIDJSON_HAS_CXX11_RANGE_FOR=1.
+*/
+template <bool Const, typename ValueT>
+class GenericObject {
+public:
+    typedef GenericObject<true, ValueT> ConstObject;
+    typedef GenericObject<false, ValueT> Object;
+    typedef ValueT PlainType;
+    typedef typename internal::MaybeAddConst<Const,PlainType>::Type ValueType;
+    typedef GenericMemberIterator<Const, typename ValueT::EncodingType, typename ValueT::AllocatorType> MemberIterator;  // This may be const or non-const iterator
+    typedef GenericMemberIterator<true, typename ValueT::EncodingType, typename ValueT::AllocatorType> ConstMemberIterator;
+    typedef typename ValueType::AllocatorType AllocatorType;
+    typedef typename ValueType::StringRefType StringRefType;
+    typedef typename ValueType::EncodingType EncodingType;
+    typedef typename ValueType::Ch Ch;
+
+    template <typename, typename>
+    friend class GenericValue;
+
+    GenericObject(const GenericObject& rhs) : value_(rhs.value_) {}
+    GenericObject& operator=(const GenericObject& rhs) { value_ = rhs.value_; return *this; }
+    ~GenericObject() {}
+
+    operator ValueType&() const { return value_; }
+    SizeType MemberCount() const { return value_.MemberCount(); }
+    SizeType MemberCapacity() const { return value_.MemberCapacity(); }
+    bool ObjectEmpty() const { return value_.ObjectEmpty(); }
+    template <typename T> ValueType& operator[](T* name) const { return value_[name]; }
+    template <typename SourceAllocator> ValueType& operator[](const GenericValue<EncodingType, SourceAllocator>& name) const { return value_[name]; }
+#if RAPIDJSON_HAS_STDSTRING
+    ValueType& operator[](const std::basic_string<Ch>& name) const { return value_[name]; }
+#endif
+    MemberIterator MemberBegin() const { return value_.MemberBegin(); }
+    MemberIterator MemberEnd() const { return value_.MemberEnd(); }
+    GenericObject MemberReserve(SizeType newCapacity, AllocatorType &allocator) const { value_.MemberReserve(newCapacity, allocator); return *this; }
+    bool HasMember(const Ch* name) const { return value_.HasMember(name); }
+#if RAPIDJSON_HAS_STDSTRING
+    bool HasMember(const std::basic_string<Ch>& name) const { return value_.HasMember(name); }
+#endif
+    template <typename SourceAllocator> bool HasMember(const GenericValue<EncodingType, SourceAllocator>& name) const { return value_.HasMember(name); }
+    MemberIterator FindMember(const Ch* name) const { return value_.FindMember(name); }
+    template <typename SourceAllocator> MemberIterator FindMember(const GenericValue<EncodingType, SourceAllocator>& name) const { return value_.FindMember(name); }
+#if RAPIDJSON_HAS_STDSTRING
+    MemberIterator FindMember(const std::basic_string<Ch>& name) const { return value_.FindMember(name); }
+#endif
+    GenericObject AddMember(ValueType& name, ValueType& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    GenericObject AddMember(ValueType& name, StringRefType value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+#if RAPIDJSON_HAS_STDSTRING
+    GenericObject AddMember(ValueType& name, std::basic_string<Ch>& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+#endif
+    template <typename T> RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (ValueType&)) AddMember(ValueType& name, T value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericObject AddMember(ValueType&& name, ValueType&& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    GenericObject AddMember(ValueType&& name, ValueType& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    GenericObject AddMember(ValueType& name, ValueType&& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    GenericObject AddMember(StringRefType name, ValueType&& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+#endif // RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericObject AddMember(StringRefType name, ValueType& value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    GenericObject AddMember(StringRefType name, StringRefType value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    template <typename T> RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (GenericObject)) AddMember(StringRefType name, T value, AllocatorType& allocator) const { value_.AddMember(name, value, allocator); return *this; }
+    void RemoveAllMembers() { value_.RemoveAllMembers(); }
+    bool RemoveMember(const Ch* name) const { return value_.RemoveMember(name); }
+#if RAPIDJSON_HAS_STDSTRING
+    bool RemoveMember(const std::basic_string<Ch>& name) const { return value_.RemoveMember(name); }
+#endif
+    template <typename SourceAllocator> bool RemoveMember(const GenericValue<EncodingType, SourceAllocator>& name) const { return value_.RemoveMember(name); }
+    MemberIterator RemoveMember(MemberIterator m) const { return value_.RemoveMember(m); }
+    MemberIterator EraseMember(ConstMemberIterator pos) const { return value_.EraseMember(pos); }
+    MemberIterator EraseMember(ConstMemberIterator first, ConstMemberIterator last) const { return value_.EraseMember(first, last); }
+    bool EraseMember(const Ch* name) const { return value_.EraseMember(name); }
+#if RAPIDJSON_HAS_STDSTRING
+    bool EraseMember(const std::basic_string<Ch>& name) const { return EraseMember(ValueType(StringRef(name))); }
+#endif
+    template <typename SourceAllocator> bool EraseMember(const GenericValue<EncodingType, SourceAllocator>& name) const { return value_.EraseMember(name); }
+
+#if RAPIDJSON_HAS_CXX11_RANGE_FOR
+    MemberIterator begin() const { return value_.MemberBegin(); }
+    MemberIterator end() const { return value_.MemberEnd(); }
+#endif
+
+private:
+    GenericObject();
+    GenericObject(ValueType& value) : value_(value) {}
+    ValueType& value_;
+};
+
+RAPIDJSON_NAMESPACE_END
+RAPIDJSON_DIAG_POP
+
+#ifdef RAPIDJSON_WINDOWS_GETOBJECT_WORKAROUND_APPLIED
+#pragma pop_macro("GetObject")
+#undef RAPIDJSON_WINDOWS_GETOBJECT_WORKAROUND_APPLIED
+#endif
+
+#endif // RAPIDJSON_DOCUMENT_H_
diff --git a/General/General/include/rapidjson/encodedstream.h b/General/General/include/rapidjson/encodedstream.h
new file mode 100644
index 0000000..cf046b8
--- /dev/null
+++ b/General/General/include/rapidjson/encodedstream.h
@@ -0,0 +1,299 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ENCODEDSTREAM_H_
+#define RAPIDJSON_ENCODEDSTREAM_H_
+
+#include "stream.h"
+#include "memorystream.h"
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Input byte stream wrapper with a statically bound encoding.
+/*!
+    \tparam Encoding The interpretation of encoding of the stream. Either UTF8, UTF16LE, UTF16BE, UTF32LE, UTF32BE.
+    \tparam InputByteStream Type of input byte stream. For example, FileReadStream.
+*/
+template <typename Encoding, typename InputByteStream>
+class EncodedInputStream {
+    RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+public:
+    typedef typename Encoding::Ch Ch;
+
+    EncodedInputStream(InputByteStream& is) : is_(is) { 
+        current_ = Encoding::TakeBOM(is_);
+    }
+
+    Ch Peek() const { return current_; }
+    Ch Take() { Ch c = current_; current_ = Encoding::Take(is_); return c; }
+    size_t Tell() const { return is_.Tell(); }
+
+    // Not implemented
+    void Put(Ch) { RAPIDJSON_ASSERT(false); }
+    void Flush() { RAPIDJSON_ASSERT(false); } 
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+private:
+    EncodedInputStream(const EncodedInputStream&);
+    EncodedInputStream& operator=(const EncodedInputStream&);
+
+    InputByteStream& is_;
+    Ch current_;
+};
+
+//! Specialized for UTF8 MemoryStream.
+template <>
+class EncodedInputStream<UTF8<>, MemoryStream> {
+public:
+    typedef UTF8<>::Ch Ch;
+
+    EncodedInputStream(MemoryStream& is) : is_(is) {
+        if (static_cast<unsigned char>(is_.Peek()) == 0xEFu) is_.Take();
+        if (static_cast<unsigned char>(is_.Peek()) == 0xBBu) is_.Take();
+        if (static_cast<unsigned char>(is_.Peek()) == 0xBFu) is_.Take();
+    }
+    Ch Peek() const { return is_.Peek(); }
+    Ch Take() { return is_.Take(); }
+    size_t Tell() const { return is_.Tell(); }
+
+    // Not implemented
+    void Put(Ch) {}
+    void Flush() {} 
+    Ch* PutBegin() { return 0; }
+    size_t PutEnd(Ch*) { return 0; }
+
+    MemoryStream& is_;
+
+private:
+    EncodedInputStream(const EncodedInputStream&);
+    EncodedInputStream& operator=(const EncodedInputStream&);
+};
+
+//! Output byte stream wrapper with statically bound encoding.
+/*!
+    \tparam Encoding The interpretation of encoding of the stream. Either UTF8, UTF16LE, UTF16BE, UTF32LE, UTF32BE.
+    \tparam OutputByteStream Type of input byte stream. For example, FileWriteStream.
+*/
+template <typename Encoding, typename OutputByteStream>
+class EncodedOutputStream {
+    RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+public:
+    typedef typename Encoding::Ch Ch;
+
+    EncodedOutputStream(OutputByteStream& os, bool putBOM = true) : os_(os) { 
+        if (putBOM)
+            Encoding::PutBOM(os_);
+    }
+
+    void Put(Ch c) { Encoding::Put(os_, c);  }
+    void Flush() { os_.Flush(); }
+
+    // Not implemented
+    Ch Peek() const { RAPIDJSON_ASSERT(false); return 0;}
+    Ch Take() { RAPIDJSON_ASSERT(false); return 0;}
+    size_t Tell() const { RAPIDJSON_ASSERT(false);  return 0; }
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+private:
+    EncodedOutputStream(const EncodedOutputStream&);
+    EncodedOutputStream& operator=(const EncodedOutputStream&);
+
+    OutputByteStream& os_;
+};
+
+#define RAPIDJSON_ENCODINGS_FUNC(x) UTF8<Ch>::x, UTF16LE<Ch>::x, UTF16BE<Ch>::x, UTF32LE<Ch>::x, UTF32BE<Ch>::x
+
+//! Input stream wrapper with dynamically bound encoding and automatic encoding detection.
+/*!
+    \tparam CharType Type of character for reading.
+    \tparam InputByteStream type of input byte stream to be wrapped.
+*/
+template <typename CharType, typename InputByteStream>
+class AutoUTFInputStream {
+    RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+public:
+    typedef CharType Ch;
+
+    //! Constructor.
+    /*!
+        \param is input stream to be wrapped.
+        \param type UTF encoding type if it is not detected from the stream.
+    */
+    AutoUTFInputStream(InputByteStream& is, UTFType type = kUTF8) : is_(&is), type_(type), hasBOM_(false) {
+        RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE);        
+        DetectType();
+        static const TakeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Take) };
+        takeFunc_ = f[type_];
+        current_ = takeFunc_(*is_);
+    }
+
+    UTFType GetType() const { return type_; }
+    bool HasBOM() const { return hasBOM_; }
+
+    Ch Peek() const { return current_; }
+    Ch Take() { Ch c = current_; current_ = takeFunc_(*is_); return c; }
+    size_t Tell() const { return is_->Tell(); }
+
+    // Not implemented
+    void Put(Ch) { RAPIDJSON_ASSERT(false); }
+    void Flush() { RAPIDJSON_ASSERT(false); } 
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+private:
+    AutoUTFInputStream(const AutoUTFInputStream&);
+    AutoUTFInputStream& operator=(const AutoUTFInputStream&);
+
+    // Detect encoding type with BOM or RFC 4627
+    void DetectType() {
+        // BOM (Byte Order Mark):
+        // 00 00 FE FF  UTF-32BE
+        // FF FE 00 00  UTF-32LE
+        // FE FF        UTF-16BE
+        // FF FE        UTF-16LE
+        // EF BB BF     UTF-8
+
+        const unsigned char* c = reinterpret_cast<const unsigned char *>(is_->Peek4());
+        if (!c)
+            return;
+
+        unsigned bom = static_cast<unsigned>(c[0] | (c[1] << 8) | (c[2] << 16) | (c[3] << 24));
+        hasBOM_ = false;
+        if (bom == 0xFFFE0000)                  { type_ = kUTF32BE; hasBOM_ = true; is_->Take(); is_->Take(); is_->Take(); is_->Take(); }
+        else if (bom == 0x0000FEFF)             { type_ = kUTF32LE; hasBOM_ = true; is_->Take(); is_->Take(); is_->Take(); is_->Take(); }
+        else if ((bom & 0xFFFF) == 0xFFFE)      { type_ = kUTF16BE; hasBOM_ = true; is_->Take(); is_->Take();                           }
+        else if ((bom & 0xFFFF) == 0xFEFF)      { type_ = kUTF16LE; hasBOM_ = true; is_->Take(); is_->Take();                           }
+        else if ((bom & 0xFFFFFF) == 0xBFBBEF)  { type_ = kUTF8;    hasBOM_ = true; is_->Take(); is_->Take(); is_->Take();              }
+
+        // RFC 4627: Section 3
+        // "Since the first two characters of a JSON text will always be ASCII
+        // characters [RFC0020], it is possible to determine whether an octet
+        // stream is UTF-8, UTF-16 (BE or LE), or UTF-32 (BE or LE) by looking
+        // at the pattern of nulls in the first four octets."
+        // 00 00 00 xx  UTF-32BE
+        // 00 xx 00 xx  UTF-16BE
+        // xx 00 00 00  UTF-32LE
+        // xx 00 xx 00  UTF-16LE
+        // xx xx xx xx  UTF-8
+
+        if (!hasBOM_) {
+            int pattern = (c[0] ? 1 : 0) | (c[1] ? 2 : 0) | (c[2] ? 4 : 0) | (c[3] ? 8 : 0);
+            switch (pattern) {
+            case 0x08: type_ = kUTF32BE; break;
+            case 0x0A: type_ = kUTF16BE; break;
+            case 0x01: type_ = kUTF32LE; break;
+            case 0x05: type_ = kUTF16LE; break;
+            case 0x0F: type_ = kUTF8;    break;
+            default: break; // Use type defined by user.
+            }
+        }
+
+        // Runtime check whether the size of character type is sufficient. It only perform checks with assertion.
+        if (type_ == kUTF16LE || type_ == kUTF16BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 2);
+        if (type_ == kUTF32LE || type_ == kUTF32BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 4);
+    }
+
+    typedef Ch (*TakeFunc)(InputByteStream& is);
+    InputByteStream* is_;
+    UTFType type_;
+    Ch current_;
+    TakeFunc takeFunc_;
+    bool hasBOM_;
+};
+
+//! Output stream wrapper with dynamically bound encoding and automatic encoding detection.
+/*!
+    \tparam CharType Type of character for writing.
+    \tparam OutputByteStream type of output byte stream to be wrapped.
+*/
+template <typename CharType, typename OutputByteStream>
+class AutoUTFOutputStream {
+    RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+public:
+    typedef CharType Ch;
+
+    //! Constructor.
+    /*!
+        \param os output stream to be wrapped.
+        \param type UTF encoding type.
+        \param putBOM Whether to write BOM at the beginning of the stream.
+    */
+    AutoUTFOutputStream(OutputByteStream& os, UTFType type, bool putBOM) : os_(&os), type_(type) {
+        RAPIDJSON_ASSERT(type >= kUTF8 && type <= kUTF32BE);
+
+        // Runtime check whether the size of character type is sufficient. It only perform checks with assertion.
+        if (type_ == kUTF16LE || type_ == kUTF16BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 2);
+        if (type_ == kUTF32LE || type_ == kUTF32BE) RAPIDJSON_ASSERT(sizeof(Ch) >= 4);
+
+        static const PutFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Put) };
+        putFunc_ = f[type_];
+
+        if (putBOM)
+            PutBOM();
+    }
+
+    UTFType GetType() const { return type_; }
+
+    void Put(Ch c) { putFunc_(*os_, c); }
+    void Flush() { os_->Flush(); } 
+
+    // Not implemented
+    Ch Peek() const { RAPIDJSON_ASSERT(false); return 0;}
+    Ch Take() { RAPIDJSON_ASSERT(false); return 0;}
+    size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+private:
+    AutoUTFOutputStream(const AutoUTFOutputStream&);
+    AutoUTFOutputStream& operator=(const AutoUTFOutputStream&);
+
+    void PutBOM() { 
+        typedef void (*PutBOMFunc)(OutputByteStream&);
+        static const PutBOMFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(PutBOM) };
+        f[type_](*os_);
+    }
+
+    typedef void (*PutFunc)(OutputByteStream&, Ch);
+
+    OutputByteStream* os_;
+    UTFType type_;
+    PutFunc putFunc_;
+};
+
+#undef RAPIDJSON_ENCODINGS_FUNC
+
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_FILESTREAM_H_
diff --git a/General/General/include/rapidjson/encodings.h b/General/General/include/rapidjson/encodings.h
new file mode 100644
index 0000000..50ad18b
--- /dev/null
+++ b/General/General/include/rapidjson/encodings.h
@@ -0,0 +1,716 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ENCODINGS_H_
+#define RAPIDJSON_ENCODINGS_H_
+
+#include "rapidjson.h"
+
+#if defined(_MSC_VER) && !defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4244) // conversion from 'type1' to 'type2', possible loss of data
+RAPIDJSON_DIAG_OFF(4702)  // unreachable code
+#elif defined(__GNUC__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+RAPIDJSON_DIAG_OFF(overflow)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// Encoding
+
+/*! \class rapidjson::Encoding
+    \brief Concept for encoding of Unicode characters.
+
+\code
+concept Encoding {
+    typename Ch;    //! Type of character. A "character" is actually a code unit in unicode's definition.
+
+    enum { supportUnicode = 1 }; // or 0 if not supporting unicode
+
+    //! \brief Encode a Unicode codepoint to an output stream.
+    //! \param os Output stream.
+    //! \param codepoint An unicode codepoint, ranging from 0x0 to 0x10FFFF inclusively.
+    template<typename OutputStream>
+    static void Encode(OutputStream& os, unsigned codepoint);
+
+    //! \brief Decode a Unicode codepoint from an input stream.
+    //! \param is Input stream.
+    //! \param codepoint Output of the unicode codepoint.
+    //! \return true if a valid codepoint can be decoded from the stream.
+    template <typename InputStream>
+    static bool Decode(InputStream& is, unsigned* codepoint);
+
+    //! \brief Validate one Unicode codepoint from an encoded stream.
+    //! \param is Input stream to obtain codepoint.
+    //! \param os Output for copying one codepoint.
+    //! \return true if it is valid.
+    //! \note This function just validating and copying the codepoint without actually decode it.
+    template <typename InputStream, typename OutputStream>
+    static bool Validate(InputStream& is, OutputStream& os);
+
+    // The following functions are deal with byte streams.
+
+    //! Take a character from input byte stream, skip BOM if exist.
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is);
+
+    //! Take a character from input byte stream.
+    template <typename InputByteStream>
+    static Ch Take(InputByteStream& is);
+
+    //! Put BOM to output byte stream.
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os);
+
+    //! Put a character to output byte stream.
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, Ch c);
+};
+\endcode
+*/
+
+///////////////////////////////////////////////////////////////////////////////
+// UTF8
+
+//! UTF-8 encoding.
+/*! http://en.wikipedia.org/wiki/UTF-8
+    http://tools.ietf.org/html/rfc3629
+    \tparam CharType Code unit for storing 8-bit UTF-8 data. Default is char.
+    \note implements Encoding concept
+*/
+template<typename CharType = char>
+struct UTF8 {
+    typedef CharType Ch;
+
+    enum { supportUnicode = 1 };
+
+    template<typename OutputStream>
+    static void Encode(OutputStream& os, unsigned codepoint) {
+        if (codepoint <= 0x7F) 
+            os.Put(static_cast<Ch>(codepoint & 0xFF));
+        else if (codepoint <= 0x7FF) {
+            os.Put(static_cast<Ch>(0xC0 | ((codepoint >> 6) & 0xFF)));
+            os.Put(static_cast<Ch>(0x80 | ((codepoint & 0x3F))));
+        }
+        else if (codepoint <= 0xFFFF) {
+            os.Put(static_cast<Ch>(0xE0 | ((codepoint >> 12) & 0xFF)));
+            os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
+            os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));
+        }
+        else {
+            RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
+            os.Put(static_cast<Ch>(0xF0 | ((codepoint >> 18) & 0xFF)));
+            os.Put(static_cast<Ch>(0x80 | ((codepoint >> 12) & 0x3F)));
+            os.Put(static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
+            os.Put(static_cast<Ch>(0x80 | (codepoint & 0x3F)));
+        }
+    }
+
+    template<typename OutputStream>
+    static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
+        if (codepoint <= 0x7F) 
+            PutUnsafe(os, static_cast<Ch>(codepoint & 0xFF));
+        else if (codepoint <= 0x7FF) {
+            PutUnsafe(os, static_cast<Ch>(0xC0 | ((codepoint >> 6) & 0xFF)));
+            PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint & 0x3F))));
+        }
+        else if (codepoint <= 0xFFFF) {
+            PutUnsafe(os, static_cast<Ch>(0xE0 | ((codepoint >> 12) & 0xFF)));
+            PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
+            PutUnsafe(os, static_cast<Ch>(0x80 | (codepoint & 0x3F)));
+        }
+        else {
+            RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
+            PutUnsafe(os, static_cast<Ch>(0xF0 | ((codepoint >> 18) & 0xFF)));
+            PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint >> 12) & 0x3F)));
+            PutUnsafe(os, static_cast<Ch>(0x80 | ((codepoint >> 6) & 0x3F)));
+            PutUnsafe(os, static_cast<Ch>(0x80 | (codepoint & 0x3F)));
+        }
+    }
+
+    template <typename InputStream>
+    static bool Decode(InputStream& is, unsigned* codepoint) {
+#define RAPIDJSON_COPY() c = is.Take(); *codepoint = (*codepoint << 6) | (static_cast<unsigned char>(c) & 0x3Fu)
+#define RAPIDJSON_TRANS(mask) result &= ((GetRange(static_cast<unsigned char>(c)) & mask) != 0)
+#define RAPIDJSON_TAIL() RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x70)
+        typename InputStream::Ch c = is.Take();
+        if (!(c & 0x80)) {
+            *codepoint = static_cast<unsigned char>(c);
+            return true;
+        }
+
+        unsigned char type = GetRange(static_cast<unsigned char>(c));
+        if (type >= 32) {
+            *codepoint = 0;
+        } else {
+            *codepoint = (0xFFu >> type) & static_cast<unsigned char>(c);
+        }
+        bool result = true;
+        switch (type) {
+        case 2: RAPIDJSON_TAIL(); return result;
+        case 3: RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        case 4: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x50); RAPIDJSON_TAIL(); return result;
+        case 5: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x10); RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        case 6: RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        case 10: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x20); RAPIDJSON_TAIL(); return result;
+        case 11: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x60); RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        default: return false;
+        }
+#undef RAPIDJSON_COPY
+#undef RAPIDJSON_TRANS
+#undef RAPIDJSON_TAIL
+    }
+
+    template <typename InputStream, typename OutputStream>
+    static bool Validate(InputStream& is, OutputStream& os) {
+#define RAPIDJSON_COPY() os.Put(c = is.Take())
+#define RAPIDJSON_TRANS(mask) result &= ((GetRange(static_cast<unsigned char>(c)) & mask) != 0)
+#define RAPIDJSON_TAIL() RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x70)
+        Ch c;
+        RAPIDJSON_COPY();
+        if (!(c & 0x80))
+            return true;
+
+        bool result = true;
+        switch (GetRange(static_cast<unsigned char>(c))) {
+        case 2: RAPIDJSON_TAIL(); return result;
+        case 3: RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        case 4: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x50); RAPIDJSON_TAIL(); return result;
+        case 5: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x10); RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        case 6: RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        case 10: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x20); RAPIDJSON_TAIL(); return result;
+        case 11: RAPIDJSON_COPY(); RAPIDJSON_TRANS(0x60); RAPIDJSON_TAIL(); RAPIDJSON_TAIL(); return result;
+        default: return false;
+        }
+#undef RAPIDJSON_COPY
+#undef RAPIDJSON_TRANS
+#undef RAPIDJSON_TAIL
+    }
+
+    static unsigned char GetRange(unsigned char c) {
+        // Referring to DFA of http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
+        // With new mapping 1 -> 0x10, 7 -> 0x20, 9 -> 0x40, such that AND operation can test multiple types.
+        static const unsigned char type[] = {
+            0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,  0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+            0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,  0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+            0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,  0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+            0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,  0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+            0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,0x10,
+            0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,0x40,
+            0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,
+            0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,0x20,
+            8,8,2,2,2,2,2,2,2,2,2,2,2,2,2,2,  2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
+            10,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3, 11,6,6,6,5,8,8,8,8,8,8,8,8,8,8,8,
+        };
+        return type[c];
+    }
+
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        typename InputByteStream::Ch c = Take(is);
+        if (static_cast<unsigned char>(c) != 0xEFu) return c;
+        c = is.Take();
+        if (static_cast<unsigned char>(c) != 0xBBu) return c;
+        c = is.Take();
+        if (static_cast<unsigned char>(c) != 0xBFu) return c;
+        c = is.Take();
+        return c;
+    }
+
+    template <typename InputByteStream>
+    static Ch Take(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        return static_cast<Ch>(is.Take());
+    }
+
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xEFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xBBu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xBFu));
+    }
+
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, Ch c) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(c));
+    }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// UTF16
+
+//! UTF-16 encoding.
+/*! http://en.wikipedia.org/wiki/UTF-16
+    http://tools.ietf.org/html/rfc2781
+    \tparam CharType Type for storing 16-bit UTF-16 data. Default is wchar_t. C++11 may use char16_t instead.
+    \note implements Encoding concept
+
+    \note For in-memory access, no need to concern endianness. The code units and code points are represented by CPU's endianness.
+    For streaming, use UTF16LE and UTF16BE, which handle endianness.
+*/
+template<typename CharType = wchar_t>
+struct UTF16 {
+    typedef CharType Ch;
+    RAPIDJSON_STATIC_ASSERT(sizeof(Ch) >= 2);
+
+    enum { supportUnicode = 1 };
+
+    template<typename OutputStream>
+    static void Encode(OutputStream& os, unsigned codepoint) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 2);
+        if (codepoint <= 0xFFFF) {
+            RAPIDJSON_ASSERT(codepoint < 0xD800 || codepoint > 0xDFFF); // Code point itself cannot be surrogate pair 
+            os.Put(static_cast<typename OutputStream::Ch>(codepoint));
+        }
+        else {
+            RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
+            unsigned v = codepoint - 0x10000;
+            os.Put(static_cast<typename OutputStream::Ch>((v >> 10) | 0xD800));
+            os.Put(static_cast<typename OutputStream::Ch>((v & 0x3FF) | 0xDC00));
+        }
+    }
+
+
+    template<typename OutputStream>
+    static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 2);
+        if (codepoint <= 0xFFFF) {
+            RAPIDJSON_ASSERT(codepoint < 0xD800 || codepoint > 0xDFFF); // Code point itself cannot be surrogate pair 
+            PutUnsafe(os, static_cast<typename OutputStream::Ch>(codepoint));
+        }
+        else {
+            RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
+            unsigned v = codepoint - 0x10000;
+            PutUnsafe(os, static_cast<typename OutputStream::Ch>((v >> 10) | 0xD800));
+            PutUnsafe(os, static_cast<typename OutputStream::Ch>((v & 0x3FF) | 0xDC00));
+        }
+    }
+
+    template <typename InputStream>
+    static bool Decode(InputStream& is, unsigned* codepoint) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 2);
+        typename InputStream::Ch c = is.Take();
+        if (c < 0xD800 || c > 0xDFFF) {
+            *codepoint = static_cast<unsigned>(c);
+            return true;
+        }
+        else if (c <= 0xDBFF) {
+            *codepoint = (static_cast<unsigned>(c) & 0x3FF) << 10;
+            c = is.Take();
+            *codepoint |= (static_cast<unsigned>(c) & 0x3FF);
+            *codepoint += 0x10000;
+            return c >= 0xDC00 && c <= 0xDFFF;
+        }
+        return false;
+    }
+
+    template <typename InputStream, typename OutputStream>
+    static bool Validate(InputStream& is, OutputStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 2);
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 2);
+        typename InputStream::Ch c;
+        os.Put(static_cast<typename OutputStream::Ch>(c = is.Take()));
+        if (c < 0xD800 || c > 0xDFFF)
+            return true;
+        else if (c <= 0xDBFF) {
+            os.Put(c = is.Take());
+            return c >= 0xDC00 && c <= 0xDFFF;
+        }
+        return false;
+    }
+};
+
+//! UTF-16 little endian encoding.
+template<typename CharType = wchar_t>
+struct UTF16LE : UTF16<CharType> {
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        CharType c = Take(is);
+        return static_cast<uint16_t>(c) == 0xFEFFu ? Take(is) : c;
+    }
+
+    template <typename InputByteStream>
+    static CharType Take(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        unsigned c = static_cast<uint8_t>(is.Take());
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
+        return static_cast<CharType>(c);
+    }
+
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
+    }
+
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, CharType c) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(static_cast<unsigned>(c) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>((static_cast<unsigned>(c) >> 8) & 0xFFu));
+    }
+};
+
+//! UTF-16 big endian encoding.
+template<typename CharType = wchar_t>
+struct UTF16BE : UTF16<CharType> {
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        CharType c = Take(is);
+        return static_cast<uint16_t>(c) == 0xFEFFu ? Take(is) : c;
+    }
+
+    template <typename InputByteStream>
+    static CharType Take(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        unsigned c = static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take()));
+        return static_cast<CharType>(c);
+    }
+
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
+    }
+
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, CharType c) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>((static_cast<unsigned>(c) >> 8) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(static_cast<unsigned>(c) & 0xFFu));
+    }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// UTF32
+
+//! UTF-32 encoding. 
+/*! http://en.wikipedia.org/wiki/UTF-32
+    \tparam CharType Type for storing 32-bit UTF-32 data. Default is unsigned. C++11 may use char32_t instead.
+    \note implements Encoding concept
+
+    \note For in-memory access, no need to concern endianness. The code units and code points are represented by CPU's endianness.
+    For streaming, use UTF32LE and UTF32BE, which handle endianness.
+*/
+template<typename CharType = unsigned>
+struct UTF32 {
+    typedef CharType Ch;
+    RAPIDJSON_STATIC_ASSERT(sizeof(Ch) >= 4);
+
+    enum { supportUnicode = 1 };
+
+    template<typename OutputStream>
+    static void Encode(OutputStream& os, unsigned codepoint) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 4);
+        RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
+        os.Put(codepoint);
+    }
+
+    template<typename OutputStream>
+    static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputStream::Ch) >= 4);
+        RAPIDJSON_ASSERT(codepoint <= 0x10FFFF);
+        PutUnsafe(os, codepoint);
+    }
+
+    template <typename InputStream>
+    static bool Decode(InputStream& is, unsigned* codepoint) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 4);
+        Ch c = is.Take();
+        *codepoint = c;
+        return c <= 0x10FFFF;
+    }
+
+    template <typename InputStream, typename OutputStream>
+    static bool Validate(InputStream& is, OutputStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputStream::Ch) >= 4);
+        Ch c;
+        os.Put(c = is.Take());
+        return c <= 0x10FFFF;
+    }
+};
+
+//! UTF-32 little endian enocoding.
+template<typename CharType = unsigned>
+struct UTF32LE : UTF32<CharType> {
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        CharType c = Take(is);
+        return static_cast<uint32_t>(c) == 0x0000FEFFu ? Take(is) : c;
+    }
+
+    template <typename InputByteStream>
+    static CharType Take(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        unsigned c = static_cast<uint8_t>(is.Take());
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 16;
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 24;
+        return static_cast<CharType>(c);
+    }
+
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
+    }
+
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, CharType c) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(c & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>((c >> 8) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>((c >> 16) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>((c >> 24) & 0xFFu));
+    }
+};
+
+//! UTF-32 big endian encoding.
+template<typename CharType = unsigned>
+struct UTF32BE : UTF32<CharType> {
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        CharType c = Take(is);
+        return static_cast<uint32_t>(c) == 0x0000FEFFu ? Take(is) : c; 
+    }
+
+    template <typename InputByteStream>
+    static CharType Take(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        unsigned c = static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 24;
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 16;
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take())) << 8;
+        c |= static_cast<unsigned>(static_cast<uint8_t>(is.Take()));
+        return static_cast<CharType>(c);
+    }
+
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0x00u));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFEu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(0xFFu));
+    }
+
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, CharType c) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>((c >> 24) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>((c >> 16) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>((c >> 8) & 0xFFu));
+        os.Put(static_cast<typename OutputByteStream::Ch>(c & 0xFFu));
+    }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// ASCII
+
+//! ASCII encoding.
+/*! http://en.wikipedia.org/wiki/ASCII
+    \tparam CharType Code unit for storing 7-bit ASCII data. Default is char.
+    \note implements Encoding concept
+*/
+template<typename CharType = char>
+struct ASCII {
+    typedef CharType Ch;
+
+    enum { supportUnicode = 0 };
+
+    template<typename OutputStream>
+    static void Encode(OutputStream& os, unsigned codepoint) {
+        RAPIDJSON_ASSERT(codepoint <= 0x7F);
+        os.Put(static_cast<Ch>(codepoint & 0xFF));
+    }
+
+    template<typename OutputStream>
+    static void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
+        RAPIDJSON_ASSERT(codepoint <= 0x7F);
+        PutUnsafe(os, static_cast<Ch>(codepoint & 0xFF));
+    }
+
+    template <typename InputStream>
+    static bool Decode(InputStream& is, unsigned* codepoint) {
+        uint8_t c = static_cast<uint8_t>(is.Take());
+        *codepoint = c;
+        return c <= 0X7F;
+    }
+
+    template <typename InputStream, typename OutputStream>
+    static bool Validate(InputStream& is, OutputStream& os) {
+        uint8_t c = static_cast<uint8_t>(is.Take());
+        os.Put(static_cast<typename OutputStream::Ch>(c));
+        return c <= 0x7F;
+    }
+
+    template <typename InputByteStream>
+    static CharType TakeBOM(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        uint8_t c = static_cast<uint8_t>(Take(is));
+        return static_cast<Ch>(c);
+    }
+
+    template <typename InputByteStream>
+    static Ch Take(InputByteStream& is) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename InputByteStream::Ch) == 1);
+        return static_cast<Ch>(is.Take());
+    }
+
+    template <typename OutputByteStream>
+    static void PutBOM(OutputByteStream& os) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        (void)os;
+    }
+
+    template <typename OutputByteStream>
+    static void Put(OutputByteStream& os, Ch c) {
+        RAPIDJSON_STATIC_ASSERT(sizeof(typename OutputByteStream::Ch) == 1);
+        os.Put(static_cast<typename OutputByteStream::Ch>(c));
+    }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// AutoUTF
+
+//! Runtime-specified UTF encoding type of a stream.
+enum UTFType {
+    kUTF8 = 0,      //!< UTF-8.
+    kUTF16LE = 1,   //!< UTF-16 little endian.
+    kUTF16BE = 2,   //!< UTF-16 big endian.
+    kUTF32LE = 3,   //!< UTF-32 little endian.
+    kUTF32BE = 4    //!< UTF-32 big endian.
+};
+
+//! Dynamically select encoding according to stream's runtime-specified UTF encoding type.
+/*! \note This class can be used with AutoUTFInputtStream and AutoUTFOutputStream, which provides GetType().
+*/
+template<typename CharType>
+struct AutoUTF {
+    typedef CharType Ch;
+
+    enum { supportUnicode = 1 };
+
+#define RAPIDJSON_ENCODINGS_FUNC(x) UTF8<Ch>::x, UTF16LE<Ch>::x, UTF16BE<Ch>::x, UTF32LE<Ch>::x, UTF32BE<Ch>::x
+
+    template<typename OutputStream>
+    static RAPIDJSON_FORCEINLINE void Encode(OutputStream& os, unsigned codepoint) {
+        typedef void (*EncodeFunc)(OutputStream&, unsigned);
+        static const EncodeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Encode) };
+        (*f[os.GetType()])(os, codepoint);
+    }
+
+    template<typename OutputStream>
+    static RAPIDJSON_FORCEINLINE void EncodeUnsafe(OutputStream& os, unsigned codepoint) {
+        typedef void (*EncodeFunc)(OutputStream&, unsigned);
+        static const EncodeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(EncodeUnsafe) };
+        (*f[os.GetType()])(os, codepoint);
+    }
+
+    template <typename InputStream>
+    static RAPIDJSON_FORCEINLINE bool Decode(InputStream& is, unsigned* codepoint) {
+        typedef bool (*DecodeFunc)(InputStream&, unsigned*);
+        static const DecodeFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Decode) };
+        return (*f[is.GetType()])(is, codepoint);
+    }
+
+    template <typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool Validate(InputStream& is, OutputStream& os) {
+        typedef bool (*ValidateFunc)(InputStream&, OutputStream&);
+        static const ValidateFunc f[] = { RAPIDJSON_ENCODINGS_FUNC(Validate) };
+        return (*f[is.GetType()])(is, os);
+    }
+
+#undef RAPIDJSON_ENCODINGS_FUNC
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// Transcoder
+
+//! Encoding conversion.
+template<typename SourceEncoding, typename TargetEncoding>
+struct Transcoder {
+    //! Take one Unicode codepoint from source encoding, convert it to target encoding and put it to the output stream.
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool Transcode(InputStream& is, OutputStream& os) {
+        unsigned codepoint;
+        if (!SourceEncoding::Decode(is, &codepoint))
+            return false;
+        TargetEncoding::Encode(os, codepoint);
+        return true;
+    }
+
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool TranscodeUnsafe(InputStream& is, OutputStream& os) {
+        unsigned codepoint;
+        if (!SourceEncoding::Decode(is, &codepoint))
+            return false;
+        TargetEncoding::EncodeUnsafe(os, codepoint);
+        return true;
+    }
+
+    //! Validate one Unicode codepoint from an encoded stream.
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool Validate(InputStream& is, OutputStream& os) {
+        return Transcode(is, os);   // Since source/target encoding is different, must transcode.
+    }
+};
+
+// Forward declaration.
+template<typename Stream>
+inline void PutUnsafe(Stream& stream, typename Stream::Ch c);
+
+//! Specialization of Transcoder with same source and target encoding.
+template<typename Encoding>
+struct Transcoder<Encoding, Encoding> {
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool Transcode(InputStream& is, OutputStream& os) {
+        os.Put(is.Take());  // Just copy one code unit. This semantic is different from primary template class.
+        return true;
+    }
+    
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool TranscodeUnsafe(InputStream& is, OutputStream& os) {
+        PutUnsafe(os, is.Take());  // Just copy one code unit. This semantic is different from primary template class.
+        return true;
+    }
+    
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE bool Validate(InputStream& is, OutputStream& os) {
+        return Encoding::Validate(is, os);  // source/target encoding are the same
+    }
+};
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__GNUC__) || (defined(_MSC_VER) && !defined(__clang__))
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_ENCODINGS_H_
diff --git a/General/General/include/rapidjson/error/en.h b/General/General/include/rapidjson/error/en.h
new file mode 100644
index 0000000..5d2e57b
--- /dev/null
+++ b/General/General/include/rapidjson/error/en.h
@@ -0,0 +1,122 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ERROR_EN_H_
+#define RAPIDJSON_ERROR_EN_H_
+
+#include "error.h"
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(switch-enum)
+RAPIDJSON_DIAG_OFF(covered-switch-default)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Maps error code of parsing into error message.
+/*!
+    \ingroup RAPIDJSON_ERRORS
+    \param parseErrorCode Error code obtained in parsing.
+    \return the error message.
+    \note User can make a copy of this function for localization.
+        Using switch-case is safer for future modification of error codes.
+*/
+inline const RAPIDJSON_ERROR_CHARTYPE* GetParseError_En(ParseErrorCode parseErrorCode) {
+    switch (parseErrorCode) {
+        case kParseErrorNone:                           return RAPIDJSON_ERROR_STRING("No error.");
+
+        case kParseErrorDocumentEmpty:                  return RAPIDJSON_ERROR_STRING("The document is empty.");
+        case kParseErrorDocumentRootNotSingular:        return RAPIDJSON_ERROR_STRING("The document root must not be followed by other values.");
+    
+        case kParseErrorValueInvalid:                   return RAPIDJSON_ERROR_STRING("Invalid value.");
+    
+        case kParseErrorObjectMissName:                 return RAPIDJSON_ERROR_STRING("Missing a name for object member.");
+        case kParseErrorObjectMissColon:                return RAPIDJSON_ERROR_STRING("Missing a colon after a name of object member.");
+        case kParseErrorObjectMissCommaOrCurlyBracket:  return RAPIDJSON_ERROR_STRING("Missing a comma or '}' after an object member.");
+    
+        case kParseErrorArrayMissCommaOrSquareBracket:  return RAPIDJSON_ERROR_STRING("Missing a comma or ']' after an array element.");
+
+        case kParseErrorStringUnicodeEscapeInvalidHex:  return RAPIDJSON_ERROR_STRING("Incorrect hex digit after \\u escape in string.");
+        case kParseErrorStringUnicodeSurrogateInvalid:  return RAPIDJSON_ERROR_STRING("The surrogate pair in string is invalid.");
+        case kParseErrorStringEscapeInvalid:            return RAPIDJSON_ERROR_STRING("Invalid escape character in string.");
+        case kParseErrorStringMissQuotationMark:        return RAPIDJSON_ERROR_STRING("Missing a closing quotation mark in string.");
+        case kParseErrorStringInvalidEncoding:          return RAPIDJSON_ERROR_STRING("Invalid encoding in string.");
+
+        case kParseErrorNumberTooBig:                   return RAPIDJSON_ERROR_STRING("Number too big to be stored in double.");
+        case kParseErrorNumberMissFraction:             return RAPIDJSON_ERROR_STRING("Miss fraction part in number.");
+        case kParseErrorNumberMissExponent:             return RAPIDJSON_ERROR_STRING("Miss exponent in number.");
+
+        case kParseErrorTermination:                    return RAPIDJSON_ERROR_STRING("Terminate parsing due to Handler error.");
+        case kParseErrorUnspecificSyntaxError:          return RAPIDJSON_ERROR_STRING("Unspecific syntax error.");
+
+        default:                                        return RAPIDJSON_ERROR_STRING("Unknown error.");
+    }
+}
+
+//! Maps error code of validation into error message.
+/*!
+    \ingroup RAPIDJSON_ERRORS
+    \param validateErrorCode Error code obtained from validator.
+    \return the error message.
+    \note User can make a copy of this function for localization.
+        Using switch-case is safer for future modification of error codes.
+*/
+inline const RAPIDJSON_ERROR_CHARTYPE* GetValidateError_En(ValidateErrorCode validateErrorCode) {
+    switch (validateErrorCode) {
+        case kValidateErrors:                           return RAPIDJSON_ERROR_STRING("One or more validation errors have occurred");
+        case kValidateErrorNone:                        return RAPIDJSON_ERROR_STRING("No error.");
+
+        case kValidateErrorMultipleOf:                  return RAPIDJSON_ERROR_STRING("Number '%actual' is not a multiple of the 'multipleOf' value '%expected'.");
+        case kValidateErrorMaximum:                     return RAPIDJSON_ERROR_STRING("Number '%actual' is greater than the 'maximum' value '%expected'.");
+        case kValidateErrorExclusiveMaximum:            return RAPIDJSON_ERROR_STRING("Number '%actual' is greater than or equal to the 'exclusiveMaximum' value '%expected'.");
+        case kValidateErrorMinimum:                     return RAPIDJSON_ERROR_STRING("Number '%actual' is less than the 'minimum' value '%expected'.");
+        case kValidateErrorExclusiveMinimum:            return RAPIDJSON_ERROR_STRING("Number '%actual' is less than or equal to the 'exclusiveMinimum' value '%expected'.");
+
+        case kValidateErrorMaxLength:                   return RAPIDJSON_ERROR_STRING("String '%actual' is longer than the 'maxLength' value '%expected'.");
+        case kValidateErrorMinLength:                   return RAPIDJSON_ERROR_STRING("String '%actual' is shorter than the 'minLength' value '%expected'.");
+        case kValidateErrorPattern:                     return RAPIDJSON_ERROR_STRING("String '%actual' does not match the 'pattern' regular expression.");
+
+        case kValidateErrorMaxItems:                    return RAPIDJSON_ERROR_STRING("Array of length '%actual' is longer than the 'maxItems' value '%expected'.");
+        case kValidateErrorMinItems:                    return RAPIDJSON_ERROR_STRING("Array of length '%actual' is shorter than the 'minItems' value '%expected'.");
+        case kValidateErrorUniqueItems:                 return RAPIDJSON_ERROR_STRING("Array has duplicate items at indices '%duplicates' but 'uniqueItems' is true.");
+        case kValidateErrorAdditionalItems:             return RAPIDJSON_ERROR_STRING("Array has an additional item at index '%disallowed' that is not allowed by the schema.");
+
+        case kValidateErrorMaxProperties:               return RAPIDJSON_ERROR_STRING("Object has '%actual' members which is more than 'maxProperties' value '%expected'.");
+        case kValidateErrorMinProperties:               return RAPIDJSON_ERROR_STRING("Object has '%actual' members which is less than 'minProperties' value '%expected'.");
+        case kValidateErrorRequired:                    return RAPIDJSON_ERROR_STRING("Object is missing the following members required by the schema: '%missing'.");
+        case kValidateErrorAdditionalProperties:        return RAPIDJSON_ERROR_STRING("Object has an additional member '%disallowed' that is not allowed by the schema.");
+        case kValidateErrorPatternProperties:           return RAPIDJSON_ERROR_STRING("Object has 'patternProperties' that are not allowed by the schema.");
+        case kValidateErrorDependencies:                return RAPIDJSON_ERROR_STRING("Object has missing property or schema dependencies, refer to following errors.");
+
+        case kValidateErrorEnum:                        return RAPIDJSON_ERROR_STRING("Property has a value that is not one of its allowed enumerated values.");
+        case kValidateErrorType:                        return RAPIDJSON_ERROR_STRING("Property has a type '%actual' that is not in the following list: '%expected'.");
+
+        case kValidateErrorOneOf:                       return RAPIDJSON_ERROR_STRING("Property did not match any of the sub-schemas specified by 'oneOf', refer to following errors.");
+        case kValidateErrorOneOfMatch:                  return RAPIDJSON_ERROR_STRING("Property matched more than one of the sub-schemas specified by 'oneOf'.");
+        case kValidateErrorAllOf:                       return RAPIDJSON_ERROR_STRING("Property did not match all of the sub-schemas specified by 'allOf', refer to following errors.");
+        case kValidateErrorAnyOf:                       return RAPIDJSON_ERROR_STRING("Property did not match any of the sub-schemas specified by 'anyOf', refer to following errors.");
+        case kValidateErrorNot:                         return RAPIDJSON_ERROR_STRING("Property matched the sub-schema specified by 'not'.");
+
+        default:                                        return RAPIDJSON_ERROR_STRING("Unknown error.");
+    }
+}
+
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_ERROR_EN_H_
diff --git a/General/General/include/rapidjson/error/error.h b/General/General/include/rapidjson/error/error.h
new file mode 100644
index 0000000..6270da1
--- /dev/null
+++ b/General/General/include/rapidjson/error/error.h
@@ -0,0 +1,216 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ERROR_ERROR_H_
+#define RAPIDJSON_ERROR_ERROR_H_
+
+#include "../rapidjson.h"
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+#endif
+
+/*! \file error.h */
+
+/*! \defgroup RAPIDJSON_ERRORS RapidJSON error handling */
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_ERROR_CHARTYPE
+
+//! Character type of error messages.
+/*! \ingroup RAPIDJSON_ERRORS
+    The default character type is \c char.
+    On Windows, user can define this macro as \c TCHAR for supporting both
+    unicode/non-unicode settings.
+*/
+#ifndef RAPIDJSON_ERROR_CHARTYPE
+#define RAPIDJSON_ERROR_CHARTYPE char
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_ERROR_STRING
+
+//! Macro for converting string literial to \ref RAPIDJSON_ERROR_CHARTYPE[].
+/*! \ingroup RAPIDJSON_ERRORS
+    By default this conversion macro does nothing.
+    On Windows, user can define this macro as \c _T(x) for supporting both
+    unicode/non-unicode settings.
+*/
+#ifndef RAPIDJSON_ERROR_STRING
+#define RAPIDJSON_ERROR_STRING(x) x
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// ParseErrorCode
+
+//! Error code of parsing.
+/*! \ingroup RAPIDJSON_ERRORS
+    \see GenericReader::Parse, GenericReader::GetParseErrorCode
+*/
+enum ParseErrorCode {
+    kParseErrorNone = 0,                        //!< No error.
+
+    kParseErrorDocumentEmpty,                   //!< The document is empty.
+    kParseErrorDocumentRootNotSingular,         //!< The document root must not follow by other values.
+
+    kParseErrorValueInvalid,                    //!< Invalid value.
+
+    kParseErrorObjectMissName,                  //!< Missing a name for object member.
+    kParseErrorObjectMissColon,                 //!< Missing a colon after a name of object member.
+    kParseErrorObjectMissCommaOrCurlyBracket,   //!< Missing a comma or '}' after an object member.
+
+    kParseErrorArrayMissCommaOrSquareBracket,   //!< Missing a comma or ']' after an array element.
+
+    kParseErrorStringUnicodeEscapeInvalidHex,   //!< Incorrect hex digit after \\u escape in string.
+    kParseErrorStringUnicodeSurrogateInvalid,   //!< The surrogate pair in string is invalid.
+    kParseErrorStringEscapeInvalid,             //!< Invalid escape character in string.
+    kParseErrorStringMissQuotationMark,         //!< Missing a closing quotation mark in string.
+    kParseErrorStringInvalidEncoding,           //!< Invalid encoding in string.
+
+    kParseErrorNumberTooBig,                    //!< Number too big to be stored in double.
+    kParseErrorNumberMissFraction,              //!< Miss fraction part in number.
+    kParseErrorNumberMissExponent,              //!< Miss exponent in number.
+
+    kParseErrorTermination,                     //!< Parsing was terminated.
+    kParseErrorUnspecificSyntaxError            //!< Unspecific syntax error.
+};
+
+//! Result of parsing (wraps ParseErrorCode)
+/*!
+    \ingroup RAPIDJSON_ERRORS
+    \code
+        Document doc;
+        ParseResult ok = doc.Parse("[42]");
+        if (!ok) {
+            fprintf(stderr, "JSON parse error: %s (%u)",
+                    GetParseError_En(ok.Code()), ok.Offset());
+            exit(EXIT_FAILURE);
+        }
+    \endcode
+    \see GenericReader::Parse, GenericDocument::Parse
+*/
+struct ParseResult {
+    //!! Unspecified boolean type
+    typedef bool (ParseResult::*BooleanType)() const;
+public:
+    //! Default constructor, no error.
+    ParseResult() : code_(kParseErrorNone), offset_(0) {}
+    //! Constructor to set an error.
+    ParseResult(ParseErrorCode code, size_t offset) : code_(code), offset_(offset) {}
+
+    //! Get the error code.
+    ParseErrorCode Code() const { return code_; }
+    //! Get the error offset, if \ref IsError(), 0 otherwise.
+    size_t Offset() const { return offset_; }
+
+    //! Explicit conversion to \c bool, returns \c true, iff !\ref IsError().
+    operator BooleanType() const { return !IsError() ? &ParseResult::IsError : NULL; }
+    //! Whether the result is an error.
+    bool IsError() const { return code_ != kParseErrorNone; }
+
+    bool operator==(const ParseResult& that) const { return code_ == that.code_; }
+    bool operator==(ParseErrorCode code) const { return code_ == code; }
+    friend bool operator==(ParseErrorCode code, const ParseResult & err) { return code == err.code_; }
+
+    bool operator!=(const ParseResult& that) const { return !(*this == that); }
+    bool operator!=(ParseErrorCode code) const { return !(*this == code); }
+    friend bool operator!=(ParseErrorCode code, const ParseResult & err) { return err != code; }
+
+    //! Reset error code.
+    void Clear() { Set(kParseErrorNone); }
+    //! Update error code and offset.
+    void Set(ParseErrorCode code, size_t offset = 0) { code_ = code; offset_ = offset; }
+
+private:
+    ParseErrorCode code_;
+    size_t offset_;
+};
+
+//! Function pointer type of GetParseError().
+/*! \ingroup RAPIDJSON_ERRORS
+
+    This is the prototype for \c GetParseError_X(), where \c X is a locale.
+    User can dynamically change locale in runtime, e.g.:
+\code
+    GetParseErrorFunc GetParseError = GetParseError_En; // or whatever
+    const RAPIDJSON_ERROR_CHARTYPE* s = GetParseError(document.GetParseErrorCode());
+\endcode
+*/
+typedef const RAPIDJSON_ERROR_CHARTYPE* (*GetParseErrorFunc)(ParseErrorCode);
+
+///////////////////////////////////////////////////////////////////////////////
+// ValidateErrorCode
+
+//! Error codes when validating.
+/*! \ingroup RAPIDJSON_ERRORS
+    \see GenericSchemaValidator
+*/
+enum ValidateErrorCode {
+    kValidateErrors    = -1,                   //!< Top level error code when kValidateContinueOnErrorsFlag set.
+    kValidateErrorNone = 0,                    //!< No error.
+
+    kValidateErrorMultipleOf,                  //!< Number is not a multiple of the 'multipleOf' value.
+    kValidateErrorMaximum,                     //!< Number is greater than the 'maximum' value.
+    kValidateErrorExclusiveMaximum,            //!< Number is greater than or equal to the 'maximum' value.
+    kValidateErrorMinimum,                     //!< Number is less than the 'minimum' value.
+    kValidateErrorExclusiveMinimum,            //!< Number is less than or equal to the 'minimum' value.
+
+    kValidateErrorMaxLength,                   //!< String is longer than the 'maxLength' value.
+    kValidateErrorMinLength,                   //!< String is longer than the 'maxLength' value.
+    kValidateErrorPattern,                     //!< String does not match the 'pattern' regular expression.
+
+    kValidateErrorMaxItems,                    //!< Array is longer than the 'maxItems' value.
+    kValidateErrorMinItems,                    //!< Array is shorter than the 'minItems' value.
+    kValidateErrorUniqueItems,                 //!< Array has duplicate items but 'uniqueItems' is true.
+    kValidateErrorAdditionalItems,             //!< Array has additional items that are not allowed by the schema.
+
+    kValidateErrorMaxProperties,               //!< Object has more members than 'maxProperties' value.
+    kValidateErrorMinProperties,               //!< Object has less members than 'minProperties' value.
+    kValidateErrorRequired,                    //!< Object is missing one or more members required by the schema.
+    kValidateErrorAdditionalProperties,        //!< Object has additional members that are not allowed by the schema.
+    kValidateErrorPatternProperties,           //!< See other errors.
+    kValidateErrorDependencies,                //!< Object has missing property or schema dependencies.
+
+    kValidateErrorEnum,                        //!< Property has a value that is not one of its allowed enumerated values
+    kValidateErrorType,                        //!< Property has a type that is not allowed by the schema..
+
+    kValidateErrorOneOf,                       //!< Property did not match any of the sub-schemas specified by 'oneOf'.
+    kValidateErrorOneOfMatch,                  //!< Property matched more than one of the sub-schemas specified by 'oneOf'.
+    kValidateErrorAllOf,                       //!< Property did not match all of the sub-schemas specified by 'allOf'.
+    kValidateErrorAnyOf,                       //!< Property did not match any of the sub-schemas specified by 'anyOf'.
+    kValidateErrorNot                          //!< Property matched the sub-schema specified by 'not'.
+};
+
+//! Function pointer type of GetValidateError().
+/*! \ingroup RAPIDJSON_ERRORS
+
+    This is the prototype for \c GetValidateError_X(), where \c X is a locale.
+    User can dynamically change locale in runtime, e.g.:
+\code
+    GetValidateErrorFunc GetValidateError = GetValidateError_En; // or whatever
+    const RAPIDJSON_ERROR_CHARTYPE* s = GetValidateError(validator.GetInvalidSchemaCode());
+\endcode
+*/
+typedef const RAPIDJSON_ERROR_CHARTYPE* (*GetValidateErrorFunc)(ValidateErrorCode);
+
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_ERROR_ERROR_H_
diff --git a/General/General/include/rapidjson/filereadstream.h b/General/General/include/rapidjson/filereadstream.h
new file mode 100644
index 0000000..f8bb43c
--- /dev/null
+++ b/General/General/include/rapidjson/filereadstream.h
@@ -0,0 +1,99 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_FILEREADSTREAM_H_
+#define RAPIDJSON_FILEREADSTREAM_H_
+
+#include "stream.h"
+#include <cstdio>
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+RAPIDJSON_DIAG_OFF(unreachable-code)
+RAPIDJSON_DIAG_OFF(missing-noreturn)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! File byte stream for input using fread().
+/*!
+    \note implements Stream concept
+*/
+class FileReadStream {
+public:
+    typedef char Ch;    //!< Character type (byte).
+
+    //! Constructor.
+    /*!
+        \param fp File pointer opened for read.
+        \param buffer user-supplied buffer.
+        \param bufferSize size of buffer in bytes. Must >=4 bytes.
+    */
+    FileReadStream(std::FILE* fp, char* buffer, size_t bufferSize) : fp_(fp), buffer_(buffer), bufferSize_(bufferSize), bufferLast_(0), current_(buffer_), readCount_(0), count_(0), eof_(false) { 
+        RAPIDJSON_ASSERT(fp_ != 0);
+        RAPIDJSON_ASSERT(bufferSize >= 4);
+        Read();
+    }
+
+    Ch Peek() const { return *current_; }
+    Ch Take() { Ch c = *current_; Read(); return c; }
+    size_t Tell() const { return count_ + static_cast<size_t>(current_ - buffer_); }
+
+    // Not implemented
+    void Put(Ch) { RAPIDJSON_ASSERT(false); }
+    void Flush() { RAPIDJSON_ASSERT(false); } 
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+    // For encoding detection only.
+    const Ch* Peek4() const {
+        return (current_ + 4 - !eof_ <= bufferLast_) ? current_ : 0;
+    }
+
+private:
+    void Read() {
+        if (current_ < bufferLast_)
+            ++current_;
+        else if (!eof_) {
+            count_ += readCount_;
+            readCount_ = std::fread(buffer_, 1, bufferSize_, fp_);
+            bufferLast_ = buffer_ + readCount_ - 1;
+            current_ = buffer_;
+
+            if (readCount_ < bufferSize_) {
+                buffer_[readCount_] = '\0';
+                ++bufferLast_;
+                eof_ = true;
+            }
+        }
+    }
+
+    std::FILE* fp_;
+    Ch *buffer_;
+    size_t bufferSize_;
+    Ch *bufferLast_;
+    Ch *current_;
+    size_t readCount_;
+    size_t count_;  //!< Number of characters read
+    bool eof_;
+};
+
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_FILESTREAM_H_
diff --git a/General/General/include/rapidjson/filewritestream.h b/General/General/include/rapidjson/filewritestream.h
new file mode 100644
index 0000000..5d89588
--- /dev/null
+++ b/General/General/include/rapidjson/filewritestream.h
@@ -0,0 +1,104 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_FILEWRITESTREAM_H_
+#define RAPIDJSON_FILEWRITESTREAM_H_
+
+#include "stream.h"
+#include <cstdio>
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(unreachable-code)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Wrapper of C file stream for output using fwrite().
+/*!
+    \note implements Stream concept
+*/
+class FileWriteStream {
+public:
+    typedef char Ch;    //!< Character type. Only support char.
+
+    FileWriteStream(std::FILE* fp, char* buffer, size_t bufferSize) : fp_(fp), buffer_(buffer), bufferEnd_(buffer + bufferSize), current_(buffer_) { 
+        RAPIDJSON_ASSERT(fp_ != 0);
+    }
+
+    void Put(char c) { 
+        if (current_ >= bufferEnd_)
+            Flush();
+
+        *current_++ = c;
+    }
+
+    void PutN(char c, size_t n) {
+        size_t avail = static_cast<size_t>(bufferEnd_ - current_);
+        while (n > avail) {
+            std::memset(current_, c, avail);
+            current_ += avail;
+            Flush();
+            n -= avail;
+            avail = static_cast<size_t>(bufferEnd_ - current_);
+        }
+
+        if (n > 0) {
+            std::memset(current_, c, n);
+            current_ += n;
+        }
+    }
+
+    void Flush() {
+        if (current_ != buffer_) {
+            size_t result = std::fwrite(buffer_, 1, static_cast<size_t>(current_ - buffer_), fp_);
+            if (result < static_cast<size_t>(current_ - buffer_)) {
+                // failure deliberately ignored at this time
+                // added to avoid warn_unused_result build errors
+            }
+            current_ = buffer_;
+        }
+    }
+
+    // Not implemented
+    char Peek() const { RAPIDJSON_ASSERT(false); return 0; }
+    char Take() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
+    char* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(char*) { RAPIDJSON_ASSERT(false); return 0; }
+
+private:
+    // Prohibit copy constructor & assignment operator.
+    FileWriteStream(const FileWriteStream&);
+    FileWriteStream& operator=(const FileWriteStream&);
+
+    std::FILE* fp_;
+    char *buffer_;
+    char *bufferEnd_;
+    char *current_;
+};
+
+//! Implement specialized version of PutN() with memset() for better performance.
+template<>
+inline void PutN(FileWriteStream& stream, char c, size_t n) {
+    stream.PutN(c, n);
+}
+
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_FILESTREAM_H_
diff --git a/General/General/include/rapidjson/fwd.h b/General/General/include/rapidjson/fwd.h
new file mode 100644
index 0000000..d62f77f
--- /dev/null
+++ b/General/General/include/rapidjson/fwd.h
@@ -0,0 +1,151 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_FWD_H_
+#define RAPIDJSON_FWD_H_
+
+#include "rapidjson.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+// encodings.h
+
+template<typename CharType> struct UTF8;
+template<typename CharType> struct UTF16;
+template<typename CharType> struct UTF16BE;
+template<typename CharType> struct UTF16LE;
+template<typename CharType> struct UTF32;
+template<typename CharType> struct UTF32BE;
+template<typename CharType> struct UTF32LE;
+template<typename CharType> struct ASCII;
+template<typename CharType> struct AutoUTF;
+
+template<typename SourceEncoding, typename TargetEncoding>
+struct Transcoder;
+
+// allocators.h
+
+class CrtAllocator;
+
+template <typename BaseAllocator>
+class MemoryPoolAllocator;
+
+// stream.h
+
+template <typename Encoding>
+struct GenericStringStream;
+
+typedef GenericStringStream<UTF8<char> > StringStream;
+
+template <typename Encoding>
+struct GenericInsituStringStream;
+
+typedef GenericInsituStringStream<UTF8<char> > InsituStringStream;
+
+// stringbuffer.h
+
+template <typename Encoding, typename Allocator>
+class GenericStringBuffer;
+
+typedef GenericStringBuffer<UTF8<char>, CrtAllocator> StringBuffer;
+
+// filereadstream.h
+
+class FileReadStream;
+
+// filewritestream.h
+
+class FileWriteStream;
+
+// memorybuffer.h
+
+template <typename Allocator>
+struct GenericMemoryBuffer;
+
+typedef GenericMemoryBuffer<CrtAllocator> MemoryBuffer;
+
+// memorystream.h
+
+struct MemoryStream;
+
+// reader.h
+
+template<typename Encoding, typename Derived>
+struct BaseReaderHandler;
+
+template <typename SourceEncoding, typename TargetEncoding, typename StackAllocator>
+class GenericReader;
+
+typedef GenericReader<UTF8<char>, UTF8<char>, CrtAllocator> Reader;
+
+// writer.h
+
+template<typename OutputStream, typename SourceEncoding, typename TargetEncoding, typename StackAllocator, unsigned writeFlags>
+class Writer;
+
+// prettywriter.h
+
+template<typename OutputStream, typename SourceEncoding, typename TargetEncoding, typename StackAllocator, unsigned writeFlags>
+class PrettyWriter;
+
+// document.h
+
+template <typename Encoding, typename Allocator> 
+class GenericMember;
+
+template <bool Const, typename Encoding, typename Allocator>
+class GenericMemberIterator;
+
+template<typename CharType>
+struct GenericStringRef;
+
+template <typename Encoding, typename Allocator> 
+class GenericValue;
+
+typedef GenericValue<UTF8<char>, MemoryPoolAllocator<CrtAllocator> > Value;
+
+template <typename Encoding, typename Allocator, typename StackAllocator>
+class GenericDocument;
+
+typedef GenericDocument<UTF8<char>, MemoryPoolAllocator<CrtAllocator>, CrtAllocator> Document;
+
+// pointer.h
+
+template <typename ValueType, typename Allocator>
+class GenericPointer;
+
+typedef GenericPointer<Value, CrtAllocator> Pointer;
+
+// schema.h
+
+template <typename SchemaDocumentType>
+class IGenericRemoteSchemaDocumentProvider;
+
+template <typename ValueT, typename Allocator>
+class GenericSchemaDocument;
+
+typedef GenericSchemaDocument<Value, CrtAllocator> SchemaDocument;
+typedef IGenericRemoteSchemaDocumentProvider<SchemaDocument> IRemoteSchemaDocumentProvider;
+
+template <
+    typename SchemaDocumentType,
+    typename OutputHandler,
+    typename StateAllocator>
+class GenericSchemaValidator;
+
+typedef GenericSchemaValidator<SchemaDocument, BaseReaderHandler<UTF8<char>, void>, CrtAllocator> SchemaValidator;
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_RAPIDJSONFWD_H_
diff --git a/General/General/include/rapidjson/internal/biginteger.h b/General/General/include/rapidjson/internal/biginteger.h
new file mode 100644
index 0000000..af48738
--- /dev/null
+++ b/General/General/include/rapidjson/internal/biginteger.h
@@ -0,0 +1,297 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_BIGINTEGER_H_
+#define RAPIDJSON_BIGINTEGER_H_
+
+#include "../rapidjson.h"
+
+#if defined(_MSC_VER) && !defined(__INTEL_COMPILER) && defined(_M_AMD64)
+#include <intrin.h> // for _umul128
+#if !defined(_ARM64EC_)
+#pragma intrinsic(_umul128)
+#else
+#pragma comment(lib,"softintrin")
+#endif
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+class BigInteger {
+public:
+    typedef uint64_t Type;
+
+    BigInteger(const BigInteger& rhs) : count_(rhs.count_) {
+        std::memcpy(digits_, rhs.digits_, count_ * sizeof(Type));
+    }
+
+    explicit BigInteger(uint64_t u) : count_(1) {
+        digits_[0] = u;
+    }
+
+    template<typename Ch>
+    BigInteger(const Ch* decimals, size_t length) : count_(1) {
+        RAPIDJSON_ASSERT(length > 0);
+        digits_[0] = 0;
+        size_t i = 0;
+        const size_t kMaxDigitPerIteration = 19;  // 2^64 = 18446744073709551616 > 10^19
+        while (length >= kMaxDigitPerIteration) {
+            AppendDecimal64(decimals + i, decimals + i + kMaxDigitPerIteration);
+            length -= kMaxDigitPerIteration;
+            i += kMaxDigitPerIteration;
+        }
+
+        if (length > 0)
+            AppendDecimal64(decimals + i, decimals + i + length);
+    }
+    
+    BigInteger& operator=(const BigInteger &rhs)
+    {
+        if (this != &rhs) {
+            count_ = rhs.count_;
+            std::memcpy(digits_, rhs.digits_, count_ * sizeof(Type));
+        }
+        return *this;
+    }
+    
+    BigInteger& operator=(uint64_t u) {
+        digits_[0] = u;            
+        count_ = 1;
+        return *this;
+    }
+
+    BigInteger& operator+=(uint64_t u) {
+        Type backup = digits_[0];
+        digits_[0] += u;
+        for (size_t i = 0; i < count_ - 1; i++) {
+            if (digits_[i] >= backup)
+                return *this; // no carry
+            backup = digits_[i + 1];
+            digits_[i + 1] += 1;
+        }
+
+        // Last carry
+        if (digits_[count_ - 1] < backup)
+            PushBack(1);
+
+        return *this;
+    }
+
+    BigInteger& operator*=(uint64_t u) {
+        if (u == 0) return *this = 0;
+        if (u == 1) return *this;
+        if (*this == 1) return *this = u;
+
+        uint64_t k = 0;
+        for (size_t i = 0; i < count_; i++) {
+            uint64_t hi;
+            digits_[i] = MulAdd64(digits_[i], u, k, &hi);
+            k = hi;
+        }
+        
+        if (k > 0)
+            PushBack(k);
+
+        return *this;
+    }
+
+    BigInteger& operator*=(uint32_t u) {
+        if (u == 0) return *this = 0;
+        if (u == 1) return *this;
+        if (*this == 1) return *this = u;
+
+        uint64_t k = 0;
+        for (size_t i = 0; i < count_; i++) {
+            const uint64_t c = digits_[i] >> 32;
+            const uint64_t d = digits_[i] & 0xFFFFFFFF;
+            const uint64_t uc = u * c;
+            const uint64_t ud = u * d;
+            const uint64_t p0 = ud + k;
+            const uint64_t p1 = uc + (p0 >> 32);
+            digits_[i] = (p0 & 0xFFFFFFFF) | (p1 << 32);
+            k = p1 >> 32;
+        }
+        
+        if (k > 0)
+            PushBack(k);
+
+        return *this;
+    }
+
+    BigInteger& operator<<=(size_t shift) {
+        if (IsZero() || shift == 0) return *this;
+
+        size_t offset = shift / kTypeBit;
+        size_t interShift = shift % kTypeBit;
+        RAPIDJSON_ASSERT(count_ + offset <= kCapacity);
+
+        if (interShift == 0) {
+            std::memmove(digits_ + offset, digits_, count_ * sizeof(Type));
+            count_ += offset;
+        }
+        else {
+            digits_[count_] = 0;
+            for (size_t i = count_; i > 0; i--)
+                digits_[i + offset] = (digits_[i] << interShift) | (digits_[i - 1] >> (kTypeBit - interShift));
+            digits_[offset] = digits_[0] << interShift;
+            count_ += offset;
+            if (digits_[count_])
+                count_++;
+        }
+
+        std::memset(digits_, 0, offset * sizeof(Type));
+
+        return *this;
+    }
+
+    bool operator==(const BigInteger& rhs) const {
+        return count_ == rhs.count_ && std::memcmp(digits_, rhs.digits_, count_ * sizeof(Type)) == 0;
+    }
+
+    bool operator==(const Type rhs) const {
+        return count_ == 1 && digits_[0] == rhs;
+    }
+
+    BigInteger& MultiplyPow5(unsigned exp) {
+        static const uint32_t kPow5[12] = {
+            5,
+            5 * 5,
+            5 * 5 * 5,
+            5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
+            5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5
+        };
+        if (exp == 0) return *this;
+        for (; exp >= 27; exp -= 27) *this *= RAPIDJSON_UINT64_C2(0X6765C793, 0XFA10079D); // 5^27
+        for (; exp >= 13; exp -= 13) *this *= static_cast<uint32_t>(1220703125u); // 5^13
+        if (exp > 0)                 *this *= kPow5[exp - 1];
+        return *this;
+    }
+
+    // Compute absolute difference of this and rhs.
+    // Assume this != rhs
+    bool Difference(const BigInteger& rhs, BigInteger* out) const {
+        int cmp = Compare(rhs);
+        RAPIDJSON_ASSERT(cmp != 0);
+        const BigInteger *a, *b;  // Makes a > b
+        bool ret;
+        if (cmp < 0) { a = &rhs; b = this; ret = true; }
+        else         { a = this; b = &rhs; ret = false; }
+
+        Type borrow = 0;
+        for (size_t i = 0; i < a->count_; i++) {
+            Type d = a->digits_[i] - borrow;
+            if (i < b->count_)
+                d -= b->digits_[i];
+            borrow = (d > a->digits_[i]) ? 1 : 0;
+            out->digits_[i] = d;
+            if (d != 0)
+                out->count_ = i + 1;
+        }
+
+        return ret;
+    }
+
+    int Compare(const BigInteger& rhs) const {
+        if (count_ != rhs.count_)
+            return count_ < rhs.count_ ? -1 : 1;
+
+        for (size_t i = count_; i-- > 0;)
+            if (digits_[i] != rhs.digits_[i])
+                return digits_[i] < rhs.digits_[i] ? -1 : 1;
+
+        return 0;
+    }
+
+    size_t GetCount() const { return count_; }
+    Type GetDigit(size_t index) const { RAPIDJSON_ASSERT(index < count_); return digits_[index]; }
+    bool IsZero() const { return count_ == 1 && digits_[0] == 0; }
+
+private:
+    template<typename Ch>
+    void AppendDecimal64(const Ch* begin, const Ch* end) {
+        uint64_t u = ParseUint64(begin, end);
+        if (IsZero())
+            *this = u;
+        else {
+            unsigned exp = static_cast<unsigned>(end - begin);
+            (MultiplyPow5(exp) <<= exp) += u;   // *this = *this * 10^exp + u
+        }
+    }
+
+    void PushBack(Type digit) {
+        RAPIDJSON_ASSERT(count_ < kCapacity);
+        digits_[count_++] = digit;
+    }
+
+    template<typename Ch>
+    static uint64_t ParseUint64(const Ch* begin, const Ch* end) {
+        uint64_t r = 0;
+        for (const Ch* p = begin; p != end; ++p) {
+            RAPIDJSON_ASSERT(*p >= Ch('0') && *p <= Ch('9'));
+            r = r * 10u + static_cast<unsigned>(*p - Ch('0'));
+        }
+        return r;
+    }
+
+    // Assume a * b + k < 2^128
+    static uint64_t MulAdd64(uint64_t a, uint64_t b, uint64_t k, uint64_t* outHigh) {
+#if defined(_MSC_VER) && defined(_M_AMD64)
+        uint64_t low = _umul128(a, b, outHigh) + k;
+        if (low < k)
+            (*outHigh)++;
+        return low;
+#elif (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)) && defined(__x86_64__)
+        __extension__ typedef unsigned __int128 uint128;
+        uint128 p = static_cast<uint128>(a) * static_cast<uint128>(b);
+        p += k;
+        *outHigh = static_cast<uint64_t>(p >> 64);
+        return static_cast<uint64_t>(p);
+#else
+        const uint64_t a0 = a & 0xFFFFFFFF, a1 = a >> 32, b0 = b & 0xFFFFFFFF, b1 = b >> 32;
+        uint64_t x0 = a0 * b0, x1 = a0 * b1, x2 = a1 * b0, x3 = a1 * b1;
+        x1 += (x0 >> 32); // can't give carry
+        x1 += x2;
+        if (x1 < x2)
+            x3 += (static_cast<uint64_t>(1) << 32);
+        uint64_t lo = (x1 << 32) + (x0 & 0xFFFFFFFF);
+        uint64_t hi = x3 + (x1 >> 32);
+
+        lo += k;
+        if (lo < k)
+            hi++;
+        *outHigh = hi;
+        return lo;
+#endif
+    }
+
+    static const size_t kBitCount = 3328;  // 64bit * 54 > 10^1000
+    static const size_t kCapacity = kBitCount / sizeof(Type);
+    static const size_t kTypeBit = sizeof(Type) * 8;
+
+    Type digits_[kCapacity];
+    size_t count_;
+};
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_BIGINTEGER_H_
diff --git a/General/General/include/rapidjson/internal/clzll.h b/General/General/include/rapidjson/internal/clzll.h
new file mode 100644
index 0000000..8fc5118
--- /dev/null
+++ b/General/General/include/rapidjson/internal/clzll.h
@@ -0,0 +1,71 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_CLZLL_H_
+#define RAPIDJSON_CLZLL_H_
+
+#include "../rapidjson.h"
+
+#if defined(_MSC_VER) && !defined(UNDER_CE)
+#include <intrin.h>
+#if defined(_WIN64)
+#pragma intrinsic(_BitScanReverse64)
+#else
+#pragma intrinsic(_BitScanReverse)
+#endif
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+inline uint32_t clzll(uint64_t x) {
+    // Passing 0 to __builtin_clzll is UB in GCC and results in an
+    // infinite loop in the software implementation.
+    RAPIDJSON_ASSERT(x != 0);
+
+#if defined(_MSC_VER) && !defined(UNDER_CE)
+    unsigned long r = 0;
+#if defined(_WIN64)
+    _BitScanReverse64(&r, x);
+#else
+    // Scan the high 32 bits.
+    if (_BitScanReverse(&r, static_cast<uint32_t>(x >> 32)))
+        return 63 - (r + 32);
+
+    // Scan the low 32 bits.
+    _BitScanReverse(&r, static_cast<uint32_t>(x & 0xFFFFFFFF));
+#endif // _WIN64
+
+    return 63 - r;
+#elif (defined(__GNUC__) && __GNUC__ >= 4) || RAPIDJSON_HAS_BUILTIN(__builtin_clzll)
+    // __builtin_clzll wrapper
+    return static_cast<uint32_t>(__builtin_clzll(x));
+#else
+    // naive version
+    uint32_t r = 0;
+    while (!(x & (static_cast<uint64_t>(1) << 63))) {
+        x <<= 1;
+        ++r;
+    }
+
+    return r;
+#endif // _MSC_VER
+}
+
+#define RAPIDJSON_CLZLL RAPIDJSON_NAMESPACE::internal::clzll
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_CLZLL_H_
diff --git a/General/General/include/rapidjson/internal/diyfp.h b/General/General/include/rapidjson/internal/diyfp.h
new file mode 100644
index 0000000..f7d4653
--- /dev/null
+++ b/General/General/include/rapidjson/internal/diyfp.h
@@ -0,0 +1,261 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+// This is a C++ header-only implementation of Grisu2 algorithm from the publication:
+// Loitsch, Florian. "Printing floating-point numbers quickly and accurately with
+// integers." ACM Sigplan Notices 45.6 (2010): 233-243.
+
+#ifndef RAPIDJSON_DIYFP_H_
+#define RAPIDJSON_DIYFP_H_
+
+#include "../rapidjson.h"
+#include "clzll.h"
+#include <limits>
+
+#if defined(_MSC_VER) && defined(_M_AMD64) && !defined(__INTEL_COMPILER)
+#include <intrin.h>
+#if !defined(_ARM64EC_)
+#pragma intrinsic(_umul128)
+#else
+#pragma comment(lib,"softintrin")
+#endif
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+#endif
+
+struct DiyFp {
+    DiyFp() : f(), e() {}
+
+    DiyFp(uint64_t fp, int exp) : f(fp), e(exp) {}
+
+    explicit DiyFp(double d) {
+        union {
+            double d;
+            uint64_t u64;
+        } u = { d };
+
+        int biased_e = static_cast<int>((u.u64 & kDpExponentMask) >> kDpSignificandSize);
+        uint64_t significand = (u.u64 & kDpSignificandMask);
+        if (biased_e != 0) {
+            f = significand + kDpHiddenBit;
+            e = biased_e - kDpExponentBias;
+        }
+        else {
+            f = significand;
+            e = kDpMinExponent + 1;
+        }
+    }
+
+    DiyFp operator-(const DiyFp& rhs) const {
+        return DiyFp(f - rhs.f, e);
+    }
+
+    DiyFp operator*(const DiyFp& rhs) const {
+#if defined(_MSC_VER) && defined(_M_AMD64)
+        uint64_t h;
+        uint64_t l = _umul128(f, rhs.f, &h);
+        if (l & (uint64_t(1) << 63)) // rounding
+            h++;
+        return DiyFp(h, e + rhs.e + 64);
+#elif (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)) && defined(__x86_64__)
+        __extension__ typedef unsigned __int128 uint128;
+        uint128 p = static_cast<uint128>(f) * static_cast<uint128>(rhs.f);
+        uint64_t h = static_cast<uint64_t>(p >> 64);
+        uint64_t l = static_cast<uint64_t>(p);
+        if (l & (uint64_t(1) << 63)) // rounding
+            h++;
+        return DiyFp(h, e + rhs.e + 64);
+#else
+        const uint64_t M32 = 0xFFFFFFFF;
+        const uint64_t a = f >> 32;
+        const uint64_t b = f & M32;
+        const uint64_t c = rhs.f >> 32;
+        const uint64_t d = rhs.f & M32;
+        const uint64_t ac = a * c;
+        const uint64_t bc = b * c;
+        const uint64_t ad = a * d;
+        const uint64_t bd = b * d;
+        uint64_t tmp = (bd >> 32) + (ad & M32) + (bc & M32);
+        tmp += 1U << 31;  /// mult_round
+        return DiyFp(ac + (ad >> 32) + (bc >> 32) + (tmp >> 32), e + rhs.e + 64);
+#endif
+    }
+
+    DiyFp Normalize() const {
+        int s = static_cast<int>(clzll(f));
+        return DiyFp(f << s, e - s);
+    }
+
+    DiyFp NormalizeBoundary() const {
+        DiyFp res = *this;
+        while (!(res.f & (kDpHiddenBit << 1))) {
+            res.f <<= 1;
+            res.e--;
+        }
+        res.f <<= (kDiySignificandSize - kDpSignificandSize - 2);
+        res.e = res.e - (kDiySignificandSize - kDpSignificandSize - 2);
+        return res;
+    }
+
+    void NormalizedBoundaries(DiyFp* minus, DiyFp* plus) const {
+        DiyFp pl = DiyFp((f << 1) + 1, e - 1).NormalizeBoundary();
+        DiyFp mi = (f == kDpHiddenBit) ? DiyFp((f << 2) - 1, e - 2) : DiyFp((f << 1) - 1, e - 1);
+        mi.f <<= mi.e - pl.e;
+        mi.e = pl.e;
+        *plus = pl;
+        *minus = mi;
+    }
+
+    double ToDouble() const {
+        union {
+            double d;
+            uint64_t u64;
+        }u;
+        RAPIDJSON_ASSERT(f <= kDpHiddenBit + kDpSignificandMask);
+        if (e < kDpDenormalExponent) {
+            // Underflow.
+            return 0.0;
+        }
+        if (e >= kDpMaxExponent) {
+            // Overflow.
+            return std::numeric_limits<double>::infinity();
+        }
+        const uint64_t be = (e == kDpDenormalExponent && (f & kDpHiddenBit) == 0) ? 0 :
+            static_cast<uint64_t>(e + kDpExponentBias);
+        u.u64 = (f & kDpSignificandMask) | (be << kDpSignificandSize);
+        return u.d;
+    }
+
+    static const int kDiySignificandSize = 64;
+    static const int kDpSignificandSize = 52;
+    static const int kDpExponentBias = 0x3FF + kDpSignificandSize;
+    static const int kDpMaxExponent = 0x7FF - kDpExponentBias;
+    static const int kDpMinExponent = -kDpExponentBias;
+    static const int kDpDenormalExponent = -kDpExponentBias + 1;
+    static const uint64_t kDpExponentMask = RAPIDJSON_UINT64_C2(0x7FF00000, 0x00000000);
+    static const uint64_t kDpSignificandMask = RAPIDJSON_UINT64_C2(0x000FFFFF, 0xFFFFFFFF);
+    static const uint64_t kDpHiddenBit = RAPIDJSON_UINT64_C2(0x00100000, 0x00000000);
+
+    uint64_t f;
+    int e;
+};
+
+inline DiyFp GetCachedPowerByIndex(size_t index) {
+    // 10^-348, 10^-340, ..., 10^340
+    static const uint64_t kCachedPowers_F[] = {
+        RAPIDJSON_UINT64_C2(0xfa8fd5a0, 0x081c0288), RAPIDJSON_UINT64_C2(0xbaaee17f, 0xa23ebf76),
+        RAPIDJSON_UINT64_C2(0x8b16fb20, 0x3055ac76), RAPIDJSON_UINT64_C2(0xcf42894a, 0x5dce35ea),
+        RAPIDJSON_UINT64_C2(0x9a6bb0aa, 0x55653b2d), RAPIDJSON_UINT64_C2(0xe61acf03, 0x3d1a45df),
+        RAPIDJSON_UINT64_C2(0xab70fe17, 0xc79ac6ca), RAPIDJSON_UINT64_C2(0xff77b1fc, 0xbebcdc4f),
+        RAPIDJSON_UINT64_C2(0xbe5691ef, 0x416bd60c), RAPIDJSON_UINT64_C2(0x8dd01fad, 0x907ffc3c),
+        RAPIDJSON_UINT64_C2(0xd3515c28, 0x31559a83), RAPIDJSON_UINT64_C2(0x9d71ac8f, 0xada6c9b5),
+        RAPIDJSON_UINT64_C2(0xea9c2277, 0x23ee8bcb), RAPIDJSON_UINT64_C2(0xaecc4991, 0x4078536d),
+        RAPIDJSON_UINT64_C2(0x823c1279, 0x5db6ce57), RAPIDJSON_UINT64_C2(0xc2109436, 0x4dfb5637),
+        RAPIDJSON_UINT64_C2(0x9096ea6f, 0x3848984f), RAPIDJSON_UINT64_C2(0xd77485cb, 0x25823ac7),
+        RAPIDJSON_UINT64_C2(0xa086cfcd, 0x97bf97f4), RAPIDJSON_UINT64_C2(0xef340a98, 0x172aace5),
+        RAPIDJSON_UINT64_C2(0xb23867fb, 0x2a35b28e), RAPIDJSON_UINT64_C2(0x84c8d4df, 0xd2c63f3b),
+        RAPIDJSON_UINT64_C2(0xc5dd4427, 0x1ad3cdba), RAPIDJSON_UINT64_C2(0x936b9fce, 0xbb25c996),
+        RAPIDJSON_UINT64_C2(0xdbac6c24, 0x7d62a584), RAPIDJSON_UINT64_C2(0xa3ab6658, 0x0d5fdaf6),
+        RAPIDJSON_UINT64_C2(0xf3e2f893, 0xdec3f126), RAPIDJSON_UINT64_C2(0xb5b5ada8, 0xaaff80b8),
+        RAPIDJSON_UINT64_C2(0x87625f05, 0x6c7c4a8b), RAPIDJSON_UINT64_C2(0xc9bcff60, 0x34c13053),
+        RAPIDJSON_UINT64_C2(0x964e858c, 0x91ba2655), RAPIDJSON_UINT64_C2(0xdff97724, 0x70297ebd),
+        RAPIDJSON_UINT64_C2(0xa6dfbd9f, 0xb8e5b88f), RAPIDJSON_UINT64_C2(0xf8a95fcf, 0x88747d94),
+        RAPIDJSON_UINT64_C2(0xb9447093, 0x8fa89bcf), RAPIDJSON_UINT64_C2(0x8a08f0f8, 0xbf0f156b),
+        RAPIDJSON_UINT64_C2(0xcdb02555, 0x653131b6), RAPIDJSON_UINT64_C2(0x993fe2c6, 0xd07b7fac),
+        RAPIDJSON_UINT64_C2(0xe45c10c4, 0x2a2b3b06), RAPIDJSON_UINT64_C2(0xaa242499, 0x697392d3),
+        RAPIDJSON_UINT64_C2(0xfd87b5f2, 0x8300ca0e), RAPIDJSON_UINT64_C2(0xbce50864, 0x92111aeb),
+        RAPIDJSON_UINT64_C2(0x8cbccc09, 0x6f5088cc), RAPIDJSON_UINT64_C2(0xd1b71758, 0xe219652c),
+        RAPIDJSON_UINT64_C2(0x9c400000, 0x00000000), RAPIDJSON_UINT64_C2(0xe8d4a510, 0x00000000),
+        RAPIDJSON_UINT64_C2(0xad78ebc5, 0xac620000), RAPIDJSON_UINT64_C2(0x813f3978, 0xf8940984),
+        RAPIDJSON_UINT64_C2(0xc097ce7b, 0xc90715b3), RAPIDJSON_UINT64_C2(0x8f7e32ce, 0x7bea5c70),
+        RAPIDJSON_UINT64_C2(0xd5d238a4, 0xabe98068), RAPIDJSON_UINT64_C2(0x9f4f2726, 0x179a2245),
+        RAPIDJSON_UINT64_C2(0xed63a231, 0xd4c4fb27), RAPIDJSON_UINT64_C2(0xb0de6538, 0x8cc8ada8),
+        RAPIDJSON_UINT64_C2(0x83c7088e, 0x1aab65db), RAPIDJSON_UINT64_C2(0xc45d1df9, 0x42711d9a),
+        RAPIDJSON_UINT64_C2(0x924d692c, 0xa61be758), RAPIDJSON_UINT64_C2(0xda01ee64, 0x1a708dea),
+        RAPIDJSON_UINT64_C2(0xa26da399, 0x9aef774a), RAPIDJSON_UINT64_C2(0xf209787b, 0xb47d6b85),
+        RAPIDJSON_UINT64_C2(0xb454e4a1, 0x79dd1877), RAPIDJSON_UINT64_C2(0x865b8692, 0x5b9bc5c2),
+        RAPIDJSON_UINT64_C2(0xc83553c5, 0xc8965d3d), RAPIDJSON_UINT64_C2(0x952ab45c, 0xfa97a0b3),
+        RAPIDJSON_UINT64_C2(0xde469fbd, 0x99a05fe3), RAPIDJSON_UINT64_C2(0xa59bc234, 0xdb398c25),
+        RAPIDJSON_UINT64_C2(0xf6c69a72, 0xa3989f5c), RAPIDJSON_UINT64_C2(0xb7dcbf53, 0x54e9bece),
+        RAPIDJSON_UINT64_C2(0x88fcf317, 0xf22241e2), RAPIDJSON_UINT64_C2(0xcc20ce9b, 0xd35c78a5),
+        RAPIDJSON_UINT64_C2(0x98165af3, 0x7b2153df), RAPIDJSON_UINT64_C2(0xe2a0b5dc, 0x971f303a),
+        RAPIDJSON_UINT64_C2(0xa8d9d153, 0x5ce3b396), RAPIDJSON_UINT64_C2(0xfb9b7cd9, 0xa4a7443c),
+        RAPIDJSON_UINT64_C2(0xbb764c4c, 0xa7a44410), RAPIDJSON_UINT64_C2(0x8bab8eef, 0xb6409c1a),
+        RAPIDJSON_UINT64_C2(0xd01fef10, 0xa657842c), RAPIDJSON_UINT64_C2(0x9b10a4e5, 0xe9913129),
+        RAPIDJSON_UINT64_C2(0xe7109bfb, 0xa19c0c9d), RAPIDJSON_UINT64_C2(0xac2820d9, 0x623bf429),
+        RAPIDJSON_UINT64_C2(0x80444b5e, 0x7aa7cf85), RAPIDJSON_UINT64_C2(0xbf21e440, 0x03acdd2d),
+        RAPIDJSON_UINT64_C2(0x8e679c2f, 0x5e44ff8f), RAPIDJSON_UINT64_C2(0xd433179d, 0x9c8cb841),
+        RAPIDJSON_UINT64_C2(0x9e19db92, 0xb4e31ba9), RAPIDJSON_UINT64_C2(0xeb96bf6e, 0xbadf77d9),
+        RAPIDJSON_UINT64_C2(0xaf87023b, 0x9bf0ee6b)
+    };
+    static const int16_t kCachedPowers_E[] = {
+        -1220, -1193, -1166, -1140, -1113, -1087, -1060, -1034, -1007,  -980,
+        -954,  -927,  -901,  -874,  -847,  -821,  -794,  -768,  -741,  -715,
+        -688,  -661,  -635,  -608,  -582,  -555,  -529,  -502,  -475,  -449,
+        -422,  -396,  -369,  -343,  -316,  -289,  -263,  -236,  -210,  -183,
+        -157,  -130,  -103,   -77,   -50,   -24,     3,    30,    56,    83,
+        109,   136,   162,   189,   216,   242,   269,   295,   322,   348,
+        375,   402,   428,   455,   481,   508,   534,   561,   588,   614,
+        641,   667,   694,   720,   747,   774,   800,   827,   853,   880,
+        907,   933,   960,   986,  1013,  1039,  1066
+    };
+    RAPIDJSON_ASSERT(index < 87);
+    return DiyFp(kCachedPowers_F[index], kCachedPowers_E[index]);
+}
+
+inline DiyFp GetCachedPower(int e, int* K) {
+
+    //int k = static_cast<int>(ceil((-61 - e) * 0.30102999566398114)) + 374;
+    double dk = (-61 - e) * 0.30102999566398114 + 347;  // dk must be positive, so can do ceiling in positive
+    int k = static_cast<int>(dk);
+    if (dk - k > 0.0)
+        k++;
+
+    unsigned index = static_cast<unsigned>((k >> 3) + 1);
+    *K = -(-348 + static_cast<int>(index << 3));    // decimal exponent no need lookup table
+
+    return GetCachedPowerByIndex(index);
+}
+
+inline DiyFp GetCachedPower10(int exp, int *outExp) {
+    RAPIDJSON_ASSERT(exp >= -348);
+    unsigned index = static_cast<unsigned>(exp + 348) / 8u;
+    *outExp = -348 + static_cast<int>(index) * 8;
+    return GetCachedPowerByIndex(index);
+}
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+RAPIDJSON_DIAG_OFF(padded)
+#endif
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_DIYFP_H_
diff --git a/General/General/include/rapidjson/internal/dtoa.h b/General/General/include/rapidjson/internal/dtoa.h
new file mode 100644
index 0000000..cd45672
--- /dev/null
+++ b/General/General/include/rapidjson/internal/dtoa.h
@@ -0,0 +1,249 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+// This is a C++ header-only implementation of Grisu2 algorithm from the publication:
+// Loitsch, Florian. "Printing floating-point numbers quickly and accurately with
+// integers." ACM Sigplan Notices 45.6 (2010): 233-243.
+
+#ifndef RAPIDJSON_DTOA_
+#define RAPIDJSON_DTOA_
+
+#include "itoa.h" // GetDigitsLut()
+#include "diyfp.h"
+#include "ieee754.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+RAPIDJSON_DIAG_OFF(array-bounds) // some gcc versions generate wrong warnings https://gcc.gnu.org/bugzilla/show_bug.cgi?id=59124
+#endif
+
+inline void GrisuRound(char* buffer, int len, uint64_t delta, uint64_t rest, uint64_t ten_kappa, uint64_t wp_w) {
+    while (rest < wp_w && delta - rest >= ten_kappa &&
+           (rest + ten_kappa < wp_w ||  /// closer
+            wp_w - rest > rest + ten_kappa - wp_w)) {
+        buffer[len - 1]--;
+        rest += ten_kappa;
+    }
+}
+
+inline int CountDecimalDigit32(uint32_t n) {
+    // Simple pure C++ implementation was faster than __builtin_clz version in this situation.
+    if (n < 10) return 1;
+    if (n < 100) return 2;
+    if (n < 1000) return 3;
+    if (n < 10000) return 4;
+    if (n < 100000) return 5;
+    if (n < 1000000) return 6;
+    if (n < 10000000) return 7;
+    if (n < 100000000) return 8;
+    // Will not reach 10 digits in DigitGen()
+    //if (n < 1000000000) return 9;
+    //return 10;
+    return 9;
+}
+
+inline void DigitGen(const DiyFp& W, const DiyFp& Mp, uint64_t delta, char* buffer, int* len, int* K) {
+    static const uint64_t kPow10[] = { 1ULL, 10ULL, 100ULL, 1000ULL, 10000ULL, 100000ULL, 1000000ULL, 10000000ULL, 100000000ULL,
+                                       1000000000ULL, 10000000000ULL, 100000000000ULL, 1000000000000ULL,
+                                       10000000000000ULL, 100000000000000ULL, 1000000000000000ULL,
+                                       10000000000000000ULL, 100000000000000000ULL, 1000000000000000000ULL,
+                                       10000000000000000000ULL };
+    const DiyFp one(uint64_t(1) << -Mp.e, Mp.e);
+    const DiyFp wp_w = Mp - W;
+    uint32_t p1 = static_cast<uint32_t>(Mp.f >> -one.e);
+    uint64_t p2 = Mp.f & (one.f - 1);
+    int kappa = CountDecimalDigit32(p1); // kappa in [0, 9]
+    *len = 0;
+
+    while (kappa > 0) {
+        uint32_t d = 0;
+        switch (kappa) {
+            case  9: d = p1 /  100000000; p1 %=  100000000; break;
+            case  8: d = p1 /   10000000; p1 %=   10000000; break;
+            case  7: d = p1 /    1000000; p1 %=    1000000; break;
+            case  6: d = p1 /     100000; p1 %=     100000; break;
+            case  5: d = p1 /      10000; p1 %=      10000; break;
+            case  4: d = p1 /       1000; p1 %=       1000; break;
+            case  3: d = p1 /        100; p1 %=        100; break;
+            case  2: d = p1 /         10; p1 %=         10; break;
+            case  1: d = p1;              p1 =           0; break;
+            default:;
+        }
+        if (d || *len)
+            buffer[(*len)++] = static_cast<char>('0' + static_cast<char>(d));
+        kappa--;
+        uint64_t tmp = (static_cast<uint64_t>(p1) << -one.e) + p2;
+        if (tmp <= delta) {
+            *K += kappa;
+            GrisuRound(buffer, *len, delta, tmp, kPow10[kappa] << -one.e, wp_w.f);
+            return;
+        }
+    }
+
+    // kappa = 0
+    for (;;) {
+        p2 *= 10;
+        delta *= 10;
+        char d = static_cast<char>(p2 >> -one.e);
+        if (d || *len)
+            buffer[(*len)++] = static_cast<char>('0' + d);
+        p2 &= one.f - 1;
+        kappa--;
+        if (p2 < delta) {
+            *K += kappa;
+            int index = -kappa;
+            GrisuRound(buffer, *len, delta, p2, one.f, wp_w.f * (index < 20 ? kPow10[index] : 0));
+            return;
+        }
+    }
+}
+
+inline void Grisu2(double value, char* buffer, int* length, int* K) {
+    const DiyFp v(value);
+    DiyFp w_m, w_p;
+    v.NormalizedBoundaries(&w_m, &w_p);
+
+    const DiyFp c_mk = GetCachedPower(w_p.e, K);
+    const DiyFp W = v.Normalize() * c_mk;
+    DiyFp Wp = w_p * c_mk;
+    DiyFp Wm = w_m * c_mk;
+    Wm.f++;
+    Wp.f--;
+    DigitGen(W, Wp, Wp.f - Wm.f, buffer, length, K);
+}
+
+inline char* WriteExponent(int K, char* buffer) {
+    if (K < 0) {
+        *buffer++ = '-';
+        K = -K;
+    }
+
+    if (K >= 100) {
+        *buffer++ = static_cast<char>('0' + static_cast<char>(K / 100));
+        K %= 100;
+        const char* d = GetDigitsLut() + K * 2;
+        *buffer++ = d[0];
+        *buffer++ = d[1];
+    }
+    else if (K >= 10) {
+        const char* d = GetDigitsLut() + K * 2;
+        *buffer++ = d[0];
+        *buffer++ = d[1];
+    }
+    else
+        *buffer++ = static_cast<char>('0' + static_cast<char>(K));
+
+    return buffer;
+}
+
+inline char* Prettify(char* buffer, int length, int k, int maxDecimalPlaces) {
+    const int kk = length + k;  // 10^(kk-1) <= v < 10^kk
+
+    if (0 <= k && kk <= 21) {
+        // 1234e7 -> 12340000000
+        for (int i = length; i < kk; i++)
+            buffer[i] = '0';
+        buffer[kk] = '.';
+        buffer[kk + 1] = '0';
+        return &buffer[kk + 2];
+    }
+    else if (0 < kk && kk <= 21) {
+        // 1234e-2 -> 12.34
+        std::memmove(&buffer[kk + 1], &buffer[kk], static_cast<size_t>(length - kk));
+        buffer[kk] = '.';
+        if (0 > k + maxDecimalPlaces) {
+            // When maxDecimalPlaces = 2, 1.2345 -> 1.23, 1.102 -> 1.1
+            // Remove extra trailing zeros (at least one) after truncation.
+            for (int i = kk + maxDecimalPlaces; i > kk + 1; i--)
+                if (buffer[i] != '0')
+                    return &buffer[i + 1];
+            return &buffer[kk + 2]; // Reserve one zero
+        }
+        else
+            return &buffer[length + 1];
+    }
+    else if (-6 < kk && kk <= 0) {
+        // 1234e-6 -> 0.001234
+        const int offset = 2 - kk;
+        std::memmove(&buffer[offset], &buffer[0], static_cast<size_t>(length));
+        buffer[0] = '0';
+        buffer[1] = '.';
+        for (int i = 2; i < offset; i++)
+            buffer[i] = '0';
+        if (length - kk > maxDecimalPlaces) {
+            // When maxDecimalPlaces = 2, 0.123 -> 0.12, 0.102 -> 0.1
+            // Remove extra trailing zeros (at least one) after truncation.
+            for (int i = maxDecimalPlaces + 1; i > 2; i--)
+                if (buffer[i] != '0')
+                    return &buffer[i + 1];
+            return &buffer[3]; // Reserve one zero
+        }
+        else
+            return &buffer[length + offset];
+    }
+    else if (kk < -maxDecimalPlaces) {
+        // Truncate to zero
+        buffer[0] = '0';
+        buffer[1] = '.';
+        buffer[2] = '0';
+        return &buffer[3];
+    }
+    else if (length == 1) {
+        // 1e30
+        buffer[1] = 'e';
+        return WriteExponent(kk - 1, &buffer[2]);
+    }
+    else {
+        // 1234e30 -> 1.234e33
+        std::memmove(&buffer[2], &buffer[1], static_cast<size_t>(length - 1));
+        buffer[1] = '.';
+        buffer[length + 1] = 'e';
+        return WriteExponent(kk - 1, &buffer[0 + length + 2]);
+    }
+}
+
+inline char* dtoa(double value, char* buffer, int maxDecimalPlaces = 324) {
+    RAPIDJSON_ASSERT(maxDecimalPlaces >= 1);
+    Double d(value);
+    if (d.IsZero()) {
+        if (d.Sign())
+            *buffer++ = '-';     // -0.0, Issue #289
+        buffer[0] = '0';
+        buffer[1] = '.';
+        buffer[2] = '0';
+        return &buffer[3];
+    }
+    else {
+        if (value < 0) {
+            *buffer++ = '-';
+            value = -value;
+        }
+        int length, K;
+        Grisu2(value, buffer, &length, &K);
+        return Prettify(buffer, length, K, maxDecimalPlaces);
+    }
+}
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_DTOA_
diff --git a/General/General/include/rapidjson/internal/ieee754.h b/General/General/include/rapidjson/internal/ieee754.h
new file mode 100644
index 0000000..68c9e96
--- /dev/null
+++ b/General/General/include/rapidjson/internal/ieee754.h
@@ -0,0 +1,78 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_IEEE754_
+#define RAPIDJSON_IEEE754_
+
+#include "../rapidjson.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+class Double {
+public:
+    Double() {}
+    Double(double d) : d_(d) {}
+    Double(uint64_t u) : u_(u) {}
+
+    double Value() const { return d_; }
+    uint64_t Uint64Value() const { return u_; }
+
+    double NextPositiveDouble() const {
+        RAPIDJSON_ASSERT(!Sign());
+        return Double(u_ + 1).Value();
+    }
+
+    bool Sign() const { return (u_ & kSignMask) != 0; }
+    uint64_t Significand() const { return u_ & kSignificandMask; }
+    int Exponent() const { return static_cast<int>(((u_ & kExponentMask) >> kSignificandSize) - kExponentBias); }
+
+    bool IsNan() const { return (u_ & kExponentMask) == kExponentMask && Significand() != 0; }
+    bool IsInf() const { return (u_ & kExponentMask) == kExponentMask && Significand() == 0; }
+    bool IsNanOrInf() const { return (u_ & kExponentMask) == kExponentMask; }
+    bool IsNormal() const { return (u_ & kExponentMask) != 0 || Significand() == 0; }
+    bool IsZero() const { return (u_ & (kExponentMask | kSignificandMask)) == 0; }
+
+    uint64_t IntegerSignificand() const { return IsNormal() ? Significand() | kHiddenBit : Significand(); }
+    int IntegerExponent() const { return (IsNormal() ? Exponent() : kDenormalExponent) - kSignificandSize; }
+    uint64_t ToBias() const { return (u_ & kSignMask) ? ~u_ + 1 : u_ | kSignMask; }
+
+    static int EffectiveSignificandSize(int order) {
+        if (order >= -1021)
+            return 53;
+        else if (order <= -1074)
+            return 0;
+        else
+            return order + 1074;
+    }
+
+private:
+    static const int kSignificandSize = 52;
+    static const int kExponentBias = 0x3FF;
+    static const int kDenormalExponent = 1 - kExponentBias;
+    static const uint64_t kSignMask = RAPIDJSON_UINT64_C2(0x80000000, 0x00000000);
+    static const uint64_t kExponentMask = RAPIDJSON_UINT64_C2(0x7FF00000, 0x00000000);
+    static const uint64_t kSignificandMask = RAPIDJSON_UINT64_C2(0x000FFFFF, 0xFFFFFFFF);
+    static const uint64_t kHiddenBit = RAPIDJSON_UINT64_C2(0x00100000, 0x00000000);
+
+    union {
+        double d_;
+        uint64_t u_;
+    };
+};
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_IEEE754_
diff --git a/General/General/include/rapidjson/internal/itoa.h b/General/General/include/rapidjson/internal/itoa.h
new file mode 100644
index 0000000..9fe8c93
--- /dev/null
+++ b/General/General/include/rapidjson/internal/itoa.h
@@ -0,0 +1,308 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ITOA_
+#define RAPIDJSON_ITOA_
+
+#include "../rapidjson.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+inline const char* GetDigitsLut() {
+    static const char cDigitsLut[200] = {
+        '0','0','0','1','0','2','0','3','0','4','0','5','0','6','0','7','0','8','0','9',
+        '1','0','1','1','1','2','1','3','1','4','1','5','1','6','1','7','1','8','1','9',
+        '2','0','2','1','2','2','2','3','2','4','2','5','2','6','2','7','2','8','2','9',
+        '3','0','3','1','3','2','3','3','3','4','3','5','3','6','3','7','3','8','3','9',
+        '4','0','4','1','4','2','4','3','4','4','4','5','4','6','4','7','4','8','4','9',
+        '5','0','5','1','5','2','5','3','5','4','5','5','5','6','5','7','5','8','5','9',
+        '6','0','6','1','6','2','6','3','6','4','6','5','6','6','6','7','6','8','6','9',
+        '7','0','7','1','7','2','7','3','7','4','7','5','7','6','7','7','7','8','7','9',
+        '8','0','8','1','8','2','8','3','8','4','8','5','8','6','8','7','8','8','8','9',
+        '9','0','9','1','9','2','9','3','9','4','9','5','9','6','9','7','9','8','9','9'
+    };
+    return cDigitsLut;
+}
+
+inline char* u32toa(uint32_t value, char* buffer) {
+    RAPIDJSON_ASSERT(buffer != 0);
+
+    const char* cDigitsLut = GetDigitsLut();
+
+    if (value < 10000) {
+        const uint32_t d1 = (value / 100) << 1;
+        const uint32_t d2 = (value % 100) << 1;
+
+        if (value >= 1000)
+            *buffer++ = cDigitsLut[d1];
+        if (value >= 100)
+            *buffer++ = cDigitsLut[d1 + 1];
+        if (value >= 10)
+            *buffer++ = cDigitsLut[d2];
+        *buffer++ = cDigitsLut[d2 + 1];
+    }
+    else if (value < 100000000) {
+        // value = bbbbcccc
+        const uint32_t b = value / 10000;
+        const uint32_t c = value % 10000;
+
+        const uint32_t d1 = (b / 100) << 1;
+        const uint32_t d2 = (b % 100) << 1;
+
+        const uint32_t d3 = (c / 100) << 1;
+        const uint32_t d4 = (c % 100) << 1;
+
+        if (value >= 10000000)
+            *buffer++ = cDigitsLut[d1];
+        if (value >= 1000000)
+            *buffer++ = cDigitsLut[d1 + 1];
+        if (value >= 100000)
+            *buffer++ = cDigitsLut[d2];
+        *buffer++ = cDigitsLut[d2 + 1];
+
+        *buffer++ = cDigitsLut[d3];
+        *buffer++ = cDigitsLut[d3 + 1];
+        *buffer++ = cDigitsLut[d4];
+        *buffer++ = cDigitsLut[d4 + 1];
+    }
+    else {
+        // value = aabbbbcccc in decimal
+
+        const uint32_t a = value / 100000000; // 1 to 42
+        value %= 100000000;
+
+        if (a >= 10) {
+            const unsigned i = a << 1;
+            *buffer++ = cDigitsLut[i];
+            *buffer++ = cDigitsLut[i + 1];
+        }
+        else
+            *buffer++ = static_cast<char>('0' + static_cast<char>(a));
+
+        const uint32_t b = value / 10000; // 0 to 9999
+        const uint32_t c = value % 10000; // 0 to 9999
+
+        const uint32_t d1 = (b / 100) << 1;
+        const uint32_t d2 = (b % 100) << 1;
+
+        const uint32_t d3 = (c / 100) << 1;
+        const uint32_t d4 = (c % 100) << 1;
+
+        *buffer++ = cDigitsLut[d1];
+        *buffer++ = cDigitsLut[d1 + 1];
+        *buffer++ = cDigitsLut[d2];
+        *buffer++ = cDigitsLut[d2 + 1];
+        *buffer++ = cDigitsLut[d3];
+        *buffer++ = cDigitsLut[d3 + 1];
+        *buffer++ = cDigitsLut[d4];
+        *buffer++ = cDigitsLut[d4 + 1];
+    }
+    return buffer;
+}
+
+inline char* i32toa(int32_t value, char* buffer) {
+    RAPIDJSON_ASSERT(buffer != 0);
+    uint32_t u = static_cast<uint32_t>(value);
+    if (value < 0) {
+        *buffer++ = '-';
+        u = ~u + 1;
+    }
+
+    return u32toa(u, buffer);
+}
+
+inline char* u64toa(uint64_t value, char* buffer) {
+    RAPIDJSON_ASSERT(buffer != 0);
+    const char* cDigitsLut = GetDigitsLut();
+    const uint64_t  kTen8 = 100000000;
+    const uint64_t  kTen9 = kTen8 * 10;
+    const uint64_t kTen10 = kTen8 * 100;
+    const uint64_t kTen11 = kTen8 * 1000;
+    const uint64_t kTen12 = kTen8 * 10000;
+    const uint64_t kTen13 = kTen8 * 100000;
+    const uint64_t kTen14 = kTen8 * 1000000;
+    const uint64_t kTen15 = kTen8 * 10000000;
+    const uint64_t kTen16 = kTen8 * kTen8;
+
+    if (value < kTen8) {
+        uint32_t v = static_cast<uint32_t>(value);
+        if (v < 10000) {
+            const uint32_t d1 = (v / 100) << 1;
+            const uint32_t d2 = (v % 100) << 1;
+
+            if (v >= 1000)
+                *buffer++ = cDigitsLut[d1];
+            if (v >= 100)
+                *buffer++ = cDigitsLut[d1 + 1];
+            if (v >= 10)
+                *buffer++ = cDigitsLut[d2];
+            *buffer++ = cDigitsLut[d2 + 1];
+        }
+        else {
+            // value = bbbbcccc
+            const uint32_t b = v / 10000;
+            const uint32_t c = v % 10000;
+
+            const uint32_t d1 = (b / 100) << 1;
+            const uint32_t d2 = (b % 100) << 1;
+
+            const uint32_t d3 = (c / 100) << 1;
+            const uint32_t d4 = (c % 100) << 1;
+
+            if (value >= 10000000)
+                *buffer++ = cDigitsLut[d1];
+            if (value >= 1000000)
+                *buffer++ = cDigitsLut[d1 + 1];
+            if (value >= 100000)
+                *buffer++ = cDigitsLut[d2];
+            *buffer++ = cDigitsLut[d2 + 1];
+
+            *buffer++ = cDigitsLut[d3];
+            *buffer++ = cDigitsLut[d3 + 1];
+            *buffer++ = cDigitsLut[d4];
+            *buffer++ = cDigitsLut[d4 + 1];
+        }
+    }
+    else if (value < kTen16) {
+        const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
+        const uint32_t v1 = static_cast<uint32_t>(value % kTen8);
+
+        const uint32_t b0 = v0 / 10000;
+        const uint32_t c0 = v0 % 10000;
+
+        const uint32_t d1 = (b0 / 100) << 1;
+        const uint32_t d2 = (b0 % 100) << 1;
+
+        const uint32_t d3 = (c0 / 100) << 1;
+        const uint32_t d4 = (c0 % 100) << 1;
+
+        const uint32_t b1 = v1 / 10000;
+        const uint32_t c1 = v1 % 10000;
+
+        const uint32_t d5 = (b1 / 100) << 1;
+        const uint32_t d6 = (b1 % 100) << 1;
+
+        const uint32_t d7 = (c1 / 100) << 1;
+        const uint32_t d8 = (c1 % 100) << 1;
+
+        if (value >= kTen15)
+            *buffer++ = cDigitsLut[d1];
+        if (value >= kTen14)
+            *buffer++ = cDigitsLut[d1 + 1];
+        if (value >= kTen13)
+            *buffer++ = cDigitsLut[d2];
+        if (value >= kTen12)
+            *buffer++ = cDigitsLut[d2 + 1];
+        if (value >= kTen11)
+            *buffer++ = cDigitsLut[d3];
+        if (value >= kTen10)
+            *buffer++ = cDigitsLut[d3 + 1];
+        if (value >= kTen9)
+            *buffer++ = cDigitsLut[d4];
+
+        *buffer++ = cDigitsLut[d4 + 1];
+        *buffer++ = cDigitsLut[d5];
+        *buffer++ = cDigitsLut[d5 + 1];
+        *buffer++ = cDigitsLut[d6];
+        *buffer++ = cDigitsLut[d6 + 1];
+        *buffer++ = cDigitsLut[d7];
+        *buffer++ = cDigitsLut[d7 + 1];
+        *buffer++ = cDigitsLut[d8];
+        *buffer++ = cDigitsLut[d8 + 1];
+    }
+    else {
+        const uint32_t a = static_cast<uint32_t>(value / kTen16); // 1 to 1844
+        value %= kTen16;
+
+        if (a < 10)
+            *buffer++ = static_cast<char>('0' + static_cast<char>(a));
+        else if (a < 100) {
+            const uint32_t i = a << 1;
+            *buffer++ = cDigitsLut[i];
+            *buffer++ = cDigitsLut[i + 1];
+        }
+        else if (a < 1000) {
+            *buffer++ = static_cast<char>('0' + static_cast<char>(a / 100));
+
+            const uint32_t i = (a % 100) << 1;
+            *buffer++ = cDigitsLut[i];
+            *buffer++ = cDigitsLut[i + 1];
+        }
+        else {
+            const uint32_t i = (a / 100) << 1;
+            const uint32_t j = (a % 100) << 1;
+            *buffer++ = cDigitsLut[i];
+            *buffer++ = cDigitsLut[i + 1];
+            *buffer++ = cDigitsLut[j];
+            *buffer++ = cDigitsLut[j + 1];
+        }
+
+        const uint32_t v0 = static_cast<uint32_t>(value / kTen8);
+        const uint32_t v1 = static_cast<uint32_t>(value % kTen8);
+
+        const uint32_t b0 = v0 / 10000;
+        const uint32_t c0 = v0 % 10000;
+
+        const uint32_t d1 = (b0 / 100) << 1;
+        const uint32_t d2 = (b0 % 100) << 1;
+
+        const uint32_t d3 = (c0 / 100) << 1;
+        const uint32_t d4 = (c0 % 100) << 1;
+
+        const uint32_t b1 = v1 / 10000;
+        const uint32_t c1 = v1 % 10000;
+
+        const uint32_t d5 = (b1 / 100) << 1;
+        const uint32_t d6 = (b1 % 100) << 1;
+
+        const uint32_t d7 = (c1 / 100) << 1;
+        const uint32_t d8 = (c1 % 100) << 1;
+
+        *buffer++ = cDigitsLut[d1];
+        *buffer++ = cDigitsLut[d1 + 1];
+        *buffer++ = cDigitsLut[d2];
+        *buffer++ = cDigitsLut[d2 + 1];
+        *buffer++ = cDigitsLut[d3];
+        *buffer++ = cDigitsLut[d3 + 1];
+        *buffer++ = cDigitsLut[d4];
+        *buffer++ = cDigitsLut[d4 + 1];
+        *buffer++ = cDigitsLut[d5];
+        *buffer++ = cDigitsLut[d5 + 1];
+        *buffer++ = cDigitsLut[d6];
+        *buffer++ = cDigitsLut[d6 + 1];
+        *buffer++ = cDigitsLut[d7];
+        *buffer++ = cDigitsLut[d7 + 1];
+        *buffer++ = cDigitsLut[d8];
+        *buffer++ = cDigitsLut[d8 + 1];
+    }
+
+    return buffer;
+}
+
+inline char* i64toa(int64_t value, char* buffer) {
+    RAPIDJSON_ASSERT(buffer != 0);
+    uint64_t u = static_cast<uint64_t>(value);
+    if (value < 0) {
+        *buffer++ = '-';
+        u = ~u + 1;
+    }
+
+    return u64toa(u, buffer);
+}
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_ITOA_
diff --git a/General/General/include/rapidjson/internal/meta.h b/General/General/include/rapidjson/internal/meta.h
new file mode 100644
index 0000000..27092dc
--- /dev/null
+++ b/General/General/include/rapidjson/internal/meta.h
@@ -0,0 +1,186 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_INTERNAL_META_H_
+#define RAPIDJSON_INTERNAL_META_H_
+
+#include "../rapidjson.h"
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#if defined(_MSC_VER) && !defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(6334)
+#endif
+
+#if RAPIDJSON_HAS_CXX11_TYPETRAITS
+#include <type_traits>
+#endif
+
+//@cond RAPIDJSON_INTERNAL
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+// Helper to wrap/convert arbitrary types to void, useful for arbitrary type matching
+template <typename T> struct Void { typedef void Type; };
+
+///////////////////////////////////////////////////////////////////////////////
+// BoolType, TrueType, FalseType
+//
+template <bool Cond> struct BoolType {
+    static const bool Value = Cond;
+    typedef BoolType Type;
+};
+typedef BoolType<true> TrueType;
+typedef BoolType<false> FalseType;
+
+
+///////////////////////////////////////////////////////////////////////////////
+// SelectIf, BoolExpr, NotExpr, AndExpr, OrExpr
+//
+
+template <bool C> struct SelectIfImpl { template <typename T1, typename T2> struct Apply { typedef T1 Type; }; };
+template <> struct SelectIfImpl<false> { template <typename T1, typename T2> struct Apply { typedef T2 Type; }; };
+template <bool C, typename T1, typename T2> struct SelectIfCond : SelectIfImpl<C>::template Apply<T1,T2> {};
+template <typename C, typename T1, typename T2> struct SelectIf : SelectIfCond<C::Value, T1, T2> {};
+
+template <bool Cond1, bool Cond2> struct AndExprCond : FalseType {};
+template <> struct AndExprCond<true, true> : TrueType {};
+template <bool Cond1, bool Cond2> struct OrExprCond : TrueType {};
+template <> struct OrExprCond<false, false> : FalseType {};
+
+template <typename C> struct BoolExpr : SelectIf<C,TrueType,FalseType>::Type {};
+template <typename C> struct NotExpr  : SelectIf<C,FalseType,TrueType>::Type {};
+template <typename C1, typename C2> struct AndExpr : AndExprCond<C1::Value, C2::Value>::Type {};
+template <typename C1, typename C2> struct OrExpr  : OrExprCond<C1::Value, C2::Value>::Type {};
+
+
+///////////////////////////////////////////////////////////////////////////////
+// AddConst, MaybeAddConst, RemoveConst
+template <typename T> struct AddConst { typedef const T Type; };
+template <bool Constify, typename T> struct MaybeAddConst : SelectIfCond<Constify, const T, T> {};
+template <typename T> struct RemoveConst { typedef T Type; };
+template <typename T> struct RemoveConst<const T> { typedef T Type; };
+
+
+///////////////////////////////////////////////////////////////////////////////
+// IsSame, IsConst, IsMoreConst, IsPointer
+//
+template <typename T, typename U> struct IsSame : FalseType {};
+template <typename T> struct IsSame<T, T> : TrueType {};
+
+template <typename T> struct IsConst : FalseType {};
+template <typename T> struct IsConst<const T> : TrueType {};
+
+template <typename CT, typename T>
+struct IsMoreConst
+    : AndExpr<IsSame<typename RemoveConst<CT>::Type, typename RemoveConst<T>::Type>,
+              BoolType<IsConst<CT>::Value >= IsConst<T>::Value> >::Type {};
+
+template <typename T> struct IsPointer : FalseType {};
+template <typename T> struct IsPointer<T*> : TrueType {};
+
+///////////////////////////////////////////////////////////////////////////////
+// IsBaseOf
+//
+#if RAPIDJSON_HAS_CXX11_TYPETRAITS
+
+template <typename B, typename D> struct IsBaseOf
+    : BoolType< ::std::is_base_of<B,D>::value> {};
+
+#else // simplified version adopted from Boost
+
+template<typename B, typename D> struct IsBaseOfImpl {
+    RAPIDJSON_STATIC_ASSERT(sizeof(B) != 0);
+    RAPIDJSON_STATIC_ASSERT(sizeof(D) != 0);
+
+    typedef char (&Yes)[1];
+    typedef char (&No) [2];
+
+    template <typename T>
+    static Yes Check(const D*, T);
+    static No  Check(const B*, int);
+
+    struct Host {
+        operator const B*() const;
+        operator const D*();
+    };
+
+    enum { Value = (sizeof(Check(Host(), 0)) == sizeof(Yes)) };
+};
+
+template <typename B, typename D> struct IsBaseOf
+    : OrExpr<IsSame<B, D>, BoolExpr<IsBaseOfImpl<B, D> > >::Type {};
+
+#endif // RAPIDJSON_HAS_CXX11_TYPETRAITS
+
+
+//////////////////////////////////////////////////////////////////////////
+// EnableIf / DisableIf
+//
+template <bool Condition, typename T = void> struct EnableIfCond  { typedef T Type; };
+template <typename T> struct EnableIfCond<false, T> { /* empty */ };
+
+template <bool Condition, typename T = void> struct DisableIfCond { typedef T Type; };
+template <typename T> struct DisableIfCond<true, T> { /* empty */ };
+
+template <typename Condition, typename T = void>
+struct EnableIf : EnableIfCond<Condition::Value, T> {};
+
+template <typename Condition, typename T = void>
+struct DisableIf : DisableIfCond<Condition::Value, T> {};
+
+// SFINAE helpers
+struct SfinaeTag {};
+template <typename T> struct RemoveSfinaeTag;
+template <typename T> struct RemoveSfinaeTag<SfinaeTag&(*)(T)> { typedef T Type; };
+
+#define RAPIDJSON_REMOVEFPTR_(type) \
+    typename ::RAPIDJSON_NAMESPACE::internal::RemoveSfinaeTag \
+        < ::RAPIDJSON_NAMESPACE::internal::SfinaeTag&(*) type>::Type
+
+#define RAPIDJSON_ENABLEIF(cond) \
+    typename ::RAPIDJSON_NAMESPACE::internal::EnableIf \
+        <RAPIDJSON_REMOVEFPTR_(cond)>::Type * = NULL
+
+#define RAPIDJSON_DISABLEIF(cond) \
+    typename ::RAPIDJSON_NAMESPACE::internal::DisableIf \
+        <RAPIDJSON_REMOVEFPTR_(cond)>::Type * = NULL
+
+#define RAPIDJSON_ENABLEIF_RETURN(cond,returntype) \
+    typename ::RAPIDJSON_NAMESPACE::internal::EnableIf \
+        <RAPIDJSON_REMOVEFPTR_(cond), \
+         RAPIDJSON_REMOVEFPTR_(returntype)>::Type
+
+#define RAPIDJSON_DISABLEIF_RETURN(cond,returntype) \
+    typename ::RAPIDJSON_NAMESPACE::internal::DisableIf \
+        <RAPIDJSON_REMOVEFPTR_(cond), \
+         RAPIDJSON_REMOVEFPTR_(returntype)>::Type
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+//@endcond
+
+#if defined(_MSC_VER) && !defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_INTERNAL_META_H_
diff --git a/General/General/include/rapidjson/internal/pow10.h b/General/General/include/rapidjson/internal/pow10.h
new file mode 100644
index 0000000..eae1a43
--- /dev/null
+++ b/General/General/include/rapidjson/internal/pow10.h
@@ -0,0 +1,55 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_POW10_
+#define RAPIDJSON_POW10_
+
+#include "../rapidjson.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+//! Computes integer powers of 10 in double (10.0^n).
+/*! This function uses lookup table for fast and accurate results.
+    \param n non-negative exponent. Must <= 308.
+    \return 10.0^n
+*/
+inline double Pow10(int n) {
+    static const double e[] = { // 1e-0...1e308: 309 * 8 bytes = 2472 bytes
+        1e+0,  
+        1e+1,  1e+2,  1e+3,  1e+4,  1e+5,  1e+6,  1e+7,  1e+8,  1e+9,  1e+10, 1e+11, 1e+12, 1e+13, 1e+14, 1e+15, 1e+16, 1e+17, 1e+18, 1e+19, 1e+20, 
+        1e+21, 1e+22, 1e+23, 1e+24, 1e+25, 1e+26, 1e+27, 1e+28, 1e+29, 1e+30, 1e+31, 1e+32, 1e+33, 1e+34, 1e+35, 1e+36, 1e+37, 1e+38, 1e+39, 1e+40,
+        1e+41, 1e+42, 1e+43, 1e+44, 1e+45, 1e+46, 1e+47, 1e+48, 1e+49, 1e+50, 1e+51, 1e+52, 1e+53, 1e+54, 1e+55, 1e+56, 1e+57, 1e+58, 1e+59, 1e+60,
+        1e+61, 1e+62, 1e+63, 1e+64, 1e+65, 1e+66, 1e+67, 1e+68, 1e+69, 1e+70, 1e+71, 1e+72, 1e+73, 1e+74, 1e+75, 1e+76, 1e+77, 1e+78, 1e+79, 1e+80,
+        1e+81, 1e+82, 1e+83, 1e+84, 1e+85, 1e+86, 1e+87, 1e+88, 1e+89, 1e+90, 1e+91, 1e+92, 1e+93, 1e+94, 1e+95, 1e+96, 1e+97, 1e+98, 1e+99, 1e+100,
+        1e+101,1e+102,1e+103,1e+104,1e+105,1e+106,1e+107,1e+108,1e+109,1e+110,1e+111,1e+112,1e+113,1e+114,1e+115,1e+116,1e+117,1e+118,1e+119,1e+120,
+        1e+121,1e+122,1e+123,1e+124,1e+125,1e+126,1e+127,1e+128,1e+129,1e+130,1e+131,1e+132,1e+133,1e+134,1e+135,1e+136,1e+137,1e+138,1e+139,1e+140,
+        1e+141,1e+142,1e+143,1e+144,1e+145,1e+146,1e+147,1e+148,1e+149,1e+150,1e+151,1e+152,1e+153,1e+154,1e+155,1e+156,1e+157,1e+158,1e+159,1e+160,
+        1e+161,1e+162,1e+163,1e+164,1e+165,1e+166,1e+167,1e+168,1e+169,1e+170,1e+171,1e+172,1e+173,1e+174,1e+175,1e+176,1e+177,1e+178,1e+179,1e+180,
+        1e+181,1e+182,1e+183,1e+184,1e+185,1e+186,1e+187,1e+188,1e+189,1e+190,1e+191,1e+192,1e+193,1e+194,1e+195,1e+196,1e+197,1e+198,1e+199,1e+200,
+        1e+201,1e+202,1e+203,1e+204,1e+205,1e+206,1e+207,1e+208,1e+209,1e+210,1e+211,1e+212,1e+213,1e+214,1e+215,1e+216,1e+217,1e+218,1e+219,1e+220,
+        1e+221,1e+222,1e+223,1e+224,1e+225,1e+226,1e+227,1e+228,1e+229,1e+230,1e+231,1e+232,1e+233,1e+234,1e+235,1e+236,1e+237,1e+238,1e+239,1e+240,
+        1e+241,1e+242,1e+243,1e+244,1e+245,1e+246,1e+247,1e+248,1e+249,1e+250,1e+251,1e+252,1e+253,1e+254,1e+255,1e+256,1e+257,1e+258,1e+259,1e+260,
+        1e+261,1e+262,1e+263,1e+264,1e+265,1e+266,1e+267,1e+268,1e+269,1e+270,1e+271,1e+272,1e+273,1e+274,1e+275,1e+276,1e+277,1e+278,1e+279,1e+280,
+        1e+281,1e+282,1e+283,1e+284,1e+285,1e+286,1e+287,1e+288,1e+289,1e+290,1e+291,1e+292,1e+293,1e+294,1e+295,1e+296,1e+297,1e+298,1e+299,1e+300,
+        1e+301,1e+302,1e+303,1e+304,1e+305,1e+306,1e+307,1e+308
+    };
+    RAPIDJSON_ASSERT(n >= 0 && n <= 308);
+    return e[n];
+}
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_POW10_
diff --git a/General/General/include/rapidjson/internal/regex.h b/General/General/include/rapidjson/internal/regex.h
new file mode 100644
index 0000000..6446c40
--- /dev/null
+++ b/General/General/include/rapidjson/internal/regex.h
@@ -0,0 +1,739 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_INTERNAL_REGEX_H_
+#define RAPIDJSON_INTERNAL_REGEX_H_
+
+#include "../allocators.h"
+#include "../stream.h"
+#include "stack.h"
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+RAPIDJSON_DIAG_OFF(switch-enum)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4512) // assignment operator could not be generated
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#ifndef RAPIDJSON_REGEX_VERBOSE
+#define RAPIDJSON_REGEX_VERBOSE 0
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+///////////////////////////////////////////////////////////////////////////////
+// DecodedStream
+
+template <typename SourceStream, typename Encoding>
+class DecodedStream {
+public:
+    DecodedStream(SourceStream& ss) : ss_(ss), codepoint_() { Decode(); }
+    unsigned Peek() { return codepoint_; }
+    unsigned Take() {
+        unsigned c = codepoint_;
+        if (c) // No further decoding when '\0'
+            Decode();
+        return c;
+    }
+
+private:
+    void Decode() {
+        if (!Encoding::Decode(ss_, &codepoint_))
+            codepoint_ = 0;
+    }
+
+    SourceStream& ss_;
+    unsigned codepoint_;
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericRegex
+
+static const SizeType kRegexInvalidState = ~SizeType(0);  //!< Represents an invalid index in GenericRegex::State::out, out1
+static const SizeType kRegexInvalidRange = ~SizeType(0);
+
+template <typename Encoding, typename Allocator>
+class GenericRegexSearch;
+
+//! Regular expression engine with subset of ECMAscript grammar.
+/*!
+    Supported regular expression syntax:
+    - \c ab     Concatenation
+    - \c a|b    Alternation
+    - \c a?     Zero or one
+    - \c a*     Zero or more
+    - \c a+     One or more
+    - \c a{3}   Exactly 3 times
+    - \c a{3,}  At least 3 times
+    - \c a{3,5} 3 to 5 times
+    - \c (ab)   Grouping
+    - \c ^a     At the beginning
+    - \c a$     At the end
+    - \c .      Any character
+    - \c [abc]  Character classes
+    - \c [a-c]  Character class range
+    - \c [a-z0-9_] Character class combination
+    - \c [^abc] Negated character classes
+    - \c [^a-c] Negated character class range
+    - \c [\b]   Backspace (U+0008)
+    - \c \\| \\\\ ...  Escape characters
+    - \c \\f Form feed (U+000C)
+    - \c \\n Line feed (U+000A)
+    - \c \\r Carriage return (U+000D)
+    - \c \\t Tab (U+0009)
+    - \c \\v Vertical tab (U+000B)
+
+    \note This is a Thompson NFA engine, implemented with reference to 
+        Cox, Russ. "Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby,...).", 
+        https://swtch.com/~rsc/regexp/regexp1.html 
+*/
+template <typename Encoding, typename Allocator = CrtAllocator>
+class GenericRegex {
+public:
+    typedef Encoding EncodingType;
+    typedef typename Encoding::Ch Ch;
+    template <typename, typename> friend class GenericRegexSearch;
+
+    GenericRegex(const Ch* source, Allocator* allocator = 0) : 
+        ownAllocator_(allocator ? 0 : RAPIDJSON_NEW(Allocator)()), allocator_(allocator ? allocator : ownAllocator_), 
+        states_(allocator_, 256), ranges_(allocator_, 256), root_(kRegexInvalidState), stateCount_(), rangeCount_(), 
+        anchorBegin_(), anchorEnd_()
+    {
+        GenericStringStream<Encoding> ss(source);
+        DecodedStream<GenericStringStream<Encoding>, Encoding> ds(ss);
+        Parse(ds);
+    }
+
+    ~GenericRegex()
+    {
+        RAPIDJSON_DELETE(ownAllocator_);
+    }
+
+    bool IsValid() const {
+        return root_ != kRegexInvalidState;
+    }
+
+private:
+    enum Operator {
+        kZeroOrOne,
+        kZeroOrMore,
+        kOneOrMore,
+        kConcatenation,
+        kAlternation,
+        kLeftParenthesis
+    };
+
+    static const unsigned kAnyCharacterClass = 0xFFFFFFFF;   //!< For '.'
+    static const unsigned kRangeCharacterClass = 0xFFFFFFFE;
+    static const unsigned kRangeNegationFlag = 0x80000000;
+
+    struct Range {
+        unsigned start; // 
+        unsigned end;
+        SizeType next;
+    };
+
+    struct State {
+        SizeType out;     //!< Equals to kInvalid for matching state
+        SizeType out1;    //!< Equals to non-kInvalid for split
+        SizeType rangeStart;
+        unsigned codepoint;
+    };
+
+    struct Frag {
+        Frag(SizeType s, SizeType o, SizeType m) : start(s), out(o), minIndex(m) {}
+        SizeType start;
+        SizeType out; //!< link-list of all output states
+        SizeType minIndex;
+    };
+
+    State& GetState(SizeType index) {
+        RAPIDJSON_ASSERT(index < stateCount_);
+        return states_.template Bottom<State>()[index];
+    }
+
+    const State& GetState(SizeType index) const {
+        RAPIDJSON_ASSERT(index < stateCount_);
+        return states_.template Bottom<State>()[index];
+    }
+
+    Range& GetRange(SizeType index) {
+        RAPIDJSON_ASSERT(index < rangeCount_);
+        return ranges_.template Bottom<Range>()[index];
+    }
+
+    const Range& GetRange(SizeType index) const {
+        RAPIDJSON_ASSERT(index < rangeCount_);
+        return ranges_.template Bottom<Range>()[index];
+    }
+
+    template <typename InputStream>
+    void Parse(DecodedStream<InputStream, Encoding>& ds) {
+        Stack<Allocator> operandStack(allocator_, 256);    // Frag
+        Stack<Allocator> operatorStack(allocator_, 256);   // Operator
+        Stack<Allocator> atomCountStack(allocator_, 256);  // unsigned (Atom per parenthesis)
+
+        *atomCountStack.template Push<unsigned>() = 0;
+
+        unsigned codepoint;
+        while (ds.Peek() != 0) {
+            switch (codepoint = ds.Take()) {
+                case '^':
+                    anchorBegin_ = true;
+                    break;
+
+                case '$':
+                    anchorEnd_ = true;
+                    break;
+
+                case '|':
+                    while (!operatorStack.Empty() && *operatorStack.template Top<Operator>() < kAlternation)
+                        if (!Eval(operandStack, *operatorStack.template Pop<Operator>(1)))
+                            return;
+                    *operatorStack.template Push<Operator>() = kAlternation;
+                    *atomCountStack.template Top<unsigned>() = 0;
+                    break;
+
+                case '(':
+                    *operatorStack.template Push<Operator>() = kLeftParenthesis;
+                    *atomCountStack.template Push<unsigned>() = 0;
+                    break;
+
+                case ')':
+                    while (!operatorStack.Empty() && *operatorStack.template Top<Operator>() != kLeftParenthesis)
+                        if (!Eval(operandStack, *operatorStack.template Pop<Operator>(1)))
+                            return;
+                    if (operatorStack.Empty())
+                        return;
+                    operatorStack.template Pop<Operator>(1);
+                    atomCountStack.template Pop<unsigned>(1);
+                    ImplicitConcatenation(atomCountStack, operatorStack);
+                    break;
+
+                case '?':
+                    if (!Eval(operandStack, kZeroOrOne))
+                        return;
+                    break;
+
+                case '*':
+                    if (!Eval(operandStack, kZeroOrMore))
+                        return;
+                    break;
+
+                case '+':
+                    if (!Eval(operandStack, kOneOrMore))
+                        return;
+                    break;
+
+                case '{':
+                    {
+                        unsigned n, m;
+                        if (!ParseUnsigned(ds, &n))
+                            return;
+
+                        if (ds.Peek() == ',') {
+                            ds.Take();
+                            if (ds.Peek() == '}')
+                                m = kInfinityQuantifier;
+                            else if (!ParseUnsigned(ds, &m) || m < n)
+                                return;
+                        }
+                        else
+                            m = n;
+
+                        if (!EvalQuantifier(operandStack, n, m) || ds.Peek() != '}')
+                            return;
+                        ds.Take();
+                    }
+                    break;
+
+                case '.':
+                    PushOperand(operandStack, kAnyCharacterClass);
+                    ImplicitConcatenation(atomCountStack, operatorStack);
+                    break;
+
+                case '[':
+                    {
+                        SizeType range;
+                        if (!ParseRange(ds, &range))
+                            return;
+                        SizeType s = NewState(kRegexInvalidState, kRegexInvalidState, kRangeCharacterClass);
+                        GetState(s).rangeStart = range;
+                        *operandStack.template Push<Frag>() = Frag(s, s, s);
+                    }
+                    ImplicitConcatenation(atomCountStack, operatorStack);
+                    break;
+
+                case '\\': // Escape character
+                    if (!CharacterEscape(ds, &codepoint))
+                        return; // Unsupported escape character
+                    // fall through to default
+                    RAPIDJSON_DELIBERATE_FALLTHROUGH;
+
+                default: // Pattern character
+                    PushOperand(operandStack, codepoint);
+                    ImplicitConcatenation(atomCountStack, operatorStack);
+            }
+        }
+
+        while (!operatorStack.Empty())
+            if (!Eval(operandStack, *operatorStack.template Pop<Operator>(1)))
+                return;
+
+        // Link the operand to matching state.
+        if (operandStack.GetSize() == sizeof(Frag)) {
+            Frag* e = operandStack.template Pop<Frag>(1);
+            Patch(e->out, NewState(kRegexInvalidState, kRegexInvalidState, 0));
+            root_ = e->start;
+
+#if RAPIDJSON_REGEX_VERBOSE
+            printf("root: %d\n", root_);
+            for (SizeType i = 0; i < stateCount_ ; i++) {
+                State& s = GetState(i);
+                printf("[%2d] out: %2d out1: %2d c: '%c'\n", i, s.out, s.out1, (char)s.codepoint);
+            }
+            printf("\n");
+#endif
+        }
+    }
+
+    SizeType NewState(SizeType out, SizeType out1, unsigned codepoint) {
+        State* s = states_.template Push<State>();
+        s->out = out;
+        s->out1 = out1;
+        s->codepoint = codepoint;
+        s->rangeStart = kRegexInvalidRange;
+        return stateCount_++;
+    }
+
+    void PushOperand(Stack<Allocator>& operandStack, unsigned codepoint) {
+        SizeType s = NewState(kRegexInvalidState, kRegexInvalidState, codepoint);
+        *operandStack.template Push<Frag>() = Frag(s, s, s);
+    }
+
+    void ImplicitConcatenation(Stack<Allocator>& atomCountStack, Stack<Allocator>& operatorStack) {
+        if (*atomCountStack.template Top<unsigned>())
+            *operatorStack.template Push<Operator>() = kConcatenation;
+        (*atomCountStack.template Top<unsigned>())++;
+    }
+
+    SizeType Append(SizeType l1, SizeType l2) {
+        SizeType old = l1;
+        while (GetState(l1).out != kRegexInvalidState)
+            l1 = GetState(l1).out;
+        GetState(l1).out = l2;
+        return old;
+    }
+
+    void Patch(SizeType l, SizeType s) {
+        for (SizeType next; l != kRegexInvalidState; l = next) {
+            next = GetState(l).out;
+            GetState(l).out = s;
+        }
+    }
+
+    bool Eval(Stack<Allocator>& operandStack, Operator op) {
+        switch (op) {
+            case kConcatenation:
+                RAPIDJSON_ASSERT(operandStack.GetSize() >= sizeof(Frag) * 2);
+                {
+                    Frag e2 = *operandStack.template Pop<Frag>(1);
+                    Frag e1 = *operandStack.template Pop<Frag>(1);
+                    Patch(e1.out, e2.start);
+                    *operandStack.template Push<Frag>() = Frag(e1.start, e2.out, Min(e1.minIndex, e2.minIndex));
+                }
+                return true;
+
+            case kAlternation:
+                if (operandStack.GetSize() >= sizeof(Frag) * 2) {
+                    Frag e2 = *operandStack.template Pop<Frag>(1);
+                    Frag e1 = *operandStack.template Pop<Frag>(1);
+                    SizeType s = NewState(e1.start, e2.start, 0);
+                    *operandStack.template Push<Frag>() = Frag(s, Append(e1.out, e2.out), Min(e1.minIndex, e2.minIndex));
+                    return true;
+                }
+                return false;
+
+            case kZeroOrOne:
+                if (operandStack.GetSize() >= sizeof(Frag)) {
+                    Frag e = *operandStack.template Pop<Frag>(1);
+                    SizeType s = NewState(kRegexInvalidState, e.start, 0);
+                    *operandStack.template Push<Frag>() = Frag(s, Append(e.out, s), e.minIndex);
+                    return true;
+                }
+                return false;
+
+            case kZeroOrMore:
+                if (operandStack.GetSize() >= sizeof(Frag)) {
+                    Frag e = *operandStack.template Pop<Frag>(1);
+                    SizeType s = NewState(kRegexInvalidState, e.start, 0);
+                    Patch(e.out, s);
+                    *operandStack.template Push<Frag>() = Frag(s, s, e.minIndex);
+                    return true;
+                }
+                return false;
+
+            case kOneOrMore:
+                if (operandStack.GetSize() >= sizeof(Frag)) {
+                    Frag e = *operandStack.template Pop<Frag>(1);
+                    SizeType s = NewState(kRegexInvalidState, e.start, 0);
+                    Patch(e.out, s);
+                    *operandStack.template Push<Frag>() = Frag(e.start, s, e.minIndex);
+                    return true;
+                }
+                return false;
+
+            default: 
+                // syntax error (e.g. unclosed kLeftParenthesis)
+                return false;
+        }
+    }
+
+    bool EvalQuantifier(Stack<Allocator>& operandStack, unsigned n, unsigned m) {
+        RAPIDJSON_ASSERT(n <= m);
+        RAPIDJSON_ASSERT(operandStack.GetSize() >= sizeof(Frag));
+
+        if (n == 0) {
+            if (m == 0)                             // a{0} not support
+                return false;
+            else if (m == kInfinityQuantifier)
+                Eval(operandStack, kZeroOrMore);    // a{0,} -> a*
+            else {
+                Eval(operandStack, kZeroOrOne);         // a{0,5} -> a?
+                for (unsigned i = 0; i < m - 1; i++)
+                    CloneTopOperand(operandStack);      // a{0,5} -> a? a? a? a? a?
+                for (unsigned i = 0; i < m - 1; i++)
+                    Eval(operandStack, kConcatenation); // a{0,5} -> a?a?a?a?a?
+            }
+            return true;
+        }
+
+        for (unsigned i = 0; i < n - 1; i++)        // a{3} -> a a a
+            CloneTopOperand(operandStack);
+
+        if (m == kInfinityQuantifier)
+            Eval(operandStack, kOneOrMore);         // a{3,} -> a a a+
+        else if (m > n) {
+            CloneTopOperand(operandStack);          // a{3,5} -> a a a a
+            Eval(operandStack, kZeroOrOne);         // a{3,5} -> a a a a?
+            for (unsigned i = n; i < m - 1; i++)
+                CloneTopOperand(operandStack);      // a{3,5} -> a a a a? a?
+            for (unsigned i = n; i < m; i++)
+                Eval(operandStack, kConcatenation); // a{3,5} -> a a aa?a?
+        }
+
+        for (unsigned i = 0; i < n - 1; i++)
+            Eval(operandStack, kConcatenation);     // a{3} -> aaa, a{3,} -> aaa+, a{3.5} -> aaaa?a?
+
+        return true;
+    }
+
+    static SizeType Min(SizeType a, SizeType b) { return a < b ? a : b; }
+
+    void CloneTopOperand(Stack<Allocator>& operandStack) {
+        const Frag src = *operandStack.template Top<Frag>(); // Copy constructor to prevent invalidation
+        SizeType count = stateCount_ - src.minIndex; // Assumes top operand contains states in [src->minIndex, stateCount_)
+        State* s = states_.template Push<State>(count);
+        memcpy(s, &GetState(src.minIndex), count * sizeof(State));
+        for (SizeType j = 0; j < count; j++) {
+            if (s[j].out != kRegexInvalidState)
+                s[j].out += count;
+            if (s[j].out1 != kRegexInvalidState)
+                s[j].out1 += count;
+        }
+        *operandStack.template Push<Frag>() = Frag(src.start + count, src.out + count, src.minIndex + count);
+        stateCount_ += count;
+    }
+
+    template <typename InputStream>
+    bool ParseUnsigned(DecodedStream<InputStream, Encoding>& ds, unsigned* u) {
+        unsigned r = 0;
+        if (ds.Peek() < '0' || ds.Peek() > '9')
+            return false;
+        while (ds.Peek() >= '0' && ds.Peek() <= '9') {
+            if (r >= 429496729 && ds.Peek() > '5') // 2^32 - 1 = 4294967295
+                return false; // overflow
+            r = r * 10 + (ds.Take() - '0');
+        }
+        *u = r;
+        return true;
+    }
+
+    template <typename InputStream>
+    bool ParseRange(DecodedStream<InputStream, Encoding>& ds, SizeType* range) {
+        bool isBegin = true;
+        bool negate = false;
+        int step = 0;
+        SizeType start = kRegexInvalidRange;
+        SizeType current = kRegexInvalidRange;
+        unsigned codepoint;
+        while ((codepoint = ds.Take()) != 0) {
+            if (isBegin) {
+                isBegin = false;
+                if (codepoint == '^') {
+                    negate = true;
+                    continue;
+                }
+            }
+
+            switch (codepoint) {
+            case ']':
+                if (start == kRegexInvalidRange)
+                    return false;   // Error: nothing inside []
+                if (step == 2) { // Add trailing '-'
+                    SizeType r = NewRange('-');
+                    RAPIDJSON_ASSERT(current != kRegexInvalidRange);
+                    GetRange(current).next = r;
+                }
+                if (negate)
+                    GetRange(start).start |= kRangeNegationFlag;
+                *range = start;
+                return true;
+
+            case '\\':
+                if (ds.Peek() == 'b') {
+                    ds.Take();
+                    codepoint = 0x0008; // Escape backspace character
+                }
+                else if (!CharacterEscape(ds, &codepoint))
+                    return false;
+                // fall through to default
+                RAPIDJSON_DELIBERATE_FALLTHROUGH;
+
+            default:
+                switch (step) {
+                case 1:
+                    if (codepoint == '-') {
+                        step++;
+                        break;
+                    }
+                    // fall through to step 0 for other characters
+                    RAPIDJSON_DELIBERATE_FALLTHROUGH;
+
+                case 0:
+                    {
+                        SizeType r = NewRange(codepoint);
+                        if (current != kRegexInvalidRange)
+                            GetRange(current).next = r;
+                        if (start == kRegexInvalidRange)
+                            start = r;
+                        current = r;
+                    }
+                    step = 1;
+                    break;
+
+                default:
+                    RAPIDJSON_ASSERT(step == 2);
+                    GetRange(current).end = codepoint;
+                    step = 0;
+                }
+            }
+        }
+        return false;
+    }
+    
+    SizeType NewRange(unsigned codepoint) {
+        Range* r = ranges_.template Push<Range>();
+        r->start = r->end = codepoint;
+        r->next = kRegexInvalidRange;
+        return rangeCount_++;
+    }
+
+    template <typename InputStream>
+    bool CharacterEscape(DecodedStream<InputStream, Encoding>& ds, unsigned* escapedCodepoint) {
+        unsigned codepoint;
+        switch (codepoint = ds.Take()) {
+            case '^':
+            case '$':
+            case '|':
+            case '(':
+            case ')':
+            case '?':
+            case '*':
+            case '+':
+            case '.':
+            case '[':
+            case ']':
+            case '{':
+            case '}':
+            case '\\':
+                *escapedCodepoint = codepoint; return true;
+            case 'f': *escapedCodepoint = 0x000C; return true;
+            case 'n': *escapedCodepoint = 0x000A; return true;
+            case 'r': *escapedCodepoint = 0x000D; return true;
+            case 't': *escapedCodepoint = 0x0009; return true;
+            case 'v': *escapedCodepoint = 0x000B; return true;
+            default:
+                return false; // Unsupported escape character
+        }
+    }
+
+    Allocator* ownAllocator_;
+    Allocator* allocator_;
+    Stack<Allocator> states_;
+    Stack<Allocator> ranges_;
+    SizeType root_;
+    SizeType stateCount_;
+    SizeType rangeCount_;
+
+    static const unsigned kInfinityQuantifier = ~0u;
+
+    // For SearchWithAnchoring()
+    bool anchorBegin_;
+    bool anchorEnd_;
+};
+
+template <typename RegexType, typename Allocator = CrtAllocator>
+class GenericRegexSearch {
+public:
+    typedef typename RegexType::EncodingType Encoding;
+    typedef typename Encoding::Ch Ch;
+
+    GenericRegexSearch(const RegexType& regex, Allocator* allocator = 0) : 
+        regex_(regex), allocator_(allocator), ownAllocator_(0),
+        state0_(allocator, 0), state1_(allocator, 0), stateSet_()
+    {
+        RAPIDJSON_ASSERT(regex_.IsValid());
+        if (!allocator_)
+            ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+        stateSet_ = static_cast<unsigned*>(allocator_->Malloc(GetStateSetSize()));
+        state0_.template Reserve<SizeType>(regex_.stateCount_);
+        state1_.template Reserve<SizeType>(regex_.stateCount_);
+    }
+
+    ~GenericRegexSearch() {
+        Allocator::Free(stateSet_);
+        RAPIDJSON_DELETE(ownAllocator_);
+    }
+
+    template <typename InputStream>
+    bool Match(InputStream& is) {
+        return SearchWithAnchoring(is, true, true);
+    }
+
+    bool Match(const Ch* s) {
+        GenericStringStream<Encoding> is(s);
+        return Match(is);
+    }
+
+    template <typename InputStream>
+    bool Search(InputStream& is) {
+        return SearchWithAnchoring(is, regex_.anchorBegin_, regex_.anchorEnd_);
+    }
+
+    bool Search(const Ch* s) {
+        GenericStringStream<Encoding> is(s);
+        return Search(is);
+    }
+
+private:
+    typedef typename RegexType::State State;
+    typedef typename RegexType::Range Range;
+
+    template <typename InputStream>
+    bool SearchWithAnchoring(InputStream& is, bool anchorBegin, bool anchorEnd) {
+        DecodedStream<InputStream, Encoding> ds(is);
+
+        state0_.Clear();
+        Stack<Allocator> *current = &state0_, *next = &state1_;
+        const size_t stateSetSize = GetStateSetSize();
+        std::memset(stateSet_, 0, stateSetSize);
+
+        bool matched = AddState(*current, regex_.root_);
+        unsigned codepoint;
+        while (!current->Empty() && (codepoint = ds.Take()) != 0) {
+            std::memset(stateSet_, 0, stateSetSize);
+            next->Clear();
+            matched = false;
+            for (const SizeType* s = current->template Bottom<SizeType>(); s != current->template End<SizeType>(); ++s) {
+                const State& sr = regex_.GetState(*s);
+                if (sr.codepoint == codepoint ||
+                    sr.codepoint == RegexType::kAnyCharacterClass || 
+                    (sr.codepoint == RegexType::kRangeCharacterClass && MatchRange(sr.rangeStart, codepoint)))
+                {
+                    matched = AddState(*next, sr.out) || matched;
+                    if (!anchorEnd && matched)
+                        return true;
+                }
+                if (!anchorBegin)
+                    AddState(*next, regex_.root_);
+            }
+            internal::Swap(current, next);
+        }
+
+        return matched;
+    }
+
+    size_t GetStateSetSize() const {
+        return (regex_.stateCount_ + 31) / 32 * 4;
+    }
+
+    // Return whether the added states is a match state
+    bool AddState(Stack<Allocator>& l, SizeType index) {
+        RAPIDJSON_ASSERT(index != kRegexInvalidState);
+
+        const State& s = regex_.GetState(index);
+        if (s.out1 != kRegexInvalidState) { // Split
+            bool matched = AddState(l, s.out);
+            return AddState(l, s.out1) || matched;
+        }
+        else if (!(stateSet_[index >> 5] & (1u << (index & 31)))) {
+            stateSet_[index >> 5] |= (1u << (index & 31));
+            *l.template PushUnsafe<SizeType>() = index;
+        }
+        return s.out == kRegexInvalidState; // by using PushUnsafe() above, we can ensure s is not validated due to reallocation.
+    }
+
+    bool MatchRange(SizeType rangeIndex, unsigned codepoint) const {
+        bool yes = (regex_.GetRange(rangeIndex).start & RegexType::kRangeNegationFlag) == 0;
+        while (rangeIndex != kRegexInvalidRange) {
+            const Range& r = regex_.GetRange(rangeIndex);
+            if (codepoint >= (r.start & ~RegexType::kRangeNegationFlag) && codepoint <= r.end)
+                return yes;
+            rangeIndex = r.next;
+        }
+        return !yes;
+    }
+
+    const RegexType& regex_;
+    Allocator* allocator_;
+    Allocator* ownAllocator_;
+    Stack<Allocator> state0_;
+    Stack<Allocator> state1_;
+    uint32_t* stateSet_;
+};
+
+typedef GenericRegex<UTF8<> > Regex;
+typedef GenericRegexSearch<Regex> RegexSearch;
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+#if defined(__clang__) || defined(_MSC_VER)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_INTERNAL_REGEX_H_
diff --git a/General/General/include/rapidjson/internal/stack.h b/General/General/include/rapidjson/internal/stack.h
new file mode 100644
index 0000000..73abd70
--- /dev/null
+++ b/General/General/include/rapidjson/internal/stack.h
@@ -0,0 +1,232 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_INTERNAL_STACK_H_
+#define RAPIDJSON_INTERNAL_STACK_H_
+
+#include "../allocators.h"
+#include "swap.h"
+#include <cstddef>
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+///////////////////////////////////////////////////////////////////////////////
+// Stack
+
+//! A type-unsafe stack for storing different types of data.
+/*! \tparam Allocator Allocator for allocating stack memory.
+*/
+template <typename Allocator>
+class Stack {
+public:
+    // Optimization note: Do not allocate memory for stack_ in constructor.
+    // Do it lazily when first Push() -> Expand() -> Resize().
+    Stack(Allocator* allocator, size_t stackCapacity) : allocator_(allocator), ownAllocator_(0), stack_(0), stackTop_(0), stackEnd_(0), initialCapacity_(stackCapacity) {
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    Stack(Stack&& rhs)
+        : allocator_(rhs.allocator_),
+          ownAllocator_(rhs.ownAllocator_),
+          stack_(rhs.stack_),
+          stackTop_(rhs.stackTop_),
+          stackEnd_(rhs.stackEnd_),
+          initialCapacity_(rhs.initialCapacity_)
+    {
+        rhs.allocator_ = 0;
+        rhs.ownAllocator_ = 0;
+        rhs.stack_ = 0;
+        rhs.stackTop_ = 0;
+        rhs.stackEnd_ = 0;
+        rhs.initialCapacity_ = 0;
+    }
+#endif
+
+    ~Stack() {
+        Destroy();
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    Stack& operator=(Stack&& rhs) {
+        if (&rhs != this)
+        {
+            Destroy();
+
+            allocator_ = rhs.allocator_;
+            ownAllocator_ = rhs.ownAllocator_;
+            stack_ = rhs.stack_;
+            stackTop_ = rhs.stackTop_;
+            stackEnd_ = rhs.stackEnd_;
+            initialCapacity_ = rhs.initialCapacity_;
+
+            rhs.allocator_ = 0;
+            rhs.ownAllocator_ = 0;
+            rhs.stack_ = 0;
+            rhs.stackTop_ = 0;
+            rhs.stackEnd_ = 0;
+            rhs.initialCapacity_ = 0;
+        }
+        return *this;
+    }
+#endif
+
+    void Swap(Stack& rhs) RAPIDJSON_NOEXCEPT {
+        internal::Swap(allocator_, rhs.allocator_);
+        internal::Swap(ownAllocator_, rhs.ownAllocator_);
+        internal::Swap(stack_, rhs.stack_);
+        internal::Swap(stackTop_, rhs.stackTop_);
+        internal::Swap(stackEnd_, rhs.stackEnd_);
+        internal::Swap(initialCapacity_, rhs.initialCapacity_);
+    }
+
+    void Clear() { stackTop_ = stack_; }
+
+    void ShrinkToFit() { 
+        if (Empty()) {
+            // If the stack is empty, completely deallocate the memory.
+            Allocator::Free(stack_); // NOLINT (+clang-analyzer-unix.Malloc)
+            stack_ = 0;
+            stackTop_ = 0;
+            stackEnd_ = 0;
+        }
+        else
+            Resize(GetSize());
+    }
+
+    // Optimization note: try to minimize the size of this function for force inline.
+    // Expansion is run very infrequently, so it is moved to another (probably non-inline) function.
+    template<typename T>
+    RAPIDJSON_FORCEINLINE void Reserve(size_t count = 1) {
+         // Expand the stack if needed
+        if (RAPIDJSON_UNLIKELY(static_cast<std::ptrdiff_t>(sizeof(T) * count) > (stackEnd_ - stackTop_)))
+            Expand<T>(count);
+    }
+
+    template<typename T>
+    RAPIDJSON_FORCEINLINE T* Push(size_t count = 1) {
+        Reserve<T>(count);
+        return PushUnsafe<T>(count);
+    }
+
+    template<typename T>
+    RAPIDJSON_FORCEINLINE T* PushUnsafe(size_t count = 1) {
+        RAPIDJSON_ASSERT(stackTop_);
+        RAPIDJSON_ASSERT(static_cast<std::ptrdiff_t>(sizeof(T) * count) <= (stackEnd_ - stackTop_));
+        T* ret = reinterpret_cast<T*>(stackTop_);
+        stackTop_ += sizeof(T) * count;
+        return ret;
+    }
+
+    template<typename T>
+    T* Pop(size_t count) {
+        RAPIDJSON_ASSERT(GetSize() >= count * sizeof(T));
+        stackTop_ -= count * sizeof(T);
+        return reinterpret_cast<T*>(stackTop_);
+    }
+
+    template<typename T>
+    T* Top() { 
+        RAPIDJSON_ASSERT(GetSize() >= sizeof(T));
+        return reinterpret_cast<T*>(stackTop_ - sizeof(T));
+    }
+
+    template<typename T>
+    const T* Top() const {
+        RAPIDJSON_ASSERT(GetSize() >= sizeof(T));
+        return reinterpret_cast<T*>(stackTop_ - sizeof(T));
+    }
+
+    template<typename T>
+    T* End() { return reinterpret_cast<T*>(stackTop_); }
+
+    template<typename T>
+    const T* End() const { return reinterpret_cast<T*>(stackTop_); }
+
+    template<typename T>
+    T* Bottom() { return reinterpret_cast<T*>(stack_); }
+
+    template<typename T>
+    const T* Bottom() const { return reinterpret_cast<T*>(stack_); }
+
+    bool HasAllocator() const {
+        return allocator_ != 0;
+    }
+
+    Allocator& GetAllocator() {
+        RAPIDJSON_ASSERT(allocator_);
+        return *allocator_;
+    }
+
+    bool Empty() const { return stackTop_ == stack_; }
+    size_t GetSize() const { return static_cast<size_t>(stackTop_ - stack_); }
+    size_t GetCapacity() const { return static_cast<size_t>(stackEnd_ - stack_); }
+
+private:
+    template<typename T>
+    void Expand(size_t count) {
+        // Only expand the capacity if the current stack exists. Otherwise just create a stack with initial capacity.
+        size_t newCapacity;
+        if (stack_ == 0) {
+            if (!allocator_)
+                ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+            newCapacity = initialCapacity_;
+        } else {
+            newCapacity = GetCapacity();
+            newCapacity += (newCapacity + 1) / 2;
+        }
+        size_t newSize = GetSize() + sizeof(T) * count;
+        if (newCapacity < newSize)
+            newCapacity = newSize;
+
+        Resize(newCapacity);
+    }
+
+    void Resize(size_t newCapacity) {
+        const size_t size = GetSize();  // Backup the current size
+        stack_ = static_cast<char*>(allocator_->Realloc(stack_, GetCapacity(), newCapacity));
+        stackTop_ = stack_ + size;
+        stackEnd_ = stack_ + newCapacity;
+    }
+
+    void Destroy() {
+        Allocator::Free(stack_);
+        RAPIDJSON_DELETE(ownAllocator_); // Only delete if it is owned by the stack
+    }
+
+    // Prohibit copy constructor & assignment operator.
+    Stack(const Stack&);
+    Stack& operator=(const Stack&);
+
+    Allocator* allocator_;
+    Allocator* ownAllocator_;
+    char *stack_;
+    char *stackTop_;
+    char *stackEnd_;
+    size_t initialCapacity_;
+};
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_STACK_H_
diff --git a/General/General/include/rapidjson/internal/strfunc.h b/General/General/include/rapidjson/internal/strfunc.h
new file mode 100644
index 0000000..b698a8f
--- /dev/null
+++ b/General/General/include/rapidjson/internal/strfunc.h
@@ -0,0 +1,83 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_INTERNAL_STRFUNC_H_
+#define RAPIDJSON_INTERNAL_STRFUNC_H_
+
+#include "../stream.h"
+#include <cwchar>
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+//! Custom strlen() which works on different character types.
+/*! \tparam Ch Character type (e.g. char, wchar_t, short)
+    \param s Null-terminated input string.
+    \return Number of characters in the string. 
+    \note This has the same semantics as strlen(), the return value is not number of Unicode codepoints.
+*/
+template <typename Ch>
+inline SizeType StrLen(const Ch* s) {
+    RAPIDJSON_ASSERT(s != 0);
+    const Ch* p = s;
+    while (*p) ++p;
+    return SizeType(p - s);
+}
+
+template <>
+inline SizeType StrLen(const char* s) {
+    return SizeType(std::strlen(s));
+}
+
+template <>
+inline SizeType StrLen(const wchar_t* s) {
+    return SizeType(std::wcslen(s));
+}
+
+//! Custom strcmpn() which works on different character types.
+/*! \tparam Ch Character type (e.g. char, wchar_t, short)
+    \param s1 Null-terminated input string.
+    \param s2 Null-terminated input string.
+    \return 0 if equal
+*/
+template<typename Ch>
+inline int StrCmp(const Ch* s1, const Ch* s2) {
+    RAPIDJSON_ASSERT(s1 != 0);
+    RAPIDJSON_ASSERT(s2 != 0);
+    while(*s1 && (*s1 == *s2)) { s1++; s2++; }
+    return static_cast<unsigned>(*s1) < static_cast<unsigned>(*s2) ? -1 : static_cast<unsigned>(*s1) > static_cast<unsigned>(*s2);
+}
+
+//! Returns number of code points in a encoded string.
+template<typename Encoding>
+bool CountStringCodePoint(const typename Encoding::Ch* s, SizeType length, SizeType* outCount) {
+    RAPIDJSON_ASSERT(s != 0);
+    RAPIDJSON_ASSERT(outCount != 0);
+    GenericStringStream<Encoding> is(s);
+    const typename Encoding::Ch* end = s + length;
+    SizeType count = 0;
+    while (is.src_ < end) {
+        unsigned codepoint;
+        if (!Encoding::Decode(is, &codepoint))
+            return false;
+        count++;
+    }
+    *outCount = count;
+    return true;
+}
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_INTERNAL_STRFUNC_H_
diff --git a/General/General/include/rapidjson/internal/strtod.h b/General/General/include/rapidjson/internal/strtod.h
new file mode 100644
index 0000000..55f0e38
--- /dev/null
+++ b/General/General/include/rapidjson/internal/strtod.h
@@ -0,0 +1,293 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_STRTOD_
+#define RAPIDJSON_STRTOD_
+
+#include "ieee754.h"
+#include "biginteger.h"
+#include "diyfp.h"
+#include "pow10.h"
+#include <climits>
+#include <limits>
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+inline double FastPath(double significand, int exp) {
+    if (exp < -308)
+        return 0.0;
+    else if (exp >= 0)
+        return significand * internal::Pow10(exp);
+    else
+        return significand / internal::Pow10(-exp);
+}
+
+inline double StrtodNormalPrecision(double d, int p) {
+    if (p < -308) {
+        // Prevent expSum < -308, making Pow10(p) = 0
+        d = FastPath(d, -308);
+        d = FastPath(d, p + 308);
+    }
+    else
+        d = FastPath(d, p);
+    return d;
+}
+
+template <typename T>
+inline T Min3(T a, T b, T c) {
+    T m = a;
+    if (m > b) m = b;
+    if (m > c) m = c;
+    return m;
+}
+
+inline int CheckWithinHalfULP(double b, const BigInteger& d, int dExp) {
+    const Double db(b);
+    const uint64_t bInt = db.IntegerSignificand();
+    const int bExp = db.IntegerExponent();
+    const int hExp = bExp - 1;
+
+    int dS_Exp2 = 0, dS_Exp5 = 0, bS_Exp2 = 0, bS_Exp5 = 0, hS_Exp2 = 0, hS_Exp5 = 0;
+
+    // Adjust for decimal exponent
+    if (dExp >= 0) {
+        dS_Exp2 += dExp;
+        dS_Exp5 += dExp;
+    }
+    else {
+        bS_Exp2 -= dExp;
+        bS_Exp5 -= dExp;
+        hS_Exp2 -= dExp;
+        hS_Exp5 -= dExp;
+    }
+
+    // Adjust for binary exponent
+    if (bExp >= 0)
+        bS_Exp2 += bExp;
+    else {
+        dS_Exp2 -= bExp;
+        hS_Exp2 -= bExp;
+    }
+
+    // Adjust for half ulp exponent
+    if (hExp >= 0)
+        hS_Exp2 += hExp;
+    else {
+        dS_Exp2 -= hExp;
+        bS_Exp2 -= hExp;
+    }
+
+    // Remove common power of two factor from all three scaled values
+    int common_Exp2 = Min3(dS_Exp2, bS_Exp2, hS_Exp2);
+    dS_Exp2 -= common_Exp2;
+    bS_Exp2 -= common_Exp2;
+    hS_Exp2 -= common_Exp2;
+
+    BigInteger dS = d;
+    dS.MultiplyPow5(static_cast<unsigned>(dS_Exp5)) <<= static_cast<unsigned>(dS_Exp2);
+
+    BigInteger bS(bInt);
+    bS.MultiplyPow5(static_cast<unsigned>(bS_Exp5)) <<= static_cast<unsigned>(bS_Exp2);
+
+    BigInteger hS(1);
+    hS.MultiplyPow5(static_cast<unsigned>(hS_Exp5)) <<= static_cast<unsigned>(hS_Exp2);
+
+    BigInteger delta(0);
+    dS.Difference(bS, &delta);
+
+    return delta.Compare(hS);
+}
+
+inline bool StrtodFast(double d, int p, double* result) {
+    // Use fast path for string-to-double conversion if possible
+    // see http://www.exploringbinary.com/fast-path-decimal-to-floating-point-conversion/
+    if (p > 22  && p < 22 + 16) {
+        // Fast Path Cases In Disguise
+        d *= internal::Pow10(p - 22);
+        p = 22;
+    }
+
+    if (p >= -22 && p <= 22 && d <= 9007199254740991.0) { // 2^53 - 1
+        *result = FastPath(d, p);
+        return true;
+    }
+    else
+        return false;
+}
+
+// Compute an approximation and see if it is within 1/2 ULP
+template<typename Ch>
+inline bool StrtodDiyFp(const Ch* decimals, int dLen, int dExp, double* result) {
+    uint64_t significand = 0;
+    int i = 0;   // 2^64 - 1 = 18446744073709551615, 1844674407370955161 = 0x1999999999999999    
+    for (; i < dLen; i++) {
+        if (significand  >  RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) ||
+            (significand == RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) && decimals[i] > Ch('5')))
+            break;
+        significand = significand * 10u + static_cast<unsigned>(decimals[i] - Ch('0'));
+    }
+    
+    if (i < dLen && decimals[i] >= Ch('5')) // Rounding
+        significand++;
+
+    int remaining = dLen - i;
+    const int kUlpShift = 3;
+    const int kUlp = 1 << kUlpShift;
+    int64_t error = (remaining == 0) ? 0 : kUlp / 2;
+
+    DiyFp v(significand, 0);
+    v = v.Normalize();
+    error <<= -v.e;
+
+    dExp += remaining;
+
+    int actualExp;
+    DiyFp cachedPower = GetCachedPower10(dExp, &actualExp);
+    if (actualExp != dExp) {
+        static const DiyFp kPow10[] = {
+            DiyFp(RAPIDJSON_UINT64_C2(0xa0000000, 0x00000000), -60),  // 10^1
+            DiyFp(RAPIDJSON_UINT64_C2(0xc8000000, 0x00000000), -57),  // 10^2
+            DiyFp(RAPIDJSON_UINT64_C2(0xfa000000, 0x00000000), -54),  // 10^3
+            DiyFp(RAPIDJSON_UINT64_C2(0x9c400000, 0x00000000), -50),  // 10^4
+            DiyFp(RAPIDJSON_UINT64_C2(0xc3500000, 0x00000000), -47),  // 10^5
+            DiyFp(RAPIDJSON_UINT64_C2(0xf4240000, 0x00000000), -44),  // 10^6
+            DiyFp(RAPIDJSON_UINT64_C2(0x98968000, 0x00000000), -40)   // 10^7
+        };
+        int adjustment = dExp - actualExp;
+        RAPIDJSON_ASSERT(adjustment >= 1 && adjustment < 8);
+        v = v * kPow10[adjustment - 1];
+        if (dLen + adjustment > 19) // has more digits than decimal digits in 64-bit
+            error += kUlp / 2;
+    }
+
+    v = v * cachedPower;
+
+    error += kUlp + (error == 0 ? 0 : 1);
+
+    const int oldExp = v.e;
+    v = v.Normalize();
+    error <<= oldExp - v.e;
+
+    const int effectiveSignificandSize = Double::EffectiveSignificandSize(64 + v.e);
+    int precisionSize = 64 - effectiveSignificandSize;
+    if (precisionSize + kUlpShift >= 64) {
+        int scaleExp = (precisionSize + kUlpShift) - 63;
+        v.f >>= scaleExp;
+        v.e += scaleExp; 
+        error = (error >> scaleExp) + 1 + kUlp;
+        precisionSize -= scaleExp;
+    }
+
+    DiyFp rounded(v.f >> precisionSize, v.e + precisionSize);
+    const uint64_t precisionBits = (v.f & ((uint64_t(1) << precisionSize) - 1)) * kUlp;
+    const uint64_t halfWay = (uint64_t(1) << (precisionSize - 1)) * kUlp;
+    if (precisionBits >= halfWay + static_cast<unsigned>(error)) {
+        rounded.f++;
+        if (rounded.f & (DiyFp::kDpHiddenBit << 1)) { // rounding overflows mantissa (issue #340)
+            rounded.f >>= 1;
+            rounded.e++;
+        }
+    }
+
+    *result = rounded.ToDouble();
+
+    return halfWay - static_cast<unsigned>(error) >= precisionBits || precisionBits >= halfWay + static_cast<unsigned>(error);
+}
+
+template<typename Ch>
+inline double StrtodBigInteger(double approx, const Ch* decimals, int dLen, int dExp) {
+    RAPIDJSON_ASSERT(dLen >= 0);
+    const BigInteger dInt(decimals, static_cast<unsigned>(dLen));
+    Double a(approx);
+    int cmp = CheckWithinHalfULP(a.Value(), dInt, dExp);
+    if (cmp < 0)
+        return a.Value();  // within half ULP
+    else if (cmp == 0) {
+        // Round towards even
+        if (a.Significand() & 1)
+            return a.NextPositiveDouble();
+        else
+            return a.Value();
+    }
+    else // adjustment
+        return a.NextPositiveDouble();
+}
+
+template<typename Ch>
+inline double StrtodFullPrecision(double d, int p, const Ch* decimals, size_t length, size_t decimalPosition, int exp) {
+    RAPIDJSON_ASSERT(d >= 0.0);
+    RAPIDJSON_ASSERT(length >= 1);
+
+    double result = 0.0;
+    if (StrtodFast(d, p, &result))
+        return result;
+
+    RAPIDJSON_ASSERT(length <= INT_MAX);
+    int dLen = static_cast<int>(length);
+
+    RAPIDJSON_ASSERT(length >= decimalPosition);
+    RAPIDJSON_ASSERT(length - decimalPosition <= INT_MAX);
+    int dExpAdjust = static_cast<int>(length - decimalPosition);
+
+    RAPIDJSON_ASSERT(exp >= INT_MIN + dExpAdjust);
+    int dExp = exp - dExpAdjust;
+
+    // Make sure length+dExp does not overflow
+    RAPIDJSON_ASSERT(dExp <= INT_MAX - dLen);
+
+    // Trim leading zeros
+    while (dLen > 0 && *decimals == '0') {
+        dLen--;
+        decimals++;
+    }
+
+    // Trim trailing zeros
+    while (dLen > 0 && decimals[dLen - 1] == '0') {
+        dLen--;
+        dExp++;
+    }
+
+    if (dLen == 0) { // Buffer only contains zeros.
+        return 0.0;
+    }
+
+    // Trim right-most digits
+    const int kMaxDecimalDigit = 767 + 1;
+    if (dLen > kMaxDecimalDigit) {
+        dExp += dLen - kMaxDecimalDigit;
+        dLen = kMaxDecimalDigit;
+    }
+
+    // If too small, underflow to zero.
+    // Any x <= 10^-324 is interpreted as zero.
+    if (dLen + dExp <= -324)
+        return 0.0;
+
+    // If too large, overflow to infinity.
+    // Any x >= 10^309 is interpreted as +infinity.
+    if (dLen + dExp > 309)
+        return std::numeric_limits<double>::infinity();
+
+    if (StrtodDiyFp(decimals, dLen, dExp, &result))
+        return result;
+
+    // Use approximation from StrtodDiyFp and make adjustment with BigInteger comparison
+    return StrtodBigInteger(result, decimals, dLen, dExp);
+}
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_STRTOD_
diff --git a/General/General/include/rapidjson/internal/swap.h b/General/General/include/rapidjson/internal/swap.h
new file mode 100644
index 0000000..2cf92f9
--- /dev/null
+++ b/General/General/include/rapidjson/internal/swap.h
@@ -0,0 +1,46 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_INTERNAL_SWAP_H_
+#define RAPIDJSON_INTERNAL_SWAP_H_
+
+#include "../rapidjson.h"
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+namespace internal {
+
+//! Custom swap() to avoid dependency on C++ <algorithm> header
+/*! \tparam T Type of the arguments to swap, should be instantiated with primitive C++ types only.
+    \note This has the same semantics as std::swap().
+*/
+template <typename T>
+inline void Swap(T& a, T& b) RAPIDJSON_NOEXCEPT {
+    T tmp = a;
+        a = b;
+        b = tmp;
+}
+
+} // namespace internal
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_INTERNAL_SWAP_H_
diff --git a/General/General/include/rapidjson/istreamwrapper.h b/General/General/include/rapidjson/istreamwrapper.h
new file mode 100644
index 0000000..01437ec
--- /dev/null
+++ b/General/General/include/rapidjson/istreamwrapper.h
@@ -0,0 +1,128 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_ISTREAMWRAPPER_H_
+#define RAPIDJSON_ISTREAMWRAPPER_H_
+
+#include "stream.h"
+#include <iosfwd>
+#include <ios>
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4351) // new behavior: elements of array 'array' will be default initialized
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Wrapper of \c std::basic_istream into RapidJSON's Stream concept.
+/*!
+    The classes can be wrapped including but not limited to:
+
+    - \c std::istringstream
+    - \c std::stringstream
+    - \c std::wistringstream
+    - \c std::wstringstream
+    - \c std::ifstream
+    - \c std::fstream
+    - \c std::wifstream
+    - \c std::wfstream
+
+    \tparam StreamType Class derived from \c std::basic_istream.
+*/
+   
+template <typename StreamType>
+class BasicIStreamWrapper {
+public:
+    typedef typename StreamType::char_type Ch;
+
+    //! Constructor.
+    /*!
+        \param stream stream opened for read.
+    */
+    BasicIStreamWrapper(StreamType &stream) : stream_(stream), buffer_(peekBuffer_), bufferSize_(4), bufferLast_(0), current_(buffer_), readCount_(0), count_(0), eof_(false) { 
+        Read();
+    }
+
+    //! Constructor.
+    /*!
+        \param stream stream opened for read.
+        \param buffer user-supplied buffer.
+        \param bufferSize size of buffer in bytes. Must >=4 bytes.
+    */
+    BasicIStreamWrapper(StreamType &stream, char* buffer, size_t bufferSize) : stream_(stream), buffer_(buffer), bufferSize_(bufferSize), bufferLast_(0), current_(buffer_), readCount_(0), count_(0), eof_(false) { 
+        RAPIDJSON_ASSERT(bufferSize >= 4);
+        Read();
+    }
+
+    Ch Peek() const { return *current_; }
+    Ch Take() { Ch c = *current_; Read(); return c; }
+    size_t Tell() const { return count_ + static_cast<size_t>(current_ - buffer_); }
+
+    // Not implemented
+    void Put(Ch) { RAPIDJSON_ASSERT(false); }
+    void Flush() { RAPIDJSON_ASSERT(false); } 
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+    // For encoding detection only.
+    const Ch* Peek4() const {
+        return (current_ + 4 - !eof_ <= bufferLast_) ? current_ : 0;
+    }
+
+private:
+    BasicIStreamWrapper();
+    BasicIStreamWrapper(const BasicIStreamWrapper&);
+    BasicIStreamWrapper& operator=(const BasicIStreamWrapper&);
+
+    void Read() {
+        if (current_ < bufferLast_)
+            ++current_;
+        else if (!eof_) {
+            count_ += readCount_;
+            readCount_ = bufferSize_;
+            bufferLast_ = buffer_ + readCount_ - 1;
+            current_ = buffer_;
+
+            if (!stream_.read(buffer_, static_cast<std::streamsize>(bufferSize_))) {
+                readCount_ = static_cast<size_t>(stream_.gcount());
+                *(bufferLast_ = buffer_ + readCount_) = '\0';
+                eof_ = true;
+            }
+        }
+    }
+
+    StreamType &stream_;
+    Ch peekBuffer_[4], *buffer_;
+    size_t bufferSize_;
+    Ch *bufferLast_;
+    Ch *current_;
+    size_t readCount_;
+    size_t count_;  //!< Number of characters read
+    bool eof_;
+};
+
+typedef BasicIStreamWrapper<std::istream> IStreamWrapper;
+typedef BasicIStreamWrapper<std::wistream> WIStreamWrapper;
+
+#if defined(__clang__) || defined(_MSC_VER)
+RAPIDJSON_DIAG_POP
+#endif
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_ISTREAMWRAPPER_H_
diff --git a/General/General/include/rapidjson/memorybuffer.h b/General/General/include/rapidjson/memorybuffer.h
new file mode 100644
index 0000000..ffbc41e
--- /dev/null
+++ b/General/General/include/rapidjson/memorybuffer.h
@@ -0,0 +1,70 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_MEMORYBUFFER_H_
+#define RAPIDJSON_MEMORYBUFFER_H_
+
+#include "stream.h"
+#include "internal/stack.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Represents an in-memory output byte stream.
+/*!
+    This class is mainly for being wrapped by EncodedOutputStream or AutoUTFOutputStream.
+
+    It is similar to FileWriteBuffer but the destination is an in-memory buffer instead of a file.
+
+    Differences between MemoryBuffer and StringBuffer:
+    1. StringBuffer has Encoding but MemoryBuffer is only a byte buffer. 
+    2. StringBuffer::GetString() returns a null-terminated string. MemoryBuffer::GetBuffer() returns a buffer without terminator.
+
+    \tparam Allocator type for allocating memory buffer.
+    \note implements Stream concept
+*/
+template <typename Allocator = CrtAllocator>
+struct GenericMemoryBuffer {
+    typedef char Ch; // byte
+
+    GenericMemoryBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
+
+    void Put(Ch c) { *stack_.template Push<Ch>() = c; }
+    void Flush() {}
+
+    void Clear() { stack_.Clear(); }
+    void ShrinkToFit() { stack_.ShrinkToFit(); }
+    Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
+    void Pop(size_t count) { stack_.template Pop<Ch>(count); }
+
+    const Ch* GetBuffer() const {
+        return stack_.template Bottom<Ch>();
+    }
+
+    size_t GetSize() const { return stack_.GetSize(); }
+
+    static const size_t kDefaultCapacity = 256;
+    mutable internal::Stack<Allocator> stack_;
+};
+
+typedef GenericMemoryBuffer<> MemoryBuffer;
+
+//! Implement specialized version of PutN() with memset() for better performance.
+template<>
+inline void PutN(MemoryBuffer& memoryBuffer, char c, size_t n) {
+    std::memset(memoryBuffer.stack_.Push<char>(n), c, n * sizeof(c));
+}
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_MEMORYBUFFER_H_
diff --git a/General/General/include/rapidjson/memorystream.h b/General/General/include/rapidjson/memorystream.h
new file mode 100644
index 0000000..77af6c9
--- /dev/null
+++ b/General/General/include/rapidjson/memorystream.h
@@ -0,0 +1,71 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_MEMORYSTREAM_H_
+#define RAPIDJSON_MEMORYSTREAM_H_
+
+#include "stream.h"
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(unreachable-code)
+RAPIDJSON_DIAG_OFF(missing-noreturn)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Represents an in-memory input byte stream.
+/*!
+    This class is mainly for being wrapped by EncodedInputStream or AutoUTFInputStream.
+
+    It is similar to FileReadBuffer but the source is an in-memory buffer instead of a file.
+
+    Differences between MemoryStream and StringStream:
+    1. StringStream has encoding but MemoryStream is a byte stream.
+    2. MemoryStream needs size of the source buffer and the buffer don't need to be null terminated. StringStream assume null-terminated string as source.
+    3. MemoryStream supports Peek4() for encoding detection. StringStream is specified with an encoding so it should not have Peek4().
+    \note implements Stream concept
+*/
+struct MemoryStream {
+    typedef char Ch; // byte
+
+    MemoryStream(const Ch *src, size_t size) : src_(src), begin_(src), end_(src + size), size_(size) {}
+
+    Ch Peek() const { return RAPIDJSON_UNLIKELY(src_ == end_) ? '\0' : *src_; }
+    Ch Take() { return RAPIDJSON_UNLIKELY(src_ == end_) ? '\0' : *src_++; }
+    size_t Tell() const { return static_cast<size_t>(src_ - begin_); }
+
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    void Put(Ch) { RAPIDJSON_ASSERT(false); }
+    void Flush() { RAPIDJSON_ASSERT(false); }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+    // For encoding detection only.
+    const Ch* Peek4() const {
+        return Tell() + 4 <= size_ ? src_ : 0;
+    }
+
+    const Ch* src_;     //!< Current read position.
+    const Ch* begin_;   //!< Original head of the string.
+    const Ch* end_;     //!< End of stream.
+    size_t size_;       //!< Size of the stream.
+};
+
+RAPIDJSON_NAMESPACE_END
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_MEMORYBUFFER_H_
diff --git a/General/General/include/rapidjson/msinttypes/inttypes.h b/General/General/include/rapidjson/msinttypes/inttypes.h
new file mode 100644
index 0000000..1811128
--- /dev/null
+++ b/General/General/include/rapidjson/msinttypes/inttypes.h
@@ -0,0 +1,316 @@
+// ISO C9x  compliant inttypes.h for Microsoft Visual Studio
+// Based on ISO/IEC 9899:TC2 Committee draft (May 6, 2005) WG14/N1124 
+// 
+//  Copyright (c) 2006-2013 Alexander Chemeris
+// 
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//   1. Redistributions of source code must retain the above copyright notice,
+//      this list of conditions and the following disclaimer.
+// 
+//   2. Redistributions in binary form must reproduce the above copyright
+//      notice, this list of conditions and the following disclaimer in the
+//      documentation and/or other materials provided with the distribution.
+// 
+//   3. Neither the name of the product nor the names of its contributors may
+//      be used to endorse or promote products derived from this software
+//      without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
+// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// 
+///////////////////////////////////////////////////////////////////////////////
+
+// The above software in this distribution may have been modified by 
+// THL A29 Limited ("Tencent Modifications"). 
+// All Tencent Modifications are Copyright (C) 2015 THL A29 Limited.
+
+#ifndef _MSC_VER // [
+#error "Use this header only with Microsoft Visual C++ compilers!"
+#endif // _MSC_VER ]
+
+#ifndef _MSC_INTTYPES_H_ // [
+#define _MSC_INTTYPES_H_
+
+#if _MSC_VER > 1000
+#pragma once
+#endif
+
+#include "stdint.h"
+
+// miloyip: VC supports inttypes.h since VC2013
+#if _MSC_VER >= 1800
+#include <inttypes.h>
+#else
+
+// 7.8 Format conversion of integer types
+
+typedef struct {
+   intmax_t quot;
+   intmax_t rem;
+} imaxdiv_t;
+
+// 7.8.1 Macros for format specifiers
+
+#if !defined(__cplusplus) || defined(__STDC_FORMAT_MACROS) // [   See footnote 185 at page 198
+
+// The fprintf macros for signed integers are:
+#define PRId8       "d"
+#define PRIi8       "i"
+#define PRIdLEAST8  "d"
+#define PRIiLEAST8  "i"
+#define PRIdFAST8   "d"
+#define PRIiFAST8   "i"
+
+#define PRId16       "hd"
+#define PRIi16       "hi"
+#define PRIdLEAST16  "hd"
+#define PRIiLEAST16  "hi"
+#define PRIdFAST16   "hd"
+#define PRIiFAST16   "hi"
+
+#define PRId32       "I32d"
+#define PRIi32       "I32i"
+#define PRIdLEAST32  "I32d"
+#define PRIiLEAST32  "I32i"
+#define PRIdFAST32   "I32d"
+#define PRIiFAST32   "I32i"
+
+#define PRId64       "I64d"
+#define PRIi64       "I64i"
+#define PRIdLEAST64  "I64d"
+#define PRIiLEAST64  "I64i"
+#define PRIdFAST64   "I64d"
+#define PRIiFAST64   "I64i"
+
+#define PRIdMAX     "I64d"
+#define PRIiMAX     "I64i"
+
+#define PRIdPTR     "Id"
+#define PRIiPTR     "Ii"
+
+// The fprintf macros for unsigned integers are:
+#define PRIo8       "o"
+#define PRIu8       "u"
+#define PRIx8       "x"
+#define PRIX8       "X"
+#define PRIoLEAST8  "o"
+#define PRIuLEAST8  "u"
+#define PRIxLEAST8  "x"
+#define PRIXLEAST8  "X"
+#define PRIoFAST8   "o"
+#define PRIuFAST8   "u"
+#define PRIxFAST8   "x"
+#define PRIXFAST8   "X"
+
+#define PRIo16       "ho"
+#define PRIu16       "hu"
+#define PRIx16       "hx"
+#define PRIX16       "hX"
+#define PRIoLEAST16  "ho"
+#define PRIuLEAST16  "hu"
+#define PRIxLEAST16  "hx"
+#define PRIXLEAST16  "hX"
+#define PRIoFAST16   "ho"
+#define PRIuFAST16   "hu"
+#define PRIxFAST16   "hx"
+#define PRIXFAST16   "hX"
+
+#define PRIo32       "I32o"
+#define PRIu32       "I32u"
+#define PRIx32       "I32x"
+#define PRIX32       "I32X"
+#define PRIoLEAST32  "I32o"
+#define PRIuLEAST32  "I32u"
+#define PRIxLEAST32  "I32x"
+#define PRIXLEAST32  "I32X"
+#define PRIoFAST32   "I32o"
+#define PRIuFAST32   "I32u"
+#define PRIxFAST32   "I32x"
+#define PRIXFAST32   "I32X"
+
+#define PRIo64       "I64o"
+#define PRIu64       "I64u"
+#define PRIx64       "I64x"
+#define PRIX64       "I64X"
+#define PRIoLEAST64  "I64o"
+#define PRIuLEAST64  "I64u"
+#define PRIxLEAST64  "I64x"
+#define PRIXLEAST64  "I64X"
+#define PRIoFAST64   "I64o"
+#define PRIuFAST64   "I64u"
+#define PRIxFAST64   "I64x"
+#define PRIXFAST64   "I64X"
+
+#define PRIoMAX     "I64o"
+#define PRIuMAX     "I64u"
+#define PRIxMAX     "I64x"
+#define PRIXMAX     "I64X"
+
+#define PRIoPTR     "Io"
+#define PRIuPTR     "Iu"
+#define PRIxPTR     "Ix"
+#define PRIXPTR     "IX"
+
+// The fscanf macros for signed integers are:
+#define SCNd8       "d"
+#define SCNi8       "i"
+#define SCNdLEAST8  "d"
+#define SCNiLEAST8  "i"
+#define SCNdFAST8   "d"
+#define SCNiFAST8   "i"
+
+#define SCNd16       "hd"
+#define SCNi16       "hi"
+#define SCNdLEAST16  "hd"
+#define SCNiLEAST16  "hi"
+#define SCNdFAST16   "hd"
+#define SCNiFAST16   "hi"
+
+#define SCNd32       "ld"
+#define SCNi32       "li"
+#define SCNdLEAST32  "ld"
+#define SCNiLEAST32  "li"
+#define SCNdFAST32   "ld"
+#define SCNiFAST32   "li"
+
+#define SCNd64       "I64d"
+#define SCNi64       "I64i"
+#define SCNdLEAST64  "I64d"
+#define SCNiLEAST64  "I64i"
+#define SCNdFAST64   "I64d"
+#define SCNiFAST64   "I64i"
+
+#define SCNdMAX     "I64d"
+#define SCNiMAX     "I64i"
+
+#ifdef _WIN64 // [
+#  define SCNdPTR     "I64d"
+#  define SCNiPTR     "I64i"
+#else  // _WIN64 ][
+#  define SCNdPTR     "ld"
+#  define SCNiPTR     "li"
+#endif  // _WIN64 ]
+
+// The fscanf macros for unsigned integers are:
+#define SCNo8       "o"
+#define SCNu8       "u"
+#define SCNx8       "x"
+#define SCNX8       "X"
+#define SCNoLEAST8  "o"
+#define SCNuLEAST8  "u"
+#define SCNxLEAST8  "x"
+#define SCNXLEAST8  "X"
+#define SCNoFAST8   "o"
+#define SCNuFAST8   "u"
+#define SCNxFAST8   "x"
+#define SCNXFAST8   "X"
+
+#define SCNo16       "ho"
+#define SCNu16       "hu"
+#define SCNx16       "hx"
+#define SCNX16       "hX"
+#define SCNoLEAST16  "ho"
+#define SCNuLEAST16  "hu"
+#define SCNxLEAST16  "hx"
+#define SCNXLEAST16  "hX"
+#define SCNoFAST16   "ho"
+#define SCNuFAST16   "hu"
+#define SCNxFAST16   "hx"
+#define SCNXFAST16   "hX"
+
+#define SCNo32       "lo"
+#define SCNu32       "lu"
+#define SCNx32       "lx"
+#define SCNX32       "lX"
+#define SCNoLEAST32  "lo"
+#define SCNuLEAST32  "lu"
+#define SCNxLEAST32  "lx"
+#define SCNXLEAST32  "lX"
+#define SCNoFAST32   "lo"
+#define SCNuFAST32   "lu"
+#define SCNxFAST32   "lx"
+#define SCNXFAST32   "lX"
+
+#define SCNo64       "I64o"
+#define SCNu64       "I64u"
+#define SCNx64       "I64x"
+#define SCNX64       "I64X"
+#define SCNoLEAST64  "I64o"
+#define SCNuLEAST64  "I64u"
+#define SCNxLEAST64  "I64x"
+#define SCNXLEAST64  "I64X"
+#define SCNoFAST64   "I64o"
+#define SCNuFAST64   "I64u"
+#define SCNxFAST64   "I64x"
+#define SCNXFAST64   "I64X"
+
+#define SCNoMAX     "I64o"
+#define SCNuMAX     "I64u"
+#define SCNxMAX     "I64x"
+#define SCNXMAX     "I64X"
+
+#ifdef _WIN64 // [
+#  define SCNoPTR     "I64o"
+#  define SCNuPTR     "I64u"
+#  define SCNxPTR     "I64x"
+#  define SCNXPTR     "I64X"
+#else  // _WIN64 ][
+#  define SCNoPTR     "lo"
+#  define SCNuPTR     "lu"
+#  define SCNxPTR     "lx"
+#  define SCNXPTR     "lX"
+#endif  // _WIN64 ]
+
+#endif // __STDC_FORMAT_MACROS ]
+
+// 7.8.2 Functions for greatest-width integer types
+
+// 7.8.2.1 The imaxabs function
+#define imaxabs _abs64
+
+// 7.8.2.2 The imaxdiv function
+
+// This is modified version of div() function from Microsoft's div.c found
+// in %MSVC.NET%\crt\src\div.c
+#ifdef STATIC_IMAXDIV // [
+static
+#else // STATIC_IMAXDIV ][
+_inline
+#endif // STATIC_IMAXDIV ]
+imaxdiv_t __cdecl imaxdiv(intmax_t numer, intmax_t denom)
+{
+   imaxdiv_t result;
+
+   result.quot = numer / denom;
+   result.rem = numer % denom;
+
+   if (numer < 0 && result.rem > 0) {
+      // did division wrong; must fix up
+      ++result.quot;
+      result.rem -= denom;
+   }
+
+   return result;
+}
+
+// 7.8.2.3 The strtoimax and strtoumax functions
+#define strtoimax _strtoi64
+#define strtoumax _strtoui64
+
+// 7.8.2.4 The wcstoimax and wcstoumax functions
+#define wcstoimax _wcstoi64
+#define wcstoumax _wcstoui64
+
+#endif // _MSC_VER >= 1800
+
+#endif // _MSC_INTTYPES_H_ ]
diff --git a/General/General/include/rapidjson/msinttypes/stdint.h b/General/General/include/rapidjson/msinttypes/stdint.h
new file mode 100644
index 0000000..3d4477b
--- /dev/null
+++ b/General/General/include/rapidjson/msinttypes/stdint.h
@@ -0,0 +1,300 @@
+// ISO C9x  compliant stdint.h for Microsoft Visual Studio
+// Based on ISO/IEC 9899:TC2 Committee draft (May 6, 2005) WG14/N1124 
+// 
+//  Copyright (c) 2006-2013 Alexander Chemeris
+// 
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//   1. Redistributions of source code must retain the above copyright notice,
+//      this list of conditions and the following disclaimer.
+// 
+//   2. Redistributions in binary form must reproduce the above copyright
+//      notice, this list of conditions and the following disclaimer in the
+//      documentation and/or other materials provided with the distribution.
+// 
+//   3. Neither the name of the product nor the names of its contributors may
+//      be used to endorse or promote products derived from this software
+//      without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
+// WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
+// EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 
+// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+// 
+///////////////////////////////////////////////////////////////////////////////
+
+// The above software in this distribution may have been modified by 
+// THL A29 Limited ("Tencent Modifications"). 
+// All Tencent Modifications are Copyright (C) 2015 THL A29 Limited.
+
+#ifndef _MSC_VER // [
+#error "Use this header only with Microsoft Visual C++ compilers!"
+#endif // _MSC_VER ]
+
+#ifndef _MSC_STDINT_H_ // [
+#define _MSC_STDINT_H_
+
+#if _MSC_VER > 1000
+#pragma once
+#endif
+
+// miloyip: Originally Visual Studio 2010 uses its own stdint.h. However it generates warning with INT64_C(), so change to use this file for vs2010.
+#if _MSC_VER >= 1600 // [
+#include <stdint.h>
+
+#if !defined(__cplusplus) || defined(__STDC_CONSTANT_MACROS) // [   See footnote 224 at page 260
+
+#undef INT8_C
+#undef INT16_C
+#undef INT32_C
+#undef INT64_C
+#undef UINT8_C
+#undef UINT16_C
+#undef UINT32_C
+#undef UINT64_C
+
+// 7.18.4.1 Macros for minimum-width integer constants
+
+#define INT8_C(val)  val##i8
+#define INT16_C(val) val##i16
+#define INT32_C(val) val##i32
+#define INT64_C(val) val##i64
+
+#define UINT8_C(val)  val##ui8
+#define UINT16_C(val) val##ui16
+#define UINT32_C(val) val##ui32
+#define UINT64_C(val) val##ui64
+
+// 7.18.4.2 Macros for greatest-width integer constants
+// These #ifndef's are needed to prevent collisions with <boost/cstdint.hpp>.
+// Check out Issue 9 for the details.
+#ifndef INTMAX_C //   [
+#  define INTMAX_C   INT64_C
+#endif // INTMAX_C    ]
+#ifndef UINTMAX_C //  [
+#  define UINTMAX_C  UINT64_C
+#endif // UINTMAX_C   ]
+
+#endif // __STDC_CONSTANT_MACROS ]
+
+#else // ] _MSC_VER >= 1700 [
+
+#include <limits.h>
+
+// For Visual Studio 6 in C++ mode and for many Visual Studio versions when
+// compiling for ARM we have to wrap <wchar.h> include with 'extern "C++" {}'
+// or compiler would give many errors like this:
+//   error C2733: second C linkage of overloaded function 'wmemchr' not allowed
+#if defined(__cplusplus) && !defined(_M_ARM)
+extern "C" {
+#endif
+#  include <wchar.h>
+#if defined(__cplusplus) && !defined(_M_ARM)
+}
+#endif
+
+// Define _W64 macros to mark types changing their size, like intptr_t.
+#ifndef _W64
+#  if !defined(__midl) && (defined(_X86_) || defined(_M_IX86)) && _MSC_VER >= 1300
+#     define _W64 __w64
+#  else
+#     define _W64
+#  endif
+#endif
+
+
+// 7.18.1 Integer types
+
+// 7.18.1.1 Exact-width integer types
+
+// Visual Studio 6 and Embedded Visual C++ 4 doesn't
+// realize that, e.g. char has the same size as __int8
+// so we give up on __intX for them.
+#if (_MSC_VER < 1300)
+   typedef signed char       int8_t;
+   typedef signed short      int16_t;
+   typedef signed int        int32_t;
+   typedef unsigned char     uint8_t;
+   typedef unsigned short    uint16_t;
+   typedef unsigned int      uint32_t;
+#else
+   typedef signed __int8     int8_t;
+   typedef signed __int16    int16_t;
+   typedef signed __int32    int32_t;
+   typedef unsigned __int8   uint8_t;
+   typedef unsigned __int16  uint16_t;
+   typedef unsigned __int32  uint32_t;
+#endif
+typedef signed __int64       int64_t;
+typedef unsigned __int64     uint64_t;
+
+
+// 7.18.1.2 Minimum-width integer types
+typedef int8_t    int_least8_t;
+typedef int16_t   int_least16_t;
+typedef int32_t   int_least32_t;
+typedef int64_t   int_least64_t;
+typedef uint8_t   uint_least8_t;
+typedef uint16_t  uint_least16_t;
+typedef uint32_t  uint_least32_t;
+typedef uint64_t  uint_least64_t;
+
+// 7.18.1.3 Fastest minimum-width integer types
+typedef int8_t    int_fast8_t;
+typedef int16_t   int_fast16_t;
+typedef int32_t   int_fast32_t;
+typedef int64_t   int_fast64_t;
+typedef uint8_t   uint_fast8_t;
+typedef uint16_t  uint_fast16_t;
+typedef uint32_t  uint_fast32_t;
+typedef uint64_t  uint_fast64_t;
+
+// 7.18.1.4 Integer types capable of holding object pointers
+#ifdef _WIN64 // [
+   typedef signed __int64    intptr_t;
+   typedef unsigned __int64  uintptr_t;
+#else // _WIN64 ][
+   typedef _W64 signed int   intptr_t;
+   typedef _W64 unsigned int uintptr_t;
+#endif // _WIN64 ]
+
+// 7.18.1.5 Greatest-width integer types
+typedef int64_t   intmax_t;
+typedef uint64_t  uintmax_t;
+
+
+// 7.18.2 Limits of specified-width integer types
+
+#if !defined(__cplusplus) || defined(__STDC_LIMIT_MACROS) // [   See footnote 220 at page 257 and footnote 221 at page 259
+
+// 7.18.2.1 Limits of exact-width integer types
+#define INT8_MIN     ((int8_t)_I8_MIN)
+#define INT8_MAX     _I8_MAX
+#define INT16_MIN    ((int16_t)_I16_MIN)
+#define INT16_MAX    _I16_MAX
+#define INT32_MIN    ((int32_t)_I32_MIN)
+#define INT32_MAX    _I32_MAX
+#define INT64_MIN    ((int64_t)_I64_MIN)
+#define INT64_MAX    _I64_MAX
+#define UINT8_MAX    _UI8_MAX
+#define UINT16_MAX   _UI16_MAX
+#define UINT32_MAX   _UI32_MAX
+#define UINT64_MAX   _UI64_MAX
+
+// 7.18.2.2 Limits of minimum-width integer types
+#define INT_LEAST8_MIN    INT8_MIN
+#define INT_LEAST8_MAX    INT8_MAX
+#define INT_LEAST16_MIN   INT16_MIN
+#define INT_LEAST16_MAX   INT16_MAX
+#define INT_LEAST32_MIN   INT32_MIN
+#define INT_LEAST32_MAX   INT32_MAX
+#define INT_LEAST64_MIN   INT64_MIN
+#define INT_LEAST64_MAX   INT64_MAX
+#define UINT_LEAST8_MAX   UINT8_MAX
+#define UINT_LEAST16_MAX  UINT16_MAX
+#define UINT_LEAST32_MAX  UINT32_MAX
+#define UINT_LEAST64_MAX  UINT64_MAX
+
+// 7.18.2.3 Limits of fastest minimum-width integer types
+#define INT_FAST8_MIN    INT8_MIN
+#define INT_FAST8_MAX    INT8_MAX
+#define INT_FAST16_MIN   INT16_MIN
+#define INT_FAST16_MAX   INT16_MAX
+#define INT_FAST32_MIN   INT32_MIN
+#define INT_FAST32_MAX   INT32_MAX
+#define INT_FAST64_MIN   INT64_MIN
+#define INT_FAST64_MAX   INT64_MAX
+#define UINT_FAST8_MAX   UINT8_MAX
+#define UINT_FAST16_MAX  UINT16_MAX
+#define UINT_FAST32_MAX  UINT32_MAX
+#define UINT_FAST64_MAX  UINT64_MAX
+
+// 7.18.2.4 Limits of integer types capable of holding object pointers
+#ifdef _WIN64 // [
+#  define INTPTR_MIN   INT64_MIN
+#  define INTPTR_MAX   INT64_MAX
+#  define UINTPTR_MAX  UINT64_MAX
+#else // _WIN64 ][
+#  define INTPTR_MIN   INT32_MIN
+#  define INTPTR_MAX   INT32_MAX
+#  define UINTPTR_MAX  UINT32_MAX
+#endif // _WIN64 ]
+
+// 7.18.2.5 Limits of greatest-width integer types
+#define INTMAX_MIN   INT64_MIN
+#define INTMAX_MAX   INT64_MAX
+#define UINTMAX_MAX  UINT64_MAX
+
+// 7.18.3 Limits of other integer types
+
+#ifdef _WIN64 // [
+#  define PTRDIFF_MIN  _I64_MIN
+#  define PTRDIFF_MAX  _I64_MAX
+#else  // _WIN64 ][
+#  define PTRDIFF_MIN  _I32_MIN
+#  define PTRDIFF_MAX  _I32_MAX
+#endif  // _WIN64 ]
+
+#define SIG_ATOMIC_MIN  INT_MIN
+#define SIG_ATOMIC_MAX  INT_MAX
+
+#ifndef SIZE_MAX // [
+#  ifdef _WIN64 // [
+#     define SIZE_MAX  _UI64_MAX
+#  else // _WIN64 ][
+#     define SIZE_MAX  _UI32_MAX
+#  endif // _WIN64 ]
+#endif // SIZE_MAX ]
+
+// WCHAR_MIN and WCHAR_MAX are also defined in <wchar.h>
+#ifndef WCHAR_MIN // [
+#  define WCHAR_MIN  0
+#endif  // WCHAR_MIN ]
+#ifndef WCHAR_MAX // [
+#  define WCHAR_MAX  _UI16_MAX
+#endif  // WCHAR_MAX ]
+
+#define WINT_MIN  0
+#define WINT_MAX  _UI16_MAX
+
+#endif // __STDC_LIMIT_MACROS ]
+
+
+// 7.18.4 Limits of other integer types
+
+#if !defined(__cplusplus) || defined(__STDC_CONSTANT_MACROS) // [   See footnote 224 at page 260
+
+// 7.18.4.1 Macros for minimum-width integer constants
+
+#define INT8_C(val)  val##i8
+#define INT16_C(val) val##i16
+#define INT32_C(val) val##i32
+#define INT64_C(val) val##i64
+
+#define UINT8_C(val)  val##ui8
+#define UINT16_C(val) val##ui16
+#define UINT32_C(val) val##ui32
+#define UINT64_C(val) val##ui64
+
+// 7.18.4.2 Macros for greatest-width integer constants
+// These #ifndef's are needed to prevent collisions with <boost/cstdint.hpp>.
+// Check out Issue 9 for the details.
+#ifndef INTMAX_C //   [
+#  define INTMAX_C   INT64_C
+#endif // INTMAX_C    ]
+#ifndef UINTMAX_C //  [
+#  define UINTMAX_C  UINT64_C
+#endif // UINTMAX_C   ]
+
+#endif // __STDC_CONSTANT_MACROS ]
+
+#endif // _MSC_VER >= 1600 ]
+
+#endif // _MSC_STDINT_H_ ]
diff --git a/General/General/include/rapidjson/ostreamwrapper.h b/General/General/include/rapidjson/ostreamwrapper.h
new file mode 100644
index 0000000..11ed4d3
--- /dev/null
+++ b/General/General/include/rapidjson/ostreamwrapper.h
@@ -0,0 +1,81 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_OSTREAMWRAPPER_H_
+#define RAPIDJSON_OSTREAMWRAPPER_H_
+
+#include "stream.h"
+#include <iosfwd>
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Wrapper of \c std::basic_ostream into RapidJSON's Stream concept.
+/*!
+    The classes can be wrapped including but not limited to:
+
+    - \c std::ostringstream
+    - \c std::stringstream
+    - \c std::wpstringstream
+    - \c std::wstringstream
+    - \c std::ifstream
+    - \c std::fstream
+    - \c std::wofstream
+    - \c std::wfstream
+
+    \tparam StreamType Class derived from \c std::basic_ostream.
+*/
+   
+template <typename StreamType>
+class BasicOStreamWrapper {
+public:
+    typedef typename StreamType::char_type Ch;
+    BasicOStreamWrapper(StreamType& stream) : stream_(stream) {}
+
+    void Put(Ch c) {
+        stream_.put(c);
+    }
+
+    void Flush() {
+        stream_.flush();
+    }
+
+    // Not implemented
+    char Peek() const { RAPIDJSON_ASSERT(false); return 0; }
+    char Take() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t Tell() const { RAPIDJSON_ASSERT(false); return 0; }
+    char* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    size_t PutEnd(char*) { RAPIDJSON_ASSERT(false); return 0; }
+
+private:
+    BasicOStreamWrapper(const BasicOStreamWrapper&);
+    BasicOStreamWrapper& operator=(const BasicOStreamWrapper&);
+
+    StreamType& stream_;
+};
+
+typedef BasicOStreamWrapper<std::ostream> OStreamWrapper;
+typedef BasicOStreamWrapper<std::wostream> WOStreamWrapper;
+
+#ifdef __clang__
+RAPIDJSON_DIAG_POP
+#endif
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_OSTREAMWRAPPER_H_
diff --git a/General/General/include/rapidjson/pointer.h b/General/General/include/rapidjson/pointer.h
new file mode 100644
index 0000000..67a9cb0
--- /dev/null
+++ b/General/General/include/rapidjson/pointer.h
@@ -0,0 +1,1482 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_POINTER_H_
+#define RAPIDJSON_POINTER_H_
+
+#include "document.h"
+#include "uri.h"
+#include "internal/itoa.h"
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(switch-enum)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4512) // assignment operator could not be generated
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+static const SizeType kPointerInvalidIndex = ~SizeType(0);  //!< Represents an invalid index in GenericPointer::Token
+
+//! Error code of parsing.
+/*! \ingroup RAPIDJSON_ERRORS
+    \see GenericPointer::GenericPointer, GenericPointer::GetParseErrorCode
+*/
+enum PointerParseErrorCode {
+    kPointerParseErrorNone = 0,                     //!< The parse is successful
+
+    kPointerParseErrorTokenMustBeginWithSolidus,    //!< A token must begin with a '/'
+    kPointerParseErrorInvalidEscape,                //!< Invalid escape
+    kPointerParseErrorInvalidPercentEncoding,       //!< Invalid percent encoding in URI fragment
+    kPointerParseErrorCharacterMustPercentEncode    //!< A character must percent encoded in URI fragment
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericPointer
+
+//! Represents a JSON Pointer. Use Pointer for UTF8 encoding and default allocator.
+/*!
+    This class implements RFC 6901 "JavaScript Object Notation (JSON) Pointer" 
+    (https://tools.ietf.org/html/rfc6901).
+
+    A JSON pointer is for identifying a specific value in a JSON document
+    (GenericDocument). It can simplify coding of DOM tree manipulation, because it
+    can access multiple-level depth of DOM tree with single API call.
+
+    After it parses a string representation (e.g. "/foo/0" or URI fragment 
+    representation (e.g. "#/foo/0") into its internal representation (tokens),
+    it can be used to resolve a specific value in multiple documents, or sub-tree 
+    of documents.
+
+    Contrary to GenericValue, Pointer can be copy constructed and copy assigned.
+    Apart from assignment, a Pointer cannot be modified after construction.
+
+    Although Pointer is very convenient, please aware that constructing Pointer
+    involves parsing and dynamic memory allocation. A special constructor with user-
+    supplied tokens eliminates these.
+
+    GenericPointer depends on GenericDocument and GenericValue.
+    
+    \tparam ValueType The value type of the DOM tree. E.g. GenericValue<UTF8<> >
+    \tparam Allocator The allocator type for allocating memory for internal representation.
+    
+    \note GenericPointer uses same encoding of ValueType.
+    However, Allocator of GenericPointer is independent of Allocator of Value.
+*/
+template <typename ValueType, typename Allocator = CrtAllocator>
+class GenericPointer {
+public:
+    typedef typename ValueType::EncodingType EncodingType;  //!< Encoding type from Value
+    typedef typename ValueType::Ch Ch;                      //!< Character type from Value
+    typedef GenericUri<ValueType, Allocator> UriType;
+
+
+    //! A token is the basic units of internal representation.
+    /*!
+        A JSON pointer string representation "/foo/123" is parsed to two tokens: 
+        "foo" and 123. 123 will be represented in both numeric form and string form.
+        They are resolved according to the actual value type (object or array).
+
+        For token that are not numbers, or the numeric value is out of bound
+        (greater than limits of SizeType), they are only treated as string form
+        (i.e. the token's index will be equal to kPointerInvalidIndex).
+
+        This struct is public so that user can create a Pointer without parsing and 
+        allocation, using a special constructor.
+    */
+    struct Token {
+        const Ch* name;             //!< Name of the token. It has null character at the end but it can contain null character.
+        SizeType length;            //!< Length of the name.
+        SizeType index;             //!< A valid array index, if it is not equal to kPointerInvalidIndex.
+    };
+
+    //!@name Constructors and destructor.
+    //@{
+
+    //! Default constructor.
+    GenericPointer(Allocator* allocator = 0) : allocator_(allocator), ownAllocator_(), nameBuffer_(), tokens_(), tokenCount_(), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {}
+
+    //! Constructor that parses a string or URI fragment representation.
+    /*!
+        \param source A null-terminated, string or URI fragment representation of JSON pointer.
+        \param allocator User supplied allocator for this pointer. If no allocator is provided, it creates a self-owned one.
+    */
+    explicit GenericPointer(const Ch* source, Allocator* allocator = 0) : allocator_(allocator), ownAllocator_(), nameBuffer_(), tokens_(), tokenCount_(), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {
+        Parse(source, internal::StrLen(source));
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Constructor that parses a string or URI fragment representation.
+    /*!
+        \param source A string or URI fragment representation of JSON pointer.
+        \param allocator User supplied allocator for this pointer. If no allocator is provided, it creates a self-owned one.
+        \note Requires the definition of the preprocessor symbol \ref RAPIDJSON_HAS_STDSTRING.
+    */
+    explicit GenericPointer(const std::basic_string<Ch>& source, Allocator* allocator = 0) : allocator_(allocator), ownAllocator_(), nameBuffer_(), tokens_(), tokenCount_(), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {
+        Parse(source.c_str(), source.size());
+    }
+#endif
+
+    //! Constructor that parses a string or URI fragment representation, with length of the source string.
+    /*!
+        \param source A string or URI fragment representation of JSON pointer.
+        \param length Length of source.
+        \param allocator User supplied allocator for this pointer. If no allocator is provided, it creates a self-owned one.
+        \note Slightly faster than the overload without length.
+    */
+    GenericPointer(const Ch* source, size_t length, Allocator* allocator = 0) : allocator_(allocator), ownAllocator_(), nameBuffer_(), tokens_(), tokenCount_(), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {
+        Parse(source, length);
+    }
+
+    //! Constructor with user-supplied tokens.
+    /*!
+        This constructor let user supplies const array of tokens.
+        This prevents the parsing process and eliminates allocation.
+        This is preferred for memory constrained environments.
+
+        \param tokens An constant array of tokens representing the JSON pointer.
+        \param tokenCount Number of tokens.
+
+        \b Example
+        \code
+        #define NAME(s) { s, sizeof(s) / sizeof(s[0]) - 1, kPointerInvalidIndex }
+        #define INDEX(i) { #i, sizeof(#i) - 1, i }
+
+        static const Pointer::Token kTokens[] = { NAME("foo"), INDEX(123) };
+        static const Pointer p(kTokens, sizeof(kTokens) / sizeof(kTokens[0]));
+        // Equivalent to static const Pointer p("/foo/123");
+
+        #undef NAME
+        #undef INDEX
+        \endcode
+    */
+    GenericPointer(const Token* tokens, size_t tokenCount) : allocator_(), ownAllocator_(), nameBuffer_(), tokens_(const_cast<Token*>(tokens)), tokenCount_(tokenCount), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {}
+
+    //! Copy constructor.
+    GenericPointer(const GenericPointer& rhs) : allocator_(), ownAllocator_(), nameBuffer_(), tokens_(), tokenCount_(), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {
+        *this = rhs;
+    }
+
+    //! Copy constructor.
+    GenericPointer(const GenericPointer& rhs, Allocator* allocator) : allocator_(allocator), ownAllocator_(), nameBuffer_(), tokens_(), tokenCount_(), parseErrorOffset_(), parseErrorCode_(kPointerParseErrorNone) {
+        *this = rhs;
+    }
+
+    //! Destructor.
+    ~GenericPointer() {
+        if (nameBuffer_)    // If user-supplied tokens constructor is used, nameBuffer_ is nullptr and tokens_ are not deallocated.
+            Allocator::Free(tokens_);
+        RAPIDJSON_DELETE(ownAllocator_);
+    }
+
+    //! Assignment operator.
+    GenericPointer& operator=(const GenericPointer& rhs) {
+        if (this != &rhs) {
+            // Do not delete ownAllcator
+            if (nameBuffer_)
+                Allocator::Free(tokens_);
+
+            tokenCount_ = rhs.tokenCount_;
+            parseErrorOffset_ = rhs.parseErrorOffset_;
+            parseErrorCode_ = rhs.parseErrorCode_;
+
+            if (rhs.nameBuffer_)
+                CopyFromRaw(rhs); // Normally parsed tokens.
+            else {
+                tokens_ = rhs.tokens_; // User supplied const tokens.
+                nameBuffer_ = 0;
+            }
+        }
+        return *this;
+    }
+
+    //! Swap the content of this pointer with an other.
+    /*!
+        \param other The pointer to swap with.
+        \note Constant complexity.
+    */
+    GenericPointer& Swap(GenericPointer& other) RAPIDJSON_NOEXCEPT {
+        internal::Swap(allocator_, other.allocator_);
+        internal::Swap(ownAllocator_, other.ownAllocator_);
+        internal::Swap(nameBuffer_, other.nameBuffer_);
+        internal::Swap(tokens_, other.tokens_);
+        internal::Swap(tokenCount_, other.tokenCount_);
+        internal::Swap(parseErrorOffset_, other.parseErrorOffset_);
+        internal::Swap(parseErrorCode_, other.parseErrorCode_);
+        return *this;
+    }
+
+    //! free-standing swap function helper
+    /*!
+        Helper function to enable support for common swap implementation pattern based on \c std::swap:
+        \code
+        void swap(MyClass& a, MyClass& b) {
+            using std::swap;
+            swap(a.pointer, b.pointer);
+            // ...
+        }
+        \endcode
+        \see Swap()
+     */
+    friend inline void swap(GenericPointer& a, GenericPointer& b) RAPIDJSON_NOEXCEPT { a.Swap(b); }
+
+    //@}
+
+    //!@name Append token
+    //@{
+
+    //! Append a token and return a new Pointer
+    /*!
+        \param token Token to be appended.
+        \param allocator Allocator for the newly return Pointer.
+        \return A new Pointer with appended token.
+    */
+    GenericPointer Append(const Token& token, Allocator* allocator = 0) const {
+        GenericPointer r;
+        r.allocator_ = allocator;
+        Ch *p = r.CopyFromRaw(*this, 1, token.length + 1);
+        std::memcpy(p, token.name, (token.length + 1) * sizeof(Ch));
+        r.tokens_[tokenCount_].name = p;
+        r.tokens_[tokenCount_].length = token.length;
+        r.tokens_[tokenCount_].index = token.index;
+        return r;
+    }
+
+    //! Append a name token with length, and return a new Pointer
+    /*!
+        \param name Name to be appended.
+        \param length Length of name.
+        \param allocator Allocator for the newly return Pointer.
+        \return A new Pointer with appended token.
+    */
+    GenericPointer Append(const Ch* name, SizeType length, Allocator* allocator = 0) const {
+        Token token = { name, length, kPointerInvalidIndex };
+        return Append(token, allocator);
+    }
+
+    //! Append a name token without length, and return a new Pointer
+    /*!
+        \param name Name (const Ch*) to be appended.
+        \param allocator Allocator for the newly return Pointer.
+        \return A new Pointer with appended token.
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::NotExpr<internal::IsSame<typename internal::RemoveConst<T>::Type, Ch> >), (GenericPointer))
+    Append(T* name, Allocator* allocator = 0) const {
+        return Append(name, internal::StrLen(name), allocator);
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Append a name token, and return a new Pointer
+    /*!
+        \param name Name to be appended.
+        \param allocator Allocator for the newly return Pointer.
+        \return A new Pointer with appended token.
+    */
+    GenericPointer Append(const std::basic_string<Ch>& name, Allocator* allocator = 0) const {
+        return Append(name.c_str(), static_cast<SizeType>(name.size()), allocator);
+    }
+#endif
+
+    //! Append a index token, and return a new Pointer
+    /*!
+        \param index Index to be appended.
+        \param allocator Allocator for the newly return Pointer.
+        \return A new Pointer with appended token.
+    */
+    GenericPointer Append(SizeType index, Allocator* allocator = 0) const {
+        char buffer[21];
+        char* end = sizeof(SizeType) == 4 ? internal::u32toa(index, buffer) : internal::u64toa(index, buffer);
+        SizeType length = static_cast<SizeType>(end - buffer);
+        buffer[length] = '\0';
+
+        if (sizeof(Ch) == 1) {
+            Token token = { reinterpret_cast<Ch*>(buffer), length, index };
+            return Append(token, allocator);
+        }
+        else {
+            Ch name[21];
+            for (size_t i = 0; i <= length; i++)
+                name[i] = static_cast<Ch>(buffer[i]);
+            Token token = { name, length, index };
+            return Append(token, allocator);
+        }
+    }
+
+    //! Append a token by value, and return a new Pointer
+    /*!
+        \param token token to be appended.
+        \param allocator Allocator for the newly return Pointer.
+        \return A new Pointer with appended token.
+    */
+    GenericPointer Append(const ValueType& token, Allocator* allocator = 0) const {
+        if (token.IsString())
+            return Append(token.GetString(), token.GetStringLength(), allocator);
+        else {
+            RAPIDJSON_ASSERT(token.IsUint64());
+            RAPIDJSON_ASSERT(token.GetUint64() <= SizeType(~0));
+            return Append(static_cast<SizeType>(token.GetUint64()), allocator);
+        }
+    }
+
+    //!@name Handling Parse Error
+    //@{
+
+    //! Check whether this is a valid pointer.
+    bool IsValid() const { return parseErrorCode_ == kPointerParseErrorNone; }
+
+    //! Get the parsing error offset in code unit.
+    size_t GetParseErrorOffset() const { return parseErrorOffset_; }
+
+    //! Get the parsing error code.
+    PointerParseErrorCode GetParseErrorCode() const { return parseErrorCode_; }
+
+    //@}
+
+    //! Get the allocator of this pointer.
+    Allocator& GetAllocator() { return *allocator_; }
+
+    //!@name Tokens
+    //@{
+
+    //! Get the token array (const version only).
+    const Token* GetTokens() const { return tokens_; }
+
+    //! Get the number of tokens.
+    size_t GetTokenCount() const { return tokenCount_; }
+
+    //@}
+
+    //!@name Equality/inequality operators
+    //@{
+
+    //! Equality operator.
+    /*!
+        \note When any pointers are invalid, always returns false.
+    */
+    bool operator==(const GenericPointer& rhs) const {
+        if (!IsValid() || !rhs.IsValid() || tokenCount_ != rhs.tokenCount_)
+            return false;
+
+        for (size_t i = 0; i < tokenCount_; i++) {
+            if (tokens_[i].index != rhs.tokens_[i].index ||
+                tokens_[i].length != rhs.tokens_[i].length || 
+                (tokens_[i].length != 0 && std::memcmp(tokens_[i].name, rhs.tokens_[i].name, sizeof(Ch)* tokens_[i].length) != 0))
+            {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    //! Inequality operator.
+    /*!
+        \note When any pointers are invalid, always returns true.
+    */
+    bool operator!=(const GenericPointer& rhs) const { return !(*this == rhs); }
+
+    //! Less than operator.
+    /*!
+        \note Invalid pointers are always greater than valid ones.
+    */
+    bool operator<(const GenericPointer& rhs) const {
+        if (!IsValid())
+            return false;
+        if (!rhs.IsValid())
+            return true;
+
+        if (tokenCount_ != rhs.tokenCount_)
+            return tokenCount_ < rhs.tokenCount_;
+
+        for (size_t i = 0; i < tokenCount_; i++) {
+            if (tokens_[i].index != rhs.tokens_[i].index)
+                return tokens_[i].index < rhs.tokens_[i].index;
+
+            if (tokens_[i].length != rhs.tokens_[i].length)
+                return tokens_[i].length < rhs.tokens_[i].length;
+
+            if (int cmp = std::memcmp(tokens_[i].name, rhs.tokens_[i].name, sizeof(Ch) * tokens_[i].length))
+                return cmp < 0;
+        }
+
+        return false;
+    }
+
+    //@}
+
+    //!@name Stringify
+    //@{
+
+    //! Stringify the pointer into string representation.
+    /*!
+        \tparam OutputStream Type of output stream.
+        \param os The output stream.
+    */
+    template<typename OutputStream>
+    bool Stringify(OutputStream& os) const {
+        return Stringify<false, OutputStream>(os);
+    }
+
+    //! Stringify the pointer into URI fragment representation.
+    /*!
+        \tparam OutputStream Type of output stream.
+        \param os The output stream.
+    */
+    template<typename OutputStream>
+    bool StringifyUriFragment(OutputStream& os) const {
+        return Stringify<true, OutputStream>(os);
+    }
+
+    //@}
+
+    //!@name Create value
+    //@{
+
+    //! Create a value in a subtree.
+    /*!
+        If the value is not exist, it creates all parent values and a JSON Null value.
+        So it always succeed and return the newly created or existing value.
+
+        Remind that it may change types of parents according to tokens, so it 
+        potentially removes previously stored values. For example, if a document 
+        was an array, and "/foo" is used to create a value, then the document 
+        will be changed to an object, and all existing array elements are lost.
+
+        \param root Root value of a DOM subtree to be resolved. It can be any value other than document root.
+        \param allocator Allocator for creating the values if the specified value or its parents are not exist.
+        \param alreadyExist If non-null, it stores whether the resolved value is already exist.
+        \return The resolved newly created (a JSON Null value), or already exists value.
+    */
+    ValueType& Create(ValueType& root, typename ValueType::AllocatorType& allocator, bool* alreadyExist = 0) const {
+        RAPIDJSON_ASSERT(IsValid());
+        ValueType* v = &root;
+        bool exist = true;
+        for (const Token *t = tokens_; t != tokens_ + tokenCount_; ++t) {
+            if (v->IsArray() && t->name[0] == '-' && t->length == 1) {
+                v->PushBack(ValueType().Move(), allocator);
+                v = &((*v)[v->Size() - 1]);
+                exist = false;
+            }
+            else {
+                if (t->index == kPointerInvalidIndex) { // must be object name
+                    if (!v->IsObject())
+                        v->SetObject(); // Change to Object
+                }
+                else { // object name or array index
+                    if (!v->IsArray() && !v->IsObject())
+                        v->SetArray(); // Change to Array
+                }
+
+                if (v->IsArray()) {
+                    if (t->index >= v->Size()) {
+                        v->Reserve(t->index + 1, allocator);
+                        while (t->index >= v->Size())
+                            v->PushBack(ValueType().Move(), allocator);
+                        exist = false;
+                    }
+                    v = &((*v)[t->index]);
+                }
+                else {
+                    typename ValueType::MemberIterator m = v->FindMember(GenericValue<EncodingType>(GenericStringRef<Ch>(t->name, t->length)));
+                    if (m == v->MemberEnd()) {
+                        v->AddMember(ValueType(t->name, t->length, allocator).Move(), ValueType().Move(), allocator);
+                        m = v->MemberEnd();
+                        v = &(--m)->value; // Assumes AddMember() appends at the end
+                        exist = false;
+                    }
+                    else
+                        v = &m->value;
+                }
+            }
+        }
+
+        if (alreadyExist)
+            *alreadyExist = exist;
+
+        return *v;
+    }
+
+    //! Creates a value in a document.
+    /*!
+        \param document A document to be resolved.
+        \param alreadyExist If non-null, it stores whether the resolved value is already exist.
+        \return The resolved newly created, or already exists value.
+    */
+    template <typename stackAllocator>
+    ValueType& Create(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, bool* alreadyExist = 0) const {
+        return Create(document, document.GetAllocator(), alreadyExist);
+    }
+
+    //@}
+
+    //!@name Compute URI
+    //@{
+
+    //! Compute the in-scope URI for a subtree.
+    //  For use with JSON pointers into JSON schema documents.
+    /*!
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \param rootUri Root URI
+        \param unresolvedTokenIndex If the pointer cannot resolve a token in the pointer, this parameter can obtain the index of unresolved token.
+        \param allocator Allocator for Uris
+        \return Uri if it can be resolved. Otherwise null.
+
+        \note
+        There are only 3 situations when a URI cannot be resolved:
+        1. A value in the path is not an array nor object.
+        2. An object value does not contain the token.
+        3. A token is out of range of an array value.
+
+        Use unresolvedTokenIndex to retrieve the token index.
+    */
+    UriType GetUri(ValueType& root, const UriType& rootUri, size_t* unresolvedTokenIndex = 0, Allocator* allocator = 0) const {
+        static const Ch kIdString[] = { 'i', 'd', '\0' };
+        static const ValueType kIdValue(kIdString, 2);
+        UriType base = UriType(rootUri, allocator);
+        RAPIDJSON_ASSERT(IsValid());
+        ValueType* v = &root;
+        for (const Token *t = tokens_; t != tokens_ + tokenCount_; ++t) {
+            switch (v->GetType()) {
+                case kObjectType:
+                {
+                    // See if we have an id, and if so resolve with the current base
+                    typename ValueType::MemberIterator m = v->FindMember(kIdValue);
+                    if (m != v->MemberEnd() && (m->value).IsString()) {
+                        UriType here = UriType(m->value, allocator).Resolve(base, allocator);
+                        base = here;
+                    }
+                    m = v->FindMember(GenericValue<EncodingType>(GenericStringRef<Ch>(t->name, t->length)));
+                    if (m == v->MemberEnd())
+                        break;
+                    v = &m->value;
+                }
+                  continue;
+                case kArrayType:
+                    if (t->index == kPointerInvalidIndex || t->index >= v->Size())
+                        break;
+                    v = &((*v)[t->index]);
+                    continue;
+                default:
+                    break;
+            }
+
+            // Error: unresolved token
+            if (unresolvedTokenIndex)
+                *unresolvedTokenIndex = static_cast<size_t>(t - tokens_);
+            return UriType(allocator);
+        }
+        return base;
+    }
+
+    UriType GetUri(const ValueType& root, const UriType& rootUri, size_t* unresolvedTokenIndex = 0, Allocator* allocator = 0) const {
+      return GetUri(const_cast<ValueType&>(root), rootUri, unresolvedTokenIndex, allocator);
+    }
+
+
+    //!@name Query value
+    //@{
+
+    //! Query a value in a subtree.
+    /*!
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \param unresolvedTokenIndex If the pointer cannot resolve a token in the pointer, this parameter can obtain the index of unresolved token.
+        \return Pointer to the value if it can be resolved. Otherwise null.
+
+        \note
+        There are only 3 situations when a value cannot be resolved:
+        1. A value in the path is not an array nor object.
+        2. An object value does not contain the token.
+        3. A token is out of range of an array value.
+
+        Use unresolvedTokenIndex to retrieve the token index.
+    */
+    ValueType* Get(ValueType& root, size_t* unresolvedTokenIndex = 0) const {
+        RAPIDJSON_ASSERT(IsValid());
+        ValueType* v = &root;
+        for (const Token *t = tokens_; t != tokens_ + tokenCount_; ++t) {
+            switch (v->GetType()) {
+            case kObjectType:
+                {
+                    typename ValueType::MemberIterator m = v->FindMember(GenericValue<EncodingType>(GenericStringRef<Ch>(t->name, t->length)));
+                    if (m == v->MemberEnd())
+                        break;
+                    v = &m->value;
+                }
+                continue;
+            case kArrayType:
+                if (t->index == kPointerInvalidIndex || t->index >= v->Size())
+                    break;
+                v = &((*v)[t->index]);
+                continue;
+            default:
+                break;
+            }
+
+            // Error: unresolved token
+            if (unresolvedTokenIndex)
+                *unresolvedTokenIndex = static_cast<size_t>(t - tokens_);
+            return 0;
+        }
+        return v;
+    }
+
+    //! Query a const value in a const subtree.
+    /*!
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \return Pointer to the value if it can be resolved. Otherwise null.
+    */
+    const ValueType* Get(const ValueType& root, size_t* unresolvedTokenIndex = 0) const { 
+        return Get(const_cast<ValueType&>(root), unresolvedTokenIndex);
+    }
+
+    //@}
+
+    //!@name Query a value with default
+    //@{
+
+    //! Query a value in a subtree with default value.
+    /*!
+        Similar to Get(), but if the specified value do not exists, it creates all parents and clone the default value.
+        So that this function always succeed.
+
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \param defaultValue Default value to be cloned if the value was not exists.
+        \param allocator Allocator for creating the values if the specified value or its parents are not exist.
+        \see Create()
+    */
+    ValueType& GetWithDefault(ValueType& root, const ValueType& defaultValue, typename ValueType::AllocatorType& allocator) const {
+        bool alreadyExist;
+        ValueType& v = Create(root, allocator, &alreadyExist);
+        return alreadyExist ? v : v.CopyFrom(defaultValue, allocator);
+    }
+
+    //! Query a value in a subtree with default null-terminated string.
+    ValueType& GetWithDefault(ValueType& root, const Ch* defaultValue, typename ValueType::AllocatorType& allocator) const {
+        bool alreadyExist;
+        ValueType& v = Create(root, allocator, &alreadyExist);
+        return alreadyExist ? v : v.SetString(defaultValue, allocator);
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Query a value in a subtree with default std::basic_string.
+    ValueType& GetWithDefault(ValueType& root, const std::basic_string<Ch>& defaultValue, typename ValueType::AllocatorType& allocator) const {
+        bool alreadyExist;
+        ValueType& v = Create(root, allocator, &alreadyExist);
+        return alreadyExist ? v : v.SetString(defaultValue, allocator);
+    }
+#endif
+
+    //! Query a value in a subtree with default primitive value.
+    /*!
+        \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t, \c bool
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (ValueType&))
+    GetWithDefault(ValueType& root, T defaultValue, typename ValueType::AllocatorType& allocator) const {
+        return GetWithDefault(root, ValueType(defaultValue).Move(), allocator);
+    }
+
+    //! Query a value in a document with default value.
+    template <typename stackAllocator>
+    ValueType& GetWithDefault(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, const ValueType& defaultValue) const {
+        return GetWithDefault(document, defaultValue, document.GetAllocator());
+    }
+
+    //! Query a value in a document with default null-terminated string.
+    template <typename stackAllocator>
+    ValueType& GetWithDefault(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, const Ch* defaultValue) const {
+        return GetWithDefault(document, defaultValue, document.GetAllocator());
+    }
+    
+#if RAPIDJSON_HAS_STDSTRING
+    //! Query a value in a document with default std::basic_string.
+    template <typename stackAllocator>
+    ValueType& GetWithDefault(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, const std::basic_string<Ch>& defaultValue) const {
+        return GetWithDefault(document, defaultValue, document.GetAllocator());
+    }
+#endif
+
+    //! Query a value in a document with default primitive value.
+    /*!
+        \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t, \c bool
+    */
+    template <typename T, typename stackAllocator>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (ValueType&))
+    GetWithDefault(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, T defaultValue) const {
+        return GetWithDefault(document, defaultValue, document.GetAllocator());
+    }
+
+    //@}
+
+    //!@name Set a value
+    //@{
+
+    //! Set a value in a subtree, with move semantics.
+    /*!
+        It creates all parents if they are not exist or types are different to the tokens.
+        So this function always succeeds but potentially remove existing values.
+
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \param value Value to be set.
+        \param allocator Allocator for creating the values if the specified value or its parents are not exist.
+        \see Create()
+    */
+    ValueType& Set(ValueType& root, ValueType& value, typename ValueType::AllocatorType& allocator) const {
+        return Create(root, allocator) = value;
+    }
+
+    //! Set a value in a subtree, with copy semantics.
+    ValueType& Set(ValueType& root, const ValueType& value, typename ValueType::AllocatorType& allocator) const {
+        return Create(root, allocator).CopyFrom(value, allocator);
+    }
+
+    //! Set a null-terminated string in a subtree.
+    ValueType& Set(ValueType& root, const Ch* value, typename ValueType::AllocatorType& allocator) const {
+        return Create(root, allocator) = ValueType(value, allocator).Move();
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Set a std::basic_string in a subtree.
+    ValueType& Set(ValueType& root, const std::basic_string<Ch>& value, typename ValueType::AllocatorType& allocator) const {
+        return Create(root, allocator) = ValueType(value, allocator).Move();
+    }
+#endif
+
+    //! Set a primitive value in a subtree.
+    /*!
+        \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t, \c bool
+    */
+    template <typename T>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (ValueType&))
+    Set(ValueType& root, T value, typename ValueType::AllocatorType& allocator) const {
+        return Create(root, allocator) = ValueType(value).Move();
+    }
+
+    //! Set a value in a document, with move semantics.
+    template <typename stackAllocator>
+    ValueType& Set(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, ValueType& value) const {
+        return Create(document) = value;
+    }
+
+    //! Set a value in a document, with copy semantics.
+    template <typename stackAllocator>
+    ValueType& Set(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, const ValueType& value) const {
+        return Create(document).CopyFrom(value, document.GetAllocator());
+    }
+
+    //! Set a null-terminated string in a document.
+    template <typename stackAllocator>
+    ValueType& Set(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, const Ch* value) const {
+        return Create(document) = ValueType(value, document.GetAllocator()).Move();
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    //! Sets a std::basic_string in a document.
+    template <typename stackAllocator>
+    ValueType& Set(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, const std::basic_string<Ch>& value) const {
+        return Create(document) = ValueType(value, document.GetAllocator()).Move();
+    }
+#endif
+
+    //! Set a primitive value in a document.
+    /*!
+    \tparam T Either \ref Type, \c int, \c unsigned, \c int64_t, \c uint64_t, \c bool
+    */
+    template <typename T, typename stackAllocator>
+    RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T>, internal::IsGenericValue<T> >), (ValueType&))
+        Set(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, T value) const {
+            return Create(document) = value;
+    }
+
+    //@}
+
+    //!@name Swap a value
+    //@{
+
+    //! Swap a value with a value in a subtree.
+    /*!
+        It creates all parents if they are not exist or types are different to the tokens.
+        So this function always succeeds but potentially remove existing values.
+
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \param value Value to be swapped.
+        \param allocator Allocator for creating the values if the specified value or its parents are not exist.
+        \see Create()
+    */
+    ValueType& Swap(ValueType& root, ValueType& value, typename ValueType::AllocatorType& allocator) const {
+        return Create(root, allocator).Swap(value);
+    }
+
+    //! Swap a value with a value in a document.
+    template <typename stackAllocator>
+    ValueType& Swap(GenericDocument<EncodingType, typename ValueType::AllocatorType, stackAllocator>& document, ValueType& value) const {
+        return Create(document).Swap(value);
+    }
+
+    //@}
+
+    //! Erase a value in a subtree.
+    /*!
+        \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root.
+        \return Whether the resolved value is found and erased.
+
+        \note Erasing with an empty pointer \c Pointer(""), i.e. the root, always fail and return false.
+    */
+    bool Erase(ValueType& root) const {
+        RAPIDJSON_ASSERT(IsValid());
+        if (tokenCount_ == 0) // Cannot erase the root
+            return false;
+
+        ValueType* v = &root;
+        const Token* last = tokens_ + (tokenCount_ - 1);
+        for (const Token *t = tokens_; t != last; ++t) {
+            switch (v->GetType()) {
+            case kObjectType:
+                {
+                    typename ValueType::MemberIterator m = v->FindMember(GenericValue<EncodingType>(GenericStringRef<Ch>(t->name, t->length)));
+                    if (m == v->MemberEnd())
+                        return false;
+                    v = &m->value;
+                }
+                break;
+            case kArrayType:
+                if (t->index == kPointerInvalidIndex || t->index >= v->Size())
+                    return false;
+                v = &((*v)[t->index]);
+                break;
+            default:
+                return false;
+            }
+        }
+
+        switch (v->GetType()) {
+        case kObjectType:
+            return v->EraseMember(GenericStringRef<Ch>(last->name, last->length));
+        case kArrayType:
+            if (last->index == kPointerInvalidIndex || last->index >= v->Size())
+                return false;
+            v->Erase(v->Begin() + last->index);
+            return true;
+        default:
+            return false;
+        }
+    }
+
+private:
+    //! Clone the content from rhs to this.
+    /*!
+        \param rhs Source pointer.
+        \param extraToken Extra tokens to be allocated.
+        \param extraNameBufferSize Extra name buffer size (in number of Ch) to be allocated.
+        \return Start of non-occupied name buffer, for storing extra names.
+    */
+    Ch* CopyFromRaw(const GenericPointer& rhs, size_t extraToken = 0, size_t extraNameBufferSize = 0) {
+        if (!allocator_) // allocator is independently owned.
+            ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+
+        size_t nameBufferSize = rhs.tokenCount_; // null terminators for tokens
+        for (Token *t = rhs.tokens_; t != rhs.tokens_ + rhs.tokenCount_; ++t)
+            nameBufferSize += t->length;
+
+        tokenCount_ = rhs.tokenCount_ + extraToken;
+        tokens_ = static_cast<Token *>(allocator_->Malloc(tokenCount_ * sizeof(Token) + (nameBufferSize + extraNameBufferSize) * sizeof(Ch)));
+        nameBuffer_ = reinterpret_cast<Ch *>(tokens_ + tokenCount_);
+        if (rhs.tokenCount_ > 0) {
+            std::memcpy(tokens_, rhs.tokens_, rhs.tokenCount_ * sizeof(Token));
+        }
+        if (nameBufferSize > 0) {
+            std::memcpy(nameBuffer_, rhs.nameBuffer_, nameBufferSize * sizeof(Ch));
+        }
+
+        // Adjust pointers to name buffer
+        std::ptrdiff_t diff = nameBuffer_ - rhs.nameBuffer_;
+        for (Token *t = tokens_; t != tokens_ + rhs.tokenCount_; ++t)
+            t->name += diff;
+
+        return nameBuffer_ + nameBufferSize;
+    }
+
+    //! Check whether a character should be percent-encoded.
+    /*!
+        According to RFC 3986 2.3 Unreserved Characters.
+        \param c The character (code unit) to be tested.
+    */
+    bool NeedPercentEncode(Ch c) const {
+        return !((c >= '0' && c <= '9') || (c >= 'A' && c <='Z') || (c >= 'a' && c <= 'z') || c == '-' || c == '.' || c == '_' || c =='~');
+    }
+
+    //! Parse a JSON String or its URI fragment representation into tokens.
+#ifndef __clang__ // -Wdocumentation
+    /*!
+        \param source Either a JSON Pointer string, or its URI fragment representation. Not need to be null terminated.
+        \param length Length of the source string.
+        \note Source cannot be JSON String Representation of JSON Pointer, e.g. In "/\u0000", \u0000 will not be unescaped.
+    */
+#endif
+    void Parse(const Ch* source, size_t length) {
+        RAPIDJSON_ASSERT(source != NULL);
+        RAPIDJSON_ASSERT(nameBuffer_ == 0);
+        RAPIDJSON_ASSERT(tokens_ == 0);
+
+        // Create own allocator if user did not supply.
+        if (!allocator_)
+            ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+
+        // Count number of '/' as tokenCount
+        tokenCount_ = 0;
+        for (const Ch* s = source; s != source + length; s++) 
+            if (*s == '/')
+                tokenCount_++;
+
+        Token* token = tokens_ = static_cast<Token *>(allocator_->Malloc(tokenCount_ * sizeof(Token) + length * sizeof(Ch)));
+        Ch* name = nameBuffer_ = reinterpret_cast<Ch *>(tokens_ + tokenCount_);
+        size_t i = 0;
+
+        // Detect if it is a URI fragment
+        bool uriFragment = false;
+        if (source[i] == '#') {
+            uriFragment = true;
+            i++;
+        }
+
+        if (i != length && source[i] != '/') {
+            parseErrorCode_ = kPointerParseErrorTokenMustBeginWithSolidus;
+            goto error;
+        }
+
+        while (i < length) {
+            RAPIDJSON_ASSERT(source[i] == '/');
+            i++; // consumes '/'
+
+            token->name = name;
+            bool isNumber = true;
+
+            while (i < length && source[i] != '/') {
+                Ch c = source[i];
+                if (uriFragment) {
+                    // Decoding percent-encoding for URI fragment
+                    if (c == '%') {
+                        PercentDecodeStream is(&source[i], source + length);
+                        GenericInsituStringStream<EncodingType> os(name);
+                        Ch* begin = os.PutBegin();
+                        if (!Transcoder<UTF8<>, EncodingType>().Validate(is, os) || !is.IsValid()) {
+                            parseErrorCode_ = kPointerParseErrorInvalidPercentEncoding;
+                            goto error;
+                        }
+                        size_t len = os.PutEnd(begin);
+                        i += is.Tell() - 1;
+                        if (len == 1)
+                            c = *name;
+                        else {
+                            name += len;
+                            isNumber = false;
+                            i++;
+                            continue;
+                        }
+                    }
+                    else if (NeedPercentEncode(c)) {
+                        parseErrorCode_ = kPointerParseErrorCharacterMustPercentEncode;
+                        goto error;
+                    }
+                }
+
+                i++;
+                
+                // Escaping "~0" -> '~', "~1" -> '/'
+                if (c == '~') {
+                    if (i < length) {
+                        c = source[i];
+                        if (c == '0')       c = '~';
+                        else if (c == '1')  c = '/';
+                        else {
+                            parseErrorCode_ = kPointerParseErrorInvalidEscape;
+                            goto error;
+                        }
+                        i++;
+                    }
+                    else {
+                        parseErrorCode_ = kPointerParseErrorInvalidEscape;
+                        goto error;
+                    }
+                }
+
+                // First check for index: all of characters are digit
+                if (c < '0' || c > '9')
+                    isNumber = false;
+
+                *name++ = c;
+            }
+            token->length = static_cast<SizeType>(name - token->name);
+            if (token->length == 0)
+                isNumber = false;
+            *name++ = '\0'; // Null terminator
+
+            // Second check for index: more than one digit cannot have leading zero
+            if (isNumber && token->length > 1 && token->name[0] == '0')
+                isNumber = false;
+
+            // String to SizeType conversion
+            SizeType n = 0;
+            if (isNumber) {
+                for (size_t j = 0; j < token->length; j++) {
+                    SizeType m = n * 10 + static_cast<SizeType>(token->name[j] - '0');
+                    if (m < n) {   // overflow detection
+                        isNumber = false;
+                        break;
+                    }
+                    n = m;
+                }
+            }
+
+            token->index = isNumber ? n : kPointerInvalidIndex;
+            token++;
+        }
+
+        RAPIDJSON_ASSERT(name <= nameBuffer_ + length); // Should not overflow buffer
+        parseErrorCode_ = kPointerParseErrorNone;
+        return;
+
+    error:
+        Allocator::Free(tokens_);
+        nameBuffer_ = 0;
+        tokens_ = 0;
+        tokenCount_ = 0;
+        parseErrorOffset_ = i;
+        return;
+    }
+
+    //! Stringify to string or URI fragment representation.
+    /*!
+        \tparam uriFragment True for stringifying to URI fragment representation. False for string representation.
+        \tparam OutputStream type of output stream.
+        \param os The output stream.
+    */
+    template<bool uriFragment, typename OutputStream>
+    bool Stringify(OutputStream& os) const {
+        RAPIDJSON_ASSERT(IsValid());
+
+        if (uriFragment)
+            os.Put('#');
+
+        for (Token *t = tokens_; t != tokens_ + tokenCount_; ++t) {
+            os.Put('/');
+            for (size_t j = 0; j < t->length; j++) {
+                Ch c = t->name[j];
+                if (c == '~') {
+                    os.Put('~');
+                    os.Put('0');
+                }
+                else if (c == '/') {
+                    os.Put('~');
+                    os.Put('1');
+                }
+                else if (uriFragment && NeedPercentEncode(c)) { 
+                    // Transcode to UTF8 sequence
+                    GenericStringStream<typename ValueType::EncodingType> source(&t->name[j]);
+                    PercentEncodeStream<OutputStream> target(os);
+                    if (!Transcoder<EncodingType, UTF8<> >().Validate(source, target))
+                        return false;
+                    j += source.Tell() - 1;
+                }
+                else
+                    os.Put(c);
+            }
+        }
+        return true;
+    }
+
+    //! A helper stream for decoding a percent-encoded sequence into code unit.
+    /*!
+        This stream decodes %XY triplet into code unit (0-255).
+        If it encounters invalid characters, it sets output code unit as 0 and 
+        mark invalid, and to be checked by IsValid().
+    */
+    class PercentDecodeStream {
+    public:
+        typedef typename ValueType::Ch Ch;
+
+        //! Constructor
+        /*!
+            \param source Start of the stream
+            \param end Past-the-end of the stream.
+        */
+        PercentDecodeStream(const Ch* source, const Ch* end) : src_(source), head_(source), end_(end), valid_(true) {}
+
+        Ch Take() {
+            if (*src_ != '%' || src_ + 3 > end_) { // %XY triplet
+                valid_ = false;
+                return 0;
+            }
+            src_++;
+            Ch c = 0;
+            for (int j = 0; j < 2; j++) {
+                c = static_cast<Ch>(c << 4);
+                Ch h = *src_;
+                if      (h >= '0' && h <= '9') c = static_cast<Ch>(c + h - '0');
+                else if (h >= 'A' && h <= 'F') c = static_cast<Ch>(c + h - 'A' + 10);
+                else if (h >= 'a' && h <= 'f') c = static_cast<Ch>(c + h - 'a' + 10);
+                else {
+                    valid_ = false;
+                    return 0;
+                }
+                src_++;
+            }
+            return c;
+        }
+
+        size_t Tell() const { return static_cast<size_t>(src_ - head_); }
+        bool IsValid() const { return valid_; }
+
+    private:
+        const Ch* src_;     //!< Current read position.
+        const Ch* head_;    //!< Original head of the string.
+        const Ch* end_;     //!< Past-the-end position.
+        bool valid_;        //!< Whether the parsing is valid.
+    };
+
+    //! A helper stream to encode character (UTF-8 code unit) into percent-encoded sequence.
+    template <typename OutputStream>
+    class PercentEncodeStream {
+    public:
+        PercentEncodeStream(OutputStream& os) : os_(os) {}
+        void Put(char c) { // UTF-8 must be byte
+            unsigned char u = static_cast<unsigned char>(c);
+            static const char hexDigits[16] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
+            os_.Put('%');
+            os_.Put(static_cast<typename OutputStream::Ch>(hexDigits[u >> 4]));
+            os_.Put(static_cast<typename OutputStream::Ch>(hexDigits[u & 15]));
+        }
+    private:
+        OutputStream& os_;
+    };
+
+    Allocator* allocator_;                  //!< The current allocator. It is either user-supplied or equal to ownAllocator_.
+    Allocator* ownAllocator_;               //!< Allocator owned by this Pointer.
+    Ch* nameBuffer_;                        //!< A buffer containing all names in tokens.
+    Token* tokens_;                         //!< A list of tokens.
+    size_t tokenCount_;                     //!< Number of tokens in tokens_.
+    size_t parseErrorOffset_;               //!< Offset in code unit when parsing fail.
+    PointerParseErrorCode parseErrorCode_;  //!< Parsing error code.
+};
+
+//! GenericPointer for Value (UTF-8, default allocator).
+typedef GenericPointer<Value> Pointer;
+
+//!@name Helper functions for GenericPointer
+//@{
+
+//////////////////////////////////////////////////////////////////////////////
+
+template <typename T>
+typename T::ValueType& CreateValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, typename T::AllocatorType& a) {
+    return pointer.Create(root, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& CreateValueByPointer(T& root, const CharType(&source)[N], typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Create(root, a);
+}
+
+// No allocator parameter
+
+template <typename DocumentType>
+typename DocumentType::ValueType& CreateValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer) {
+    return pointer.Create(document);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& CreateValueByPointer(DocumentType& document, const CharType(&source)[N]) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Create(document);
+}
+
+//////////////////////////////////////////////////////////////////////////////
+
+template <typename T>
+typename T::ValueType* GetValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, size_t* unresolvedTokenIndex = 0) {
+    return pointer.Get(root, unresolvedTokenIndex);
+}
+
+template <typename T>
+const typename T::ValueType* GetValueByPointer(const T& root, const GenericPointer<typename T::ValueType>& pointer, size_t* unresolvedTokenIndex = 0) {
+    return pointer.Get(root, unresolvedTokenIndex);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType* GetValueByPointer(T& root, const CharType (&source)[N], size_t* unresolvedTokenIndex = 0) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Get(root, unresolvedTokenIndex);
+}
+
+template <typename T, typename CharType, size_t N>
+const typename T::ValueType* GetValueByPointer(const T& root, const CharType(&source)[N], size_t* unresolvedTokenIndex = 0) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Get(root, unresolvedTokenIndex);
+}
+
+//////////////////////////////////////////////////////////////////////////////
+
+template <typename T>
+typename T::ValueType& GetValueByPointerWithDefault(T& root, const GenericPointer<typename T::ValueType>& pointer, const typename T::ValueType& defaultValue, typename T::AllocatorType& a) {
+    return pointer.GetWithDefault(root, defaultValue, a);
+}
+
+template <typename T>
+typename T::ValueType& GetValueByPointerWithDefault(T& root, const GenericPointer<typename T::ValueType>& pointer, const typename T::Ch* defaultValue, typename T::AllocatorType& a) {
+    return pointer.GetWithDefault(root, defaultValue, a);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename T>
+typename T::ValueType& GetValueByPointerWithDefault(T& root, const GenericPointer<typename T::ValueType>& pointer, const std::basic_string<typename T::Ch>& defaultValue, typename T::AllocatorType& a) {
+    return pointer.GetWithDefault(root, defaultValue, a);
+}
+#endif
+
+template <typename T, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename T::ValueType&))
+GetValueByPointerWithDefault(T& root, const GenericPointer<typename T::ValueType>& pointer, T2 defaultValue, typename T::AllocatorType& a) {
+    return pointer.GetWithDefault(root, defaultValue, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& GetValueByPointerWithDefault(T& root, const CharType(&source)[N], const typename T::ValueType& defaultValue, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).GetWithDefault(root, defaultValue, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& GetValueByPointerWithDefault(T& root, const CharType(&source)[N], const typename T::Ch* defaultValue, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).GetWithDefault(root, defaultValue, a);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& GetValueByPointerWithDefault(T& root, const CharType(&source)[N], const std::basic_string<typename T::Ch>& defaultValue, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).GetWithDefault(root, defaultValue, a);
+}
+#endif
+
+template <typename T, typename CharType, size_t N, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename T::ValueType&))
+GetValueByPointerWithDefault(T& root, const CharType(&source)[N], T2 defaultValue, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).GetWithDefault(root, defaultValue, a);
+}
+
+// No allocator parameter
+
+template <typename DocumentType>
+typename DocumentType::ValueType& GetValueByPointerWithDefault(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, const typename DocumentType::ValueType& defaultValue) {
+    return pointer.GetWithDefault(document, defaultValue);
+}
+
+template <typename DocumentType>
+typename DocumentType::ValueType& GetValueByPointerWithDefault(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, const typename DocumentType::Ch* defaultValue) {
+    return pointer.GetWithDefault(document, defaultValue);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename DocumentType>
+typename DocumentType::ValueType& GetValueByPointerWithDefault(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, const std::basic_string<typename DocumentType::Ch>& defaultValue) {
+    return pointer.GetWithDefault(document, defaultValue);
+}
+#endif
+
+template <typename DocumentType, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename DocumentType::ValueType&))
+GetValueByPointerWithDefault(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, T2 defaultValue) {
+    return pointer.GetWithDefault(document, defaultValue);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& GetValueByPointerWithDefault(DocumentType& document, const CharType(&source)[N], const typename DocumentType::ValueType& defaultValue) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).GetWithDefault(document, defaultValue);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& GetValueByPointerWithDefault(DocumentType& document, const CharType(&source)[N], const typename DocumentType::Ch* defaultValue) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).GetWithDefault(document, defaultValue);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& GetValueByPointerWithDefault(DocumentType& document, const CharType(&source)[N], const std::basic_string<typename DocumentType::Ch>& defaultValue) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).GetWithDefault(document, defaultValue);
+}
+#endif
+
+template <typename DocumentType, typename CharType, size_t N, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename DocumentType::ValueType&))
+GetValueByPointerWithDefault(DocumentType& document, const CharType(&source)[N], T2 defaultValue) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).GetWithDefault(document, defaultValue);
+}
+
+//////////////////////////////////////////////////////////////////////////////
+
+template <typename T>
+typename T::ValueType& SetValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, typename T::ValueType& value, typename T::AllocatorType& a) {
+    return pointer.Set(root, value, a);
+}
+
+template <typename T>
+typename T::ValueType& SetValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, const typename T::ValueType& value, typename T::AllocatorType& a) {
+    return pointer.Set(root, value, a);
+}
+
+template <typename T>
+typename T::ValueType& SetValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, const typename T::Ch* value, typename T::AllocatorType& a) {
+    return pointer.Set(root, value, a);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename T>
+typename T::ValueType& SetValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, const std::basic_string<typename T::Ch>& value, typename T::AllocatorType& a) {
+    return pointer.Set(root, value, a);
+}
+#endif
+
+template <typename T, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename T::ValueType&))
+SetValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, T2 value, typename T::AllocatorType& a) {
+    return pointer.Set(root, value, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& SetValueByPointer(T& root, const CharType(&source)[N], typename T::ValueType& value, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Set(root, value, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& SetValueByPointer(T& root, const CharType(&source)[N], const typename T::ValueType& value, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Set(root, value, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& SetValueByPointer(T& root, const CharType(&source)[N], const typename T::Ch* value, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Set(root, value, a);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& SetValueByPointer(T& root, const CharType(&source)[N], const std::basic_string<typename T::Ch>& value, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Set(root, value, a);
+}
+#endif
+
+template <typename T, typename CharType, size_t N, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename T::ValueType&))
+SetValueByPointer(T& root, const CharType(&source)[N], T2 value, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Set(root, value, a);
+}
+
+// No allocator parameter
+
+template <typename DocumentType>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, typename DocumentType::ValueType& value) {
+    return pointer.Set(document, value);
+}
+
+template <typename DocumentType>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, const typename DocumentType::ValueType& value) {
+    return pointer.Set(document, value);
+}
+
+template <typename DocumentType>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, const typename DocumentType::Ch* value) {
+    return pointer.Set(document, value);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename DocumentType>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, const std::basic_string<typename DocumentType::Ch>& value) {
+    return pointer.Set(document, value);
+}
+#endif
+
+template <typename DocumentType, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename DocumentType::ValueType&))
+SetValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, T2 value) {
+    return pointer.Set(document, value);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const CharType(&source)[N], typename DocumentType::ValueType& value) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Set(document, value);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const CharType(&source)[N], const typename DocumentType::ValueType& value) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Set(document, value);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const CharType(&source)[N], const typename DocumentType::Ch* value) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Set(document, value);
+}
+
+#if RAPIDJSON_HAS_STDSTRING
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& SetValueByPointer(DocumentType& document, const CharType(&source)[N], const std::basic_string<typename DocumentType::Ch>& value) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Set(document, value);
+}
+#endif
+
+template <typename DocumentType, typename CharType, size_t N, typename T2>
+RAPIDJSON_DISABLEIF_RETURN((internal::OrExpr<internal::IsPointer<T2>, internal::IsGenericValue<T2> >), (typename DocumentType::ValueType&))
+SetValueByPointer(DocumentType& document, const CharType(&source)[N], T2 value) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Set(document, value);
+}
+
+//////////////////////////////////////////////////////////////////////////////
+
+template <typename T>
+typename T::ValueType& SwapValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer, typename T::ValueType& value, typename T::AllocatorType& a) {
+    return pointer.Swap(root, value, a);
+}
+
+template <typename T, typename CharType, size_t N>
+typename T::ValueType& SwapValueByPointer(T& root, const CharType(&source)[N], typename T::ValueType& value, typename T::AllocatorType& a) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Swap(root, value, a);
+}
+
+template <typename DocumentType>
+typename DocumentType::ValueType& SwapValueByPointer(DocumentType& document, const GenericPointer<typename DocumentType::ValueType>& pointer, typename DocumentType::ValueType& value) {
+    return pointer.Swap(document, value);
+}
+
+template <typename DocumentType, typename CharType, size_t N>
+typename DocumentType::ValueType& SwapValueByPointer(DocumentType& document, const CharType(&source)[N], typename DocumentType::ValueType& value) {
+    return GenericPointer<typename DocumentType::ValueType>(source, N - 1).Swap(document, value);
+}
+
+//////////////////////////////////////////////////////////////////////////////
+
+template <typename T>
+bool EraseValueByPointer(T& root, const GenericPointer<typename T::ValueType>& pointer) {
+    return pointer.Erase(root);
+}
+
+template <typename T, typename CharType, size_t N>
+bool EraseValueByPointer(T& root, const CharType(&source)[N]) {
+    return GenericPointer<typename T::ValueType>(source, N - 1).Erase(root);
+}
+
+//@}
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__) || defined(_MSC_VER)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_POINTER_H_
diff --git a/General/General/include/rapidjson/prettywriter.h b/General/General/include/rapidjson/prettywriter.h
new file mode 100644
index 0000000..fe45df1
--- /dev/null
+++ b/General/General/include/rapidjson/prettywriter.h
@@ -0,0 +1,277 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_PRETTYWRITER_H_
+#define RAPIDJSON_PRETTYWRITER_H_
+
+#include "writer.h"
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Combination of PrettyWriter format flags.
+/*! \see PrettyWriter::SetFormatOptions
+ */
+enum PrettyFormatOptions {
+    kFormatDefault = 0,         //!< Default pretty formatting.
+    kFormatSingleLineArray = 1  //!< Format arrays on a single line.
+};
+
+//! Writer with indentation and spacing.
+/*!
+    \tparam OutputStream Type of output os.
+    \tparam SourceEncoding Encoding of source string.
+    \tparam TargetEncoding Encoding of output stream.
+    \tparam StackAllocator Type of allocator for allocating memory of stack.
+*/
+template<typename OutputStream, typename SourceEncoding = UTF8<>, typename TargetEncoding = UTF8<>, typename StackAllocator = CrtAllocator, unsigned writeFlags = kWriteDefaultFlags>
+class PrettyWriter : public Writer<OutputStream, SourceEncoding, TargetEncoding, StackAllocator, writeFlags> {
+public:
+    typedef Writer<OutputStream, SourceEncoding, TargetEncoding, StackAllocator, writeFlags> Base;
+    typedef typename Base::Ch Ch;
+
+    //! Constructor
+    /*! \param os Output stream.
+        \param allocator User supplied allocator. If it is null, it will create a private one.
+        \param levelDepth Initial capacity of stack.
+    */
+    explicit PrettyWriter(OutputStream& os, StackAllocator* allocator = 0, size_t levelDepth = Base::kDefaultLevelDepth) : 
+        Base(os, allocator, levelDepth), indentChar_(' '), indentCharCount_(4), formatOptions_(kFormatDefault) {}
+
+
+    explicit PrettyWriter(StackAllocator* allocator = 0, size_t levelDepth = Base::kDefaultLevelDepth) : 
+        Base(allocator, levelDepth), indentChar_(' '), indentCharCount_(4), formatOptions_(kFormatDefault) {}
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    PrettyWriter(PrettyWriter&& rhs) :
+        Base(std::forward<PrettyWriter>(rhs)), indentChar_(rhs.indentChar_), indentCharCount_(rhs.indentCharCount_), formatOptions_(rhs.formatOptions_) {}
+#endif
+
+    //! Set custom indentation.
+    /*! \param indentChar       Character for indentation. Must be whitespace character (' ', '\\t', '\\n', '\\r').
+        \param indentCharCount  Number of indent characters for each indentation level.
+        \note The default indentation is 4 spaces.
+    */
+    PrettyWriter& SetIndent(Ch indentChar, unsigned indentCharCount) {
+        RAPIDJSON_ASSERT(indentChar == ' ' || indentChar == '\t' || indentChar == '\n' || indentChar == '\r');
+        indentChar_ = indentChar;
+        indentCharCount_ = indentCharCount;
+        return *this;
+    }
+
+    //! Set pretty writer formatting options.
+    /*! \param options Formatting options.
+    */
+    PrettyWriter& SetFormatOptions(PrettyFormatOptions options) {
+        formatOptions_ = options;
+        return *this;
+    }
+
+    /*! @name Implementation of Handler
+        \see Handler
+    */
+    //@{
+
+    bool Null()                 { PrettyPrefix(kNullType);   return Base::EndValue(Base::WriteNull()); }
+    bool Bool(bool b)           { PrettyPrefix(b ? kTrueType : kFalseType); return Base::EndValue(Base::WriteBool(b)); }
+    bool Int(int i)             { PrettyPrefix(kNumberType); return Base::EndValue(Base::WriteInt(i)); }
+    bool Uint(unsigned u)       { PrettyPrefix(kNumberType); return Base::EndValue(Base::WriteUint(u)); }
+    bool Int64(int64_t i64)     { PrettyPrefix(kNumberType); return Base::EndValue(Base::WriteInt64(i64)); }
+    bool Uint64(uint64_t u64)   { PrettyPrefix(kNumberType); return Base::EndValue(Base::WriteUint64(u64));  }
+    bool Double(double d)       { PrettyPrefix(kNumberType); return Base::EndValue(Base::WriteDouble(d)); }
+
+    bool RawNumber(const Ch* str, SizeType length, bool copy = false) {
+        RAPIDJSON_ASSERT(str != 0);
+        (void)copy;
+        PrettyPrefix(kNumberType);
+        return Base::EndValue(Base::WriteString(str, length));
+    }
+
+    bool String(const Ch* str, SizeType length, bool copy = false) {
+        RAPIDJSON_ASSERT(str != 0);
+        (void)copy;
+        PrettyPrefix(kStringType);
+        return Base::EndValue(Base::WriteString(str, length));
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    bool String(const std::basic_string<Ch>& str) {
+        return String(str.data(), SizeType(str.size()));
+    }
+#endif
+
+    bool StartObject() {
+        PrettyPrefix(kObjectType);
+        new (Base::level_stack_.template Push<typename Base::Level>()) typename Base::Level(false);
+        return Base::WriteStartObject();
+    }
+
+    bool Key(const Ch* str, SizeType length, bool copy = false) { return String(str, length, copy); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    bool Key(const std::basic_string<Ch>& str) {
+        return Key(str.data(), SizeType(str.size()));
+    }
+#endif
+	
+    bool EndObject(SizeType memberCount = 0) {
+        (void)memberCount;
+        RAPIDJSON_ASSERT(Base::level_stack_.GetSize() >= sizeof(typename Base::Level)); // not inside an Object
+        RAPIDJSON_ASSERT(!Base::level_stack_.template Top<typename Base::Level>()->inArray); // currently inside an Array, not Object
+        RAPIDJSON_ASSERT(0 == Base::level_stack_.template Top<typename Base::Level>()->valueCount % 2); // Object has a Key without a Value
+       
+        bool empty = Base::level_stack_.template Pop<typename Base::Level>(1)->valueCount == 0;
+
+        if (!empty) {
+            Base::os_->Put('\n');
+            WriteIndent();
+        }
+        bool ret = Base::EndValue(Base::WriteEndObject());
+        (void)ret;
+        RAPIDJSON_ASSERT(ret == true);
+        if (Base::level_stack_.Empty()) // end of json text
+            Base::Flush();
+        return true;
+    }
+
+    bool StartArray() {
+        PrettyPrefix(kArrayType);
+        new (Base::level_stack_.template Push<typename Base::Level>()) typename Base::Level(true);
+        return Base::WriteStartArray();
+    }
+
+    bool EndArray(SizeType memberCount = 0) {
+        (void)memberCount;
+        RAPIDJSON_ASSERT(Base::level_stack_.GetSize() >= sizeof(typename Base::Level));
+        RAPIDJSON_ASSERT(Base::level_stack_.template Top<typename Base::Level>()->inArray);
+        bool empty = Base::level_stack_.template Pop<typename Base::Level>(1)->valueCount == 0;
+
+        if (!empty && !(formatOptions_ & kFormatSingleLineArray)) {
+            Base::os_->Put('\n');
+            WriteIndent();
+        }
+        bool ret = Base::EndValue(Base::WriteEndArray());
+        (void)ret;
+        RAPIDJSON_ASSERT(ret == true);
+        if (Base::level_stack_.Empty()) // end of json text
+            Base::Flush();
+        return true;
+    }
+
+    //@}
+
+    /*! @name Convenience extensions */
+    //@{
+
+    //! Simpler but slower overload.
+    bool String(const Ch* str) { return String(str, internal::StrLen(str)); }
+    bool Key(const Ch* str) { return Key(str, internal::StrLen(str)); }
+
+    //@}
+
+    //! Write a raw JSON value.
+    /*!
+        For user to write a stringified JSON as a value.
+
+        \param json A well-formed JSON value. It should not contain null character within [0, length - 1] range.
+        \param length Length of the json.
+        \param type Type of the root of json.
+        \note When using PrettyWriter::RawValue(), the result json may not be indented correctly.
+    */
+    bool RawValue(const Ch* json, size_t length, Type type) {
+        RAPIDJSON_ASSERT(json != 0);
+        PrettyPrefix(type);
+        return Base::EndValue(Base::WriteRawValue(json, length));
+    }
+
+protected:
+    void PrettyPrefix(Type type) {
+        (void)type;
+        if (Base::level_stack_.GetSize() != 0) { // this value is not at root
+            typename Base::Level* level = Base::level_stack_.template Top<typename Base::Level>();
+
+            if (level->inArray) {
+                if (level->valueCount > 0) {
+                    Base::os_->Put(','); // add comma if it is not the first element in array
+                    if (formatOptions_ & kFormatSingleLineArray)
+                        Base::os_->Put(' ');
+                }
+
+                if (!(formatOptions_ & kFormatSingleLineArray)) {
+                    Base::os_->Put('\n');
+                    WriteIndent();
+                }
+            }
+            else {  // in object
+                if (level->valueCount > 0) {
+                    if (level->valueCount % 2 == 0) {
+                        Base::os_->Put(',');
+                        Base::os_->Put('\n');
+                    }
+                    else {
+                        Base::os_->Put(':');
+                        Base::os_->Put(' ');
+                    }
+                }
+                else
+                    Base::os_->Put('\n');
+
+                if (level->valueCount % 2 == 0)
+                    WriteIndent();
+            }
+            if (!level->inArray && level->valueCount % 2 == 0)
+                RAPIDJSON_ASSERT(type == kStringType);  // if it's in object, then even number should be a name
+            level->valueCount++;
+        }
+        else {
+            RAPIDJSON_ASSERT(!Base::hasRoot_);  // Should only has one and only one root.
+            Base::hasRoot_ = true;
+        }
+    }
+
+    void WriteIndent()  {
+        size_t count = (Base::level_stack_.GetSize() / sizeof(typename Base::Level)) * indentCharCount_;
+        PutN(*Base::os_, static_cast<typename OutputStream::Ch>(indentChar_), count);
+    }
+
+    Ch indentChar_;
+    unsigned indentCharCount_;
+    PrettyFormatOptions formatOptions_;
+
+private:
+    // Prohibit copy constructor & assignment operator.
+    PrettyWriter(const PrettyWriter&);
+    PrettyWriter& operator=(const PrettyWriter&);
+};
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_RAPIDJSON_H_
diff --git a/General/General/include/rapidjson/rapidjson.h b/General/General/include/rapidjson/rapidjson.h
new file mode 100644
index 0000000..a4e8953
--- /dev/null
+++ b/General/General/include/rapidjson/rapidjson.h
@@ -0,0 +1,741 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_RAPIDJSON_H_
+#define RAPIDJSON_RAPIDJSON_H_
+
+/*!\file rapidjson.h
+    \brief common definitions and configuration
+    
+    \see RAPIDJSON_CONFIG
+ */
+
+/*! \defgroup RAPIDJSON_CONFIG RapidJSON configuration
+    \brief Configuration macros for library features
+
+    Some RapidJSON features are configurable to adapt the library to a wide
+    variety of platforms, environments and usage scenarios.  Most of the
+    features can be configured in terms of overridden or predefined
+    preprocessor macros at compile-time.
+
+    Some additional customization is available in the \ref RAPIDJSON_ERRORS APIs.
+
+    \note These macros should be given on the compiler command-line
+          (where applicable)  to avoid inconsistent values when compiling
+          different translation units of a single application.
+ */
+
+#include <cstdlib>  // malloc(), realloc(), free(), size_t
+#include <cstring>  // memset(), memcpy(), memmove(), memcmp()
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_VERSION_STRING
+//
+// ALWAYS synchronize the following 3 macros with corresponding variables in /CMakeLists.txt.
+//
+
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+// token stringification
+#define RAPIDJSON_STRINGIFY(x) RAPIDJSON_DO_STRINGIFY(x)
+#define RAPIDJSON_DO_STRINGIFY(x) #x
+
+// token concatenation
+#define RAPIDJSON_JOIN(X, Y) RAPIDJSON_DO_JOIN(X, Y)
+#define RAPIDJSON_DO_JOIN(X, Y) RAPIDJSON_DO_JOIN2(X, Y)
+#define RAPIDJSON_DO_JOIN2(X, Y) X##Y
+//!@endcond
+
+/*! \def RAPIDJSON_MAJOR_VERSION
+    \ingroup RAPIDJSON_CONFIG
+    \brief Major version of RapidJSON in integer.
+*/
+/*! \def RAPIDJSON_MINOR_VERSION
+    \ingroup RAPIDJSON_CONFIG
+    \brief Minor version of RapidJSON in integer.
+*/
+/*! \def RAPIDJSON_PATCH_VERSION
+    \ingroup RAPIDJSON_CONFIG
+    \brief Patch version of RapidJSON in integer.
+*/
+/*! \def RAPIDJSON_VERSION_STRING
+    \ingroup RAPIDJSON_CONFIG
+    \brief Version of RapidJSON in "<major>.<minor>.<patch>" string format.
+*/
+#define RAPIDJSON_MAJOR_VERSION 1
+#define RAPIDJSON_MINOR_VERSION 1
+#define RAPIDJSON_PATCH_VERSION 0
+#define RAPIDJSON_VERSION_STRING \
+    RAPIDJSON_STRINGIFY(RAPIDJSON_MAJOR_VERSION.RAPIDJSON_MINOR_VERSION.RAPIDJSON_PATCH_VERSION)
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_NAMESPACE_(BEGIN|END)
+/*! \def RAPIDJSON_NAMESPACE
+    \ingroup RAPIDJSON_CONFIG
+    \brief   provide custom rapidjson namespace
+
+    In order to avoid symbol clashes and/or "One Definition Rule" errors
+    between multiple inclusions of (different versions of) RapidJSON in
+    a single binary, users can customize the name of the main RapidJSON
+    namespace.
+
+    In case of a single nesting level, defining \c RAPIDJSON_NAMESPACE
+    to a custom name (e.g. \c MyRapidJSON) is sufficient.  If multiple
+    levels are needed, both \ref RAPIDJSON_NAMESPACE_BEGIN and \ref
+    RAPIDJSON_NAMESPACE_END need to be defined as well:
+
+    \code
+    // in some .cpp file
+    #define RAPIDJSON_NAMESPACE my::rapidjson
+    #define RAPIDJSON_NAMESPACE_BEGIN namespace my { namespace rapidjson {
+    #define RAPIDJSON_NAMESPACE_END   } }
+    #include "rapidjson/..."
+    \endcode
+
+    \see rapidjson
+ */
+/*! \def RAPIDJSON_NAMESPACE_BEGIN
+    \ingroup RAPIDJSON_CONFIG
+    \brief   provide custom rapidjson namespace (opening expression)
+    \see RAPIDJSON_NAMESPACE
+*/
+/*! \def RAPIDJSON_NAMESPACE_END
+    \ingroup RAPIDJSON_CONFIG
+    \brief   provide custom rapidjson namespace (closing expression)
+    \see RAPIDJSON_NAMESPACE
+*/
+#ifndef RAPIDJSON_NAMESPACE
+#define RAPIDJSON_NAMESPACE rapidjson
+#endif
+#ifndef RAPIDJSON_NAMESPACE_BEGIN
+#define RAPIDJSON_NAMESPACE_BEGIN namespace RAPIDJSON_NAMESPACE {
+#endif
+#ifndef RAPIDJSON_NAMESPACE_END
+#define RAPIDJSON_NAMESPACE_END }
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// __cplusplus macro
+
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+
+#if defined(_MSC_VER)
+#define RAPIDJSON_CPLUSPLUS _MSVC_LANG
+#else
+#define RAPIDJSON_CPLUSPLUS __cplusplus
+#endif
+
+//!@endcond
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_HAS_STDSTRING
+
+#ifndef RAPIDJSON_HAS_STDSTRING
+#ifdef RAPIDJSON_DOXYGEN_RUNNING
+#define RAPIDJSON_HAS_STDSTRING 1 // force generation of documentation
+#else
+#define RAPIDJSON_HAS_STDSTRING 0 // no std::string support by default
+#endif
+/*! \def RAPIDJSON_HAS_STDSTRING
+    \ingroup RAPIDJSON_CONFIG
+    \brief Enable RapidJSON support for \c std::string
+
+    By defining this preprocessor symbol to \c 1, several convenience functions for using
+    \ref rapidjson::GenericValue with \c std::string are enabled, especially
+    for construction and comparison.
+
+    \hideinitializer
+*/
+#endif // !defined(RAPIDJSON_HAS_STDSTRING)
+
+#if RAPIDJSON_HAS_STDSTRING
+#include <string>
+#endif // RAPIDJSON_HAS_STDSTRING
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_USE_MEMBERSMAP
+
+/*! \def RAPIDJSON_USE_MEMBERSMAP
+    \ingroup RAPIDJSON_CONFIG
+    \brief Enable RapidJSON support for object members handling in a \c std::multimap
+
+    By defining this preprocessor symbol to \c 1, \ref rapidjson::GenericValue object
+    members are stored in a \c std::multimap for faster lookup and deletion times, a
+    trade off with a slightly slower insertion time and a small object allocat(or)ed
+    memory overhead.
+
+    \hideinitializer
+*/
+#ifndef RAPIDJSON_USE_MEMBERSMAP
+#define RAPIDJSON_USE_MEMBERSMAP 0 // not by default
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_NO_INT64DEFINE
+
+/*! \def RAPIDJSON_NO_INT64DEFINE
+    \ingroup RAPIDJSON_CONFIG
+    \brief Use external 64-bit integer types.
+
+    RapidJSON requires the 64-bit integer types \c int64_t and  \c uint64_t types
+    to be available at global scope.
+
+    If users have their own definition, define RAPIDJSON_NO_INT64DEFINE to
+    prevent RapidJSON from defining its own types.
+*/
+#ifndef RAPIDJSON_NO_INT64DEFINE
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+#if defined(_MSC_VER) && (_MSC_VER < 1800)	// Visual Studio 2013
+#include "msinttypes/stdint.h"
+#include "msinttypes/inttypes.h"
+#else
+// Other compilers should have this.
+#include <stdint.h>
+#include <inttypes.h>
+#endif
+//!@endcond
+#ifdef RAPIDJSON_DOXYGEN_RUNNING
+#define RAPIDJSON_NO_INT64DEFINE
+#endif
+#endif // RAPIDJSON_NO_INT64TYPEDEF
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_FORCEINLINE
+
+#ifndef RAPIDJSON_FORCEINLINE
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+#if defined(_MSC_VER) && defined(NDEBUG)
+#define RAPIDJSON_FORCEINLINE __forceinline
+#elif defined(__GNUC__) && __GNUC__ >= 4 && defined(NDEBUG)
+#define RAPIDJSON_FORCEINLINE __attribute__((always_inline))
+#else
+#define RAPIDJSON_FORCEINLINE
+#endif
+//!@endcond
+#endif // RAPIDJSON_FORCEINLINE
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_ENDIAN
+#define RAPIDJSON_LITTLEENDIAN  0   //!< Little endian machine
+#define RAPIDJSON_BIGENDIAN     1   //!< Big endian machine
+
+//! Endianness of the machine.
+/*!
+    \def RAPIDJSON_ENDIAN
+    \ingroup RAPIDJSON_CONFIG
+
+    GCC 4.6 provided macro for detecting endianness of the target machine. But other
+    compilers may not have this. User can define RAPIDJSON_ENDIAN to either
+    \ref RAPIDJSON_LITTLEENDIAN or \ref RAPIDJSON_BIGENDIAN.
+
+    Default detection implemented with reference to
+    \li https://gcc.gnu.org/onlinedocs/gcc-4.6.0/cpp/Common-Predefined-Macros.html
+    \li http://www.boost.org/doc/libs/1_42_0/boost/detail/endian.hpp
+*/
+#ifndef RAPIDJSON_ENDIAN
+// Detect with GCC 4.6's macro
+#  ifdef __BYTE_ORDER__
+#    if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
+#      define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
+#    elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
+#      define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
+#    else
+#      error Unknown machine endianness detected. User needs to define RAPIDJSON_ENDIAN.
+#    endif // __BYTE_ORDER__
+// Detect with GLIBC's endian.h
+#  elif defined(__GLIBC__)
+#    include <endian.h>
+#    if (__BYTE_ORDER == __LITTLE_ENDIAN)
+#      define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
+#    elif (__BYTE_ORDER == __BIG_ENDIAN)
+#      define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
+#    else
+#      error Unknown machine endianness detected. User needs to define RAPIDJSON_ENDIAN.
+#   endif // __GLIBC__
+// Detect with _LITTLE_ENDIAN and _BIG_ENDIAN macro
+#  elif defined(_LITTLE_ENDIAN) && !defined(_BIG_ENDIAN)
+#    define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
+#  elif defined(_BIG_ENDIAN) && !defined(_LITTLE_ENDIAN)
+#    define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
+// Detect with architecture macros
+#  elif defined(__sparc) || defined(__sparc__) || defined(_POWER) || defined(__powerpc__) || defined(__ppc__) || defined(__hpux) || defined(__hppa) || defined(_MIPSEB) || defined(_POWER) || defined(__s390__)
+#    define RAPIDJSON_ENDIAN RAPIDJSON_BIGENDIAN
+#  elif defined(__i386__) || defined(__alpha__) || defined(__ia64) || defined(__ia64__) || defined(_M_IX86) || defined(_M_IA64) || defined(_M_ALPHA) || defined(__amd64) || defined(__amd64__) || defined(_M_AMD64) || defined(__x86_64) || defined(__x86_64__) || defined(_M_X64) || defined(__bfin__)
+#    define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
+#  elif defined(_MSC_VER) && (defined(_M_ARM) || defined(_M_ARM64))
+#    define RAPIDJSON_ENDIAN RAPIDJSON_LITTLEENDIAN
+#  elif defined(RAPIDJSON_DOXYGEN_RUNNING)
+#    define RAPIDJSON_ENDIAN
+#  else
+#    error Unknown machine endianness detected. User needs to define RAPIDJSON_ENDIAN.   
+#  endif
+#endif // RAPIDJSON_ENDIAN
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_64BIT
+
+//! Whether using 64-bit architecture
+#ifndef RAPIDJSON_64BIT
+#if defined(__LP64__) || (defined(__x86_64__) && defined(__ILP32__)) || defined(_WIN64) || defined(__EMSCRIPTEN__)
+#define RAPIDJSON_64BIT 1
+#else
+#define RAPIDJSON_64BIT 0
+#endif
+#endif // RAPIDJSON_64BIT
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_ALIGN
+
+//! Data alignment of the machine.
+/*! \ingroup RAPIDJSON_CONFIG
+    \param x pointer to align
+
+    Some machines require strict data alignment. The default is 8 bytes.
+    User can customize by defining the RAPIDJSON_ALIGN function macro.
+*/
+#ifndef RAPIDJSON_ALIGN
+#define RAPIDJSON_ALIGN(x) (((x) + static_cast<size_t>(7u)) & ~static_cast<size_t>(7u))
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_UINT64_C2
+
+//! Construct a 64-bit literal by a pair of 32-bit integer.
+/*!
+    64-bit literal with or without ULL suffix is prone to compiler warnings.
+    UINT64_C() is C macro which cause compilation problems.
+    Use this macro to define 64-bit constants by a pair of 32-bit integer.
+*/
+#ifndef RAPIDJSON_UINT64_C2
+#define RAPIDJSON_UINT64_C2(high32, low32) ((static_cast<uint64_t>(high32) << 32) | static_cast<uint64_t>(low32))
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_48BITPOINTER_OPTIMIZATION
+
+//! Use only lower 48-bit address for some pointers.
+/*!
+    \ingroup RAPIDJSON_CONFIG
+
+    This optimization uses the fact that current X86-64 architecture only implement lower 48-bit virtual address.
+    The higher 16-bit can be used for storing other data.
+    \c GenericValue uses this optimization to reduce its size form 24 bytes to 16 bytes in 64-bit architecture.
+*/
+#ifndef RAPIDJSON_48BITPOINTER_OPTIMIZATION
+#if defined(__amd64__) || defined(__amd64) || defined(__x86_64__) || defined(__x86_64) || defined(_M_X64) || defined(_M_AMD64)
+#define RAPIDJSON_48BITPOINTER_OPTIMIZATION 1
+#else
+#define RAPIDJSON_48BITPOINTER_OPTIMIZATION 0
+#endif
+#endif // RAPIDJSON_48BITPOINTER_OPTIMIZATION
+
+#if RAPIDJSON_48BITPOINTER_OPTIMIZATION == 1
+#if RAPIDJSON_64BIT != 1
+#error RAPIDJSON_48BITPOINTER_OPTIMIZATION can only be set to 1 when RAPIDJSON_64BIT=1
+#endif
+#define RAPIDJSON_SETPOINTER(type, p, x) (p = reinterpret_cast<type *>((reinterpret_cast<uintptr_t>(p) & static_cast<uintptr_t>(RAPIDJSON_UINT64_C2(0xFFFF0000, 0x00000000))) | reinterpret_cast<uintptr_t>(reinterpret_cast<const void*>(x))))
+#define RAPIDJSON_GETPOINTER(type, p) (reinterpret_cast<type *>(reinterpret_cast<uintptr_t>(p) & static_cast<uintptr_t>(RAPIDJSON_UINT64_C2(0x0000FFFF, 0xFFFFFFFF))))
+#else
+#define RAPIDJSON_SETPOINTER(type, p, x) (p = (x))
+#define RAPIDJSON_GETPOINTER(type, p) (p)
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_SSE2/RAPIDJSON_SSE42/RAPIDJSON_NEON/RAPIDJSON_SIMD
+
+/*! \def RAPIDJSON_SIMD
+    \ingroup RAPIDJSON_CONFIG
+    \brief Enable SSE2/SSE4.2/Neon optimization.
+
+    RapidJSON supports optimized implementations for some parsing operations
+    based on the SSE2, SSE4.2 or NEon SIMD extensions on modern Intel
+    or ARM compatible processors.
+
+    To enable these optimizations, three different symbols can be defined;
+    \code
+    // Enable SSE2 optimization.
+    #define RAPIDJSON_SSE2
+
+    // Enable SSE4.2 optimization.
+    #define RAPIDJSON_SSE42
+    \endcode
+
+    // Enable ARM Neon optimization.
+    #define RAPIDJSON_NEON
+    \endcode
+
+    \c RAPIDJSON_SSE42 takes precedence over SSE2, if both are defined.
+
+    If any of these symbols is defined, RapidJSON defines the macro
+    \c RAPIDJSON_SIMD to indicate the availability of the optimized code.
+*/
+#if defined(RAPIDJSON_SSE2) || defined(RAPIDJSON_SSE42) \
+    || defined(RAPIDJSON_NEON) || defined(RAPIDJSON_DOXYGEN_RUNNING)
+#define RAPIDJSON_SIMD
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_NO_SIZETYPEDEFINE
+
+#ifndef RAPIDJSON_NO_SIZETYPEDEFINE
+/*! \def RAPIDJSON_NO_SIZETYPEDEFINE
+    \ingroup RAPIDJSON_CONFIG
+    \brief User-provided \c SizeType definition.
+
+    In order to avoid using 32-bit size types for indexing strings and arrays,
+    define this preprocessor symbol and provide the type rapidjson::SizeType
+    before including RapidJSON:
+    \code
+    #define RAPIDJSON_NO_SIZETYPEDEFINE
+    namespace rapidjson { typedef ::std::size_t SizeType; }
+    #include "rapidjson/..."
+    \endcode
+
+    \see rapidjson::SizeType
+*/
+#ifdef RAPIDJSON_DOXYGEN_RUNNING
+#define RAPIDJSON_NO_SIZETYPEDEFINE
+#endif
+RAPIDJSON_NAMESPACE_BEGIN
+//! Size type (for string lengths, array sizes, etc.)
+/*! RapidJSON uses 32-bit array/string indices even on 64-bit platforms,
+    instead of using \c size_t. Users may override the SizeType by defining
+    \ref RAPIDJSON_NO_SIZETYPEDEFINE.
+*/
+typedef unsigned SizeType;
+RAPIDJSON_NAMESPACE_END
+#endif
+
+// always import std::size_t to rapidjson namespace
+RAPIDJSON_NAMESPACE_BEGIN
+using std::size_t;
+RAPIDJSON_NAMESPACE_END
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_ASSERT
+
+//! Assertion.
+/*! \ingroup RAPIDJSON_CONFIG
+    By default, rapidjson uses C \c assert() for internal assertions.
+    User can override it by defining RAPIDJSON_ASSERT(x) macro.
+
+    \note Parsing errors are handled and can be customized by the
+          \ref RAPIDJSON_ERRORS APIs.
+*/
+#ifndef RAPIDJSON_ASSERT
+#include <cassert>
+#define RAPIDJSON_ASSERT(x) assert(x)
+#endif // RAPIDJSON_ASSERT
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_STATIC_ASSERT
+
+// Prefer C++11 static_assert, if available
+#ifndef RAPIDJSON_STATIC_ASSERT
+#if RAPIDJSON_CPLUSPLUS >= 201103L || ( defined(_MSC_VER) && _MSC_VER >= 1800 )
+#define RAPIDJSON_STATIC_ASSERT(x) \
+   static_assert(x, RAPIDJSON_STRINGIFY(x))
+#endif // C++11
+#endif // RAPIDJSON_STATIC_ASSERT
+
+// Adopt C++03 implementation from boost
+#ifndef RAPIDJSON_STATIC_ASSERT
+#ifndef __clang__
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+#endif
+RAPIDJSON_NAMESPACE_BEGIN
+template <bool x> struct STATIC_ASSERTION_FAILURE;
+template <> struct STATIC_ASSERTION_FAILURE<true> { enum { value = 1 }; };
+template <size_t x> struct StaticAssertTest {};
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__GNUC__) || defined(__clang__)
+#define RAPIDJSON_STATIC_ASSERT_UNUSED_ATTRIBUTE __attribute__((unused))
+#else
+#define RAPIDJSON_STATIC_ASSERT_UNUSED_ATTRIBUTE 
+#endif
+#ifndef __clang__
+//!@endcond
+#endif
+
+/*! \def RAPIDJSON_STATIC_ASSERT
+    \brief (Internal) macro to check for conditions at compile-time
+    \param x compile-time condition
+    \hideinitializer
+ */
+#define RAPIDJSON_STATIC_ASSERT(x) \
+    typedef ::RAPIDJSON_NAMESPACE::StaticAssertTest< \
+      sizeof(::RAPIDJSON_NAMESPACE::STATIC_ASSERTION_FAILURE<bool(x) >)> \
+    RAPIDJSON_JOIN(StaticAssertTypedef, __LINE__) RAPIDJSON_STATIC_ASSERT_UNUSED_ATTRIBUTE
+#endif // RAPIDJSON_STATIC_ASSERT
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_LIKELY, RAPIDJSON_UNLIKELY
+
+//! Compiler branching hint for expression with high probability to be true.
+/*!
+    \ingroup RAPIDJSON_CONFIG
+    \param x Boolean expression likely to be true.
+*/
+#ifndef RAPIDJSON_LIKELY
+#if defined(__GNUC__) || defined(__clang__)
+#define RAPIDJSON_LIKELY(x) __builtin_expect(!!(x), 1)
+#else
+#define RAPIDJSON_LIKELY(x) (x)
+#endif
+#endif
+
+//! Compiler branching hint for expression with low probability to be true.
+/*!
+    \ingroup RAPIDJSON_CONFIG
+    \param x Boolean expression unlikely to be true.
+*/
+#ifndef RAPIDJSON_UNLIKELY
+#if defined(__GNUC__) || defined(__clang__)
+#define RAPIDJSON_UNLIKELY(x) __builtin_expect(!!(x), 0)
+#else
+#define RAPIDJSON_UNLIKELY(x) (x)
+#endif
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// Helpers
+
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+
+#define RAPIDJSON_MULTILINEMACRO_BEGIN do {  
+#define RAPIDJSON_MULTILINEMACRO_END \
+} while((void)0, 0)
+
+// adopted from Boost
+#define RAPIDJSON_VERSION_CODE(x,y,z) \
+  (((x)*100000) + ((y)*100) + (z))
+
+#if defined(__has_builtin)
+#define RAPIDJSON_HAS_BUILTIN(x) __has_builtin(x)
+#else
+#define RAPIDJSON_HAS_BUILTIN(x) 0
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_DIAG_PUSH/POP, RAPIDJSON_DIAG_OFF
+
+#if defined(__GNUC__)
+#define RAPIDJSON_GNUC \
+    RAPIDJSON_VERSION_CODE(__GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__)
+#endif
+
+#if defined(__clang__) || (defined(RAPIDJSON_GNUC) && RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,2,0))
+
+#define RAPIDJSON_PRAGMA(x) _Pragma(RAPIDJSON_STRINGIFY(x))
+#define RAPIDJSON_DIAG_PRAGMA(x) RAPIDJSON_PRAGMA(GCC diagnostic x)
+#define RAPIDJSON_DIAG_OFF(x) \
+    RAPIDJSON_DIAG_PRAGMA(ignored RAPIDJSON_STRINGIFY(RAPIDJSON_JOIN(-W,x)))
+
+// push/pop support in Clang and GCC>=4.6
+#if defined(__clang__) || (defined(RAPIDJSON_GNUC) && RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,6,0))
+#define RAPIDJSON_DIAG_PUSH RAPIDJSON_DIAG_PRAGMA(push)
+#define RAPIDJSON_DIAG_POP  RAPIDJSON_DIAG_PRAGMA(pop)
+#else // GCC >= 4.2, < 4.6
+#define RAPIDJSON_DIAG_PUSH /* ignored */
+#define RAPIDJSON_DIAG_POP /* ignored */
+#endif
+
+#elif defined(_MSC_VER)
+
+// pragma (MSVC specific)
+#define RAPIDJSON_PRAGMA(x) __pragma(x)
+#define RAPIDJSON_DIAG_PRAGMA(x) RAPIDJSON_PRAGMA(warning(x))
+
+#define RAPIDJSON_DIAG_OFF(x) RAPIDJSON_DIAG_PRAGMA(disable: x)
+#define RAPIDJSON_DIAG_PUSH RAPIDJSON_DIAG_PRAGMA(push)
+#define RAPIDJSON_DIAG_POP  RAPIDJSON_DIAG_PRAGMA(pop)
+
+#else
+
+#define RAPIDJSON_DIAG_OFF(x) /* ignored */
+#define RAPIDJSON_DIAG_PUSH   /* ignored */
+#define RAPIDJSON_DIAG_POP    /* ignored */
+
+#endif // RAPIDJSON_DIAG_*
+
+///////////////////////////////////////////////////////////////////////////////
+// C++11 features
+
+#ifndef RAPIDJSON_HAS_CXX11
+#define RAPIDJSON_HAS_CXX11 (RAPIDJSON_CPLUSPLUS >= 201103L)
+#endif
+
+#ifndef RAPIDJSON_HAS_CXX11_RVALUE_REFS
+#if RAPIDJSON_HAS_CXX11
+#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 1
+#elif defined(__clang__)
+#if __has_feature(cxx_rvalue_references) && \
+    (defined(_MSC_VER) || defined(_LIBCPP_VERSION) || defined(__GLIBCXX__) && __GLIBCXX__ >= 20080306)
+#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 1
+#else
+#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 0
+#endif
+#elif (defined(RAPIDJSON_GNUC) && (RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,3,0)) && defined(__GXX_EXPERIMENTAL_CXX0X__)) || \
+      (defined(_MSC_VER) && _MSC_VER >= 1600) || \
+      (defined(__SUNPRO_CC) && __SUNPRO_CC >= 0x5140 && defined(__GXX_EXPERIMENTAL_CXX0X__))
+
+#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 1
+#else
+#define RAPIDJSON_HAS_CXX11_RVALUE_REFS 0
+#endif
+#endif // RAPIDJSON_HAS_CXX11_RVALUE_REFS
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+#include <utility> // std::move
+#endif
+
+#ifndef RAPIDJSON_HAS_CXX11_NOEXCEPT
+#if RAPIDJSON_HAS_CXX11
+#define RAPIDJSON_HAS_CXX11_NOEXCEPT 1
+#elif defined(__clang__)
+#define RAPIDJSON_HAS_CXX11_NOEXCEPT __has_feature(cxx_noexcept)
+#elif (defined(RAPIDJSON_GNUC) && (RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,6,0)) && defined(__GXX_EXPERIMENTAL_CXX0X__)) || \
+    (defined(_MSC_VER) && _MSC_VER >= 1900) || \
+    (defined(__SUNPRO_CC) && __SUNPRO_CC >= 0x5140 && defined(__GXX_EXPERIMENTAL_CXX0X__))
+#define RAPIDJSON_HAS_CXX11_NOEXCEPT 1
+#else
+#define RAPIDJSON_HAS_CXX11_NOEXCEPT 0
+#endif
+#endif
+#ifndef RAPIDJSON_NOEXCEPT
+#if RAPIDJSON_HAS_CXX11_NOEXCEPT
+#define RAPIDJSON_NOEXCEPT noexcept
+#else
+#define RAPIDJSON_NOEXCEPT throw()
+#endif // RAPIDJSON_HAS_CXX11_NOEXCEPT
+#endif
+
+// no automatic detection, yet
+#ifndef RAPIDJSON_HAS_CXX11_TYPETRAITS
+#if (defined(_MSC_VER) && _MSC_VER >= 1700)
+#define RAPIDJSON_HAS_CXX11_TYPETRAITS 1
+#else
+#define RAPIDJSON_HAS_CXX11_TYPETRAITS 0
+#endif
+#endif
+
+#ifndef RAPIDJSON_HAS_CXX11_RANGE_FOR
+#if defined(__clang__)
+#define RAPIDJSON_HAS_CXX11_RANGE_FOR __has_feature(cxx_range_for)
+#elif (defined(RAPIDJSON_GNUC) && (RAPIDJSON_GNUC >= RAPIDJSON_VERSION_CODE(4,6,0)) && defined(__GXX_EXPERIMENTAL_CXX0X__)) || \
+      (defined(_MSC_VER) && _MSC_VER >= 1700) || \
+      (defined(__SUNPRO_CC) && __SUNPRO_CC >= 0x5140 && defined(__GXX_EXPERIMENTAL_CXX0X__))
+#define RAPIDJSON_HAS_CXX11_RANGE_FOR 1
+#else
+#define RAPIDJSON_HAS_CXX11_RANGE_FOR 0
+#endif
+#endif // RAPIDJSON_HAS_CXX11_RANGE_FOR
+
+///////////////////////////////////////////////////////////////////////////////
+// C++17 features
+
+#ifndef RAPIDJSON_HAS_CXX17
+#define RAPIDJSON_HAS_CXX17 (RAPIDJSON_CPLUSPLUS >= 201703L)
+#endif
+
+#if RAPIDJSON_HAS_CXX17
+# define RAPIDJSON_DELIBERATE_FALLTHROUGH [[fallthrough]]
+#elif defined(__has_cpp_attribute)
+# if __has_cpp_attribute(clang::fallthrough)
+#  define RAPIDJSON_DELIBERATE_FALLTHROUGH [[clang::fallthrough]]
+# elif __has_cpp_attribute(fallthrough)
+#  define RAPIDJSON_DELIBERATE_FALLTHROUGH __attribute__((fallthrough))
+# else
+#  define RAPIDJSON_DELIBERATE_FALLTHROUGH
+# endif
+#else
+# define RAPIDJSON_DELIBERATE_FALLTHROUGH
+#endif
+
+//!@endcond
+
+//! Assertion (in non-throwing contexts).
+ /*! \ingroup RAPIDJSON_CONFIG
+    Some functions provide a \c noexcept guarantee, if the compiler supports it.
+    In these cases, the \ref RAPIDJSON_ASSERT macro cannot be overridden to
+    throw an exception.  This macro adds a separate customization point for
+    such cases.
+
+    Defaults to C \c assert() (as \ref RAPIDJSON_ASSERT), if \c noexcept is
+    supported, and to \ref RAPIDJSON_ASSERT otherwise.
+ */
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_NOEXCEPT_ASSERT
+
+#ifndef RAPIDJSON_NOEXCEPT_ASSERT
+#ifdef RAPIDJSON_ASSERT_THROWS
+#include <cassert>
+#define RAPIDJSON_NOEXCEPT_ASSERT(x) assert(x)
+#else
+#define RAPIDJSON_NOEXCEPT_ASSERT(x) RAPIDJSON_ASSERT(x)
+#endif // RAPIDJSON_ASSERT_THROWS
+#endif // RAPIDJSON_NOEXCEPT_ASSERT
+
+///////////////////////////////////////////////////////////////////////////////
+// malloc/realloc/free
+
+#ifndef RAPIDJSON_MALLOC
+///! customization point for global \c malloc
+#define RAPIDJSON_MALLOC(size) std::malloc(size)
+#endif
+#ifndef RAPIDJSON_REALLOC
+///! customization point for global \c realloc
+#define RAPIDJSON_REALLOC(ptr, new_size) std::realloc(ptr, new_size)
+#endif
+#ifndef RAPIDJSON_FREE
+///! customization point for global \c free
+#define RAPIDJSON_FREE(ptr) std::free(ptr)
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// new/delete
+
+#ifndef RAPIDJSON_NEW
+///! customization point for global \c new
+#define RAPIDJSON_NEW(TypeName) new TypeName
+#endif
+#ifndef RAPIDJSON_DELETE
+///! customization point for global \c delete
+#define RAPIDJSON_DELETE(x) delete x
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// Type
+
+/*! \namespace rapidjson
+    \brief main RapidJSON namespace
+    \see RAPIDJSON_NAMESPACE
+*/
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Type of JSON value
+enum Type {
+    kNullType = 0,      //!< null
+    kFalseType = 1,     //!< false
+    kTrueType = 2,      //!< true
+    kObjectType = 3,    //!< object
+    kArrayType = 4,     //!< array 
+    kStringType = 5,    //!< string
+    kNumberType = 6     //!< number
+};
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_RAPIDJSON_H_
diff --git a/General/General/include/rapidjson/reader.h b/General/General/include/rapidjson/reader.h
new file mode 100644
index 0000000..5554660
--- /dev/null
+++ b/General/General/include/rapidjson/reader.h
@@ -0,0 +1,2246 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_READER_H_
+#define RAPIDJSON_READER_H_
+
+/*! \file reader.h */
+
+#include "allocators.h"
+#include "stream.h"
+#include "encodedstream.h"
+#include "internal/clzll.h"
+#include "internal/meta.h"
+#include "internal/stack.h"
+#include "internal/strtod.h"
+#include <limits>
+
+#if defined(RAPIDJSON_SIMD) && defined(_MSC_VER)
+#include <intrin.h>
+#pragma intrinsic(_BitScanForward)
+#endif
+#ifdef RAPIDJSON_SSE42
+#include <nmmintrin.h>
+#elif defined(RAPIDJSON_SSE2)
+#include <emmintrin.h>
+#elif defined(RAPIDJSON_NEON)
+#include <arm_neon.h>
+#endif
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(old-style-cast)
+RAPIDJSON_DIAG_OFF(padded)
+RAPIDJSON_DIAG_OFF(switch-enum)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4127)  // conditional expression is constant
+RAPIDJSON_DIAG_OFF(4702)  // unreachable code
+#endif
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+#define RAPIDJSON_NOTHING /* deliberately empty */
+#ifndef RAPIDJSON_PARSE_ERROR_EARLY_RETURN
+#define RAPIDJSON_PARSE_ERROR_EARLY_RETURN(value) \
+    RAPIDJSON_MULTILINEMACRO_BEGIN \
+    if (RAPIDJSON_UNLIKELY(HasParseError())) { return value; } \
+    RAPIDJSON_MULTILINEMACRO_END
+#endif
+#define RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID \
+    RAPIDJSON_PARSE_ERROR_EARLY_RETURN(RAPIDJSON_NOTHING)
+//!@endcond
+
+/*! \def RAPIDJSON_PARSE_ERROR_NORETURN
+    \ingroup RAPIDJSON_ERRORS
+    \brief Macro to indicate a parse error.
+    \param parseErrorCode \ref rapidjson::ParseErrorCode of the error
+    \param offset  position of the error in JSON input (\c size_t)
+
+    This macros can be used as a customization point for the internal
+    error handling mechanism of RapidJSON.
+
+    A common usage model is to throw an exception instead of requiring the
+    caller to explicitly check the \ref rapidjson::GenericReader::Parse's
+    return value:
+
+    \code
+    #define RAPIDJSON_PARSE_ERROR_NORETURN(parseErrorCode,offset) \
+       throw ParseException(parseErrorCode, #parseErrorCode, offset)
+
+    #include <stdexcept>               // std::runtime_error
+    #include "rapidjson/error/error.h" // rapidjson::ParseResult
+
+    struct ParseException : std::runtime_error, rapidjson::ParseResult {
+      ParseException(rapidjson::ParseErrorCode code, const char* msg, size_t offset)
+        : std::runtime_error(msg), ParseResult(code, offset) {}
+    };
+
+    #include "rapidjson/reader.h"
+    \endcode
+
+    \see RAPIDJSON_PARSE_ERROR, rapidjson::GenericReader::Parse
+ */
+#ifndef RAPIDJSON_PARSE_ERROR_NORETURN
+#define RAPIDJSON_PARSE_ERROR_NORETURN(parseErrorCode, offset) \
+    RAPIDJSON_MULTILINEMACRO_BEGIN \
+    RAPIDJSON_ASSERT(!HasParseError()); /* Error can only be assigned once */ \
+    SetParseError(parseErrorCode, offset); \
+    RAPIDJSON_MULTILINEMACRO_END
+#endif
+
+/*! \def RAPIDJSON_PARSE_ERROR
+    \ingroup RAPIDJSON_ERRORS
+    \brief (Internal) macro to indicate and handle a parse error.
+    \param parseErrorCode \ref rapidjson::ParseErrorCode of the error
+    \param offset  position of the error in JSON input (\c size_t)
+
+    Invokes RAPIDJSON_PARSE_ERROR_NORETURN and stops the parsing.
+
+    \see RAPIDJSON_PARSE_ERROR_NORETURN
+    \hideinitializer
+ */
+#ifndef RAPIDJSON_PARSE_ERROR
+#define RAPIDJSON_PARSE_ERROR(parseErrorCode, offset) \
+    RAPIDJSON_MULTILINEMACRO_BEGIN \
+    RAPIDJSON_PARSE_ERROR_NORETURN(parseErrorCode, offset); \
+    RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID; \
+    RAPIDJSON_MULTILINEMACRO_END
+#endif
+
+#include "error/error.h" // ParseErrorCode, ParseResult
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// ParseFlag
+
+/*! \def RAPIDJSON_PARSE_DEFAULT_FLAGS
+    \ingroup RAPIDJSON_CONFIG
+    \brief User-defined kParseDefaultFlags definition.
+
+    User can define this as any \c ParseFlag combinations.
+*/
+#ifndef RAPIDJSON_PARSE_DEFAULT_FLAGS
+#define RAPIDJSON_PARSE_DEFAULT_FLAGS kParseNoFlags
+#endif
+
+//! Combination of parseFlags
+/*! \see Reader::Parse, Document::Parse, Document::ParseInsitu, Document::ParseStream
+ */
+enum ParseFlag {
+    kParseNoFlags = 0,              //!< No flags are set.
+    kParseInsituFlag = 1,           //!< In-situ(destructive) parsing.
+    kParseValidateEncodingFlag = 2, //!< Validate encoding of JSON strings.
+    kParseIterativeFlag = 4,        //!< Iterative(constant complexity in terms of function call stack size) parsing.
+    kParseStopWhenDoneFlag = 8,     //!< After parsing a complete JSON root from stream, stop further processing the rest of stream. When this flag is used, parser will not generate kParseErrorDocumentRootNotSingular error.
+    kParseFullPrecisionFlag = 16,   //!< Parse number in full precision (but slower).
+    kParseCommentsFlag = 32,        //!< Allow one-line (//) and multi-line (/**/) comments.
+    kParseNumbersAsStringsFlag = 64,    //!< Parse all numbers (ints/doubles) as strings.
+    kParseTrailingCommasFlag = 128, //!< Allow trailing commas at the end of objects and arrays.
+    kParseNanAndInfFlag = 256,      //!< Allow parsing NaN, Inf, Infinity, -Inf and -Infinity as doubles.
+    kParseEscapedApostropheFlag = 512,  //!< Allow escaped apostrophe in strings.
+    kParseDefaultFlags = RAPIDJSON_PARSE_DEFAULT_FLAGS  //!< Default parse flags. Can be customized by defining RAPIDJSON_PARSE_DEFAULT_FLAGS
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// Handler
+
+/*! \class rapidjson::Handler
+    \brief Concept for receiving events from GenericReader upon parsing.
+    The functions return true if no error occurs. If they return false,
+    the event publisher should terminate the process.
+\code
+concept Handler {
+    typename Ch;
+
+    bool Null();
+    bool Bool(bool b);
+    bool Int(int i);
+    bool Uint(unsigned i);
+    bool Int64(int64_t i);
+    bool Uint64(uint64_t i);
+    bool Double(double d);
+    /// enabled via kParseNumbersAsStringsFlag, string is not null-terminated (use length)
+    bool RawNumber(const Ch* str, SizeType length, bool copy);
+    bool String(const Ch* str, SizeType length, bool copy);
+    bool StartObject();
+    bool Key(const Ch* str, SizeType length, bool copy);
+    bool EndObject(SizeType memberCount);
+    bool StartArray();
+    bool EndArray(SizeType elementCount);
+};
+\endcode
+*/
+///////////////////////////////////////////////////////////////////////////////
+// BaseReaderHandler
+
+//! Default implementation of Handler.
+/*! This can be used as base class of any reader handler.
+    \note implements Handler concept
+*/
+template<typename Encoding = UTF8<>, typename Derived = void>
+struct BaseReaderHandler {
+    typedef typename Encoding::Ch Ch;
+
+    typedef typename internal::SelectIf<internal::IsSame<Derived, void>, BaseReaderHandler, Derived>::Type Override;
+
+    bool Default() { return true; }
+    bool Null() { return static_cast<Override&>(*this).Default(); }
+    bool Bool(bool) { return static_cast<Override&>(*this).Default(); }
+    bool Int(int) { return static_cast<Override&>(*this).Default(); }
+    bool Uint(unsigned) { return static_cast<Override&>(*this).Default(); }
+    bool Int64(int64_t) { return static_cast<Override&>(*this).Default(); }
+    bool Uint64(uint64_t) { return static_cast<Override&>(*this).Default(); }
+    bool Double(double) { return static_cast<Override&>(*this).Default(); }
+    /// enabled via kParseNumbersAsStringsFlag, string is not null-terminated (use length)
+    bool RawNumber(const Ch* str, SizeType len, bool copy) { return static_cast<Override&>(*this).String(str, len, copy); }
+    bool String(const Ch*, SizeType, bool) { return static_cast<Override&>(*this).Default(); }
+    bool StartObject() { return static_cast<Override&>(*this).Default(); }
+    bool Key(const Ch* str, SizeType len, bool copy) { return static_cast<Override&>(*this).String(str, len, copy); }
+    bool EndObject(SizeType) { return static_cast<Override&>(*this).Default(); }
+    bool StartArray() { return static_cast<Override&>(*this).Default(); }
+    bool EndArray(SizeType) { return static_cast<Override&>(*this).Default(); }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// StreamLocalCopy
+
+namespace internal {
+
+template<typename Stream, int = StreamTraits<Stream>::copyOptimization>
+class StreamLocalCopy;
+
+//! Do copy optimization.
+template<typename Stream>
+class StreamLocalCopy<Stream, 1> {
+public:
+    StreamLocalCopy(Stream& original) : s(original), original_(original) {}
+    ~StreamLocalCopy() { original_ = s; }
+
+    Stream s;
+
+private:
+    StreamLocalCopy& operator=(const StreamLocalCopy&) /* = delete */;
+
+    Stream& original_;
+};
+
+//! Keep reference.
+template<typename Stream>
+class StreamLocalCopy<Stream, 0> {
+public:
+    StreamLocalCopy(Stream& original) : s(original) {}
+
+    Stream& s;
+
+private:
+    StreamLocalCopy& operator=(const StreamLocalCopy&) /* = delete */;
+};
+
+} // namespace internal
+
+///////////////////////////////////////////////////////////////////////////////
+// SkipWhitespace
+
+//! Skip the JSON white spaces in a stream.
+/*! \param is A input stream for skipping white spaces.
+    \note This function has SSE2/SSE4.2 specialization.
+*/
+template<typename InputStream>
+void SkipWhitespace(InputStream& is) {
+    internal::StreamLocalCopy<InputStream> copy(is);
+    InputStream& s(copy.s);
+
+    typename InputStream::Ch c;
+    while ((c = s.Peek()) == ' ' || c == '\n' || c == '\r' || c == '\t')
+        s.Take();
+}
+
+inline const char* SkipWhitespace(const char* p, const char* end) {
+    while (p != end && (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t'))
+        ++p;
+    return p;
+}
+
+#ifdef RAPIDJSON_SSE42
+//! Skip whitespace with SSE 4.2 pcmpistrm instruction, testing 16 8-byte characters at once.
+inline const char *SkipWhitespace_SIMD(const char* p) {
+    // Fast return for single non-whitespace
+    if (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t')
+        ++p;
+    else
+        return p;
+
+    // 16-byte align to the next boundary
+    const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+    while (p != nextAligned)
+        if (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t')
+            ++p;
+        else
+            return p;
+
+    // The rest of string using SIMD
+    static const char whitespace[16] = " \n\r\t";
+    const __m128i w = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespace[0]));
+
+    for (;; p += 16) {
+        const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
+        const int r = _mm_cmpistri(w, s, _SIDD_UBYTE_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_LEAST_SIGNIFICANT | _SIDD_NEGATIVE_POLARITY);
+        if (r != 16)    // some of characters is non-whitespace
+            return p + r;
+    }
+}
+
+inline const char *SkipWhitespace_SIMD(const char* p, const char* end) {
+    // Fast return for single non-whitespace
+    if (p != end && (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t'))
+        ++p;
+    else
+        return p;
+
+    // The middle of string using SIMD
+    static const char whitespace[16] = " \n\r\t";
+    const __m128i w = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespace[0]));
+
+    for (; p <= end - 16; p += 16) {
+        const __m128i s = _mm_loadu_si128(reinterpret_cast<const __m128i *>(p));
+        const int r = _mm_cmpistri(w, s, _SIDD_UBYTE_OPS | _SIDD_CMP_EQUAL_ANY | _SIDD_LEAST_SIGNIFICANT | _SIDD_NEGATIVE_POLARITY);
+        if (r != 16)    // some of characters is non-whitespace
+            return p + r;
+    }
+
+    return SkipWhitespace(p, end);
+}
+
+#elif defined(RAPIDJSON_SSE2)
+
+//! Skip whitespace with SSE2 instructions, testing 16 8-byte characters at once.
+inline const char *SkipWhitespace_SIMD(const char* p) {
+    // Fast return for single non-whitespace
+    if (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t')
+        ++p;
+    else
+        return p;
+
+    // 16-byte align to the next boundary
+    const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+    while (p != nextAligned)
+        if (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t')
+            ++p;
+        else
+            return p;
+
+    // The rest of string
+    #define C16(c) { c, c, c, c, c, c, c, c, c, c, c, c, c, c, c, c }
+    static const char whitespaces[4][16] = { C16(' '), C16('\n'), C16('\r'), C16('\t') };
+    #undef C16
+
+    const __m128i w0 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[0][0]));
+    const __m128i w1 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[1][0]));
+    const __m128i w2 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[2][0]));
+    const __m128i w3 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[3][0]));
+
+    for (;; p += 16) {
+        const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
+        __m128i x = _mm_cmpeq_epi8(s, w0);
+        x = _mm_or_si128(x, _mm_cmpeq_epi8(s, w1));
+        x = _mm_or_si128(x, _mm_cmpeq_epi8(s, w2));
+        x = _mm_or_si128(x, _mm_cmpeq_epi8(s, w3));
+        unsigned short r = static_cast<unsigned short>(~_mm_movemask_epi8(x));
+        if (r != 0) {   // some of characters may be non-whitespace
+#ifdef _MSC_VER         // Find the index of first non-whitespace
+            unsigned long offset;
+            _BitScanForward(&offset, r);
+            return p + offset;
+#else
+            return p + __builtin_ffs(r) - 1;
+#endif
+        }
+    }
+}
+
+inline const char *SkipWhitespace_SIMD(const char* p, const char* end) {
+    // Fast return for single non-whitespace
+    if (p != end && (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t'))
+        ++p;
+    else
+        return p;
+
+    // The rest of string
+    #define C16(c) { c, c, c, c, c, c, c, c, c, c, c, c, c, c, c, c }
+    static const char whitespaces[4][16] = { C16(' '), C16('\n'), C16('\r'), C16('\t') };
+    #undef C16
+
+    const __m128i w0 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[0][0]));
+    const __m128i w1 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[1][0]));
+    const __m128i w2 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[2][0]));
+    const __m128i w3 = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&whitespaces[3][0]));
+
+    for (; p <= end - 16; p += 16) {
+        const __m128i s = _mm_loadu_si128(reinterpret_cast<const __m128i *>(p));
+        __m128i x = _mm_cmpeq_epi8(s, w0);
+        x = _mm_or_si128(x, _mm_cmpeq_epi8(s, w1));
+        x = _mm_or_si128(x, _mm_cmpeq_epi8(s, w2));
+        x = _mm_or_si128(x, _mm_cmpeq_epi8(s, w3));
+        unsigned short r = static_cast<unsigned short>(~_mm_movemask_epi8(x));
+        if (r != 0) {   // some of characters may be non-whitespace
+#ifdef _MSC_VER         // Find the index of first non-whitespace
+            unsigned long offset;
+            _BitScanForward(&offset, r);
+            return p + offset;
+#else
+            return p + __builtin_ffs(r) - 1;
+#endif
+        }
+    }
+
+    return SkipWhitespace(p, end);
+}
+
+#elif defined(RAPIDJSON_NEON)
+
+//! Skip whitespace with ARM Neon instructions, testing 16 8-byte characters at once.
+inline const char *SkipWhitespace_SIMD(const char* p) {
+    // Fast return for single non-whitespace
+    if (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t')
+        ++p;
+    else
+        return p;
+
+    // 16-byte align to the next boundary
+    const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+    while (p != nextAligned)
+        if (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t')
+            ++p;
+        else
+            return p;
+
+    const uint8x16_t w0 = vmovq_n_u8(' ');
+    const uint8x16_t w1 = vmovq_n_u8('\n');
+    const uint8x16_t w2 = vmovq_n_u8('\r');
+    const uint8x16_t w3 = vmovq_n_u8('\t');
+
+    for (;; p += 16) {
+        const uint8x16_t s = vld1q_u8(reinterpret_cast<const uint8_t *>(p));
+        uint8x16_t x = vceqq_u8(s, w0);
+        x = vorrq_u8(x, vceqq_u8(s, w1));
+        x = vorrq_u8(x, vceqq_u8(s, w2));
+        x = vorrq_u8(x, vceqq_u8(s, w3));
+
+        x = vmvnq_u8(x);                       // Negate
+        x = vrev64q_u8(x);                     // Rev in 64
+        uint64_t low = vgetq_lane_u64(vreinterpretq_u64_u8(x), 0);   // extract
+        uint64_t high = vgetq_lane_u64(vreinterpretq_u64_u8(x), 1);  // extract
+
+        if (low == 0) {
+            if (high != 0) {
+                uint32_t lz = internal::clzll(high);
+                return p + 8 + (lz >> 3);
+            }
+        } else {
+            uint32_t lz = internal::clzll(low);
+            return p + (lz >> 3);
+        }
+    }
+}
+
+inline const char *SkipWhitespace_SIMD(const char* p, const char* end) {
+    // Fast return for single non-whitespace
+    if (p != end && (*p == ' ' || *p == '\n' || *p == '\r' || *p == '\t'))
+        ++p;
+    else
+        return p;
+
+    const uint8x16_t w0 = vmovq_n_u8(' ');
+    const uint8x16_t w1 = vmovq_n_u8('\n');
+    const uint8x16_t w2 = vmovq_n_u8('\r');
+    const uint8x16_t w3 = vmovq_n_u8('\t');
+
+    for (; p <= end - 16; p += 16) {
+        const uint8x16_t s = vld1q_u8(reinterpret_cast<const uint8_t *>(p));
+        uint8x16_t x = vceqq_u8(s, w0);
+        x = vorrq_u8(x, vceqq_u8(s, w1));
+        x = vorrq_u8(x, vceqq_u8(s, w2));
+        x = vorrq_u8(x, vceqq_u8(s, w3));
+
+        x = vmvnq_u8(x);                       // Negate
+        x = vrev64q_u8(x);                     // Rev in 64
+        uint64_t low = vgetq_lane_u64(vreinterpretq_u64_u8(x), 0);   // extract
+        uint64_t high = vgetq_lane_u64(vreinterpretq_u64_u8(x), 1);  // extract
+
+        if (low == 0) {
+            if (high != 0) {
+                uint32_t lz = internal::clzll(high);
+                return p + 8 + (lz >> 3);
+            }
+        } else {
+            uint32_t lz = internal::clzll(low);
+            return p + (lz >> 3);
+        }
+    }
+
+    return SkipWhitespace(p, end);
+}
+
+#endif // RAPIDJSON_NEON
+
+#ifdef RAPIDJSON_SIMD
+//! Template function specialization for InsituStringStream
+template<> inline void SkipWhitespace(InsituStringStream& is) {
+    is.src_ = const_cast<char*>(SkipWhitespace_SIMD(is.src_));
+}
+
+//! Template function specialization for StringStream
+template<> inline void SkipWhitespace(StringStream& is) {
+    is.src_ = SkipWhitespace_SIMD(is.src_);
+}
+
+template<> inline void SkipWhitespace(EncodedInputStream<UTF8<>, MemoryStream>& is) {
+    is.is_.src_ = SkipWhitespace_SIMD(is.is_.src_, is.is_.end_);
+}
+#endif // RAPIDJSON_SIMD
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericReader
+
+//! SAX-style JSON parser. Use \ref Reader for UTF8 encoding and default allocator.
+/*! GenericReader parses JSON text from a stream, and send events synchronously to an
+    object implementing Handler concept.
+
+    It needs to allocate a stack for storing a single decoded string during
+    non-destructive parsing.
+
+    For in-situ parsing, the decoded string is directly written to the source
+    text string, no temporary buffer is required.
+
+    A GenericReader object can be reused for parsing multiple JSON text.
+
+    \tparam SourceEncoding Encoding of the input stream.
+    \tparam TargetEncoding Encoding of the parse output.
+    \tparam StackAllocator Allocator type for stack.
+*/
+template <typename SourceEncoding, typename TargetEncoding, typename StackAllocator = CrtAllocator>
+class GenericReader {
+public:
+    typedef typename SourceEncoding::Ch Ch; //!< SourceEncoding character type
+
+    //! Constructor.
+    /*! \param stackAllocator Optional allocator for allocating stack memory. (Only use for non-destructive parsing)
+        \param stackCapacity stack capacity in bytes for storing a single decoded string.  (Only use for non-destructive parsing)
+    */
+    GenericReader(StackAllocator* stackAllocator = 0, size_t stackCapacity = kDefaultStackCapacity) :
+        stack_(stackAllocator, stackCapacity), parseResult_(), state_(IterativeParsingStartState) {}
+
+    //! Parse JSON text.
+    /*! \tparam parseFlags Combination of \ref ParseFlag.
+        \tparam InputStream Type of input stream, implementing Stream concept.
+        \tparam Handler Type of handler, implementing Handler concept.
+        \param is Input stream to be parsed.
+        \param handler The handler to receive events.
+        \return Whether the parsing is successful.
+    */
+    template <unsigned parseFlags, typename InputStream, typename Handler>
+    ParseResult Parse(InputStream& is, Handler& handler) {
+        if (parseFlags & kParseIterativeFlag)
+            return IterativeParse<parseFlags>(is, handler);
+
+        parseResult_.Clear();
+
+        ClearStackOnExit scope(*this);
+
+        SkipWhitespaceAndComments<parseFlags>(is);
+        RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+
+        if (RAPIDJSON_UNLIKELY(is.Peek() == '\0')) {
+            RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorDocumentEmpty, is.Tell());
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+        }
+        else {
+            ParseValue<parseFlags>(is, handler);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+
+            if (!(parseFlags & kParseStopWhenDoneFlag)) {
+                SkipWhitespaceAndComments<parseFlags>(is);
+                RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+
+                if (RAPIDJSON_UNLIKELY(is.Peek() != '\0')) {
+                    RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorDocumentRootNotSingular, is.Tell());
+                    RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+                }
+            }
+        }
+
+        return parseResult_;
+    }
+
+    //! Parse JSON text (with \ref kParseDefaultFlags)
+    /*! \tparam InputStream Type of input stream, implementing Stream concept
+        \tparam Handler Type of handler, implementing Handler concept.
+        \param is Input stream to be parsed.
+        \param handler The handler to receive events.
+        \return Whether the parsing is successful.
+    */
+    template <typename InputStream, typename Handler>
+    ParseResult Parse(InputStream& is, Handler& handler) {
+        return Parse<kParseDefaultFlags>(is, handler);
+    }
+
+    //! Initialize JSON text token-by-token parsing
+    /*!
+     */
+    void IterativeParseInit() {
+        parseResult_.Clear();
+        state_ = IterativeParsingStartState;
+    }
+
+    //! Parse one token from JSON text
+    /*! \tparam InputStream Type of input stream, implementing Stream concept
+        \tparam Handler Type of handler, implementing Handler concept.
+        \param is Input stream to be parsed.
+        \param handler The handler to receive events.
+        \return Whether the parsing is successful.
+     */
+    template <unsigned parseFlags, typename InputStream, typename Handler>
+    bool IterativeParseNext(InputStream& is, Handler& handler) {
+        while (RAPIDJSON_LIKELY(is.Peek() != '\0')) {
+            SkipWhitespaceAndComments<parseFlags>(is);
+
+            Token t = Tokenize(is.Peek());
+            IterativeParsingState n = Predict(state_, t);
+            IterativeParsingState d = Transit<parseFlags>(state_, t, n, is, handler);
+
+            // If we've finished or hit an error...
+            if (RAPIDJSON_UNLIKELY(IsIterativeParsingCompleteState(d))) {
+                // Report errors.
+                if (d == IterativeParsingErrorState) {
+                    HandleError(state_, is);
+                    return false;
+                }
+
+                // Transition to the finish state.
+                RAPIDJSON_ASSERT(d == IterativeParsingFinishState);
+                state_ = d;
+
+                // If StopWhenDone is not set...
+                if (!(parseFlags & kParseStopWhenDoneFlag)) {
+                    // ... and extra non-whitespace data is found...
+                    SkipWhitespaceAndComments<parseFlags>(is);
+                    if (is.Peek() != '\0') {
+                        // ... this is considered an error.
+                        HandleError(state_, is);
+                        return false;
+                    }
+                }
+
+                // Success! We are done!
+                return true;
+            }
+
+            // Transition to the new state.
+            state_ = d;
+
+            // If we parsed anything other than a delimiter, we invoked the handler, so we can return true now.
+            if (!IsIterativeParsingDelimiterState(n))
+                return true;
+        }
+
+        // We reached the end of file.
+        stack_.Clear();
+
+        if (state_ != IterativeParsingFinishState) {
+            HandleError(state_, is);
+            return false;
+        }
+
+        return true;
+    }
+
+    //! Check if token-by-token parsing JSON text is complete
+    /*! \return Whether the JSON has been fully decoded.
+     */
+    RAPIDJSON_FORCEINLINE bool IterativeParseComplete() const {
+        return IsIterativeParsingCompleteState(state_);
+    }
+
+    //! Whether a parse error has occurred in the last parsing.
+    bool HasParseError() const { return parseResult_.IsError(); }
+
+    //! Get the \ref ParseErrorCode of last parsing.
+    ParseErrorCode GetParseErrorCode() const { return parseResult_.Code(); }
+
+    //! Get the position of last parsing error in input, 0 otherwise.
+    size_t GetErrorOffset() const { return parseResult_.Offset(); }
+
+protected:
+    void SetParseError(ParseErrorCode code, size_t offset) { parseResult_.Set(code, offset); }
+
+private:
+    // Prohibit copy constructor & assignment operator.
+    GenericReader(const GenericReader&);
+    GenericReader& operator=(const GenericReader&);
+
+    void ClearStack() { stack_.Clear(); }
+
+    // clear stack on any exit from ParseStream, e.g. due to exception
+    struct ClearStackOnExit {
+        explicit ClearStackOnExit(GenericReader& r) : r_(r) {}
+        ~ClearStackOnExit() { r_.ClearStack(); }
+    private:
+        GenericReader& r_;
+        ClearStackOnExit(const ClearStackOnExit&);
+        ClearStackOnExit& operator=(const ClearStackOnExit&);
+    };
+
+    template<unsigned parseFlags, typename InputStream>
+    void SkipWhitespaceAndComments(InputStream& is) {
+        SkipWhitespace(is);
+
+        if (parseFlags & kParseCommentsFlag) {
+            while (RAPIDJSON_UNLIKELY(Consume(is, '/'))) {
+                if (Consume(is, '*')) {
+                    while (true) {
+                        if (RAPIDJSON_UNLIKELY(is.Peek() == '\0'))
+                            RAPIDJSON_PARSE_ERROR(kParseErrorUnspecificSyntaxError, is.Tell());
+                        else if (Consume(is, '*')) {
+                            if (Consume(is, '/'))
+                                break;
+                        }
+                        else
+                            is.Take();
+                    }
+                }
+                else if (RAPIDJSON_LIKELY(Consume(is, '/')))
+                    while (is.Peek() != '\0' && is.Take() != '\n') {}
+                else
+                    RAPIDJSON_PARSE_ERROR(kParseErrorUnspecificSyntaxError, is.Tell());
+
+                SkipWhitespace(is);
+            }
+        }
+    }
+
+    // Parse object: { string : value, ... }
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseObject(InputStream& is, Handler& handler) {
+        RAPIDJSON_ASSERT(is.Peek() == '{');
+        is.Take();  // Skip '{'
+
+        if (RAPIDJSON_UNLIKELY(!handler.StartObject()))
+            RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+
+        SkipWhitespaceAndComments<parseFlags>(is);
+        RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+        if (Consume(is, '}')) {
+            if (RAPIDJSON_UNLIKELY(!handler.EndObject(0)))  // empty object
+                RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+            return;
+        }
+
+        for (SizeType memberCount = 0;;) {
+            if (RAPIDJSON_UNLIKELY(is.Peek() != '"'))
+                RAPIDJSON_PARSE_ERROR(kParseErrorObjectMissName, is.Tell());
+
+            ParseString<parseFlags>(is, handler, true);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            SkipWhitespaceAndComments<parseFlags>(is);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            if (RAPIDJSON_UNLIKELY(!Consume(is, ':')))
+                RAPIDJSON_PARSE_ERROR(kParseErrorObjectMissColon, is.Tell());
+
+            SkipWhitespaceAndComments<parseFlags>(is);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            ParseValue<parseFlags>(is, handler);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            SkipWhitespaceAndComments<parseFlags>(is);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            ++memberCount;
+
+            switch (is.Peek()) {
+                case ',':
+                    is.Take();
+                    SkipWhitespaceAndComments<parseFlags>(is);
+                    RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+                    break;
+                case '}':
+                    is.Take();
+                    if (RAPIDJSON_UNLIKELY(!handler.EndObject(memberCount)))
+                        RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+                    return;
+                default:
+                    RAPIDJSON_PARSE_ERROR(kParseErrorObjectMissCommaOrCurlyBracket, is.Tell()); break; // This useless break is only for making warning and coverage happy
+            }
+
+            if (parseFlags & kParseTrailingCommasFlag) {
+                if (is.Peek() == '}') {
+                    if (RAPIDJSON_UNLIKELY(!handler.EndObject(memberCount)))
+                        RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+                    is.Take();
+                    return;
+                }
+            }
+        }
+    }
+
+    // Parse array: [ value, ... ]
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseArray(InputStream& is, Handler& handler) {
+        RAPIDJSON_ASSERT(is.Peek() == '[');
+        is.Take();  // Skip '['
+
+        if (RAPIDJSON_UNLIKELY(!handler.StartArray()))
+            RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+
+        SkipWhitespaceAndComments<parseFlags>(is);
+        RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+        if (Consume(is, ']')) {
+            if (RAPIDJSON_UNLIKELY(!handler.EndArray(0))) // empty array
+                RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+            return;
+        }
+
+        for (SizeType elementCount = 0;;) {
+            ParseValue<parseFlags>(is, handler);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            ++elementCount;
+            SkipWhitespaceAndComments<parseFlags>(is);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+
+            if (Consume(is, ',')) {
+                SkipWhitespaceAndComments<parseFlags>(is);
+                RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+            }
+            else if (Consume(is, ']')) {
+                if (RAPIDJSON_UNLIKELY(!handler.EndArray(elementCount)))
+                    RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+                return;
+            }
+            else
+                RAPIDJSON_PARSE_ERROR(kParseErrorArrayMissCommaOrSquareBracket, is.Tell());
+
+            if (parseFlags & kParseTrailingCommasFlag) {
+                if (is.Peek() == ']') {
+                    if (RAPIDJSON_UNLIKELY(!handler.EndArray(elementCount)))
+                        RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+                    is.Take();
+                    return;
+                }
+            }
+        }
+    }
+
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseNull(InputStream& is, Handler& handler) {
+        RAPIDJSON_ASSERT(is.Peek() == 'n');
+        is.Take();
+
+        if (RAPIDJSON_LIKELY(Consume(is, 'u') && Consume(is, 'l') && Consume(is, 'l'))) {
+            if (RAPIDJSON_UNLIKELY(!handler.Null()))
+                RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+        }
+        else
+            RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, is.Tell());
+    }
+
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseTrue(InputStream& is, Handler& handler) {
+        RAPIDJSON_ASSERT(is.Peek() == 't');
+        is.Take();
+
+        if (RAPIDJSON_LIKELY(Consume(is, 'r') && Consume(is, 'u') && Consume(is, 'e'))) {
+            if (RAPIDJSON_UNLIKELY(!handler.Bool(true)))
+                RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+        }
+        else
+            RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, is.Tell());
+    }
+
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseFalse(InputStream& is, Handler& handler) {
+        RAPIDJSON_ASSERT(is.Peek() == 'f');
+        is.Take();
+
+        if (RAPIDJSON_LIKELY(Consume(is, 'a') && Consume(is, 'l') && Consume(is, 's') && Consume(is, 'e'))) {
+            if (RAPIDJSON_UNLIKELY(!handler.Bool(false)))
+                RAPIDJSON_PARSE_ERROR(kParseErrorTermination, is.Tell());
+        }
+        else
+            RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, is.Tell());
+    }
+
+    template<typename InputStream>
+    RAPIDJSON_FORCEINLINE static bool Consume(InputStream& is, typename InputStream::Ch expect) {
+        if (RAPIDJSON_LIKELY(is.Peek() == expect)) {
+            is.Take();
+            return true;
+        }
+        else
+            return false;
+    }
+
+    // Helper function to parse four hexadecimal digits in \uXXXX in ParseString().
+    template<typename InputStream>
+    unsigned ParseHex4(InputStream& is, size_t escapeOffset) {
+        unsigned codepoint = 0;
+        for (int i = 0; i < 4; i++) {
+            Ch c = is.Peek();
+            codepoint <<= 4;
+            codepoint += static_cast<unsigned>(c);
+            if (c >= '0' && c <= '9')
+                codepoint -= '0';
+            else if (c >= 'A' && c <= 'F')
+                codepoint -= 'A' - 10;
+            else if (c >= 'a' && c <= 'f')
+                codepoint -= 'a' - 10;
+            else {
+                RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorStringUnicodeEscapeInvalidHex, escapeOffset);
+                RAPIDJSON_PARSE_ERROR_EARLY_RETURN(0);
+            }
+            is.Take();
+        }
+        return codepoint;
+    }
+
+    template <typename CharType>
+    class StackStream {
+    public:
+        typedef CharType Ch;
+
+        StackStream(internal::Stack<StackAllocator>& stack) : stack_(stack), length_(0) {}
+        RAPIDJSON_FORCEINLINE void Put(Ch c) {
+            *stack_.template Push<Ch>() = c;
+            ++length_;
+        }
+
+        RAPIDJSON_FORCEINLINE void* Push(SizeType count) {
+            length_ += count;
+            return stack_.template Push<Ch>(count);
+        }
+
+        size_t Length() const { return length_; }
+
+        Ch* Pop() {
+            return stack_.template Pop<Ch>(length_);
+        }
+
+    private:
+        StackStream(const StackStream&);
+        StackStream& operator=(const StackStream&);
+
+        internal::Stack<StackAllocator>& stack_;
+        SizeType length_;
+    };
+
+    // Parse string and generate String event. Different code paths for kParseInsituFlag.
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseString(InputStream& is, Handler& handler, bool isKey = false) {
+        internal::StreamLocalCopy<InputStream> copy(is);
+        InputStream& s(copy.s);
+
+        RAPIDJSON_ASSERT(s.Peek() == '\"');
+        s.Take();  // Skip '\"'
+
+        bool success = false;
+        if (parseFlags & kParseInsituFlag) {
+            typename InputStream::Ch *head = s.PutBegin();
+            ParseStringToStream<parseFlags, SourceEncoding, SourceEncoding>(s, s);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+            size_t length = s.PutEnd(head) - 1;
+            RAPIDJSON_ASSERT(length <= 0xFFFFFFFF);
+            const typename TargetEncoding::Ch* const str = reinterpret_cast<typename TargetEncoding::Ch*>(head);
+            success = (isKey ? handler.Key(str, SizeType(length), false) : handler.String(str, SizeType(length), false));
+        }
+        else {
+            StackStream<typename TargetEncoding::Ch> stackStream(stack_);
+            ParseStringToStream<parseFlags, SourceEncoding, TargetEncoding>(s, stackStream);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+            SizeType length = static_cast<SizeType>(stackStream.Length()) - 1;
+            const typename TargetEncoding::Ch* const str = stackStream.Pop();
+            success = (isKey ? handler.Key(str, length, true) : handler.String(str, length, true));
+        }
+        if (RAPIDJSON_UNLIKELY(!success))
+            RAPIDJSON_PARSE_ERROR(kParseErrorTermination, s.Tell());
+    }
+
+    // Parse string to an output is
+    // This function handles the prefix/suffix double quotes, escaping, and optional encoding validation.
+    template<unsigned parseFlags, typename SEncoding, typename TEncoding, typename InputStream, typename OutputStream>
+    RAPIDJSON_FORCEINLINE void ParseStringToStream(InputStream& is, OutputStream& os) {
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+#define Z16 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+        static const char escape[256] = {
+            Z16, Z16, 0, 0,'\"', 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, '/',
+            Z16, Z16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,'\\', 0, 0, 0,
+            0, 0,'\b', 0, 0, 0,'\f', 0, 0, 0, 0, 0, 0, 0,'\n', 0,
+            0, 0,'\r', 0,'\t', 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+            Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16
+        };
+#undef Z16
+//!@endcond
+
+        for (;;) {
+            // Scan and copy string before "\\\"" or < 0x20. This is an optional optimzation.
+            if (!(parseFlags & kParseValidateEncodingFlag))
+                ScanCopyUnescapedString(is, os);
+
+            Ch c = is.Peek();
+            if (RAPIDJSON_UNLIKELY(c == '\\')) {    // Escape
+                size_t escapeOffset = is.Tell();    // For invalid escaping, report the initial '\\' as error offset
+                is.Take();
+                Ch e = is.Peek();
+                if ((sizeof(Ch) == 1 || unsigned(e) < 256) && RAPIDJSON_LIKELY(escape[static_cast<unsigned char>(e)])) {
+                    is.Take();
+                    os.Put(static_cast<typename TEncoding::Ch>(escape[static_cast<unsigned char>(e)]));
+                }
+                else if ((parseFlags & kParseEscapedApostropheFlag) && RAPIDJSON_LIKELY(e == '\'')) { // Allow escaped apostrophe
+                    is.Take();
+                    os.Put('\'');
+                }
+                else if (RAPIDJSON_LIKELY(e == 'u')) {    // Unicode
+                    is.Take();
+                    unsigned codepoint = ParseHex4(is, escapeOffset);
+                    RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+                    if (RAPIDJSON_UNLIKELY(codepoint >= 0xD800 && codepoint <= 0xDFFF)) {
+                        // high surrogate, check if followed by valid low surrogate
+                        if (RAPIDJSON_LIKELY(codepoint <= 0xDBFF)) {
+                            // Handle UTF-16 surrogate pair
+                            if (RAPIDJSON_UNLIKELY(!Consume(is, '\\') || !Consume(is, 'u')))
+                                RAPIDJSON_PARSE_ERROR(kParseErrorStringUnicodeSurrogateInvalid, escapeOffset);
+                            unsigned codepoint2 = ParseHex4(is, escapeOffset);
+                            RAPIDJSON_PARSE_ERROR_EARLY_RETURN_VOID;
+                            if (RAPIDJSON_UNLIKELY(codepoint2 < 0xDC00 || codepoint2 > 0xDFFF))
+                                RAPIDJSON_PARSE_ERROR(kParseErrorStringUnicodeSurrogateInvalid, escapeOffset);
+                            codepoint = (((codepoint - 0xD800) << 10) | (codepoint2 - 0xDC00)) + 0x10000;
+                        }
+                        // single low surrogate
+                        else
+                        {
+                            RAPIDJSON_PARSE_ERROR(kParseErrorStringUnicodeSurrogateInvalid, escapeOffset);
+                        }
+                    }
+                    TEncoding::Encode(os, codepoint);
+                }
+                else
+                    RAPIDJSON_PARSE_ERROR(kParseErrorStringEscapeInvalid, escapeOffset);
+            }
+            else if (RAPIDJSON_UNLIKELY(c == '"')) {    // Closing double quote
+                is.Take();
+                os.Put('\0');   // null-terminate the string
+                return;
+            }
+            else if (RAPIDJSON_UNLIKELY(static_cast<unsigned>(c) < 0x20)) { // RFC 4627: unescaped = %x20-21 / %x23-5B / %x5D-10FFFF
+                if (c == '\0')
+                    RAPIDJSON_PARSE_ERROR(kParseErrorStringMissQuotationMark, is.Tell());
+                else
+                    RAPIDJSON_PARSE_ERROR(kParseErrorStringInvalidEncoding, is.Tell());
+            }
+            else {
+                size_t offset = is.Tell();
+                if (RAPIDJSON_UNLIKELY((parseFlags & kParseValidateEncodingFlag ?
+                    !Transcoder<SEncoding, TEncoding>::Validate(is, os) :
+                    !Transcoder<SEncoding, TEncoding>::Transcode(is, os))))
+                    RAPIDJSON_PARSE_ERROR(kParseErrorStringInvalidEncoding, offset);
+            }
+        }
+    }
+
+    template<typename InputStream, typename OutputStream>
+    static RAPIDJSON_FORCEINLINE void ScanCopyUnescapedString(InputStream&, OutputStream&) {
+            // Do nothing for generic version
+    }
+
+#if defined(RAPIDJSON_SSE2) || defined(RAPIDJSON_SSE42)
+    // StringStream -> StackStream<char>
+    static RAPIDJSON_FORCEINLINE void ScanCopyUnescapedString(StringStream& is, StackStream<char>& os) {
+        const char* p = is.src_;
+
+        // Scan one by one until alignment (unaligned load may cross page boundary and cause crash)
+        const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+        while (p != nextAligned)
+            if (RAPIDJSON_UNLIKELY(*p == '\"') || RAPIDJSON_UNLIKELY(*p == '\\') || RAPIDJSON_UNLIKELY(static_cast<unsigned>(*p) < 0x20)) {
+                is.src_ = p;
+                return;
+            }
+            else
+                os.Put(*p++);
+
+        // The rest of string using SIMD
+        static const char dquote[16] = { '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"' };
+        static const char bslash[16] = { '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' };
+        static const char space[16]  = { 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F };
+        const __m128i dq = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&dquote[0]));
+        const __m128i bs = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&bslash[0]));
+        const __m128i sp = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&space[0]));
+
+        for (;; p += 16) {
+            const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
+            const __m128i t1 = _mm_cmpeq_epi8(s, dq);
+            const __m128i t2 = _mm_cmpeq_epi8(s, bs);
+            const __m128i t3 = _mm_cmpeq_epi8(_mm_max_epu8(s, sp), sp); // s < 0x20 <=> max(s, 0x1F) == 0x1F
+            const __m128i x = _mm_or_si128(_mm_or_si128(t1, t2), t3);
+            unsigned short r = static_cast<unsigned short>(_mm_movemask_epi8(x));
+            if (RAPIDJSON_UNLIKELY(r != 0)) {   // some of characters is escaped
+                SizeType length;
+    #ifdef _MSC_VER         // Find the index of first escaped
+                unsigned long offset;
+                _BitScanForward(&offset, r);
+                length = offset;
+    #else
+                length = static_cast<SizeType>(__builtin_ffs(r) - 1);
+    #endif
+                if (length != 0) {
+                    char* q = reinterpret_cast<char*>(os.Push(length));
+                    for (size_t i = 0; i < length; i++)
+                        q[i] = p[i];
+
+                    p += length;
+                }
+                break;
+            }
+            _mm_storeu_si128(reinterpret_cast<__m128i *>(os.Push(16)), s);
+        }
+
+        is.src_ = p;
+    }
+
+    // InsituStringStream -> InsituStringStream
+    static RAPIDJSON_FORCEINLINE void ScanCopyUnescapedString(InsituStringStream& is, InsituStringStream& os) {
+        RAPIDJSON_ASSERT(&is == &os);
+        (void)os;
+
+        if (is.src_ == is.dst_) {
+            SkipUnescapedString(is);
+            return;
+        }
+
+        char* p = is.src_;
+        char *q = is.dst_;
+
+        // Scan one by one until alignment (unaligned load may cross page boundary and cause crash)
+        const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+        while (p != nextAligned)
+            if (RAPIDJSON_UNLIKELY(*p == '\"') || RAPIDJSON_UNLIKELY(*p == '\\') || RAPIDJSON_UNLIKELY(static_cast<unsigned>(*p) < 0x20)) {
+                is.src_ = p;
+                is.dst_ = q;
+                return;
+            }
+            else
+                *q++ = *p++;
+
+        // The rest of string using SIMD
+        static const char dquote[16] = { '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"' };
+        static const char bslash[16] = { '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' };
+        static const char space[16] = { 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F };
+        const __m128i dq = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&dquote[0]));
+        const __m128i bs = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&bslash[0]));
+        const __m128i sp = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&space[0]));
+
+        for (;; p += 16, q += 16) {
+            const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
+            const __m128i t1 = _mm_cmpeq_epi8(s, dq);
+            const __m128i t2 = _mm_cmpeq_epi8(s, bs);
+            const __m128i t3 = _mm_cmpeq_epi8(_mm_max_epu8(s, sp), sp); // s < 0x20 <=> max(s, 0x1F) == 0x1F
+            const __m128i x = _mm_or_si128(_mm_or_si128(t1, t2), t3);
+            unsigned short r = static_cast<unsigned short>(_mm_movemask_epi8(x));
+            if (RAPIDJSON_UNLIKELY(r != 0)) {   // some of characters is escaped
+                size_t length;
+#ifdef _MSC_VER         // Find the index of first escaped
+                unsigned long offset;
+                _BitScanForward(&offset, r);
+                length = offset;
+#else
+                length = static_cast<size_t>(__builtin_ffs(r) - 1);
+#endif
+                for (const char* pend = p + length; p != pend; )
+                    *q++ = *p++;
+                break;
+            }
+            _mm_storeu_si128(reinterpret_cast<__m128i *>(q), s);
+        }
+
+        is.src_ = p;
+        is.dst_ = q;
+    }
+
+    // When read/write pointers are the same for insitu stream, just skip unescaped characters
+    static RAPIDJSON_FORCEINLINE void SkipUnescapedString(InsituStringStream& is) {
+        RAPIDJSON_ASSERT(is.src_ == is.dst_);
+        char* p = is.src_;
+
+        // Scan one by one until alignment (unaligned load may cross page boundary and cause crash)
+        const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+        for (; p != nextAligned; p++)
+            if (RAPIDJSON_UNLIKELY(*p == '\"') || RAPIDJSON_UNLIKELY(*p == '\\') || RAPIDJSON_UNLIKELY(static_cast<unsigned>(*p) < 0x20)) {
+                is.src_ = is.dst_ = p;
+                return;
+            }
+
+        // The rest of string using SIMD
+        static const char dquote[16] = { '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"' };
+        static const char bslash[16] = { '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' };
+        static const char space[16] = { 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F };
+        const __m128i dq = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&dquote[0]));
+        const __m128i bs = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&bslash[0]));
+        const __m128i sp = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&space[0]));
+
+        for (;; p += 16) {
+            const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
+            const __m128i t1 = _mm_cmpeq_epi8(s, dq);
+            const __m128i t2 = _mm_cmpeq_epi8(s, bs);
+            const __m128i t3 = _mm_cmpeq_epi8(_mm_max_epu8(s, sp), sp); // s < 0x20 <=> max(s, 0x1F) == 0x1F
+            const __m128i x = _mm_or_si128(_mm_or_si128(t1, t2), t3);
+            unsigned short r = static_cast<unsigned short>(_mm_movemask_epi8(x));
+            if (RAPIDJSON_UNLIKELY(r != 0)) {   // some of characters is escaped
+                size_t length;
+#ifdef _MSC_VER         // Find the index of first escaped
+                unsigned long offset;
+                _BitScanForward(&offset, r);
+                length = offset;
+#else
+                length = static_cast<size_t>(__builtin_ffs(r) - 1);
+#endif
+                p += length;
+                break;
+            }
+        }
+
+        is.src_ = is.dst_ = p;
+    }
+#elif defined(RAPIDJSON_NEON)
+    // StringStream -> StackStream<char>
+    static RAPIDJSON_FORCEINLINE void ScanCopyUnescapedString(StringStream& is, StackStream<char>& os) {
+        const char* p = is.src_;
+
+        // Scan one by one until alignment (unaligned load may cross page boundary and cause crash)
+        const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+        while (p != nextAligned)
+            if (RAPIDJSON_UNLIKELY(*p == '\"') || RAPIDJSON_UNLIKELY(*p == '\\') || RAPIDJSON_UNLIKELY(static_cast<unsigned>(*p) < 0x20)) {
+                is.src_ = p;
+                return;
+            }
+            else
+                os.Put(*p++);
+
+        // The rest of string using SIMD
+        const uint8x16_t s0 = vmovq_n_u8('"');
+        const uint8x16_t s1 = vmovq_n_u8('\\');
+        const uint8x16_t s2 = vmovq_n_u8('\b');
+        const uint8x16_t s3 = vmovq_n_u8(32);
+
+        for (;; p += 16) {
+            const uint8x16_t s = vld1q_u8(reinterpret_cast<const uint8_t *>(p));
+            uint8x16_t x = vceqq_u8(s, s0);
+            x = vorrq_u8(x, vceqq_u8(s, s1));
+            x = vorrq_u8(x, vceqq_u8(s, s2));
+            x = vorrq_u8(x, vcltq_u8(s, s3));
+
+            x = vrev64q_u8(x);                     // Rev in 64
+            uint64_t low = vgetq_lane_u64(vreinterpretq_u64_u8(x), 0);   // extract
+            uint64_t high = vgetq_lane_u64(vreinterpretq_u64_u8(x), 1);  // extract
+
+            SizeType length = 0;
+            bool escaped = false;
+            if (low == 0) {
+                if (high != 0) {
+                    uint32_t lz = internal::clzll(high);
+                    length = 8 + (lz >> 3);
+                    escaped = true;
+                }
+            } else {
+                uint32_t lz = internal::clzll(low);
+                length = lz >> 3;
+                escaped = true;
+            }
+            if (RAPIDJSON_UNLIKELY(escaped)) {   // some of characters is escaped
+                if (length != 0) {
+                    char* q = reinterpret_cast<char*>(os.Push(length));
+                    for (size_t i = 0; i < length; i++)
+                        q[i] = p[i];
+
+                    p += length;
+                }
+                break;
+            }
+            vst1q_u8(reinterpret_cast<uint8_t *>(os.Push(16)), s);
+        }
+
+        is.src_ = p;
+    }
+
+    // InsituStringStream -> InsituStringStream
+    static RAPIDJSON_FORCEINLINE void ScanCopyUnescapedString(InsituStringStream& is, InsituStringStream& os) {
+        RAPIDJSON_ASSERT(&is == &os);
+        (void)os;
+
+        if (is.src_ == is.dst_) {
+            SkipUnescapedString(is);
+            return;
+        }
+
+        char* p = is.src_;
+        char *q = is.dst_;
+
+        // Scan one by one until alignment (unaligned load may cross page boundary and cause crash)
+        const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+        while (p != nextAligned)
+            if (RAPIDJSON_UNLIKELY(*p == '\"') || RAPIDJSON_UNLIKELY(*p == '\\') || RAPIDJSON_UNLIKELY(static_cast<unsigned>(*p) < 0x20)) {
+                is.src_ = p;
+                is.dst_ = q;
+                return;
+            }
+            else
+                *q++ = *p++;
+
+        // The rest of string using SIMD
+        const uint8x16_t s0 = vmovq_n_u8('"');
+        const uint8x16_t s1 = vmovq_n_u8('\\');
+        const uint8x16_t s2 = vmovq_n_u8('\b');
+        const uint8x16_t s3 = vmovq_n_u8(32);
+
+        for (;; p += 16, q += 16) {
+            const uint8x16_t s = vld1q_u8(reinterpret_cast<uint8_t *>(p));
+            uint8x16_t x = vceqq_u8(s, s0);
+            x = vorrq_u8(x, vceqq_u8(s, s1));
+            x = vorrq_u8(x, vceqq_u8(s, s2));
+            x = vorrq_u8(x, vcltq_u8(s, s3));
+
+            x = vrev64q_u8(x);                     // Rev in 64
+            uint64_t low = vgetq_lane_u64(vreinterpretq_u64_u8(x), 0);   // extract
+            uint64_t high = vgetq_lane_u64(vreinterpretq_u64_u8(x), 1);  // extract
+
+            SizeType length = 0;
+            bool escaped = false;
+            if (low == 0) {
+                if (high != 0) {
+                    uint32_t lz = internal::clzll(high);
+                    length = 8 + (lz >> 3);
+                    escaped = true;
+                }
+            } else {
+                uint32_t lz = internal::clzll(low);
+                length = lz >> 3;
+                escaped = true;
+            }
+            if (RAPIDJSON_UNLIKELY(escaped)) {   // some of characters is escaped
+                for (const char* pend = p + length; p != pend; ) {
+                    *q++ = *p++;
+                }
+                break;
+            }
+            vst1q_u8(reinterpret_cast<uint8_t *>(q), s);
+        }
+
+        is.src_ = p;
+        is.dst_ = q;
+    }
+
+    // When read/write pointers are the same for insitu stream, just skip unescaped characters
+    static RAPIDJSON_FORCEINLINE void SkipUnescapedString(InsituStringStream& is) {
+        RAPIDJSON_ASSERT(is.src_ == is.dst_);
+        char* p = is.src_;
+
+        // Scan one by one until alignment (unaligned load may cross page boundary and cause crash)
+        const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+        for (; p != nextAligned; p++)
+            if (RAPIDJSON_UNLIKELY(*p == '\"') || RAPIDJSON_UNLIKELY(*p == '\\') || RAPIDJSON_UNLIKELY(static_cast<unsigned>(*p) < 0x20)) {
+                is.src_ = is.dst_ = p;
+                return;
+            }
+
+        // The rest of string using SIMD
+        const uint8x16_t s0 = vmovq_n_u8('"');
+        const uint8x16_t s1 = vmovq_n_u8('\\');
+        const uint8x16_t s2 = vmovq_n_u8('\b');
+        const uint8x16_t s3 = vmovq_n_u8(32);
+
+        for (;; p += 16) {
+            const uint8x16_t s = vld1q_u8(reinterpret_cast<uint8_t *>(p));
+            uint8x16_t x = vceqq_u8(s, s0);
+            x = vorrq_u8(x, vceqq_u8(s, s1));
+            x = vorrq_u8(x, vceqq_u8(s, s2));
+            x = vorrq_u8(x, vcltq_u8(s, s3));
+
+            x = vrev64q_u8(x);                     // Rev in 64
+            uint64_t low = vgetq_lane_u64(vreinterpretq_u64_u8(x), 0);   // extract
+            uint64_t high = vgetq_lane_u64(vreinterpretq_u64_u8(x), 1);  // extract
+
+            if (low == 0) {
+                if (high != 0) {
+                    uint32_t lz = internal::clzll(high);
+                    p += 8 + (lz >> 3);
+                    break;
+                }
+            } else {
+                uint32_t lz = internal::clzll(low);
+                p += lz >> 3;
+                break;
+            }
+        }
+
+        is.src_ = is.dst_ = p;
+    }
+#endif // RAPIDJSON_NEON
+
+    template<typename InputStream, typename StackCharacter, bool backup, bool pushOnTake>
+    class NumberStream;
+
+    template<typename InputStream, typename StackCharacter>
+    class NumberStream<InputStream, StackCharacter, false, false> {
+    public:
+        typedef typename InputStream::Ch Ch;
+
+        NumberStream(GenericReader& reader, InputStream& s) : is(s) { (void)reader;  }
+
+        RAPIDJSON_FORCEINLINE Ch Peek() const { return is.Peek(); }
+        RAPIDJSON_FORCEINLINE Ch TakePush() { return is.Take(); }
+        RAPIDJSON_FORCEINLINE Ch Take() { return is.Take(); }
+        RAPIDJSON_FORCEINLINE void Push(char) {}
+
+        size_t Tell() { return is.Tell(); }
+        size_t Length() { return 0; }
+        const StackCharacter* Pop() { return 0; }
+
+    protected:
+        NumberStream& operator=(const NumberStream&);
+
+        InputStream& is;
+    };
+
+    template<typename InputStream, typename StackCharacter>
+    class NumberStream<InputStream, StackCharacter, true, false> : public NumberStream<InputStream, StackCharacter, false, false> {
+        typedef NumberStream<InputStream, StackCharacter, false, false> Base;
+    public:
+        NumberStream(GenericReader& reader, InputStream& s) : Base(reader, s), stackStream(reader.stack_) {}
+
+        RAPIDJSON_FORCEINLINE Ch TakePush() {
+            stackStream.Put(static_cast<StackCharacter>(Base::is.Peek()));
+            return Base::is.Take();
+        }
+
+        RAPIDJSON_FORCEINLINE void Push(StackCharacter c) {
+            stackStream.Put(c);
+        }
+
+        size_t Length() { return stackStream.Length(); }
+
+        const StackCharacter* Pop() {
+            stackStream.Put('\0');
+            return stackStream.Pop();
+        }
+
+    private:
+        StackStream<StackCharacter> stackStream;
+    };
+
+    template<typename InputStream, typename StackCharacter>
+    class NumberStream<InputStream, StackCharacter, true, true> : public NumberStream<InputStream, StackCharacter, true, false> {
+        typedef NumberStream<InputStream, StackCharacter, true, false> Base;
+    public:
+        NumberStream(GenericReader& reader, InputStream& s) : Base(reader, s) {}
+
+        RAPIDJSON_FORCEINLINE Ch Take() { return Base::TakePush(); }
+    };
+
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseNumber(InputStream& is, Handler& handler) {
+        typedef typename internal::SelectIf<internal::BoolType<(parseFlags & kParseNumbersAsStringsFlag) != 0>, typename TargetEncoding::Ch, char>::Type NumberCharacter;
+
+        internal::StreamLocalCopy<InputStream> copy(is);
+        NumberStream<InputStream, NumberCharacter,
+            ((parseFlags & kParseNumbersAsStringsFlag) != 0) ?
+                ((parseFlags & kParseInsituFlag) == 0) :
+                ((parseFlags & kParseFullPrecisionFlag) != 0),
+            (parseFlags & kParseNumbersAsStringsFlag) != 0 &&
+                (parseFlags & kParseInsituFlag) == 0> s(*this, copy.s);
+
+        size_t startOffset = s.Tell();
+        double d = 0.0;
+        bool useNanOrInf = false;
+
+        // Parse minus
+        bool minus = Consume(s, '-');
+
+        // Parse int: zero / ( digit1-9 *DIGIT )
+        unsigned i = 0;
+        uint64_t i64 = 0;
+        bool use64bit = false;
+        int significandDigit = 0;
+        if (RAPIDJSON_UNLIKELY(s.Peek() == '0')) {
+            i = 0;
+            s.TakePush();
+        }
+        else if (RAPIDJSON_LIKELY(s.Peek() >= '1' && s.Peek() <= '9')) {
+            i = static_cast<unsigned>(s.TakePush() - '0');
+
+            if (minus)
+                while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                    if (RAPIDJSON_UNLIKELY(i >= 214748364)) { // 2^31 = 2147483648
+                        if (RAPIDJSON_LIKELY(i != 214748364 || s.Peek() > '8')) {
+                            i64 = i;
+                            use64bit = true;
+                            break;
+                        }
+                    }
+                    i = i * 10 + static_cast<unsigned>(s.TakePush() - '0');
+                    significandDigit++;
+                }
+            else
+                while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                    if (RAPIDJSON_UNLIKELY(i >= 429496729)) { // 2^32 - 1 = 4294967295
+                        if (RAPIDJSON_LIKELY(i != 429496729 || s.Peek() > '5')) {
+                            i64 = i;
+                            use64bit = true;
+                            break;
+                        }
+                    }
+                    i = i * 10 + static_cast<unsigned>(s.TakePush() - '0');
+                    significandDigit++;
+                }
+        }
+        // Parse NaN or Infinity here
+        else if ((parseFlags & kParseNanAndInfFlag) && RAPIDJSON_LIKELY((s.Peek() == 'I' || s.Peek() == 'N'))) {
+            if (Consume(s, 'N')) {
+                if (Consume(s, 'a') && Consume(s, 'N')) {
+                    d = std::numeric_limits<double>::quiet_NaN();
+                    useNanOrInf = true;
+                }
+            }
+            else if (RAPIDJSON_LIKELY(Consume(s, 'I'))) {
+                if (Consume(s, 'n') && Consume(s, 'f')) {
+                    d = (minus ? -std::numeric_limits<double>::infinity() : std::numeric_limits<double>::infinity());
+                    useNanOrInf = true;
+
+                    if (RAPIDJSON_UNLIKELY(s.Peek() == 'i' && !(Consume(s, 'i') && Consume(s, 'n')
+                                                                && Consume(s, 'i') && Consume(s, 't') && Consume(s, 'y')))) {
+                        RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, s.Tell());
+                    }
+                }
+            }
+
+            if (RAPIDJSON_UNLIKELY(!useNanOrInf)) {
+                RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, s.Tell());
+            }
+        }
+        else
+            RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, s.Tell());
+
+        // Parse 64bit int
+        bool useDouble = false;
+        if (use64bit) {
+            if (minus)
+                while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                     if (RAPIDJSON_UNLIKELY(i64 >= RAPIDJSON_UINT64_C2(0x0CCCCCCC, 0xCCCCCCCC))) // 2^63 = 9223372036854775808
+                        if (RAPIDJSON_LIKELY(i64 != RAPIDJSON_UINT64_C2(0x0CCCCCCC, 0xCCCCCCCC) || s.Peek() > '8')) {
+                            d = static_cast<double>(i64);
+                            useDouble = true;
+                            break;
+                        }
+                    i64 = i64 * 10 + static_cast<unsigned>(s.TakePush() - '0');
+                    significandDigit++;
+                }
+            else
+                while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                    if (RAPIDJSON_UNLIKELY(i64 >= RAPIDJSON_UINT64_C2(0x19999999, 0x99999999))) // 2^64 - 1 = 18446744073709551615
+                        if (RAPIDJSON_LIKELY(i64 != RAPIDJSON_UINT64_C2(0x19999999, 0x99999999) || s.Peek() > '5')) {
+                            d = static_cast<double>(i64);
+                            useDouble = true;
+                            break;
+                        }
+                    i64 = i64 * 10 + static_cast<unsigned>(s.TakePush() - '0');
+                    significandDigit++;
+                }
+        }
+
+        // Force double for big integer
+        if (useDouble) {
+            while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                d = d * 10 + (s.TakePush() - '0');
+            }
+        }
+
+        // Parse frac = decimal-point 1*DIGIT
+        int expFrac = 0;
+        size_t decimalPosition;
+        if (Consume(s, '.')) {
+            decimalPosition = s.Length();
+
+            if (RAPIDJSON_UNLIKELY(!(s.Peek() >= '0' && s.Peek() <= '9')))
+                RAPIDJSON_PARSE_ERROR(kParseErrorNumberMissFraction, s.Tell());
+
+            if (!useDouble) {
+#if RAPIDJSON_64BIT
+                // Use i64 to store significand in 64-bit architecture
+                if (!use64bit)
+                    i64 = i;
+
+                while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                    if (i64 > RAPIDJSON_UINT64_C2(0x1FFFFF, 0xFFFFFFFF)) // 2^53 - 1 for fast path
+                        break;
+                    else {
+                        i64 = i64 * 10 + static_cast<unsigned>(s.TakePush() - '0');
+                        --expFrac;
+                        if (i64 != 0)
+                            significandDigit++;
+                    }
+                }
+
+                d = static_cast<double>(i64);
+#else
+                // Use double to store significand in 32-bit architecture
+                d = static_cast<double>(use64bit ? i64 : i);
+#endif
+                useDouble = true;
+            }
+
+            while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                if (significandDigit < 17) {
+                    d = d * 10.0 + (s.TakePush() - '0');
+                    --expFrac;
+                    if (RAPIDJSON_LIKELY(d > 0.0))
+                        significandDigit++;
+                }
+                else
+                    s.TakePush();
+            }
+        }
+        else
+            decimalPosition = s.Length(); // decimal position at the end of integer.
+
+        // Parse exp = e [ minus / plus ] 1*DIGIT
+        int exp = 0;
+        if (Consume(s, 'e') || Consume(s, 'E')) {
+            if (!useDouble) {
+                d = static_cast<double>(use64bit ? i64 : i);
+                useDouble = true;
+            }
+
+            bool expMinus = false;
+            if (Consume(s, '+'))
+                ;
+            else if (Consume(s, '-'))
+                expMinus = true;
+
+            if (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                exp = static_cast<int>(s.Take() - '0');
+                if (expMinus) {
+                    // (exp + expFrac) must not underflow int => we're detecting when -exp gets
+                    // dangerously close to INT_MIN (a pessimistic next digit 9 would push it into
+                    // underflow territory):
+                    //
+                    //        -(exp * 10 + 9) + expFrac >= INT_MIN
+                    //   <=>  exp <= (expFrac - INT_MIN - 9) / 10
+                    RAPIDJSON_ASSERT(expFrac <= 0);
+                    int maxExp = (expFrac + 2147483639) / 10;
+
+                    while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                        exp = exp * 10 + static_cast<int>(s.Take() - '0');
+                        if (RAPIDJSON_UNLIKELY(exp > maxExp)) {
+                            while (RAPIDJSON_UNLIKELY(s.Peek() >= '0' && s.Peek() <= '9'))  // Consume the rest of exponent
+                                s.Take();
+                        }
+                    }
+                }
+                else {  // positive exp
+                    int maxExp = 308 - expFrac;
+                    while (RAPIDJSON_LIKELY(s.Peek() >= '0' && s.Peek() <= '9')) {
+                        exp = exp * 10 + static_cast<int>(s.Take() - '0');
+                        if (RAPIDJSON_UNLIKELY(exp > maxExp))
+                            RAPIDJSON_PARSE_ERROR(kParseErrorNumberTooBig, startOffset);
+                    }
+                }
+            }
+            else
+                RAPIDJSON_PARSE_ERROR(kParseErrorNumberMissExponent, s.Tell());
+
+            if (expMinus)
+                exp = -exp;
+        }
+
+        // Finish parsing, call event according to the type of number.
+        bool cont = true;
+
+        if (parseFlags & kParseNumbersAsStringsFlag) {
+            if (parseFlags & kParseInsituFlag) {
+                s.Pop();  // Pop stack no matter if it will be used or not.
+                typename InputStream::Ch* head = is.PutBegin();
+                const size_t length = s.Tell() - startOffset;
+                RAPIDJSON_ASSERT(length <= 0xFFFFFFFF);
+                // unable to insert the \0 character here, it will erase the comma after this number
+                const typename TargetEncoding::Ch* const str = reinterpret_cast<typename TargetEncoding::Ch*>(head);
+                cont = handler.RawNumber(str, SizeType(length), false);
+            }
+            else {
+                SizeType numCharsToCopy = static_cast<SizeType>(s.Length());
+                GenericStringStream<UTF8<NumberCharacter> > srcStream(s.Pop());
+                StackStream<typename TargetEncoding::Ch> dstStream(stack_);
+                while (numCharsToCopy--) {
+                    Transcoder<UTF8<typename TargetEncoding::Ch>, TargetEncoding>::Transcode(srcStream, dstStream);
+                }
+                dstStream.Put('\0');
+                const typename TargetEncoding::Ch* str = dstStream.Pop();
+                const SizeType length = static_cast<SizeType>(dstStream.Length()) - 1;
+                cont = handler.RawNumber(str, SizeType(length), true);
+            }
+        }
+        else {
+           size_t length = s.Length();
+           const NumberCharacter* decimal = s.Pop();  // Pop stack no matter if it will be used or not.
+
+           if (useDouble) {
+               int p = exp + expFrac;
+               if (parseFlags & kParseFullPrecisionFlag)
+                   d = internal::StrtodFullPrecision(d, p, decimal, length, decimalPosition, exp);
+               else
+                   d = internal::StrtodNormalPrecision(d, p);
+
+               // Use > max, instead of == inf, to fix bogus warning -Wfloat-equal
+               if (d > (std::numeric_limits<double>::max)()) {
+                   // Overflow
+                   // TODO: internal::StrtodX should report overflow (or underflow)
+                   RAPIDJSON_PARSE_ERROR(kParseErrorNumberTooBig, startOffset);
+               }
+
+               cont = handler.Double(minus ? -d : d);
+           }
+           else if (useNanOrInf) {
+               cont = handler.Double(d);
+           }
+           else {
+               if (use64bit) {
+                   if (minus)
+                       cont = handler.Int64(static_cast<int64_t>(~i64 + 1));
+                   else
+                       cont = handler.Uint64(i64);
+               }
+               else {
+                   if (minus)
+                       cont = handler.Int(static_cast<int32_t>(~i + 1));
+                   else
+                       cont = handler.Uint(i);
+               }
+           }
+        }
+        if (RAPIDJSON_UNLIKELY(!cont))
+            RAPIDJSON_PARSE_ERROR(kParseErrorTermination, startOffset);
+    }
+
+    // Parse any JSON value
+    template<unsigned parseFlags, typename InputStream, typename Handler>
+    void ParseValue(InputStream& is, Handler& handler) {
+        switch (is.Peek()) {
+            case 'n': ParseNull  <parseFlags>(is, handler); break;
+            case 't': ParseTrue  <parseFlags>(is, handler); break;
+            case 'f': ParseFalse <parseFlags>(is, handler); break;
+            case '"': ParseString<parseFlags>(is, handler); break;
+            case '{': ParseObject<parseFlags>(is, handler); break;
+            case '[': ParseArray <parseFlags>(is, handler); break;
+            default :
+                      ParseNumber<parseFlags>(is, handler);
+                      break;
+
+        }
+    }
+
+    // Iterative Parsing
+
+    // States
+    enum IterativeParsingState {
+        IterativeParsingFinishState = 0, // sink states at top
+        IterativeParsingErrorState,      // sink states at top
+        IterativeParsingStartState,
+
+        // Object states
+        IterativeParsingObjectInitialState,
+        IterativeParsingMemberKeyState,
+        IterativeParsingMemberValueState,
+        IterativeParsingObjectFinishState,
+
+        // Array states
+        IterativeParsingArrayInitialState,
+        IterativeParsingElementState,
+        IterativeParsingArrayFinishState,
+
+        // Single value state
+        IterativeParsingValueState,
+
+        // Delimiter states (at bottom)
+        IterativeParsingElementDelimiterState,
+        IterativeParsingMemberDelimiterState,
+        IterativeParsingKeyValueDelimiterState,
+
+        cIterativeParsingStateCount
+    };
+
+    // Tokens
+    enum Token {
+        LeftBracketToken = 0,
+        RightBracketToken,
+
+        LeftCurlyBracketToken,
+        RightCurlyBracketToken,
+
+        CommaToken,
+        ColonToken,
+
+        StringToken,
+        FalseToken,
+        TrueToken,
+        NullToken,
+        NumberToken,
+
+        kTokenCount
+    };
+
+    RAPIDJSON_FORCEINLINE Token Tokenize(Ch c) const {
+
+//!@cond RAPIDJSON_HIDDEN_FROM_DOXYGEN
+#define N NumberToken
+#define N16 N,N,N,N,N,N,N,N,N,N,N,N,N,N,N,N
+        // Maps from ASCII to Token
+        static const unsigned char tokenMap[256] = {
+            N16, // 00~0F
+            N16, // 10~1F
+            N, N, StringToken, N, N, N, N, N, N, N, N, N, CommaToken, N, N, N, // 20~2F
+            N, N, N, N, N, N, N, N, N, N, ColonToken, N, N, N, N, N, // 30~3F
+            N16, // 40~4F
+            N, N, N, N, N, N, N, N, N, N, N, LeftBracketToken, N, RightBracketToken, N, N, // 50~5F
+            N, N, N, N, N, N, FalseToken, N, N, N, N, N, N, N, NullToken, N, // 60~6F
+            N, N, N, N, TrueToken, N, N, N, N, N, N, LeftCurlyBracketToken, N, RightCurlyBracketToken, N, N, // 70~7F
+            N16, N16, N16, N16, N16, N16, N16, N16 // 80~FF
+        };
+#undef N
+#undef N16
+//!@endcond
+
+        if (sizeof(Ch) == 1 || static_cast<unsigned>(c) < 256)
+            return static_cast<Token>(tokenMap[static_cast<unsigned char>(c)]);
+        else
+            return NumberToken;
+    }
+
+    RAPIDJSON_FORCEINLINE IterativeParsingState Predict(IterativeParsingState state, Token token) const {
+        // current state x one lookahead token -> new state
+        static const char G[cIterativeParsingStateCount][kTokenCount] = {
+            // Finish(sink state)
+            {
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState
+            },
+            // Error(sink state)
+            {
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState
+            },
+            // Start
+            {
+                IterativeParsingArrayInitialState,  // Left bracket
+                IterativeParsingErrorState,         // Right bracket
+                IterativeParsingObjectInitialState, // Left curly bracket
+                IterativeParsingErrorState,         // Right curly bracket
+                IterativeParsingErrorState,         // Comma
+                IterativeParsingErrorState,         // Colon
+                IterativeParsingValueState,         // String
+                IterativeParsingValueState,         // False
+                IterativeParsingValueState,         // True
+                IterativeParsingValueState,         // Null
+                IterativeParsingValueState          // Number
+            },
+            // ObjectInitial
+            {
+                IterativeParsingErrorState,         // Left bracket
+                IterativeParsingErrorState,         // Right bracket
+                IterativeParsingErrorState,         // Left curly bracket
+                IterativeParsingObjectFinishState,  // Right curly bracket
+                IterativeParsingErrorState,         // Comma
+                IterativeParsingErrorState,         // Colon
+                IterativeParsingMemberKeyState,     // String
+                IterativeParsingErrorState,         // False
+                IterativeParsingErrorState,         // True
+                IterativeParsingErrorState,         // Null
+                IterativeParsingErrorState          // Number
+            },
+            // MemberKey
+            {
+                IterativeParsingErrorState,             // Left bracket
+                IterativeParsingErrorState,             // Right bracket
+                IterativeParsingErrorState,             // Left curly bracket
+                IterativeParsingErrorState,             // Right curly bracket
+                IterativeParsingErrorState,             // Comma
+                IterativeParsingKeyValueDelimiterState, // Colon
+                IterativeParsingErrorState,             // String
+                IterativeParsingErrorState,             // False
+                IterativeParsingErrorState,             // True
+                IterativeParsingErrorState,             // Null
+                IterativeParsingErrorState              // Number
+            },
+            // MemberValue
+            {
+                IterativeParsingErrorState,             // Left bracket
+                IterativeParsingErrorState,             // Right bracket
+                IterativeParsingErrorState,             // Left curly bracket
+                IterativeParsingObjectFinishState,      // Right curly bracket
+                IterativeParsingMemberDelimiterState,   // Comma
+                IterativeParsingErrorState,             // Colon
+                IterativeParsingErrorState,             // String
+                IterativeParsingErrorState,             // False
+                IterativeParsingErrorState,             // True
+                IterativeParsingErrorState,             // Null
+                IterativeParsingErrorState              // Number
+            },
+            // ObjectFinish(sink state)
+            {
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState
+            },
+            // ArrayInitial
+            {
+                IterativeParsingArrayInitialState,      // Left bracket(push Element state)
+                IterativeParsingArrayFinishState,       // Right bracket
+                IterativeParsingObjectInitialState,     // Left curly bracket(push Element state)
+                IterativeParsingErrorState,             // Right curly bracket
+                IterativeParsingErrorState,             // Comma
+                IterativeParsingErrorState,             // Colon
+                IterativeParsingElementState,           // String
+                IterativeParsingElementState,           // False
+                IterativeParsingElementState,           // True
+                IterativeParsingElementState,           // Null
+                IterativeParsingElementState            // Number
+            },
+            // Element
+            {
+                IterativeParsingErrorState,             // Left bracket
+                IterativeParsingArrayFinishState,       // Right bracket
+                IterativeParsingErrorState,             // Left curly bracket
+                IterativeParsingErrorState,             // Right curly bracket
+                IterativeParsingElementDelimiterState,  // Comma
+                IterativeParsingErrorState,             // Colon
+                IterativeParsingErrorState,             // String
+                IterativeParsingErrorState,             // False
+                IterativeParsingErrorState,             // True
+                IterativeParsingErrorState,             // Null
+                IterativeParsingErrorState              // Number
+            },
+            // ArrayFinish(sink state)
+            {
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState
+            },
+            // Single Value (sink state)
+            {
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState, IterativeParsingErrorState,
+                IterativeParsingErrorState
+            },
+            // ElementDelimiter
+            {
+                IterativeParsingArrayInitialState,      // Left bracket(push Element state)
+                IterativeParsingArrayFinishState,       // Right bracket
+                IterativeParsingObjectInitialState,     // Left curly bracket(push Element state)
+                IterativeParsingErrorState,             // Right curly bracket
+                IterativeParsingErrorState,             // Comma
+                IterativeParsingErrorState,             // Colon
+                IterativeParsingElementState,           // String
+                IterativeParsingElementState,           // False
+                IterativeParsingElementState,           // True
+                IterativeParsingElementState,           // Null
+                IterativeParsingElementState            // Number
+            },
+            // MemberDelimiter
+            {
+                IterativeParsingErrorState,         // Left bracket
+                IterativeParsingErrorState,         // Right bracket
+                IterativeParsingErrorState,         // Left curly bracket
+                IterativeParsingObjectFinishState,  // Right curly bracket
+                IterativeParsingErrorState,         // Comma
+                IterativeParsingErrorState,         // Colon
+                IterativeParsingMemberKeyState,     // String
+                IterativeParsingErrorState,         // False
+                IterativeParsingErrorState,         // True
+                IterativeParsingErrorState,         // Null
+                IterativeParsingErrorState          // Number
+            },
+            // KeyValueDelimiter
+            {
+                IterativeParsingArrayInitialState,      // Left bracket(push MemberValue state)
+                IterativeParsingErrorState,             // Right bracket
+                IterativeParsingObjectInitialState,     // Left curly bracket(push MemberValue state)
+                IterativeParsingErrorState,             // Right curly bracket
+                IterativeParsingErrorState,             // Comma
+                IterativeParsingErrorState,             // Colon
+                IterativeParsingMemberValueState,       // String
+                IterativeParsingMemberValueState,       // False
+                IterativeParsingMemberValueState,       // True
+                IterativeParsingMemberValueState,       // Null
+                IterativeParsingMemberValueState        // Number
+            },
+        }; // End of G
+
+        return static_cast<IterativeParsingState>(G[state][token]);
+    }
+
+    // Make an advance in the token stream and state based on the candidate destination state which was returned by Transit().
+    // May return a new state on state pop.
+    template <unsigned parseFlags, typename InputStream, typename Handler>
+    RAPIDJSON_FORCEINLINE IterativeParsingState Transit(IterativeParsingState src, Token token, IterativeParsingState dst, InputStream& is, Handler& handler) {
+        (void)token;
+
+        switch (dst) {
+        case IterativeParsingErrorState:
+            return dst;
+
+        case IterativeParsingObjectInitialState:
+        case IterativeParsingArrayInitialState:
+        {
+            // Push the state(Element or MemeberValue) if we are nested in another array or value of member.
+            // In this way we can get the correct state on ObjectFinish or ArrayFinish by frame pop.
+            IterativeParsingState n = src;
+            if (src == IterativeParsingArrayInitialState || src == IterativeParsingElementDelimiterState)
+                n = IterativeParsingElementState;
+            else if (src == IterativeParsingKeyValueDelimiterState)
+                n = IterativeParsingMemberValueState;
+            // Push current state.
+            *stack_.template Push<SizeType>(1) = n;
+            // Initialize and push the member/element count.
+            *stack_.template Push<SizeType>(1) = 0;
+            // Call handler
+            bool hr = (dst == IterativeParsingObjectInitialState) ? handler.StartObject() : handler.StartArray();
+            // On handler short circuits the parsing.
+            if (!hr) {
+                RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorTermination, is.Tell());
+                return IterativeParsingErrorState;
+            }
+            else {
+                is.Take();
+                return dst;
+            }
+        }
+
+        case IterativeParsingMemberKeyState:
+            ParseString<parseFlags>(is, handler, true);
+            if (HasParseError())
+                return IterativeParsingErrorState;
+            else
+                return dst;
+
+        case IterativeParsingKeyValueDelimiterState:
+            RAPIDJSON_ASSERT(token == ColonToken);
+            is.Take();
+            return dst;
+
+        case IterativeParsingMemberValueState:
+            // Must be non-compound value. Or it would be ObjectInitial or ArrayInitial state.
+            ParseValue<parseFlags>(is, handler);
+            if (HasParseError()) {
+                return IterativeParsingErrorState;
+            }
+            return dst;
+
+        case IterativeParsingElementState:
+            // Must be non-compound value. Or it would be ObjectInitial or ArrayInitial state.
+            ParseValue<parseFlags>(is, handler);
+            if (HasParseError()) {
+                return IterativeParsingErrorState;
+            }
+            return dst;
+
+        case IterativeParsingMemberDelimiterState:
+        case IterativeParsingElementDelimiterState:
+            is.Take();
+            // Update member/element count.
+            *stack_.template Top<SizeType>() = *stack_.template Top<SizeType>() + 1;
+            return dst;
+
+        case IterativeParsingObjectFinishState:
+        {
+            // Transit from delimiter is only allowed when trailing commas are enabled
+            if (!(parseFlags & kParseTrailingCommasFlag) && src == IterativeParsingMemberDelimiterState) {
+                RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorObjectMissName, is.Tell());
+                return IterativeParsingErrorState;
+            }
+            // Get member count.
+            SizeType c = *stack_.template Pop<SizeType>(1);
+            // If the object is not empty, count the last member.
+            if (src == IterativeParsingMemberValueState)
+                ++c;
+            // Restore the state.
+            IterativeParsingState n = static_cast<IterativeParsingState>(*stack_.template Pop<SizeType>(1));
+            // Transit to Finish state if this is the topmost scope.
+            if (n == IterativeParsingStartState)
+                n = IterativeParsingFinishState;
+            // Call handler
+            bool hr = handler.EndObject(c);
+            // On handler short circuits the parsing.
+            if (!hr) {
+                RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorTermination, is.Tell());
+                return IterativeParsingErrorState;
+            }
+            else {
+                is.Take();
+                return n;
+            }
+        }
+
+        case IterativeParsingArrayFinishState:
+        {
+            // Transit from delimiter is only allowed when trailing commas are enabled
+            if (!(parseFlags & kParseTrailingCommasFlag) && src == IterativeParsingElementDelimiterState) {
+                RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorValueInvalid, is.Tell());
+                return IterativeParsingErrorState;
+            }
+            // Get element count.
+            SizeType c = *stack_.template Pop<SizeType>(1);
+            // If the array is not empty, count the last element.
+            if (src == IterativeParsingElementState)
+                ++c;
+            // Restore the state.
+            IterativeParsingState n = static_cast<IterativeParsingState>(*stack_.template Pop<SizeType>(1));
+            // Transit to Finish state if this is the topmost scope.
+            if (n == IterativeParsingStartState)
+                n = IterativeParsingFinishState;
+            // Call handler
+            bool hr = handler.EndArray(c);
+            // On handler short circuits the parsing.
+            if (!hr) {
+                RAPIDJSON_PARSE_ERROR_NORETURN(kParseErrorTermination, is.Tell());
+                return IterativeParsingErrorState;
+            }
+            else {
+                is.Take();
+                return n;
+            }
+        }
+
+        default:
+            // This branch is for IterativeParsingValueState actually.
+            // Use `default:` rather than
+            // `case IterativeParsingValueState:` is for code coverage.
+
+            // The IterativeParsingStartState is not enumerated in this switch-case.
+            // It is impossible for that case. And it can be caught by following assertion.
+
+            // The IterativeParsingFinishState is not enumerated in this switch-case either.
+            // It is a "derivative" state which cannot triggered from Predict() directly.
+            // Therefore it cannot happen here. And it can be caught by following assertion.
+            RAPIDJSON_ASSERT(dst == IterativeParsingValueState);
+
+            // Must be non-compound value. Or it would be ObjectInitial or ArrayInitial state.
+            ParseValue<parseFlags>(is, handler);
+            if (HasParseError()) {
+                return IterativeParsingErrorState;
+            }
+            return IterativeParsingFinishState;
+        }
+    }
+
+    template <typename InputStream>
+    void HandleError(IterativeParsingState src, InputStream& is) {
+        if (HasParseError()) {
+            // Error flag has been set.
+            return;
+        }
+
+        switch (src) {
+        case IterativeParsingStartState:            RAPIDJSON_PARSE_ERROR(kParseErrorDocumentEmpty, is.Tell()); return;
+        case IterativeParsingFinishState:           RAPIDJSON_PARSE_ERROR(kParseErrorDocumentRootNotSingular, is.Tell()); return;
+        case IterativeParsingObjectInitialState:
+        case IterativeParsingMemberDelimiterState:  RAPIDJSON_PARSE_ERROR(kParseErrorObjectMissName, is.Tell()); return;
+        case IterativeParsingMemberKeyState:        RAPIDJSON_PARSE_ERROR(kParseErrorObjectMissColon, is.Tell()); return;
+        case IterativeParsingMemberValueState:      RAPIDJSON_PARSE_ERROR(kParseErrorObjectMissCommaOrCurlyBracket, is.Tell()); return;
+        case IterativeParsingKeyValueDelimiterState:
+        case IterativeParsingArrayInitialState:
+        case IterativeParsingElementDelimiterState: RAPIDJSON_PARSE_ERROR(kParseErrorValueInvalid, is.Tell()); return;
+        default: RAPIDJSON_ASSERT(src == IterativeParsingElementState); RAPIDJSON_PARSE_ERROR(kParseErrorArrayMissCommaOrSquareBracket, is.Tell()); return;
+        }
+    }
+
+    RAPIDJSON_FORCEINLINE bool IsIterativeParsingDelimiterState(IterativeParsingState s) const {
+        return s >= IterativeParsingElementDelimiterState;
+    }
+
+    RAPIDJSON_FORCEINLINE bool IsIterativeParsingCompleteState(IterativeParsingState s) const {
+        return s <= IterativeParsingErrorState;
+    }
+
+    template <unsigned parseFlags, typename InputStream, typename Handler>
+    ParseResult IterativeParse(InputStream& is, Handler& handler) {
+        parseResult_.Clear();
+        ClearStackOnExit scope(*this);
+        IterativeParsingState state = IterativeParsingStartState;
+
+        SkipWhitespaceAndComments<parseFlags>(is);
+        RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+        while (is.Peek() != '\0') {
+            Token t = Tokenize(is.Peek());
+            IterativeParsingState n = Predict(state, t);
+            IterativeParsingState d = Transit<parseFlags>(state, t, n, is, handler);
+
+            if (d == IterativeParsingErrorState) {
+                HandleError(state, is);
+                break;
+            }
+
+            state = d;
+
+            // Do not further consume streams if a root JSON has been parsed.
+            if ((parseFlags & kParseStopWhenDoneFlag) && state == IterativeParsingFinishState)
+                break;
+
+            SkipWhitespaceAndComments<parseFlags>(is);
+            RAPIDJSON_PARSE_ERROR_EARLY_RETURN(parseResult_);
+        }
+
+        // Handle the end of file.
+        if (state != IterativeParsingFinishState)
+            HandleError(state, is);
+
+        return parseResult_;
+    }
+
+    static const size_t kDefaultStackCapacity = 256;    //!< Default stack capacity in bytes for storing a single decoded string.
+    internal::Stack<StackAllocator> stack_;  //!< A stack for storing decoded string temporarily during non-destructive parsing.
+    ParseResult parseResult_;
+    IterativeParsingState state_;
+}; // class GenericReader
+
+//! Reader with UTF8 encoding and default allocator.
+typedef GenericReader<UTF8<>, UTF8<> > Reader;
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__) || defined(_MSC_VER)
+RAPIDJSON_DIAG_POP
+#endif
+
+
+#ifdef __GNUC__
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_READER_H_
diff --git a/General/General/include/rapidjson/schema.h b/General/General/include/rapidjson/schema.h
new file mode 100644
index 0000000..188d659
--- /dev/null
+++ b/General/General/include/rapidjson/schema.h
@@ -0,0 +1,2816 @@
+// Tencent is pleased to support the open source community by making RapidJSON available->
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip-> All rights reserved->
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License-> You may obtain a copy of the License at
+//
+// http://opensource->org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied-> See the License for the 
+// specific language governing permissions and limitations under the License->
+
+#ifndef RAPIDJSON_SCHEMA_H_
+#define RAPIDJSON_SCHEMA_H_
+
+#include "document.h"
+#include "pointer.h"
+#include "stringbuffer.h"
+#include "error/en.h"
+#include "uri.h"
+#include <cmath> // abs, floor
+
+#if !defined(RAPIDJSON_SCHEMA_USE_INTERNALREGEX)
+#define RAPIDJSON_SCHEMA_USE_INTERNALREGEX 1
+#else
+#define RAPIDJSON_SCHEMA_USE_INTERNALREGEX 0
+#endif
+
+#if !RAPIDJSON_SCHEMA_USE_INTERNALREGEX && defined(RAPIDJSON_SCHEMA_USE_STDREGEX) && (__cplusplus >=201103L || (defined(_MSC_VER) && _MSC_VER >= 1800))
+#define RAPIDJSON_SCHEMA_USE_STDREGEX 1
+#else
+#define RAPIDJSON_SCHEMA_USE_STDREGEX 0
+#endif
+
+#if RAPIDJSON_SCHEMA_USE_INTERNALREGEX
+#include "internal/regex.h"
+#elif RAPIDJSON_SCHEMA_USE_STDREGEX
+#include <regex>
+#endif
+
+#if RAPIDJSON_SCHEMA_USE_INTERNALREGEX || RAPIDJSON_SCHEMA_USE_STDREGEX
+#define RAPIDJSON_SCHEMA_HAS_REGEX 1
+#else
+#define RAPIDJSON_SCHEMA_HAS_REGEX 0
+#endif
+
+#ifndef RAPIDJSON_SCHEMA_VERBOSE
+#define RAPIDJSON_SCHEMA_VERBOSE 0
+#endif
+
+#if RAPIDJSON_SCHEMA_VERBOSE
+#include "stringbuffer.h"
+#endif
+
+RAPIDJSON_DIAG_PUSH
+
+#if defined(__GNUC__)
+RAPIDJSON_DIAG_OFF(effc++)
+#endif
+
+#ifdef __clang__
+RAPIDJSON_DIAG_OFF(weak-vtables)
+RAPIDJSON_DIAG_OFF(exit-time-destructors)
+RAPIDJSON_DIAG_OFF(c++98-compat-pedantic)
+RAPIDJSON_DIAG_OFF(variadic-macros)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_OFF(4512) // assignment operator could not be generated
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// Verbose Utilities
+
+#if RAPIDJSON_SCHEMA_VERBOSE
+
+namespace internal {
+
+inline void PrintInvalidKeyword(const char* keyword) {
+    printf("Fail keyword: %s\n", keyword);
+}
+
+inline void PrintInvalidKeyword(const wchar_t* keyword) {
+    wprintf(L"Fail keyword: %ls\n", keyword);
+}
+
+inline void PrintInvalidDocument(const char* document) {
+    printf("Fail document: %s\n\n", document);
+}
+
+inline void PrintInvalidDocument(const wchar_t* document) {
+    wprintf(L"Fail document: %ls\n\n", document);
+}
+
+inline void PrintValidatorPointers(unsigned depth, const char* s, const char* d) {
+    printf("S: %*s%s\nD: %*s%s\n\n", depth * 4, " ", s, depth * 4, " ", d);
+}
+
+inline void PrintValidatorPointers(unsigned depth, const wchar_t* s, const wchar_t* d) {
+    wprintf(L"S: %*ls%ls\nD: %*ls%ls\n\n", depth * 4, L" ", s, depth * 4, L" ", d);
+}
+
+} // namespace internal
+
+#endif // RAPIDJSON_SCHEMA_VERBOSE
+
+///////////////////////////////////////////////////////////////////////////////
+// RAPIDJSON_INVALID_KEYWORD_RETURN
+
+#if RAPIDJSON_SCHEMA_VERBOSE
+#define RAPIDJSON_INVALID_KEYWORD_VERBOSE(keyword) internal::PrintInvalidKeyword(keyword)
+#else
+#define RAPIDJSON_INVALID_KEYWORD_VERBOSE(keyword)
+#endif
+
+#define RAPIDJSON_INVALID_KEYWORD_RETURN(code)\
+RAPIDJSON_MULTILINEMACRO_BEGIN\
+    context.invalidCode = code;\
+    context.invalidKeyword = SchemaType::GetValidateErrorKeyword(code).GetString();\
+    RAPIDJSON_INVALID_KEYWORD_VERBOSE(context.invalidKeyword);\
+    return false;\
+RAPIDJSON_MULTILINEMACRO_END
+
+///////////////////////////////////////////////////////////////////////////////
+// ValidateFlag
+
+/*! \def RAPIDJSON_VALIDATE_DEFAULT_FLAGS
+    \ingroup RAPIDJSON_CONFIG
+    \brief User-defined kValidateDefaultFlags definition.
+
+    User can define this as any \c ValidateFlag combinations.
+*/
+#ifndef RAPIDJSON_VALIDATE_DEFAULT_FLAGS
+#define RAPIDJSON_VALIDATE_DEFAULT_FLAGS kValidateNoFlags
+#endif
+
+//! Combination of validate flags
+/*! \see
+ */
+enum ValidateFlag {
+    kValidateNoFlags = 0,                                       //!< No flags are set.
+    kValidateContinueOnErrorFlag = 1,                           //!< Don't stop after first validation error.
+    kValidateDefaultFlags = RAPIDJSON_VALIDATE_DEFAULT_FLAGS    //!< Default validate flags. Can be customized by defining RAPIDJSON_VALIDATE_DEFAULT_FLAGS
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// Forward declarations
+
+template <typename ValueType, typename Allocator>
+class GenericSchemaDocument;
+
+namespace internal {
+
+template <typename SchemaDocumentType>
+class Schema;
+
+///////////////////////////////////////////////////////////////////////////////
+// ISchemaValidator
+
+class ISchemaValidator {
+public:
+    virtual ~ISchemaValidator() {}
+    virtual bool IsValid() const = 0;
+    virtual void SetValidateFlags(unsigned flags) = 0;
+    virtual unsigned GetValidateFlags() const = 0;
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// ISchemaStateFactory
+
+template <typename SchemaType>
+class ISchemaStateFactory {
+public:
+    virtual ~ISchemaStateFactory() {}
+    virtual ISchemaValidator* CreateSchemaValidator(const SchemaType&, const bool inheritContinueOnErrors) = 0;
+    virtual void DestroySchemaValidator(ISchemaValidator* validator) = 0;
+    virtual void* CreateHasher() = 0;
+    virtual uint64_t GetHashCode(void* hasher) = 0;
+    virtual void DestroryHasher(void* hasher) = 0;
+    virtual void* MallocState(size_t size) = 0;
+    virtual void FreeState(void* p) = 0;
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// IValidationErrorHandler
+
+template <typename SchemaType>
+class IValidationErrorHandler {
+public:
+    typedef typename SchemaType::Ch Ch;
+    typedef typename SchemaType::SValue SValue;
+
+    virtual ~IValidationErrorHandler() {}
+
+    virtual void NotMultipleOf(int64_t actual, const SValue& expected) = 0;
+    virtual void NotMultipleOf(uint64_t actual, const SValue& expected) = 0;
+    virtual void NotMultipleOf(double actual, const SValue& expected) = 0;
+    virtual void AboveMaximum(int64_t actual, const SValue& expected, bool exclusive) = 0;
+    virtual void AboveMaximum(uint64_t actual, const SValue& expected, bool exclusive) = 0;
+    virtual void AboveMaximum(double actual, const SValue& expected, bool exclusive) = 0;
+    virtual void BelowMinimum(int64_t actual, const SValue& expected, bool exclusive) = 0;
+    virtual void BelowMinimum(uint64_t actual, const SValue& expected, bool exclusive) = 0;
+    virtual void BelowMinimum(double actual, const SValue& expected, bool exclusive) = 0;
+
+    virtual void TooLong(const Ch* str, SizeType length, SizeType expected) = 0;
+    virtual void TooShort(const Ch* str, SizeType length, SizeType expected) = 0;
+    virtual void DoesNotMatch(const Ch* str, SizeType length) = 0;
+
+    virtual void DisallowedItem(SizeType index) = 0;
+    virtual void TooFewItems(SizeType actualCount, SizeType expectedCount) = 0;
+    virtual void TooManyItems(SizeType actualCount, SizeType expectedCount) = 0;
+    virtual void DuplicateItems(SizeType index1, SizeType index2) = 0;
+
+    virtual void TooManyProperties(SizeType actualCount, SizeType expectedCount) = 0;
+    virtual void TooFewProperties(SizeType actualCount, SizeType expectedCount) = 0;
+    virtual void StartMissingProperties() = 0;
+    virtual void AddMissingProperty(const SValue& name) = 0;
+    virtual bool EndMissingProperties() = 0;
+    virtual void PropertyViolations(ISchemaValidator** subvalidators, SizeType count) = 0;
+    virtual void DisallowedProperty(const Ch* name, SizeType length) = 0;
+
+    virtual void StartDependencyErrors() = 0;
+    virtual void StartMissingDependentProperties() = 0;
+    virtual void AddMissingDependentProperty(const SValue& targetName) = 0;
+    virtual void EndMissingDependentProperties(const SValue& sourceName) = 0;
+    virtual void AddDependencySchemaError(const SValue& souceName, ISchemaValidator* subvalidator) = 0;
+    virtual bool EndDependencyErrors() = 0;
+
+    virtual void DisallowedValue(const ValidateErrorCode code) = 0;
+    virtual void StartDisallowedType() = 0;
+    virtual void AddExpectedType(const typename SchemaType::ValueType& expectedType) = 0;
+    virtual void EndDisallowedType(const typename SchemaType::ValueType& actualType) = 0;
+    virtual void NotAllOf(ISchemaValidator** subvalidators, SizeType count) = 0;
+    virtual void NoneOf(ISchemaValidator** subvalidators, SizeType count) = 0;
+    virtual void NotOneOf(ISchemaValidator** subvalidators, SizeType count, bool matched) = 0;
+    virtual void Disallowed() = 0;
+};
+
+
+///////////////////////////////////////////////////////////////////////////////
+// Hasher
+
+// For comparison of compound value
+template<typename Encoding, typename Allocator>
+class Hasher {
+public:
+    typedef typename Encoding::Ch Ch;
+
+    Hasher(Allocator* allocator = 0, size_t stackCapacity = kDefaultSize) : stack_(allocator, stackCapacity) {}
+
+    bool Null() { return WriteType(kNullType); }
+    bool Bool(bool b) { return WriteType(b ? kTrueType : kFalseType); }
+    bool Int(int i) { Number n; n.u.i = i; n.d = static_cast<double>(i); return WriteNumber(n); }
+    bool Uint(unsigned u) { Number n; n.u.u = u; n.d = static_cast<double>(u); return WriteNumber(n); }
+    bool Int64(int64_t i) { Number n; n.u.i = i; n.d = static_cast<double>(i); return WriteNumber(n); }
+    bool Uint64(uint64_t u) { Number n; n.u.u = u; n.d = static_cast<double>(u); return WriteNumber(n); }
+    bool Double(double d) { 
+        Number n; 
+        if (d < 0) n.u.i = static_cast<int64_t>(d);
+        else       n.u.u = static_cast<uint64_t>(d); 
+        n.d = d;
+        return WriteNumber(n);
+    }
+
+    bool RawNumber(const Ch* str, SizeType len, bool) {
+        WriteBuffer(kNumberType, str, len * sizeof(Ch));
+        return true;
+    }
+
+    bool String(const Ch* str, SizeType len, bool) {
+        WriteBuffer(kStringType, str, len * sizeof(Ch));
+        return true;
+    }
+
+    bool StartObject() { return true; }
+    bool Key(const Ch* str, SizeType len, bool copy) { return String(str, len, copy); }
+    bool EndObject(SizeType memberCount) { 
+        uint64_t h = Hash(0, kObjectType);
+        uint64_t* kv = stack_.template Pop<uint64_t>(memberCount * 2);
+        for (SizeType i = 0; i < memberCount; i++)
+            h ^= Hash(kv[i * 2], kv[i * 2 + 1]);  // Use xor to achieve member order insensitive
+        *stack_.template Push<uint64_t>() = h;
+        return true;
+    }
+    
+    bool StartArray() { return true; }
+    bool EndArray(SizeType elementCount) { 
+        uint64_t h = Hash(0, kArrayType);
+        uint64_t* e = stack_.template Pop<uint64_t>(elementCount);
+        for (SizeType i = 0; i < elementCount; i++)
+            h = Hash(h, e[i]); // Use hash to achieve element order sensitive
+        *stack_.template Push<uint64_t>() = h;
+        return true;
+    }
+
+    bool IsValid() const { return stack_.GetSize() == sizeof(uint64_t); }
+
+    uint64_t GetHashCode() const {
+        RAPIDJSON_ASSERT(IsValid());
+        return *stack_.template Top<uint64_t>();
+    }
+
+private:
+    static const size_t kDefaultSize = 256;
+    struct Number {
+        union U {
+            uint64_t u;
+            int64_t i;
+        }u;
+        double d;
+    };
+
+    bool WriteType(Type type) { return WriteBuffer(type, 0, 0); }
+    
+    bool WriteNumber(const Number& n) { return WriteBuffer(kNumberType, &n, sizeof(n)); }
+    
+    bool WriteBuffer(Type type, const void* data, size_t len) {
+        // FNV-1a from http://isthe.com/chongo/tech/comp/fnv/
+        uint64_t h = Hash(RAPIDJSON_UINT64_C2(0x84222325, 0xcbf29ce4), type);
+        const unsigned char* d = static_cast<const unsigned char*>(data);
+        for (size_t i = 0; i < len; i++)
+            h = Hash(h, d[i]);
+        *stack_.template Push<uint64_t>() = h;
+        return true;
+    }
+
+    static uint64_t Hash(uint64_t h, uint64_t d) {
+        static const uint64_t kPrime = RAPIDJSON_UINT64_C2(0x00000100, 0x000001b3);
+        h ^= d;
+        h *= kPrime;
+        return h;
+    }
+
+    Stack<Allocator> stack_;
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// SchemaValidationContext
+
+template <typename SchemaDocumentType>
+struct SchemaValidationContext {
+    typedef Schema<SchemaDocumentType> SchemaType;
+    typedef ISchemaStateFactory<SchemaType> SchemaValidatorFactoryType;
+    typedef IValidationErrorHandler<SchemaType> ErrorHandlerType;
+    typedef typename SchemaType::ValueType ValueType;
+    typedef typename ValueType::Ch Ch;
+
+    enum PatternValidatorType {
+        kPatternValidatorOnly,
+        kPatternValidatorWithProperty,
+        kPatternValidatorWithAdditionalProperty
+    };
+
+    SchemaValidationContext(SchemaValidatorFactoryType& f, ErrorHandlerType& eh, const SchemaType* s) :
+        factory(f),
+        error_handler(eh),
+        schema(s),
+        valueSchema(),
+        invalidKeyword(),
+        invalidCode(),
+        hasher(),
+        arrayElementHashCodes(),
+        validators(),
+        validatorCount(),
+        patternPropertiesValidators(),
+        patternPropertiesValidatorCount(),
+        patternPropertiesSchemas(),
+        patternPropertiesSchemaCount(),
+        valuePatternValidatorType(kPatternValidatorOnly),
+        propertyExist(),
+        inArray(false),
+        valueUniqueness(false),
+        arrayUniqueness(false)
+    {
+    }
+
+    ~SchemaValidationContext() {
+        if (hasher)
+            factory.DestroryHasher(hasher);
+        if (validators) {
+            for (SizeType i = 0; i < validatorCount; i++) {
+                if (validators[i]) {
+                    factory.DestroySchemaValidator(validators[i]);
+                }
+            }
+            factory.FreeState(validators);
+        }
+        if (patternPropertiesValidators) {
+            for (SizeType i = 0; i < patternPropertiesValidatorCount; i++) {
+                if (patternPropertiesValidators[i]) {
+                    factory.DestroySchemaValidator(patternPropertiesValidators[i]);
+                }
+            }
+            factory.FreeState(patternPropertiesValidators);
+        }
+        if (patternPropertiesSchemas)
+            factory.FreeState(patternPropertiesSchemas);
+        if (propertyExist)
+            factory.FreeState(propertyExist);
+    }
+
+    SchemaValidatorFactoryType& factory;
+    ErrorHandlerType& error_handler;
+    const SchemaType* schema;
+    const SchemaType* valueSchema;
+    const Ch* invalidKeyword;
+    ValidateErrorCode invalidCode;
+    void* hasher; // Only validator access
+    void* arrayElementHashCodes; // Only validator access this
+    ISchemaValidator** validators;
+    SizeType validatorCount;
+    ISchemaValidator** patternPropertiesValidators;
+    SizeType patternPropertiesValidatorCount;
+    const SchemaType** patternPropertiesSchemas;
+    SizeType patternPropertiesSchemaCount;
+    PatternValidatorType valuePatternValidatorType;
+    PatternValidatorType objectPatternValidatorType;
+    SizeType arrayElementIndex;
+    bool* propertyExist;
+    bool inArray;
+    bool valueUniqueness;
+    bool arrayUniqueness;
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// Schema
+
+template <typename SchemaDocumentType>
+class Schema {
+public:
+    typedef typename SchemaDocumentType::ValueType ValueType;
+    typedef typename SchemaDocumentType::AllocatorType AllocatorType;
+    typedef typename SchemaDocumentType::PointerType PointerType;
+    typedef typename ValueType::EncodingType EncodingType;
+    typedef typename EncodingType::Ch Ch;
+    typedef SchemaValidationContext<SchemaDocumentType> Context;
+    typedef Schema<SchemaDocumentType> SchemaType;
+    typedef GenericValue<EncodingType, AllocatorType> SValue;
+    typedef IValidationErrorHandler<Schema> ErrorHandler;
+    typedef GenericUri<ValueType, AllocatorType> UriType;
+    friend class GenericSchemaDocument<ValueType, AllocatorType>;
+
+    Schema(SchemaDocumentType* schemaDocument, const PointerType& p, const ValueType& value, const ValueType& document, AllocatorType* allocator, const UriType& id = UriType()) :
+        allocator_(allocator),
+        uri_(schemaDocument->GetURI(), *allocator),
+        id_(id),
+        pointer_(p, allocator),
+        typeless_(schemaDocument->GetTypeless()),
+        enum_(),
+        enumCount_(),
+        not_(),
+        type_((1 << kTotalSchemaType) - 1), // typeless
+        validatorCount_(),
+        notValidatorIndex_(),
+        properties_(),
+        additionalPropertiesSchema_(),
+        patternProperties_(),
+        patternPropertyCount_(),
+        propertyCount_(),
+        minProperties_(),
+        maxProperties_(SizeType(~0)),
+        additionalProperties_(true),
+        hasDependencies_(),
+        hasRequired_(),
+        hasSchemaDependencies_(),
+        additionalItemsSchema_(),
+        itemsList_(),
+        itemsTuple_(),
+        itemsTupleCount_(),
+        minItems_(),
+        maxItems_(SizeType(~0)),
+        additionalItems_(true),
+        uniqueItems_(false),
+        pattern_(),
+        minLength_(0),
+        maxLength_(~SizeType(0)),
+        exclusiveMinimum_(false),
+        exclusiveMaximum_(false),
+        defaultValueLength_(0)
+    {
+        typedef typename ValueType::ConstValueIterator ConstValueIterator;
+        typedef typename ValueType::ConstMemberIterator ConstMemberIterator;
+
+        // PR #1393
+        // Early add this Schema and its $ref(s) in schemaDocument's map to avoid infinite
+        // recursion (with recursive schemas), since schemaDocument->getSchema() is always
+        // checked before creating a new one. Don't cache typeless_, though.
+        if (this != typeless_) {
+          typedef typename SchemaDocumentType::SchemaEntry SchemaEntry;
+          SchemaEntry *entry = schemaDocument->schemaMap_.template Push<SchemaEntry>();
+          new (entry) SchemaEntry(pointer_, this, true, allocator_);
+          schemaDocument->AddSchemaRefs(this);
+        }
+
+        if (!value.IsObject())
+            return;
+
+        // If we have an id property, resolve it with the in-scope id
+        if (const ValueType* v = GetMember(value, GetIdString())) {
+            if (v->IsString()) {
+                UriType local(*v, allocator);
+                id_ = local.Resolve(id_, allocator);
+            }
+        }
+
+        if (const ValueType* v = GetMember(value, GetTypeString())) {
+            type_ = 0;
+            if (v->IsString())
+                AddType(*v);
+            else if (v->IsArray())
+                for (ConstValueIterator itr = v->Begin(); itr != v->End(); ++itr)
+                    AddType(*itr);
+        }
+
+        if (const ValueType* v = GetMember(value, GetEnumString())) {
+            if (v->IsArray() && v->Size() > 0) {
+                enum_ = static_cast<uint64_t*>(allocator_->Malloc(sizeof(uint64_t) * v->Size()));
+                for (ConstValueIterator itr = v->Begin(); itr != v->End(); ++itr) {
+                    typedef Hasher<EncodingType, MemoryPoolAllocator<> > EnumHasherType;
+                    char buffer[256u + 24];
+                    MemoryPoolAllocator<> hasherAllocator(buffer, sizeof(buffer));
+                    EnumHasherType h(&hasherAllocator, 256);
+                    itr->Accept(h);
+                    enum_[enumCount_++] = h.GetHashCode();
+                }
+            }
+        }
+
+        if (schemaDocument) {
+            AssignIfExist(allOf_, *schemaDocument, p, value, GetAllOfString(), document);
+            AssignIfExist(anyOf_, *schemaDocument, p, value, GetAnyOfString(), document);
+            AssignIfExist(oneOf_, *schemaDocument, p, value, GetOneOfString(), document);
+
+            if (const ValueType* v = GetMember(value, GetNotString())) {
+                schemaDocument->CreateSchema(&not_, p.Append(GetNotString(), allocator_), *v, document, id_);
+                notValidatorIndex_ = validatorCount_;
+                validatorCount_++;
+            }
+        }
+
+        // Object
+
+        const ValueType* properties = GetMember(value, GetPropertiesString());
+        const ValueType* required = GetMember(value, GetRequiredString());
+        const ValueType* dependencies = GetMember(value, GetDependenciesString());
+        {
+            // Gather properties from properties/required/dependencies
+            SValue allProperties(kArrayType);
+
+            if (properties && properties->IsObject())
+                for (ConstMemberIterator itr = properties->MemberBegin(); itr != properties->MemberEnd(); ++itr)
+                    AddUniqueElement(allProperties, itr->name);
+
+            if (required && required->IsArray())
+                for (ConstValueIterator itr = required->Begin(); itr != required->End(); ++itr)
+                    if (itr->IsString())
+                        AddUniqueElement(allProperties, *itr);
+
+            if (dependencies && dependencies->IsObject())
+                for (ConstMemberIterator itr = dependencies->MemberBegin(); itr != dependencies->MemberEnd(); ++itr) {
+                    AddUniqueElement(allProperties, itr->name);
+                    if (itr->value.IsArray())
+                        for (ConstValueIterator i = itr->value.Begin(); i != itr->value.End(); ++i)
+                            if (i->IsString())
+                                AddUniqueElement(allProperties, *i);
+                }
+
+            if (allProperties.Size() > 0) {
+                propertyCount_ = allProperties.Size();
+                properties_ = static_cast<Property*>(allocator_->Malloc(sizeof(Property) * propertyCount_));
+                for (SizeType i = 0; i < propertyCount_; i++) {
+                    new (&properties_[i]) Property();
+                    properties_[i].name = allProperties[i];
+                    properties_[i].schema = typeless_;
+                }
+            }
+        }
+
+        if (properties && properties->IsObject()) {
+            PointerType q = p.Append(GetPropertiesString(), allocator_);
+            for (ConstMemberIterator itr = properties->MemberBegin(); itr != properties->MemberEnd(); ++itr) {
+                SizeType index;
+                if (FindPropertyIndex(itr->name, &index))
+                    schemaDocument->CreateSchema(&properties_[index].schema, q.Append(itr->name, allocator_), itr->value, document, id_);
+            }
+        }
+
+        if (const ValueType* v = GetMember(value, GetPatternPropertiesString())) {
+            PointerType q = p.Append(GetPatternPropertiesString(), allocator_);
+            patternProperties_ = static_cast<PatternProperty*>(allocator_->Malloc(sizeof(PatternProperty) * v->MemberCount()));
+            patternPropertyCount_ = 0;
+
+            for (ConstMemberIterator itr = v->MemberBegin(); itr != v->MemberEnd(); ++itr) {
+                new (&patternProperties_[patternPropertyCount_]) PatternProperty();
+                patternProperties_[patternPropertyCount_].pattern = CreatePattern(itr->name);
+                schemaDocument->CreateSchema(&patternProperties_[patternPropertyCount_].schema, q.Append(itr->name, allocator_), itr->value, document, id_);
+                patternPropertyCount_++;
+            }
+        }
+
+        if (required && required->IsArray())
+            for (ConstValueIterator itr = required->Begin(); itr != required->End(); ++itr)
+                if (itr->IsString()) {
+                    SizeType index;
+                    if (FindPropertyIndex(*itr, &index)) {
+                        properties_[index].required = true;
+                        hasRequired_ = true;
+                    }
+                }
+
+        if (dependencies && dependencies->IsObject()) {
+            PointerType q = p.Append(GetDependenciesString(), allocator_);
+            hasDependencies_ = true;
+            for (ConstMemberIterator itr = dependencies->MemberBegin(); itr != dependencies->MemberEnd(); ++itr) {
+                SizeType sourceIndex;
+                if (FindPropertyIndex(itr->name, &sourceIndex)) {
+                    if (itr->value.IsArray()) {
+                        properties_[sourceIndex].dependencies = static_cast<bool*>(allocator_->Malloc(sizeof(bool) * propertyCount_));
+                        std::memset(properties_[sourceIndex].dependencies, 0, sizeof(bool)* propertyCount_);
+                        for (ConstValueIterator targetItr = itr->value.Begin(); targetItr != itr->value.End(); ++targetItr) {
+                            SizeType targetIndex;
+                            if (FindPropertyIndex(*targetItr, &targetIndex))
+                                properties_[sourceIndex].dependencies[targetIndex] = true;
+                        }
+                    }
+                    else if (itr->value.IsObject()) {
+                        hasSchemaDependencies_ = true;
+                        schemaDocument->CreateSchema(&properties_[sourceIndex].dependenciesSchema, q.Append(itr->name, allocator_), itr->value, document, id_);
+                        properties_[sourceIndex].dependenciesValidatorIndex = validatorCount_;
+                        validatorCount_++;
+                    }
+                }
+            }
+        }
+
+        if (const ValueType* v = GetMember(value, GetAdditionalPropertiesString())) {
+            if (v->IsBool())
+                additionalProperties_ = v->GetBool();
+            else if (v->IsObject())
+                schemaDocument->CreateSchema(&additionalPropertiesSchema_, p.Append(GetAdditionalPropertiesString(), allocator_), *v, document, id_);
+        }
+
+        AssignIfExist(minProperties_, value, GetMinPropertiesString());
+        AssignIfExist(maxProperties_, value, GetMaxPropertiesString());
+
+        // Array
+        if (const ValueType* v = GetMember(value, GetItemsString())) {
+            PointerType q = p.Append(GetItemsString(), allocator_);
+            if (v->IsObject()) // List validation
+                schemaDocument->CreateSchema(&itemsList_, q, *v, document, id_);
+            else if (v->IsArray()) { // Tuple validation
+                itemsTuple_ = static_cast<const Schema**>(allocator_->Malloc(sizeof(const Schema*) * v->Size()));
+                SizeType index = 0;
+                for (ConstValueIterator itr = v->Begin(); itr != v->End(); ++itr, index++)
+                    schemaDocument->CreateSchema(&itemsTuple_[itemsTupleCount_++], q.Append(index, allocator_), *itr, document, id_);
+            }
+        }
+
+        AssignIfExist(minItems_, value, GetMinItemsString());
+        AssignIfExist(maxItems_, value, GetMaxItemsString());
+
+        if (const ValueType* v = GetMember(value, GetAdditionalItemsString())) {
+            if (v->IsBool())
+                additionalItems_ = v->GetBool();
+            else if (v->IsObject())
+                schemaDocument->CreateSchema(&additionalItemsSchema_, p.Append(GetAdditionalItemsString(), allocator_), *v, document, id_);
+        }
+
+        AssignIfExist(uniqueItems_, value, GetUniqueItemsString());
+
+        // String
+        AssignIfExist(minLength_, value, GetMinLengthString());
+        AssignIfExist(maxLength_, value, GetMaxLengthString());
+
+        if (const ValueType* v = GetMember(value, GetPatternString()))
+            pattern_ = CreatePattern(*v);
+
+        // Number
+        if (const ValueType* v = GetMember(value, GetMinimumString()))
+            if (v->IsNumber())
+                minimum_.CopyFrom(*v, *allocator_);
+
+        if (const ValueType* v = GetMember(value, GetMaximumString()))
+            if (v->IsNumber())
+                maximum_.CopyFrom(*v, *allocator_);
+
+        AssignIfExist(exclusiveMinimum_, value, GetExclusiveMinimumString());
+        AssignIfExist(exclusiveMaximum_, value, GetExclusiveMaximumString());
+
+        if (const ValueType* v = GetMember(value, GetMultipleOfString()))
+            if (v->IsNumber() && v->GetDouble() > 0.0)
+                multipleOf_.CopyFrom(*v, *allocator_);
+
+        // Default
+        if (const ValueType* v = GetMember(value, GetDefaultValueString()))
+            if (v->IsString())
+                defaultValueLength_ = v->GetStringLength();
+
+    }
+
+    ~Schema() {
+        AllocatorType::Free(enum_);
+        if (properties_) {
+            for (SizeType i = 0; i < propertyCount_; i++)
+                properties_[i].~Property();
+            AllocatorType::Free(properties_);
+        }
+        if (patternProperties_) {
+            for (SizeType i = 0; i < patternPropertyCount_; i++)
+                patternProperties_[i].~PatternProperty();
+            AllocatorType::Free(patternProperties_);
+        }
+        AllocatorType::Free(itemsTuple_);
+#if RAPIDJSON_SCHEMA_HAS_REGEX
+        if (pattern_) {
+            pattern_->~RegexType();
+            AllocatorType::Free(pattern_);
+        }
+#endif
+    }
+
+    const SValue& GetURI() const {
+        return uri_;
+    }
+
+    const UriType& GetId() const {
+        return id_;
+    }
+
+    const PointerType& GetPointer() const {
+        return pointer_;
+    }
+
+    bool BeginValue(Context& context) const {
+        if (context.inArray) {
+            if (uniqueItems_)
+                context.valueUniqueness = true;
+
+            if (itemsList_)
+                context.valueSchema = itemsList_;
+            else if (itemsTuple_) {
+                if (context.arrayElementIndex < itemsTupleCount_)
+                    context.valueSchema = itemsTuple_[context.arrayElementIndex];
+                else if (additionalItemsSchema_)
+                    context.valueSchema = additionalItemsSchema_;
+                else if (additionalItems_)
+                    context.valueSchema = typeless_;
+                else {
+                    context.error_handler.DisallowedItem(context.arrayElementIndex);
+                    // Must set valueSchema for when kValidateContinueOnErrorFlag is set, else reports spurious type error
+                    context.valueSchema = typeless_;
+                    // Must bump arrayElementIndex for when kValidateContinueOnErrorFlag is set
+                    context.arrayElementIndex++;
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorAdditionalItems);
+                }
+            }
+            else
+                context.valueSchema = typeless_;
+
+            context.arrayElementIndex++;
+        }
+        return true;
+    }
+
+    RAPIDJSON_FORCEINLINE bool EndValue(Context& context) const {
+        // Only check pattern properties if we have validators
+        if (context.patternPropertiesValidatorCount > 0) {
+            bool otherValid = false;
+            SizeType count = context.patternPropertiesValidatorCount;
+            if (context.objectPatternValidatorType != Context::kPatternValidatorOnly)
+                otherValid = context.patternPropertiesValidators[--count]->IsValid();
+
+            bool patternValid = true;
+            for (SizeType i = 0; i < count; i++)
+                if (!context.patternPropertiesValidators[i]->IsValid()) {
+                    patternValid = false;
+                    break;
+                }
+
+            if (context.objectPatternValidatorType == Context::kPatternValidatorOnly) {
+                if (!patternValid) {
+                    context.error_handler.PropertyViolations(context.patternPropertiesValidators, count);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorPatternProperties);
+                }
+            }
+            else if (context.objectPatternValidatorType == Context::kPatternValidatorWithProperty) {
+                if (!patternValid || !otherValid) {
+                    context.error_handler.PropertyViolations(context.patternPropertiesValidators, count + 1);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorPatternProperties);
+                }
+            }
+            else if (!patternValid && !otherValid) { // kPatternValidatorWithAdditionalProperty)
+                context.error_handler.PropertyViolations(context.patternPropertiesValidators, count + 1);
+                RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorPatternProperties);
+            }
+        }
+
+        // For enums only check if we have a hasher
+        if (enum_ && context.hasher) {
+            const uint64_t h = context.factory.GetHashCode(context.hasher);
+            for (SizeType i = 0; i < enumCount_; i++)
+                if (enum_[i] == h)
+                    goto foundEnum;
+            context.error_handler.DisallowedValue(kValidateErrorEnum);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorEnum);
+            foundEnum:;
+        }
+
+        // Only check allOf etc if we have validators
+        if (context.validatorCount > 0) {
+            if (allOf_.schemas)
+                for (SizeType i = allOf_.begin; i < allOf_.begin + allOf_.count; i++)
+                    if (!context.validators[i]->IsValid()) {
+                        context.error_handler.NotAllOf(&context.validators[allOf_.begin], allOf_.count);
+                        RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorAllOf);
+                    }
+
+            if (anyOf_.schemas) {
+                for (SizeType i = anyOf_.begin; i < anyOf_.begin + anyOf_.count; i++)
+                    if (context.validators[i]->IsValid())
+                        goto foundAny;
+                context.error_handler.NoneOf(&context.validators[anyOf_.begin], anyOf_.count);
+                RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorAnyOf);
+                foundAny:;
+            }
+
+            if (oneOf_.schemas) {
+                bool oneValid = false;
+                for (SizeType i = oneOf_.begin; i < oneOf_.begin + oneOf_.count; i++)
+                    if (context.validators[i]->IsValid()) {
+                        if (oneValid) {
+                            context.error_handler.NotOneOf(&context.validators[oneOf_.begin], oneOf_.count, true);
+                            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorOneOfMatch);
+                        } else
+                            oneValid = true;
+                    }
+                if (!oneValid) {
+                    context.error_handler.NotOneOf(&context.validators[oneOf_.begin], oneOf_.count, false);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorOneOf);
+                }
+            }
+
+            if (not_ && context.validators[notValidatorIndex_]->IsValid()) {
+                context.error_handler.Disallowed();
+                RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorNot);
+            }
+        }
+
+        return true;
+    }
+
+    bool Null(Context& context) const {
+        if (!(type_ & (1 << kNullSchemaType))) {
+            DisallowedType(context, GetNullString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+        return CreateParallelValidator(context);
+    }
+
+    bool Bool(Context& context, bool) const {
+        if (!(type_ & (1 << kBooleanSchemaType))) {
+            DisallowedType(context, GetBooleanString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+        return CreateParallelValidator(context);
+    }
+
+    bool Int(Context& context, int i) const {
+        if (!CheckInt(context, i))
+            return false;
+        return CreateParallelValidator(context);
+    }
+
+    bool Uint(Context& context, unsigned u) const {
+        if (!CheckUint(context, u))
+            return false;
+        return CreateParallelValidator(context);
+    }
+
+    bool Int64(Context& context, int64_t i) const {
+        if (!CheckInt(context, i))
+            return false;
+        return CreateParallelValidator(context);
+    }
+
+    bool Uint64(Context& context, uint64_t u) const {
+        if (!CheckUint(context, u))
+            return false;
+        return CreateParallelValidator(context);
+    }
+
+    bool Double(Context& context, double d) const {
+        if (!(type_ & (1 << kNumberSchemaType))) {
+            DisallowedType(context, GetNumberString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+
+        if (!minimum_.IsNull() && !CheckDoubleMinimum(context, d))
+            return false;
+
+        if (!maximum_.IsNull() && !CheckDoubleMaximum(context, d))
+            return false;
+
+        if (!multipleOf_.IsNull() && !CheckDoubleMultipleOf(context, d))
+            return false;
+
+        return CreateParallelValidator(context);
+    }
+
+    bool String(Context& context, const Ch* str, SizeType length, bool) const {
+        if (!(type_ & (1 << kStringSchemaType))) {
+            DisallowedType(context, GetStringString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+
+        if (minLength_ != 0 || maxLength_ != SizeType(~0)) {
+            SizeType count;
+            if (internal::CountStringCodePoint<EncodingType>(str, length, &count)) {
+                if (count < minLength_) {
+                    context.error_handler.TooShort(str, length, minLength_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMinLength);
+                }
+                if (count > maxLength_) {
+                    context.error_handler.TooLong(str, length, maxLength_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMaxLength);
+                }
+            }
+        }
+
+        if (pattern_ && !IsPatternMatch(pattern_, str, length)) {
+            context.error_handler.DoesNotMatch(str, length);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorPattern);
+        }
+
+        return CreateParallelValidator(context);
+    }
+
+    bool StartObject(Context& context) const {
+        if (!(type_ & (1 << kObjectSchemaType))) {
+            DisallowedType(context, GetObjectString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+
+        if (hasDependencies_ || hasRequired_) {
+            context.propertyExist = static_cast<bool*>(context.factory.MallocState(sizeof(bool) * propertyCount_));
+            std::memset(context.propertyExist, 0, sizeof(bool) * propertyCount_);
+        }
+
+        if (patternProperties_) { // pre-allocate schema array
+            SizeType count = patternPropertyCount_ + 1; // extra for valuePatternValidatorType
+            context.patternPropertiesSchemas = static_cast<const SchemaType**>(context.factory.MallocState(sizeof(const SchemaType*) * count));
+            context.patternPropertiesSchemaCount = 0;
+            std::memset(context.patternPropertiesSchemas, 0, sizeof(SchemaType*) * count);
+        }
+
+        return CreateParallelValidator(context);
+    }
+
+    bool Key(Context& context, const Ch* str, SizeType len, bool) const {
+        if (patternProperties_) {
+            context.patternPropertiesSchemaCount = 0;
+            for (SizeType i = 0; i < patternPropertyCount_; i++)
+                if (patternProperties_[i].pattern && IsPatternMatch(patternProperties_[i].pattern, str, len)) {
+                    context.patternPropertiesSchemas[context.patternPropertiesSchemaCount++] = patternProperties_[i].schema;
+                    context.valueSchema = typeless_;
+                }
+        }
+
+        SizeType index  = 0;
+        if (FindPropertyIndex(ValueType(str, len).Move(), &index)) {
+            if (context.patternPropertiesSchemaCount > 0) {
+                context.patternPropertiesSchemas[context.patternPropertiesSchemaCount++] = properties_[index].schema;
+                context.valueSchema = typeless_;
+                context.valuePatternValidatorType = Context::kPatternValidatorWithProperty;
+            }
+            else
+                context.valueSchema = properties_[index].schema;
+
+            if (context.propertyExist)
+                context.propertyExist[index] = true;
+
+            return true;
+        }
+
+        if (additionalPropertiesSchema_) {
+            if (context.patternPropertiesSchemaCount > 0) {
+                context.patternPropertiesSchemas[context.patternPropertiesSchemaCount++] = additionalPropertiesSchema_;
+                context.valueSchema = typeless_;
+                context.valuePatternValidatorType = Context::kPatternValidatorWithAdditionalProperty;
+            }
+            else
+                context.valueSchema = additionalPropertiesSchema_;
+            return true;
+        }
+        else if (additionalProperties_) {
+            context.valueSchema = typeless_;
+            return true;
+        }
+
+        if (context.patternPropertiesSchemaCount == 0) { // patternProperties are not additional properties
+            // Must set valueSchema for when kValidateContinueOnErrorFlag is set, else reports spurious type error
+            context.valueSchema = typeless_;
+            context.error_handler.DisallowedProperty(str, len);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorAdditionalProperties);
+        }
+
+        return true;
+    }
+
+    bool EndObject(Context& context, SizeType memberCount) const {
+        if (hasRequired_) {
+            context.error_handler.StartMissingProperties();
+            for (SizeType index = 0; index < propertyCount_; index++)
+                if (properties_[index].required && !context.propertyExist[index])
+                    if (properties_[index].schema->defaultValueLength_ == 0 )
+                        context.error_handler.AddMissingProperty(properties_[index].name);
+            if (context.error_handler.EndMissingProperties())
+                RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorRequired);
+        }
+
+        if (memberCount < minProperties_) {
+            context.error_handler.TooFewProperties(memberCount, minProperties_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMinProperties);
+        }
+
+        if (memberCount > maxProperties_) {
+            context.error_handler.TooManyProperties(memberCount, maxProperties_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMaxProperties);
+        }
+
+        if (hasDependencies_) {
+            context.error_handler.StartDependencyErrors();
+            for (SizeType sourceIndex = 0; sourceIndex < propertyCount_; sourceIndex++) {
+                const Property& source = properties_[sourceIndex];
+                if (context.propertyExist[sourceIndex]) {
+                    if (source.dependencies) {
+                        context.error_handler.StartMissingDependentProperties();
+                        for (SizeType targetIndex = 0; targetIndex < propertyCount_; targetIndex++)
+                            if (source.dependencies[targetIndex] && !context.propertyExist[targetIndex])
+                                context.error_handler.AddMissingDependentProperty(properties_[targetIndex].name);
+                        context.error_handler.EndMissingDependentProperties(source.name);
+                    }
+                    else if (source.dependenciesSchema) {
+                        ISchemaValidator* dependenciesValidator = context.validators[source.dependenciesValidatorIndex];
+                        if (!dependenciesValidator->IsValid())
+                            context.error_handler.AddDependencySchemaError(source.name, dependenciesValidator);
+                    }
+                }
+            }
+            if (context.error_handler.EndDependencyErrors())
+                RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorDependencies);
+        }
+
+        return true;
+    }
+
+    bool StartArray(Context& context) const {
+        context.arrayElementIndex = 0;
+        context.inArray = true;  // Ensure we note that we are in an array
+
+        if (!(type_ & (1 << kArraySchemaType))) {
+            DisallowedType(context, GetArrayString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+
+        return CreateParallelValidator(context);
+    }
+
+    bool EndArray(Context& context, SizeType elementCount) const {
+        context.inArray = false;
+
+        if (elementCount < minItems_) {
+            context.error_handler.TooFewItems(elementCount, minItems_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMinItems);
+        }
+
+        if (elementCount > maxItems_) {
+            context.error_handler.TooManyItems(elementCount, maxItems_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMaxItems);
+        }
+
+        return true;
+    }
+
+    static const ValueType& GetValidateErrorKeyword(ValidateErrorCode validateErrorCode) {
+        switch (validateErrorCode) {
+            case kValidateErrorMultipleOf:              return GetMultipleOfString();
+            case kValidateErrorMaximum:                 return GetMaximumString();
+            case kValidateErrorExclusiveMaximum:        return GetMaximumString(); // Same
+            case kValidateErrorMinimum:                 return GetMinimumString();
+            case kValidateErrorExclusiveMinimum:        return GetMinimumString(); // Same
+
+            case kValidateErrorMaxLength:               return GetMaxLengthString();
+            case kValidateErrorMinLength:               return GetMinLengthString();
+            case kValidateErrorPattern:                 return GetPatternString();
+
+            case kValidateErrorMaxItems:                return GetMaxItemsString();
+            case kValidateErrorMinItems:                return GetMinItemsString();
+            case kValidateErrorUniqueItems:             return GetUniqueItemsString();
+            case kValidateErrorAdditionalItems:         return GetAdditionalItemsString();
+
+            case kValidateErrorMaxProperties:           return GetMaxPropertiesString();
+            case kValidateErrorMinProperties:           return GetMinPropertiesString();
+            case kValidateErrorRequired:                return GetRequiredString();
+            case kValidateErrorAdditionalProperties:    return GetAdditionalPropertiesString();
+            case kValidateErrorPatternProperties:       return GetPatternPropertiesString();
+            case kValidateErrorDependencies:            return GetDependenciesString();
+
+            case kValidateErrorEnum:                    return GetEnumString();
+            case kValidateErrorType:                    return GetTypeString();
+
+            case kValidateErrorOneOf:                   return GetOneOfString();
+            case kValidateErrorOneOfMatch:              return GetOneOfString(); // Same
+            case kValidateErrorAllOf:                   return GetAllOfString();
+            case kValidateErrorAnyOf:                   return GetAnyOfString();
+            case kValidateErrorNot:                     return GetNotString();
+
+            default:                                    return GetNullString();
+        }
+    }
+
+
+    // Generate functions for string literal according to Ch
+#define RAPIDJSON_STRING_(name, ...) \
+    static const ValueType& Get##name##String() {\
+        static const Ch s[] = { __VA_ARGS__, '\0' };\
+        static const ValueType v(s, static_cast<SizeType>(sizeof(s) / sizeof(Ch) - 1));\
+        return v;\
+    }
+
+    RAPIDJSON_STRING_(Null, 'n', 'u', 'l', 'l')
+    RAPIDJSON_STRING_(Boolean, 'b', 'o', 'o', 'l', 'e', 'a', 'n')
+    RAPIDJSON_STRING_(Object, 'o', 'b', 'j', 'e', 'c', 't')
+    RAPIDJSON_STRING_(Array, 'a', 'r', 'r', 'a', 'y')
+    RAPIDJSON_STRING_(String, 's', 't', 'r', 'i', 'n', 'g')
+    RAPIDJSON_STRING_(Number, 'n', 'u', 'm', 'b', 'e', 'r')
+    RAPIDJSON_STRING_(Integer, 'i', 'n', 't', 'e', 'g', 'e', 'r')
+    RAPIDJSON_STRING_(Type, 't', 'y', 'p', 'e')
+    RAPIDJSON_STRING_(Enum, 'e', 'n', 'u', 'm')
+    RAPIDJSON_STRING_(AllOf, 'a', 'l', 'l', 'O', 'f')
+    RAPIDJSON_STRING_(AnyOf, 'a', 'n', 'y', 'O', 'f')
+    RAPIDJSON_STRING_(OneOf, 'o', 'n', 'e', 'O', 'f')
+    RAPIDJSON_STRING_(Not, 'n', 'o', 't')
+    RAPIDJSON_STRING_(Properties, 'p', 'r', 'o', 'p', 'e', 'r', 't', 'i', 'e', 's')
+    RAPIDJSON_STRING_(Required, 'r', 'e', 'q', 'u', 'i', 'r', 'e', 'd')
+    RAPIDJSON_STRING_(Dependencies, 'd', 'e', 'p', 'e', 'n', 'd', 'e', 'n', 'c', 'i', 'e', 's')
+    RAPIDJSON_STRING_(PatternProperties, 'p', 'a', 't', 't', 'e', 'r', 'n', 'P', 'r', 'o', 'p', 'e', 'r', 't', 'i', 'e', 's')
+    RAPIDJSON_STRING_(AdditionalProperties, 'a', 'd', 'd', 'i', 't', 'i', 'o', 'n', 'a', 'l', 'P', 'r', 'o', 'p', 'e', 'r', 't', 'i', 'e', 's')
+    RAPIDJSON_STRING_(MinProperties, 'm', 'i', 'n', 'P', 'r', 'o', 'p', 'e', 'r', 't', 'i', 'e', 's')
+    RAPIDJSON_STRING_(MaxProperties, 'm', 'a', 'x', 'P', 'r', 'o', 'p', 'e', 'r', 't', 'i', 'e', 's')
+    RAPIDJSON_STRING_(Items, 'i', 't', 'e', 'm', 's')
+    RAPIDJSON_STRING_(MinItems, 'm', 'i', 'n', 'I', 't', 'e', 'm', 's')
+    RAPIDJSON_STRING_(MaxItems, 'm', 'a', 'x', 'I', 't', 'e', 'm', 's')
+    RAPIDJSON_STRING_(AdditionalItems, 'a', 'd', 'd', 'i', 't', 'i', 'o', 'n', 'a', 'l', 'I', 't', 'e', 'm', 's')
+    RAPIDJSON_STRING_(UniqueItems, 'u', 'n', 'i', 'q', 'u', 'e', 'I', 't', 'e', 'm', 's')
+    RAPIDJSON_STRING_(MinLength, 'm', 'i', 'n', 'L', 'e', 'n', 'g', 't', 'h')
+    RAPIDJSON_STRING_(MaxLength, 'm', 'a', 'x', 'L', 'e', 'n', 'g', 't', 'h')
+    RAPIDJSON_STRING_(Pattern, 'p', 'a', 't', 't', 'e', 'r', 'n')
+    RAPIDJSON_STRING_(Minimum, 'm', 'i', 'n', 'i', 'm', 'u', 'm')
+    RAPIDJSON_STRING_(Maximum, 'm', 'a', 'x', 'i', 'm', 'u', 'm')
+    RAPIDJSON_STRING_(ExclusiveMinimum, 'e', 'x', 'c', 'l', 'u', 's', 'i', 'v', 'e', 'M', 'i', 'n', 'i', 'm', 'u', 'm')
+    RAPIDJSON_STRING_(ExclusiveMaximum, 'e', 'x', 'c', 'l', 'u', 's', 'i', 'v', 'e', 'M', 'a', 'x', 'i', 'm', 'u', 'm')
+    RAPIDJSON_STRING_(MultipleOf, 'm', 'u', 'l', 't', 'i', 'p', 'l', 'e', 'O', 'f')
+    RAPIDJSON_STRING_(DefaultValue, 'd', 'e', 'f', 'a', 'u', 'l', 't')
+    RAPIDJSON_STRING_(Ref, '$', 'r', 'e', 'f')
+    RAPIDJSON_STRING_(Id, 'i', 'd')
+
+    RAPIDJSON_STRING_(SchemeEnd, ':')
+    RAPIDJSON_STRING_(AuthStart, '/', '/')
+    RAPIDJSON_STRING_(QueryStart, '?')
+    RAPIDJSON_STRING_(FragStart, '#')
+    RAPIDJSON_STRING_(Slash, '/')
+    RAPIDJSON_STRING_(Dot, '.')
+
+#undef RAPIDJSON_STRING_
+
+private:
+    enum SchemaValueType {
+        kNullSchemaType,
+        kBooleanSchemaType,
+        kObjectSchemaType,
+        kArraySchemaType,
+        kStringSchemaType,
+        kNumberSchemaType,
+        kIntegerSchemaType,
+        kTotalSchemaType
+    };
+
+#if RAPIDJSON_SCHEMA_USE_INTERNALREGEX
+        typedef internal::GenericRegex<EncodingType, AllocatorType> RegexType;
+#elif RAPIDJSON_SCHEMA_USE_STDREGEX
+        typedef std::basic_regex<Ch> RegexType;
+#else
+        typedef char RegexType;
+#endif
+
+    struct SchemaArray {
+        SchemaArray() : schemas(), count() {}
+        ~SchemaArray() { AllocatorType::Free(schemas); }
+        const SchemaType** schemas;
+        SizeType begin; // begin index of context.validators
+        SizeType count;
+    };
+
+    template <typename V1, typename V2>
+    void AddUniqueElement(V1& a, const V2& v) {
+        for (typename V1::ConstValueIterator itr = a.Begin(); itr != a.End(); ++itr)
+            if (*itr == v)
+                return;
+        V1 c(v, *allocator_);
+        a.PushBack(c, *allocator_);
+    }
+
+    static const ValueType* GetMember(const ValueType& value, const ValueType& name) {
+        typename ValueType::ConstMemberIterator itr = value.FindMember(name);
+        return itr != value.MemberEnd() ? &(itr->value) : 0;
+    }
+
+    static void AssignIfExist(bool& out, const ValueType& value, const ValueType& name) {
+        if (const ValueType* v = GetMember(value, name))
+            if (v->IsBool())
+                out = v->GetBool();
+    }
+
+    static void AssignIfExist(SizeType& out, const ValueType& value, const ValueType& name) {
+        if (const ValueType* v = GetMember(value, name))
+            if (v->IsUint64() && v->GetUint64() <= SizeType(~0))
+                out = static_cast<SizeType>(v->GetUint64());
+    }
+
+    void AssignIfExist(SchemaArray& out, SchemaDocumentType& schemaDocument, const PointerType& p, const ValueType& value, const ValueType& name, const ValueType& document) {
+        if (const ValueType* v = GetMember(value, name)) {
+            if (v->IsArray() && v->Size() > 0) {
+                PointerType q = p.Append(name, allocator_);
+                out.count = v->Size();
+                out.schemas = static_cast<const Schema**>(allocator_->Malloc(out.count * sizeof(const Schema*)));
+                memset(out.schemas, 0, sizeof(Schema*)* out.count);
+                for (SizeType i = 0; i < out.count; i++)
+                    schemaDocument.CreateSchema(&out.schemas[i], q.Append(i, allocator_), (*v)[i], document, id_);
+                out.begin = validatorCount_;
+                validatorCount_ += out.count;
+            }
+        }
+    }
+
+#if RAPIDJSON_SCHEMA_USE_INTERNALREGEX
+    template <typename ValueType>
+    RegexType* CreatePattern(const ValueType& value) {
+        if (value.IsString()) {
+            RegexType* r = new (allocator_->Malloc(sizeof(RegexType))) RegexType(value.GetString(), allocator_);
+            if (!r->IsValid()) {
+                r->~RegexType();
+                AllocatorType::Free(r);
+                r = 0;
+            }
+            return r;
+        }
+        return 0;
+    }
+
+    static bool IsPatternMatch(const RegexType* pattern, const Ch *str, SizeType) {
+        GenericRegexSearch<RegexType> rs(*pattern);
+        return rs.Search(str);
+    }
+#elif RAPIDJSON_SCHEMA_USE_STDREGEX
+    template <typename ValueType>
+    RegexType* CreatePattern(const ValueType& value) {
+        if (value.IsString()) {
+            RegexType *r = static_cast<RegexType*>(allocator_->Malloc(sizeof(RegexType)));
+            try {
+                return new (r) RegexType(value.GetString(), std::size_t(value.GetStringLength()), std::regex_constants::ECMAScript);
+            }
+            catch (const std::regex_error&) {
+                AllocatorType::Free(r);
+            }
+        }
+        return 0;
+    }
+
+    static bool IsPatternMatch(const RegexType* pattern, const Ch *str, SizeType length) {
+        std::match_results<const Ch*> r;
+        return std::regex_search(str, str + length, r, *pattern);
+    }
+#else
+    template <typename ValueType>
+    RegexType* CreatePattern(const ValueType&) { return 0; }
+
+    static bool IsPatternMatch(const RegexType*, const Ch *, SizeType) { return true; }
+#endif // RAPIDJSON_SCHEMA_USE_STDREGEX
+
+    void AddType(const ValueType& type) {
+        if      (type == GetNullString()   ) type_ |= 1 << kNullSchemaType;
+        else if (type == GetBooleanString()) type_ |= 1 << kBooleanSchemaType;
+        else if (type == GetObjectString() ) type_ |= 1 << kObjectSchemaType;
+        else if (type == GetArrayString()  ) type_ |= 1 << kArraySchemaType;
+        else if (type == GetStringString() ) type_ |= 1 << kStringSchemaType;
+        else if (type == GetIntegerString()) type_ |= 1 << kIntegerSchemaType;
+        else if (type == GetNumberString() ) type_ |= (1 << kNumberSchemaType) | (1 << kIntegerSchemaType);
+    }
+
+    bool CreateParallelValidator(Context& context) const {
+        if (enum_ || context.arrayUniqueness)
+            context.hasher = context.factory.CreateHasher();
+
+        if (validatorCount_) {
+            RAPIDJSON_ASSERT(context.validators == 0);
+            context.validators = static_cast<ISchemaValidator**>(context.factory.MallocState(sizeof(ISchemaValidator*) * validatorCount_));
+            std::memset(context.validators, 0, sizeof(ISchemaValidator*) * validatorCount_);
+            context.validatorCount = validatorCount_;
+
+            // Always return after first failure for these sub-validators
+            if (allOf_.schemas)
+                CreateSchemaValidators(context, allOf_, false);
+
+            if (anyOf_.schemas)
+                CreateSchemaValidators(context, anyOf_, false);
+
+            if (oneOf_.schemas)
+                CreateSchemaValidators(context, oneOf_, false);
+
+            if (not_)
+                context.validators[notValidatorIndex_] = context.factory.CreateSchemaValidator(*not_, false);
+
+            if (hasSchemaDependencies_) {
+                for (SizeType i = 0; i < propertyCount_; i++)
+                    if (properties_[i].dependenciesSchema)
+                        context.validators[properties_[i].dependenciesValidatorIndex] = context.factory.CreateSchemaValidator(*properties_[i].dependenciesSchema, false);
+            }
+        }
+
+        return true;
+    }
+
+    void CreateSchemaValidators(Context& context, const SchemaArray& schemas, const bool inheritContinueOnErrors) const {
+        for (SizeType i = 0; i < schemas.count; i++)
+            context.validators[schemas.begin + i] = context.factory.CreateSchemaValidator(*schemas.schemas[i], inheritContinueOnErrors);
+    }
+
+    // O(n)
+    bool FindPropertyIndex(const ValueType& name, SizeType* outIndex) const {
+        SizeType len = name.GetStringLength();
+        const Ch* str = name.GetString();
+        for (SizeType index = 0; index < propertyCount_; index++)
+            if (properties_[index].name.GetStringLength() == len &&
+                (std::memcmp(properties_[index].name.GetString(), str, sizeof(Ch) * len) == 0))
+            {
+                *outIndex = index;
+                return true;
+            }
+        return false;
+    }
+
+    bool CheckInt(Context& context, int64_t i) const {
+        if (!(type_ & ((1 << kIntegerSchemaType) | (1 << kNumberSchemaType)))) {
+            DisallowedType(context, GetIntegerString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+
+        if (!minimum_.IsNull()) {
+            if (minimum_.IsInt64()) {
+                if (exclusiveMinimum_ ? i <= minimum_.GetInt64() : i < minimum_.GetInt64()) {
+                    context.error_handler.BelowMinimum(i, minimum_, exclusiveMinimum_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMinimum_ ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum);
+                }
+            }
+            else if (minimum_.IsUint64()) {
+                context.error_handler.BelowMinimum(i, minimum_, exclusiveMinimum_);
+                RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMinimum_ ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum); // i <= max(int64_t) < minimum.GetUint64()
+            }
+            else if (!CheckDoubleMinimum(context, static_cast<double>(i)))
+                return false;
+        }
+
+        if (!maximum_.IsNull()) {
+            if (maximum_.IsInt64()) {
+                if (exclusiveMaximum_ ? i >= maximum_.GetInt64() : i > maximum_.GetInt64()) {
+                    context.error_handler.AboveMaximum(i, maximum_, exclusiveMaximum_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMaximum_ ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum);
+                }
+            }
+            else if (maximum_.IsUint64()) { }
+                /* do nothing */ // i <= max(int64_t) < maximum_.GetUint64()
+            else if (!CheckDoubleMaximum(context, static_cast<double>(i)))
+                return false;
+        }
+
+        if (!multipleOf_.IsNull()) {
+            if (multipleOf_.IsUint64()) {
+                if (static_cast<uint64_t>(i >= 0 ? i : -i) % multipleOf_.GetUint64() != 0) {
+                    context.error_handler.NotMultipleOf(i, multipleOf_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMultipleOf);
+                }
+            }
+            else if (!CheckDoubleMultipleOf(context, static_cast<double>(i)))
+                return false;
+        }
+
+        return true;
+    }
+
+    bool CheckUint(Context& context, uint64_t i) const {
+        if (!(type_ & ((1 << kIntegerSchemaType) | (1 << kNumberSchemaType)))) {
+            DisallowedType(context, GetIntegerString());
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorType);
+        }
+
+        if (!minimum_.IsNull()) {
+            if (minimum_.IsUint64()) {
+                if (exclusiveMinimum_ ? i <= minimum_.GetUint64() : i < minimum_.GetUint64()) {
+                    context.error_handler.BelowMinimum(i, minimum_, exclusiveMinimum_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMinimum_ ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum);
+                }
+            }
+            else if (minimum_.IsInt64())
+                /* do nothing */; // i >= 0 > minimum.Getint64()
+            else if (!CheckDoubleMinimum(context, static_cast<double>(i)))
+                return false;
+        }
+
+        if (!maximum_.IsNull()) {
+            if (maximum_.IsUint64()) {
+                if (exclusiveMaximum_ ? i >= maximum_.GetUint64() : i > maximum_.GetUint64()) {
+                    context.error_handler.AboveMaximum(i, maximum_, exclusiveMaximum_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMaximum_ ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum);
+                }
+            }
+            else if (maximum_.IsInt64()) {
+                context.error_handler.AboveMaximum(i, maximum_, exclusiveMaximum_);
+                RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMaximum_ ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum); // i >= 0 > maximum_
+            }
+            else if (!CheckDoubleMaximum(context, static_cast<double>(i)))
+                return false;
+        }
+
+        if (!multipleOf_.IsNull()) {
+            if (multipleOf_.IsUint64()) {
+                if (i % multipleOf_.GetUint64() != 0) {
+                    context.error_handler.NotMultipleOf(i, multipleOf_);
+                    RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMultipleOf);
+                }
+            }
+            else if (!CheckDoubleMultipleOf(context, static_cast<double>(i)))
+                return false;
+        }
+
+        return true;
+    }
+
+    bool CheckDoubleMinimum(Context& context, double d) const {
+        if (exclusiveMinimum_ ? d <= minimum_.GetDouble() : d < minimum_.GetDouble()) {
+            context.error_handler.BelowMinimum(d, minimum_, exclusiveMinimum_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMinimum_ ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum);
+        }
+        return true;
+    }
+
+    bool CheckDoubleMaximum(Context& context, double d) const {
+        if (exclusiveMaximum_ ? d >= maximum_.GetDouble() : d > maximum_.GetDouble()) {
+            context.error_handler.AboveMaximum(d, maximum_, exclusiveMaximum_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(exclusiveMaximum_ ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum);
+        }
+        return true;
+    }
+
+    bool CheckDoubleMultipleOf(Context& context, double d) const {
+        double a = std::abs(d), b = std::abs(multipleOf_.GetDouble());
+        double q = std::floor(a / b);
+        double r = a - q * b;
+        if (r > 0.0) {
+            context.error_handler.NotMultipleOf(d, multipleOf_);
+            RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorMultipleOf);
+        }
+        return true;
+    }
+
+    void DisallowedType(Context& context, const ValueType& actualType) const {
+        ErrorHandler& eh = context.error_handler;
+        eh.StartDisallowedType();
+
+        if (type_ & (1 << kNullSchemaType)) eh.AddExpectedType(GetNullString());
+        if (type_ & (1 << kBooleanSchemaType)) eh.AddExpectedType(GetBooleanString());
+        if (type_ & (1 << kObjectSchemaType)) eh.AddExpectedType(GetObjectString());
+        if (type_ & (1 << kArraySchemaType)) eh.AddExpectedType(GetArrayString());
+        if (type_ & (1 << kStringSchemaType)) eh.AddExpectedType(GetStringString());
+
+        if (type_ & (1 << kNumberSchemaType)) eh.AddExpectedType(GetNumberString());
+        else if (type_ & (1 << kIntegerSchemaType)) eh.AddExpectedType(GetIntegerString());
+
+        eh.EndDisallowedType(actualType);
+    }
+
+    struct Property {
+        Property() : schema(), dependenciesSchema(), dependenciesValidatorIndex(), dependencies(), required(false) {}
+        ~Property() { AllocatorType::Free(dependencies); }
+        SValue name;
+        const SchemaType* schema;
+        const SchemaType* dependenciesSchema;
+        SizeType dependenciesValidatorIndex;
+        bool* dependencies;
+        bool required;
+    };
+
+    struct PatternProperty {
+        PatternProperty() : schema(), pattern() {}
+        ~PatternProperty() {
+            if (pattern) {
+                pattern->~RegexType();
+                AllocatorType::Free(pattern);
+            }
+        }
+        const SchemaType* schema;
+        RegexType* pattern;
+    };
+
+    AllocatorType* allocator_;
+    SValue uri_;
+    UriType id_;
+    PointerType pointer_;
+    const SchemaType* typeless_;
+    uint64_t* enum_;
+    SizeType enumCount_;
+    SchemaArray allOf_;
+    SchemaArray anyOf_;
+    SchemaArray oneOf_;
+    const SchemaType* not_;
+    unsigned type_; // bitmask of kSchemaType
+    SizeType validatorCount_;
+    SizeType notValidatorIndex_;
+
+    Property* properties_;
+    const SchemaType* additionalPropertiesSchema_;
+    PatternProperty* patternProperties_;
+    SizeType patternPropertyCount_;
+    SizeType propertyCount_;
+    SizeType minProperties_;
+    SizeType maxProperties_;
+    bool additionalProperties_;
+    bool hasDependencies_;
+    bool hasRequired_;
+    bool hasSchemaDependencies_;
+
+    const SchemaType* additionalItemsSchema_;
+    const SchemaType* itemsList_;
+    const SchemaType** itemsTuple_;
+    SizeType itemsTupleCount_;
+    SizeType minItems_;
+    SizeType maxItems_;
+    bool additionalItems_;
+    bool uniqueItems_;
+
+    RegexType* pattern_;
+    SizeType minLength_;
+    SizeType maxLength_;
+
+    SValue minimum_;
+    SValue maximum_;
+    SValue multipleOf_;
+    bool exclusiveMinimum_;
+    bool exclusiveMaximum_;
+
+    SizeType defaultValueLength_;
+};
+
+template<typename Stack, typename Ch>
+struct TokenHelper {
+    RAPIDJSON_FORCEINLINE static void AppendIndexToken(Stack& documentStack, SizeType index) {
+        *documentStack.template Push<Ch>() = '/';
+        char buffer[21];
+        size_t length = static_cast<size_t>((sizeof(SizeType) == 4 ? u32toa(index, buffer) : u64toa(index, buffer)) - buffer);
+        for (size_t i = 0; i < length; i++)
+            *documentStack.template Push<Ch>() = static_cast<Ch>(buffer[i]);
+    }
+};
+
+// Partial specialized version for char to prevent buffer copying.
+template <typename Stack>
+struct TokenHelper<Stack, char> {
+    RAPIDJSON_FORCEINLINE static void AppendIndexToken(Stack& documentStack, SizeType index) {
+        if (sizeof(SizeType) == 4) {
+            char *buffer = documentStack.template Push<char>(1 + 10); // '/' + uint
+            *buffer++ = '/';
+            const char* end = internal::u32toa(index, buffer);
+             documentStack.template Pop<char>(static_cast<size_t>(10 - (end - buffer)));
+        }
+        else {
+            char *buffer = documentStack.template Push<char>(1 + 20); // '/' + uint64
+            *buffer++ = '/';
+            const char* end = internal::u64toa(index, buffer);
+            documentStack.template Pop<char>(static_cast<size_t>(20 - (end - buffer)));
+        }
+    }
+};
+
+} // namespace internal
+
+///////////////////////////////////////////////////////////////////////////////
+// IGenericRemoteSchemaDocumentProvider
+
+template <typename SchemaDocumentType>
+class IGenericRemoteSchemaDocumentProvider {
+public:
+    typedef typename SchemaDocumentType::Ch Ch;
+    typedef typename SchemaDocumentType::ValueType ValueType;
+    typedef typename SchemaDocumentType::AllocatorType AllocatorType;
+
+    virtual ~IGenericRemoteSchemaDocumentProvider() {}
+    virtual const SchemaDocumentType* GetRemoteDocument(const Ch* uri, SizeType length) = 0;
+    virtual const SchemaDocumentType* GetRemoteDocument(GenericUri<ValueType, AllocatorType> uri) { return GetRemoteDocument(uri.GetBaseString(), uri.GetBaseStringLength()); }
+};
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericSchemaDocument
+
+//! JSON schema document.
+/*!
+    A JSON schema document is a compiled version of a JSON schema.
+    It is basically a tree of internal::Schema.
+
+    \note This is an immutable class (i.e. its instance cannot be modified after construction).
+    \tparam ValueT Type of JSON value (e.g. \c Value ), which also determine the encoding.
+    \tparam Allocator Allocator type for allocating memory of this document.
+*/
+template <typename ValueT, typename Allocator = CrtAllocator>
+class GenericSchemaDocument {
+public:
+    typedef ValueT ValueType;
+    typedef IGenericRemoteSchemaDocumentProvider<GenericSchemaDocument> IRemoteSchemaDocumentProviderType;
+    typedef Allocator AllocatorType;
+    typedef typename ValueType::EncodingType EncodingType;
+    typedef typename EncodingType::Ch Ch;
+    typedef internal::Schema<GenericSchemaDocument> SchemaType;
+    typedef GenericPointer<ValueType, Allocator> PointerType;
+    typedef GenericValue<EncodingType, AllocatorType> SValue;
+    typedef GenericUri<ValueType, Allocator> UriType;
+    friend class internal::Schema<GenericSchemaDocument>;
+    template <typename, typename, typename>
+    friend class GenericSchemaValidator;
+
+    //! Constructor.
+    /*!
+        Compile a JSON document into schema document.
+
+        \param document A JSON document as source.
+        \param uri The base URI of this schema document for purposes of violation reporting.
+        \param uriLength Length of \c name, in code points.
+        \param remoteProvider An optional remote schema document provider for resolving remote reference. Can be null.
+        \param allocator An optional allocator instance for allocating memory. Can be null.
+        \param pointer An optional JSON pointer to the start of the schema document
+    */
+    explicit GenericSchemaDocument(const ValueType& document, const Ch* uri = 0, SizeType uriLength = 0,
+        IRemoteSchemaDocumentProviderType* remoteProvider = 0, Allocator* allocator = 0,
+        const PointerType& pointer = PointerType()) :  // PR #1393
+        remoteProvider_(remoteProvider),
+        allocator_(allocator),
+        ownAllocator_(),
+        root_(),
+        typeless_(),
+        schemaMap_(allocator, kInitialSchemaMapSize),
+        schemaRef_(allocator, kInitialSchemaRefSize)
+    {
+        if (!allocator_)
+            ownAllocator_ = allocator_ = RAPIDJSON_NEW(Allocator)();
+
+        Ch noUri[1] = {0};
+        uri_.SetString(uri ? uri : noUri, uriLength, *allocator_);
+        docId_ = UriType(uri_, allocator_);
+
+        typeless_ = static_cast<SchemaType*>(allocator_->Malloc(sizeof(SchemaType)));
+        new (typeless_) SchemaType(this, PointerType(), ValueType(kObjectType).Move(), ValueType(kObjectType).Move(), allocator_, docId_);
+
+        // Generate root schema, it will call CreateSchema() to create sub-schemas,
+        // And call HandleRefSchema() if there are $ref.
+        // PR #1393 use input pointer if supplied
+        root_ = typeless_;
+        if (pointer.GetTokenCount() == 0) {
+            CreateSchemaRecursive(&root_, pointer, document, document, docId_);
+        }
+        else if (const ValueType* v = pointer.Get(document)) {
+            CreateSchema(&root_, pointer, *v, document, docId_);
+        }
+
+        RAPIDJSON_ASSERT(root_ != 0);
+
+        schemaRef_.ShrinkToFit(); // Deallocate all memory for ref
+    }
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    //! Move constructor in C++11
+    GenericSchemaDocument(GenericSchemaDocument&& rhs) RAPIDJSON_NOEXCEPT :
+        remoteProvider_(rhs.remoteProvider_),
+        allocator_(rhs.allocator_),
+        ownAllocator_(rhs.ownAllocator_),
+        root_(rhs.root_),
+        typeless_(rhs.typeless_),
+        schemaMap_(std::move(rhs.schemaMap_)),
+        schemaRef_(std::move(rhs.schemaRef_)),
+        uri_(std::move(rhs.uri_)),
+        docId_(rhs.docId_)
+    {
+        rhs.remoteProvider_ = 0;
+        rhs.allocator_ = 0;
+        rhs.ownAllocator_ = 0;
+        rhs.typeless_ = 0;
+    }
+#endif
+
+    //! Destructor
+    ~GenericSchemaDocument() {
+        while (!schemaMap_.Empty())
+            schemaMap_.template Pop<SchemaEntry>(1)->~SchemaEntry();
+
+        if (typeless_) {
+            typeless_->~SchemaType();
+            Allocator::Free(typeless_);
+        }
+
+        RAPIDJSON_DELETE(ownAllocator_);
+    }
+
+    const SValue& GetURI() const { return uri_; }
+
+    //! Get the root schema.
+    const SchemaType& GetRoot() const { return *root_; }
+
+private:
+    //! Prohibit copying
+    GenericSchemaDocument(const GenericSchemaDocument&);
+    //! Prohibit assignment
+    GenericSchemaDocument& operator=(const GenericSchemaDocument&);
+
+    typedef const PointerType* SchemaRefPtr; // PR #1393
+
+    struct SchemaEntry {
+        SchemaEntry(const PointerType& p, SchemaType* s, bool o, Allocator* allocator) : pointer(p, allocator), schema(s), owned(o) {}
+        ~SchemaEntry() {
+            if (owned) {
+                schema->~SchemaType();
+                Allocator::Free(schema);
+            }
+        }
+        PointerType pointer;
+        SchemaType* schema;
+        bool owned;
+    };
+
+    // Changed by PR #1393
+    void CreateSchemaRecursive(const SchemaType** schema, const PointerType& pointer, const ValueType& v, const ValueType& document, const UriType& id) {
+        if (v.GetType() == kObjectType) {
+            UriType newid = UriType(CreateSchema(schema, pointer, v, document, id), allocator_);
+
+            for (typename ValueType::ConstMemberIterator itr = v.MemberBegin(); itr != v.MemberEnd(); ++itr)
+                CreateSchemaRecursive(0, pointer.Append(itr->name, allocator_), itr->value, document, newid);
+        }
+        else if (v.GetType() == kArrayType)
+            for (SizeType i = 0; i < v.Size(); i++)
+                CreateSchemaRecursive(0, pointer.Append(i, allocator_), v[i], document, id);
+    }
+
+    // Changed by PR #1393
+    const UriType& CreateSchema(const SchemaType** schema, const PointerType& pointer, const ValueType& v, const ValueType& document, const UriType& id) {
+        RAPIDJSON_ASSERT(pointer.IsValid());
+        if (v.IsObject()) {
+            if (const SchemaType* sc = GetSchema(pointer)) {
+                if (schema)
+                    *schema = sc;
+                AddSchemaRefs(const_cast<SchemaType*>(sc));
+            }
+            else if (!HandleRefSchema(pointer, schema, v, document, id)) {
+                // The new schema constructor adds itself and its $ref(s) to schemaMap_
+                SchemaType* s = new (allocator_->Malloc(sizeof(SchemaType))) SchemaType(this, pointer, v, document, allocator_, id);
+                if (schema)
+                    *schema = s;
+                return s->GetId();
+            }
+        }
+        else {
+            if (schema)
+                *schema = typeless_;
+            AddSchemaRefs(typeless_);
+        }
+        return id;
+    }
+
+    // Changed by PR #1393
+    // TODO should this return a UriType& ?
+    bool HandleRefSchema(const PointerType& source, const SchemaType** schema, const ValueType& v, const ValueType& document, const UriType& id) {
+        typename ValueType::ConstMemberIterator itr = v.FindMember(SchemaType::GetRefString());
+        if (itr == v.MemberEnd())
+            return false;
+
+        // Resolve the source pointer to the $ref'ed schema (finally)
+        new (schemaRef_.template Push<SchemaRefPtr>()) SchemaRefPtr(&source);
+
+        if (itr->value.IsString()) {
+            SizeType len = itr->value.GetStringLength();
+            if (len > 0) {
+                // First resolve $ref against the in-scope id
+                UriType scopeId = UriType(id, allocator_);
+                UriType ref = UriType(itr->value, allocator_).Resolve(scopeId, allocator_);
+                // See if the resolved $ref minus the fragment matches a resolved id in this document
+                // Search from the root. Returns the subschema in the document and its absolute JSON pointer.
+                PointerType basePointer = PointerType();
+                const ValueType *base = FindId(document, ref, basePointer, docId_, false);
+                if (!base) {
+                    // Remote reference - call the remote document provider
+                    if (remoteProvider_) {
+                        if (const GenericSchemaDocument* remoteDocument = remoteProvider_->GetRemoteDocument(ref)) {
+                            const Ch* s = ref.GetFragString();
+                            len = ref.GetFragStringLength();
+                            if (len <= 1 || s[1] == '/') {
+                                // JSON pointer fragment, absolute in the remote schema
+                                const PointerType pointer(s, len, allocator_);
+                                if (pointer.IsValid()) {
+                                    // Get the subschema
+                                    if (const SchemaType *sc = remoteDocument->GetSchema(pointer)) {
+                                        if (schema)
+                                            *schema = sc;
+                                        AddSchemaRefs(const_cast<SchemaType *>(sc));
+                                        return true;
+                                    }
+                                }
+                          } else {
+                            // Plain name fragment, not allowed
+                          }
+                        }
+                    }
+                }
+                else { // Local reference
+                    const Ch* s = ref.GetFragString();
+                    len = ref.GetFragStringLength();
+                    if (len <= 1 || s[1] == '/') {
+                        // JSON pointer fragment, relative to the resolved URI
+                        const PointerType relPointer(s, len, allocator_);
+                        if (relPointer.IsValid()) {
+                            // Get the subschema
+                            if (const ValueType *pv = relPointer.Get(*base)) {
+                                // Now get the absolute JSON pointer by adding relative to base
+                                PointerType pointer(basePointer);
+                                for (SizeType i = 0; i < relPointer.GetTokenCount(); i++)
+                                    pointer = pointer.Append(relPointer.GetTokens()[i], allocator_);
+                                //GenericStringBuffer<EncodingType> sb;
+                                //pointer.StringifyUriFragment(sb);
+                                if (pointer.IsValid() && !IsCyclicRef(pointer)) {
+                                    // Call CreateSchema recursively, but first compute the in-scope id for the $ref target as we have jumped there
+                                    // TODO: cache pointer <-> id mapping
+                                    size_t unresolvedTokenIndex;
+                                    scopeId = pointer.GetUri(document, docId_, &unresolvedTokenIndex, allocator_);
+                                    CreateSchema(schema, pointer, *pv, document, scopeId);
+                                    return true;
+                                }
+                            }
+                        }
+                    } else {
+                        // Plain name fragment, relative to the resolved URI
+                        // See if the fragment matches an id in this document.
+                        // Search from the base we just established. Returns the subschema in the document and its absolute JSON pointer.
+                        PointerType pointer = PointerType();
+                        if (const ValueType *pv = FindId(*base, ref, pointer, UriType(ref.GetBaseString(), ref.GetBaseStringLength(), allocator_), true, basePointer)) {
+                            if (!IsCyclicRef(pointer)) {
+                                //GenericStringBuffer<EncodingType> sb;
+                                //pointer.StringifyUriFragment(sb);
+                                // Call CreateSchema recursively, but first compute the in-scope id for the $ref target as we have jumped there
+                                // TODO: cache pointer <-> id mapping
+                                size_t unresolvedTokenIndex;
+                                scopeId = pointer.GetUri(document, docId_, &unresolvedTokenIndex, allocator_);
+                                CreateSchema(schema, pointer, *pv, document, scopeId);
+                                return true;
+                            }
+                        }
+                    }
+                }
+            }
+        }
+
+        // Invalid/Unknown $ref
+        if (schema)
+            *schema = typeless_;
+        AddSchemaRefs(typeless_);
+        return true;
+    }
+
+    //! Find the first subschema with a resolved 'id' that matches the specified URI.
+    // If full specified use all URI else ignore fragment.
+    // If found, return a pointer to the subschema and its JSON pointer.
+    // TODO cache pointer <-> id mapping
+    ValueType* FindId(const ValueType& doc, const UriType& finduri, PointerType& resptr, const UriType& baseuri, bool full, const PointerType& here = PointerType()) const {
+        SizeType i = 0;
+        ValueType* resval = 0;
+        UriType tempuri = UriType(finduri, allocator_);
+        UriType localuri = UriType(baseuri, allocator_);
+        if (doc.GetType() == kObjectType) {
+            // Establish the base URI of this object
+            typename ValueType::ConstMemberIterator m = doc.FindMember(SchemaType::GetIdString());
+            if (m != doc.MemberEnd() && m->value.GetType() == kStringType) {
+                localuri = UriType(m->value, allocator_).Resolve(baseuri, allocator_);
+            }
+            // See if it matches
+            if (localuri.Match(finduri, full)) {
+                resval = const_cast<ValueType *>(&doc);
+                resptr = here;
+                return resval;
+            }
+            // No match, continue looking
+            for (m = doc.MemberBegin(); m != doc.MemberEnd(); ++m) {
+                if (m->value.GetType() == kObjectType || m->value.GetType() == kArrayType) {
+                    resval = FindId(m->value, finduri, resptr, localuri, full, here.Append(m->name.GetString(), m->name.GetStringLength(), allocator_));
+                }
+                if (resval) break;
+            }
+        } else if (doc.GetType() == kArrayType) {
+            // Continue looking
+            for (typename ValueType::ConstValueIterator v = doc.Begin(); v != doc.End(); ++v) {
+                if (v->GetType() == kObjectType || v->GetType() == kArrayType) {
+                    resval = FindId(*v, finduri, resptr, localuri, full, here.Append(i, allocator_));
+                }
+                if (resval) break;
+                i++;
+            }
+        }
+        return resval;
+    }
+
+    // Added by PR #1393
+    void AddSchemaRefs(SchemaType* schema) {
+        while (!schemaRef_.Empty()) {
+            SchemaRefPtr *ref = schemaRef_.template Pop<SchemaRefPtr>(1);
+            SchemaEntry *entry = schemaMap_.template Push<SchemaEntry>();
+            new (entry) SchemaEntry(**ref, schema, false, allocator_);
+        }
+    }
+
+    // Added by PR #1393
+    bool IsCyclicRef(const PointerType& pointer) const {
+        for (const SchemaRefPtr* ref = schemaRef_.template Bottom<SchemaRefPtr>(); ref != schemaRef_.template End<SchemaRefPtr>(); ++ref)
+            if (pointer == **ref)
+                return true;
+        return false;
+    }
+
+    const SchemaType* GetSchema(const PointerType& pointer) const {
+        for (const SchemaEntry* target = schemaMap_.template Bottom<SchemaEntry>(); target != schemaMap_.template End<SchemaEntry>(); ++target)
+            if (pointer == target->pointer)
+                return target->schema;
+        return 0;
+    }
+
+    PointerType GetPointer(const SchemaType* schema) const {
+        for (const SchemaEntry* target = schemaMap_.template Bottom<SchemaEntry>(); target != schemaMap_.template End<SchemaEntry>(); ++target)
+            if (schema == target->schema)
+                return target->pointer;
+        return PointerType();
+    }
+
+    const SchemaType* GetTypeless() const { return typeless_; }
+
+    static const size_t kInitialSchemaMapSize = 64;
+    static const size_t kInitialSchemaRefSize = 64;
+
+    IRemoteSchemaDocumentProviderType* remoteProvider_;
+    Allocator *allocator_;
+    Allocator *ownAllocator_;
+    const SchemaType* root_;                //!< Root schema.
+    SchemaType* typeless_;
+    internal::Stack<Allocator> schemaMap_;  // Stores created Pointer -> Schemas
+    internal::Stack<Allocator> schemaRef_;  // Stores Pointer(s) from $ref(s) until resolved
+    SValue uri_;                            // Schema document URI
+    UriType docId_;
+};
+
+//! GenericSchemaDocument using Value type.
+typedef GenericSchemaDocument<Value> SchemaDocument;
+//! IGenericRemoteSchemaDocumentProvider using SchemaDocument.
+typedef IGenericRemoteSchemaDocumentProvider<SchemaDocument> IRemoteSchemaDocumentProvider;
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericSchemaValidator
+
+//! JSON Schema Validator.
+/*!
+    A SAX style JSON schema validator.
+    It uses a \c GenericSchemaDocument to validate SAX events.
+    It delegates the incoming SAX events to an output handler.
+    The default output handler does nothing.
+    It can be reused multiple times by calling \c Reset().
+
+    \tparam SchemaDocumentType Type of schema document.
+    \tparam OutputHandler Type of output handler. Default handler does nothing.
+    \tparam StateAllocator Allocator for storing the internal validation states.
+*/
+template <
+    typename SchemaDocumentType,
+    typename OutputHandler = BaseReaderHandler<typename SchemaDocumentType::SchemaType::EncodingType>,
+    typename StateAllocator = CrtAllocator>
+class GenericSchemaValidator :
+    public internal::ISchemaStateFactory<typename SchemaDocumentType::SchemaType>, 
+    public internal::ISchemaValidator,
+    public internal::IValidationErrorHandler<typename SchemaDocumentType::SchemaType> {
+public:
+    typedef typename SchemaDocumentType::SchemaType SchemaType;
+    typedef typename SchemaDocumentType::PointerType PointerType;
+    typedef typename SchemaType::EncodingType EncodingType;
+    typedef typename SchemaType::SValue SValue;
+    typedef typename EncodingType::Ch Ch;
+    typedef GenericStringRef<Ch> StringRefType;
+    typedef GenericValue<EncodingType, StateAllocator> ValueType;
+
+    //! Constructor without output handler.
+    /*!
+        \param schemaDocument The schema document to conform to.
+        \param allocator Optional allocator for storing internal validation states.
+        \param schemaStackCapacity Optional initial capacity of schema path stack.
+        \param documentStackCapacity Optional initial capacity of document path stack.
+    */
+    GenericSchemaValidator(
+        const SchemaDocumentType& schemaDocument,
+        StateAllocator* allocator = 0, 
+        size_t schemaStackCapacity = kDefaultSchemaStackCapacity,
+        size_t documentStackCapacity = kDefaultDocumentStackCapacity)
+        :
+        schemaDocument_(&schemaDocument),
+        root_(schemaDocument.GetRoot()),
+        stateAllocator_(allocator),
+        ownStateAllocator_(0),
+        schemaStack_(allocator, schemaStackCapacity),
+        documentStack_(allocator, documentStackCapacity),
+        outputHandler_(0),
+        error_(kObjectType),
+        currentError_(),
+        missingDependents_(),
+        valid_(true),
+        flags_(kValidateDefaultFlags)
+#if RAPIDJSON_SCHEMA_VERBOSE
+        , depth_(0)
+#endif
+    {
+    }
+
+    //! Constructor with output handler.
+    /*!
+        \param schemaDocument The schema document to conform to.
+        \param allocator Optional allocator for storing internal validation states.
+        \param schemaStackCapacity Optional initial capacity of schema path stack.
+        \param documentStackCapacity Optional initial capacity of document path stack.
+    */
+    GenericSchemaValidator(
+        const SchemaDocumentType& schemaDocument,
+        OutputHandler& outputHandler,
+        StateAllocator* allocator = 0, 
+        size_t schemaStackCapacity = kDefaultSchemaStackCapacity,
+        size_t documentStackCapacity = kDefaultDocumentStackCapacity)
+        :
+        schemaDocument_(&schemaDocument),
+        root_(schemaDocument.GetRoot()),
+        stateAllocator_(allocator),
+        ownStateAllocator_(0),
+        schemaStack_(allocator, schemaStackCapacity),
+        documentStack_(allocator, documentStackCapacity),
+        outputHandler_(&outputHandler),
+        error_(kObjectType),
+        currentError_(),
+        missingDependents_(),
+        valid_(true),
+        flags_(kValidateDefaultFlags)
+#if RAPIDJSON_SCHEMA_VERBOSE
+        , depth_(0)
+#endif
+    {
+    }
+
+    //! Destructor.
+    ~GenericSchemaValidator() {
+        Reset();
+        RAPIDJSON_DELETE(ownStateAllocator_);
+    }
+
+    //! Reset the internal states.
+    void Reset() {
+        while (!schemaStack_.Empty())
+            PopSchema();
+        documentStack_.Clear();
+        ResetError();
+    }
+
+    //! Reset the error state.
+    void ResetError() {
+        error_.SetObject();
+        currentError_.SetNull();
+        missingDependents_.SetNull();
+        valid_ = true;
+    }
+
+    //! Implementation of ISchemaValidator
+    void SetValidateFlags(unsigned flags) {
+        flags_ = flags;
+    }
+    virtual unsigned GetValidateFlags() const {
+        return flags_;
+    }
+
+    //! Checks whether the current state is valid.
+    // Implementation of ISchemaValidator
+    virtual bool IsValid() const {
+        if (!valid_) return false;
+        if (GetContinueOnErrors() && !error_.ObjectEmpty()) return false;
+        return true;
+    }
+
+    //! Gets the error object.
+    ValueType& GetError() { return error_; }
+    const ValueType& GetError() const { return error_; }
+
+    //! Gets the JSON pointer pointed to the invalid schema.
+    //  If reporting all errors, the stack will be empty.
+    PointerType GetInvalidSchemaPointer() const {
+        return schemaStack_.Empty() ? PointerType() : CurrentSchema().GetPointer();
+    }
+
+    //! Gets the keyword of invalid schema.
+    //  If reporting all errors, the stack will be empty, so return "errors".
+    const Ch* GetInvalidSchemaKeyword() const {
+        if (!schemaStack_.Empty()) return CurrentContext().invalidKeyword;
+        if (GetContinueOnErrors() && !error_.ObjectEmpty()) return (const Ch*)GetErrorsString();
+        return 0;
+    }
+
+    //! Gets the error code of invalid schema.
+    //  If reporting all errors, the stack will be empty, so return kValidateErrors.
+    ValidateErrorCode GetInvalidSchemaCode() const {
+        if (!schemaStack_.Empty()) return CurrentContext().invalidCode;
+        if (GetContinueOnErrors() && !error_.ObjectEmpty()) return kValidateErrors;
+        return kValidateErrorNone;
+    }
+
+    //! Gets the JSON pointer pointed to the invalid value.
+    //  If reporting all errors, the stack will be empty.
+    PointerType GetInvalidDocumentPointer() const {
+        if (documentStack_.Empty()) {
+            return PointerType();
+        }
+        else {
+            return PointerType(documentStack_.template Bottom<Ch>(), documentStack_.GetSize() / sizeof(Ch));
+        }
+    }
+
+    void NotMultipleOf(int64_t actual, const SValue& expected) {
+        AddNumberError(kValidateErrorMultipleOf, ValueType(actual).Move(), expected);
+    }
+    void NotMultipleOf(uint64_t actual, const SValue& expected) {
+        AddNumberError(kValidateErrorMultipleOf, ValueType(actual).Move(), expected);
+    }
+    void NotMultipleOf(double actual, const SValue& expected) {
+        AddNumberError(kValidateErrorMultipleOf, ValueType(actual).Move(), expected);
+    }
+    void AboveMaximum(int64_t actual, const SValue& expected, bool exclusive) {
+        AddNumberError(exclusive ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum, ValueType(actual).Move(), expected,
+            exclusive ? &SchemaType::GetExclusiveMaximumString : 0);
+    }
+    void AboveMaximum(uint64_t actual, const SValue& expected, bool exclusive) {
+        AddNumberError(exclusive ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum, ValueType(actual).Move(), expected,
+            exclusive ? &SchemaType::GetExclusiveMaximumString : 0);
+    }
+    void AboveMaximum(double actual, const SValue& expected, bool exclusive) {
+        AddNumberError(exclusive ? kValidateErrorExclusiveMaximum : kValidateErrorMaximum, ValueType(actual).Move(), expected,
+            exclusive ? &SchemaType::GetExclusiveMaximumString : 0);
+    }
+    void BelowMinimum(int64_t actual, const SValue& expected, bool exclusive) {
+        AddNumberError(exclusive ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum, ValueType(actual).Move(), expected,
+            exclusive ? &SchemaType::GetExclusiveMinimumString : 0);
+    }
+    void BelowMinimum(uint64_t actual, const SValue& expected, bool exclusive) {
+        AddNumberError(exclusive ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum, ValueType(actual).Move(), expected,
+            exclusive ? &SchemaType::GetExclusiveMinimumString : 0);
+    }
+    void BelowMinimum(double actual, const SValue& expected, bool exclusive) {
+        AddNumberError(exclusive ? kValidateErrorExclusiveMinimum : kValidateErrorMinimum, ValueType(actual).Move(), expected,
+            exclusive ? &SchemaType::GetExclusiveMinimumString : 0);
+    }
+
+    void TooLong(const Ch* str, SizeType length, SizeType expected) {
+        AddNumberError(kValidateErrorMaxLength,
+            ValueType(str, length, GetStateAllocator()).Move(), SValue(expected).Move());
+    }
+    void TooShort(const Ch* str, SizeType length, SizeType expected) {
+        AddNumberError(kValidateErrorMinLength,
+            ValueType(str, length, GetStateAllocator()).Move(), SValue(expected).Move());
+    }
+    void DoesNotMatch(const Ch* str, SizeType length) {
+        currentError_.SetObject();
+        currentError_.AddMember(GetActualString(), ValueType(str, length, GetStateAllocator()).Move(), GetStateAllocator());
+        AddCurrentError(kValidateErrorPattern);
+    }
+
+    void DisallowedItem(SizeType index) {
+        currentError_.SetObject();
+        currentError_.AddMember(GetDisallowedString(), ValueType(index).Move(), GetStateAllocator());
+        AddCurrentError(kValidateErrorAdditionalItems, true);
+    }
+    void TooFewItems(SizeType actualCount, SizeType expectedCount) {
+        AddNumberError(kValidateErrorMinItems,
+            ValueType(actualCount).Move(), SValue(expectedCount).Move());
+    }
+    void TooManyItems(SizeType actualCount, SizeType expectedCount) {
+        AddNumberError(kValidateErrorMaxItems,
+            ValueType(actualCount).Move(), SValue(expectedCount).Move());
+    }
+    void DuplicateItems(SizeType index1, SizeType index2) {
+        ValueType duplicates(kArrayType);
+        duplicates.PushBack(index1, GetStateAllocator());
+        duplicates.PushBack(index2, GetStateAllocator());
+        currentError_.SetObject();
+        currentError_.AddMember(GetDuplicatesString(), duplicates, GetStateAllocator());
+        AddCurrentError(kValidateErrorUniqueItems, true);
+    }
+
+    void TooManyProperties(SizeType actualCount, SizeType expectedCount) {
+        AddNumberError(kValidateErrorMaxProperties,
+            ValueType(actualCount).Move(), SValue(expectedCount).Move());
+    }
+    void TooFewProperties(SizeType actualCount, SizeType expectedCount) {
+        AddNumberError(kValidateErrorMinProperties,
+            ValueType(actualCount).Move(), SValue(expectedCount).Move());
+    }
+    void StartMissingProperties() {
+        currentError_.SetArray();
+    }
+    void AddMissingProperty(const SValue& name) {
+        currentError_.PushBack(ValueType(name, GetStateAllocator()).Move(), GetStateAllocator());
+    }
+    bool EndMissingProperties() {
+        if (currentError_.Empty())
+            return false;
+        ValueType error(kObjectType);
+        error.AddMember(GetMissingString(), currentError_, GetStateAllocator());
+        currentError_ = error;
+        AddCurrentError(kValidateErrorRequired);
+        return true;
+    }
+    void PropertyViolations(ISchemaValidator** subvalidators, SizeType count) {
+        for (SizeType i = 0; i < count; ++i)
+            MergeError(static_cast<GenericSchemaValidator*>(subvalidators[i])->GetError());
+    }
+    void DisallowedProperty(const Ch* name, SizeType length) {
+        currentError_.SetObject();
+        currentError_.AddMember(GetDisallowedString(), ValueType(name, length, GetStateAllocator()).Move(), GetStateAllocator());
+        AddCurrentError(kValidateErrorAdditionalProperties, true);
+    }
+
+    void StartDependencyErrors() {
+        currentError_.SetObject();
+    }
+    void StartMissingDependentProperties() {
+        missingDependents_.SetArray();
+    }
+    void AddMissingDependentProperty(const SValue& targetName) {
+        missingDependents_.PushBack(ValueType(targetName, GetStateAllocator()).Move(), GetStateAllocator());
+    }
+    void EndMissingDependentProperties(const SValue& sourceName) {
+        if (!missingDependents_.Empty()) {
+            // Create equivalent 'required' error
+            ValueType error(kObjectType);
+            ValidateErrorCode code = kValidateErrorRequired;
+            error.AddMember(GetMissingString(), missingDependents_.Move(), GetStateAllocator());
+            AddErrorCode(error, code);
+            AddErrorInstanceLocation(error, false);
+            // When appending to a pointer ensure its allocator is used
+            PointerType schemaRef = GetInvalidSchemaPointer().Append(SchemaType::GetValidateErrorKeyword(kValidateErrorDependencies), &GetInvalidSchemaPointer().GetAllocator());
+            AddErrorSchemaLocation(error, schemaRef.Append(sourceName.GetString(), sourceName.GetStringLength(), &GetInvalidSchemaPointer().GetAllocator()));
+            ValueType wrapper(kObjectType);
+            wrapper.AddMember(ValueType(SchemaType::GetValidateErrorKeyword(code), GetStateAllocator()).Move(), error, GetStateAllocator());
+            currentError_.AddMember(ValueType(sourceName, GetStateAllocator()).Move(), wrapper, GetStateAllocator());
+        }
+    }
+    void AddDependencySchemaError(const SValue& sourceName, ISchemaValidator* subvalidator) {
+        currentError_.AddMember(ValueType(sourceName, GetStateAllocator()).Move(),
+            static_cast<GenericSchemaValidator*>(subvalidator)->GetError(), GetStateAllocator());
+    }
+    bool EndDependencyErrors() {
+        if (currentError_.ObjectEmpty())
+            return false;
+        ValueType error(kObjectType);
+        error.AddMember(GetErrorsString(), currentError_, GetStateAllocator());
+        currentError_ = error;
+        AddCurrentError(kValidateErrorDependencies);
+        return true;
+    }
+
+    void DisallowedValue(const ValidateErrorCode code = kValidateErrorEnum) {
+        currentError_.SetObject();
+        AddCurrentError(code);
+    }
+    void StartDisallowedType() {
+        currentError_.SetArray();
+    }
+    void AddExpectedType(const typename SchemaType::ValueType& expectedType) {
+        currentError_.PushBack(ValueType(expectedType, GetStateAllocator()).Move(), GetStateAllocator());
+    }
+    void EndDisallowedType(const typename SchemaType::ValueType& actualType) {
+        ValueType error(kObjectType);
+        error.AddMember(GetExpectedString(), currentError_, GetStateAllocator());
+        error.AddMember(GetActualString(), ValueType(actualType, GetStateAllocator()).Move(), GetStateAllocator());
+        currentError_ = error;
+        AddCurrentError(kValidateErrorType);
+    }
+    void NotAllOf(ISchemaValidator** subvalidators, SizeType count) {
+        // Treat allOf like oneOf and anyOf to match https://rapidjson.org/md_doc_schema.html#allOf-anyOf-oneOf
+        AddErrorArray(kValidateErrorAllOf, subvalidators, count);
+        //for (SizeType i = 0; i < count; ++i) {
+        //    MergeError(static_cast<GenericSchemaValidator*>(subvalidators[i])->GetError());
+        //}
+    }
+    void NoneOf(ISchemaValidator** subvalidators, SizeType count) {
+        AddErrorArray(kValidateErrorAnyOf, subvalidators, count);
+    }
+    void NotOneOf(ISchemaValidator** subvalidators, SizeType count, bool matched = false) {
+        AddErrorArray(matched ? kValidateErrorOneOfMatch : kValidateErrorOneOf, subvalidators, count);
+    }
+    void Disallowed() {
+        currentError_.SetObject();
+        AddCurrentError(kValidateErrorNot);
+    }
+
+#define RAPIDJSON_STRING_(name, ...) \
+    static const StringRefType& Get##name##String() {\
+        static const Ch s[] = { __VA_ARGS__, '\0' };\
+        static const StringRefType v(s, static_cast<SizeType>(sizeof(s) / sizeof(Ch) - 1)); \
+        return v;\
+    }
+
+    RAPIDJSON_STRING_(InstanceRef, 'i', 'n', 's', 't', 'a', 'n', 'c', 'e', 'R', 'e', 'f')
+    RAPIDJSON_STRING_(SchemaRef, 's', 'c', 'h', 'e', 'm', 'a', 'R', 'e', 'f')
+    RAPIDJSON_STRING_(Expected, 'e', 'x', 'p', 'e', 'c', 't', 'e', 'd')
+    RAPIDJSON_STRING_(Actual, 'a', 'c', 't', 'u', 'a', 'l')
+    RAPIDJSON_STRING_(Disallowed, 'd', 'i', 's', 'a', 'l', 'l', 'o', 'w', 'e', 'd')
+    RAPIDJSON_STRING_(Missing, 'm', 'i', 's', 's', 'i', 'n', 'g')
+    RAPIDJSON_STRING_(Errors, 'e', 'r', 'r', 'o', 'r', 's')
+    RAPIDJSON_STRING_(ErrorCode, 'e', 'r', 'r', 'o', 'r', 'C', 'o', 'd', 'e')
+    RAPIDJSON_STRING_(ErrorMessage, 'e', 'r', 'r', 'o', 'r', 'M', 'e', 's', 's', 'a', 'g', 'e')
+    RAPIDJSON_STRING_(Duplicates, 'd', 'u', 'p', 'l', 'i', 'c', 'a', 't', 'e', 's')
+
+#undef RAPIDJSON_STRING_
+
+#if RAPIDJSON_SCHEMA_VERBOSE
+#define RAPIDJSON_SCHEMA_HANDLE_BEGIN_VERBOSE_() \
+RAPIDJSON_MULTILINEMACRO_BEGIN\
+    *documentStack_.template Push<Ch>() = '\0';\
+    documentStack_.template Pop<Ch>(1);\
+    internal::PrintInvalidDocument(documentStack_.template Bottom<Ch>());\
+RAPIDJSON_MULTILINEMACRO_END
+#else
+#define RAPIDJSON_SCHEMA_HANDLE_BEGIN_VERBOSE_()
+#endif
+
+#define RAPIDJSON_SCHEMA_HANDLE_BEGIN_(method, arg1)\
+    if (!valid_) return false; \
+    if ((!BeginValue() && !GetContinueOnErrors()) || (!CurrentSchema().method arg1 && !GetContinueOnErrors())) {\
+        RAPIDJSON_SCHEMA_HANDLE_BEGIN_VERBOSE_();\
+        valid_ = false;\
+        return valid_;\
+    }
+
+#define RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(method, arg2)\
+    for (Context* context = schemaStack_.template Bottom<Context>(); context != schemaStack_.template End<Context>(); context++) {\
+        if (context->hasher)\
+            static_cast<HasherType*>(context->hasher)->method arg2;\
+        if (context->validators)\
+            for (SizeType i_ = 0; i_ < context->validatorCount; i_++)\
+                static_cast<GenericSchemaValidator*>(context->validators[i_])->method arg2;\
+        if (context->patternPropertiesValidators)\
+            for (SizeType i_ = 0; i_ < context->patternPropertiesValidatorCount; i_++)\
+                static_cast<GenericSchemaValidator*>(context->patternPropertiesValidators[i_])->method arg2;\
+    }
+
+#define RAPIDJSON_SCHEMA_HANDLE_END_(method, arg2)\
+    valid_ = (EndValue() || GetContinueOnErrors()) && (!outputHandler_ || outputHandler_->method arg2);\
+    return valid_;
+
+#define RAPIDJSON_SCHEMA_HANDLE_VALUE_(method, arg1, arg2) \
+    RAPIDJSON_SCHEMA_HANDLE_BEGIN_   (method, arg1);\
+    RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(method, arg2);\
+    RAPIDJSON_SCHEMA_HANDLE_END_     (method, arg2)
+
+    bool Null()             { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Null,   (CurrentContext()), ( )); }
+    bool Bool(bool b)       { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Bool,   (CurrentContext(), b), (b)); }
+    bool Int(int i)         { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Int,    (CurrentContext(), i), (i)); }
+    bool Uint(unsigned u)   { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Uint,   (CurrentContext(), u), (u)); }
+    bool Int64(int64_t i)   { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Int64,  (CurrentContext(), i), (i)); }
+    bool Uint64(uint64_t u) { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Uint64, (CurrentContext(), u), (u)); }
+    bool Double(double d)   { RAPIDJSON_SCHEMA_HANDLE_VALUE_(Double, (CurrentContext(), d), (d)); }
+    bool RawNumber(const Ch* str, SizeType length, bool copy)
+                                    { RAPIDJSON_SCHEMA_HANDLE_VALUE_(String, (CurrentContext(), str, length, copy), (str, length, copy)); }
+    bool String(const Ch* str, SizeType length, bool copy)
+                                    { RAPIDJSON_SCHEMA_HANDLE_VALUE_(String, (CurrentContext(), str, length, copy), (str, length, copy)); }
+
+    bool StartObject() {
+        RAPIDJSON_SCHEMA_HANDLE_BEGIN_(StartObject, (CurrentContext()));
+        RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(StartObject, ());
+        valid_ = !outputHandler_ || outputHandler_->StartObject();
+        return valid_;
+    }
+    
+    bool Key(const Ch* str, SizeType len, bool copy) {
+        if (!valid_) return false;
+        AppendToken(str, len);
+        if (!CurrentSchema().Key(CurrentContext(), str, len, copy) && !GetContinueOnErrors()) {
+            valid_ = false;
+            return valid_;
+        }
+        RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(Key, (str, len, copy));
+        valid_ = !outputHandler_ || outputHandler_->Key(str, len, copy);
+        return valid_;
+    }
+    
+    bool EndObject(SizeType memberCount) {
+        if (!valid_) return false;
+        RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(EndObject, (memberCount));
+        if (!CurrentSchema().EndObject(CurrentContext(), memberCount) && !GetContinueOnErrors()) { 
+            valid_ = false; 
+            return valid_; 
+        }
+        RAPIDJSON_SCHEMA_HANDLE_END_(EndObject, (memberCount));
+    }
+
+    bool StartArray() {
+        RAPIDJSON_SCHEMA_HANDLE_BEGIN_(StartArray, (CurrentContext()));
+        RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(StartArray, ());
+        valid_ = !outputHandler_ || outputHandler_->StartArray();
+        return valid_;
+    }
+    
+    bool EndArray(SizeType elementCount) {
+        if (!valid_) return false;
+        RAPIDJSON_SCHEMA_HANDLE_PARALLEL_(EndArray, (elementCount));
+        if (!CurrentSchema().EndArray(CurrentContext(), elementCount) && !GetContinueOnErrors()) {
+            valid_ = false;
+            return valid_;
+        }
+        RAPIDJSON_SCHEMA_HANDLE_END_(EndArray, (elementCount));
+    }
+
+#undef RAPIDJSON_SCHEMA_HANDLE_BEGIN_VERBOSE_
+#undef RAPIDJSON_SCHEMA_HANDLE_BEGIN_
+#undef RAPIDJSON_SCHEMA_HANDLE_PARALLEL_
+#undef RAPIDJSON_SCHEMA_HANDLE_VALUE_
+
+    // Implementation of ISchemaStateFactory<SchemaType>
+    virtual ISchemaValidator* CreateSchemaValidator(const SchemaType& root, const bool inheritContinueOnErrors) {
+        ISchemaValidator* sv = new (GetStateAllocator().Malloc(sizeof(GenericSchemaValidator))) GenericSchemaValidator(*schemaDocument_, root, documentStack_.template Bottom<char>(), documentStack_.GetSize(),
+#if RAPIDJSON_SCHEMA_VERBOSE
+        depth_ + 1,
+#endif
+        &GetStateAllocator());
+        sv->SetValidateFlags(inheritContinueOnErrors ? GetValidateFlags() : GetValidateFlags() & ~(unsigned)kValidateContinueOnErrorFlag);
+        return sv;
+    }
+
+    virtual void DestroySchemaValidator(ISchemaValidator* validator) {
+        GenericSchemaValidator* v = static_cast<GenericSchemaValidator*>(validator);
+        v->~GenericSchemaValidator();
+        StateAllocator::Free(v);
+    }
+
+    virtual void* CreateHasher() {
+        return new (GetStateAllocator().Malloc(sizeof(HasherType))) HasherType(&GetStateAllocator());
+    }
+
+    virtual uint64_t GetHashCode(void* hasher) {
+        return static_cast<HasherType*>(hasher)->GetHashCode();
+    }
+
+    virtual void DestroryHasher(void* hasher) {
+        HasherType* h = static_cast<HasherType*>(hasher);
+        h->~HasherType();
+        StateAllocator::Free(h);
+    }
+
+    virtual void* MallocState(size_t size) {
+        return GetStateAllocator().Malloc(size);
+    }
+
+    virtual void FreeState(void* p) {
+        StateAllocator::Free(p);
+    }
+
+private:
+    typedef typename SchemaType::Context Context;
+    typedef GenericValue<UTF8<>, StateAllocator> HashCodeArray;
+    typedef internal::Hasher<EncodingType, StateAllocator> HasherType;
+
+    GenericSchemaValidator( 
+        const SchemaDocumentType& schemaDocument,
+        const SchemaType& root,
+        const char* basePath, size_t basePathSize,
+#if RAPIDJSON_SCHEMA_VERBOSE
+        unsigned depth,
+#endif
+        StateAllocator* allocator = 0,
+        size_t schemaStackCapacity = kDefaultSchemaStackCapacity,
+        size_t documentStackCapacity = kDefaultDocumentStackCapacity)
+        :
+        schemaDocument_(&schemaDocument),
+        root_(root),
+        stateAllocator_(allocator),
+        ownStateAllocator_(0),
+        schemaStack_(allocator, schemaStackCapacity),
+        documentStack_(allocator, documentStackCapacity),
+        outputHandler_(0),
+        error_(kObjectType),
+        currentError_(),
+        missingDependents_(),
+        valid_(true),
+        flags_(kValidateDefaultFlags)
+#if RAPIDJSON_SCHEMA_VERBOSE
+        , depth_(depth)
+#endif
+    {
+        if (basePath && basePathSize)
+            memcpy(documentStack_.template Push<char>(basePathSize), basePath, basePathSize);
+    }
+
+    StateAllocator& GetStateAllocator() {
+        if (!stateAllocator_)
+            stateAllocator_ = ownStateAllocator_ = RAPIDJSON_NEW(StateAllocator)();
+        return *stateAllocator_;
+    }
+
+    bool GetContinueOnErrors() const {
+        return flags_ & kValidateContinueOnErrorFlag;
+    }
+
+    bool BeginValue() {
+        if (schemaStack_.Empty())
+            PushSchema(root_);
+        else {
+            if (CurrentContext().inArray)
+                internal::TokenHelper<internal::Stack<StateAllocator>, Ch>::AppendIndexToken(documentStack_, CurrentContext().arrayElementIndex);
+
+            if (!CurrentSchema().BeginValue(CurrentContext()) && !GetContinueOnErrors())
+                return false;
+
+            SizeType count = CurrentContext().patternPropertiesSchemaCount;
+            const SchemaType** sa = CurrentContext().patternPropertiesSchemas;
+            typename Context::PatternValidatorType patternValidatorType = CurrentContext().valuePatternValidatorType;
+            bool valueUniqueness = CurrentContext().valueUniqueness;
+            RAPIDJSON_ASSERT(CurrentContext().valueSchema);
+            PushSchema(*CurrentContext().valueSchema);
+
+            if (count > 0) {
+                CurrentContext().objectPatternValidatorType = patternValidatorType;
+                ISchemaValidator**& va = CurrentContext().patternPropertiesValidators;
+                SizeType& validatorCount = CurrentContext().patternPropertiesValidatorCount;
+                va = static_cast<ISchemaValidator**>(MallocState(sizeof(ISchemaValidator*) * count));
+                std::memset(va, 0, sizeof(ISchemaValidator*) * count);
+                for (SizeType i = 0; i < count; i++)
+                    va[validatorCount++] = CreateSchemaValidator(*sa[i], true);  // Inherit continueOnError
+            }
+
+            CurrentContext().arrayUniqueness = valueUniqueness;
+        }
+        return true;
+    }
+
+    bool EndValue() {
+        if (!CurrentSchema().EndValue(CurrentContext()) && !GetContinueOnErrors())
+            return false;
+
+#if RAPIDJSON_SCHEMA_VERBOSE
+        GenericStringBuffer<EncodingType> sb;
+        schemaDocument_->GetPointer(&CurrentSchema()).Stringify(sb);
+
+        *documentStack_.template Push<Ch>() = '\0';
+        documentStack_.template Pop<Ch>(1);
+        internal::PrintValidatorPointers(depth_, sb.GetString(), documentStack_.template Bottom<Ch>());
+#endif
+        void* hasher = CurrentContext().hasher;
+        uint64_t h = hasher && CurrentContext().arrayUniqueness ? static_cast<HasherType*>(hasher)->GetHashCode() : 0;
+        
+        PopSchema();
+
+        if (!schemaStack_.Empty()) {
+            Context& context = CurrentContext();
+            // Only check uniqueness if there is a hasher
+            if (hasher && context.valueUniqueness) {
+                HashCodeArray* a = static_cast<HashCodeArray*>(context.arrayElementHashCodes);
+                if (!a)
+                    CurrentContext().arrayElementHashCodes = a = new (GetStateAllocator().Malloc(sizeof(HashCodeArray))) HashCodeArray(kArrayType);
+                for (typename HashCodeArray::ConstValueIterator itr = a->Begin(); itr != a->End(); ++itr)
+                    if (itr->GetUint64() == h) {
+                        DuplicateItems(static_cast<SizeType>(itr - a->Begin()), a->Size());
+                        // Cleanup before returning if continuing
+                        if (GetContinueOnErrors()) {
+                            a->PushBack(h, GetStateAllocator());
+                            while (!documentStack_.Empty() && *documentStack_.template Pop<Ch>(1) != '/');
+                        }
+                        RAPIDJSON_INVALID_KEYWORD_RETURN(kValidateErrorUniqueItems);
+                    }
+                a->PushBack(h, GetStateAllocator());
+            }
+        }
+
+        // Remove the last token of document pointer
+        while (!documentStack_.Empty() && *documentStack_.template Pop<Ch>(1) != '/')
+            ;
+
+        return true;
+    }
+
+    void AppendToken(const Ch* str, SizeType len) {
+        documentStack_.template Reserve<Ch>(1 + len * 2); // worst case all characters are escaped as two characters
+        *documentStack_.template PushUnsafe<Ch>() = '/';
+        for (SizeType i = 0; i < len; i++) {
+            if (str[i] == '~') {
+                *documentStack_.template PushUnsafe<Ch>() = '~';
+                *documentStack_.template PushUnsafe<Ch>() = '0';
+            }
+            else if (str[i] == '/') {
+                *documentStack_.template PushUnsafe<Ch>() = '~';
+                *documentStack_.template PushUnsafe<Ch>() = '1';
+            }
+            else
+                *documentStack_.template PushUnsafe<Ch>() = str[i];
+        }
+    }
+
+    RAPIDJSON_FORCEINLINE void PushSchema(const SchemaType& schema) { new (schemaStack_.template Push<Context>()) Context(*this, *this, &schema); }
+    
+    RAPIDJSON_FORCEINLINE void PopSchema() {
+        Context* c = schemaStack_.template Pop<Context>(1);
+        if (HashCodeArray* a = static_cast<HashCodeArray*>(c->arrayElementHashCodes)) {
+            a->~HashCodeArray();
+            StateAllocator::Free(a);
+        }
+        c->~Context();
+    }
+
+    void AddErrorInstanceLocation(ValueType& result, bool parent) {
+        GenericStringBuffer<EncodingType> sb;
+        PointerType instancePointer = GetInvalidDocumentPointer();
+        ((parent && instancePointer.GetTokenCount() > 0)
+         ? PointerType(instancePointer.GetTokens(), instancePointer.GetTokenCount() - 1)
+         : instancePointer).StringifyUriFragment(sb);
+        ValueType instanceRef(sb.GetString(), static_cast<SizeType>(sb.GetSize() / sizeof(Ch)),
+                              GetStateAllocator());
+        result.AddMember(GetInstanceRefString(), instanceRef, GetStateAllocator());
+    }
+
+    void AddErrorSchemaLocation(ValueType& result, PointerType schema = PointerType()) {
+        GenericStringBuffer<EncodingType> sb;
+        SizeType len = CurrentSchema().GetURI().GetStringLength();
+        if (len) memcpy(sb.Push(len), CurrentSchema().GetURI().GetString(), len * sizeof(Ch));
+        if (schema.GetTokenCount()) schema.StringifyUriFragment(sb);
+        else GetInvalidSchemaPointer().StringifyUriFragment(sb);
+        ValueType schemaRef(sb.GetString(), static_cast<SizeType>(sb.GetSize() / sizeof(Ch)),
+            GetStateAllocator());
+        result.AddMember(GetSchemaRefString(), schemaRef, GetStateAllocator());
+    }
+
+    void AddErrorCode(ValueType& result, const ValidateErrorCode code) {
+        result.AddMember(GetErrorCodeString(), code, GetStateAllocator());
+    }
+
+    void AddError(ValueType& keyword, ValueType& error) {
+        typename ValueType::MemberIterator member = error_.FindMember(keyword);
+        if (member == error_.MemberEnd())
+            error_.AddMember(keyword, error, GetStateAllocator());
+        else {
+            if (member->value.IsObject()) {
+                ValueType errors(kArrayType);
+                errors.PushBack(member->value, GetStateAllocator());
+                member->value = errors;
+            }
+            member->value.PushBack(error, GetStateAllocator());
+        }
+    }
+
+    void AddCurrentError(const ValidateErrorCode code, bool parent = false) {
+        AddErrorCode(currentError_, code);
+        AddErrorInstanceLocation(currentError_, parent);
+        AddErrorSchemaLocation(currentError_);
+        AddError(ValueType(SchemaType::GetValidateErrorKeyword(code), GetStateAllocator(), false).Move(), currentError_);
+    }
+
+    void MergeError(ValueType& other) {
+        for (typename ValueType::MemberIterator it = other.MemberBegin(), end = other.MemberEnd(); it != end; ++it) {
+            AddError(it->name, it->value);
+        }
+    }
+
+    void AddNumberError(const ValidateErrorCode code, ValueType& actual, const SValue& expected,
+        const typename SchemaType::ValueType& (*exclusive)() = 0) {
+        currentError_.SetObject();
+        currentError_.AddMember(GetActualString(), actual, GetStateAllocator());
+        currentError_.AddMember(GetExpectedString(), ValueType(expected, GetStateAllocator()).Move(), GetStateAllocator());
+        if (exclusive)
+            currentError_.AddMember(ValueType(exclusive(), GetStateAllocator()).Move(), true, GetStateAllocator());
+        AddCurrentError(code);
+    }
+
+    void AddErrorArray(const ValidateErrorCode code,
+        ISchemaValidator** subvalidators, SizeType count) {
+        ValueType errors(kArrayType);
+        for (SizeType i = 0; i < count; ++i)
+            errors.PushBack(static_cast<GenericSchemaValidator*>(subvalidators[i])->GetError(), GetStateAllocator());
+        currentError_.SetObject();
+        currentError_.AddMember(GetErrorsString(), errors, GetStateAllocator());
+        AddCurrentError(code);
+    }
+
+    const SchemaType& CurrentSchema() const { return *schemaStack_.template Top<Context>()->schema; }
+    Context& CurrentContext() { return *schemaStack_.template Top<Context>(); }
+    const Context& CurrentContext() const { return *schemaStack_.template Top<Context>(); }
+
+    static const size_t kDefaultSchemaStackCapacity = 1024;
+    static const size_t kDefaultDocumentStackCapacity = 256;
+    const SchemaDocumentType* schemaDocument_;
+    const SchemaType& root_;
+    StateAllocator* stateAllocator_;
+    StateAllocator* ownStateAllocator_;
+    internal::Stack<StateAllocator> schemaStack_;    //!< stack to store the current path of schema (BaseSchemaType *)
+    internal::Stack<StateAllocator> documentStack_;  //!< stack to store the current path of validating document (Ch)
+    OutputHandler* outputHandler_;
+    ValueType error_;
+    ValueType currentError_;
+    ValueType missingDependents_;
+    bool valid_;
+    unsigned flags_;
+#if RAPIDJSON_SCHEMA_VERBOSE
+    unsigned depth_;
+#endif
+};
+
+typedef GenericSchemaValidator<SchemaDocument> SchemaValidator;
+
+///////////////////////////////////////////////////////////////////////////////
+// SchemaValidatingReader
+
+//! A helper class for parsing with validation.
+/*!
+    This helper class is a functor, designed as a parameter of \ref GenericDocument::Populate().
+
+    \tparam parseFlags Combination of \ref ParseFlag.
+    \tparam InputStream Type of input stream, implementing Stream concept.
+    \tparam SourceEncoding Encoding of the input stream.
+    \tparam SchemaDocumentType Type of schema document.
+    \tparam StackAllocator Allocator type for stack.
+*/
+template <
+    unsigned parseFlags,
+    typename InputStream,
+    typename SourceEncoding,
+    typename SchemaDocumentType = SchemaDocument,
+    typename StackAllocator = CrtAllocator>
+class SchemaValidatingReader {
+public:
+    typedef typename SchemaDocumentType::PointerType PointerType;
+    typedef typename InputStream::Ch Ch;
+    typedef GenericValue<SourceEncoding, StackAllocator> ValueType;
+
+    //! Constructor
+    /*!
+        \param is Input stream.
+        \param sd Schema document.
+    */
+    SchemaValidatingReader(InputStream& is, const SchemaDocumentType& sd) : is_(is), sd_(sd), invalidSchemaKeyword_(), invalidSchemaCode_(kValidateErrorNone), error_(kObjectType), isValid_(true) {}
+
+    template <typename Handler>
+    bool operator()(Handler& handler) {
+        GenericReader<SourceEncoding, typename SchemaDocumentType::EncodingType, StackAllocator> reader;
+        GenericSchemaValidator<SchemaDocumentType, Handler> validator(sd_, handler);
+        parseResult_ = reader.template Parse<parseFlags>(is_, validator);
+
+        isValid_ = validator.IsValid();
+        if (isValid_) {
+            invalidSchemaPointer_ = PointerType();
+            invalidSchemaKeyword_ = 0;
+            invalidDocumentPointer_ = PointerType();
+            error_.SetObject();
+        }
+        else {
+            invalidSchemaPointer_ = validator.GetInvalidSchemaPointer();
+            invalidSchemaKeyword_ = validator.GetInvalidSchemaKeyword();
+            invalidSchemaCode_ = validator.GetInvalidSchemaCode();
+            invalidDocumentPointer_ = validator.GetInvalidDocumentPointer();
+            error_.CopyFrom(validator.GetError(), allocator_);
+        }
+
+        return parseResult_;
+    }
+
+    const ParseResult& GetParseResult() const { return parseResult_; }
+    bool IsValid() const { return isValid_; }
+    const PointerType& GetInvalidSchemaPointer() const { return invalidSchemaPointer_; }
+    const Ch* GetInvalidSchemaKeyword() const { return invalidSchemaKeyword_; }
+    const PointerType& GetInvalidDocumentPointer() const { return invalidDocumentPointer_; }
+    const ValueType& GetError() const { return error_; }
+    ValidateErrorCode GetInvalidSchemaCode() const { return invalidSchemaCode_; }
+
+private:
+    InputStream& is_;
+    const SchemaDocumentType& sd_;
+
+    ParseResult parseResult_;
+    PointerType invalidSchemaPointer_;
+    const Ch* invalidSchemaKeyword_;
+    PointerType invalidDocumentPointer_;
+    ValidateErrorCode invalidSchemaCode_;
+    StackAllocator allocator_;
+    ValueType error_;
+    bool isValid_;
+};
+
+RAPIDJSON_NAMESPACE_END
+RAPIDJSON_DIAG_POP
+
+#endif // RAPIDJSON_SCHEMA_H_
diff --git a/General/General/include/rapidjson/stream.h b/General/General/include/rapidjson/stream.h
new file mode 100644
index 0000000..1fd7091
--- /dev/null
+++ b/General/General/include/rapidjson/stream.h
@@ -0,0 +1,223 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#include "rapidjson.h"
+
+#ifndef RAPIDJSON_STREAM_H_
+#define RAPIDJSON_STREAM_H_
+
+#include "encodings.h"
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+//  Stream
+
+/*! \class rapidjson::Stream
+    \brief Concept for reading and writing characters.
+
+    For read-only stream, no need to implement PutBegin(), Put(), Flush() and PutEnd().
+
+    For write-only stream, only need to implement Put() and Flush().
+
+\code
+concept Stream {
+    typename Ch;    //!< Character type of the stream.
+
+    //! Read the current character from stream without moving the read cursor.
+    Ch Peek() const;
+
+    //! Read the current character from stream and moving the read cursor to next character.
+    Ch Take();
+
+    //! Get the current read cursor.
+    //! \return Number of characters read from start.
+    size_t Tell();
+
+    //! Begin writing operation at the current read pointer.
+    //! \return The begin writer pointer.
+    Ch* PutBegin();
+
+    //! Write a character.
+    void Put(Ch c);
+
+    //! Flush the buffer.
+    void Flush();
+
+    //! End the writing operation.
+    //! \param begin The begin write pointer returned by PutBegin().
+    //! \return Number of characters written.
+    size_t PutEnd(Ch* begin);
+}
+\endcode
+*/
+
+//! Provides additional information for stream.
+/*!
+    By using traits pattern, this type provides a default configuration for stream.
+    For custom stream, this type can be specialized for other configuration.
+    See TEST(Reader, CustomStringStream) in readertest.cpp for example.
+*/
+template<typename Stream>
+struct StreamTraits {
+    //! Whether to make local copy of stream for optimization during parsing.
+    /*!
+        By default, for safety, streams do not use local copy optimization.
+        Stream that can be copied fast should specialize this, like StreamTraits<StringStream>.
+    */
+    enum { copyOptimization = 0 };
+};
+
+//! Reserve n characters for writing to a stream.
+template<typename Stream>
+inline void PutReserve(Stream& stream, size_t count) {
+    (void)stream;
+    (void)count;
+}
+
+//! Write character to a stream, presuming buffer is reserved.
+template<typename Stream>
+inline void PutUnsafe(Stream& stream, typename Stream::Ch c) {
+    stream.Put(c);
+}
+
+//! Put N copies of a character to a stream.
+template<typename Stream, typename Ch>
+inline void PutN(Stream& stream, Ch c, size_t n) {
+    PutReserve(stream, n);
+    for (size_t i = 0; i < n; i++)
+        PutUnsafe(stream, c);
+}
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericStreamWrapper
+
+//! A Stream Wrapper
+/*! \tThis string stream is a wrapper for any stream by just forwarding any
+    \treceived message to the origin stream.
+    \note implements Stream concept
+*/
+
+#if defined(_MSC_VER) && _MSC_VER <= 1800
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4702)  // unreachable code
+RAPIDJSON_DIAG_OFF(4512)  // assignment operator could not be generated
+#endif
+
+template <typename InputStream, typename Encoding = UTF8<> >
+class GenericStreamWrapper {
+public:
+    typedef typename Encoding::Ch Ch;
+    GenericStreamWrapper(InputStream& is): is_(is) {}
+
+    Ch Peek() const { return is_.Peek(); }
+    Ch Take() { return is_.Take(); }
+    size_t Tell() { return is_.Tell(); }
+    Ch* PutBegin() { return is_.PutBegin(); }
+    void Put(Ch ch) { is_.Put(ch); }
+    void Flush() { is_.Flush(); }
+    size_t PutEnd(Ch* ch) { return is_.PutEnd(ch); }
+
+    // wrapper for MemoryStream
+    const Ch* Peek4() const { return is_.Peek4(); }
+
+    // wrapper for AutoUTFInputStream
+    UTFType GetType() const { return is_.GetType(); }
+    bool HasBOM() const { return is_.HasBOM(); }
+
+protected:
+    InputStream& is_;
+};
+
+#if defined(_MSC_VER) && _MSC_VER <= 1800
+RAPIDJSON_DIAG_POP
+#endif
+
+///////////////////////////////////////////////////////////////////////////////
+// StringStream
+
+//! Read-only string stream.
+/*! \note implements Stream concept
+*/
+template <typename Encoding>
+struct GenericStringStream {
+    typedef typename Encoding::Ch Ch;
+
+    GenericStringStream(const Ch *src) : src_(src), head_(src) {}
+
+    Ch Peek() const { return *src_; }
+    Ch Take() { return *src_++; }
+    size_t Tell() const { return static_cast<size_t>(src_ - head_); }
+
+    Ch* PutBegin() { RAPIDJSON_ASSERT(false); return 0; }
+    void Put(Ch) { RAPIDJSON_ASSERT(false); }
+    void Flush() { RAPIDJSON_ASSERT(false); }
+    size_t PutEnd(Ch*) { RAPIDJSON_ASSERT(false); return 0; }
+
+    const Ch* src_;     //!< Current read position.
+    const Ch* head_;    //!< Original head of the string.
+};
+
+template <typename Encoding>
+struct StreamTraits<GenericStringStream<Encoding> > {
+    enum { copyOptimization = 1 };
+};
+
+//! String stream with UTF8 encoding.
+typedef GenericStringStream<UTF8<> > StringStream;
+
+///////////////////////////////////////////////////////////////////////////////
+// InsituStringStream
+
+//! A read-write string stream.
+/*! This string stream is particularly designed for in-situ parsing.
+    \note implements Stream concept
+*/
+template <typename Encoding>
+struct GenericInsituStringStream {
+    typedef typename Encoding::Ch Ch;
+
+    GenericInsituStringStream(Ch *src) : src_(src), dst_(0), head_(src) {}
+
+    // Read
+    Ch Peek() { return *src_; }
+    Ch Take() { return *src_++; }
+    size_t Tell() { return static_cast<size_t>(src_ - head_); }
+
+    // Write
+    void Put(Ch c) { RAPIDJSON_ASSERT(dst_ != 0); *dst_++ = c; }
+
+    Ch* PutBegin() { return dst_ = src_; }
+    size_t PutEnd(Ch* begin) { return static_cast<size_t>(dst_ - begin); }
+    void Flush() {}
+
+    Ch* Push(size_t count) { Ch* begin = dst_; dst_ += count; return begin; }
+    void Pop(size_t count) { dst_ -= count; }
+
+    Ch* src_;
+    Ch* dst_;
+    Ch* head_;
+};
+
+template <typename Encoding>
+struct StreamTraits<GenericInsituStringStream<Encoding> > {
+    enum { copyOptimization = 1 };
+};
+
+//! Insitu string stream with UTF8 encoding.
+typedef GenericInsituStringStream<UTF8<> > InsituStringStream;
+
+RAPIDJSON_NAMESPACE_END
+
+#endif // RAPIDJSON_STREAM_H_
diff --git a/General/General/include/rapidjson/stringbuffer.h b/General/General/include/rapidjson/stringbuffer.h
new file mode 100644
index 0000000..82ad3ca
--- /dev/null
+++ b/General/General/include/rapidjson/stringbuffer.h
@@ -0,0 +1,121 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_STRINGBUFFER_H_
+#define RAPIDJSON_STRINGBUFFER_H_
+
+#include "stream.h"
+#include "internal/stack.h"
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+#include <utility> // std::move
+#endif
+
+#include "internal/stack.h"
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+//! Represents an in-memory output stream.
+/*!
+    \tparam Encoding Encoding of the stream.
+    \tparam Allocator type for allocating memory buffer.
+    \note implements Stream concept
+*/
+template <typename Encoding, typename Allocator = CrtAllocator>
+class GenericStringBuffer {
+public:
+    typedef typename Encoding::Ch Ch;
+
+    GenericStringBuffer(Allocator* allocator = 0, size_t capacity = kDefaultCapacity) : stack_(allocator, capacity) {}
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    GenericStringBuffer(GenericStringBuffer&& rhs) : stack_(std::move(rhs.stack_)) {}
+    GenericStringBuffer& operator=(GenericStringBuffer&& rhs) {
+        if (&rhs != this)
+            stack_ = std::move(rhs.stack_);
+        return *this;
+    }
+#endif
+
+    void Put(Ch c) { *stack_.template Push<Ch>() = c; }
+    void PutUnsafe(Ch c) { *stack_.template PushUnsafe<Ch>() = c; }
+    void Flush() {}
+
+    void Clear() { stack_.Clear(); }
+    void ShrinkToFit() {
+        // Push and pop a null terminator. This is safe.
+        *stack_.template Push<Ch>() = '\0';
+        stack_.ShrinkToFit();
+        stack_.template Pop<Ch>(1);
+    }
+
+    void Reserve(size_t count) { stack_.template Reserve<Ch>(count); }
+    Ch* Push(size_t count) { return stack_.template Push<Ch>(count); }
+    Ch* PushUnsafe(size_t count) { return stack_.template PushUnsafe<Ch>(count); }
+    void Pop(size_t count) { stack_.template Pop<Ch>(count); }
+
+    const Ch* GetString() const {
+        // Push and pop a null terminator. This is safe.
+        *stack_.template Push<Ch>() = '\0';
+        stack_.template Pop<Ch>(1);
+
+        return stack_.template Bottom<Ch>();
+    }
+
+    //! Get the size of string in bytes in the string buffer.
+    size_t GetSize() const { return stack_.GetSize(); }
+
+    //! Get the length of string in Ch in the string buffer.
+    size_t GetLength() const { return stack_.GetSize() / sizeof(Ch); }
+
+    static const size_t kDefaultCapacity = 256;
+    mutable internal::Stack<Allocator> stack_;
+
+private:
+    // Prohibit copy constructor & assignment operator.
+    GenericStringBuffer(const GenericStringBuffer&);
+    GenericStringBuffer& operator=(const GenericStringBuffer&);
+};
+
+//! String buffer with UTF8 encoding
+typedef GenericStringBuffer<UTF8<> > StringBuffer;
+
+template<typename Encoding, typename Allocator>
+inline void PutReserve(GenericStringBuffer<Encoding, Allocator>& stream, size_t count) {
+    stream.Reserve(count);
+}
+
+template<typename Encoding, typename Allocator>
+inline void PutUnsafe(GenericStringBuffer<Encoding, Allocator>& stream, typename Encoding::Ch c) {
+    stream.PutUnsafe(c);
+}
+
+//! Implement specialized version of PutN() with memset() for better performance.
+template<>
+inline void PutN(GenericStringBuffer<UTF8<> >& stream, char c, size_t n) {
+    std::memset(stream.stack_.Push<char>(n), c, n * sizeof(c));
+}
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_STRINGBUFFER_H_
diff --git a/General/General/include/rapidjson/uri.h b/General/General/include/rapidjson/uri.h
new file mode 100644
index 0000000..f93e508
--- /dev/null
+++ b/General/General/include/rapidjson/uri.h
@@ -0,0 +1,481 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+//
+// (C) Copyright IBM Corporation 2021
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_URI_H_
+#define RAPIDJSON_URI_H_
+
+#include "internal/strfunc.h"
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_OFF(4512) // assignment operator could not be generated
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// GenericUri
+
+template <typename ValueType, typename Allocator=CrtAllocator>
+class GenericUri {
+public:
+    typedef typename ValueType::Ch Ch;
+#if RAPIDJSON_HAS_STDSTRING
+    typedef std::basic_string<Ch> String;
+#endif
+
+    //! Constructors
+    GenericUri(Allocator* allocator = 0) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(allocator), ownAllocator_() {
+    }
+
+    GenericUri(const Ch* uri, SizeType len, Allocator* allocator = 0) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(allocator), ownAllocator_() {
+        Parse(uri, len);
+    }
+
+    GenericUri(const Ch* uri, Allocator* allocator = 0) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(allocator), ownAllocator_() {
+        Parse(uri, internal::StrLen<Ch>(uri));
+    }
+
+    // Use with specializations of GenericValue
+    template<typename T> GenericUri(const T& uri, Allocator* allocator = 0) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(allocator), ownAllocator_() {
+        const Ch* u = uri.template Get<const Ch*>(); // TypeHelper from document.h
+        Parse(u, internal::StrLen<Ch>(u));
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    GenericUri(const String& uri, Allocator* allocator = 0) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(allocator), ownAllocator_() {
+        Parse(uri.c_str(), internal::StrLen<Ch>(uri.c_str()));
+    }
+#endif
+
+    //! Copy constructor
+    GenericUri(const GenericUri& rhs) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(), ownAllocator_() {
+        *this = rhs;
+    }
+
+    //! Copy constructor
+    GenericUri(const GenericUri& rhs, Allocator* allocator) : uri_(), base_(), scheme_(), auth_(), path_(), query_(), frag_(), allocator_(allocator), ownAllocator_() {
+        *this = rhs;
+    }
+
+    //! Destructor.
+    ~GenericUri() {
+        Free();
+        RAPIDJSON_DELETE(ownAllocator_);
+    }
+
+    //! Assignment operator
+    GenericUri& operator=(const GenericUri& rhs) {
+        if (this != &rhs) {
+            // Do not delete ownAllocator
+            Free();
+            Allocate(rhs.GetStringLength());
+            auth_ = CopyPart(scheme_, rhs.scheme_, rhs.GetSchemeStringLength());
+            path_ = CopyPart(auth_, rhs.auth_, rhs.GetAuthStringLength());
+            query_ = CopyPart(path_, rhs.path_, rhs.GetPathStringLength());
+            frag_ = CopyPart(query_, rhs.query_, rhs.GetQueryStringLength());
+            base_ = CopyPart(frag_, rhs.frag_, rhs.GetFragStringLength());
+            uri_ = CopyPart(base_, rhs.base_, rhs.GetBaseStringLength());
+            CopyPart(uri_, rhs.uri_, rhs.GetStringLength());
+        }
+        return *this;
+    }
+
+    //! Getters
+    // Use with specializations of GenericValue
+    template<typename T> void Get(T& uri, Allocator& allocator) {
+        uri.template Set<const Ch*>(this->GetString(), allocator); // TypeHelper from document.h
+    }
+
+    const Ch* GetString() const { return uri_; }
+    SizeType GetStringLength() const { return uri_ == 0 ? 0 : internal::StrLen<Ch>(uri_); }
+    const Ch* GetBaseString() const { return base_; }
+    SizeType GetBaseStringLength() const { return base_ == 0 ? 0 : internal::StrLen<Ch>(base_); }
+    const Ch* GetSchemeString() const { return scheme_; }
+    SizeType GetSchemeStringLength() const { return scheme_ == 0 ? 0 : internal::StrLen<Ch>(scheme_); }
+    const Ch* GetAuthString() const { return auth_; }
+    SizeType GetAuthStringLength() const { return auth_ == 0 ? 0 : internal::StrLen<Ch>(auth_); }
+    const Ch* GetPathString() const { return path_; }
+    SizeType GetPathStringLength() const { return path_ == 0 ? 0 : internal::StrLen<Ch>(path_); }
+    const Ch* GetQueryString() const { return query_; }
+    SizeType GetQueryStringLength() const { return query_ == 0 ? 0 : internal::StrLen<Ch>(query_); }
+    const Ch* GetFragString() const { return frag_; }
+    SizeType GetFragStringLength() const { return frag_ == 0 ? 0 : internal::StrLen<Ch>(frag_); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    static String Get(const GenericUri& uri) { return String(uri.GetString(), uri.GetStringLength()); }
+    static String GetBase(const GenericUri& uri) { return String(uri.GetBaseString(), uri.GetBaseStringLength()); }
+    static String GetScheme(const GenericUri& uri) { return String(uri.GetSchemeString(), uri.GetSchemeStringLength()); }
+    static String GetAuth(const GenericUri& uri) { return String(uri.GetAuthString(), uri.GetAuthStringLength()); }
+    static String GetPath(const GenericUri& uri) { return String(uri.GetPathString(), uri.GetPathStringLength()); }
+    static String GetQuery(const GenericUri& uri) { return String(uri.GetQueryString(), uri.GetQueryStringLength()); }
+    static String GetFrag(const GenericUri& uri) { return String(uri.GetFragString(), uri.GetFragStringLength()); }
+#endif
+
+    //! Equality operators
+    bool operator==(const GenericUri& rhs) const {
+        return Match(rhs, true);
+    }
+
+    bool operator!=(const GenericUri& rhs) const {
+        return !Match(rhs, true);
+    }
+
+    bool Match(const GenericUri& uri, bool full = true) const {
+        Ch* s1;
+        Ch* s2;
+        if (full) {
+            s1 = uri_;
+            s2 = uri.uri_;
+        } else {
+            s1 = base_;
+            s2 = uri.base_;
+        }
+        if (s1 == s2) return true;
+        if (s1 == 0 || s2 == 0) return false;
+        return internal::StrCmp<Ch>(s1, s2) == 0;
+    }
+
+    //! Resolve this URI against another (base) URI in accordance with URI resolution rules.
+    // See https://tools.ietf.org/html/rfc3986
+    // Use for resolving an id or $ref with an in-scope id.
+    // Returns a new GenericUri for the resolved URI.
+    GenericUri Resolve(const GenericUri& baseuri, Allocator* allocator = 0) {
+        GenericUri resuri;
+        resuri.allocator_ = allocator;
+        // Ensure enough space for combining paths
+        resuri.Allocate(GetStringLength() + baseuri.GetStringLength() + 1); // + 1 for joining slash
+
+        if (!(GetSchemeStringLength() == 0)) {
+            // Use all of this URI
+            resuri.auth_ = CopyPart(resuri.scheme_, scheme_, GetSchemeStringLength());
+            resuri.path_ = CopyPart(resuri.auth_, auth_, GetAuthStringLength());
+            resuri.query_ = CopyPart(resuri.path_, path_, GetPathStringLength());
+            resuri.frag_ = CopyPart(resuri.query_, query_, GetQueryStringLength());
+            resuri.RemoveDotSegments();
+        } else {
+            // Use the base scheme
+            resuri.auth_ = CopyPart(resuri.scheme_, baseuri.scheme_, baseuri.GetSchemeStringLength());
+            if (!(GetAuthStringLength() == 0)) {
+                // Use this auth, path, query
+                resuri.path_ = CopyPart(resuri.auth_, auth_, GetAuthStringLength());
+                resuri.query_ = CopyPart(resuri.path_, path_, GetPathStringLength());
+                resuri.frag_ = CopyPart(resuri.query_, query_, GetQueryStringLength());
+                resuri.RemoveDotSegments();
+            } else {
+                // Use the base auth
+                resuri.path_ = CopyPart(resuri.auth_, baseuri.auth_, baseuri.GetAuthStringLength());
+                if (GetPathStringLength() == 0) {
+                    // Use the base path
+                    resuri.query_ = CopyPart(resuri.path_, baseuri.path_, baseuri.GetPathStringLength());
+                    if (GetQueryStringLength() == 0) {
+                        // Use the base query
+                        resuri.frag_ = CopyPart(resuri.query_, baseuri.query_, baseuri.GetQueryStringLength());
+                    } else {
+                        // Use this query
+                        resuri.frag_ = CopyPart(resuri.query_, query_, GetQueryStringLength());
+                    }
+                } else {
+                    if (path_[0] == '/') {
+                        // Absolute path - use all of this path
+                        resuri.query_ = CopyPart(resuri.path_, path_, GetPathStringLength());
+                        resuri.RemoveDotSegments();
+                    } else {
+                        // Relative path - append this path to base path after base path's last slash
+                        size_t pos = 0;
+                        if (!(baseuri.GetAuthStringLength() == 0) && baseuri.GetPathStringLength() == 0) {
+                            resuri.path_[pos] = '/';
+                            pos++;
+                        }
+                        size_t lastslashpos = baseuri.GetPathStringLength();
+                        while (lastslashpos > 0) {
+                            if (baseuri.path_[lastslashpos - 1] == '/') break;
+                            lastslashpos--;
+                        }
+                        std::memcpy(&resuri.path_[pos], baseuri.path_, lastslashpos * sizeof(Ch));
+                        pos += lastslashpos;
+                        resuri.query_ = CopyPart(&resuri.path_[pos], path_, GetPathStringLength());
+                        resuri.RemoveDotSegments();
+                    }
+                    // Use this query
+                    resuri.frag_ = CopyPart(resuri.query_, query_, GetQueryStringLength());
+                }
+            }
+        }
+        // Always use this frag
+        resuri.base_ = CopyPart(resuri.frag_, frag_, GetFragStringLength());
+
+        // Re-constitute base_ and uri_
+        resuri.SetBase();
+        resuri.uri_ = resuri.base_ + resuri.GetBaseStringLength() + 1;
+        resuri.SetUri();
+        return resuri;
+    }
+
+    //! Get the allocator of this GenericUri.
+    Allocator& GetAllocator() { return *allocator_; }
+
+private:
+    // Allocate memory for a URI
+    // Returns total amount allocated
+    std::size_t Allocate(std::size_t len) {
+        // Create own allocator if user did not supply.
+        if (!allocator_)
+            ownAllocator_ =  allocator_ = RAPIDJSON_NEW(Allocator)();
+
+        // Allocate one block containing each part of the URI (5) plus base plus full URI, all null terminated.
+        // Order: scheme, auth, path, query, frag, base, uri
+        // Note need to set, increment, assign in 3 stages to avoid compiler warning bug.
+        size_t total = (3 * len + 7) * sizeof(Ch);
+        scheme_ = static_cast<Ch*>(allocator_->Malloc(total));
+        *scheme_ = '\0';
+        auth_ = scheme_;
+        auth_++;
+        *auth_ = '\0';
+        path_ = auth_;
+        path_++;
+        *path_ = '\0';
+        query_ = path_;
+        query_++;
+        *query_ = '\0';
+        frag_ = query_;
+        frag_++;
+        *frag_ = '\0';
+        base_ = frag_;
+        base_++;
+        *base_ = '\0';
+        uri_ = base_;
+        uri_++;
+        *uri_ = '\0';
+        return total;
+    }
+
+    // Free memory for a URI
+    void Free() {
+        if (scheme_) {
+            Allocator::Free(scheme_);
+            scheme_ = 0;
+        }
+    }
+
+    // Parse a URI into constituent scheme, authority, path, query, & fragment parts
+    // Supports URIs that match regex ^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))? as per
+    // https://tools.ietf.org/html/rfc3986
+    void Parse(const Ch* uri, std::size_t len) {
+        std::size_t start = 0, pos1 = 0, pos2 = 0;
+        Allocate(len);
+
+        // Look for scheme ([^:/?#]+):)?
+        if (start < len) {
+            while (pos1 < len) {
+                if (uri[pos1] == ':') break;
+                pos1++;
+            }
+            if (pos1 != len) {
+                while (pos2 < len) {
+                    if (uri[pos2] == '/') break;
+                    if (uri[pos2] == '?') break;
+                    if (uri[pos2] == '#') break;
+                    pos2++;
+                }
+                if (pos1 < pos2) {
+                    pos1++;
+                    std::memcpy(scheme_, &uri[start], pos1 * sizeof(Ch));
+                    scheme_[pos1] = '\0';
+                    start = pos1;
+                }
+            }
+        }
+        // Look for auth (//([^/?#]*))?
+        // Note need to set, increment, assign in 3 stages to avoid compiler warning bug.
+        auth_ = scheme_ + GetSchemeStringLength();
+        auth_++;
+        *auth_ = '\0';
+        if (start < len - 1 && uri[start] == '/' && uri[start + 1] == '/') {
+            pos2 = start + 2;
+            while (pos2 < len) {
+                if (uri[pos2] == '/') break;
+                if (uri[pos2] == '?') break;
+                if (uri[pos2] == '#') break;
+                pos2++;
+            }
+            std::memcpy(auth_, &uri[start], (pos2 - start) * sizeof(Ch));
+            auth_[pos2 - start] = '\0';
+            start = pos2;
+        }
+        // Look for path ([^?#]*)
+        // Note need to set, increment, assign in 3 stages to avoid compiler warning bug.
+        path_ = auth_ + GetAuthStringLength();
+        path_++;
+        *path_ = '\0';
+        if (start < len) {
+            pos2 = start;
+            while (pos2 < len) {
+                if (uri[pos2] == '?') break;
+                if (uri[pos2] == '#') break;
+                pos2++;
+            }
+            if (start != pos2) {
+                std::memcpy(path_, &uri[start], (pos2 - start) * sizeof(Ch));
+                path_[pos2 - start] = '\0';
+                if (path_[0] == '/')
+                    RemoveDotSegments();   // absolute path - normalize
+                start = pos2;
+            }
+        }
+        // Look for query (\?([^#]*))?
+        // Note need to set, increment, assign in 3 stages to avoid compiler warning bug.
+        query_ = path_ + GetPathStringLength();
+        query_++;
+        *query_ = '\0';
+        if (start < len && uri[start] == '?') {
+            pos2 = start + 1;
+            while (pos2 < len) {
+                if (uri[pos2] == '#') break;
+                pos2++;
+            }
+            if (start != pos2) {
+                std::memcpy(query_, &uri[start], (pos2 - start) * sizeof(Ch));
+                query_[pos2 - start] = '\0';
+                start = pos2;
+            }
+        }
+        // Look for fragment (#(.*))?
+        // Note need to set, increment, assign in 3 stages to avoid compiler warning bug.
+        frag_ = query_ + GetQueryStringLength();
+        frag_++;
+        *frag_ = '\0';
+        if (start < len && uri[start] == '#') {
+            std::memcpy(frag_, &uri[start], (len - start) * sizeof(Ch));
+            frag_[len - start] = '\0';
+        }
+
+        // Re-constitute base_ and uri_
+        base_ = frag_ + GetFragStringLength() + 1;
+        SetBase();
+        uri_ = base_ + GetBaseStringLength() + 1;
+        SetUri();
+    }
+
+    // Reconstitute base
+    void SetBase() {
+        Ch* next = base_;
+        std::memcpy(next, scheme_, GetSchemeStringLength() * sizeof(Ch));
+        next+= GetSchemeStringLength();
+        std::memcpy(next, auth_, GetAuthStringLength() * sizeof(Ch));
+        next+= GetAuthStringLength();
+        std::memcpy(next, path_, GetPathStringLength() * sizeof(Ch));
+        next+= GetPathStringLength();
+        std::memcpy(next, query_, GetQueryStringLength() * sizeof(Ch));
+        next+= GetQueryStringLength();
+        *next = '\0';
+    }
+
+    // Reconstitute uri
+    void SetUri() {
+        Ch* next = uri_;
+        std::memcpy(next, base_, GetBaseStringLength() * sizeof(Ch));
+        next+= GetBaseStringLength();
+        std::memcpy(next, frag_, GetFragStringLength() * sizeof(Ch));
+        next+= GetFragStringLength();
+        *next = '\0';
+    }
+
+    // Copy a part from one GenericUri to another
+    // Return the pointer to the next part to be copied to
+    Ch* CopyPart(Ch* to, Ch* from, std::size_t len) {
+        RAPIDJSON_ASSERT(to != 0);
+        RAPIDJSON_ASSERT(from != 0);
+        std::memcpy(to, from, len * sizeof(Ch));
+        to[len] = '\0';
+        Ch* next = to + len + 1;
+        return next;
+    }
+
+    // Remove . and .. segments from the path_ member.
+    // https://tools.ietf.org/html/rfc3986
+    // This is done in place as we are only removing segments.
+    void RemoveDotSegments() {
+        std::size_t pathlen = GetPathStringLength();
+        std::size_t pathpos = 0;  // Position in path_
+        std::size_t newpos = 0;   // Position in new path_
+
+        // Loop through each segment in original path_
+        while (pathpos < pathlen) {
+            // Get next segment, bounded by '/' or end
+            size_t slashpos = 0;
+            while ((pathpos + slashpos) < pathlen) {
+                if (path_[pathpos + slashpos] == '/') break;
+                slashpos++;
+            }
+            // Check for .. and . segments
+            if (slashpos == 2 && path_[pathpos] == '.' && path_[pathpos + 1] == '.') {
+                // Backup a .. segment in the new path_
+                // We expect to find a previously added slash at the end or nothing
+                RAPIDJSON_ASSERT(newpos == 0 || path_[newpos - 1] == '/');
+                size_t lastslashpos = newpos;
+                // Make sure we don't go beyond the start segment
+                if (lastslashpos > 1) {
+                    // Find the next to last slash and back up to it
+                    lastslashpos--;
+                    while (lastslashpos > 0) {
+                        if (path_[lastslashpos - 1] == '/') break;
+                        lastslashpos--;
+                    }
+                    // Set the new path_ position
+                    newpos = lastslashpos;
+                }
+            } else if (slashpos == 1 && path_[pathpos] == '.') {
+                // Discard . segment, leaves new path_ unchanged
+            } else {
+                // Move any other kind of segment to the new path_
+                RAPIDJSON_ASSERT(newpos <= pathpos);
+                std::memmove(&path_[newpos], &path_[pathpos], slashpos * sizeof(Ch));
+                newpos += slashpos;
+                // Add slash if not at end
+                if ((pathpos + slashpos) < pathlen) {
+                    path_[newpos] = '/';
+                    newpos++;
+                }
+            }
+            // Move to next segment
+            pathpos += slashpos + 1;
+        }
+        path_[newpos] = '\0';
+    }
+
+    Ch* uri_;    // Everything
+    Ch* base_;   // Everything except fragment
+    Ch* scheme_; // Includes the :
+    Ch* auth_;   // Includes the //
+    Ch* path_;   // Absolute if starts with /
+    Ch* query_;  // Includes the ?
+    Ch* frag_;   // Includes the #
+
+    Allocator* allocator_;      //!< The current allocator. It is either user-supplied or equal to ownAllocator_.
+    Allocator* ownAllocator_;   //!< Allocator owned by this Uri.
+};
+
+//! GenericUri for Value (UTF-8, default allocator).
+typedef GenericUri<Value> Uri;
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_URI_H_
diff --git a/General/General/include/rapidjson/writer.h b/General/General/include/rapidjson/writer.h
new file mode 100644
index 0000000..8b38921
--- /dev/null
+++ b/General/General/include/rapidjson/writer.h
@@ -0,0 +1,710 @@
+// Tencent is pleased to support the open source community by making RapidJSON available.
+// 
+// Copyright (C) 2015 THL A29 Limited, a Tencent company, and Milo Yip.
+//
+// Licensed under the MIT License (the "License"); you may not use this file except
+// in compliance with the License. You may obtain a copy of the License at
+//
+// http://opensource.org/licenses/MIT
+//
+// Unless required by applicable law or agreed to in writing, software distributed 
+// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR 
+// CONDITIONS OF ANY KIND, either express or implied. See the License for the 
+// specific language governing permissions and limitations under the License.
+
+#ifndef RAPIDJSON_WRITER_H_
+#define RAPIDJSON_WRITER_H_
+
+#include "stream.h"
+#include "internal/clzll.h"
+#include "internal/meta.h"
+#include "internal/stack.h"
+#include "internal/strfunc.h"
+#include "internal/dtoa.h"
+#include "internal/itoa.h"
+#include "stringbuffer.h"
+#include <new>      // placement new
+
+#if defined(RAPIDJSON_SIMD) && defined(_MSC_VER)
+#include <intrin.h>
+#pragma intrinsic(_BitScanForward)
+#endif
+#ifdef RAPIDJSON_SSE42
+#include <nmmintrin.h>
+#elif defined(RAPIDJSON_SSE2)
+#include <emmintrin.h>
+#elif defined(RAPIDJSON_NEON)
+#include <arm_neon.h>
+#endif
+
+#ifdef __clang__
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(padded)
+RAPIDJSON_DIAG_OFF(unreachable-code)
+RAPIDJSON_DIAG_OFF(c++98-compat)
+#elif defined(_MSC_VER)
+RAPIDJSON_DIAG_PUSH
+RAPIDJSON_DIAG_OFF(4127) // conditional expression is constant
+#endif
+
+RAPIDJSON_NAMESPACE_BEGIN
+
+///////////////////////////////////////////////////////////////////////////////
+// WriteFlag
+
+/*! \def RAPIDJSON_WRITE_DEFAULT_FLAGS 
+    \ingroup RAPIDJSON_CONFIG
+    \brief User-defined kWriteDefaultFlags definition.
+
+    User can define this as any \c WriteFlag combinations.
+*/
+#ifndef RAPIDJSON_WRITE_DEFAULT_FLAGS
+#define RAPIDJSON_WRITE_DEFAULT_FLAGS kWriteNoFlags
+#endif
+
+//! Combination of writeFlags
+enum WriteFlag {
+    kWriteNoFlags = 0,              //!< No flags are set.
+    kWriteValidateEncodingFlag = 1, //!< Validate encoding of JSON strings.
+    kWriteNanAndInfFlag = 2,        //!< Allow writing of Infinity, -Infinity and NaN.
+    kWriteDefaultFlags = RAPIDJSON_WRITE_DEFAULT_FLAGS  //!< Default write flags. Can be customized by defining RAPIDJSON_WRITE_DEFAULT_FLAGS
+};
+
+//! JSON writer
+/*! Writer implements the concept Handler.
+    It generates JSON text by events to an output os.
+
+    User may programmatically calls the functions of a writer to generate JSON text.
+
+    On the other side, a writer can also be passed to objects that generates events, 
+
+    for example Reader::Parse() and Document::Accept().
+
+    \tparam OutputStream Type of output stream.
+    \tparam SourceEncoding Encoding of source string.
+    \tparam TargetEncoding Encoding of output stream.
+    \tparam StackAllocator Type of allocator for allocating memory of stack.
+    \note implements Handler concept
+*/
+template<typename OutputStream, typename SourceEncoding = UTF8<>, typename TargetEncoding = UTF8<>, typename StackAllocator = CrtAllocator, unsigned writeFlags = kWriteDefaultFlags>
+class Writer {
+public:
+    typedef typename SourceEncoding::Ch Ch;
+
+    static const int kDefaultMaxDecimalPlaces = 324;
+
+    //! Constructor
+    /*! \param os Output stream.
+        \param stackAllocator User supplied allocator. If it is null, it will create a private one.
+        \param levelDepth Initial capacity of stack.
+    */
+    explicit
+    Writer(OutputStream& os, StackAllocator* stackAllocator = 0, size_t levelDepth = kDefaultLevelDepth) : 
+        os_(&os), level_stack_(stackAllocator, levelDepth * sizeof(Level)), maxDecimalPlaces_(kDefaultMaxDecimalPlaces), hasRoot_(false) {}
+
+    explicit
+    Writer(StackAllocator* allocator = 0, size_t levelDepth = kDefaultLevelDepth) :
+        os_(0), level_stack_(allocator, levelDepth * sizeof(Level)), maxDecimalPlaces_(kDefaultMaxDecimalPlaces), hasRoot_(false) {}
+
+#if RAPIDJSON_HAS_CXX11_RVALUE_REFS
+    Writer(Writer&& rhs) :
+        os_(rhs.os_), level_stack_(std::move(rhs.level_stack_)), maxDecimalPlaces_(rhs.maxDecimalPlaces_), hasRoot_(rhs.hasRoot_) {
+        rhs.os_ = 0;
+    }
+#endif
+
+    //! Reset the writer with a new stream.
+    /*!
+        This function reset the writer with a new stream and default settings,
+        in order to make a Writer object reusable for output multiple JSONs.
+
+        \param os New output stream.
+        \code
+        Writer<OutputStream> writer(os1);
+        writer.StartObject();
+        // ...
+        writer.EndObject();
+
+        writer.Reset(os2);
+        writer.StartObject();
+        // ...
+        writer.EndObject();
+        \endcode
+    */
+    void Reset(OutputStream& os) {
+        os_ = &os;
+        hasRoot_ = false;
+        level_stack_.Clear();
+    }
+
+    //! Checks whether the output is a complete JSON.
+    /*!
+        A complete JSON has a complete root object or array.
+    */
+    bool IsComplete() const {
+        return hasRoot_ && level_stack_.Empty();
+    }
+
+    int GetMaxDecimalPlaces() const {
+        return maxDecimalPlaces_;
+    }
+
+    //! Sets the maximum number of decimal places for double output.
+    /*!
+        This setting truncates the output with specified number of decimal places.
+
+        For example, 
+
+        \code
+        writer.SetMaxDecimalPlaces(3);
+        writer.StartArray();
+        writer.Double(0.12345);                 // "0.123"
+        writer.Double(0.0001);                  // "0.0"
+        writer.Double(1.234567890123456e30);    // "1.234567890123456e30" (do not truncate significand for positive exponent)
+        writer.Double(1.23e-4);                 // "0.0"                  (do truncate significand for negative exponent)
+        writer.EndArray();
+        \endcode
+
+        The default setting does not truncate any decimal places. You can restore to this setting by calling
+        \code
+        writer.SetMaxDecimalPlaces(Writer::kDefaultMaxDecimalPlaces);
+        \endcode
+    */
+    void SetMaxDecimalPlaces(int maxDecimalPlaces) {
+        maxDecimalPlaces_ = maxDecimalPlaces;
+    }
+
+    /*!@name Implementation of Handler
+        \see Handler
+    */
+    //@{
+
+    bool Null()                 { Prefix(kNullType);   return EndValue(WriteNull()); }
+    bool Bool(bool b)           { Prefix(b ? kTrueType : kFalseType); return EndValue(WriteBool(b)); }
+    bool Int(int i)             { Prefix(kNumberType); return EndValue(WriteInt(i)); }
+    bool Uint(unsigned u)       { Prefix(kNumberType); return EndValue(WriteUint(u)); }
+    bool Int64(int64_t i64)     { Prefix(kNumberType); return EndValue(WriteInt64(i64)); }
+    bool Uint64(uint64_t u64)   { Prefix(kNumberType); return EndValue(WriteUint64(u64)); }
+
+    //! Writes the given \c double value to the stream
+    /*!
+        \param d The value to be written.
+        \return Whether it is succeed.
+    */
+    bool Double(double d)       { Prefix(kNumberType); return EndValue(WriteDouble(d)); }
+
+    bool RawNumber(const Ch* str, SizeType length, bool copy = false) {
+        RAPIDJSON_ASSERT(str != 0);
+        (void)copy;
+        Prefix(kNumberType);
+        return EndValue(WriteString(str, length));
+    }
+
+    bool String(const Ch* str, SizeType length, bool copy = false) {
+        RAPIDJSON_ASSERT(str != 0);
+        (void)copy;
+        Prefix(kStringType);
+        return EndValue(WriteString(str, length));
+    }
+
+#if RAPIDJSON_HAS_STDSTRING
+    bool String(const std::basic_string<Ch>& str) {
+        return String(str.data(), SizeType(str.size()));
+    }
+#endif
+
+    bool StartObject() {
+        Prefix(kObjectType);
+        new (level_stack_.template Push<Level>()) Level(false);
+        return WriteStartObject();
+    }
+
+    bool Key(const Ch* str, SizeType length, bool copy = false) { return String(str, length, copy); }
+
+#if RAPIDJSON_HAS_STDSTRING
+    bool Key(const std::basic_string<Ch>& str)
+    {
+      return Key(str.data(), SizeType(str.size()));
+    }
+#endif
+
+    bool EndObject(SizeType memberCount = 0) {
+        (void)memberCount;
+        RAPIDJSON_ASSERT(level_stack_.GetSize() >= sizeof(Level)); // not inside an Object
+        RAPIDJSON_ASSERT(!level_stack_.template Top<Level>()->inArray); // currently inside an Array, not Object
+        RAPIDJSON_ASSERT(0 == level_stack_.template Top<Level>()->valueCount % 2); // Object has a Key without a Value
+        level_stack_.template Pop<Level>(1);
+        return EndValue(WriteEndObject());
+    }
+
+    bool StartArray() {
+        Prefix(kArrayType);
+        new (level_stack_.template Push<Level>()) Level(true);
+        return WriteStartArray();
+    }
+
+    bool EndArray(SizeType elementCount = 0) {
+        (void)elementCount;
+        RAPIDJSON_ASSERT(level_stack_.GetSize() >= sizeof(Level));
+        RAPIDJSON_ASSERT(level_stack_.template Top<Level>()->inArray);
+        level_stack_.template Pop<Level>(1);
+        return EndValue(WriteEndArray());
+    }
+    //@}
+
+    /*! @name Convenience extensions */
+    //@{
+
+    //! Simpler but slower overload.
+    bool String(const Ch* const& str) { return String(str, internal::StrLen(str)); }
+    bool Key(const Ch* const& str) { return Key(str, internal::StrLen(str)); }
+    
+    //@}
+
+    //! Write a raw JSON value.
+    /*!
+        For user to write a stringified JSON as a value.
+
+        \param json A well-formed JSON value. It should not contain null character within [0, length - 1] range.
+        \param length Length of the json.
+        \param type Type of the root of json.
+    */
+    bool RawValue(const Ch* json, size_t length, Type type) {
+        RAPIDJSON_ASSERT(json != 0);
+        Prefix(type);
+        return EndValue(WriteRawValue(json, length));
+    }
+
+    //! Flush the output stream.
+    /*!
+        Allows the user to flush the output stream immediately.
+     */
+    void Flush() {
+        os_->Flush();
+    }
+
+    static const size_t kDefaultLevelDepth = 32;
+
+protected:
+    //! Information for each nested level
+    struct Level {
+        Level(bool inArray_) : valueCount(0), inArray(inArray_) {}
+        size_t valueCount;  //!< number of values in this level
+        bool inArray;       //!< true if in array, otherwise in object
+    };
+
+    bool WriteNull()  {
+        PutReserve(*os_, 4);
+        PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'u'); PutUnsafe(*os_, 'l'); PutUnsafe(*os_, 'l'); return true;
+    }
+
+    bool WriteBool(bool b)  {
+        if (b) {
+            PutReserve(*os_, 4);
+            PutUnsafe(*os_, 't'); PutUnsafe(*os_, 'r'); PutUnsafe(*os_, 'u'); PutUnsafe(*os_, 'e');
+        }
+        else {
+            PutReserve(*os_, 5);
+            PutUnsafe(*os_, 'f'); PutUnsafe(*os_, 'a'); PutUnsafe(*os_, 'l'); PutUnsafe(*os_, 's'); PutUnsafe(*os_, 'e');
+        }
+        return true;
+    }
+
+    bool WriteInt(int i) {
+        char buffer[11];
+        const char* end = internal::i32toa(i, buffer);
+        PutReserve(*os_, static_cast<size_t>(end - buffer));
+        for (const char* p = buffer; p != end; ++p)
+            PutUnsafe(*os_, static_cast<typename OutputStream::Ch>(*p));
+        return true;
+    }
+
+    bool WriteUint(unsigned u) {
+        char buffer[10];
+        const char* end = internal::u32toa(u, buffer);
+        PutReserve(*os_, static_cast<size_t>(end - buffer));
+        for (const char* p = buffer; p != end; ++p)
+            PutUnsafe(*os_, static_cast<typename OutputStream::Ch>(*p));
+        return true;
+    }
+
+    bool WriteInt64(int64_t i64) {
+        char buffer[21];
+        const char* end = internal::i64toa(i64, buffer);
+        PutReserve(*os_, static_cast<size_t>(end - buffer));
+        for (const char* p = buffer; p != end; ++p)
+            PutUnsafe(*os_, static_cast<typename OutputStream::Ch>(*p));
+        return true;
+    }
+
+    bool WriteUint64(uint64_t u64) {
+        char buffer[20];
+        char* end = internal::u64toa(u64, buffer);
+        PutReserve(*os_, static_cast<size_t>(end - buffer));
+        for (char* p = buffer; p != end; ++p)
+            PutUnsafe(*os_, static_cast<typename OutputStream::Ch>(*p));
+        return true;
+    }
+
+    bool WriteDouble(double d) {
+        if (internal::Double(d).IsNanOrInf()) {
+            if (!(writeFlags & kWriteNanAndInfFlag))
+                return false;
+            if (internal::Double(d).IsNan()) {
+                PutReserve(*os_, 3);
+                PutUnsafe(*os_, 'N'); PutUnsafe(*os_, 'a'); PutUnsafe(*os_, 'N');
+                return true;
+            }
+            if (internal::Double(d).Sign()) {
+                PutReserve(*os_, 9);
+                PutUnsafe(*os_, '-');
+            }
+            else
+                PutReserve(*os_, 8);
+            PutUnsafe(*os_, 'I'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'f');
+            PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 't'); PutUnsafe(*os_, 'y');
+            return true;
+        }
+
+        char buffer[25];
+        char* end = internal::dtoa(d, buffer, maxDecimalPlaces_);
+        PutReserve(*os_, static_cast<size_t>(end - buffer));
+        for (char* p = buffer; p != end; ++p)
+            PutUnsafe(*os_, static_cast<typename OutputStream::Ch>(*p));
+        return true;
+    }
+
+    bool WriteString(const Ch* str, SizeType length)  {
+        static const typename OutputStream::Ch hexDigits[16] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
+        static const char escape[256] = {
+#define Z16 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+            //0    1    2    3    4    5    6    7    8    9    A    B    C    D    E    F
+            'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'b', 't', 'n', 'u', 'f', 'r', 'u', 'u', // 00
+            'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', 'u', // 10
+              0,   0, '"',   0,   0,   0,   0,   0,   0,   0,   0,   0,   0,   0,   0,   0, // 20
+            Z16, Z16,                                                                       // 30~4F
+              0,   0,   0,   0,   0,   0,   0,   0,   0,   0,   0,   0,'\\',   0,   0,   0, // 50
+            Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16, Z16                                // 60~FF
+#undef Z16
+        };
+
+        if (TargetEncoding::supportUnicode)
+            PutReserve(*os_, 2 + length * 6); // "\uxxxx..."
+        else
+            PutReserve(*os_, 2 + length * 12);  // "\uxxxx\uyyyy..."
+
+        PutUnsafe(*os_, '\"');
+        GenericStringStream<SourceEncoding> is(str);
+        while (ScanWriteUnescapedString(is, length)) {
+            const Ch c = is.Peek();
+            if (!TargetEncoding::supportUnicode && static_cast<unsigned>(c) >= 0x80) {
+                // Unicode escaping
+                unsigned codepoint;
+                if (RAPIDJSON_UNLIKELY(!SourceEncoding::Decode(is, &codepoint)))
+                    return false;
+                PutUnsafe(*os_, '\\');
+                PutUnsafe(*os_, 'u');
+                if (codepoint <= 0xD7FF || (codepoint >= 0xE000 && codepoint <= 0xFFFF)) {
+                    PutUnsafe(*os_, hexDigits[(codepoint >> 12) & 15]);
+                    PutUnsafe(*os_, hexDigits[(codepoint >>  8) & 15]);
+                    PutUnsafe(*os_, hexDigits[(codepoint >>  4) & 15]);
+                    PutUnsafe(*os_, hexDigits[(codepoint      ) & 15]);
+                }
+                else {
+                    RAPIDJSON_ASSERT(codepoint >= 0x010000 && codepoint <= 0x10FFFF);
+                    // Surrogate pair
+                    unsigned s = codepoint - 0x010000;
+                    unsigned lead = (s >> 10) + 0xD800;
+                    unsigned trail = (s & 0x3FF) + 0xDC00;
+                    PutUnsafe(*os_, hexDigits[(lead >> 12) & 15]);
+                    PutUnsafe(*os_, hexDigits[(lead >>  8) & 15]);
+                    PutUnsafe(*os_, hexDigits[(lead >>  4) & 15]);
+                    PutUnsafe(*os_, hexDigits[(lead      ) & 15]);
+                    PutUnsafe(*os_, '\\');
+                    PutUnsafe(*os_, 'u');
+                    PutUnsafe(*os_, hexDigits[(trail >> 12) & 15]);
+                    PutUnsafe(*os_, hexDigits[(trail >>  8) & 15]);
+                    PutUnsafe(*os_, hexDigits[(trail >>  4) & 15]);
+                    PutUnsafe(*os_, hexDigits[(trail      ) & 15]);                    
+                }
+            }
+            else if ((sizeof(Ch) == 1 || static_cast<unsigned>(c) < 256) && RAPIDJSON_UNLIKELY(escape[static_cast<unsigned char>(c)]))  {
+                is.Take();
+                PutUnsafe(*os_, '\\');
+                PutUnsafe(*os_, static_cast<typename OutputStream::Ch>(escape[static_cast<unsigned char>(c)]));
+                if (escape[static_cast<unsigned char>(c)] == 'u') {
+                    PutUnsafe(*os_, '0');
+                    PutUnsafe(*os_, '0');
+                    PutUnsafe(*os_, hexDigits[static_cast<unsigned char>(c) >> 4]);
+                    PutUnsafe(*os_, hexDigits[static_cast<unsigned char>(c) & 0xF]);
+                }
+            }
+            else if (RAPIDJSON_UNLIKELY(!(writeFlags & kWriteValidateEncodingFlag ? 
+                Transcoder<SourceEncoding, TargetEncoding>::Validate(is, *os_) :
+                Transcoder<SourceEncoding, TargetEncoding>::TranscodeUnsafe(is, *os_))))
+                return false;
+        }
+        PutUnsafe(*os_, '\"');
+        return true;
+    }
+
+    bool ScanWriteUnescapedString(GenericStringStream<SourceEncoding>& is, size_t length) {
+        return RAPIDJSON_LIKELY(is.Tell() < length);
+    }
+
+    bool WriteStartObject() { os_->Put('{'); return true; }
+    bool WriteEndObject()   { os_->Put('}'); return true; }
+    bool WriteStartArray()  { os_->Put('['); return true; }
+    bool WriteEndArray()    { os_->Put(']'); return true; }
+
+    bool WriteRawValue(const Ch* json, size_t length) {
+        PutReserve(*os_, length);
+        GenericStringStream<SourceEncoding> is(json);
+        while (RAPIDJSON_LIKELY(is.Tell() < length)) {
+            RAPIDJSON_ASSERT(is.Peek() != '\0');
+            if (RAPIDJSON_UNLIKELY(!(writeFlags & kWriteValidateEncodingFlag ? 
+                Transcoder<SourceEncoding, TargetEncoding>::Validate(is, *os_) :
+                Transcoder<SourceEncoding, TargetEncoding>::TranscodeUnsafe(is, *os_))))
+                return false;
+        }
+        return true;
+    }
+
+    void Prefix(Type type) {
+        (void)type;
+        if (RAPIDJSON_LIKELY(level_stack_.GetSize() != 0)) { // this value is not at root
+            Level* level = level_stack_.template Top<Level>();
+            if (level->valueCount > 0) {
+                if (level->inArray) 
+                    os_->Put(','); // add comma if it is not the first element in array
+                else  // in object
+                    os_->Put((level->valueCount % 2 == 0) ? ',' : ':');
+            }
+            if (!level->inArray && level->valueCount % 2 == 0)
+                RAPIDJSON_ASSERT(type == kStringType);  // if it's in object, then even number should be a name
+            level->valueCount++;
+        }
+        else {
+            RAPIDJSON_ASSERT(!hasRoot_);    // Should only has one and only one root.
+            hasRoot_ = true;
+        }
+    }
+
+    // Flush the value if it is the top level one.
+    bool EndValue(bool ret) {
+        if (RAPIDJSON_UNLIKELY(level_stack_.Empty()))   // end of json text
+            Flush();
+        return ret;
+    }
+
+    OutputStream* os_;
+    internal::Stack<StackAllocator> level_stack_;
+    int maxDecimalPlaces_;
+    bool hasRoot_;
+
+private:
+    // Prohibit copy constructor & assignment operator.
+    Writer(const Writer&);
+    Writer& operator=(const Writer&);
+};
+
+// Full specialization for StringStream to prevent memory copying
+
+template<>
+inline bool Writer<StringBuffer>::WriteInt(int i) {
+    char *buffer = os_->Push(11);
+    const char* end = internal::i32toa(i, buffer);
+    os_->Pop(static_cast<size_t>(11 - (end - buffer)));
+    return true;
+}
+
+template<>
+inline bool Writer<StringBuffer>::WriteUint(unsigned u) {
+    char *buffer = os_->Push(10);
+    const char* end = internal::u32toa(u, buffer);
+    os_->Pop(static_cast<size_t>(10 - (end - buffer)));
+    return true;
+}
+
+template<>
+inline bool Writer<StringBuffer>::WriteInt64(int64_t i64) {
+    char *buffer = os_->Push(21);
+    const char* end = internal::i64toa(i64, buffer);
+    os_->Pop(static_cast<size_t>(21 - (end - buffer)));
+    return true;
+}
+
+template<>
+inline bool Writer<StringBuffer>::WriteUint64(uint64_t u) {
+    char *buffer = os_->Push(20);
+    const char* end = internal::u64toa(u, buffer);
+    os_->Pop(static_cast<size_t>(20 - (end - buffer)));
+    return true;
+}
+
+template<>
+inline bool Writer<StringBuffer>::WriteDouble(double d) {
+    if (internal::Double(d).IsNanOrInf()) {
+        // Note: This code path can only be reached if (RAPIDJSON_WRITE_DEFAULT_FLAGS & kWriteNanAndInfFlag).
+        if (!(kWriteDefaultFlags & kWriteNanAndInfFlag))
+            return false;
+        if (internal::Double(d).IsNan()) {
+            PutReserve(*os_, 3);
+            PutUnsafe(*os_, 'N'); PutUnsafe(*os_, 'a'); PutUnsafe(*os_, 'N');
+            return true;
+        }
+        if (internal::Double(d).Sign()) {
+            PutReserve(*os_, 9);
+            PutUnsafe(*os_, '-');
+        }
+        else
+            PutReserve(*os_, 8);
+        PutUnsafe(*os_, 'I'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'f');
+        PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 'n'); PutUnsafe(*os_, 'i'); PutUnsafe(*os_, 't'); PutUnsafe(*os_, 'y');
+        return true;
+    }
+    
+    char *buffer = os_->Push(25);
+    char* end = internal::dtoa(d, buffer, maxDecimalPlaces_);
+    os_->Pop(static_cast<size_t>(25 - (end - buffer)));
+    return true;
+}
+
+#if defined(RAPIDJSON_SSE2) || defined(RAPIDJSON_SSE42)
+template<>
+inline bool Writer<StringBuffer>::ScanWriteUnescapedString(StringStream& is, size_t length) {
+    if (length < 16)
+        return RAPIDJSON_LIKELY(is.Tell() < length);
+
+    if (!RAPIDJSON_LIKELY(is.Tell() < length))
+        return false;
+
+    const char* p = is.src_;
+    const char* end = is.head_ + length;
+    const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+    const char* endAligned = reinterpret_cast<const char*>(reinterpret_cast<size_t>(end) & static_cast<size_t>(~15));
+    if (nextAligned > end)
+        return true;
+
+    while (p != nextAligned)
+        if (*p < 0x20 || *p == '\"' || *p == '\\') {
+            is.src_ = p;
+            return RAPIDJSON_LIKELY(is.Tell() < length);
+        }
+        else
+            os_->PutUnsafe(*p++);
+
+    // The rest of string using SIMD
+    static const char dquote[16] = { '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"', '\"' };
+    static const char bslash[16] = { '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' };
+    static const char space[16]  = { 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F, 0x1F };
+    const __m128i dq = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&dquote[0]));
+    const __m128i bs = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&bslash[0]));
+    const __m128i sp = _mm_loadu_si128(reinterpret_cast<const __m128i *>(&space[0]));
+
+    for (; p != endAligned; p += 16) {
+        const __m128i s = _mm_load_si128(reinterpret_cast<const __m128i *>(p));
+        const __m128i t1 = _mm_cmpeq_epi8(s, dq);
+        const __m128i t2 = _mm_cmpeq_epi8(s, bs);
+        const __m128i t3 = _mm_cmpeq_epi8(_mm_max_epu8(s, sp), sp); // s < 0x20 <=> max(s, 0x1F) == 0x1F
+        const __m128i x = _mm_or_si128(_mm_or_si128(t1, t2), t3);
+        unsigned short r = static_cast<unsigned short>(_mm_movemask_epi8(x));
+        if (RAPIDJSON_UNLIKELY(r != 0)) {   // some of characters is escaped
+            SizeType len;
+#ifdef _MSC_VER         // Find the index of first escaped
+            unsigned long offset;
+            _BitScanForward(&offset, r);
+            len = offset;
+#else
+            len = static_cast<SizeType>(__builtin_ffs(r) - 1);
+#endif
+            char* q = reinterpret_cast<char*>(os_->PushUnsafe(len));
+            for (size_t i = 0; i < len; i++)
+                q[i] = p[i];
+
+            p += len;
+            break;
+        }
+        _mm_storeu_si128(reinterpret_cast<__m128i *>(os_->PushUnsafe(16)), s);
+    }
+
+    is.src_ = p;
+    return RAPIDJSON_LIKELY(is.Tell() < length);
+}
+#elif defined(RAPIDJSON_NEON)
+template<>
+inline bool Writer<StringBuffer>::ScanWriteUnescapedString(StringStream& is, size_t length) {
+    if (length < 16)
+        return RAPIDJSON_LIKELY(is.Tell() < length);
+
+    if (!RAPIDJSON_LIKELY(is.Tell() < length))
+        return false;
+
+    const char* p = is.src_;
+    const char* end = is.head_ + length;
+    const char* nextAligned = reinterpret_cast<const char*>((reinterpret_cast<size_t>(p) + 15) & static_cast<size_t>(~15));
+    const char* endAligned = reinterpret_cast<const char*>(reinterpret_cast<size_t>(end) & static_cast<size_t>(~15));
+    if (nextAligned > end)
+        return true;
+
+    while (p != nextAligned)
+        if (*p < 0x20 || *p == '\"' || *p == '\\') {
+            is.src_ = p;
+            return RAPIDJSON_LIKELY(is.Tell() < length);
+        }
+        else
+            os_->PutUnsafe(*p++);
+
+    // The rest of string using SIMD
+    const uint8x16_t s0 = vmovq_n_u8('"');
+    const uint8x16_t s1 = vmovq_n_u8('\\');
+    const uint8x16_t s2 = vmovq_n_u8('\b');
+    const uint8x16_t s3 = vmovq_n_u8(32);
+
+    for (; p != endAligned; p += 16) {
+        const uint8x16_t s = vld1q_u8(reinterpret_cast<const uint8_t *>(p));
+        uint8x16_t x = vceqq_u8(s, s0);
+        x = vorrq_u8(x, vceqq_u8(s, s1));
+        x = vorrq_u8(x, vceqq_u8(s, s2));
+        x = vorrq_u8(x, vcltq_u8(s, s3));
+
+        x = vrev64q_u8(x);                     // Rev in 64
+        uint64_t low = vgetq_lane_u64(vreinterpretq_u64_u8(x), 0);   // extract
+        uint64_t high = vgetq_lane_u64(vreinterpretq_u64_u8(x), 1);  // extract
+
+        SizeType len = 0;
+        bool escaped = false;
+        if (low == 0) {
+            if (high != 0) {
+                uint32_t lz = internal::clzll(high);
+                len = 8 + (lz >> 3);
+                escaped = true;
+            }
+        } else {
+            uint32_t lz = internal::clzll(low);
+            len = lz >> 3;
+            escaped = true;
+        }
+        if (RAPIDJSON_UNLIKELY(escaped)) {   // some of characters is escaped
+            char* q = reinterpret_cast<char*>(os_->PushUnsafe(len));
+            for (size_t i = 0; i < len; i++)
+                q[i] = p[i];
+
+            p += len;
+            break;
+        }
+        vst1q_u8(reinterpret_cast<uint8_t *>(os_->PushUnsafe(16)), s);
+    }
+
+    is.src_ = p;
+    return RAPIDJSON_LIKELY(is.Tell() < length);
+}
+#endif // RAPIDJSON_NEON
+
+RAPIDJSON_NAMESPACE_END
+
+#if defined(_MSC_VER) || defined(__clang__)
+RAPIDJSON_DIAG_POP
+#endif
+
+#endif // RAPIDJSON_RAPIDJSON_H_
diff --git a/General/General/libGeneral_custom_main.cpp b/General/General/libGeneral_custom_main.cpp
new file mode 100644
index 0000000..a202ebe
--- /dev/null
+++ b/General/General/libGeneral_custom_main.cpp
@@ -0,0 +1,58 @@
+/**
+* @headerfile			tcua ͷ�ļ�
+*/
+#include <tc/tc.h>
+#include <tccore/custom.h>
+#include <server_exits/user_server_exits.h>
+#include "error_handling.h"
+#include "epm_register_handler.h"//�������ͷ�ļ���������ע��handler
+#include "epm_handler_common.h"
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+	/**
+	* @fn					extern "C" DLLAPI int liborigin_register_callbacks
+	* @return				usually return ITK_ok
+	* @brief				liborigin customization entry
+	* �˺��������й淶��д����������dll������(JK_itk)����"_"��ͷ,����dz�������
+	*/
+	DLLAPI int General_register_callbacks()//ע��˴���General��dll�����ƣ�����д����ע���ʧ��
+	{
+		int ifail = ITK_ok;
+		TC_write_syslog("*******************************************************************************\n");
+		TC_write_syslog("*           General_register_callbacks  is starting                  *\n");
+		TC_write_syslog("*******************************************************************************\n");
+
+
+		
+
+
+//		ITKCALL(ifail = CUSTOM_register_exit( "JK_itk", "USER_init_module",
+//		(CUSTOM_EXIT_ftn_t)USERSERVICE_custom_register_runtime_methods) );
+//	
+//		 Register_revise_msg();
+			 Register_revise_msg();
+		//ע��handler����ڣ�ת��ע�᷽�����ļ������ļ���������ע��handler��ͷ�ļ�
+		//USERSERVICE_custom_register_handlers�Ǿ����ע��handler���ļ�
+		ITKCALL( ifail = CUSTOM_register_exit("General","USER_gs_shell_init_module",//ע��˴���General��dll�����ƣ�����д����ע���ʧ��
+		(CUSTOM_EXIT_ftn_t)USERSERVICE_custom_register_handlers) );
+		fprintf( stdout, "\n General	registering USERSERVICE_custom_register_handlers completed!\n" );
+		ITKCALL(ifail = CUSTOM_register_exit("General", "USERSERVICE_register_methods", (CUSTOM_EXIT_ftn_t)USERSERVICE_custom_register_methods));
+		if (ifail == ITK_ok) {
+			fprintf(stdout, "USERSERVICE_register_methods ע��ɹ���\n");
+		}
+		else {
+			fprintf(stdout, "USERSERVICE_register_methods ע��ʧ�ܣ�\n");
+		}
+	
+
+		return ifail;
+	}
+
+#ifdef __cplusplus
+}
+#endif
\ No newline at end of file
diff --git a/General/General/ocilib.cpp b/General/General/ocilib.cpp
new file mode 100644
index 0000000..ab9eaee
--- /dev/null
+++ b/General/General/ocilib.cpp
@@ -0,0 +1,441 @@
+/*=====================================================================================================================
+					Copyright(c) 2012 ORIGIN.
+							 Unpublished - All rights reserved
+=======================================================================================================================
+File description:
+
+	Filename: ocilib.cxx
+	Module  : OCI
+
+		This file describes OCI library Package.
+
+=======================================================================================================================
+Date               Name              Description of Change
+1-Feb-2015         Ray	li     Initialize creation
+$HISTORY$
+=====================================================================================================================*/
+#include "ocilib.h"
+#include <stdlib.h>
+
+#define NUM 100
+#define USERNAME "MES"
+#define PASSWORD "infodba"
+#define DBNAME "TCPORD"
+
+
+// �������ṹ
+typedef struct {
+	OCIEnv* p_env;                 //OCI environment handle	 �������
+	OCIError* p_err;             //OCI error handle			 ������
+	OCISvcCtx* p_svc;             //OCI service context handel ���������ľ��
+	OCIServer* p_ser;             //OCI server handle          ���������
+	OCISession* p_usr;             //OCI user session handle    �û��Ự���
+	OCIStmt* p_sql;                 //OCI statement handle       �����
+	OCIDefine* p_dfn;             //OCI define handle			 ������
+	OCIBind* p_bnd;                 //OCI bind handle			 �󶨾��
+}OCIHandleInfo;
+
+
+// ����������ṹ
+typedef struct {
+	OCIEnv* p_env;
+	OCIError* p_err;
+	OCISvcCtx* p_svc;
+	OCIStmt* p_sql;
+	OCIDefine* p_dfn;
+	OCIBind* p_bnd;
+}OCIDATA;
+
+
+// ����ִ�����ʱ����������
+typedef struct {
+	char value[NUM][NUM];
+	char type[NUM][NUM];
+}SqlField;
+
+
+// �����ѯ���ʱ�������,�������
+typedef struct {
+	int  naIntValue[NUM];
+	int  nIntNum;
+	char caCharValue[500][500];
+	int  nCharNum;
+}SqlSelField;
+
+OCIHandleInfo* ociHandle = NULL;
+OCIHandleInfo ociHand;
+
+int InitHandle();
+int _ExeSQL(char* SQL, char** inputValue, int inputValueCount);
+int _QuerySQL(char* SQL, SqlSelField* pOutField, SqlSelField* pSelField);
+int GetDataFromQuery(int* pRc, SqlSelField* pOutField);
+void QuitFreeHandle();
+
+
+
+
+/****************************************************************************************************************************************
+�������ƣ�
+�������ܣ�
+��ڲ�����
+���ڲ�����
+�� ע��
+*****************************************************************************************************************************************/
+
+
+// ��ʼ��Handler
+int InitHandle()
+{
+	int swResult;
+
+	ociHandle = &ociHand;
+
+
+	/*create OCI environment*/
+	if (swResult = OCIEnvCreate(&ociHandle->p_env, OCI_DEFAULT, NULL, NULL, NULL, NULL, 0, NULL))               //�������
+	{
+		printf("environment create error!\n\n");
+		return -1;
+	}
+	else
+	{
+		printf("environment create success!\n\n");
+		//return 0;
+	}
+
+	/*init handle*/
+	if (swResult = OCIHandleAlloc(ociHandle->p_env, (dvoid**)&ociHandle->p_ser, OCI_HTYPE_SERVER, 0, NULL))    //���������
+	{
+		printf("init server handle error!\n\n");
+		return -1;
+	}
+
+
+	if (swResult = OCIHandleAlloc(ociHandle->p_env, (dvoid**)&ociHandle->p_err, OCI_HTYPE_ERROR, 0, NULL))    //������
+	{
+		printf("init error handle error!\n\n");
+		return -1;
+	}
+
+
+	if (swResult = OCIHandleAlloc(ociHandle->p_env, (dvoid**)&ociHandle->p_usr, OCI_HTYPE_SESSION, 0, NULL))    //������
+	{
+		printf("init session handle error!\n\n");
+		return -1;
+	}
+
+
+	if (swResult = OCIHandleAlloc(ociHandle->p_env, (dvoid**)&ociHandle->p_svc, OCI_HTYPE_SVCCTX, 0, NULL))    //�����ľ��
+	{
+		printf("init service context handle error!\n\n");
+		return -1;
+	}
+
+
+	if (swResult = OCIHandleAlloc(ociHandle->p_env, (dvoid**)&ociHandle->p_sql, OCI_HTYPE_STMT, 0, NULL))        //SQL�����
+	{
+		printf("init statement handle error!\n\n");
+		return -1;
+	}
+
+	printf("init handle success!\n\n");
+
+	return 0;
+}
+
+
+
+// �������ݿ������
+int ConnServer(char* username, char* password, char* dbname)
+{
+	int		swResult;
+	char	errbuf[100] = { 0 };
+	int		errcode;
+
+	if (InitHandle() == -1)//��ʼ�����
+		return -1;
+
+	if (swResult = OCILogon(ociHandle->p_env, ociHandle->p_err, &ociHandle->p_svc, (text*)username, strlen(username), (text*)password, strlen(password), (text*)dbname, strlen(dbname)))
+	{
+		OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+		printf("Error - %.*s/n", 512, errbuf);
+		return -1;
+	}
+	else
+		printf("���ݿ����ӳɹ�!\n\n");
+	return 0;
+}
+
+
+
+// SQL���ij���(ִ��SQL���)
+int _ExeSQL(char* SQL, char** inputValue, int inputValueCount)
+{
+	int swResult, i;
+	int	errcode;
+
+	//���ð󶨱���
+	OCIBind* p_bndp[100];
+
+	//׼��SQL���
+	if (swResult = OCIStmtPrepare(ociHandle->p_sql, ociHandle->p_err, (text*)SQL, strlen(SQL), OCI_NTV_SYNTAX, OCI_DEFAULT))
+	{
+		printf("prepare SQL statements error!\n\n");
+	}
+	else
+	{
+		printf("prepare SQL statements success!\n\n");
+	}
+
+
+	// ���������
+	for (i = 0; i < inputValueCount; i++)
+	{
+		char	errbuf[100] = { 0 };
+		if (swResult = OCIBindByPos(ociHandle->p_sql, &p_bndp[i], ociHandle->p_err, i + 1, (dvoid*)inputValue[i], (sb4)strlen(inputValue[i]) + 1, SQLT_STR, (dvoid*)0, (ub2*)0, (ub2*)0, (ub4)0, (ub4*)0, OCI_DEFAULT))
+		{
+			OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+			printf("Bind Error - %.*s/n", 512, errbuf);
+			return -1;
+		}
+	}
+
+	//ִ��SQL statements
+	if (swResult = OCIStmtExecute(ociHandle->p_svc, ociHandle->p_sql, ociHandle->p_err, 1, 0, NULL, NULL, OCI_DEFAULT))
+	{
+		char	errbuf[100] = { 0 };
+		OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+		printf("execute SQL statement Error - %.*s\n", 512, errbuf);
+		return -1;
+	}
+	else
+	{
+		printf("execute SQL statement success!\n\n");
+	}
+	return 0;
+}
+
+
+
+
+// ��ѯSQL
+int _QuerySQL(char* SQL, SqlSelField* pOutField, SqlSelField* pSelField)
+{
+	sword status;
+	int		rc = 0, ret = 0;
+	char	errbuf[100] = { 0 };
+	int		maxNum = 2048;
+	char	chTag[8];
+	int		iIndex = 0;
+	int		outputColumn = 0;
+	int		errcode = 0;
+	char	nullValue = '\0'; // 
+	sb2     sb2aInd[30] = { '\0' };
+
+	// ׼��SQL���
+	status = OCIStmtPrepare(ociHandle->p_sql, ociHandle->p_err, (text*)SQL, (ub4)strlen(SQL), (ub4)OCI_NTV_SYNTAX, (ub4)OCI_DEFAULT);
+
+	if (status != OCI_SUCCESS)
+	{
+		printf("SQL Preparing failed/n");
+		return -1;
+	}
+
+
+	// ��int���͵�, ����SQL���ʱ :1,:2, �����������
+	for (iIndex = 0; iIndex < pSelField->nIntNum; iIndex++)
+	{
+		memset(chTag, 0, 8);
+		sprintf(chTag, ":%d", iIndex + 1);
+		if (rc = OCIBindByName(ociHandle->p_sql, (OCIBind**)&ociHandle->p_dfn, ociHandle->p_err, (text*)chTag, (sb4)strlen((char*)chTag), (dvoid*)&pSelField->naIntValue[iIndex], sizeof(int), SQLT_INT, (dvoid*)0, (ub2*)0, (ub2*)0, (ub4)0, (ub4*)0, OCI_DEFAULT))
+		{
+			OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+			printf("BindByPos Error of ociHandle->p_sql - %.*s\n", 512, errbuf);
+			return -1;
+		}
+	}
+
+	// ��char *���͵�, ����SQL���ʱ :3,:4, �����������
+	for (iIndex = 0; iIndex < pSelField->nCharNum; iIndex++)
+	{
+		int  n = 0;
+		memset(chTag, 0, 8);
+		n = pSelField->nIntNum + iIndex + 1;
+		sprintf(chTag, ":%d", n);
+		if (rc = OCIBindByName(ociHandle->p_sql, (OCIBind**)&ociHandle->p_dfn, ociHandle->p_err, (text*)chTag, (sb4)strlen((char*)chTag), (dvoid*)&pSelField->caCharValue[iIndex], NUM, SQLT_STR, (dvoid*)0, (ub2*)0, (ub2*)0, (ub4)0, (ub4*)0, OCI_DEFAULT))
+		{
+			OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+			printf("BindByPos Error of ociHandle->p_sql - %.*s\n", 512, errbuf);
+			return -1;
+		}
+	}
+
+
+	// ִ��SQL���
+	if (rc = OCIStmtExecute(ociHandle->p_svc, ociHandle->p_sql, ociHandle->p_err, (ub4)0, (ub4)0, (CONST OCISnapshot*) NULL, (OCISnapshot*)NULL, OCI_STMT_SCROLLABLE_READONLY))
+	{
+		OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+		printf("execute SQL  Error - %.*s\n", 512, errbuf);
+		return -1;
+	}
+	else
+	{
+		printf("execute SQL  success!\n\n");
+	}
+
+
+	if (ret = OCIAttrGet(ociHandle->p_sql, (ub4)OCI_HTYPE_STMT, (dvoid*)&outputColumn, (ub4*)0, (ub4)OCI_ATTR_PARAM_COUNT, ociHandle->p_err))
+	{
+		OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+		printf("Get OCIAttr Error of ociHandle->p_sql - %.*s\n", 512, errbuf);
+		return -1;
+	}
+
+
+	// ��int���͵�, ����SQL���ʱ :1,:2, �����������
+	for (iIndex = 0; iIndex < pOutField->nIntNum; iIndex++)
+	{
+		if (rc = OCIDefineByPos(ociHandle->p_sql, &ociHandle->p_dfn, ociHandle->p_err, iIndex + 1, (dvoid*)&pOutField->naIntValue[iIndex], sizeof(int), SQLT_INT, (dvoid*)0, (ub2*)0, (ub2*)0, OCI_DEFAULT))
+		{
+			OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+			printf("DefineByPos Error of ociHandle->p_sql - %.*s\n", 512, errbuf);
+			return -1;
+		}
+	}
+
+
+	// ��char *���͵�, ����SQL���ʱ :1,:2, �����������
+	for (iIndex = 0; iIndex < outputColumn; iIndex++)
+	{
+		int  n = iIndex + 1;
+		if (rc = OCIDefineByPos(ociHandle->p_sql, &ociHandle->p_dfn, ociHandle->p_err, n, (dvoid*)&pOutField->caCharValue[iIndex], 1000 * sizeof(char), SQLT_STR, (dvoid*)0, (ub2*)0, (ub2*)0, OCI_DEFAULT))
+		{
+			OCIErrorGet((dvoid*)ociHandle->p_err, (ub4)1, (text*)NULL, &errcode, (ub1*)errbuf, (ub4)sizeof(errbuf), OCI_HTYPE_ERROR);
+			printf("DefineByPos Error of ociHandle->p_sql - %.*s\n", 512, errbuf);
+			return -1;
+		}
+	}
+
+	return 0;
+
+}
+
+
+
+// �ͷ�Handler
+void QuitFreeHandle()
+{
+	// �˳�������
+	OCILogoff(ociHandle->p_svc, ociHandle->p_err);
+	printf("Quit success!\n");
+
+	// �ͷž��
+	OCIHandleFree(ociHandle->p_ser, OCI_HTYPE_SERVER);            //�ͷŷ��������
+	OCIHandleFree(ociHandle->p_err, OCI_HTYPE_ERROR);            //�ͷŴ�����
+	OCIHandleFree(ociHandle->p_usr, OCI_HTYPE_SESSION);        //�ͷ�������
+	OCIHandleFree(ociHandle->p_svc, OCI_HTYPE_SVCCTX);            //�ͷ������ľ��
+	OCIHandleFree(ociHandle->p_sql, OCI_HTYPE_STMT);            //�ͷ�SQL�����
+}
+
+
+// ִ�������
+int ExecuteSQL(char* SQL, int valueCount, char** value)
+{
+	int i = 0;
+
+	if (i = _ExeSQL(SQL, value, valueCount))
+	{
+		printf("��������1\n");
+		QuitFreeHandle();
+		return -1;
+	}
+	printf("��������2\n");
+	return 0;
+}
+
+
+// ����������IJ�ѯ
+int QuerySQL(char* SQL, int inputValueCount, char** inputValue, int* outputColumn, int* outputValueCount, char**** outputValue)
+{
+	int i = 0, j = 0, ret = 0;
+
+	int times = 0, temp = 0;
+
+	SqlSelField infield;
+	SqlSelField outField;
+
+	// ��ʼ�������ṹ
+	infield.nCharNum = inputValueCount;
+	infield.nIntNum = 0;
+	outField.nCharNum = 0;
+	outField.nIntNum = 0;
+
+	*outputColumn = 0;
+	*outputValueCount = 0;
+
+	for (i = 0; i < inputValueCount; i++)
+	{
+		strcpy(infield.caCharValue[i], inputValue[i]);
+	}
+
+	// ִ�в�ѯ���
+
+
+	if (ret = _QuerySQL(SQL, &outField, &infield))
+	{
+		printf("SQL��ѯʧ��!\n");
+		QuitFreeHandle();
+		return -1;
+	}
+
+	// ��ȡ�������
+	ret = OCIAttrGet(ociHandle->p_sql, (ub4)OCI_HTYPE_STMT, (dvoid*)outputColumn, (ub4*)0, (ub4)OCI_ATTR_PARAM_COUNT, ociHandle->p_err);
+
+	// ��ȡ���һ��,����ȥ����
+	ret = OCIStmtFetch2(ociHandle->p_sql, ociHandle->p_err, 1, OCI_FETCH_LAST, 0, OCI_DEFAULT);
+	// ��ȡ�������
+	ret = OCIAttrGet(ociHandle->p_sql, (ub4)OCI_HTYPE_STMT, (dvoid*)outputValueCount, (ub4*)0, (ub4)OCI_ATTR_ROW_COUNT, ociHandle->p_err);
+
+	if (*outputValueCount == 0)
+		return 0;
+
+
+	// ��ʼ�����ڴ沢�Ҵ洢
+	ret = OCIStmtFetch2(ociHandle->p_sql, ociHandle->p_err, 1, OCI_FETCH_FIRST, 0, OCI_DEFAULT);
+	*outputValue = (char***)calloc((*outputValueCount) + 1, sizeof(char**));
+	do
+	{
+		(*outputValue)[i] = (char**)calloc((*outputColumn) + 1, sizeof(char*));
+		for (j = 0; j < (*outputColumn); j++)
+		{
+			(*outputValue)[i][j] = (char*)calloc(1000, sizeof(char));
+			strcpy((*outputValue)[i][j], outField.caCharValue[j]);
+			//printf("outValue[%d][%d] = %s , ��ַ=%d, ��ָ���ַ= %d\n ",i,j,(*outputValue)[i][j],&(*outputValue)[i][j],(*outputValue)[i][j]);
+		}
+		i++;
+	} while ((ret = OCIStmtFetch2(ociHandle->p_sql, ociHandle->p_err, 1, OCI_FETCH_NEXT, 1, OCI_DEFAULT) != OCI_NO_DATA));
+
+	return 0;
+}
+
+
+// ����������IJ�ѯ
+int QuerySQLNoInputParam(char* SQL, int* outputColumn, int* outputValueCount, char**** outputValue)
+{
+	return QuerySQL(SQL, 0, NULL, outputColumn, outputValueCount, outputValue);
+}
+
+// �޲�������
+int ExecuteSQLNoInputParam(char* SQL)
+{
+	printf("��ʼ����\n");
+	return ExecuteSQL(SQL, 0, NULL);
+}
+
+// �Ͽ�����
+void DisConnServer()
+{
+	if (ociHandle != NULL)
+		QuitFreeHandle();
+}
+
diff --git a/General/General/ocilib.h b/General/General/ocilib.h
new file mode 100644
index 0000000..992e2bf
--- /dev/null
+++ b/General/General/ocilib.h
@@ -0,0 +1,99 @@
+#pragma once
+/*=====================================================================================================================
+					Copyright(c) 2012 ORIGIN.
+							 Unpublished - All rights reserved
+=======================================================================================================================
+File description:
+
+	Filename: ocilib.h
+	Module  : OCI
+
+		This Header file of OCI library Package.
+
+=======================================================================================================================
+Date               Name              Description of Change
+1-Feb-2015         Ray				Initialize creation
+$HISTORY$
+=====================================================================================================================*/
+#include <oci.h>
+#include <stdio.h>
+#include <memory.h>
+#include <string.h>
+#include <malloc.h>
+//#include <limits.h>
+
+#define OCI_FAIL 1
+#define OCI_OK 0
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+	/**
+	* �������ݿ�.
+	* @param username     - <I> �û���
+	* @param password     - <I> ����
+	* @param dbname	      - <I> ���ݿ�SID
+	* @return - OCI_OK or error code
+	*
+	*    ORACLE ���ݿ���������װ����
+	*/
+	extern int ConnServer(char* username, char* password, char* dbname);
+
+
+	/**
+	* �������������ִ��SQL���.
+	* @param SQL			- <I> SQL���
+	* @return - OCI_OK or error code
+	*
+	*    ORACLE ���ݿ���������װ����
+	*/
+	extern int ExecuteSQLNoInputParam(char* SQL);
+
+	/**
+	* �����������ִ��SQL���.
+	* @param SQL			     - <I> SQL���
+	* @param inputValueCount     - <I> �����������
+	* @param inputValue			 - <I> �������ֵ
+	* @return - OCI_OK or error code
+	*
+	*    ORACLE ���ݿ���������װ����
+	*/
+	extern int ExecuteSQL(char* SQL, int inputValueCount, char** inputValue);
+
+	/**
+	* ������������IJ�ѯSQL���.
+	* @param SQL					 - <I> SQL���
+	* @param outputColumn			 - <O> ������������
+	* @param outputValueCount        - <O> ������������
+	* @param outputValue			 - <O> ���������
+	* @return - OCI_OK or error code
+	*
+	*    ORACLE ���ݿ���������װ����
+	*/
+	extern int QuerySQLNoInputParam(char* SQL, int* outputColumn, int* outputValueCount, char**** outputValue);
+
+	/**
+	* ����������IJ�ѯSQL���.
+	* @param SQL					 - <I> SQL���
+	* @param inputValueCount         - <I> �����������
+	* @param inputValue			     - <I> �������ֵ
+	* @param outputColumn			 - <O> ������������
+	* @param outputValueCount        - <O> ������������
+	* @param outputValue			 - <O> ���������
+	* @return - OCI_OK or error code
+	*
+	*    ORACLE ���ݿ���������װ����
+	*/
+	extern int QuerySQL(char* SQL, int inputValueCount, char** inputValue, int* outputColumn, int* outputValueCount, char**** outputValue);
+
+	/**
+	* �Ͽ����ݿ�����.
+	*
+	*    ORACLE ���ݿ���������װ����
+	*/
+	extern void DisConnServer();
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/General/General/stdafx.cpp b/General/General/stdafx.cpp
new file mode 100644
index 0000000..aabb630
--- /dev/null
+++ b/General/General/stdafx.cpp
@@ -0,0 +1,8 @@
+// stdafx.cpp : ֻ������׼�����ļ���Դ�ļ�
+// General.pch ����ΪԤ����ͷ
+// stdafx.obj ������Ԥ����������Ϣ
+
+#include "stdafx.h"
+
+// TODO: �� STDAFX.H ��
+// �����κ�����ĸ���ͷ�ļ����������ڴ��ļ�������
diff --git a/General/General/stdafx.h b/General/General/stdafx.h
new file mode 100644
index 0000000..dea91e7
--- /dev/null
+++ b/General/General/stdafx.h
@@ -0,0 +1,16 @@
+// stdafx.h : ��׼ϵͳ�����ļ��İ����ļ���
+// ���Ǿ���ʹ�õ��������ĵ�
+// �ض�����Ŀ�İ����ļ�
+//
+
+#pragma once
+
+#include "targetver.h"
+
+#define WIN32_LEAN_AND_MEAN             //  �� Windows ͷ�ļ����ų�����ʹ�õ���Ϣ
+// Windows ͷ�ļ�:
+#include <windows.h>
+
+
+
+// TODO: �ڴ˴����ó�����Ҫ������ͷ�ļ�
diff --git a/General/General/string_utils.cxx b/General/General/string_utils.cxx
new file mode 100644
index 0000000..9f6b79a
--- /dev/null
+++ b/General/General/string_utils.cxx
@@ -0,0 +1,253 @@
+/*==================================================================================================================
+                    Copyright(c) 2012 ORIGIN.
+                             Unpublished - All rights reserved
+====================================================================================================================
+File description:
+    Filename: string_utils.c
+    Module  : Common module.
+
+        This file includes some operations of the string.
+
+====================================================================================================================
+Date                Name             Description of Change
+3-Feb-2015		Ray li    Initialize creation
+$HISTORY$
+===================================================================================================================*/
+#ifndef _cplusplus
+#ifndef _CRT_SECURE_NO_DEPRECATE
+#define _CRT_SECURE_NO_DEPRECATE
+#endif
+#endif
+
+#include <fclasses/tc_string.h>
+#include <tc/tc_util.h>
+#include <itk/mem.h>
+#include <tccore/workspaceobject.h>
+#include <stdlib.h>
+#include <ctype.h>
+
+#include "string_utils.h"
+
+void Split( string strArg, string spliter, vector<string> &ans )
+{
+	ans.clear();
+	size_t index0;
+	string one_arg;
+	if ( strArg.find_first_not_of(' ') == string::npos )
+		strArg = "";
+	while( strArg.size()>0 )
+	{
+		index0 = strArg.find(spliter);
+		if( index0 != string::npos )
+		{
+			one_arg = strArg.substr( 0, index0 );
+			strArg = strArg.substr( index0 + spliter.size() );
+			ans.push_back( one_arg );
+		}
+		else
+		{
+			ans.push_back( strArg );
+			break;
+		}
+	}
+}
+char* GSTR_clone( char **dst, const char *src )
+{
+    char *retVal = NULL;
+    int  srcLen  = 0;
+    
+    *dst = NULL;
+    if (src == NULL)
+        return NULL;
+
+    srcLen = (int)tc_strlen( src ) + 1;
+    *dst   = (char*)MEM_alloc( srcLen * sizeof(char) );
+    retVal = tc_strncpy( *dst, src, srcLen );
+    (*dst)[srcLen - 1] = '\0';
+
+    return retVal;
+}
+
+char* GSTR_copy( char *dst, const char *src, int dstSize )
+{
+    char *retVal = tc_strncpy( dst, src, dstSize );
+    dst[dstSize - 1] = '\0';
+    return retVal;
+}
+
+char* GSTR_int_to_string( char **dst, int value )
+{
+    char strVal[128 + 1];
+
+    *dst = NULL;
+    memset( strVal, 0, sizeof(strVal)/sizeof(char) );
+    sprintf( strVal, "%d", value );
+
+    return GSTR_clone( dst, strVal );
+}
+
+void GSTR_format_int_to_string( char *dst, int digitNum, int value )
+{
+    char sNum[WSO_desc_size_c + 1];
+    sprintf( sNum, "%%0%dd", digitNum );
+    sprintf( dst, sNum, value );
+}
+
+void GSTR_format_string( const char *dst, int m, const char *fill_char, char **out )
+{
+	char sNum[WSO_name_size_c + 1] = {0};
+	char sNew[WSO_name_size_c + 1] = {0};
+	sprintf( sNum, "%%%d.%ds", m, m );
+	sprintf( sNew, sNum, dst );
+	STRNG_replace_str( sNew, " ", fill_char, out );
+}
+
+
+char* GSTR_string_append( const char *s1, const char *s2 )
+{
+    char *s = NULL;
+    if (s1 == NULL || s2 == NULL)
+    {
+        GSTR_clone(&s, s1 == NULL ? (s2 == NULL ? "" : s2) : s1 );
+    }
+    else
+    {
+        int size = (int)tc_strlen(s1) + (int)tc_strlen(s2) + 1;
+        s = (char *)MEM_alloc( size );
+        tc_strcpy( s, s1 );
+        tc_strcat( s, s2 );
+        s[size - 1] = '\0';
+    }
+    return s;
+}
+
+logical GSTR_is_float(const char *str)
+{
+    logical isfloat = true;
+    char *pStr = (char *)str;
+    logical hasPositive = false;
+    logical hasMinus    = false;
+    logical hasDot      = false;
+
+    if (str == NULL)
+        return false;
+
+    while (*pStr != '\0' && isfloat == true)
+    {
+        if ( (*pStr >= '0' && *pStr <= '9'))
+        {
+            //continue;
+        }
+        else if ( *pStr == '+' )
+        {
+            isfloat = (hasPositive ? false : (hasPositive = true));
+        }
+        else if ( *pStr == '-' )
+        {
+            isfloat = (hasMinus ? false : (hasMinus = true));
+        }
+        else if ( *pStr == '.' )
+        {
+            isfloat = (hasDot ? false : (hasDot = true));
+        }
+        else
+            isfloat = false;
+
+        pStr ++;
+    }
+    return isfloat;
+}
+
+logical GSTR_is_number(const char *str)
+{
+	logical is_number = true;
+	char *pStr = (char *)str;
+	if (str == NULL)
+		return false;
+
+	while (*pStr != '\0')
+	{
+		if ( !( (*pStr >= '0' && *pStr <= '9') || *pStr == '-' ) )
+		{
+			is_number = false;
+			break;
+		}
+		pStr ++;
+	}
+	return is_number;
+}
+
+logical GSTR_is_ascii(char ch)
+{
+    return ((unsigned int)ch) < 128;
+}
+
+int GSTR_trim_l( char *str, char s )
+{
+    int count     = 0;
+    char *pointer = str, *poffset = NULL;
+    if (str == NULL || str[0] == '\0')
+        return 0;
+
+    while ( *pointer != '\0' )
+    {
+        if ( *pointer != s )
+        {
+            break;
+        }
+        count++;
+        pointer++;
+    }
+    if (count == 0)
+        return 0;
+
+    poffset = str + count;
+    pointer = str;
+    while ( *poffset != '\0' )
+    {
+        *pointer = *poffset;
+        pointer ++;
+        poffset ++;
+    }
+    *pointer = '\0';
+
+    return count;
+}
+
+int GSTR_trim_r( char *str, char s )
+{
+    int count = 0;
+    char *pointer = NULL;
+    if (str == NULL || str[0] == '\0')
+        return 0;
+
+    pointer = str + ((int) strlen(str) - 1);
+
+    while ( pointer != str )
+    {
+        if ( *pointer != s )
+        {
+            break;
+        }
+
+        *pointer = '\0';
+
+        count++;
+        pointer--;
+    }
+
+    return count;
+}
+
+void GSTR_trim_float( char *floatValue )
+{
+    if ( !IS_EMPTY(floatValue) && tc_strstr(floatValue, ".") != NULL )
+    {
+        int len = 0;
+        GSTR_trim_r(floatValue, '0');
+        len = (int)tc_strlen(floatValue);
+        if (floatValue[ len - 1 ] == '.')
+            floatValue[ len - 1 ] = '\0';
+    }
+}
+
diff --git a/General/General/string_utils.h b/General/General/string_utils.h
new file mode 100644
index 0000000..4b379cc
--- /dev/null
+++ b/General/General/string_utils.h
@@ -0,0 +1,125 @@
+/*=====================================================================================================================
+                    Copyright(c) 2005 ORIGIN PLM Software Corp. All rights reserved.
+                             Unpublished - All rights reserved
+=======================================================================================================================
+File description:
+    Filename: string_utils.h
+    Module  : Common module.
+
+        This file includes some operations of the string.
+
+=======================================================================================================================
+Date               Name              Description of Change
+14-Jul-2009        Ray Li          Initialize creation
+$HISTORY$
+=====================================================================================================================*/
+#ifndef STRING_UTILS_H
+#define STRING_UTILS_H
+#include <string>
+#include <map>
+#include <vector>
+using namespace std;
+#ifdef __cplusplus
+    extern "C"
+    {
+#endif
+
+// @{{ String assister
+#define IS_NULL(S)   ((S)==NULL)
+#define IS_EMPTY(S)  (((S)==NULL) || !(*(S)))
+// @}}
+		void Split( string strArg, string spliter, vector<string> &ans );
+    /**
+    * Clones the string.
+    * @param dst - <OF> the output string.
+    * @param src - <I>  the string to be cloned.
+    * @return - the destinatin string pointer.
+    */
+    extern char* GSTR_clone( char **dst, const char *src );
+
+    /**
+    * Copy safely the string with null end.
+    * @param dst - <O> the output string.
+    * @param src - <I>  the string to be cloned.
+    * @param dstSize - <I> the size of output string.
+    * @return - the destinatin string pointer.
+    */
+    extern char *GSTR_copy( char *dst, const char *src, int dstSize );
+
+    /**
+    * Converts int to string.
+    * @param dst   - <OF> the output string.
+    * @param value - <I>  the int to be cloned.
+    * @return - the destinatin string pointer.
+    */
+    extern char* GSTR_int_to_string( char **dst, int value );
+
+    /**
+    * Formats the int/string value as string.
+    * @param dst      - <O> the destination string.
+    * @param digitNum - <I> the digit number of the value.
+    * @param value    - <I> the value to be converted.
+    * @return - N/A.
+    */
+    extern void GSTR_format_int_to_string( char *dst, int digitNum, int value );
+	extern void GSTR_format_string( const char *dst, int m, const char *fill_char, char **out );
+
+    /**
+    * Appends the strings( never null returned )
+    * @param s1 - <I> string 1
+    * @param s2 - <I> string 2
+    * @return - <OF> new string
+    */
+    extern char* GSTR_string_append( const char *s1, const char *s2 );
+
+    /**
+    * Whether the string is float type
+    * @param str   - <I> The string
+    *
+    *   NOTE: it's only check whether each word is in "+-.0123456789", not care the float with "E" or the float rule, 
+    *         like "00-1.+01", it will return true.
+    * @return - return true if it is one.
+    */
+    extern logical GSTR_is_float(const char *str);
+
+    /**
+    * Whether all char of the string are number
+    * @param str   - <I> The string
+    *
+    *   NOTE: it's only check whether each word is in "0123456789"
+    * @return - return true if it is one.
+    */
+    extern logical GSTR_is_number(const char *str);
+
+    /**
+    * Is ascii char
+    * @param ch - <I> ascii char
+    * @return - return true if it is.
+    */
+    extern logical GSTR_is_ascii(char ch);
+
+    /**
+    * Trims the string's prefix.
+    * @param str - <I> The string
+    * @param s   - <I> The char
+    *
+    * @return - count.
+    */
+    extern int GSTR_trim_l( char *str, char s );
+    extern int GSTR_trim_r( char *str, char s );
+
+    /**
+    * Remove the zero.
+    *   For Example:
+    *       floatValue="50.00"   -> = "50"
+    *       floatValue="50.0100" -> = "50.01"
+    * @return - count.
+    */
+    extern void GSTR_trim_float( char *floatValue );
+
+#ifdef __cplusplus
+    }
+#endif
+
+
+#endif //STRING_UTILS_H
diff --git a/General/General/targetver.h b/General/General/targetver.h
new file mode 100644
index 0000000..7a7d2c8
--- /dev/null
+++ b/General/General/targetver.h
@@ -0,0 +1,8 @@
+#pragma once
+
+// ���� SDKDDKVer.h ��������õ���߰汾�� Windows ƽ̨��
+
+// ���ҪΪ��ǰ�� Windows ƽ̨����Ӧ�ó�������� WinSDKVer.h������
+// WIN32_WINNT ������ΪҪ֧�ֵ�ƽ̨��Ȼ���ٰ��� SDKDDKVer.h��
+
+#include <SDKDDKVer.h>
diff --git a/General/General/tc_log.h b/General/General/tc_log.h
new file mode 100644
index 0000000..81d2584
--- /dev/null
+++ b/General/General/tc_log.h
@@ -0,0 +1,26 @@
+/**
+* @file common_itk_util.h
+* @brief itk warpper utility function 
+* @author Ray
+* @history
+* ===================================================================================
+* Date             Name                   Description of Change
+* 09-July-2008     Ray                  
+*/
+#ifndef TC_LOG_H
+#define TC_LOG_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+//void CreateLogFile(char* logFileName);
+//void WriteLog(const char* format, ...);
+//void CloseLog(void);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
\ No newline at end of file
diff --git a/General/General/tc_util.cpp b/General/General/tc_util.cpp
new file mode 100644
index 0000000..27be661
--- /dev/null
+++ b/General/General/tc_util.cpp
@@ -0,0 +1,99 @@
+#include "tc_util.h"
+// #include "util.h"
+
+
+struct rev_sort
+{
+	tag_t rev;
+	string id;
+};
+
+bool sort_by_rev(const rev_sort &a,const rev_sort &b)
+{
+
+	return a.id<b.id;
+}
+int ITEM_list_all_revs_alpha(tag_t item_tag,int *rev_cnt,tag_t **revs)
+{
+
+	Teamcenter::Item *item=BusinessObjectRef<Teamcenter::Item>(item_tag);
+	vector<tag_t> tag_vec;
+	vector<int> int_vec;
+	vector<rev_sort> rev_vec;
+	item->getTagArray("revision_list",tag_vec,int_vec);
+	for(auto i=0;i<tag_vec.size();i++)
+	{
+		char *val;
+		AOM_ask_value_string(tag_vec[i],"item_revision_id",&val);
+		rev_sort sort;
+		sort.rev=tag_vec[i];
+		sort.id=val;
+		rev_vec.push_back(sort);
+	}
+	sort(rev_vec.begin(),rev_vec.end(),sort_by_rev);
+	*rev_cnt=rev_vec.size();
+	*revs=(tag_t*)MEM_alloc(rev_vec.size()*sizeof(tag_t));
+	for(auto i=0;i<rev_vec.size();i++)
+	{
+		(*revs)[i]=rev_vec[i].rev;
+	}
+	return 0;
+}
+
+
+bool isTypeOf(tag_t objtag, const char * type_name) {
+	tag_t type = NULLTAG;
+	TCTYPE_ask_object_type(objtag, &type);
+	tag_t item_type = NULLTAG;
+	TCTYPE_find_type(type_name, "", &item_type);
+	bool is_type = false;
+	if (item_type != NULLTAG) {
+		logical isok = FALSE;
+		TCTYPE_is_type_of(type, item_type, &isok);
+		if (isok) {
+			is_type = true;
+		}
+	}
+	return is_type;
+}
+
+void ECHO(char *format, ...)
+{
+    char msg[2048];
+    va_list args;
+
+    va_start( args, format );
+    vsprintf_s( msg, format, args );
+    va_end( args );
+
+    printf( msg );
+    TC_write_syslog( msg );
+}
+
+
+
+/**
+* ��ȡ��ѡ��
+*/
+int getPrefStrings1( const char *preference, TC_preference_search_scope_t scope, vector<string> &pref_vec  )
+{
+    int ifail = ITK_ok , i = 0, j = 0, k =0, num = 0;
+	char **values;
+    TC_preference_search_scope_t old_scope;
+    ITKCALL( ifail = PREF_ask_search_scope( &old_scope) );
+    ITKCALL( ifail = PREF_set_search_scope( scope ) );
+    ITKCALL( ifail = PREF_ask_char_values( preference, &num, &values ) );
+	//WriteLog("num=%d",num);
+	for(i = 0; i < num; i++)
+	{
+		pref_vec.push_back(values[i]);
+	}
+	DOFREE(values);
+    ITKCALL( ifail = PREF_set_search_scope( old_scope ) );
+    return ifail;
+}
+//attr1:A001  map<attr1,A001>
+
+
+
+
diff --git a/General/General/tc_util.h b/General/General/tc_util.h
new file mode 100644
index 0000000..cf8e557
--- /dev/null
+++ b/General/General/tc_util.h
@@ -0,0 +1,85 @@
+#include <epm/epm.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <ict/ict_userservice.h>
+#include <tccore/item.h>
+#include <ae/ae.h>
+#include <tc/folder.h>
+#include <tccore/aom.h>
+#include <sa/sa.h>
+#include <tccore/aom_prop.h>
+#include <property/prop_errors.h>
+#include <tccore/workspaceobject.h>
+#include <tc/preferences.h>
+#include <tccore/imantype.h>
+#include <tccore//grm.h>
+#include <tccore/grmtype.h>
+#include <sa/am.h>
+#include <cfm/cfm.h>
+#include <bom/bom.h>
+#include <tccore/uom.h>
+#include <ps/ps.h>
+#include <epm/signoff.h>
+#include <fclasses/tc_date.h>
+#include <form/form.h>
+#include <form/formtype.h>
+#include <schmgt_bridge\libschmgt_bridge_exports.h>
+#include <schmgt_bridge\libschmgt_bridge_undef.h>
+#include <schmgt\libschmgt_exports.h>
+#include <schmgt\libschmgt_undef.h>
+#include <schmgt\schmgt_bridge_itk.h>
+#include <schmgt\schmgt_itk.h>
+#include <stdio.h>
+#include <ctype.h>
+#include <string.h>
+#include <string>
+#include <vector>
+#include <map>
+#include <fstream>
+#include <iostream>
+#include <algorithm>
+#include "metaframework/BusinessObjectRef.hxx"
+#include "tccore/ItemRevision.hxx"
+#include "tccore/Item.hxx"
+#include <sstream>
+#include <stdlib.h>
+//#include <io.h>
+#include <time.h>
+#include "string_utils.h"
+using namespace std;
+
+
+#define DOFREE(obj)								\
+{												\
+	if(obj)										\
+	{											\
+		MEM_free(obj);							\
+		obj = NULL;								\
+	}											\
+}
+bool isTypeOf(tag_t objtag, const char * type_name);
+int getPrefStrings1( const char *preference, TC_preference_search_scope_t scope, vector<string> &pref_vec);
+extern "C" int POM_AM__set_application_bypass(logical bypass);
+
+
+void ECHO(char *format, ...);
+
+
+#define SAFECALL( argument )                                             \
+{                                                                       \
+	int retcode = argument;                                             \
+	if ( retcode != ITK_ok ) {                                          \
+	const char* *err;												\
+	const int *e1,*e2;											\
+	int e;														\
+	EMH_ask_errors(&e,&e1,&e2,&err);							\
+	stringstream err_ss;\
+	for(auto e_i=0;e_i<e;e_i++){\
+		err_ss<<err[e_i];\
+		}\
+	if(e){															\
+	LERROR<<"func:"<<__func__<<"line:"<<__LINE__<<" ERROR:"<<err_ss.str();\
+		}																\
+		}                                                                   \
+}  
+
+int ITEM_list_all_revs_alpha(tag_t item_tag,int *rev_cnt,tag_t **revs);
diff --git a/General/General/util.h b/General/General/util.h
new file mode 100644
index 0000000..c1ceca1
--- /dev/null
+++ b/General/General/util.h
@@ -0,0 +1,2 @@
+#include "easylogging++.h"
+_INITIALIZE_EASYLOGGINGPP
\ No newline at end of file
diff --git a/General/General/w2_Clear_Form_PropValue.cpp b/General/General/w2_Clear_Form_PropValue.cpp
new file mode 100644
index 0000000..3e02080
--- /dev/null
+++ b/General/General/w2_Clear_Form_PropValue.cpp
@@ -0,0 +1,468 @@
+#pragma warning (disable: 4996) 
+#pragma warning (disable: 4819) 
+#pragma warning (disable: 4995) 
+
+#include "w2_Clear_Form_PropValue.h"
+#include "error_handling.h"
+#include <string>
+#include <vector>
+#include <map>
+#include <fstream>
+
+#include <epm/epm.h>
+#include <epm/epm_toolkit_tc_utils.h>
+#include <ict/ict_userservice.h>
+#include <tccore/item.h>
+#include <ae/ae.h>
+#include <tc/folder.h>
+#include <tccore/aom.h>
+#include <sa/sa.h>
+#include <tccore/aom_prop.h>
+#include <property/prop_errors.h>
+#include <tccore/workspaceobject.h>
+#include <tc/preferences.h>
+#include <tccore/imantype.h>
+#include <tccore//grm.h>
+#include <tccore/grmtype.h>
+#include <sa/am.h>
+#include <cfm/cfm.h>
+#include <bom/bom.h>
+#include <tccore/uom.h>
+#include <ps/ps.h>
+#include <epm/signoff.h>
+#include <fclasses/tc_date.h>
+#include <ics\ics2.h>
+#include "tc_util.h"
+//#include <iostream>
+using namespace std;
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+	int delete_msword(tag_t dataset,char *ext,char *newRevType)
+	{
+		tag_t spec_dataset_rev = NULLTAG , ref_object = NULLTAG;
+		AE_reference_type_t reference_type;
+		printf("\n111111111111\n");
+		AE_ask_dataset_latest_rev(dataset, &spec_dataset_rev);
+
+		char ref_name[WSO_name_size_c + 1] = "word";
+		//printf("\n22222222222\n");
+		AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+		if(reference_type == AE_PART_OF)
+		{
+			printf("\n3333333333333\n");
+			char pathname[SS_MAXPATHLEN] = "";
+			IMF_ask_file_pathname(ref_object, SS_WNT_MACHINE, pathname);
+			char origin_file_name[IMF_filename_size_c + 1] = "";
+			IMF_ask_original_file_name(ref_object, origin_file_name);
+			printf("\n44444444444444\n");
+			char new_ds_name[WSO_name_size_c + 1] = "";
+			char *new_file_name = USER_new_file_name(new_ds_name, ref_name, ext, 0);
+			char *temp_dir = getenv("temp");
+			temp_dir="D:\\TEMP";
+			printf("\n555555555555\n");
+			char temp_file[SS_MAXPATHLEN] = "";
+			strcpy(temp_file, temp_dir);
+			strcat(temp_file, "\\");
+			strcat(temp_file, new_file_name);
+
+			IMF_export_file(ref_object, temp_file);
+			printf("\n66666666666666\n");
+
+			int   iCnt;
+			char *user_lib_env,pTempStr[500];
+			char local_path[MAX_PATH] = "";
+			char cmd[256] = "";
+
+			strcpy( cmd, "DeleteMacros-MSWord.wsf" );
+
+			strcat( cmd, " \"" ); 
+			strcat( cmd, temp_file ); 
+			strcat( cmd, "\"" );
+			printf( "\n%s\n",cmd );
+			system( cmd );
+			printf("\n777777777777\n");
+			//strcpy(user_lib_env, local_path);
+
+
+			tag_t new_file_tag = NULLTAG;
+			IMF_file_t file_descriptor;	
+			IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+			IMF_set_original_file_name(new_file_tag, origin_file_name);
+			IMF_close_file(file_descriptor);
+			AOM_save(new_file_tag);
+			AOM_unlock(new_file_tag);
+
+			AOM_lock(spec_dataset_rev);
+
+			AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object);
+
+			AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+			AOM_save(spec_dataset_rev);
+			AOM_unlock(spec_dataset_rev);
+		}
+		return ITK_ok;
+	}
+
+
+
+
+	int delete_msexcel(tag_t dataset,  char *ext,char *newREV_type)
+	{
+		tag_t spec_dataset_rev = NULLTAG,
+			ref_object = NULLTAG;
+
+		AE_reference_type_t reference_type;
+
+		AE_ask_dataset_latest_rev(dataset, &spec_dataset_rev);
+
+		char ref_name[WSO_name_size_c + 1] = "excel";
+		AE_ask_dataset_named_ref(spec_dataset_rev, ref_name, &reference_type, &ref_object);
+		if(reference_type == AE_PART_OF)
+		{
+			char pathname[SS_MAXPATHLEN] = "";
+			IMF_ask_file_pathname(ref_object, SS_WNT_MACHINE, pathname);
+			char origin_file_name[IMF_filename_size_c + 1] = "";
+			IMF_ask_original_file_name(ref_object, origin_file_name);
+
+			char new_ds_name[WSO_name_size_c + 1] = "";
+			char *new_file_name = USER_new_file_name(new_ds_name, ref_name, ext, 0);
+			char *temp_dir = getenv("temp");
+			temp_dir="D:\\TEMP";
+			char temp_file[SS_MAXPATHLEN] = "";
+			strcpy(temp_file, temp_dir);
+			strcat(temp_file, "\\");
+			strcat(temp_file, new_file_name);
+
+			IMF_export_file(ref_object, temp_file);
+
+
+			int   iCnt;
+			char *user_lib_env,pTempStr[500];
+			char local_path[MAX_PATH] = "";
+			char cmd[256] = "";
+
+
+			strcpy( cmd, "DeleteMacros-MSExcel.wsf" );
+			strcat( cmd, " \"" ); 
+			strcat( cmd, temp_file ); 
+			strcat( cmd, "\"" );
+			printf( "\n%s\n",cmd );
+			system( cmd );
+
+			//strcpy(user_lib_env, local_path);
+
+
+			tag_t new_file_tag = NULLTAG;
+			IMF_file_t file_descriptor;	
+			IMF_import_file(temp_file, new_file_name, SS_BINARY, &new_file_tag, &file_descriptor);
+			IMF_set_original_file_name(new_file_tag, origin_file_name);
+			IMF_close_file(file_descriptor);
+			AOM_save(new_file_tag);
+			AOM_unlock(new_file_tag);
+
+			AOM_lock(spec_dataset_rev);
+			//CALL(AOM_load (dataset));
+			//CALL(AOM_load(spec_dataset_rev));
+			AE_remove_dataset_named_ref_by_tag(spec_dataset_rev, ref_name, ref_object);
+			AE_add_dataset_named_ref(spec_dataset_rev, ref_name, AE_PART_OF, new_file_tag);
+			AOM_save(spec_dataset_rev);
+			AOM_unlock(spec_dataset_rev);
+		}
+
+		return ITK_ok;
+	}
+
+
+
+
+
+
+	int W2_Revise_clear_form( METHOD_message_t* msg, va_list args )
+	{
+		int ifail = ITK_ok, i = 0, j = 0;
+		
+		char  rev_type[ITEM_type_size_c + 1],
+			*optionname= "W2_Revise_clear_form";\
+			map<int, string> prop_map;			
+		//int	msgid = va_arg(args,int );
+		tag_t new_rev = va_arg(args,tag_t );
+		char*  operation = va_arg(args,char*  );
+		
+
+		printf("*******************************************************\n");
+		printf("*      W2_Revise_clear_form is comming         *\n");
+		printf("*******************************************************\n");
+
+		printf("new_rev==============================%d\n",new_rev);
+		printf("operation==============================%s\n",operation);
+
+		//-------------��ȡ��ѡ��(origin+rev_type+_str),itemrev��Form��ϵ��Form���͡����������
+		int option_value_count;
+		char **option_values;
+		char *PREF_W2_Revise_clear_form="Chint_Revise_ItemRev";//��ѡ������
+		// DocumentRevision:���,�������,У��,У������,����,��������,��׼��,��׼������,��,������,��׼,��׼����
+		if(strcmp(operation,"Revise")!=0 && strcmp(operation,"SaveAs")!=0){
+			return ifail;
+		}
+		ITKCALL(PREF_ask_char_values(PREF_W2_Revise_clear_form,&option_value_count,&option_values));
+		printf("=====option_value_count======%d\n",option_value_count);
+		if(option_value_count == 0)
+		{
+			printf("����option������ѡ��%s��\n",PREF_W2_Revise_clear_form);
+			return ifail;
+		}
+		for(int i=0;i<option_value_count;i++){
+			char charlist[100][100];
+			int col =0;  
+			char *substr= strtok(option_values[i], ":");
+			printf("substr :%s\n", substr);    
+			while (substr != NULL) {    
+				strcpy(charlist[col],substr);
+				col++;  
+				printf("%s\n", substr);    
+				substr = strtok(NULL,":");
+			}
+			char *type=new char[32];
+			ITKCALL(WSOM_ask_object_type(new_rev,type));
+			printf("type  :%s\n", type);    
+			if(strcmp(type,charlist[0])==0){
+				char charlist2[100][100];
+				int col2 =0;  
+				char *substr= strtok(charlist[1], ",");
+				while (substr != NULL) {    
+					strcpy(charlist2[col2],substr);
+					col2++;  
+					printf("%s\n", substr);    
+					substr = strtok(NULL,",");
+				}
+				ITKCALL( AOM_lock( new_rev ) );
+				for(int m=0;m<col2;m++){
+					ITKCALL(AOM_set_value_string(new_rev,charlist2[m],""));
+					ITKCALL( AOM_save( new_rev ) );
+				}
+
+				ITKCALL( AOM_unlock( new_rev ) );
+				ITKCALL( AOM_refresh( new_rev,true ) );
+			}
+
+
+		}
+		MEM_free(option_values);
+
+
+
+		char rev_id[ITEM_id_size_c+1]="";
+		char item_id[ITEM_id_size_c+1]="";
+		char* newREV_type=NULL;
+		tag_t master_form_rel_type = NULLTAG;
+		tag_t item = NULLTAG;
+
+		ITEM_ask_rev_id(new_rev,rev_id);
+		ITEM_ask_item_of_rev( new_rev, &item);
+		ITEM_ask_id(item, item_id);
+		GRM_find_relation_type( TC_master_form_rtype, &master_form_rel_type  );
+		AOM_ask_value_string(new_rev,"object_type",&newREV_type);
+
+		//������ݼ�
+		tag_t relation_type=NULLTAG;
+		//tag_t attach_relation_type = NULLTAG;
+		GRM_find_relation_type(TC_specification_rtype, &relation_type);
+		tag_t *secondary_objects=NULLTAG;
+		int ds_count = 0;
+		char *dataset_type = NULL, *desc_value=NULL,*file_path = NULL,*desc_path;
+		GRM_list_secondary_objects_only(new_rev, relation_type, &ds_count, &secondary_objects);
+
+		for (int j = 0; j < ds_count; j++)
+		{
+			AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+
+			if(strcmp(dataset_type, "MSWord") ==0 )
+			{
+				delete_msword(secondary_objects[j],"doc",newREV_type);
+			}
+			else if(strcmp(dataset_type, "MSWordX") ==0)
+			{
+				delete_msword(secondary_objects[j],"docx",newREV_type);
+			}
+			else if(strcmp(dataset_type, "MSExcel") ==0 )
+			{
+				delete_msexcel(secondary_objects[j],"xls",newREV_type);
+			}
+			else if(strcmp(dataset_type, "MSExcelX") ==0)
+			{
+				delete_msexcel(secondary_objects[j],"xlsx",newREV_type);
+			}
+
+			MEM_free(dataset_type);
+
+		}
+		DOFREE(secondary_objects);
+
+
+		GRM_find_relation_type(TC_attaches_rtype, &relation_type);
+
+		GRM_list_secondary_objects_only(new_rev, relation_type, &ds_count, &secondary_objects);
+		for (int j = 0; j < ds_count; j++)
+		{
+			AOM_ask_value_string(secondary_objects[j], "object_type", &dataset_type);
+
+			if(strcmp(dataset_type, "MSWord") ==0 )
+			{
+				delete_msword(secondary_objects[j],"doc",newREV_type);
+			}
+			else if(strcmp(dataset_type, "MSWordX") ==0)
+			{
+				delete_msword(secondary_objects[j],"docx",newREV_type);
+			}
+			else if(strcmp(dataset_type, "MSExcel") ==0 )
+			{
+				delete_msexcel(secondary_objects[j],"xls",newREV_type);
+			}
+			else if(strcmp(dataset_type, "MSExcelX") ==0)
+			{
+				delete_msexcel(secondary_objects[j],"xlsx",newREV_type);
+			}
+
+			MEM_free(dataset_type);
+
+		}
+		DOFREE(secondary_objects);
+		if(newREV_type!=NULL)
+		{
+			MEM_free(newREV_type);
+			newREV_type=NULL;
+		}
+
+
+		printf("*******************************************************\n");
+		printf("*        W2_Clear_Form_PropValue is end           *\n");
+		printf("*******************************************************\n");
+
+		return ifail;
+	}
+
+//ͼֽ�汾����ʱ����
+int ZT2_Design_Revise_process( METHOD_message_t* msg, va_list args )
+{
+	printf("ͼֽ�޶���ʼ\r\n");
+	int ifail = ITK_ok, i = 0, j = 0;
+	char  rev_type[ITEM_type_size_c + 1];
+	tag_t new_rev = va_arg(args,tag_t );
+	char*  operation = va_arg(args,char*  );
+	if(strcmp(operation,"Revise")!=0 ){
+			return ifail;
+	}
+	char* type1;
+	char* item_revision_id;
+	ITKCALL(AOM_ask_value_string(new_rev, "object_type", &type1));
+	ITKCALL(AOM_ask_value_string(new_rev, "item_revision_id", &item_revision_id));
+	//printf("�汾:%s\r\n",item_revision_id);
+	
+	if(!(strcmp(type1,"ZT2_Design3DRevision")==0 || strcmp(type1,"Part Revision")==0))
+	{
+		printf("��ͼֽ�޶�\r\n");
+		return ifail;
+	}
+	tag_t rev = NULLTAG,item = NULLTAG;
+	//METHOD_PROP_MESSAGE_OBJECT(msg,rev);
+	ITEM_ask_item_of_rev(new_rev,&item);
+	int cnt,rel_cnt;
+	tag_t *tags,*rels;
+	ITEM_list_all_revs_alpha(item,&cnt,&tags);
+	//printf("�汾����:%d\r\n",cnt);
+	//for(auto i=cnt-1;i>=0;i--)
+	//{
+		
+	//	ITKCALL(AOM_ask_value_string(tags[i], "item_revision_id", &item_revision_id));
+	//	printf("�汾:%s\r\n",item_revision_id);
+	//}
+	
+	if(cnt>1)
+	{
+		rev =tags[cnt-2]; 
+	}else
+	{
+		rev =tags[0]; 
+	}
+
+	//printf("-----------------\r\n");
+	ITKCALL(AOM_ask_value_string(rev, "item_revision_id", &item_revision_id));
+	printf("�汾:%s\r\n",item_revision_id);
+	int n_reference, *level;
+	tag_t *references;
+	char **relations;
+	printf("��ʼ��ȡ���ö���\r\n");
+	ITKCALL(WSOM_where_referenced(rev, 1, &n_reference, &level, &references, &relations));
+	vector<tag_t> procs ;
+	for(auto i=0;i<n_reference;i++)
+	{
+		char* type1;
+		ITKCALL(AOM_ask_value_string(references[i], "object_type", &type1));
+		//printf("%d---object_type:%s\r\n",i,type1);
+		if(strcmp(type1,"MEProcessRevision")==0)
+		{
+			procs.push_back(references[i]);
+		}
+		MEM_free(type1);
+	}
+	printf("һ������%d������·��\r\n",procs.size());
+	tag_t dataset_rel, relation_tag;
+	GRM_find_relation_type("IMAN_METarget", &dataset_rel);
+	POM_AM__set_application_bypass(true);
+	for(auto it=procs.begin();it!= procs.end();it++)
+	{
+		int fff = GRM_create_relation(*it, new_rev, dataset_rel, NULLTAG, &relation_tag);
+		GRM_save_relation(relation_tag);
+		AOM_unlock(relation_tag);		
+	}
+	POM_AM__set_application_bypass(false);
+	printf("ͼֽ�޶�����\r\n");
+	return ifail;			
+			
+}
+
+
+
+	extern int Register_revise_msg( void )
+	{
+		int status = ITK_ok;
+		char *err_string,*err_function;
+		int err_line = -1;
+		printf("W2_Revise_clear_form������\n");
+
+		METHOD_id_t mth_tag;
+		ITKCALL(status = METHOD_find_method("ItemRevision", ITEM_deep_copy_msg ,&mth_tag));
+		if (mth_tag.id != 0){
+			ITKCALL( METHOD_add_action(mth_tag, METHOD_post_action_type, W2_Revise_clear_form, NULL));
+			printf("ע��W2_Revise_clear_form�����ɹ���\n");
+		}
+		ITKCALL(status = METHOD_find_method("ItemRevision",ITEM_deep_copy_msg,&mth_tag));
+		
+		if (mth_tag.id != 0){
+		
+			ITKCALL( METHOD_add_action(mth_tag, METHOD_post_action_type, ZT2_Design_Revise_process, NULL));
+			printf("ע��ZT2_Design_Revise_process�����ɹ���\n");
+		}
+
+		return status;
+	}
+
+
+
+
+
+
+
+#ifdef __cplusplus
+}
+#endif
+
+
+
+
+
+
+
diff --git a/General/General/w2_Clear_Form_PropValue.h b/General/General/w2_Clear_Form_PropValue.h
new file mode 100644
index 0000000..3da4206
--- /dev/null
+++ b/General/General/w2_Clear_Form_PropValue.h
@@ -0,0 +1,33 @@
+
+#ifndef W2_CLEAR_FORM_PROPVALUE
+#define W2_CLEAR_FORM_PROPVALUE
+#include <sa\am.h>
+#include <tccore\aom.h>
+#include <tccore\aom_prop.h>
+#include <tccore\item.h>
+#include <tccore\grm.h>
+#include <tc\preferences.h>
+#include<tc\tc_macros.h>
+#include <user_exits\user_exits.h>
+#include <tccore\method.h>
+#include <tccore\tctype.h>
+#include <tccore\item_msg.h>
+#include <tccore\tc_msg.h>
+#include <tccore\grmtype.h>
+#include <tccore\grm.h>
+#include <tccore\imantype.h>
+
+#include <itk\bmf.h>
+#include <bmf\libuserext_exports.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+	extern USER_EXT_DLL_API int W2_Revise_clear_form( METHOD_message_t* msg, va_list args );
+	extern USER_EXT_DLL_API int ZT2_Design_Revise_process( METHOD_message_t* msg, va_list args );
+	
+
+#ifdef __cplusplus
+}
+#endif
+#include <bmf\libuserext_undef.h>
+#endif 
\ No newline at end of file