<abbr id="kepvq"></abbr> 這個類允許你在所有的Windows平臺下使用低級端口I/O接口存取并口數(shù)據(jù)。例子程序使用一個定制的MFC/C++類實現(xiàn)了PC到PC之間通過“PLT1”進行簡單的C/S文件傳輸。
上傳時間： 2015-08-30
上傳用戶：libenshu01
With a worldwide community of users and more than a million dedicated programmers, Perl has proven to be the most effective language for the latest trends in computing and business. Every programmer must keep up with the latest tools and techniques. This updated version of Advanced Perl Programming from O Reilly gives you the essential knowledge of the modern Perl programmer. Whatever your current level of Perl expertise, this book will help you push your skills to the next level and become a more accomplished programmer. O Reilly s most high-level Perl tutorial to date, Advanced Perl Programming, Second Edition teaches you all the complex techniques for production-ready Perl programs. This completely updated guide clearly explains concepts such as introspection, overriding built-ins, extending Perl s object-oriented model, and testing your code for greater stability. Other topics include: Complex data structures
標(biāo)簽： programmers worldwide community dedicated
上傳時間： 2014-10-27
上傳用戶：zhoujunzhen
MD5 加 密的V i s u a l C + + S o u r c e C o d e .
標(biāo)簽： MD5
上傳時間： 2014-01-04
上傳用戶：lunshaomo
Kernel.Development.2nd.Edition非常有用的Linux內(nèi)核開發(fā)著作
標(biāo)簽： Development Edition Kernel Linux
上傳時間： 2013-12-12
上傳用戶：Andy123456
Wiley - Understanding Data Communications (Third Edition)
標(biāo)簽： Communications Understanding Edition Wiley
上傳時間： 2015-09-02
上傳用戶：1583060504
Visual C++ 2005 Express Edition Programming for the Absolute Beginner
標(biāo)簽： Programming Absolute Beginner Express
上傳時間： 2014-01-05
上傳用戶：xmsmh
O Reilly系列書籍之Java網(wǎng)絡(luò)編程（第二版），英文原版書籍，內(nèi)容講的比較全面。
標(biāo)簽： Reilly Java 書籍 網(wǎng)絡(luò)編程
上傳時間： 2014-01-17
上傳用戶：gououo
By Tom Christiansen and Nathan Torkington ISBN 1-56592-243-3 First Edition, published August 1998. (See the catalog page for this book.) Search the text of Perl Cookbook. Table of Contents Copyright Page Foreword Preface Chapter 1: Strings Chapter 2: Numbers Chapter 3: Dates and Times Chapter 4: Arrays Chapter 5: Hashes Chapter 6: Pattern Matching Chapter 7: File Access Chapter 8: File Contents Chapter 9: Directories Chapter 10: Subroutines Chapter 11: References and Records Chapter 12: Packages, Libraries, and Modules Chapter 13: Classes, Objects, and Ties Chapter 14: Database Access Chapter 15: User Interfaces Chapter 16: Process Management and Communication Chapter 17: Sockets Chapter 18: Internet Services Chapter 19: CGI Programming Chapter 20: Web Automation Index Colophon
標(biāo)簽： Christiansen Torkington published Edition
上傳時間： 2014-02-20
上傳用戶：yyq123456789
Perl & XML. by Erik T. Ray and Jason McIntosh ISBN 0-596-00205-X First Edition, published April 2002. (See the catalog page for this book.) Table of Contents Copyright Page Preface Chapter 1: Perl and XML Chapter 2: An XML Recap Chapter 3: XML Basics: Reading and Writing Chapter 4: Event Streams Chapter 5: SAX Chapter 6: Tree Processing Chapter 7: DOM Chapter 8: Beyond Trees: XPath, XSLT, and More Chapter 9: RSS, SOAP, and Other XML Applications Chapter 10: Coding Strategies Index Colophon --------------------------------------------------------------------------------
標(biāo)簽： T. published McIntosh Edition
上傳時間： 2013-12-24
上傳用戶：yzhl1988
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標(biāo)簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
