input{jdbc{#是否记录上次执行结果,如果为真,将会把上次执行到的tracking_column字段的值记录下来,保存到last_run_metadata_path指定的文件中record_last_run=＞true#是否需要记录某个column的值,如果record_last_run为真,可以自定义我们需要track的column名称，此时该参数就要为true.否则默认track的是timestamp的值.use_column_value=＞true#如果use_column_value为真,需配置此参数.track的数据库column名,该column必须是递增的.比如：ID.tracking_column=＞MY_ID#指定文件,来记录上次执行到的tracking_column字段的值#我们只需要在SQL语句中WHEREMY_ID＞:last_sql_value即可.其中:last_sql_value取得就是该文件中的值(10000).last_run_metadata_path=＞"/etc/logstash/run_metadata.d/my_info"#是否清除last_run_metadata_path的记录,清除相当于从头开始查询所有的数据库记录clean_run=＞false#是否将column名称转小写lowercase_column_names=＞false#存放需要执行的SQL语句的文件位置statement_filepath=＞"/etc/logstash/statement_file.d/my_info.sql"}}

resnet50_weights_tf_dim_ordering_tf_kernels_notop.h5速度快，准确率高，参数不多50层残差网络模型,权重训练自ImageNet该模型在Theano和TensorFlow后端均可使用,并接受channels_first和channels_last两种输入维度顺序模型的默认输入尺寸:224x224

基于(ISC)2CISSPCommonBodyofKnowledge,可以辅助allinone加深对8个域知识点了解，最新的知识点已经在2018年4月15日CISSP考试中广泛体现。
本学习指南重点突出知识点概念并伴有相应测试题，结合allinone8后面测试题、光盘题和《CISSPOfficial(ISC)2PracticeTests2018年第二版》英文版&官方练习题及解题详解（1300题左右），备考题库已足够了解所有知识点本书含21章节，各域对应的章节如下：1-4章对应Domain1SecurityandRiskMgmt第5章对应Domain2Assetsecurity资产安全第6,7,8,9，10章对应Domain3安全架构与工程第11,12章，通讯与网络安全第13,14章，身份与访问管理IAM第15章对应域安全评估与测试第16,17,18，19章对应域7安全运维第20,21章软件开发安全DevelopmentEditor:KellyTalbotTechnicalEditors:JeffParker,BobSipes,andDavidSeidlCopyEditor:KimWimpsettEditorialManager:PeteGaughanProductionManager:KathleenwisorExecutiveeditor:imminatelProofreader:AmyschneiderIndexer:JohnnaVanHoosedinseProjectCoordinator,Cover:brentSavageCoverDesigner:wileyCoverImage:@JeremyWoodhouse/GettyImages,Inc.CopyrightC2018byJohnWileySons,InC,Indianapolis,IndianaPublishedsimultaneouslyinCanadaISBN:978-1-119-47593-4ISBN:978-1-119-47595-8(ebk)ISBN:978-1-119-47587-3(ebk)ManufacturedintheUnitedStatesofamericaNopartofthispublicationmaybereproduced,storedinaretrievalsystemortransmittedianyformorbyanymeans,electronic,mechanical,photocopying,recording,scanningorotherwise,exceptaspermittedunderSections107or108ofthe1976UnitedStatesCopyrightAct,withouteitherthepriorwrittenpermissionofthePublisher,orauthorizationthroughpaymentoftheappropriateper-copyfeetotheCopyrightClearanceCenter,222RosewoodDrive,Danvers,MAO1923,(978)750-8400,fax(978)646-8600RequeststothePublisherforpermissionshouldbeaddressedtothepermissionsDepartment,JohnWileysons,Inc.111RiverStreet,Hoboken,NJo7030,(201)748-6011,fax(201)748-6008,oronlineathttp://www.wiley.com/go/permissionsLimitofliability/DisclaimerofWarranty:Thepublisherandtheauthormakenorepresentationsorwarrantieswithrespecttotheaccuracyorcompletenessofthecontentsofthisworkandspecificallydisclaimallwarranties,includingwithoutlimitationwarrantiesoffitnessforaparticularpurpose.Nowarrantymaybecreatedorextendedbysalesorpromotionalmaterials.Theadviceandstrategiescontainedhereinmaynotbesuitableforeverysituation.Thisworkissoldwiththeunderstandingthatthepublisherisnotengagedinrenderinglegal,accounting,orotherprofessionalservices.Ifprofessionalassistanceisrequiredtheservicesofacompetentprofessionalpersonshouldbesought.Neitherthepublishernortheauthorshallbeliablefordamagesarisingherefrom.ThefactthatanorganizationorWebsiteisreferredtointhisworkasacitationand/orapotentialsourceoffurtherinformationdoesnotmeanthattheauthororthepublisherendorsestheinformationtheorganizationorWebsitemayprovideorrecommendationsitmaymakeFurtherreadersshouldbeawarethatInternetWebsiteslistedinthisworkmayhavechangedordisappearedbetweenwhenthisworkwaswrittenandwhenitisreadForgeneralinformationonourotherproductsandservicesortoobtaintechnicalsupportpleasecontactourCustomerCareDepartmentwithintheU.S.at(877)762-2974,outsidetheUS.at(317)5723993orfax(317)572-4002Wileypublishesinavarietyofprintandelectronicformatsandbyprint-on-demand.Somematerialincludedwithstandardprintversionsofthisbookmaynotbeincludedine-booksorinprint-On-demand.IfthisbookreferstomediasuchasaCDorDVdthatisnotincludedintheversionyoupurchasedyoumaydownloadthismaterialathttp://booksupport.wilev.comFormoreinformationaboutwileyproductsvisitwww.wiley.comLibraryofCongressControlNumber:2018933561TRADEMARKS:Wiley,theWileylogo,andtheSybexlogoaretrademarksorregisteredtrademarksofJohnWileySons,Incand/oritsaffiliates,intheUnitedStatesandothercountries,andmaynotbeusedwithoutwrittenpermission.CISSPisaregisteredtrademarkof(ISC)2,Inc.AllothertrademarksarethepropertyoftheirrespectiveownersJohnWileySons,Incisnotassociatedwithanyproductorvendormentionedinthisbook.ToDewittLatimer,mymentor,friend,andcolleague.Imissyoudearly.MikeChappleToCathy,yourperspectiveontheworldandlifeoftensurprisesme,challengesme,andmakesmeloveyouevenmoreJamesmichaelstewartToNimfa,thanksforsharingyourlifewithmeforthepast26yearsandlettingmeshareminewithyouDarrilgibsonDearFuture(ISC)2MemberCongratulationsonstartingyourjourneytoCISSPRcertificationEarningyourCISSPisanexcitingandrewardingmilestoneinyourcybersecuritycareer.Notonlydoesitdemonstrateyourabilitytodevelopandmanagenearlyallaspectsofanorganizationscybersecurityoperations,butyoualsosignaltoemployersyourcommitmenttolife-longlearningandtakinganactiveroleinfulfillingthe(isc)2visionofinspiringasafeandsecurecyberworldThematerialinthisstudyguideisbaseduponthe(isc)2cisspCommonBodyofKnowledge.ItwillhelpyoupreparefortheexamthatwillassessyourcompetencyinthefollowingeightdomainsaSecurityandriskmanagement■AssetsecuritySecurityArchitectureandengineeringaCommunicationandNetworksecurityaIdentityandAccessManagement(IAM)SecurityAssessmentandTesting■SecurityOperationsSoftwareDevelopmentSecurityWhilethisstudyguidewillhelpyouprepare,passingthecisspexamdependsonyourmasteryofthedomainscombinedwithyourabilitytoapplythoseconceptsusingyourreal-worldexperienceiwishyouthebestofluckasyoucontinueonyourpathtobecomeaCISSPandcertifiedmemberof(Isc)2Sincerely,Davidshearer.CISSPCEO(ISC)2Ackn。
w|edgmentsWe'dliketoexpressourthankstoSybexforcontinuingtosupportthisproject.Extrathankstotheeightheditiondevelopmentaleditor,kellyTalbot,andtechnicaleditors,JeffParker,BobSipes,andDavidSeidlwhoperformedamazingfeatsinguidingustoimprovethisbookThanksaswelltoouragent,CaroleJelen,forcontinuingtoassistinnailingdowntheseprojectsMikejames.anddarrilSpecialthanksgototheinformationsecurityteamattheUniversityofNotreDame,whoprovidedhoursofinterestingconversationanddebateonsecurityissuesthatinspiredandinformedmuchofthematerialinthisbookIwouldliketothanktheteamatwileywhoprovidedinvaluableassistancethroughoutthebookdevelopmentprocess.ialsooweadebtofgratitudetomyliteraryagent,CaroleJelenofWatersideProductions.Mycoauthors,JamesMichaelStewartanddarrilGibsonweregreatcollaborators.JeffParker,BobSipes,andDavidSeidl,ourdiligentandknowledgeabletechnicaleditors,providedvaluableinsightaswebroughtthiseditiontopressIdalsoliketothankthemanypeoplewhoparticipatedintheproductionofthisbookbutwhomIneverhadthechancetomeet:thegraphicsteam,theproductionstaff,andallofthoseinvolvedinbringingthisbooktopress-MikeChappleThankstoMikeChappleandDarrilGibsonforcontinuingtocontributetothisprojectThanksalsotoallmycisspcoursestudentswhohaveprovidedtheirinsightandinputtoimprovemytrainingcoursewareandultimatelythistome.Tomyadoringwife,CathyBuildingalifeandafamilytogetherhasbeenmorewonderfulthanIcouldhaveeverimagined.ToSlaydeandremi:youaregrowingupsofastandlearningatanoutstandingpace,andyoucontinuetodelightandimpressmedaily.YouarebothgrowingintoamazingindividualsTomymom,Johnnie:ItiswonderfultohaveyouclosebyToMarkNomatterhowmuchtimehaspassedorhowlittleweseeeachother,Ihavebeenandalwayswillbeyourfriend.andfinally,asalways,toElvis:Youwerewayaheadofthecurrentbaconobsessionwithyourpeanutbutter/banana/baconsandwich;ithinkthat'sproofyoutraveledthroughtimeJamesmichaelStewartThankstoJimMinatelandCaroleJelenforhelpinggetthisupdateinplacebefore(IsC)2releasedtheobjectives.Thishelpedusgetaheadstartonthisnewedition,andweappreciateyourefforts.It'sbeenapleasureworkingwithtalentedpeoplelikeJamesMichaelStewartandMikeChappleThankstobothofyouforallyourworkandcollaborativeeffortsonthisproject.Thetechnicaleditors,JeffParkerBobSipes,andDavidSeidl,provideduswithsomeoutstandingfeedback,andthisbookisbetterbecauseoftheireffortsThankstotheteamatSybex(includingprojectmanagers,editors,andgraphicsartists)foralltheworkyoudidhelpingusgetthisbooktoprint.Last,thankstomywife,Nimfa,forputtingupwithmyoddhoursasIworkedonthisbookDarrilgibsonAbouttheauthorsMikeChapple,CISSP,PhD,Security+,CISA,CySA+,isanassociateteachingprofessorofIT,analytics,andoperationsattheUniversityofNotreDame.InthepasthewaschiefinformationofficerofBrandInstituteandaninformationsecurityresearcherwiththenationalSecurityagencyandtheu.s.airForcehisprimaryareasofexpertiseincludenetworkintrusiondetectionandaccesscontrols.mikeisafrequentcontributortoTechTarget'sSearchSecuritysiteandtheauthorofmorethan25booksincludingthecompanionbooktothisstudyguide:CISSPOfficial(ISC)2PracticeTests,theCompTIACSA+StudyGuide,andCyberwarfare:InformationOperationsinaConnectedWorld.MikeoffersstudygroupsfortheCISSP,SSCP,Security+,andcSa+certificationsonhiswebsiteatwww.certmike.comJamesMichaelStewart,CISSP,CEH,ECSA,CHFI,Security+Network+,hasbeenwritingandtrainingformorethan20years,withacurrentfocusonsecurity.hehasbeenteachingCiSsPtrainingcoursessince2002,nottomentionothercoursesonInternetsecurityandethicalhacking/penetrationtestingHeistheauthorofandcontributortomorethan75booksandnumerouscoursewaresetsonsecuritycertification,Microsofttopics,andnetworkadministrationincludingtheSecurity+(SY0-501)Reviewguide.Moreinformationaboutmichaelcanbefoundathiswebsiteatwww.impactonline.comDarrilGibson,CISSP,Security+,CASP,istheCeoofYODa(shortforYouCanDoAnything),andhehasauthoredorcoauthoredmorethan40books.Darrilregularlywrites,consults,andteachesonawidevarietyoftechnicalandsecuritytopicsandholdsseveralcertificationsHeregularlypostsblogarticlesathttp://blogs.getcertifiedgetahead.com/aboutcertificationtopicsandusesthatsitetohelppeoplestayabreastofchangesincertificationexams.Heloveshearingfromreaders,especiallywhentheypassanexamafterusingoneofhisbooks,andyoucancontacthimthroughthelebloggingsite.

#include#include#include#includeusingnamespacestd;intw=0;//尾数累加器intp=0;//指数累加器intj=0;//十进制小数位数计数器inte=1;//用来记录十进制数的符号，当指数为正时为1，为负时为-1inti=0;//用来标志元素位置intd=0;//用来表示每个数值型元素对应的数值constintN=40;//用来确定输入识别符的最大长度chardata[N];//存放输入的识别符boolis_digit;//标志是否是数字stringCJ1;//确定是整形还是实型doubleCJ2;//记数值//函数声明voidcheck(charc);//检查首字母是否是数字的函数voiddeal_integer(charc);//处理识别符的整数部分voiddeal_point(charc);//用来处理小数部分voiddeal_index(charc);//用来处理指数部分voids_next();//确定实型voidz_next();//确定整型voidlast();//计算CJ2voiderror();//程序中错误处理程序voiddeal();//处理函数主体intmain(){//主函数coutdata;deal();//处理函数主体last();//计算CJ2system("pause");return0;}voidcheck(charc)//判断输入的首字母是否是数字{is_digit=isdigit(c);while(is_digit!=true){//输入的首字母不是数字时coutdata;check(data[0]);}}voiddeal_integer(charc){//处理识别符的整数部分d=(int)c-48;w=w*10+d;i++;if(isdigit(data[i])!=0)//下一个仍是数值时，调用程序本身deal_integer(data[i]);}voiddeal_point(charc){//用来处理小数部分inttemp=i;if(isdigit(c)!=0)//是数值字符时deal_integer(c);else{error();//错误处理程序deal();//处理函数主体}j=i-temp;//记录十进制小数位数}voiddeal_index(charc){//用来处理指数部分if(c=='-'){e=-1;i++;}//是'-'号时else{if(c=='+')i++;//是'+'号时else{if(isdigit(c)==false)//非数值字符时{error();//错误处理程序deal();//处理函数主体}else

对即将找工作的大学生，研究生都爱刷leetcode的题目，但是刚刚接受无法适从，或是一时半会儿想不到解法，没关系，leetcode题解PDF可一带你慢慢了解思路过程。
目录3.4Addbinary615.1.5BinaryTreeLevelOr-3.5LongestPalindromicSubstring.62dertraversalil3.6RegularExpressionMatching665.1.6BinaryTreeZigzag3.7WildcardMatching67LevelOrdertraversal.963.8LongestCommonPrefix5.1.7RecoverBinarySearch3.9ValidNumber70Tree983.10Integertoroman725.1.8SameTree3.11RomantoInteger5.1.9SymmetricTree1013.12CountandSay745.1.10BalancedBinaryTree..1023.13Anagrams755.1.11FlattenBinaryTreeto3.14SimplifyPath76LinkedList1033.15LengthofLastWord775.1.12PopulatingNextRightPointersineachnodeii105第4章栈和队列7952二叉树的构建1074.1栈795.2.1ConstructBinaryTree4ValidParentheses79fromPreorderandIn4.1.2LongestvalidParenorderTraversatheses805.2.2ConstructBinaryTree4.1.3LargestRectangleinfromInorderandposHistogram82torderTraversal1084.14Evaluatereversepol-53二叉查找树109ishnotation845.3.1UniqueBinarySearch4,2队列85Trees5.3.2UniqueBinarySearch第5章树86Treesli.1105.1二叉树的遍历865.3.3ValidateBinarySearch5.1.1BinaryTreePreorderTreeTraversal865.3.4ConvertSortedarrayto5.1.2BinaryTreeInorderBinarySearchTreel12Traversal885.3.5ConvertSortedListto5.1.3BinaryTreePostorderBinarysearchtree113Traversal9054二叉树的递归1155.1.4BinaryTreeLevelOr5.4.1MinimumDepthofBidertraversalnarylree115目录5.4.2MaximumDepthofBi8.32重新实现nextpermunaryTree116tation1425.4.3PathSum117833递归.1435.44PathSumil1188.4PermutationsII1445.4.5BinaryTreeMaximum8.4.1nextpermutation...144PathSuum119842重新实现nextpermu5.4.6PopulatingNextRighttation144Pointersineachnode12084.3递归1445.4.7SumRoottoLeafNum8.5Combinations146bers122851递归146852迭代147第6章排序1238.6LetterCombinationsofaphone6.1MergeSortedArray123umber1476.2MergeTwoSortedLists12486.1递归1486.3MergekSortedLists124862迭代96.4InsertionSortList125第9章广度优先搜索1506.5Sortlist1269.1WordLadder1506.6FirstMissingPositive1279.2WordLadderil..1526.7SortColors289.3Surroundedregions154第7章查找94小结15613194.1适用场景1567.1Searchforarange131942思考的步骤.1567.2SearchInsertPosition.13294.3代码模板1577.3Searcha2DMatrix133第10章深度优先搜索162第8章暴力枚举法13510.1PalindromePartitioning..1628.1Subsets13510.2UniquePaths1658.1.1递归1350.2.1深搜1658.1.2迭代.13710.22备忘录法.1658.2Subsetsil13810.23动规166821递归1381024数学公式167822迭代.14110.3UniquePathsIl1688.3Permutations14210.3.1备忘录法1688.3.1nextpermutation14210.3.2动规.169目录10.4N-Queens16913.4Maximalrectangle19910.5N-QueensII17213.5BestTimetoBuyandSellStock10.6Restoreipaddresses17320010.7CombinationSum17413.6InterleavingString20110.8CombinationSumIl17513.7ScrambleString20310.9GenerateParentheses.17713.8MinimumPathSum20810.10Sudokusolver17813.9EditDistance21010.11WordSearch.18013.10DecodeWays.21210.12小结18113.11DistinctSubsequences21310.12.1适用场景1813.12WordBreak21410.122思考的步骤1811313WordBreakil21610.12.3代码模板183第14章图21810.12.4深拽与回溯法的区别.18414.1CloneGraph10.12.5深搜与递归的区别..184第15章细节实现题221第11章分治法18515.1ReverseInteger2211.1Pow(x,n)18515.2PalindromeNumber222qrt(x18615.3InsertInterval223第12章贪心法18715.4MergeIntervals22412.1Jumpgame18715.5MinimumWindowSubstring..22512.2JumpgameIl18815.6MultiplyStrings22712.3BestTimetobuyandsellstock19015.7SubstringwithConcatenation12.4BestTimetobuyandsellstock191ofallwords23012.5LongestSubstringWithoutre15.8Pascal,sTrianglepeatingCharacters19215.9PascalsTriangleIl23212.6ContainerwithmostWater.19315.10Spiralmatrix23315.11SpiralmatrixII234第13章动态规划19515.12ZigZagConversion23613.1Triangle19515.13DivideTwoIntegers23713.2MaximumSubarray19615.14TextJustification23813.3PalindromePartitioningII19815.15MaxPointsonaline目录第1章编程技巧在判断两个浮点数a和b是否相等时,不要用a=-b,应该判断二者之差的绝对值fabs(a-b)是否小于某个阈值,例如1e-9。
判断一个整数是否是为奇数,用x%2!=0,不要用x%2==1,因为x可能是负数用char的值作为数组下标(例如,统计字符串中每个字符出现的次数),要考虑到char可能是负数。
有的人考虑到了,先强制转型为unsignedint再用作下标,这仍然是错的。
正确的做法是,先强制转型为unsignedchar,再用作下标。
这涉及C++整型提升的规则,就不详述了。
以下是关于STL使用技巧的,很多条款来自《EffectiⅤveStL》这本书。
vector和string优先于动态分配的数组首先,在性能上,由于vector能够保证连续内存,因此一旦分配了后,它的性能跟原始数组相当其次,如果用new,意味着你要确保后面进行了delete,一旦忘记了,就会岀现BUG,且这样需要都写一行delete,代码不够短再次,声明多维数组的话,只能一个一个new,例如:int**ary=newint*[row_num];for(inti=0:i<rownum;++1)ary[i]newint[col_num]用vector的话一行代码搞定,vector<vector<int>>ary(row_num,vector<int>(col_num,0))使用reserve来避免不必要的重新分配第2章线性表这类题目考察线性表的操作,例如,数组,单链表,双向链表等。
21数组2.1.1RemoveDuplicatesfromSortedarray描述Givenasortedarray,removetheduplicatesinplacesuchthateachelementappearonlyonceandreturnthenewlengthDonotallocateextraspaceforanotherarray,youmustdothisinplacewithconstantmemoryForexample,GiveninputarrayA=[1,1,2Yourfunctionshouldreturnlength=2,andaisnow[1,2]分析无代码1/LeetCode,RemoveDuplicatesfromSortedArray/时间复杂度0(n),空间复杂度0(1)classSolutiontublicintremoveDuplicates(intA[],intn)tlf(n==oreturnointindex=0:for(inti=1:i<n:i++iif(Alindex!alidA[++index]=Alireturnindex12.1数组代码2//LeetCode,RemoveDuplicatesfromSortedArray//使用STL,时间复杂度0(n),空间复杂度0(1)classSolutionipublicintremoveDuplicates(intA[,intn)treturndistance(A,unique(A,An))代码3/LeetCode,RemoveDuplicatesfromSortedArray/使用STL,时间复杂度0(n),空间复杂度0(1)lassSolutionfublicintremoveDuplicates(intA[],intn)treturnremoveDuplicates(A,A+n,A)-A;template<typenameInIt,typenameoutit>OutItremoveDuplicates(InItfirst,InItlast,OutItoutput)thile(firstlast)i*output++=*firstfirstupper_bound(first,last,*firstreturnoutput相关题目RemoveduplicatesfromSortedArrayIl,见§2.1.22.1.2RemoveDuplicatesfromSortedArrayII描述Followupfor"RemoveDuplicates"Whatifduplicatesareallowedatmosttwice?Forexample,Givensortedarraya=[1,1,1,2,2,3]Yourfunctionshouldreturnlength=5,andAisnow[1,1,2,2,3分析加一个变量记录一下元素出现的次数即可。
这题因为是已经排序的数组,所以一个变量即可解决。
如果是没有排序的数组,则需要引入一个hashmap来记录出现次数4第2章线性表代码1//LeetCode,RemoveDuplicatesfromSortedArrayII/时间复杂度0(n),空间复杂度0(1)//qauthorhex108(https://github.com/hex108)classSolutiontublicintremoveDuplicates(intA[],intn)tlf(n<=2returnnintindex=2for(inti=2:in:1++)if(all]!Alindex-2])ALindex++]=Ali]returnindex;代码2下面是一个更简洁的版本。
上面的代码略长,不过扩展性好一些,例如将occur<2改为ocur<3,就变成了允许重复最多3次。
//LeetCode,RemoveDuplicatesfromSortedArrayII//@author虞航仲(http://weibo.com/u/1666779725)//时间复杂度0(n),空间复杂度0(1)classSolutionipublicintremoveDuplicates(intA[],intn)tmtindex=ofor(intif(i>0&&i<1&&A[i]==A[i-1]&&A[i]==A[i+1])continueAlindex++]=Alireturnindex;相关题目RemoveDuplicatesfromSortedArray,见§2.1.12.1.3SearchinRotatedSortedArray描述Supposeasortedarrayisrotatedatsomepivotunknowntoyoubeforehand

第1章课程导学对课程整体进行介绍，并且说明HTTP协议的重要性，以及学习的必要性。
1-1导学1-2内容介绍第2章HTTP协议基础及发展历史本章主要介绍什么是HTTP协议，HTTP协议的发展历史，以及HTTP协议的底层--网络分层协议。
在本章中你将学习到HTTP协议的基础内容，并理解为什么会产生HTTP协议，以及他的优劣势。
2-15层网络模型介绍2-2HTTP协议的发展历史2-3HTTP的三次握手2-4URI-URL和URN2-5HTTP报文格式2-6创建一个最简单的web服务第3章HTTP各种特性总览本章主要讲解HTTP协议中各种头信息的作用，包括但不限于最重要的几个部分：缓存、cookie、CORS跨域、长连接等，课程中会配合实际的例子展示这些HTTP头是如何发挥作用的，并且解决了什么问题。
3-1认识HTTP客户端3-2CORS跨域请求的限制与解决3-3CORS跨域限制以及预请求验证3-4缓存头Cache-Control的含义和使用3-5缓存验证Last-Modified和Etag的使用3-6cookie和session3-7HTTP长连接3-8数据协商3-9Redirect3-10CSP第4章Nginx代理以及面向未来的HTTP本章主要实战Nginx配置各种面向未来的HTTP服务，首先会介绍Nginx的安装和基本配置，其次是配置Nginx的缓存功能来展示给大家看代理缓存相较于客户端缓存的好处。
最后这章中我们还讲解来HTTPS协议以及HTTP2，他们各是什么，有什么优点。
...4-1Nginx安装和基础代理配置4-2Nginx代理配置和代理缓存的用处4-3HTTPS解析4-4使用Nginx部署HTTPS服务4-5HTTP2的优势和Nginx配置HTTP2的简单使用第5章课程总结对课程整体再进行一个回顾5-1课程总结

GJK计算碰撞代码的应用//-----------------------------------------------------------------------------//Torque3D//Copyright(C)GarageGames.com,Inc.////Thecorealgorithmsinthisfilearebasedoncodewritten//byG.vandenBergenforhisinterferencedetectionlibrary,//"SOLID2.0"//-----------------------------------------------------------------------------#include"core/dataChunker.h"#include"collision/collision.h"#include"sceneGraph/sceneObject.h"#include"collision/convex.h"#include"collision/gjk.h"//----------------------------------------------------------------------------staticF32rel_error=1E-5f;//relativeerrorinthecomputeddistancestaticF32sTolerance=1E-3f;//DistancetolerancestaticF32sEpsilon2=1E-20f;//ZerolengthvectorstaticU32sIteration=15;//Stuckinaloop?S32num_iterations=0;S32num_irregularities=0;//----------------------------------------------------------------------------GjkCollisionState::GjkCollisionState(){a=b=0;}GjkCollisionState::~GjkCollisionState(){}//----------------------------------------------------------------------------voidGjkCollisionState::swap(){Convex*t=a;a=b;b=t;CollisionStateList*l=mLista;mLista=mListb;mListb=l;v.neg();}//----------------------------------------------------------------------------voidGjkCollisionState::compute_det(){//Dotnewpointwithcurrentsetfor(inti=0,bit=1;i0)returnfalse;}}returntrue;}//----------------------------------------------------------------------------inlineboolGjkCollisionState::closest(VectorF&v){compute_det();for(ints=bits;s;--s){if((s&bits)==s){if(valid(s|last_bit)){ bits=s|last_bit;if(bits!=15) compute_vector(bits,v); returntrue;}}}if(valid(last_bit)){bits=last_bit;v=y[last];returntrue;}returnfalse;}//----------------------------------------------------------------------------inlineboolGjkCollisionState::degenerate(constVectorF&w){for(inti=0,bit=1;imState=this;mListb=CollisionStateList::alloc();mListb-＞mState=this;}//----------------------------------------------------------------------------voidGjkCollisionState::reset(constMatrixF&a2w,constMatrixF&b2w){VectorFzero(0,0,0),sa,sb;a2w.mulP(a-＞support(zero),&sa);b2w.mulP(b-＞support(zero),&sb);v=sa-sb;dist=v.len();}//----------------------------------------------------------------------------voidGjkCollisionState::getCollisionInfo(constMatrixF&mat,Collision*info){AssertFatal(false,"GjkCollisionState::getCollisionInfo()-Thereremainscalingproblemshere.");//ThisassumesthattheshapesdonotintersectPoint3Fpa,pb;if(bits){getClosestPoints(pa,pb);mat.mulP(pa,&info-＞point);b-＞getTransform().mulP(pb,&pa);info-＞normal=info-＞point-pa;}else{mat.mulP(p[last],&info-＞point);info-＞normal=v;}info-＞normal.normalize();info-＞object=b-＞getObject();}voidGjkCollisionState::getClosestPoints(Point3F&p1,Point3F&p2){F32sum=0;p1.set(0,0,0);p2.set(0,0,0);for(inti=0,bit=1;isupport(va);a2w.mulP(p[last],&sa);VectorFvb,sb;w2b.mulV(v,&vb);q[last]=b-＞support(vb);b2w.mulP(q[last],&sb);VectorFw=sa-sb;if(mDot(v,w)＞0)returnfalse;if(degenerate(w)){++num_irregularities;returnfalse;}y[last]=w;all_bits=bits|last_bit;++num_iterations;if(!closest(v)||num_iterations＞sIteration){++num_irregularities;returnfalse;}}while(bitssEpsilon2);returntrue;}F32GjkCollisionState::distance(constMatrixF&a2w,constMatrixF&b2w,constF32dontCareDist,constMatrixF*_w2a,constMatrixF*_w2b){num_iterations=0;MatrixFw2a,w2b;if(_w2a==NULL||_w2b==NULL){w2a=a2w;w2b=b2w;w2a.inverse();w2b.inverse();}else{w2a=*_w2a;w2b=*_w2b;}reset(a2w,b2w);bits=0;all_bits=0;F32mu=0;do{nextBit();VectorFva,sa;w2a.mulV(-v,&va);p[last]=a-＞support(va);a2w.mulP(p[last],&sa);VectorFvb,sb;w2b.mulV(v,&vb);q[last]=b-＞support(vb);b2w.mulP(q[last],&sb);VectorFw=sa-sb;F32nm=mDot(v,w)/dist;if(nm＞mu)mu=nm;if(mu＞dontCareDist)returnmu;if(mFabs(dist-mu)sIteration){++num_irregularities;returndist;}y[last]=w;all_bits=bits|last_bit;if(!closest(v)){++num_irregularities;returndist;}dist=v.len();}while(bitssTolerance);if(bits==15&&mu＜=0)dist=0;returndist;}

Single-Chip16-PortSerDesGigabitSwitch16-port10/100/1000Mbpsintegratedswitchcontrollervia1.25GSerDes/SGMII/fiber•Embedded256KBon-chippacketbuffer•One10/100/1000MbpsIn-bandManagementPort(IMP)withGMII/RGMII/RvMII/MIIinterfaceforPHY-lessconnectiontoaCPU/managemententity(formanagementpurposesonly)•Integratedaddressmanagement•Supportsupto4KMACaddresses•Supportsjumboframesupto9728bytes.•SupportsEEPROMforlow-costchipconfiguration•IntegratedMotorola®SPI-compatibleinterface•Supportsportmirroring•Port-basedVLANand4KIEEE802.1QtagVLAN•Port-,DiffServ-,MAC-,andIEEE802.1p-basedQoSforfourqueues•SupportsSpanningTree,RapidSpanningTree,andMultipleSpanningTreeprotocols(802.1D/1s/1w)•SupportsIEEEStandard802.1Xportsecurity•Supportspseudo-PHYMDIOaccess•MAC-basedtrunkingwithlinkfail-over•Ethernet-in-the-last-mile(EFM)support:OAMandP•Low-power(2.2Wtotal)1.2Vcore/2.5V(SGMIII/O)/3.3V(GMII/MII/RvMII)and2.5VRGMIIoperationwith3.3VI/Otolerance•256-pinFBGApackage

HTTPS（SecureHypertextTransferProtocol）安全超文本传输协议它是一个安全通信通道，它基于HTTP开发，用于在客户计算机和服务器之间交换信息。
它使用安全套接字层(SSL)进行信息交换，简单来说它是HTTP的安全版。
在使用https协议不管是服务器端还是客户端都需要使用到ca证书来进行访问。
一般来说，性能测试为所常见的为客户端使用https打开页面的方式。
在这个情况下，首先是处理https访问过程中的证书1. 证书的准备常见的证书为：*.pfx格式，该种格式的证书可以通过双击运行安装到IE浏览器上。
用户在访问的时候就可以使用到。
但这种证书并不是LoadRunner所使用的类型，因此需要对其进行转换。
将其转换为*.pem格式。
转换方法如下： 安装openssl后 运行C:\/bin文件夹的openssl二进制文件，它将启动OpenSSL命令提示符 执行以下命令：pkcs12-inD:\test1.pfx-outD:\test01.pem–nodes 执行后，将会在指定目录生成test01.pem文件，这个文件将会在下一个步骤，对LoadRunner进行配置的时候使用到。
2．LR配置启动LoadRunner，打开RecordingOption选项。
留意红色框中的选项。
选择后，单击NewEnty红框中的配置为服务器的ip和端口号，按照测试所需要的实际地址进行配置就可以配置后，将Usespecifiedclient-sidecertificate[Base64/PEM]钩选，为使用客户端证书访问。
单击...选择刚刚转换生成的客户端证书。
如果你为证书有设置密码，在这里也需要输入。
到此为止所有与http区别的配置就完成了。
录制后，可以在脚本的开始，看到LoadRunner新生成的语句web_set_certificate_ex("CertFilePath=test01.pem", "CertFormat=PEM", "KeyFilePath=test01.pem", "KeyFormat=PEM", "Password=123456", "CertIndex=1", LAST);下面的操作和普通的页面性能测试一样。

自述文件用户テーブル柱子类型选项昵称细绳null：假电子邮件细绳null：false，唯一：true加密密码细绳null：假姓细绳null：假名细绳null：假last_name_reading细绳null：假first_name_reading细绳null：假生日日期null：假协会has_many：购买历史has_many：项目项目テーブル柱子类型选项姓名细绳null：假描述文本null：假category_id整数null：假item_status_id整数null：假delivery_fee_id整数null：假prefecture_id整数null：假shipping_schedule_id整数null：假价格整数null：假用户参考null

在日常工作中，钉钉打卡成了我生活中不可或缺的一部分。然而，有时候这个看似简单的任务却给我带来了不少烦恼。 每天早晚，我总是得牢记打开钉钉应用，点击"工作台"，再找到"考勤打卡"进行签到。有时候因为工作忙碌，会忘记打卡，导致考勤异常，影响当月的工作评价。而且，由于我使用的是苹果手机，有时候系统更新后，钉钉的某些功能会出现异常，使得打卡变得更加麻烦。 另外，我的家人使用的是安卓手机，他们也经常抱怨钉钉打卡的繁琐。尤其是对于那些不太熟悉手机操作的长辈来说，每次打卡都是一次挑战。他们总是担心自己会操作失误，导致打卡失败。 为了解决这些烦恼，我开始思考是否可以通过编写一个全自动化脚本来实现钉钉打卡。经过一段时间的摸索和学习，我终于成功编写出了一个适用于苹果和安卓系统的钉钉打卡脚本。