<delect id="c4ioy"></delect> Standard-Library Exception Safety Bjarne Stroustrup Texas A&M University (and AT&T Labs – Research) http://www.research.att.com/~bs Introduction to the C++ exception handling mechanisms and “resource acquisition is initialization” for people with little experience with exceptions
標簽： Standard-Library Stroustrup University Exception
上傳時間： 2015-12-11
上傳用戶：懶龍1988
This the second tutorial of the Writing Device Drivers series. There seems to be a lot of interest in the topic, so this article will pick up where the first left off. The main focus of these articles will be to build up little by little the knowledge needed to write device drivers. In this article, we will be building on the same example source code used in part one. In this article, we will expand on that code to include Read functionality, Handle Input/Ouput Controls also known as IOCTLs, and learn a bit more about IRPs.
標簽： the interest tutorial Drivers
上傳時間： 2016-01-28
上傳用戶：lmeeworm
This the third edition of the Writing Device Drivers articles. The first article helped to simply get you acquainted with device drivers and a simple framework for developing a device driver for NT. The second tutorial attempted to show to use IOCTLs and display what the memory layout of Windows NT is. In this edition, we will go into the idea of contexts and pools. The driver we write today will also be a little more interesting as it will allow two user mode applications to communicate with each other in a simple manner. We will call this the “poor man’s pipes” implementation.
標簽： the articles Drivers edition
上傳時間： 2014-01-16
上傳用戶：ommshaggar
兩種解決方案 Richard just finished building his new house. Now the only thing the house misses is a cute little wooden fence. He had no idea how to make a wooden fence, so he decided to order one. Somehow he got his hands on the ACME Fence Catalogue 2002, the ultimate resource on cute little wooden fences. After reading its preface he already knew, what makes a little wooden fence cute. A wooden fence consists of N wooden planks, placed vertically in a row next to each other. A fence looks cute if and only if the following conditions are met: ?The planks have different lengths, namely 1, 2, . . . , N plank length units. ?Each plank with two neighbors is either larger than each of its neighbors or smaller than each of them. (Note that this makes the top of the fence alternately rise and fall.)
標簽： house the finished building
上傳時間： 2014-01-26
上傳用戶：541657925
Capturing low-level network data can be hard in Java, but it s certainly not impossible If you want to capture network packets in your Java program, you ll need a little help because no parts of the core Java APIAPI give access to low-level network
標簽： impossible Capturing low-level certainly
上傳時間： 2016-03-05
上傳用戶：yuanyuan123
From helping to assess the value of new medical treatments to evaluating the factors that affect our opinions and behaviors, analysts today are finding myriad uses for categorical data methods. In this book we introduce these methods and the theory behind them. Statistical methods for categorical responses were late in gaining the level of sophistication achieved early in the twentieth century by methods for continuous responses. Despite influential work around 1900 by the British statistician Karl Pearson, relatively little development of models for categorical responses occurred until the 1960s. In this book we describe the early fundamental work that still has importance today but place primary emphasis on more recent modeling approaches. Before outlining
標簽： evaluating treatments the helping
上傳時間： 2014-01-25
上傳用戶：jennyzai
8051 Web Server project See Makefile for build notes Written for Keil C51 V5.1 compiler, notes: It uses big endian order, which is the same as the network byte order, unlike x86 systems. Use OPTIMIZE(2)or higher so that automatic variables get shared // between functions, to stay within the 256 bytes idata space
標簽： notes for Makefile compiler
上傳時間： 2013-12-17
上傳用戶：ikemada
Data_Structures_and_Algorithms - These notes accompany Data Structures and Algorithms II. The course, to a large extent, follows on from Data Structures and Algorithms I. However, while DS&A I focused on fundamental datastructures, DS&A II will focus on practical algorithms, applicable to a wide range of tasks. The approach will be somewhat less formal, with a little more focus on applications.
標簽： Data_Structures_and_Algorithms Algorithms Structures accompany
上傳時間： 2016-05-08
上傳用戶：阿四AIR
Welcome to Beginning Algorithms, a step-by-step introduction to computing algorithms for the real world. Developers use algorithms and data structures every day of their working lives. Having a good understanding of these algorithms and knowledge of when to apply them is essential to producing software that not only works correctly, but also performs efficiently. This book aims to explain those algorithms and data structures most commonly encountered in day-today software development, while remaining at all times practical, concise, and to the point, with little or no verbiage to distract from the core concepts and examples.
標簽： step-by-step introduction Algorithms algorithms
上傳時間： 2016-05-08
上傳用戶：wlcaption
RSA 1024位加密算法封裝，算法使用big-endian編碼方式。用于Windows Mobile下
上傳時間： 2013-11-27
上傳用戶：陽光少年2016
