- MoreEffectiveC++/Appendix . . . . 74 matches
[[TableOfContents]]
So your appetite for information on C++ remains unsated. Fear not, there's more — much more. In the sections that follow, I put forth my recommendations for further reading on C++. It goes without saying that such recommendations are both subjective and selective, but in view of the litigious age in which we live, it's probably a good idea to say it anyway. ¤ MEC++ Rec Reading, P2
There are hundreds — possibly thousands — of books on C++, and new contenders join the fray with great frequency. I haven't seen all these books, much less read them, but my experience has been that while some books are very good, some of them, well, some of them aren't. ¤ MEC++ Rec Reading, P4
What follows is the list of books I find myself consulting when I have questions about software development in C++. Other good books are available, I'm sure, but these are the ones I use, the ones I can truly recommend. ¤ MEC++ Rec Reading, P5
A good place to begin is with the books that describe the language itself. Unless you are crucially dependent on the nuances of the °official standards documents, I suggest you do, too. ¤ MEC++ Rec Reading, P6
* '''''The Design and Evolution of C++''''', Bjarne Stroustrup, Addison-Wesley, 1994, ISBN 0-201-54330-3. ¤ MEC++ Rec Reading, P8
These books contain not just a description of what's in the language, they also explain the rationale behind the design decisions — something you won't find in the official standard documents. The Annotated C++ Reference Manual is now incomplete (several language features have been added since it was published — see Item 35) and is in some cases out of date, but it is still the best reference for the core parts of the language, including templates and exceptions. The Design and Evolution of C++ covers most of what's missing in The Annotated C++ Reference Manual; the only thing it lacks is a discussion of the Standard Template Library (again, see Item 35). These books are not tutorials, they're references, but you can't truly understand C++ unless you understand the material in these books
Stroustrup has been intimately involved in the language's design, implementation, application, and standardization since its inception, and he probably knows more about it than anybody else does. His descriptions of language features make for dense reading, but that's primarily because they contain so much information. The chapters on the standard C++ library provide a good introduction to this crucial aspect of modern C++. ¤ MEC++ Rec Reading, P12
Murray's book is especially strong on the fundamentals of template design, a topic to which he devotes two chapters. He also includes a chapter on the important topic of migrating from C development to C++ development. Much of my discussion on reference counting (see Item 29) is based on the ideas in C++ Strategies and Tactics.
If you're the kind of person who likes to learn proper programming technique by reading code, the book for you is ¤ MEC++ Rec Reading, P19
Each chapter in this book starts with some C++ software that has been published as an example of how to do something correctly. Cargill then proceeds to dissect — nay, vivisect — each program, identifying likely trouble spots, poor design choices, brittle implementation decisions, and things that are just plain wrong. He then iteratively rewrites each example to eliminate the weaknesses, and by the time he's done, he's produced code that is more robust, more maintainable, more efficient, and more portable, and it still fulfills the original problem specification. Anybody programming in C++ would do well to heed the lessons of this book, but it is especially important for those involved in code inspections. ¤ MEC++ Rec Reading, P21
"Exception Handling: A False Sense of Security," °C++ Report, Volume 6, Number 9, November-December 1994, pages 21-24. ¤ MEC++ Rec Reading, P23
If you are contemplating the use of exceptions, read this article before you proceed. ¤ MEC++ Rec Reading, P24
Once you've mastered the basics of C++ and are ready to start pushing the envelope, you must familiarize yourself with ¤ MEC++ Rec Reading, P25
I generally refer to this as "the LSD book," because it's purple and it will expand your mind. Coplien covers some straightforward material, but his focus is really on showing you how to do things in C++ you're not supposed to be able to do. You want to construct objects on top of one another? He shows you how. You want to bypass strong typing? He gives you a way. You want to add data and functions to classes as your programs are running? He explains how to do it. Most of the time, you'll want to steer clear of the techniques he describes, but sometimes they provide just the solution you need for a tricky problem you're facing. Furthermore, it's illuminating just to see what kinds of things can be done with C++. This book may frighten you, it may dazzle you, but when you've read it, you'll never look at C++ the same way again. ¤ MEC++ Rec Reading, P27
If you have anything to do with the design and implementation of C++ libraries, you would be foolhardy to overlook ¤ MEC++ Rec Reading, P28
Carroll and Ellis discuss many practical aspects of library design and implementation that are simply ignored by everybody else. Good libraries are small, fast, extensible, easily upgraded, graceful during template instantiation, powerful, and robust. It is not possible to optimize for each of these attributes, so one must make trade-offs that improve some aspects of a library at the expense of others. Designing and Coding Reusable C++ examines these trade-offs and offers down-to-earth advice on how to go about making them. ¤ MEC++ Rec Reading, P30
Regardless of whether you write software for scientific and engineering applications, you owe yourself a look at ¤ MEC++ Rec Reading, P31
The first part of the book explains C++ for FORTRAN programmers (now there's an unenviable task), but the latter parts cover techniques that are relevant in virtually any domain. The extensive material on templates is close to revolutionary; it's probably the most advanced that's currently available, and I suspect that when you've seen the miracles these authors perform with templates, you'll never again think of them as little more than souped-up macros. ¤ MEC++ Rec Reading, P33
Finally, the emerging discipline of patterns in object-oriented software development (see page 123) is described in ¤ MEC++ Rec Reading, P34
- 영호의해킹공부페이지 . . . . 68 matches
6. Computers can change (your) life for the better.
Principles of Buffer Overflow explained by Jus
manner of exploiting daemons - The Buffer Overflow.
coded daemons - by overflowing the stack one can cause the software to execute
A buffer is a block of computer memory that holds many instances of the same
A stack has the property of a queue of objects being placed one on top of the
to the stack (PUSH) and removed (POP). A stack is made up of stack frames,
The stack pointer (SP) always points to the top of the stack, the bottom of it
is static. PUSH and POP operations manipulate the size of the stack
stack by giving their offsets from SP, but as POP's and PUSH's occur these
offsets change around. Another type of pointer points to a fixed location
it can handle. We use this to change the flow of execution of a program -
hopefully by executing code of our choice, normally just to spawn a shell.
We can change the return address of a function by overwriting the entire
contents of the buffer, by overfilling it and pushing data out - this then
means that we can change the flow of the program. By filling the buffer up
This is just a simplified version of what actually happens during a buffer
me +-20 mins to do the whole thing, but at least I was keeping a log of me
save, of course, for the explanations. Next time I'll get human and actually
values of the registers when it dies....
- SummationOfFourPrimes/1002 . . . . 50 matches
||[[TableOfContents]]||
sizeOfList = len(aList)
for i in range(sizeOfList):
for j in range(sizeOfList):
for k in range(sizeOfList):
for l in range(sizeOfList):
sizeOfList = len(aList)
for i in range(sizeOfList):
for j in range(sizeOfList):
for k in range(sizeOfList):
for l in range(sizeOfList):
스펙상 10000000 값 내에서 4초 이내에 답이 나와야 한다. 이에 대해서 현재의 병목지점에 대해 profiling 을 해 보았다.
C:\WINDOWS\system32\cmd.exe /c python SummationOfFourPrimes.py
1 0.075 0.075 1.201 1.201 summationoffourprimes.py:13(createList)
0 0.000 0.000 profile:0(profiler)
1 5.103 5.103 6.387 6.387 summationoffourprimes.py:88(main)
1 0.000 0.000 1.201 1.201 summationoffourprimes.py:8(__init__)
9999 1.126 0.000 1.126 0.000 summationoffourprimes.py:18(isPrimeNumber)
1 0.000 0.000 0.000 0.000 summationoffourprimes.py:24(getList)
11061 0.083 0.000 0.083 0.000 summationoffourprimes.py:79(selectionFour)
- WikiTextFormattingTestPage . . . . 48 matches
This page originated on Wiki:WardsWiki, and the most up-to-date copy resides there. This page has been copied here in order to make a quick visual determination of which TextFormattingRules work for this wiki. Currently it primarily determines how text formatted using the original Wiki:WardsWiki text formatting rules is displayed. See http://www.c2.com/cgi/wiki?WikiOriginalTextFormattingRules.
* CLUG Wiki (older version of WardsWiki, modified by JimWeirich) -- http://www.clug.org/cgi/wiki.cgi?WikiEngineReviewTextFormattingTest
The next line (4 dashes) should show up as a horizontal rule. In a few wikis, the width of the rule is controlled by the number of dashes. That will be tested in a later section of this test page.
'This text, enclosed within in 1 set of single quotes, should appear as normal text surrounded by 1 set of single quotes.'
''This text, enclosed within in 2 sets of single quotes, should appear in italics.''
'''This text, enclosed within in 3 sets of single quotes, should appear in bold face type.'''
''''This text, enclosed within in 4 sets of single quotes, should appear in bold face type surrounded by 1 set of single quotes.''''
'''''This text, enclosed within in 5 sets of single quotes, should appear in bold face italics.'''''
''''''This text, enclosed within in 6 sets of single quotes, should appear as normal text.''''''
'This text, enclosed within in 1 set of single quotes and preceded by one or more spaces, should appear as monospaced text surrounded by 1 set of single quotes.'
''This text, enclosed within in 2 sets of single quotes and preceded by one or more spaces, should appear in monospaced italics.''
'''This text, enclosed within in 3 sets of single quotes and preceded by one or more spaces, should appear in monospaced bold face type.'''
''''This text, enclosed within in 4 sets of single quotes and preceded by one or more spaces, should appear in monospaced bold face type surrounded by 1 set of single quotes.''''
'''''This text, enclosed within in 5 sets of single quotes and preceded by one or more spaces, should appear in monospaced bold face italics.'''''
''''''This text, enclosed within in 6 sets of single quotes and preceded by one or more spaces, should appear as monospaced normal text.''''''
Note that the logic seems to be easily confused. In the next paragraph I combine the two sentences (with no other changes). Notice the results. (The portion between the "innermost" set of triple quotes, and nothing else, is bold.)
Aside: I wonder if any wikis provide multilevel numbering -- I know that Wiki:MicrosoftWord, even back to the Dos 3.0 version, can number an outline with multiple digits, in "legal" or "outline" style numbering. I forget which is which -- one is like 2.1.2.4, the other is like II.A.3.c., and I think there is another one that includes ii.
:: Here I tried some experimentation to see if I could indent a paragraph 8 spaces instead of 4 -- not successful but there might be a way. Fourscore and seven years ago, our forefathers brought forth upon this continent a new nation, conceived in liberty, ... and I wish I could remember the rest. Formatted by preceding this paragraph with <tab><tab><space>::<tab><tab>.
The next 10 double spaced lines are a succession of lines with an increasing number of dashes on each line, in other words, the first line is one dash, the second is two, ... until the tenth is 10 dashes.
In at least one wiki (which? ''PikiPiki, and thus MoinMoin''), the weight (thickness) of the lines increases based on the number of dashes (starting at 4 dashes).
- ReadySet 번역처음화면 . . . . 42 matches
Software development projects require a lot of "paperwork" in the form of requirements documents, design documents, test plans, schedules, checklists, release notes, etc. It seems that everyone creates the documents from a blank page, from the documents used on their last project, or from one of a handful of high-priced proprietary software engineering template libraries. For those of us who start from a blank page, it can be a lot of work and it is easy to forget important parts. That is not a very reliable basis for professional engineering projects.
'''* What is the goal of this project?'''
ReadySET is an open source project to produce and maintain a library of reusable software engineering document templates. These templates provide a ready starting point for the documents used in software development projects. Using good templates can help developers work more quickly, but they also help to prompt discussion and avoid oversights.
* Templates for many common software engineering documents. Including:
This is an open source project that you are welcome to use for free and help make better. Existing packages of software engineering templates are highly costly and biased by the authorship of only a few people, by vendor-client relationships, or by the set of tools offered by a particular vendor.
The templates are not burdened with information about individual authorship or document change history. It is assumed that professional software developers will keep all project documents in version control systems that provide those capabilities.
These templates are not one-size-fits-all and they do not attempt to provide prescriptive guidance on the overall development process. We are developing a broad library of template modules for many purposes and processes. The templates may be filled out in a suggested sequence or in any sequence that fits your existing process. They may be easily customized with any text or HTML editor.
'''*What is the scope of this project?'''
We will build templates for common software engineering documents inspired by our own exprience.
I assume that the user takes ultimate responsibility for the content of all their actual project documents. The templates are merely starting points and low-level guidance.
This project does not attempt to provide powerful tools for reorganizing the templates, mapping them to a given software development process, or generating templates from a underlying process model. This project does not include any application code for any tools, users simply use text editors to fill in or customize the templates.
'''*Is this project part of a larger effort?'''
Yes. It is part of the Tigris.org mission of promoting open source software engineering. It is also the first product in a product line that will provide even better support to professional software developers. For more information, see [http://www.readysetpro.com ReadySET Pro] .
'''*What is the status of this project?'''
These templates are based on templates originally used to teach software engineering in a university project course. They are now being enhanced, expanded, and used more widely by professionals in industry.
ReadySET is aimed at software engineers who wish that their projects could go more smoothly and professionally. ReadySET can be used by anyone who is able to use an HTML editor or edit HTML in a text editor.
*3. Edit the templates to fit the needs of your project
*Use a text editor or an HTML editor. Please see our list of recommended tools. (You can use Word, but that is strongly discouraged.)
*6. Use the checklists to catch common errors and improve the quality of your documents.
*7. Use the words-of-wisdom pages to help improve the document or deepen your understanding of relevant issues.
- 김희성/MTFREADER . . . . 41 matches
#define OUT_OF_MEMORY_ERROR 2
long ReadAttribute(FILE* fp, unsigned char* offset, long flag);
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
unsigned __int64 offset;
ErrorCode=OUT_OF_MEMORY_ERROR;
point=*((unsigned short*)((unsigned char*)$MFT+20));//Offset으로 포인터 이동
ErrorCode=OUT_OF_MEMORY_ERROR;
ULARGE_INTEGER offset;
offset.QuadPart = sector * boot_block.BytesPerSector;
overlap.Offset = offset.LowPart;
overlap.OffsetHigh = offset.HighPart;
unsigned char* offset=0;
offset=(new U8[*((unsigned __int64*)((unsigned char*)point+40))]);
offset=0;
if(offset)
ReadCluster(point+(*(short*)((unsigned char*)point+32)),offset);
offset=point+24+*((unsigned char*)point+9);
if(!offset)
FileTimeToSystemTime((FILETIME*)offset,&time);
FileTimeToSystemTime((FILETIME*)(offset+8),&time);
- Garbage collector for C and C++ . . . . 33 matches
# of objects to be recognized. (See gc_priv.h for consequences.)
# causes all objects to be padded so that pointers just past the end of
# -DNO_SIGNALS does not disable signals during critical parts of
# This is on by default. Turning it off has not been extensively tested with
# -DNO_EXECUTE_PERMISSION may cause some or all of the heap to not
# See gc_cpp.h for details. No effect on the C part of the collector.
# Calloc and strdup are redefined in terms of the new malloc. X should
# existing code, but it often does. Neither works on all platforms,
# Reduces code size slightly at the expense of debuggability.
# -DJAVA_FINALIZATION makes it somewhat safer to finalize objects out of
# of GC_java_finalization variable.
# initial value of GC_finalize_on_demand.
# -DHBLKSIZE=ddd, where ddd is a power of 2 between 512 and 16384, explicitly
# kind of object. For the incremental collector it makes sense to match
# -DUSE_MMAP use MMAP instead of sbrk to get new memory.
# value of the near-bogus-pointer. Can be used to identifiy regions of
# for debugging/profiling purposes. The gc_backptr.h interface is
# for debugging of the garbage collector itself, but could also
# the reliability (from 99.9999% to 100%) of some of the debugging
# the headers to minimize object size, at the expense of checking for
- RSSAndAtomCompared . . . . 33 matches
#pragma section-numbers off
|| [[TableOfContents]] ||
People who generate syndication feeds have a choice of
feed formats. As of mid-2005, the two
The purpose of this page is to summarize, as clearly and simply as possible, the differences between the RSS 2.0 and Atom 1.0 syndication languages.
The RSS 2.0 specification is copyrighted by Harvard University and is frozen. No significant changes can be made and it is intended that future work be done under a different name; Atom is one example of such work.
The Atom 1.0 specification (in the course of becoming an
IETF standards track RFC) represents the consensus of the
[http://www.ietf.org/iesg.html Internet Engineering Steering Group]. The specification is structured in such a way that the IETF could conceivably issue further versions or revisions of this specification without breaking existing deployments, although there is no commitment, nor currently expressed interest, in doing so.
[http://www.bblfish.net/blog/page7.html#2005/06/20/22-28-18-208 reports] of problems with interoperability and feature shortcomings.
The Atompub working group is in the late stages of developing the
RSS 2.0 requires feed-level title, link, and description. RSS 2.0 does not require that any of the fields of individual items in a feed be present.
RSS 2.0 may contain either plain text or escaped HTML, with no way to indicate which of the two is provided. Escaped HTML is ugly (for example, the string AT&T would be expressed as “AT&T”) and has been a source of difficulty for implementors. RSS 2.0 cannot contain actual well-formed XML markup, which reduces the re-usability of content.
Atom has a carefully-designed payload container. Content may be explicitly labeled as any one of:
RSS 2.0 has a “description” element which is commonly used to contain either the full text of an entry or just a synopsis (sometimes in the same feed), and which sometimes is absent. There is no built-in way to signal whether the contents are complete.
[http://diveintomark.org/archives/2002/06/02/important_change_to_the_link_tag autodiscovery] has been implemented several times in different ways and has never been standardized. This is a common source of difficulty for non-technical users.
Atom [http://www.ietf.org/internet-drafts/draft-ietf-atompub-autodiscovery-01.txt standardizes autodiscovery]. Additionally, Atom feeds contain a “self” pointer, so a newsreader can auto-subscribe given only the contents of the feed, based on Web-standard dispatching techniques.
The only recognized form of RSS 2.0 is an <rss> document.
== Differences of Degree ==
RSS 2.0 does not specify the handling of relative URI references, and in practice they cannot be used in RSS feeds.
- UML/CaseTool . . . . 33 matches
[[TableOfContents]]
== Aspects of Functionality ==
''Diagramming'' in this context means ''creating'' and ''editing'' UML [[diagram]]s; that is diagrams that follow the graphical notation of the Unified Modeling Language.
The diagramming part of the Unified Modeling Language seems to be a lesser debated part of the UML, compared to code generation.
The UML diagram notation evolved from elderly, previously competing notations. UML diagrams as a means to draw diagrams of - mostly - [[Object-oriented programming|object oriented]] software is less debated among software developers. If developers draw diagrams of object oriented software, there is widespread consensus ''to use the UML notation'' for that task. On the other hand, it is debated, whether those diagrams are needed at all, on what stage(s) of the software development process they should be used and whether and how (if at all) they should be kept up-to date, facing continuously evolving program code.
''[[Code generation]]'' in this context means, that the user creates UML diagrams, which have some connoted model data, from which the UML tool derives (through a conversion process) parts or all of the [[source code]] for the software system that is to be developed. Often, the user can provide some skeleton of the program source code, in the form of a source code [[template]] where predefined tokens are then replaced with program source code parts, emitted by the UML tool during the code generation process.
There is some debate among software developers about how useful code generation as such is. It certainly depends on the specific problem domain and how far code generation should be applied. There are well known areas where code generation is an established practice, not limited to the field of UML. On the other hand, the idea of completely leaving the "code level" and start "programming" on the UML diagram level is quite debated among developers, and at least, not in such widespread use compared to other [[software development]] tools like [[compiler]]s or [[Configuration management|software configuration management systems]]. An often cited criticism is that the UML diagrams just lack the detail which is needed to contain the same information as is covered with the program source. There are developers that even state that "the Code ''is'' the design" (articles [http://www.developerdotstar.com/mag/articles/reeves_design_main.html] by Jack W. Reeves [http://www.bleading-edge.com/]).
Reverse engineering encloses the problematic, that diagram data is normally not contained with the program source, such that the UML tool, at least in the initial step, has to create some ''random layout'' of the graphical symbols of the UML notation or use some automatic ''layout algorithm'' to place the symbols in a way that the user can understand the diagram. For example, the symbols should be placed at such locations on the drawing pane that they don't overlap. Usually, the user of such a functionality of an UML tool has to manually edit those automatically generated diagrams to attain some meaningfulness. It also often doesn't make sense to draw diagrams of the whole program source, as that represents just too much detail to be of interest at the level of the UML diagrams. There are also language features of some [[programming language]]s, like ''class-'' or ''function templates'' of the programming language [[C plus plus|C++]], which are notoriously hard to convert automatically to UML diagrams in their full complexity.
== List Of UML Case Tool ==
- [http://en.wikipedia.org/wiki/List_of_UML_tools]
Rational Software Architect, Together가 유명하고, 오픈 소스로는 Argo, Violet 이 유명하다.
- WikiSlide . . . . 31 matches
* a technology for collaborative creation of internet and intranet pages
* Structure of pages
* Title search and full text search at bottom of page
* SiteNavigation: A list of the different indices of the Wiki
* TitleIndex: A list of all pages in the Wiki
* WordIndex: A list of all words in page titles (i.e. a list of keywords/concepts in the Wiki)
To edit a page, just click on [[Icon(edit)]] or on the link "`EditText`" at the end of the page. A form will appear enabling you to change text and save it again. A backup copy of the previous page's content is made each time.
You can check the appearance of the page without saving it by using the preview function - ''without'' creating an entry on RecentChanges; additionally there will be an intermediate save of the page content, if you have created a homepage ([[Icon(home)]] is visible).
(!) You can subscribe to pages to get a mail on every change of that page. Just click on the envelope [[Icon(subscribe)]] at top right of the page.
Headlines are placed on a line of their own and surrounded by one to five equal signs denoting the level of the headline. The headline is in between the equal signs, separated by a space. Example: [[BR]] `== Second Level ==`
Preformatted text (e.g. a copy of an email) should be placed inside three curly braces `{{{ ... }}}`: {{{
Tables appear if you separate the content of the columns by `||`. All fields of the same row must be also on the same line in the editor.
* `TableOfContents` - show a local table of contents
* `PageList` - generates lists of pages with titles matching a pattern
This brings up a page with a variety of possibilities to create the new page:
* click on one of the listed templates to base your page on the content of the selected template.
Below the list of templates you will also find a list of existing pages with a similar name. You should always check this list because someone else might have already started a page about the same subject but named it slightly differently.
* `LocalSiteMap`: List of all pages that are referred to, up to a maximum of 4 levels
* If you want to edit a page without being disturbed, just write a note to that effect ''at the top'' of the page and save that change first.
* Personal Homepages: normally only changed by their owner, but you may append messages at the end of the page
- TwistingTheTriad . . . . 30 matches
One example of this deficiency surfaced in SmalltalkWorkspace widget. This was originally designed as a multiline text-editing component with additional logic to handle user interface commands such as Do-it, Show-it, Inspect-it etc. The view itself was a standard Windows text control and we just attached code to it to handle the workspace functionality. However, we soon discovered that we also wanted to have a rich text workspace widget too. Typically the implementation of this would have required the duplication of the workspace logic from the SmalltalkWorkspace component or, at least, an unwarranted refactoring session. It seemed to us that the widget framework could well do with some refactoring itself!
In MVC, most of the application functionality must be built into a model class known as an Application Model. It is the reponsibility of the application model to be the mediator between the true domain objects and the views and their controllers. The views are responsible for displaying the domain data while the controller handle the raw usr gestures that will eventually perform action on this data. So the application model typically has method to perform menu command actions, push buttons actions and general validation on the data that it manages. Nearly all of the application logic will reside in the application model classes. However, because the application model's role is that of a go-between, it is at times necessary for it to gain access to the user interface directly but, because of the Observer relationship betweeen it and the view/controller, this sort of access is discouraged.
For example, let's say one wants to explicitly change the colour of one or more views dependent on some conditions in the application model. The correct way to do this in MVC would be to trigger some sort of event, passing the colour along with it. Behaviour would then have to be coded in the view to "hang off" this event and to apply the colour change whenever the event was triggered. This is a rather circuitous route to achieving this simple functionality and typically it would be avoided by taking a shoutcut and using #componentAt : to look up a particular named view from the application model and to apply the colour change to the view directly. However, any direct access of a view like this breaks the MVC dictum that the model should know nothing about the views to which it is connected. If nothing else, this sort of activity surely breaks the possibility of allowing multiple views onto a model, which must be the reason behind using the Observer pattern in MVC in the first place.
This is the data upon which the user interface will operate. It is typically a domain object and the intention is that such objects should have no knowledge of the user interface. Here the M in MVP differs from the M in MVC. As mentioned above, the latter is actually an Application Model, which holds onto aspects of the domain data but also implements the user interface to manupulate it. In MVP, the model is purely a domain object and there is no expectation of (or link to) the user interface at all.
The behaviour of a view in MVP is much the same as in MVC. It is the view's responsibility to display the contents of a model. The model is expected to trigger appropriate change notification whenever its data is modified and these allow the view to "hang off" the model following the standard Observer pattern. In the same way as MVC does, this allows multiple vies to be connected to a single model.
One significant difference in MVP is the removal of the controller. Instead, the view is expected to handle the raw user interface events generated by the operating system (in Windows these come in as WM_xxxx messages) and this way of working fits more naturally into the style of most modern operating systems. In some cases, as a TextView, the user input is handled directly by the view and used to make changes to the model data. However, in most cases the user input events are actually routed via the presenter and it is this which becomes responsible for how the model gets changed.
While it is the view's responsibility to display model data it is the presenter that governs how the model can be manipulated and changed by the user interface. This is where the heart of an application's behaviour resides. In many ways, a MVP presenter is equivalent to the application model in MVC; most of the code dealing with how a user interface works is built into a presenter class. The main difference is that a presenter is ''directly'' linked to its associated view so that the two can closely collaborate in their roles of supplying the user interface for a particular model.
=== Benefits of MVP ===
Compared with our orignnal widget framework, MVP offers a much greater separation between the visual presentation of an interface and the code required to implement the interface functionality. The latter resides in one or more presenter classes that are coded as normal using a standard class browser.
- 경시대회준비반/BigInteger . . . . 27 matches
* Permission to use, copy, modify, distribute and sell this software
* representations about the suitability of this software for any
// Number of digits in `BASE'
// Start of the location of the number in the array
// End of the location of the number in the array
// Trims zeros in front of a number
// Compares Two BigInteger values irrespective of sign
// Returns Number of digits in the BigInteger
// Modulo Division of Two BigInteger
// Returns number of digits in a BigInteger
// Checks for the validity of the number
// Compares this with `with' irrespective of sign
// Now I know Both have same number of digits
Compares two array of data considering the
case that both of them have the same number
of digits
// Implentation of addition by paper-pencil method
// Implentation of subtraction by paper-pencil method
// Implentation of multiplication by paper-pencil method
// Implentation of multiplication by paper-pencil method
- 새싹교실/2012/세싹 . . . . 26 matches
[[TableOfContents]]
* 자세한 해결 방법입니다. 소켓을 생성하고나서 바로 setsockopt(mySocket, SOL_SOCKET, SO_REUSEADDR, &anyIntegerVariableThatContainsNonZero, sizeof(anyIntegerVariableThatContainsNonZero)); 함수를 호출하면 이 소켓의 생명이 다하는 순간 해당 포트에 자리가 나게 됩니다. - [황현]
- 양방향 통신중 한쪽이 off-line상태인 경우에도 메시지의 전송과 수령이 가능하도록
U16 UsaOffset;
U16 AttributeOffset;
U16 NameOffset;
U16 ValueOffset;
U16 NumberOfHeads;
U32 PartitionOffset;
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
ULARGE_INTEGER offset;
offset.QuadPart = sector * boot_block.BytesPerSector;
overlap.Offset = offset.LowPart;
overlap.OffsetHigh = offset.HighPart;
* http://forensic-proof.com/ 에서 mft에 대해 읽어보시오.
- http://technet.microsoft.com/en-us/library/cc750583.aspx#XSLTsection124121120120
http://social.msdn.microsoft.com/forums/en-US/Vsexpressvc/thread/560002ab-860f-4cae-bbf4-1f16e3b0c8f4 - [권영기]
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
// fread((void*)&boot_block,sizeof(boot_block),1,fp);
printf("Offset to fixup array : 0x%02x%02x\n", *((unsigned char*)MFT+5),*((unsigned char*)MFT+4));
- ASXMetafile . . . . 25 matches
* <Abstract>: Provides a brief description of the media file.
* <Title>: Title of the media file.
* <MoreInfo href = "path of the source" / >: Adds hyperlinks to the Windows Media Player interface in order to provide additional resources on the content.
* <Entry>: Serves a playlist of media by inserting multiple "Entry" elements in succession.
* <Duration value = "00:00:00">: Sets the value attribute for the length of time a streaming media file is to be played.
* <Logo href = "path of the logo source" Style = "a style" / >: Adds custom graphics to the Windows Media player by choosing either a watermark or icon style. The image formats that Windows Media Player supports are GIF, BMP, and JPEG.
o MARK: The logo appears in the lower right corner of the video area while Windows Media Player is connecting to a server and opening a piece of content.
o ICON: The logo appears as an icon on the display panel, next to the title of the show or clip.
* <Banner href = "path of the banner source">: Places a banner (82 pixels × 30 pixels) image at the bottom of the video display area.
* <Ref href = "path of the source" / >: Specifies a URL for a content stream.
* How to define the path of source:
* ?sami="path of the source": Defines the path of a SAMI caption file within the <ref href> tag for media source.
<Title> Global title of the show </Title>
<Author> The name of the author </Author>
<MoreInfo href="http://www.microsoft.com/windows/windowmedia" />
<Ref href="MMS://netshow.microsoft.com/ms/sbnasfs/wtoc.asf" />
<MoreInfo href="http://www.microsoft.com/windows/windowsmedia" />
<Copyright> 2000 Microsoft Corporation </Copyright>
<MoreInfo href="http://www.microsoft.com/windows/windowsmedia" />
<Ref href="MMS://netshow.microsoft.com/ms/sbnasfs/wcc.asf" />
- DesignPatternsAsAPathToConceptualIntegrity . . . . 25 matches
During our discussions about the organization of design patterns there was a comment about the difficulty of identifying the “generative nature” of design patterns. This may be a good property to identify, for if we understood how design patterns are used in the design process, then their organization may not be far behind. Alexander makes a point that the generative nature of design patterns is one of the key benefits. In practice, on the software side, the generative nature seems to have fallen away and the more common approach for using design patterns is characterized as “when faced with problem xyz…the solution is…” One might say in software a more opportunistic application of design patterns is prevalent over a generative use of design patterns.
The source of this difference may be the lack of focus on design patterns in the design process. In fact, we seldom see discussions of the design process associated with design patterns. It is as though design patterns are a tool that is used independent of the process. Let’s investigate this further:
· The existence of an architecture, on top of any object/class design
· The internal regularity (….or conceptual integrity) of the architectural design
One approach would be to identify and elevate a single overriding quality (such as adaptability or isolation of change) and use that quality as a foundation for the design process. If this overriding quality were one of the goals or even a specific design criteria of the process then perhaps the “many” could produce a timely product with the same conceptual integrity as “a few good minds.” How can this be accomplished and the and at least parts of the “cruel dilemma” resolved?
The following summary is from “Design Patterns as a Litmus Paper to Test the Strength of Object-Oriented Methods” and may provide some insight:
1. Some O-O design methodologies provide a systematic process in the form of axiomatic steps for developing architectures or micro-architectures that are optimality partitioned (modularized) according to a specific design criteria.
5. EDD and RDD will generate different design patterns that meet the primary modularization principle “encapsulate the part that changes.” in different ways when applied according to their axiomatic rules. For example RDD generates Mediator, Command, Template Method and Chain of responsibility (mostly behavior) where as EDD generates Observer, Composite, and Chain of responsibility (mostly structure).
EDO 와 RDD 는 이 1차 원리인 "변화하는 부분에 대해 캡슐화하라"와 그들의 명확한 룰들에 따라 적용될때 다른 방법들로 만나서, 다른 디자인 패턴들을 생성해 낼 것이다. 예를 들면, RDD는 Mediator, Command, TemplateMethod, ChainOfResponsibility (주로 behavior), EDD 는 Observer, Composite, ChainOfResposibility(주로 structure) 를 생성해낼것이다.
· Does this give insight into the organization of design patterns?
- [Lovely]boy^_^/EnglishGrammer/PresentAndPast . . . . 25 matches
[[TableOfContents]]
This means) She is driving now, at the time of speaking. The action is not finished.
B. I am doing something = I'm in the middle of doing something; I've started doing it and I haven't finished yet.
Often the action is happening at the time of speaking.
But the action is not necessarily happening at the time of speaking.
This means) Tom is not reading the book at the time of speaking.
He means that he has started it but has not finished it yet. He is in the middle of reading it.
ex) The population of the world is rising very fast.
or repeateldy or that something is true in general. It is not important whether the action is happening at the time of speaking
D. We use the simple present when we say how often we do things ( 빈도를 나타내는 문장을 만들때는 단순 현재를 쓴다. )
Note the position of always/never/usually, etc... (before the main verb, after be verb) ( 위치 주의 )
ex) I never drink coffee at night.
We use the present continuous for something that is happening at or around the time of speaking.
It means that I do things too often, or more often than normal.
I'm thinking ( = considering) of quitting my job.
A. He ''started'' composing at the age of five and ''wrote'' more than 600 pieces of music.
B. Very often the simple past ends in -ed (꽤 자주 -ed로 끝난단 말입니다.)
D. The past of be is was/were.(be동사의 과거는 was/were랍니다.)
They were playing = they were in the middle of playing. They had not finished playing.
B. We use the past continuous to say that somebody was in the middle of doing something at a certain time.
- NSIS/예제2 . . . . 24 matches
InstallDirRegKey HKLM SOFTWARE\NSIS_Example2 "Install_Dir"
WriteRegStr HKLM SOFTWARE\NSIS_Example2 "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "DisplayName" "NSIS Example2 (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "UninstallString" '"$INSTDIR\uninstall.exe"'
WriteRegStr HKLM SOFTWARE\NSIS_Example2 "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "DisplayName" "NSIS Example2 (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "UninstallString" '"$INSTDIR\uninstall.exe"'
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2"
DeleteRegKey HKLM SOFTWARE\NSIS_Example2
InstallDirRegKey HKLM SOFTWARE\NSIS_Example2 "Install_Dir"
WriteRegStr HKLM SOFTWARE\NSIS_Example2 "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "DisplayName" "NSIS Example2 (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2" "UninstallString" '"$INSTDIR\uninstall.exe"'
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2"
DeleteRegKey HKLM SOFTWARE\NSIS_Example2
; eof
MakeNSIS v1.95 - Copyright 1999-2001 Nullsoft, Inc.
InstallRegKey: "HKLM\SOFTWARE\NSIS_Example2\Install_Dir"
WriteRegStr: HKLM\SOFTWARE\NSIS_Example2\Install_Dir=$INSTDIR
WriteRegStr: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\Example2\DisplayName=NSIS Example2 (remove only)
- 새싹교실/2012/아우토반/앞반/5.10 . . . . 24 matches
[[TableOfContents]]
printf("%d %d\n", sizeof(*pA), sizeof(pA));
printf("%d %d\n", sizeof(*pB), sizeof(pB));
printf("%d %d\n", sizeof(*pC), sizeof(pC));
printf("%d %d\n", sizeof(*pD), sizeof(pD));
printf("%d %d\n", sizeof(*pA), sizeof(pA)); //*pa의 문자열은 int(4), pA의 문자열은 int(4)
printf("%d %d\n", sizeof(*pB), sizeof(pB)); // pB의 문자열은 int(4), *pB의 문자열은 int(4)
printf("%d %d\n", sizeof(*pC), sizeof(pC)); // *pC의 문자열은 char(1), pC의(주소값)문자열은 int(4)
printf("%d %d\n", sizeof(*pD), sizeof(pD)); // *pD의 문자열은 double(8), pD의 (주소값)문자열은 int(4)
printf("%d %d\n", sizeof(*pA), sizeof(pA));
printf("%d %d\n", sizeof(*pB), sizeof(pB));
printf("%d %d\n", sizeof(*pC), sizeof(pC));
printf("%d %d\n", sizeof(*pD), sizeof(pD));
- SmalltalkBestPracticePatterns/DispatchedInterpretation . . . . 22 matches
Back in the days when data was separated from computation, and seldom the twain should meet, encoding decisions were critical. Any encoding decision you made was propagated to many different parts of the computation. If you got the encoding wrong, the cost of change was enormous. The longer it took to find the mistake, the more ridiculous the bill.
Objects change all this. How you distribute responsibility among objects is the critical decision, encoding is a distant second. For the most part, in well factored programs, only a single object is interested in a piece of information. That object directly references the information and privately performs all the needed encoding and decoding.
Sometimes, however, information in one object must influence the behavior of another. When the uses of the information are simple, or the possible choices based on the information limited, it is sufficient to send a message to the encoded object. Thus, the fact that boolean values are represented as instances of one of two classes, True and False, is hidden behind the message #ifTrue:ifFalse:.
Sets interact with their elements like this. Regardless of how an object is represented, as long it can respond to #=and #hash, it can be put in a Set.
Sometimes, encoding decisions can be hidden behind intermediate objects. And ASCII String encoded as eight-bit bytes hides that fact by conversing with the outside world in terms of Characters:
When there are many different types of information to be encoded, and the behavior of clients changes based on the information, these simple strategies won't work. The problem is that you don't want each of a hundred clients to explicitly record in a case statement what all the types of information are.
For example, consider a graphical Shape represented by a sequence of line, curve, stroke, and fill commands. Regardless of how the Shape is represented internally, it can provide a message #commandAt: anInteger that returns a Symbol representing the command and #argumentsAt: anInteger that returns an array of arguments. We could use these messages to write a PostScriptShapePrinter that would convert a Shape to PostScript:
Every client that wanted to make decisions based on what commands where in a Shape would have to have the same case statement, violating the "once and only once" rule. We need a solution where the case statement is hidden inside of the encoded objects.
The simplest example of this is Collection>>do:. By passing a one argument Block(or any other object that responds to #value:), you are assured that the code will work, no matter whether the Collection is encoded as a linear list, an array, a hash table, or a balanced tree.
This is a simplified case of Dispatched Interpretation because there is only a single message coming back. For the most part, there will be several messages. For example, we can use this pattern with the Shape example. Rather than have a case statement for every command, we have a method in PostScriptShapePrinter for every command, For example:
Rather than Shapes providing #commandAt: and #argumentsAt:, they provide #sendCommantAt: anInteger to: anObject, where #lineFrom:to: is one of the messages that could be sent back. Then the original display code could read:
The name "dispatched interpretation" comes from the distribution of responsibility. The encoded object "dispatches" a message to the client. The client "interprets" the message. Thus, the Shape dispatches message like #lineFrom:to: and #curveFrom:mid:to:. It's up to the clients to interpret the messages, with the PostScriptShapePrinter creating PostScript and the ShapeDisplayer displaying on the screen.
'''''You will have to design a Mediating Protocol of messgaes to be sent back. Computations where both objects have decoding to do need Double Dispatch.'''''
- LawOfDemeter . . . . 20 matches
다음은 http://www.pragmaticprogrammer.com/ppllc/papers/1998_05.html 중 'Law Of Demeter' 에 대한 글.
nilly? Well, you could, but that would be a bad idea, according to the Law of Demeter. The Law of Demeter
What that means is that the more objects you talk to, the more you run the risk of getting broken when one
of them changes. So not only do you want to say as little as possible, you don't want to talk to more
objects than you need to either. In fact, according to the Law of Demeter for Methods, any method of an
This is what we are trying to prevent. (We also have an example of Asking instead of Telling in foo.getKey
()). Direct access of a child like this extends coupling from the caller farther than it needs to be. The
The disadvantage, of course, is that you end up writing many small wrapper methods that do very little but
delegate container traversal and such. The cost tradeoff is between that inefficiency and higher class
The higher the degree of coupling between classes, the higher the odds that any change you make will break
Depending on your application, the development and maintenance costs of high class coupling may easily
of maintaining these as separate methods. Why bother?
It helps to maintain the "Tell, Don't Ask" principle if you think in terms of commands that perform a very
tossing data out, you probably aren't thinking much in the way of invariants).
If you can assume that evaluation of a query is free of any side effects, then you can:
The last, of course, is why Eiffel requires only side-effect free methods to be called from within an
Assertion. But even in C++ or Java, if you want to manually check the state of an object at some point in
- RSS . . . . 20 matches
{{| [[TableOfContents]] |}}
The technology behind RSS allows you to subscribe to websites that have provided RSS feeds, these are typically sites that change or add content regularly. To use this technology you need to set up some type of aggregation service. Think of this aggregation service as your personal mailbox. You then have to subscribe to the sites that you want to get updates on. Unlike typical subscriptions to pulp-based newspapers and magazines, your RSS subscriptions are free, but they typically only give you a line or two of each article or post along with a link to the full article or post.
The RSS formats provide web content or summaries of web content together with links to the full versions of the content, and other meta-data. This information is delivered as an XML file called RSS feed, webfeed, RSS stream, or RSS channel. In addition to facilitating syndication, RSS allows a website's frequent readers to track updates on the site using a news aggregator.
Before RSS, several similar formats already existed for syndication, but none achieved widespread popularity or are still in common use today, and most were envisioned to work only with a single service. For example, in 1997 Microsoft created Channel Definition Format for the Active Channel feature of Internet Explorer 4.0. Another was created by Dave Winer of UserLand Software. He had designed his own XML syndication format for use on his Scripting News weblog, which was also introduced in 1997 [1].
RDF Site Summary, the first version of RSS, was created by Dan Libby of Netscape in March 1999 for use on the My Netscape portal. This version became known as RSS 0.9. In July 1999 Netscape produced a prototype, tentatively named RSS 0.91, RSS standing for Rich Site Summary, this was a compromise with their customers who argued the complexity introduced (as XML namespaces) was unnecessary. This they considered a interim measure, with Libby suggesting an RSS 1.0-like format through the so-called Futures Document [2].
Soon afterwards, Netscape lost interest in RSS, leaving the format without an owner, just as it was becoming widely used. A working group and mailing list, RSS-DEV, was set up by various users to continue its development. At the same time, Winer posted a modified version of the RSS 0.91 specification - it was already in use in their products. Since neither side had any official claim on the name or the format, arguments raged whenever either side claimed RSS as its own, creating what became known as the RSS fork. [3]
The RSS-DEV group went on to produce RSS 1.0 in December 2000. Like RSS 0.9 (but not 0.91) this was based on the RDF specifications, but was more modular, with many of the terms coming from standard metadata vocabularies such as Dublin Core. Nineteen days later, Winer released RSS 0.92, a minor and (mostly) compatible revision of RSS 0.91. The next two years saw various minor revisions of the Userland branch of RSS, and its adoption by major media organizations, including The New York Times.
Winer published RSS 2.0 in 2002, emphasizing "Really Simple Syndication" as the meaning of the three-letter abbreviation. RSS 2.0 remained largely compatible with RSS 0.92, and added the ability to add extension elements in their own namespaces. In 2003, Winer and Userland Software assigned ownership of the RSS 2.0 specification to his then workplace, Harvard's Berkman Center for the Internet & Society.
- BlueZ . . . . 17 matches
[[TableOfContents]]
The overall goal of this project is to make an implementation of the Bluetooth™ wireless standards specifications for Linux. The code is licensed under the GNU General Public License (GPL) and is now included in the Linux 2.4 and Linux 2.6 kernel series.
ii = (inquiry_info*)malloc(max_rsp * sizeof(inquiry_info));
memset(name, 0, sizeof(name));
if (hci_read_remote_name(sock, &(ii+i)->bdaddr, sizeof(name),
int opt = sizeof(rem_addr);
// bind socket to port 1 of the first available
bind(s, (struct sockaddr *)&loc_addr, sizeof(loc_addr));
memset(buf, 0, sizeof(buf));
bytes_read = read(client, buf, sizeof(buf));
status = connect(s, (struct sockaddr *)&addr, sizeof(addr));
int opt = sizeof(rem_addr);
// bind socket to port 0x1001 of the first available
bind(s, (struct sockaddr *)&loc_addr, sizeof(loc_addr));
memset(buf, 0, sizeof(buf));
bytes_read = read(client, buf, sizeof(buf));
status = connect(s, (struct sockaddr *)&addr, sizeof(addr));
- MoinMoinTodo . . . . 17 matches
This is a list of things that are to be implemented. If you miss a feature, have a neat idea or any other suggestion, please put it on MoinMoinIdeas.
To discuss the merit of the planned extensions, or new features from MoinMoinIdeas, please use MoinMoinDiscussion.
A list of things that are added to the current source in CVS are on MoinMoinDone.
Contents: [[TableOfContents]]
* Now that we can identify certain authors (those who have set a user profile), we can avoid to create a backup copy if one author makes several changes; we have to remember who made the last save of a page, though.
* Replace SystemPages by using the normal "save page" code, thus creating a backup copy of the page that was in the system. Only replace when diff shows the page needs updating.
* [[SiteMap]]: find the hotspots and create a hierarchical list of all pages (again, faster with caching)
* Using the new zipfile module, add a download of all pages
* Some of MeatBall:IndexingScheme as macros
* or look at viewcvs www.lyra.org/viewcvs (a nicer python version of cvsweb with bonsai like features)
* Script or macro to allow the creation of new wikis ==> WikiFarm
* Setup tool (cmd line or cgi): fetch/update from master set of system pages, create a new wiki from the master tarball, delete pages, ...
* Add display of config params (lower/uppercase letterns) to the SystemInfo macro.
* WikiName|s instead of the obsessive WikiName' ' ' ' ' 's (or use " " for escaping)
* Configuration ''outside'' the script proper (config file instead of moin_config.py)
* When a save is in conflict with another update, use the rcs/cvs merge process to create the new page, so the conflicts can be refactored. Warn the user of this!
* Use text links instead of images on RecentChanges
- MoniWikiPo . . . . 17 matches
# Copyright (C) 2003-2006 Free Software Foundation, Inc.
msgid "Blog cache of \"%s\" is refreshed"
msgid "Found %s matching %s out of %s total pages"
msgid "Number of Pages"
msgid "TwinPages of %s"
msgid "Permission of \"%s\" changed !"
msgid "Change permission of \"%s\""
msgid "Invalid use of ticket"
msgid "TrackBack list of %s"
msgid "Please try again or make a new profile"
msgid "Profiles are saved successfully !"
msgid " or alternativly, use one of these templates:\n"
"<b>Lists:</b> space and one of * bullets; 1., a., A., i., I. numbered "
msgid "Use one of the following templates as an initial release :\n"
msgid "Summary of Change"
msgid "Preview of %s"
msgid "Make profile"
- UnixSocketProgrammingAndWindowsImplementation . . . . 17 matches
[[TableOfContents]]
memset((struct sockaddr *)&ina, 0, sizeof(struct sockaddr));
if( bind(sockfd, (struct sockaddr *)&ina, sizeof(struct sockaddr) == -1 )
int sizeof_sockaddr_in;
sizeof_sockaddr_in = sizeof(struct sockaddr_in);
client_sock = accept(server_sock, (struct sockaddr *)&client_addr, &sizeof_sockaddr_in);
if( connect(client_sock, (struct sockaddr *)&client_addr, sizeof(struct sockaddr)) == -1 )
if( send(client_sock, buf1, sizeof(buf), 0) == -1 )
// 성공 시 수신 한 바이트 수(단 EOF만나면 0), 실패 시 -1 리턴
str_len = recv(sockfd, buf1, sizeof(buf1), 0);
str_len = read(sockfd, buf2, sizeof(buf2));
int sizeof_sockaddr_in;
memset((SOCKADDR_IN *)&server_addr, 0, sizeof(SOCKADDR_IN));
if( bind(server_sock, (sockaddr *)&server_addr, sizeof(SOCKADDR_IN)) == -1 )
sizeof_sockaddr_in = sizeof(SOCKADDR_IN);
client_sock = accept(server_sock, (sockaddr *)&client_addr, &sizeof_sockaddr_in);
send(client_sock, msg, sizeof(msg), 0);
- CompleteTreeLabeling/조현태 . . . . 16 matches
[[TableOfContents]]
line=(block**)malloc(sizeof(block*)*number_nodes);
block* temp_block=(block*)malloc(sizeof(block));
temp_block->next=(block**)malloc(sizeof(block*)*input_degree);
line=(block**)malloc(sizeof(block*)*number_nodes);
block* temp_block=(block*)malloc(sizeof(block));
temp_block->next=(block**)malloc(sizeof(block*)*degree);
int number_of_one=get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1);
sub_line=(int*)malloc(sizeof(int)*remain);
if (i<number_of_one)
for (int process_combination=0; process_combination<Get_combination(remain,number_of_one); ++process_combination)
for (register int i=0; i<number_of_one; ++i)
for (register int i=number_of_one-1; i>=0; --i)
sub_line=(int*)malloc(sizeof(int)*(get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1)));
int gaesu_of_one=0;
++gaesu_of_one;
for (register int k=j+1; k<j+2+gaesu_of_one; ++k )
- DPSCChapter2 . . . . 16 matches
[[TableOfContents]]
Before launching into our descriptions of specific design patterns, we present a case study of sorts, involving multiple patterns. In the Design Pattern preface, the Gang of Four speak about moving from a "Huh?" to an "Aha!" experience with regard to understanding design patterns. We present here a little drama portraying such a transition. It consists of three vignettes: three days in the life of two Smalltalk programmers who work for MegaCorp Insurance Company. We are listening in on conversations between Don (an object newbie, but an experienced business analyst) and Jane (an object and pattern expert). Don comes to Jane with his design problems, and they solve them together. Although the characters are fictitious, the designs are real and have all been part of actual systems written in Smalltalk. Our goal is to demonstrate how, by careful analysis, design patterns can help derive solutions to real-world problems.
디자인 패턴에 대한 구체적인 설명에 들어가기 전에 우리는 다양한 패턴들이 포함된 것들에 대한 예시들을 보여준다. 디자인 패턴 서문에서 GoF는 디자인 패턴을 이해하게 되면서 "Huh?" 에서 "Aha!" 로 바뀌는 경험에 대해 이야기한다. 우리는 여기 작은 단막극을 보여줄 것이다. 그것은 3개의 작은 이야기로 구성되어있다 : MegaCorp라는 보험회사에서 일하는 두명의 Smalltalk 프로그래머의 3일의 이야기이다. 우리는 Don 과(OOP에 대해서는 초보지만 경험있는 사업분석가) Jane (OOP와 Pattern 전문가)의 대화내용을 듣고 있다. Don 은 그의 문제를 Jane에게 가져오고, 그들은 같이 그 문제를 해결한다. 비록 여기의 인물들의 허구의 것이지만, design 은 실제의 것이고, Smalltalk로 쓰여진 실제의 시스템중 일부이다. 우리의 목표는 어떻게 design pattern이 실제세계의 문제들에 대한 해결책을 가져다 주는가에 대해 설명하는 것이다.
2.1 Scene One : State of Confusion
우리의 이야기는 지친표정을 지으며 제인의 cubicle (음.. 사무실에서의 파티클로 구분된 곳 정도인듯. a small room that is made by separating off part of a larger room)로 가는 Don 과 함께 시작한다. 제인은 자신의 cubicle에서 조용히 타이핑하며 앉아있다.
Don : Here, let me show you the section of the requirements document I've got the problem with:
1. Data Entry. This consists of various systems that receive health claims from a variety of different sources. All are logged by assigning a unique identifier. Paper claims and supporting via OCR (optical character recognition) to capture the data associated with each form field.
3. Provider/Plan Match. An automated process attempts to mach the plan (the contract unser which the claim is being paid) and the health care provider (e.g., the doctor) identified on the claim with the providers with which the overall claim processing organization has a contract. If there is no exact match, the program identifies the most likely matches based on soundex technology (an algorithm for finding similar-sounding words). The system displays prospective matches to knowledge workers in order of the likeinhood of the match, who then identify the correct provider.
5. Adjudication of Pended Claims. The adjudicator can access the system for a claim history or a representation of the original claim. The adjudicator either approves the claim for payment, specifying the proper amount to pay, or generates correspondence denying the claim.
- 레밍즈프로젝트/프로토타입/파일스트림 . . . . 16 matches
|| MFC 파일 스트림 || [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmfc98/html/_mfc_cstring.asp] ||
|| ReadHuge || Can read more than 64K of (unbuffered) data from a file at the current file position. Obsolete in 32-bit programming. See Read. ||
|| WriteHuge || Can write more than 64K of (unbuffered) data in a file to the current file position. Obsolete in 32-bit programming. See Write. ||
|| SeekToBegin || Positions the current file pointer at the beginning of the file. ||
|| SeekToEnd || Positions the current file pointer at the end of the file. ||
|| GetLength || Retrieves the length of the file. ||
|| SetLength || Changes the length of the file. ||
|| LockRange || Locks a range of bytes in a file. ||
|| UnlockRange || Unlocks a range of bytes in a file. ||
|| GetStatus || Retrieves the status of this open file. ||
|| GetFileName || Retrieves the filename of the selected file. ||
|| GetFileTitle || Retrieves the title of the selected file. ||
|| GetFilePath || Retrieves the full file path of the selected file. ||
|| SetFilePath || Sets the full file path of the selected file. ||
|| GetStatus || Retrieves the status of the specified file (static, virtual function). ||
|| SetStatus || Sets the status of the specified file (static, virtual function). ||
- AseParserByJhs . . . . 15 matches
#define UOFFSET "*UVW_U_OFFSET"
#define VOFFSET "*UVW_V_OFFSET"
vec_t uTile; // u tiling of texture
vec_t vTile; // v tiling of "
vec_t uOffset; // u offset of "
vec_t vOffset; // v offset of "
memcpy (pDest, pChildTmp, sizeof (CHS_Model*) * (pNodeList [i2]->GetChildNum ()-1)); // 복사
while (!feof (s)) //파일 스트림이 끝났는지 check!
fgets (data, sizeof (data), s);
while (!feof (s)) //파일 스트림이 끝났는지 check!
fgets (data, sizeof (data), s);
while (!feof (s))
// in 3dsm negative z goes out of the screen, we want it to go in
memcpy (&pM->pPosKey[nTmpCount2].p, p, sizeof (vec3_t));
else if (strcmp (data, UOFFSET) == 0)
pM->texture.uOffset = GetFloatVal (s);
else if (strcmp (data, VOFFSET) == 0)
pM->texture.vOffset = GetFloatVal (s);
fgets (data, sizeof (data), s);
- EffectiveC++ . . . . 14 matches
[[TableOfContents]]
instead of upper..
=== Item 5: Use the same form in corresponding uses of new and delete ===
* ''Initialization of the pointer in each of the constructors. If no memory is to be allocated to the pointer in a particular constructor, the pointer should be initialized to 0 (i.e., the null pointer). - 생성자 각각에서 포인터 초기화''
* ''Deletion of the existing memory and assignment of new memory in the assignment operator. - 포인터 멤버에 다시 메모리를 할당할 경우 기존의 메모리 해제와 새로운 메모리의 할당''
* ''Deletion of the pointer in the destructor. - 소멸자에서 포인터 삭제''
=== Item 7: Be prepared for out-of-memory conditions. ===
void noMoreMemory(); // decl. of function to
if (size != sizeof (Base)) // size가 잘못 되었으면
if (size != sizeof(Base)) { // if size is "wrong,"
=== Item 9: Avoid hiding the "normal" form of new ===
static unsigned int numberOfTargets()
static unsined int numberOfTanks()
// the Base part of a Derived object is unaffected by this assignment operator.
return "E.H.Gombrich"; // the story of art의 저자
- LearningToDrive . . . . 14 matches
I can remeber clearly the day I first began learning to drive. My mother and I were driving up Interstate 5 near Chico, California, a horizon. My mom had me reach over from the passenger seat and hold the steering wheel. She let me get the feel of how motion of the wheel affected the dirction of the car. Then she told me, "Here's how you drive. Line the car up in the middle of the lane, straight toward the horizon."
I very carefully squinted straight down the road. I got the car smack dab in the middle of the lane, pointed right down the middle of the road. I was doing great. My mind wandered a little...
This is the paradigm for XP. There is no such thing as straight and level. Even if things seem to be going perfectly, you don't take your eyes off the road. Change is the only constant. Always be prepared to move a little this way, a little that way. Sometimes maybe you have to move in a completely different direction. That's life as a programmer.
Everythings in software changes. The requirements change. The design changes. The business changes. The technology changes. The team changes. The team members change. The problem isn't change, per se, because change is going to happen; the problem, rather, is the inability to cope with change when it comes.
The driver of a software project is the customer. If the software doesn't do what they want it to do, you have failed. Of course, they don't know exactly what the software should do. That's why software development is like steering, not like getting the car pointed straight down the road. Out job as programmers is to give the customer a steering wheel and give them feedback about exactly where we are on the road.
소프트웨어 개발을 운전을 배우는 것에 비유한 설명이 재미있네요. software project 의 Driver 는 customer 라는 말과.. Programmer 는 customer 에게 운전대를 주고, 그들에게 우리가 정확히 제대로 된 길에 있는지에 대해 feedback 을 주는 직업이라는 말이 인상적이여서. 그리고 customer 와 programmer 와의 의견이 수렴되어가는 과정이 머릿속으로 그려지는 것이 나름대로 인상적인중. 그리고 'Change is the only constant. Always be prepared to move a little this way, a little that way. Sometimes maybe you have to move in a completely different direction. That's life as a programmer.' 부분도.. 아.. 부지런해야 할 프로그래머. --;
- [Lovely]boy^_^/EnglishGrammer/Passive . . . . 14 matches
[[TableOfContents]]
B. When we use the passive, who or what causes the action is often unknown or unimportant.(그리니까 행위주체가 누군지 모를때나 별로 안중요할때 수동태 쓴대요)
ex) A lot of money was stolen in the robbery.
B. Some verbs can have two objects(ex : give, ask, offer, pay, show, teach, tell)
When we use these verbs in the passive, most often we begin with the person.
ex) You will be given plenty of time to decide.(= We will give you plenty of time)
C. The passive of doing/seeing -> being done/being seen
D. Get : Sometimes you can use get instead of be in the passive:
We can use these structures with a number of other verbs
ex) Mark is supposed to have kicked a police officer.( = he is said to have kicked)
= it is planned, arranged, or expected. Often this is different from what really happens
A. The roof of Lisa's house was damaged in a storm, so she arranged for somebody to repair it. Yesterday a worker came and did the job.
Lisa 'had the roof repaired' yesterday.
This means : Lisa arranged for somebody else to repair the roof. She didn't repair it herself.
- HowToStudyXp . . . . 13 matches
* The Timeless Way of Building : 패턴 운동을 일으킨 Christopher Alexander의 저작. On-site Customer, Piecemeal Growth, Communication 등의 아이디어가 여기서 왔다.
* Adaptive Software Development (Jim Highsmith) : 복잡계 이론을 개발에 적용. 졸트상 수상.
* Software Project Survival Guide (Steve McConnell) : 조금 더 "SE"적인 시각.
* The Psychology of Computer Programming (Gerald M. Weinberg) : 프로그래밍에 심리학을 적용한 고전. Egoless Programming이 여기서 나왔다.
* Agile Software Development (Alistair Cockburn) : 전반적 Agile 방법론에 대한 책
* ["SoftwareCraftsmanship"] (Pete McBreen) : 새로운 프로그래머상
* Agile Software Development with [http://www.controlchaos.com/ SCRUM](Schwaber Ken) : 최근 Scalability를 위해 XP+[http://www.controlchaos.com/ SCRUM]의 시도가 agile 쪽의 큰 화두임.
* IEEE Software/Computer, CACM, ["SoftwareDevelopmentMagazine"] 등에 실린 기사
* [http://groups.google.co.kr/groups?hl=ko&lr=&ie=UTF-8&newwindow=1&group=comp.software.extreme-programming news:comp.software.extreme-programming]
'''Agile Software Development with [http://www.controlchaos.com/ SCRUM]''' by Schwaber Ken
'''Agile Software Development Ecosystems''' by Jim Highsmith
- MoinMoinBugs . . . . 13 matches
[[TableOfContents]]
''Yes, by design, just like headings don't accept trailing spaces. In the case of headings, it is important because "= x =" is somewhat ambiguous. For tables, the restriction could be removed, though.''
And as a fun sidenote, the UserPreferences cookie doesn't seem to work. The cookie is in my ~/.netscape/cookies file still. My EfnetCeeWiki and XmlWiki cookies are duplicated!? It is kind of like the bug you found when I, ChristianSunesson, tried this feature with netscape just after you deployed it.
* Solve the problem of the Windows filesystem handling a WikiName case-indifferent (i.e. map all deriatives of an existing page to that page).
* RecentChanges can tell you if something is updated, or offer you a view of the diff, but not both at the same time.
* That's what I'm doing for the time being, but by the same rationale you don't need to offer diffs from RecentChanges at all.
* Hmmm, that '''is''' so. :) Take a look at the message at the top of the diff page after clicking on "updated", it'll often show text like "spanning x versions". You need the current CVS version for that, though.
* Oh, okay. Is this MoinMoin CVS enabled? Reason being: I did a few updates of a page, and was only being shown the last one. I'll try that some more and get back to you.
With 0.3, TitleIndex is broken if first letter of Japanese WikiName is multibyte character. This patch works well for me but need to be fixed for other charsets.
''Differently broken. :) I think we can live with the current situation, the worst edges are removed (before, chopping the first byte out of an unicode string lead to broken HTML markup!). It will stay that way until I buy the [wiki:ISBN:0201616335 Unicode 3.0] book.''
The main, rectangular background, control and data area of an application. <p></ul>
- NSIS/예제3 . . . . 13 matches
[[TableOfContents]]
WriteRegStr HKLM SOFTWARE\ZPTetris "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris" "DisplayName" "ZPTetris (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris" "UninstallString" '"$INSTDIR\uninstall.exe"'
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris"
DeleteRegKey HKLM SOFTWARE\ZPTetris
MakeNSIS v1.95 - Copyright 1999-2001 Nullsoft, Inc.
WriteRegStr: HKLM\SOFTWARE\ZPTetris\Install_Dir=$INSTDIR
WriteRegStr: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris\DisplayName=ZPTetris (remove only)
WriteRegStr: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris\UninstallString="$INSTDIR\uninstall.exe"
DeleteRegKey: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris
DeleteRegKey: HKLM\SOFTWARE\ZPTetris
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 13 matches
int offset;
offset = 0;
offset = 0;
String(const String& str, const int offset,const int count){
if(offset >= str.count){
this->value = str.value + offset;
this->offset = 0;
int indexOf(String& str){
int lastIndexOf(String& str){
String * subString(int offset, int count){
char * offvalue = this->value+ offset;
*(temp + i) = *(offvalue+i);
char * temp = this->value + this->offset;
char * temp2 = str.value + str.offset;
//cout << s->lastIndexOf(*s2) << endl;
- 데블스캠프2013/셋째날/머신러닝 . . . . 13 matches
ofstream outputFile;
int ** train_data = (int**)malloc(sizeof(int*) * row);
train_data[i] = (int*)malloc(sizeof(int) * col);
(*arr) = (int***) malloc(sizeof(int**) * 2);
(*arr)[i] = (int**) malloc (sizeof(int*) * size);
(*arr)[0][i] = (int*) malloc (sizeof(int) * DATA_SIZE);
(*arr)[1][i] = (int*) malloc (sizeof(int));
ofstream ofs;
ofs.open("result.txt");
ofs << category[mincat] << endl;
ofs.close();
cout<<"end of find class"<<endl;
- WinampPluginProgramming/DSP . . . . 12 matches
// Copyright (C) 1997, Justin Frankel/Nullsoft
// Module header, includes version, description, and address of the module retriever function
winampDSPHeader hdr = { DSP_HDRVER, "Nullsoft DSP demo v0.3 for Winamp 2", getModule };
"Nullsoft Echo v0.2",
"Nullsoft Stereo Voice Removal v0.2",
"Nullsoft Pitch/Tempo Control v0.2",
"Nullsoft Pitch/Tempo Control v0.3 - lower",
"Nullsoft Pitch/Tempo Control v0.3 - higher",
MessageBox(this_mod->hwndParent,"This module is Copyright(C) 1997, Justin Frankel/Nullsoft\n"
" * Voice removal sucks (works about 10% of the time)!\n"
"etc... this is really just a test of the new\n"
// cleanup (opposite of init()). Destroys the window, unregisters the window class
- WindowsTemplateLibrary . . . . 12 matches
{{| [[TableOfContents]] |}}
{{|The Windows Template Library (WTL) is an object-oriented Win32 encapsulation C++ library by Microsoft. The WTL supports an API for use by programmers. It was developed as a light-weight alternative to Microsoft Foundation Classes. WTL extends Microsoft's ATL, another lightweight API for using COM and for creating ActiveX controls. Though created by Microsoft, it is unsupported.
In an uncharacteristic move by Microsoft—an outspoken critic of open source software—they made the source code of WTL freely available. Releasing it under the open-source Common Public License, Microsoft posted the source on SourceForge, an Internet open-source repository. The SourceForge version is 7.5.
Being an unsupported library, WTL has little formal documentation. However, most of the API is a direct mirror of the standard Win32 calls, so the interface is familiar to most Windows programmers.|}}
[http://www.microsoft.com/downloads/details.aspx?FamilyID=128e26ee-2112-4cf7-b28e-7727d9a1f288&DisplayLang=en MS WTL]
- [Lovely]boy^_^/Arcanoid . . . . 12 matches
|| [[TableOfContents]] ||
* I change a background picture from a Jang na ra picture to a blue sky picture. but my calculation of coordinate mistake cuts tree picture.
* My previous arcanoid could process 1ms of multi media timer, but this version of arcanoid can't process over 5ms of multi media timer. why..
* Game can exhibit score, number of broken blocks, and time.
* When a ball collides with a moving bar, its angle changes, but it's crude. Maybe it is hard that maintains a speed of a ball.
* I resolve a problem of multi media timer(10/16). its problem is a size of a object. if its size is bigger than some size, its translation takes long time. So I reduce a size of a object to 1/4, and game can process 1ms of multi media timer.
* Now sources become very dirty, because I add a new game skill. I always try to eliminate a duplication, and my source has few duplication. but method's length is so long, and responsiblity of classes is not divided appropriately. All collision routine is focusing on CArcaBall class.
* I change a design of a arcanoid. - previous version is distribute, but this version is that god class(CArcanoidDoc)' admins a total routine. in my opinion, it's more far from OOP.--;
- 새싹교실/2012/startLine . . . . 12 matches
[[TableOfContents]]
void printCalender(int nameOfDay, int year, int month);
// 달의 첫 날의 요일(nameOfDay)과 마지막 날의 수를 받아서 1~endDayOfMonth까지 출력합니다.
void printDate(int nameOfDay, int endDayOfMonth);
void printFirstTab(int nameOfDay);
int calculateNameOfNextMonthFirstDay(int nameOfDay, int year, int month);
int calculateNameOfLastDay(int nameOfDay, int year, int month);
int endDayOfMonth(int year, int month);
// year와 요일(nameOfDay)을 입력받는 부분.
int year = 0, nameOfDay = 0;
printf("Enter the name of day(0:sun ~ 6:sat) : ");
scanf("%d", &nameOfDay);
printCalender(nameOfDay, year, month);
nameOfDay = calculateNameOfNextMonthFirstDay(nameOfDay, year, month);
이런 상황을 피하기 위해서는 처음에 p를 초기화 하고 사용하거나 memset(p.name, 0, sizeof(char)*100);을 하는 방법이 있습니다.
account.name = (char *)malloc(sizeof(char) * (strlen(name)+1));
res = (LinkedList *)malloc( sizeof(LinkedList) );
res = (Node *)malloc( sizeof(Node) );
int onoff = 0; //for duty of switch
onoff = 1;
- Calendar환희코드 . . . . 11 matches
int numberofDay, year, month;
scanf("%d", &numberofDay);
while(numberofDay < 0 || numberofDay > 6){
scanf("%d", numberofDay);
달력출력(numberofDay, year, month);
numberofDay = 몇요일로시작할까(numberofDay, year, month);
int 달력형식(int nameofDay, int year, int month);
int 달력형식(int nameofDay, int year, int month){
switch(nameofDay){
- NamedPipe . . . . 11 matches
A named pipe is a named, one-way or duplex pipe for communication between the pipe server and one or more pipe clients. All instances of a
named pipe share the same pipe name, but each instance has its own buffers and handles, and provides a separate conduit for client-server communication. The use of instances enables multiple pipe clients to use the same named pipe simultaneously.
Any process can access named pipes, subject to security checks, making named pipes an easy form of communication between related or unrelated processes. Named pipes can be used to provide communication between processes on the same computer or between processes on different computers across a network.
Any process can act as both a server and a client, making peer-to-peer communication possible. As used here, the term pipe server refers to a process that creates a named pipe, and the term pipe client refers to a process that connects to an instance of a named pipe.
// The main loop creates an instance of the named pipe and
BUFSIZE, // size of buffer
&cbBytesRead, // number of bytes read
cbReplyBytes, // number of bytes to write
&cbWritten, // number of bytes written
512, // size of buffer
&cbRead, // number of bytes read
- OurMajorLangIsCAndCPlusPlus/XML/조현태 . . . . 11 matches
SReadBlock* newBlock = (SReadBlock*)malloc(sizeof(SReadBlock));
newBlock->name = (char*)malloc(sizeof(char) * (strlen(name) + 1));
newBlock->contents = (char*)malloc(sizeof(char) * (strlen(contents) + 1));
SReadBlock** newNextBlocks = (SReadBlock**)malloc(sizeof(SReadBlock*) * (head->nextBlockNumber + 1));
memcpy(newNextBlocks, head->nextBlocks, sizeof(SReadBlock*) * head->nextBlockNumber);
char* textBuffur = (char*)malloc(sizeof(char) * (nameEndPoint - readData + 1));
char* textBuffur = (char*)malloc(sizeof(char) * (contentsEndPoint - readData + 1));
newBlocks = (SReadBlock**)malloc(sizeof(SReadBlock*) * ((int)(**suchedBlocks) + 2));
memcpy(newBlocks, *suchedBlocks, sizeof(SReadBlock*) * ((int)(**suchedBlocks) + 1));
suchedBlocks = (SReadBlock**)malloc(sizeof(SReadBlock*));
textBuffur = (char*)malloc(sizeof(char) * (suchEndPoint - query + 1));
- 몸짱프로젝트/BinarySearchTree . . . . 11 matches
|| [[TableOfContents]] ||
## if self.getNumofChildren( node ) == 0:
## elif self.getNumofChildren( node ) == 1:
if node.numofChildren() == 0:
elif node.numofChildren() == 1:
def getNumofChildren( self, aNode ):
def numofChildren(self):
## def testGetNumofChildren(self):
## self.assertEquals(bst.getNumofChildren( bst.root ), 2 )
if node.numofChildren() == 0:
elif node.numofChildren() == 1:
def numofChildren(self):
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 10 matches
|| char * strncpy(char * strDestination, const char * strSource, size_t count) || Copy characters of one string to another ||
|| char * strncat(char * strDestination, const char * strSource, size_t count) || Append characters of a string. ||
|| int stricmp(const char *stirng1, const char *string2) || Perform a lowercase comparison of strings. ||
|| int strncmp(const char *string1, const char *string2, size_t count) || Compare characters of two strings. ||
|| int strnicmp(const char *string1, const char *string2, size_t count) || Compare characters of two strings without regard to case. ||
|| char * strset(char *string, int c) || Set characters of a string to a character. ||
|| char * strnset(char *stirng, int c, size_t count) || Initialize characters of a string to a given format. ||
|| size_t strlen(const char *string) || Get the length of a string. ||
|| char * strrchr(const char *string, int c) || Scan a string for the last occurrence of a character. ||
|| char * strrev(char *string) || Reverse characters of a string. ||
- RUR-PLE/Etc . . . . 10 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
- Refactoring/SimplifyingConditionalExpressions . . . . 10 matches
[[TableOfContents]]
* You have a sequence of conditional tests with the same result. [[BR]]''Combine them into a single conditional expression and extract it.''
* The same fragment of code is in all branches of a conditional expression. [[BR]]''Move it outside of the expression.''
* A method has conditional behavior that does not make clear the normal path of execution [[BR]] ''Use guard clauses for all the special cases.''
* You have a conditional that chooses different behavior depending on the type of and object [[BR]] ''Move each leg of the conditional to an overriding method in a subclass. Make the orginal method abstract.''
return getBaseSpeed() - getLoadFactor() * _numberofCoconuts;
* A section of code assumes something about the state of the program. [[BR]]''Make the assumption explicit with an assertion.''
- SoftwareEngineeringClass . . . . 10 matches
* ["SoftwareEngineeringClass/Exam2002_1"]
* ["SoftwareEngineeringClass/Exam2002_2"]
* ["SoftwareEngineeringClass/Exam2006_1"]
* ''Software engineering'', Ian Sommerville : 최근 세계적으로 가장 많이 쓰이고 있는 SE 교과서. 탁월.
["1002"]: 분야가 너무 넓다. 하루 PPT 자료 나아가는 양이 거의 60-70장이 된다. -_-; SWEBOK 에서의 각 Chapter 별로 관련 Reference들 자료만 몇십권이 나오는 것만 봐도. 아마 SoftwareRequirement, SoftwareDesign, SoftwareConstruction, SoftwareConfigurationManagement, SoftwareQualityManagement, SoftwareProcessAssessment 부분중 앞의 3개/뒤의 3개 식으로 수업이 분과되어야 하지 않을까 하는 생각도 해본다. (그게 4학년 객체모델링 수업이려나;) [[BR]]
- 데블스캠프2010/Prolog . . . . 10 matches
[[TableofContents]]
is_son_of(hades, cronus).
is_son_of(poseidon, cronus).
is_son_of(zeus, cronus).
is_daughter_of(hestia, cronus).
is_daughter_of(hera, cronus).
is_daughter_of(demeter, cronus).
is_parent_of(Y, X) :- is_son_of(X, Y); is_daughter_of(X, Y).
- DebuggingSeminar_2005 . . . . 9 matches
{{|[[TableOfContents]]|}}
|| [http://www.compuware.com/products/numega.htm NuMega] || [SoftIce] , DevPartner 개발사 ||
|| [http://www.compuware.com/products/devpartner/softice.htm SoftIce for DevPartner] || 데브파트너랑 연동하여 쓰는 SoftIce, [http://www.softpedia.com/get/Programming/Debuggers-Decompilers-Dissasemblers/SoftICE.shtml Freeware Download] ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/tools/tools/rebase.asp ReBase MSDN] || Rebase is a command-line tool that you can use to specify the base addresses for the DLLs that your application uses ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vccore/html/_core_viewing_decorated_names.asp undname.exe] || C++ Name Undecorator, Map file 분석툴 ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vsdebug/html/_core_c_run2dtime_library_debugging_support.asp Debug CRT] || VC++4 에서 지원하기 시작한 C런타임 라이브러리 ||
- MoreEffectiveC++/Miscellany . . . . 9 matches
||[[TableOfContents]]||
원문:As software developers, we may not know much, but we do know that things will change. We don't necessarily know what will change, how the changes will be brought about, when the changes will occur, or why they will take place, but we do know this: things will change.
"변화한다.", 험난한 소프트웨어의 발전에 잘 견디는 클래스를 작성하라. (원문:Given that things will change, writeclasses that can withstand the rough-and-tumble world of software evolution.) "demand-paged"의 가상 함수를 피하라. 다른 이가 만들어 놓지 않으면, 너도 만들 방법이 없는 그런 경우를 피하라.(모호, 원문:Avoid "demand-paged" virtual functions, whereby you make no functions virtual unless somebody comes along and demands that you do it) 대신에 함수의 ''meaning''을 결정하고, 유도된 클래스에서 새롭게 정의할 것인지 판단하라. 그렇게 되면, 가상(virtual)으로 선언해라, 어떤 이라도 재정의 못할지라도 말이다. 그렇지 않다면, 비가상(nonvirtual)으로 선언해라, 그리고 차후에 그것을 바꾸어라 왜냐하면 그것은 다른사람을 편하게 하기 때문이다.;전체 클래스의 목적에서 변화를 유지하는지 확신을 해라.
여기에서 우리가 생각해볼 관점은 총 네가지가 필요하다.:name mangling, initialization of statics, dynamic memory allocation, and data structure compatibility.
=== Initialization of statics : static 인자의 초기화 ===
''The Design and Evolution of C++''에 거의 모든 변화가 언급되어 있다. 현재 C++ 참고서(1994년 이후에 쓰여진것들)도 이 내용을 포함하고 있을 것이다. (만약 당신이 찾지 못하면 그거 버려라) 덧붙여 ''More Effective C++''(이책이다.)는 이러한 새로운 부분에 관한 대부분의 사용 방법이 언급되어 있다. 만약 당신이 이것에 리스트를 알고 싶다면, 이 책의 인덱스를 살펴보아라.
표준 라이브러리에 일어나는 것들에 대한것에서 C++의 정확한 규정의 변화가 있다. 개다가 표준 라이브러리의 개선은 언어의 표준 만큼이나 알려지지 않는다. 예를 들어서 ''The Design and Evolution of C++'' 거의 표준 라이브러리에 관한 언급이 거의 없다. 그 책의 라이브러리에 과한 논의라면 때때로 있는 데이터의 출력이다. 왜냐하면, 라이브러리는 1994년에 실질적으로 변화되었기 때문이다.
Fortunately, this syntactic administrivia is automatically taken care of when you #include the appropriate headers.
STL, 그것의 중심(core)는 매우 간단하다. 그것은 단지, 대표 세트(set of convention)를(일반화 시켰다는 의미) 덧붙인 클래스와 함수 템플릿의 모음이다. STL collection 클래스는 클래스로 정의되어진 형의 iterator 객체 begin과 end 같은 함수를 제공한다. STL algorithm 함수는 STL collection상의 iterator 객체를 이동시킨다. STL iterator는 포인터와 같이 동작한다. 그것은 정말로 모든 것이 포인터 같다. 큰 상속 관계도 없고 가상 함수도 없고 그러한 것들이 없다. 단지 몇개의 클래스와 함수 템플릿과 이들을 위한 작성된 모든 것이다.
- MoreEffectiveC++/Operator . . . . 9 matches
||[[TableOfContents]]||
== Item 5: Be wary of user-defined conversion functions. ==
== Item 6: Distinguish between prefix and postfix forms of increment and decrement operators. ==
new delete sizeof typeid
== Item 8: Understand the differend meanings of new and delete ==
이 코드는 new operator를 사용한 것이다. new operator는 sizeof 처럼 언어 상에 포함되어 있으며, 개발자가 더 이상 그 의미의 변경이 불가능하다. 이건 두가지의 역할을 하는데, 첫째로 해당 객체가 들어갈 만한 메모리를 할당하는 것이고, 둘째로 해당 객체의 생성자를 불러주는 역할이다. new operator는 항상 이 두가지의 의미라 작동하며 앞에서 언급한듯 변경은 불가능하다.
void *rawMemory = operator new(sizeof(string));
void *memory = operator new(sizeof(string));
void * buffer = operator new(50*iszeof(char));
void *shareMemory = mallocShared(sizeof(Widget));
- OptimizeCompile . . . . 9 matches
=== Basic of Compiler Optimization ===
==== Reduction of computation ====
==== Reduction of space consumption ====
==== Reduction of code size ====
==== Reduction of complexity ====
==== Reduction of latency ====
e.g. instruction prefetching, branch prediction, out-of-order execution
==== Distribution of work ====
=== More advanced mothodology of compiler optimization ===
- ProgrammingLanguageClass/Report2002_2 . . . . 9 matches
= Principles of Programming Languages Spring, 2002 Programming Assignment #2 =
1. To find out the maximum length of a variable name
1. To evaluate the security of pointers in the Compilers;
1. To check the evaluation order of operands in the Compilers by raising the functional side-effects if possible;
The output should be a sequence of test programs with the results generated from them. Your grade will be highly dependent on the quality of your test programs.
As usual, you shall submit a floppy diskette with a listing of your program and a set of test data of your own choice, and the output from running your program on your test data set.
- User Stories . . . . 9 matches
User stories serve the same purpose as use cases but are not the same. They are used to create time estimates for the release planning meeting. They are also used instead of a large requirements document. User Stories are written by the customers as things that the system needs to do for them. They are similar to usage scenarios, except that they are not limited to describing a user interface. They are in the format of about three sentences of text written by the customer in the customers terminology without techno-syntax.
User stories also drive the creation of the acceptance tests. One or more automated acceptance tests must be created to verify the user story has been correctly implemented.
One of the biggest misunderstandings with user stories is how they differ from traditional requirements specifications. The biggest
difference is in the level of detail. User stories should only provide enough detail to make a reasonably low risk estimate of how long the story will take to implement. When the time comes to implement the story developers will go to the customer and receive a detailed description of the requirements face to face.
Another difference between stories and a requirements document is a focus on user needs. You should try to avoid details of specific technology, data base layout, and algorithms. You should try to keep stories focused on user needs and benefits as opposed to specifying GUI layouts.
- VMWare/OSImplementationTest . . . . 9 matches
[[TableOfContents]]
[http://neri.cafe24.com/menu/bbs/view.php?id=kb&page=1&sn1=&divpage=1&sn=off&ss=on&sc=on&keyword=x86&select_arrange=headnum&desc=asc&no=264 출처보기]
mov al, 3h ; Number of sectors to read = 1
mov eax, cr0 ; Copy the contents of CR0 into EAX
mov cr0, eax ; Copy the contents of EAX into CR0
jmp 08h:clear_pipe ; Jump to code segment, offset clear_pipe
gdt_end: ; Used to calculate the size of the GDT
dd gdt ; Address of the GDT
number of parameters.\n\n");
== 512 && !feof(input)) {
- WhyWikiWorks . . . . 9 matches
* anyone can play. This sounds like a recipe for low signal - surely wiki gets hit by the unwashed masses as often as any other site. But to make any sort of impact on wiki you need to be able to generate content. So anyone can play, but only good players have any desire to keep playing.
* wiki is not wysiwyg. It's an intelligence test of sorts to be able to edit a wiki page. It's not rocket science, but it doesn't appeal to the TV watchers. If it doesn't appeal, they don't participate, which leaves those of us who read and write to get on with rational discourse.
* wiki is far from real time. Folk have time to think, often days or weeks, before they follow up some wiki page. So what people write is well-considered.
* wiki participants are, by nature, a pedantic, ornery, and unreasonable bunch. So there's a camaraderie here we seldom see outside of our professional contacts.
So that's it - insecure, indiscriminate, user-hostile, slow, and full of difficult, nit-picking people. Any other online community would count each of these strengths as a terrible flaw. Perhaps wiki works because the other online communities don't. --PeterMerel
- 새싹교실/2012/AClass/5회차 . . . . 9 matches
struct Linkedlist *p1 = (struct Linkedlist*)malloc(sizeof(struct Linkedlist));
struct Linkedlist *p2 = (struct Linkedlist*)malloc(sizeof(struct Linkedlist));
struct Linkedlist *p1 = (struct Linkedlist*)malloc(sizeof(struct Linkedlist));
p1->next=(struct Linkedlist*)malloc(sizeof(struct Linkedlist));
p1->next->next=(struct Linkedlist*)malloc(sizeof(struct Linkedlist));
struct node *list=(struct node*)malloc(sizeof(struct node));
struct node *list=(struct node*)malloc(sizeof(struct node));
list->next=(struct node*)malloc(sizeof(struct node));
list->next->next=(struct node*)malloc(sizeof(struct node));
- 임시 . . . . 9 matches
Professional & Technical: 173507
http://en.wikipedia.org/wiki/List_of_IPv4_protocol_numbers protocol number
gethostname(myName, sizeof(myName));
In the first stage, you will write a multi-threaded server that simply displays the contents of the HTTP request message that it receives. After this program is running properly, you will add the code required to generate an appropriate response.
This section explains how to use REST (Representational State Transfer) to make requests through Amazon E-Commerce Service (ECS). REST is a Web services protocol that was created by Roy Fielding in his Ph.D. thesis (see Architectural Styles and the Design of Network-based Software Architectures for more details about REST).
REST allows you to make calls to ECS by passing parameter keys and values in a URL (Uniform Resource Locator). ECS returns its response in XML (Extensible Markup Language) format. You can experiment with ECS requests and responses using nothing more than a Web browser that is capable of displaying XML documents. Simply enter the REST URL into the browser's address bar, and the browser displays the raw XML response.
SearchIndex : Books, Toys, DVD, Music, VideoGames, Software or any other of Amazon's stores
- AcceleratedC++/Chapter3 . . . . 8 matches
||[[TableOfContents]]||
= Chapter 3 Working with batches of data =
"follewd by end-of-file: ";
// the number and sum of grades read so far
// sum is the sum of the first count grades
=== 3.1.1 Testing for end of input ===
== 3.2 Using medians instead of averages ==
=== 3.2.1. Storing a collection of data in a vector ===
"follewd by end-of-file: ";
- ActiveXDataObjects . . . . 8 matches
{{| [[TableOfContents]] |}}
{{|Microsoft ADO (ActiveX Data Objects) is a Component object model object for accessing data sources. It provides a layer between programming languages and databases, which allows a developer to write programs which access data, without knowing how the database is implemented. No knowledge of SQL is required to access a database when using ADO, although one can use ADO to execute arbitrary SQL commands. The disadvantage of this is that this introduces a dependency upon the database.
[http://msdn.microsoft.com/library/default.asp?url=/library/en-us/ado270/htm/dasdkadooverview.asp MS ADO]
{{|In the newer programming framework of .NET, Microsoft also present an upgraded version of ADO called ADO.NET, its object structure is quite different from that of traditional ADO. But ADO.NET is still not quite popular and mature till now.
- FromCopyAndPasteToDotNET . . . . 8 matches
* [http://msdn.microsoft.com/library/en-us/dnolegen/html/msdn_aboutole.asp What OLE Is Really About]
* [http://msdn.microsoft.com/library/en-us/winui/winui/windowsuserinterface/dataexchange/dynamicdataexchange/aboutdynamicdataexchange.asp About Dynamic Data Exchange]
* [http://msdn.microsoft.com/library/en-us/dnautoma/html/msdn_ole2auto.asp Automation for OLE 2.0]
* [http://msdn.microsoft.com/workshop/components/activex/intro.asp Introduction to ActiveX Controls]
* [http://msdn.microsoft.com/library/en-us/cossdk/htm/betaintr_6d5r.asp Introducing COM+]
* [http://msdn.microsoft.com/library/en-us/dndcom/html/msdn_dcomarch.asp DCOM Architecture]
* [http://msdn.microsoft.com/library/en-us/cpguide/html/cpovrintroductiontonetframeworksdk.asp Overview of the .NET Framework]
- GofStructureDiagramConsideredHarmful . . . . 8 matches
There's a mistake that's repeated throughout the Design Patterns book, and unfortunately, the mistake is being repeated by new patterns authors who ape the GoF style.
Design Pattern 책 전반에 걸쳐 반복적으로 잘못 이해되는 내용들이 있는데, 불행하게도 이러한 실수는 GoF의 스타일을 모방한 다른 Pattern 책의 저자들에게서도 반복적으로 나타난다.
Each GoF pattern has a section called "Structure" that contains an OMT (or for more recent works, UML) diagram. This "Structure" section title is misleading because it suggests that there is only one Structure of a Pattern, while in fact there are many structures and ways to implement each Pattern.
사실은 각 Pattern을 구현하기 위한 여러가지 방법이 있는데, GoF의 OMT diagram을 보노라면 마치 각 Pattern에 대한 단 한가지 구현만이 있는 것으로 잘못 이해될 수 있다.
But inexperienced Patterns students and users don't know this. They read the Patterns literature too quickly, often thinking that they understand a Pattern merely by understanding it's single "Structure" diagram. This is a shortcoming of the GoF Form, one which I believe is harmful to readers.
하지만, Pattern에 대한 경험이 부족한 학생들이나 사용자들은 이 사실을 모르고 있다. 그들은 Pattern에 대한 저술들을 너무 빨리 읽는다. 단지 한 개의 Diagram만을 이해하는 것으로 Pattern을 이해했다고 착각하는 경우도 잦다. 이게 바로 필자가 생각하기에는 독자들에게 해로워보이는 GoF 방식의 단점이다.
What about all those important and subtle Implementation notes that are included with each GoF Pattern? Don't those notes make it clear that a Pattern can be implemented in many ways? Answer: No, because many folks never even read the Implementation notes. They much prefer the nice, neat Structure diagrams, because they usually only take up a third of a page, and you don't have to read and think a lot to understand them.
GoF 책의 각 Pattern 마다 첨부되어 있는 구현에 대한 매우 중요하고 민감한 해설들은 어떠한가? 이 해설들을 통해서 Pattern이 여러 방법으로 구현될 수 있다는 사실을 알 수는 없을까? 알 수 없을 것이다. 왜냐하면 많은 독자들이 아예 구현에 대한 해설 부분을 읽지도 않고 넘어가기 때문이다. 그들은 보통 간략하고 훌륭하게 그려진 Structure diagram을 더 선호하는데, 그 이유는 보통 Diagram에 대한 내용이 세 페이지 정도 분량 밖에 되지 않을 뿐더러 이것을 이해하기 위해 많은 시간동안 고민을 할 필요도 없기 때문이다.
Diagrams are seductive, especially to engineers. Diagrams communicate a great deal in a small amount of space. But in the case of the GoF Structure Diagrams, the picture doesn't say enough. It is far more important to convey to readers that a Pattern has numerous Structures, and can be implemented in numerous ways.
엔지니어들에게 있어서 Diagram은 정말 뿌리치기 힘든 유혹이다. 하지만 Gof의 Structure diagram의 경우엔 충분히 많은 내용을 말해줄 수 없다. Pattern들이 다양한 Structure를 가질 수 있으며, 다양하게 구현될 수 있다는 것을 독자들에게 알려주기엔 턱없이 부족하다.
I routinely ask folks to add the word "SAMPLE" to each GoF Structure diagram in the Design Patterns book. In the future, I'd much prefer to see sketches of numerous structures for each Pattern, so readers can quickly understand that there isn't just one way to implement a Pattern. But if an author will take that step, I'd suggest going even further: loose the GoF style altogether and communicate via a pattern language, rich with diagrams, strong language, code and stories.
결론은~ 패턴을 구현하는데에 꼭 한가지 형태의 다이어그램과 한가지 형태의 구현이 있다는 것은 아니라는 이야기. GoF 에서의 다이어그램 또한 하나의 예라는 것을 강조.
- HeadFirstDesignPatterns . . . . 8 matches
Official Support Site : http://www.wickedlysmart.com
- I received the book yesterday and I started to read it on the way home... and I couldn't stop, took it to the gym and I expect people must have seen me smile a lot while I was exercising and reading. This is tres "cool". It is fun but they cover a lot of ground and in particular they are right to the point.
{{{Erich Gamma, IBM Distinguished Engineer, and coauthor of "Design Patterns: Elements of Reusable Object-Oriented Software" }}}
- I feel like a thousand pounds of books have just been lifted off my head.
{{{Ward Cunningham, inventor of the Wiki and founder of the Hillside Group}}}
- HelpOnLists . . . . 8 matches
levels of indent
And if you put asterisks at the start of the line
Variations of numbered lists:
* Uppercase roman (with start offset 42)
you can have multiple levels of indent
And if you put asterisks at the start of the line
Variations of numbered lists:
* Uppercase roman (with start offset 42)
- Java2MicroEdition . . . . 8 matches
[[TableOfContents]]
* J2ME는 Configuration과 Profile로 구성되어 있다. (아래 "Configuration과 Profile" 참고)
* Profile : Foundation Profile
* Profile : Mobile Information Device Profile (MIDP)
그림을 보면 맨 아래에 MID, 즉 휴대전화의 하드웨어 부분이 있고 그 위에는 Native System Software가 존재하며 그 상위에 CLDC가, 그리고 MIDP에 대한 부분이 나오는데 이 부분을 살펴보면, MIDP Application과 OEM-Specific Classes로 나뉘어 있는 것을 알 수 있다. 여기서의 OEM-Specific Classes라는 것은 말 그대로 OEM(Original Equipment Manufacturing) 주문자의 상표로 상품을 제공하는 것이다. 즉, 다른 휴대전화에서는 사용할 수 없고, 자신의(같은 통신 회사의) 휴대전화에서만 독립적으로 수행될 수 있도록 제작된 Java또는 Native로 작성된 API이다. 이는 자신의(같은 통신 회사의) 휴대전화의 특성을 잘 나타내거나 또는 MIDP에서 제공하지 않는 특성화된 클래스 들로 이루어져 있다. 지금까지 나와있는 많은 MIDP API들에도 이런 예는 많이 보이고 있으며, 우리나라의 SK Telecom에서 제공하는 SK-VM에도 이런 SPEC을 가지고 휴대전화의 특성에 맞는 기능, 예를 들어 진동 기능이나, SMS를 컨트롤하는 기능 들을 구현하고 있다. 그림에서 보듯이 CLDC는 MIDP와 OEM-Specific Classes의 기본이 되고 있다.
=== Configuration과 Profile ===
- NetworkDatabaseManagementSystem . . . . 8 matches
The network model is a database model conceived as flexible way of representing objects and their relationships. Its original inventor was Charles Bachman, and it was developed into a standard specification published in 1969 by the CODASYL Consortium. Where the hierarchical model structures data as a tree of records, with each record having one parent record and many children, the network model allows each record to have multiple parent and child records, forming a lattice structure.
The chief argument in favour of the network model, in comparison to the hierarchic model, was that it allowed a more natural modeling of relationships between entities. Although the model was widely implemented and used, it failed to become dominant for two main reasons. Firstly, IBM chose to stick to the hierarchical model in their established products such as IMS and DL/I. Secondly, it was eventually displaced by the relational model, which offered a higher-level, more declarative interface. Until the early 1980s the performance benefits of the low-level navigational interfaces offered by hierarchical and network databases were persuasive for many large-scale applications, but as hardware became faster, the extra productivity and flexibility of relational systems won the day.
- ThinkRon . . . . 8 matches
Let me tell a brief story about how that came about. Our president, at the time was Bob Doherty. Doherty came from General Electric via Yale, and had been one of the bright young men who were taken under the wing of the famous engineer Stiglitz. Every Saturday, Stiglitz would hold a session with these talented young men whom General Electric had recruited and who were trying to learn more advanced engineering theory and problem-solving techniques. Typically, Bob Doherty would sometimes get really stuck while working on a problem. On those occasions, he would walk down the hall, knock on Stiglitz’s door, talk to him — and by golly, after a few minutes or maybe a quarter of an hour, the problem would be solved.
One morning Doherty, on his way to Stiglitz’s office, said to himself, "Now what do we really talk about? What’s the nature of our conversation?" And his next thought was, "Well Stiglitz never says anything; he just asks me questions. And I don’t know the answer to the problem or I wouldn’t be down there; and yet after fifteen minutes I know the answer. So instead of continuing to Stiglitz’s office, he went to the nearest men’s room and sat down for a while and asked himself, "What questions would Stiglitz ask me about this?" And lo and behold, after ten minutes he had the answer to the problem and went down to Stiglitz’s office and proudly announced that he knew how to solve it.
- VonNeumannAirport/Leonardong . . . . 8 matches
거리를 계산하는 더 좋은 알고리즘이 있을까? 지금은 O(num of city^2).
def __init__(self, numofGates):
for i in range( numofGates ):
self.matrix.append([0]*numofGates)
def __init__(self, numofGates):
Matrix.__init__(self, numofGates)
def __init__(self, numofGates):
Matrix.__init__(self, numofGates)
- [Lovely]boy^_^/Diary/2-2-15 . . . . 8 matches
[[TableOfContents]]
* A data communication course ended. Professor told us good sayings. I feel a lot of things about his sayings.
* A merriage and family course ended too, Professor is so funny. A final test is 50 question - O/X and objective.
* A object programming course ended. Professor told us good sayings, similar to a data communication course's professor. At first, I didn't like him, but now it's not. I like him very much. He is a good man.
* sources for Unix system programming's final-test is so strange.--; mis-typings are so many. I am confused professor's intention.
* I worry about father's smoking... after my mom was hospitalization, he decreases amount of drinking, but increases amount of smoking.
- eXtensibleMarkupLanguage . . . . 8 matches
The Extensible Markup Language (XML) is a W3C-recommended general-purpose markup language for creating special-purpose markup languages, capable of describing many different kinds of data. In other words XML is a way of describing data and an XML file can contain the data too, as in a database. It is a simplified subset of Standard Generalized Markup Language (SGML). Its primary purpose is to facilitate the sharing of data across different systems, particularly systems connected via the Internet. Languages based on XML (for example, Geography Markup Language (GML), RDF/XML, RSS, Atom, MathML, XHTML, SVG, and MusicXML) are defined in a formal way, allowing programs to modify and validate documents in these languages without prior knowledge of their form.
= Type Of Parser =
* [http://xml.80port.net/bbs/view.php?id=xml&page=2&sn1=&divpage=1&sn=off&ss=on&sc=on&select_arrange=headnum&desc=asc&no=26 VC++에서 msxml 사용]
* [http://www.microsoft.com/downloads/details.aspx?FamilyID=993c0bcf-3bcf-4009-be21-27e85e1857b1&DisplayLang=en MSXML SDK DOWNLOADS]
- eXtensibleStylesheetLanguageTransformations . . . . 8 matches
Extensible Stylesheet Language Transformations, or XSLT, is an XML-based language used for the transformation of XML documents. The original document is not changed; rather, a new document is created based on the content of an existing one. The new document may be serialized (output) by the processor in standard XML syntax or in another format, such as HTML or plain text. XSLT is most often used to convert data between different XML schemas or to convert XML data into web pages or PDF documents.
XSLT was produced as a result of the Extensible Stylesheet Language (XSL) development effort within W3C during 1998–1999, which also produced XSL Formatting Objects (XSL-FO) and the XML Path Language, XPath. The editor of the first version (and in effect the chief designer of the language) was James Clark. The version most widely used today is XSLT 1.0, which was published as a Recommendation by the W3C on 16 November 1999. A greatly expanded version 2.0, under the editorship of Michael Kay, reached the status of a Candidate Recommendation from W3C on 3 November 2005.
- radiohead4us/SQLPractice . . . . 8 matches
1. Find the names of all branches in the loan relation. (4.2.1 The select Clause)
6. Find the names of all branches that have assets greater than at least one branch located in Brooklyn. (4.2.5 Tuple Variables)
7. Find the names of all customers whose street address includes the substring 'Main'. (4.2.6 String Operations)
9. Find the number of depositors for each branch. (4.4 Aggregate Functions)
14. Find the names of all branches that have assets greater than those of at least one branch located in Brooklyn. (4.6.2 Set Comparison)
18. Find all customers who have at most one account at the Perryridge branch. (4.6.4 Test for the Absence of Duplicate Tuples)
19. Find all customers who have at least two accounts at the Perryridge branch. (4.6.4 Test for the Absence of Duplicate Tuples)
- 데블스캠프2005/RUR-PLE/Harvest . . . . 8 matches
|| [[TableOfContents]] ||
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off
- 데블스캠프2005/RUR-PLE/Harvest/Refactoring . . . . 8 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
- 새싹교실/2012/AClass . . . . 8 matches
[[TableOfContents]]
* hint) Dp = (int**)malloc(sizeof(int*));
동적할당에 대해서도 배웠습니다.sizeof라는 함수를 사용하여 할당 할 크기를 정해주고 malloc을 사용하여 방을 만들어 줍니다.
p = (int *)malloc(SIZEOF(int)*n);}}}
node* head=(node*)malloc(sizeof(node));
tmp->next = (node*)malloc(sizeof(node));
struct node *head=(struct node*)malloc(sizeof(struct node));
tmp->next=(struct node*)malloc(sizeof(struct node));
node *head = (node *)malloc(sizeof(node));
tmp->next = (node *)malloc(sizeof(node));
- 알고리즘3주숙제 . . . . 8 matches
from [http://www.csc.liv.ac.uk/~ped/teachadmin/algor/d_and_c.html The university of liverpool of Computer Science Department]
Consider the following problem: one has a directory containing a set of names and a telephone number associated with each name.
The directory is sorted by alphabetical order of names. It contains n entries which are stored in 2 arrays:
A set of n points in the plane.
Square root of { (x(i)-x(j))^2 + (y(i)-y(j))^2 }
The (2n)-digit decimal representation of the product x*y = z
from [http://pages.cpsc.ucalgary.ca/~jacobs/Courses/cpsc413/W05/ University of Calgary Dept.CS]
- .bashrc . . . . 7 matches
set -o ignoreeof
# a so-called 'long options' mode , ie: 'ls --all' instead of 'ls -a'
# matches of that word
# get a list of processes (the first sed evaluation
# takes care of swapped out processes, the second
# takes care of getting the basename of the process)
- DirectDraw . . . . 7 matches
[[TableOfContents]]
DirectDraw객체의 생성 -> 표면의 생성(Front, Back, OffScreen) -> 그리고.. 표면 뒤집기..
ZeroMemory(&ddsd, sizeof(ddsd));
ddsd.dwSize = sizeof(ddsd); // 크기를 저장
ZeroMemory(&ddscaps, sizeof(ddscaps)); // 메모리 초가화
=== DirectDraw OffScreen의 생성 ===
LPDIRECTDRAWSURFACE7 lpDDSOff;
ZeroMemory(&ddsd, sizeof(ddsd));
ddsd.dwSize = sizeof(ddsd);
ddsd.ddsCaps.dwCaps = DDSCAPS_OFFSCREENPLAIN; // 오프스크린임을 표시
hr = lpDD->CreateSurface(&ddsd, &lpDDSOff, NULL); // 표면 생성!
GetObject(hb, sizeof(bmp), &bmp);
ddsd.dwSize = sizeof(ddsd);
- EnglishSpeaking/2011년스터디 . . . . 7 matches
[[TableOfContents]]
* There are four members in my family: my father, mother, and a younger brother. Well, actually there are five including our dog. My father was a military officer for twenty years. He recently retired from service and now works in a weaponry company. My mother is a typical housewife. She takes care of me and my brother and keeps our house running well. My brother is attending a university in the U.S.A. He just entered the university as a freshman and is adjusting to the environment. I miss the memory of fighting over things with him. The last member of my family is my dog named Joy. She is a Maltese terrier and my mother named her Joy to bring joy into our family. That's about it for the introduction of my family members.
* [김수경] - 이번주 영상은 문장이 단어 조금 바꾸면 여기저기 가져다 쓸만한 것이 많아 재미있었어요. 가위바위보로 역할을 분담했는데 ''Along with the ego and the superego, one of three components of the psyche.''라는 문장을 외워보고 싶어서 리사를 선택했습니다. 그런데 리사 분량이 제일 적어서 본의아니게(?) 가장 날로먹었네요 ㅋㅋ
- Gof/Visitor . . . . 7 matches
[[TableOfContents]]
- declares a Visit operations for each class of ConcreteElement in the object structure. The operation's name and signature identifies the class that sends the Visit request to the visitor. That lets the visitor determine the concrete class of the element being visited. Then the visitor can access the element directly through its particular interface.
- implements each operation declared by Visitor. Each operation implements a fragment of the algorithm defined for the corresponding class of object in the structure. ConcreteVisitor provides the context for the algorithm and stores its local state. This state often accumulates result during the traversal of the structure.
// and so on for other concrete subclasses of Equipment
- NeoCoin/Server . . . . 7 matches
/etc/profile : 모든 사용자 적용 스크립트
dd if=/dev/cdrom of=cd.iso
mkisofs -rT -V <volume> -P <만든이> -o <출력 파일명> <이미지만들 디렉>
아래 쉘 함수를 .bash_profile 등에 등록하여 실행되도록 한다.
dd if=/dev/zero of=/swapfile bs=1024 count=10240
swapon swapfile <-> swapoff swapfile
lsof -Pan -itcp -iudp
- 새싹교실/2012/AClass/4회차 . . . . 7 matches
hint) Dp = (int**)malloc(sizeof(int*));
hint) Dp = (int**)malloc(sizeof(int*));
p1=(int**)malloc(sizeof(int*)*3);
p2=(int**)malloc(sizeof(int*)*3);
p1[i]=(int*)malloc(sizeof(int*)*3);
p2[i]=(int*)malloc(sizeof(int*)*3);
NODE*NewNode = (NODE*)malloc(sizeof(NODE));
- 이영호/My라이브러리 . . . . 7 matches
setsockopt(*sockfd, SOL_SOCKET, SO_REUSEADDR, &option, sizeof(option));
memset((struct sockaddr *)ina, 0, sizeof(struct sockaddr));
if(bind(*sockfd, (struct sockaddr *)ina, sizeof(struct sockaddr)) == -1)
setsockopt(*sockfd, SOL_SOCKET, SO_REUSEADDR, &option, sizeof(option));
memset((struct sockaddr *)ina, 0, sizeof(struct sockaddr));
if(bind(*sockfd, (struct sockaddr *)ina, sizeof(struct sockaddr)) == -1)
if(setsockopt(*sockfd, SOL_SOCKET, SO_REUSEADDR, &option, sizeof(option)) == -1)
- 정모/2011.4.4/CodeRace . . . . 7 matches
public void getOff(){
public void ThrowRook(ProfessorR r, Child c) {
public void crossRiver(ProfessorR r) {
public class ProfessorR {
public ProfessorR() {
System.out.println("Professor loc : " + str);
ProfessorR test = new ProfessorR();
- 호너의법칙/조현태 . . . . 7 matches
int number_of_sum=0;
int number_of_multiply=0;
const int SIZE_OF_LINE=5;
const int SIZE_OF_BLOCK=4;
ofstream outputFile("aswer.txt");
char write_temp[SIZE_OF_LINE][8+INPUT_MAX*SIZE_OF_BLOCK];
write_temp[1][i*SIZE_OF_BLOCK+8]=write_temp[1][i*SIZE_OF_BLOCK+10]=write_temp[3][i*SIZE_OF_BLOCK+8]=write_temp[3][i*4+10]=' ';
write_temp[1][i*SIZE_OF_BLOCK+8]=i/10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+9]=i%10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+8]=input[i]/10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+9]=input[i]%10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+11]=write_temp[3][i*SIZE_OF_BLOCK+11]='|';
for (register int i=0; i<SIZE_OF_LINE; ++i){
outputFile << "# Horner ADD Count ----> "<< number_of_sum << "\n";
outputFile << "# Horner Multiply Count ----> "<< number_of_multiply << "\n";
++number_of_multiply;
++number_of_sum;
- ApplicationProgrammingInterface . . . . 6 matches
{{|[[TableOfContents]]|}}
{{|An application programming interface (API) is a set of definitions of the ways one piece of computer software communicates with another. It is a method of achieving abstraction, usually (but not necessarily) between lower-level and higher-level software.|}}
- Class/2006Fall . . . . 6 matches
[[TableOfContents]]
* 1st presentation of project is on 28 Sep. - 초기 진행 상황 및 향후 계획
* 2nd presentation of project is on 12 Oct. - 검색 (설계 및 구현)
* 3rd presentation of project is on 31 Oct. - 변경 (설계 및 구현)
* 4th presentation of project is on 14 Nov. - API, 성능평가
* Write answer to one of question in Q&A chapter 6.
* Write answer that consist five or six sentenses to one of question in Q&A chapter 7.
* Offline meeting at 11 a.m. on 10 Nov.
- GDBUsage . . . . 6 matches
[[TableOfContents]]
The GNU Debugger, usually called just GDB, is the standard debugger for the GNU software system. It is a portable debugger that runs on many Unix-like systems and works for many programming languages, including C, C++, and FORTRAN.
Copyright 2005 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you are
welcome to change it and/or distribute copies of it under certain conditions.
FUNCTION, to edit at the beginning of that function,
Execute the rest of the line as a shell command.
- Linux . . . . 6 matches
[[TableOfContents]]
professional like gnu) for 386(486) AT clones. This has been brewing
(same physical layout of the file-system (due to practical reasons)
PS. Yes - it's free of any minix code, and it has a multi-threaded fs.
[http://www.zeropage.org/pub/Linux/Microsoftware_Linux_Command.pdf 마이크로소프트웨어_고급_리눅스_명령와_중요_시스템_관리]
[http://translate.google.com/translate?hl=ko&sl=en&u=http://www.softpanorama.org/People/Torvalds/index.shtml&prev=/search%3Fq%3Dhttp://www.softpanorama.org/People/Torvalds/index.shtml%26hl%3Dko%26lr%3D 리눅스의 개발자 LinusTorvalds의 소개, 인터뷰기사등]
- OOP . . . . 6 matches
[[TableOfContents]]
Object-oriented programming is based in the principle of recursive design.
2. Objects perform computation by making requests of each other through the passing of messages.
3. Every object has it's own memory, which consists of other objects.
4. Every object is an instance of a class. A class groups similar objects.
Program consists of objects interacting with eachother Objects provide services.
- PreviousFrontPage . . . . 6 matches
A WikiWikiWeb is a collaborative hypertext environment, with an emphasis on easy access to and modification of information. This wiki is also part of the InterWiki space.
You are encouraged to add to the MoinMoinIdeas page, and edit the WikiSandBox whichever way you like. Please try to restrain yourself from adding unrelated stuff, as I want to keep this clean and part of the project documentation.
/!\ Please see Wiki:WikiForumsCategorized for a list of wikis by topic.
You can edit any page by pressing the link at the bottom of the page. Capitalized words joined together form a WikiName, which hyperlinks to another page. The highlighted title searches for all pages that link to the current page. Pages which do not yet exist are linked with a question mark: just follow the link and you can add a definition.
* MoinMoinTodo: discussion about the improvement of MoinMoin
- Refactoring/ComposingMethods . . . . 6 matches
[[TableOfContents]]
* You have a code fragment that can be grouped together.[[BR]]''Turn the fragment into a method whose name explains the purpose of the method.''
* A method's body is just as clear as its name. [[BR]] ''Put the method's body into the body of its callers and remove the method.''
return _numberOfLateDeliveries > 5;
return (_numberOfLateDeliveries>5)?2:1;
* You have a temp that is assigned to once twith a simple expression, and the temp is getting in the way of other refactorings. [[BR]] ''Replace all references to that temp with the expression.''
* You have a complicated expression. [[BR]] ''Put the result of the expression, or parts of the expression,in a temporary variagle with a name that explains the purpose.''
if ( (platform.toUpperCase().indexOf("MAC") > -1) &&
(browser.toUpperCase().indexOf("IE") > -1) &&
final boolean isMacOs = platform.toUpperCase().indexOf("MAX") > -1;
final boolean isIEBrowser = browser.toUpperCase().indexOf("IE") > -1);
* You want to replace an altorithm with one that is clearer. [[BR]] ''Replace the body of the method with the new altorithm.''
- TAOCP/BasicConcepts . . . . 6 matches
[[TableOfContents]]
== 1.3.1. Description of MIX ==
* Words( Partitial fieslds of words포함)
Overfolw toggle - on, off
F - 명령어의 변경(a modification of the operation code). (L:R)이라면 8L+R = F
MIX 프로그램의 예제를 보여준다. 중요한 순열의 성질(properties of permutations)을 소개한다.
=== Products of permutations ===
- 개인키,공개키/류주영,문보창 . . . . 6 matches
ofstream fout("source_enc.txt"); // fout과 output.txt를 연결
while(!fin.eof())
if(fin.eof())
ofstream fout("source_enc2.txt"); // fout과 output.txt를 연결
while(!fin.eof())
if(fin.eof())
- 몸짱프로젝트/CrossReference . . . . 6 matches
|| [[TableOfContents]] ||
while(!fin.eof())
int num_of_node = 0;
while(!fin.eof()){
//ofstream fout("result.txt", ios::app); // result.txt 라는 파일에 출력하는 경우
num_of_node++;
<< "TOTAL" << "\t\t" << num_of_node++ << endl;
- 알고리즘2주숙제 . . . . 6 matches
1. (Warm up) An eccentric collector of 2 x n domino tilings pays $4 for each vertical domino and $1 for each horizontal domino. How many tiling are worth exactly $m by this criterion? For example, when m = 6 there are three solutions.
6. Let a<sub>r</sub> be the number of ways to select r balls from 3 red balls, 2 green balls, and 5 white balls.
7. Let a<sub>r</sub> be the number of ways r cents worth of postage can be placed on a letter using only 5c, 12c, and 25c stamps. The positions of the stamps on the letter do not matter.
8. Let a<sub>r</sub> be the number of ways to pay for an item costing r cents with pennies, nickels, and dimes.
- 영어단어끝말잇기 . . . . 6 matches
*N.a finish point of something.
*N.a point of intersection
* (in stories) a creature like a small man with white hair and a pointed hat who lives under the ground and guards gold and precious things: (informal) the gnomes of Zurich (= Swiss bankers who control foreign money)
* a plastic or stone figure of a gnome, used as a garden ornament
*A.fresh, a opposite of old
*N.a kind of underwear brand
- C++ . . . . 5 matches
{{|[[TableOfContents]]|}}
C++ (pronounced "see plus plus") is a general-purpose computer programming language. It is a statically typed free-form multi-paradigm language supporting procedural programming, data abstraction, object-oriented programming, and generic programming. During the 1990s, C++ became one of the most popular commercial programming languages.
Bell Labs' Bjarne Stroustrup developed C++ (originally named "C with Classes") during the 1980s as an enhancement to the C programming language. Enhancements started with the addition of classes, followed by, among many features, virtual functions, operator overloading, multiple inheritance, templates, and exception handling. The C++ programming language standard was ratified in 1998 as ISO/IEC 14882:1998, the current version of which is the 2003 version, ISO/IEC 14882:2003. New version of the standard (known informally as C++0x) is being developed.
In C and C++, the expression x++ increases the value of x by 1 (called incrementing). The name "C++" is a play on this, suggesting an incremental improvement upon C.|}}
- CodeConvention . . . . 5 matches
* [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dnvsgen/html/hunganotat.asp Hungarian Notation] : MFC, VisualBasic
* [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/cpgenref/html/cpconnetframeworkdesignguidelines.asp?frame=true .Net Frameworks Design Guidelines] : C#, VisualBasic.Net
* [http://msdn.microsoft.com/library/techart/cfr.htm Coding Technique and Programming Practices]
* 1980년대 charles simonyi 논문 Meta-programming : A Software Prodution Method
* http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dnvsgen/html/hunganotat.asp
- ComputerNetworkClass/Report2006/PacketAnalyzer . . . . 5 matches
[[TableOfContents]]
자세한 사항은 MSDN 혹은 Network Programming For Microsoft Windows 를 참조하기 바란다.
if (bind(s, (SOCKADDR *)&if0, sizeof(if0)) == SOCKET_ERROR)
if (WSAIoctl(s, SIO_RCVALL, &optval, sizeof(optval),
__intn 1, 2, 4, or 8 bytes depending on the value of n. __intn is Microsoft-specific.
- DocumentObjectModel . . . . 5 matches
{{| [[TableOfContents]] |}}
Different variants of DOMs were initially implemented by web browsers to manipulate elements in an HTML document. This prompted the World Wide Web Consortium (W3C) to come up with a series of standard specifications for DOM (hence called W3CDOM).
Most XML parsers (e.g., Xerces) and XSL processors (e.g., Xalan) have been developed to make use of the tree structure. Such an implementation requires that the entire content of a document be parsed and stored in memory. Hence, DOM is best used for applications where the document elements have to be randomly accessed and manipulated. For XML-based applications which involve a one-time selective read/write per parse, DOM presents a considerable overhead on memory. The SAX model is advantageous in such a case in terms of speed and memory consumption.
- HelpOnXmlPages . . . . 5 matches
If you have Python4Suite installed in your system, it is possible to save XML documents as pages. It's important to start those pages with an XML declaration "{{{<?xml ...>}}}" in the very first line. Also, you have to specify the stylesheet that is to be used to process the XML document to HTML. This is done using a [http://www.w3.org/TR/xml-stylesheet/ standard "xml-stylesheet" processing instruction], with the name of a page containing the stylesheet as the "{{{href}}}" parameter.
/!\ MoniWiki support two type of XSLT processors. One is the xslt.php, the other is xsltproc.php. xslt.php need a xslt module for PHP and xsltproc.php need the xsltproc.
<xsl:value-of select="system-property('xsl:vendor')"/>
(<a href="{system-property('xsl:vendor-url')}"><xsl:value-of select="system-property('xsl:vendor-url')"/></a>)
implementing XSLT v<xsl:value-of select="system-property('xsl:version')"/>
- InterWikiIcons . . . . 5 matches
The InterWiki Icon is the cute, little picture that appears in front of a link instead of the prefix established by InterWiki. An icon exists for some, but not all InterMap references.
You can set InterWikiIcon to InterMap entries by putting an icon file of name lowercased InterWiki entry name, e.g; meatball for MeatBall, under imgs directory.
* Acronym:BoF
* JoiWiki:SocialSoftware
Any recommendations on what software to use to shrink an image to appropriate size?
- MoreEffectiveC++/Exception . . . . 5 matches
||[[TableOfContents]]||
double sqrtOfi = sqrt(i);
마지막으로 인자 넘기기와 예외 전달(던지기:throw)의 다른 점은 catch 구문은 항상 ''catch가 쓰여진 순서대로 (in the order of their appearance)'' 구동된다는 점이다. (영어 구문을 참조하시길) 말이 이상하다. 그냥 다음 예제를 보자
Catch-by-value는 표준 예외 객체들 상에에서 예외 객체의 삭제 문제에 관해서 고민할 필요가 없다. 하지만 예외가 전달될때 '''두번의''' 복사가 이루어 진다는게 문제다. (Item 12참고) 게다가 값으로의 전달은 ''slicing problem''이라는 문제를 발생시킨다. 이게 뭐냐 하면, 만약 표준 예외 객체에서 유도(상속)해서 만들어진 예외 객체들이 해당 객체의 부모로 던저 진다면, 부모 파트 부분만 값으로 두번째 복사시에 복사되어서 전달되어 버린다는 문제다. 즉 잘라버리는 문제 "slice off" 라는 표현이 들어 갈만 하겠지. 그들의 data member는 아마 부족함이 생겨 버릴 것이고 해당 객체상에서 가상 함수를 부를때 역시 문제가 발생해 버릴 것이다. 아마 무조건 부모 객체의 가상 함수를 부르게 될 것이다.(이 같은 문제는 함수에 객체를 값으로 넘길때도 똑같이 제기 된다.) 예를 들어서 다음을 생각해 보자
== Item 15: Understand the costs of exception handling ==
물론 저것은 이론이다. 실질적으로 예외 지원 밴더들은 당신이 예외 작성을 위한 코드의 첨가를 당신이 예외를 지원하느냐 마느냐에 따라 조정할수 있도록 만들어 놓았다.(작성자주:즉 예외 관련 처리의 on, off가 가능하다.) 만약 당신이 당신의 프로그램의 어떠한 영역과, 연계되는 모든 라이브러리에서 try, throw, catch를 빼고 예외 지원 사항을 빼고 당신 스스로 속도, 크기 같은 예외처리시 발생하는 단점을 제거할수 있을 것이다. 시감이 지나 감에 따라 라이브러리에 차용되는 예외의 처리는 점점 늘어나게 되고, 예외를 제거하는 프로그래밍은 갈수록 내구성이 약해 질것이다. 하지만, 예외처리를 배제한 컴파일을 지원하는 현재의 C++ 소프트웨어 개발상의 상태는 확실히 예외처리 보다 성능에서 우위를 점한다. 그리고 그것은 또한 예외 전달(propagate) 처리와, 예외를 생각하지 않은 라이브러리들의 사용에 무리없는 선택이 될것이다.
문제의 초점은 예외가 던지는 비용이다. 사실 예외는 희귀한 것이라 보기 때문에 그렇게 크게 감안할 내용이 아니다. 그들이 ''예외적인''(exceptional) 문제의(event) 발생을 지칭함에도 불구하고 말이다. 80-20 규칙은(Item 16에서 언급) 우리에게 그런 이벤트들은 거의 프로그램의 부과되는 성능에 커다란 영향을 미치지 않을 것이라고 말한다. 그럼에도 불구하고, 나는 당신이 이 문제에 관하여 예외를 던지고, 받는 비용에 관한 대답에서 얼마나 클까를 궁금할것이라고 생각한다. 대강 일반적인 함수의 반환에서 예외를 던진다면 대충 '''세개의 명령어 정도 더 느려지는'''(three order of magnitude) 것이라고 가정할수 있다. 하지만 당신은 그것만이 아닐것이라고 이야기 할것이다. 반대로 당신이 이런 논쟁을 데이터 구조나 루프의 순회 구조를 효율적으로 만드는데 신경을 쓴다면 더 좋은 시간을 보내는 것이라고 생각한다.
- MoreEffectiveC++/Techniques1of3 . . . . 5 matches
||[[TableOfContents]]||
== Item 26: Limiting the number of objects of a class ==
// 그리고 이것은 out-of-memory 예외를 잡을수 있다.
class HeapTracked { // mixin class; keeps track of
=== Construction, Assignment and Destruction of Smart Pointers : 스마트 포인터의 생성, 할당, 파괴 ===
- OperatingSystemClass/Exam2002_2 . . . . 5 matches
* If we add associative registers and 75 percent of all page-table references are found in the associative regsters, what is the effective memory time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there)
6. Consider a file currently consisting of 100 blocks. Assume that the file control block(and the index block, in the case of indexed allocation) is already in memory, Calculate how many disk I/O operations are required for contiguous, linked and indexed (single-level) allocation strategies, if for one block, the following conditions hold. In the contiguous allocation case, assume that there is no room to grow in the beginning, but there is room to grow in the end. Assume that the block information to be added in stored in memory.
7. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous requrest was at cylinder 125. The queue of pending requests, in FIFO order, is
Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requrests, for each of the following disk scheduling algorithms?
- OurMajorLangIsCAndCPlusPlus/XML/김상섭허준수 . . . . 5 matches
tree_pointer node = (tree_pointer)malloc(sizeof(treeNode));
list_pointer link_node = (list_pointer)malloc(sizeof(listNode));
temp2 = (list_pointer)malloc(sizeof(listNode));
stack_pointer sta = (stack_pointer)malloc(sizeof(stack));
list_pointer list = (list_pointer)malloc(sizeof(listNode));
- Profiling . . . . 5 matches
'''Profiling'''(프로파일링)은 원하는 부분의 프로그램 성능을 측정하는 성능 테스트이다.
[[TableOfContents]]
'''Profiling'''(프로파일링)은 원하는 부분의 프로그램 성능을 측정하는 성능 테스트이다.
== Profiling 의 방법 ==
|| C/C++ || [C++Profiling] ||
|| [Java] ||JavaProfiling ||
- ProjectPrometheus/CollaborativeFiltering . . . . 5 matches
*userPref is a set of book preferences of a user.
*bookPref is a set of book preferences of a book. (similar concept to "also bought")
*When a user does a specific well-defined action, bookPref is updated as "prefCoef*userPref+bookPref" and resorted. (some books at the end of the list might be eliminated for performance reasons)
- STLErrorDecryptor . . . . 5 matches
{{| [[TableOfContents]] |}}
이러한 현상은 이펙티브 STL의 항목 49에서도 다루어진 이야기입니다. 원저자는 "많이 읽어서 익숙해져라"라는 결론을 내리고 있지만, 이 문제를 도구적으로 해결한 방법도 있다는 언급도 하고 있었죠. 여기서 이야기하는 [http://www.bdsoft.com/tools/stlfilt.html STL 에러 해독기](이하 해독기)가 바로 그것입니다. 이 도구는 VC 컴파일러가 출력하는 에러 메시지를 가로채어 STL에 관련된 부분을 적절하게 필터링해 줍니다.
* STL 에러 해독기 패키지 (Win32용) : STLfilt.zip이란 이름을 가지고 있습니다 (http://ww.bdsoft.com/tools/stlfilt.html)
가) Visual C++가 설치된 디렉토리로 이동하고, 여기서 \bin 디렉토리까지 찾아 들어갑니다. (제 경우에는 D:\Program Files2\Microsoft Visual Studio .NET\Vc7\bin입니다.) 제대로 갔으면, 원래의 CL을 백업용으로 모셔다 놓을 폴더를 하나 만듭니다. (제 경우에는 '''native_cl'''이란 이름으로 만들었습니다.) 그리고 나서 CL.EXE를 그 폴더에 복사해 둡니다.
****** {BD Software Proxy CL v2.26} STL Message Decryption is Off ******
****** {BD Software Proxy CL v2.26} STL Message Decryption is ON! ******
- ShellSort . . . . 5 matches
Duke of Earl
Duke of Earl
Duke of Earl
Duke of Earl
Duke of Earl
- SmallTalk/강좌FromHitel/강의2 . . . . 5 matches
February 1995. With a bit of luck the answer will be 7."
(Sound fromFile: 'xxxxx.wav') woofAndWait; woofAndWait.
(Sound fromFile: 'C:\Windows\Media\Ding.wav') woofAndWait; woofAndWait.
- Trac . . . . 5 matches
{{| [[TableOfContents]] |}}
Trac is an enhanced wiki and issue tracking system for software development projects. Trac uses a minimalistic approach to web-based software project management. Our mission; to help developers write great software while staying out of the way. Trac should impose as little as possible on a team's established development process and policies.
Trac allows wiki markup in issue descriptions and commit messages, creating links and seamless references between bugs, tasks, changesets, files and wiki pages. A timeline shows all project events in order, making getting an overview of the project and tracking progress very easy.
- 권영기/web crawler . . . . 5 matches
[[tableofcontents]]
say = "This is a line of text"
part == ['This', 'is', 'a', 'line', 'of', 'text']
2. Eclipse에서, Help > Install New Software > Add > PyDev, Http://pydev.org/updates
* http://www.crummy.com/software/BeautifulSoup/ - 웹분석 라이브러리 BeautifulSoup 이용해보기
- 김재현 . . . . 5 matches
printf(" a %d\n", sizeof(a));
printf(" a[1] %d\n", sizeof(a[1]));
printf(" b %d\n", sizeof(b));
printf(" *b %d\n", sizeof(*b));
printf(" *(b+1) %d\n", sizeof(*(b+1)));
- 데블스캠프2011/셋째날/RUR-PLE/송지원 . . . . 5 matches
for number of range (4) :
else : turn_off()
else : turn_off()
turn_off()
turn_off()
- 문자반대출력/조현태 . . . . 5 matches
int max_size_of_stack;
data_p=(char*)malloc(data_size*sizeof(char));
max_size_of_stack=data_size;
if (where_is_save != max_size_of_stack)
ofstream outputFile("result.txt");
- 비행기게임/BasisSource . . . . 5 matches
patientOfInducement = 50
speedIncreaseRateOfY = 0.1
if self.rect.centery<(self.playerPosY-self.patientOfInducement):
self.speedy+=self.speedIncreaseRateOfY
elif self.rect.centery>(self.playerPosY+self.patientOfInducement):
self.speedy-=self.speedIncreaseRateOfY
class SuperClassOfEachClass(pygame.sprite.Sprite):
class Item(pygame.sprite.Sprite, SuperClassOfEachClass):
class Enemy(pygame.sprite.Sprite, SuperClassOfEachClass):
#Default gauage of Enemys
life = 1
def __init__(self, life, imageMax, playerPosY):
self.life = life
defaultLife = 10;
self.lifes = self.defaultLife
self.lifes = self.lifes- 1
if self.lifes <0:
class Building(pygame.sprite.Sprite,SuperClassOfEachClass):
def DynamicEnemyAssign(enemyList, countOfEnemy, Enemy, life, imageMax, enemy_containers, Enemy_img, pathAndKinds, line, playerPosY):
enemyList[countOfEnemy] = Enemy(life,imageMax, playerPosY)
- 새싹교실/2012/개차반 . . . . 5 matches
[[TableOfContents]]
* real part of program
* It has start and end point of a program.
* Integer type: int(4 bytes), char(1 byte, be often used to express a character)
* Maximum, minimum value of int(경우의 수 이용)
* Example Problem: Write a program that converts meter-type height into [feet(integer),inch(float)]-type height. Your program should get one float typed height value as an input and prints integer typed feet value and the rest of the height is represented as inch type. (1m=3.2808ft=39.37inch) (출처: 손봉수 교수님 ppt)
- 수학의정석/집합의연산/조현태 . . . . 5 matches
int *numbers=(int*)malloc(sizeof(int)*(*number_gaesu));
int *temp_where=(int*)malloc(sizeof(int)*gaesu);
int gaesu_of_one=0;
++gaesu_of_one;
for (register int k=j+1; k<j+2+gaesu_of_one; ++k )
- 알고리즘8주숙제 . . . . 5 matches
Given the denominations of coins for a newly founded country, the Dairy Republic, and some monetary amount, find the smallest set of coins that sums to that amount. The Dairy Republic is guaranteed to have a 1 cent coin.
Give a greedy method to find an optimal solution of the knapsack problem and prove its correctness.
Consider the problem of scheduling n jobs on one machine. Describe an algorithm to find a schedule such that its average completion time is minimum. Prove the correctness of your algorithm.
- 오페라의유령 . . . . 5 matches
소설이 먼저였지만, 개인적으로 Webber 와 Sarah 의 노래를 엄청나게 좋아하는 관계로. 소설을 읽는 내내 머릿속에서 Think of Me, The Music of Night, Wishing you were somehow here again 가 배경음악으로 깔리었다.
웨버아저씨에게 상상력을 선사해준 소설이란? 원작에 상관없이 자신스타일로 작품을 만들어내는 웨버아저씨여서 (그래봤자 본건 하나뿐이지만; 한편은 대본읽음). 개인적인 결론은 해당 소설로부터 자신의 주제의식을 뽑아낸 웨버아저씨 멋져요 이긴 하지만, 이 소설이 태어나지 않았더라면 Phantom of the opera 가 나타나지 않았을 것이란 생각이 들기에. (소설의 구성 등을 떠나서, Phantom 이라는 캐릭터를 볼때)
* 암튼 Phantom of the opera 에서 가장 멋진 목소리는 Phantom 이라 생각. 그리고 당근 Sarah 아주머니; Phantom 이라는 캐릭터 이미지가 맘에 들어서. 그리고 노래도.
* 소설에서의 Angle of the music 은 Phantom 을 이야기하는것 같은데, 왜 Webber 의 노래에선 크리스틴을 지칭할까.
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 4 matches
[[TableOfContents]]
==== Solution of Problem C. Mine Sweeper ====
==== Solution of Problem F. Coin Game ====
[http://acm.kaist.ac.kr/Problems/2004of.pdf Original Problem Text]
==== Solution of Problem G. Safe ====
- AcceleratedC++/Chapter8 . . . . 4 matches
|| [[TableOfContents]] ||
throw domain_error("median of an empty vector");
* 두번째 인자로 하나가 지난 값을 갖도록함으로써 자연스럽게 out-of-range의 상황을 파악하는 것이 가능하다.
//istream_iterator<int> 는 end-of-file, 에러상태를 가리킨다.
// find end of next word
- ActiveTemplateLibrary . . . . 4 matches
{{|The Active Template Library (ATL) is a set of template-based C++ classes that simplify the programming of Component Object Model (COM) objects. The COM support in Visual C++ allows developers to easily create a variety of COM objects, Automation servers, and ActiveX controls.
* [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vclib/html/_atl_string_conversion_macros.asp ATL and MFC String Conversion Macros]
- Ajax . . . . 4 matches
{{|[[TableOfContents]]|}}
Ajax or Asynchronous JavaScript and XML is a term describing a web development technique for creating interactive web applications using a combination of:
Like DHTML, LAMP, or SPA, Ajax is not a technology in itself, but a term that refers to the use of a group of technologies together. In fact, derivative/composite technologies based substantially upon Ajax, such as AFLAX are already appearing.
Ajax applications use web browsers that support the above technologies as a platform to run on. Browsers that support these technologies include Mozilla Firefox, Microsoft Internet Explorer, Opera, Konqueror and Apple Safari.
- Atom . . . . 4 matches
{{| [[TableOfContents]] |}}
Atom is an XML-based document format and HTTP-based protocol designed for the syndication of Web content such as weblogs and news headlines to Web sites as well as directly to user agents. It is based on experience gained in using the various versions of RSS. Atom was briefly known as "Pie" and then "Echo".
Before the Atom work entered the IETF process, the group produced "Atom 0.3", which has support from a fairly wide variety of syndication tools both on the publishing and consuming side. In particular, it is generated by several Google-related services, namely Blogger and Gmail.
As well as syndication format, the Atom Project is producing the "Atom Publishing Protocol", with a similar aim of improving upon and standarizing existing publishing mechanisms, such as the Blogger API and LiveJournal XML-RPC Client/Server Protocol.
- Boost/SmartPointer . . . . 4 matches
// use, modify, sell and distribute this software is granted provided this
// copyright notice appears in all copies. This software is provided "as is"
// The application will produce a series of
// objects of type Foo which later must be
- BoostLibrary/SmartPointer . . . . 4 matches
// use, modify, sell and distribute this software is granted provided this
// copyright notice appears in all copies. This software is provided "as is"
// The application will produce a series of
// objects of type Foo which later must be
- CeeThreadProgramming . . . . 4 matches
//http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vclib/html/_crt__beginthread.2c_._beginthreadex.asp
//http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dllproc/base/overlapped_str.asp
/* Create independent threads each of which will execute function */
/* wait we run the risk of executing an exit which will terminate */
- Chapter II - Real-Time Systems Concepts . . . . 4 matches
[[TableOfContents]]
Soft / Hard 가 그 두가지 예라고 할 수 있다. Soft Real Time 이란 말은 Task 의 수행이 가능하면 보다 빠르게 진행 될 수 있게 만들어진시스템을 말한다.
=== Critical Section of Code ===
대부분의 리얼타임에서는 SOFT/HARD 리얼타임의 적절한 조합으로 쓰여진다.[[BR]]
SOFT에서는 가능한 보다 빠른 실행을 중시하며 특정시간에 꼭 작업을 마칠 이유는 없다. 반에
=== Advantages and Disadvantages of Real-Time Kernels ===
- CleanCode . . . . 4 matches
* [http://www.amazon.com/Clean-Code-Handbook-Software-Craftsmanship/dp/0132350882 CleanCode book]
* 도서 : [http://www.amazon.com/Clean-Code-Handbook-Software-Craftsmanship/dp/0132350882 Clean Code]
* Consider using try-catch-finally instead of if statement.
* [http://wiki.zeropage.org/wiki.php/Gof/AbstractFactory Factory Pattern]
- ClearType . . . . 4 matches
[[TableOfContents]]
Microsoft 에서 주도한 폰트 보정 기법의 하나로 기존의 안티얼라이징 기법과 최근에 나오고 있는 LCD Display 의 표현적 특성을 조합하여 폰트 이미지의 외관을 가히 극대화하여 표현하는 방식.
* [MicroSoft]에서 개발한 텍스트 벡터드로잉 방법.
* [http://www.microsoft.com/typography/ClearTypeInfo.mspx ClearType기술 홈페이지] - 윈도우 적용 방법이나 기술에대한 자세한 소개.
* [http://www.microsoft.com/typography/cleartype/tuner/Step1.aspx ClearType Tuner]라는 프로그램으로 세부적인 클리어타입 셋팅을 할 수 있다.
- Cracking/ReverseEngineering/개발자/Software/ . . . . 4 matches
Software 개발자가 알아야 하는 것은 Language, Algorithm만이 아니다. (이 것만 알면 Coder일 뿐이 잖는가?)
개발자가 만들어 놓은 Software는 다른 사람들에 의해(물론 이런 사람들은 어느정도 컴퓨터에 대한 지식이 있는 사람들) 파괴 되고 분석된다.
Jeffrey Richter의 Programming Applications for Microsoft Windows란 책을 추천한다. 현재 4th edition까지 나온 상태이다. 물론 한글판은 없다.
(윈도우즈 시스템 커널이 하는 일등을 배울 수 있으며 그것을 이용해 나쁘게 사용하든 좋게 사용하든 도움이 많이 되는 책이다. Windows에 Base를 둔 Software 개발자로서는 꼭 읽어야할 책.)
- DebuggingApplication . . . . 4 matches
[http://msdn.microsoft.com/library/FRE/vsdebug/html/_core_the_trace_macro.asp?frame=true]
[http://www.microsoft.com/msj/0197/exception/exception.aspx]
[http://support.microsoft.com/default.aspx?scid=kb;en-us;105675]
[http://msdn.microsoft.com/library/en-us/vsdebug/html/_core_using_c_run2dtime_library_debugging_support.asp?frame=true]
- DebuggingSeminar_2005/DebugCRT . . . . 4 matches
''_CRTDBG_ALLOC_MEM_DF 는 기본적으로 on, 기타 플래그는 디폴트 off이므로 bitwise 연산자를 이용해서 적절하게 플래그를 설정해야한다.''
flag &= !_CRTDBG_LEAK_CHECK_DF; // 플래그 off
참조) [http://zeropage.org/wiki/AcceleratedC_2b_2b_2fChapter11#line287 The rule of Three]
[http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vsdebug/html/_core_c_run2dtime_library_debugging_support.asp MSDN]
- EnglishSpeaking/2012년스터디 . . . . 4 matches
[[TableOfContents]]
@ Toz Kangnam 2nd office
* We listened audio file and read part of script by taking role.(And after reading script once, we also change our role and read script again.)
* 2nd time of ESS! Our English speaking ability is not growing visibly but that's OK. It's just 2nd time. But we need to study everyday for expanding our vocabulary and increasing our ability rapidly. Thus I'll memorize vocabulary and study with basic English application(It's an android application. I get it for FREE! YAY!) I wish I can speak English more fluent in our 20th study. XD
* Today, we were little confused by Yunji's appearance. We expected conversation between 2 persons but there were 3 persons who take part in episode 2. And we made a mistake about deviding part. Next time, when we get 3 persons' conversation again, we should pay attention to devide part equally. Or we can do line by line reading instead of role playing.
- EnglishSpeaking/TheSimpsons/S01E02 . . . . 4 matches
Homer : Hmm. How could anyone make a word out of these lousy letters?
Marge : I think it's under the short leg of the couch.
one of three components of the psyche."
- Hartals/조현태 . . . . 4 matches
days=(int*)malloc(sizeof(int)*stage);
mans=(int*)malloc(sizeof(int)*stage);
mans_days=(int**)malloc(sizeof(int*)*stage);
mans_days[i]=(int*)malloc(sizeof(int)*mans[i]);
- JavaNetworkProgramming . . . . 4 matches
[[TableOfContents]]
while((numberRead =System.in.read(buffer))>=0) //가능한 많은 양을 읽는다. EOF가 -1을 반환하면 출력한다.
while((numberRead = in.read(buffer)) >=0) //파일을 버퍼에 가능한 많은 양을 읽고 읽은 양만큼 파일에 쓴다. 파일이 EOF일 때까지.
private int offset,length,port;
offset = packet.getOffset();
return new DatagramPacket(data,offset,length,address,port);
if(object instanceof MyDatagramPacket)
- JollyJumpers/서지혜 . . . . 4 matches
if(feof(stdin)) break;
if(feof(stdin)) break;
if(feof(stdin)) break;
if(feof(stdin)) break;
- JollyJumpers/임인택 . . . . 4 matches
public int offCnt;
offCnt = 0;
++offCnt;
return (offCnt==array.length-1)?"Jolly":"NotJolly";
- MineFinder . . . . 4 matches
[[TableOfContents]]
=== Profiling ===
Profile: Function timing, sorted by time
Time outside of functions: 28.613 millisecond
Percent of time in module: 100.0%
- ModelViewPresenter . . . . 4 matches
어플리케이션을 이러한 방법으로 나누는 것은 좋은 SeparationOfConcerns 이 되며, 다양한 부분들을 재사용할 수 있도록 해준다.
Model-View-Presenter or MVP is a next generation programming model for the C++ and Java programming languages. MVP is based on a generalization of the classic MVC programming model of Smalltalk and provides a powerful yet easy to understand design methodology for a broad range of application and component development tasks. The framework-based implementation of these concepts adds great value to developer programs that employ MVP. MVP also is adaptable across multiple client/server and multi-tier application architectures. MVP will enable IBM to deliver a unified conceptual programming model across all its major object-oriented language environments.
- MoreEffectiveC++/Basic . . . . 4 matches
|| [[TableOfContents]] ||
오해의 소지가 있도록 글을 적어 놨군요. in, out 접두어를 이용해서 reference로 넘길 인자들에서는 in에 한하여 reference, out은 pointer로 new, delete로 동적으로 관리하는것을 의도한 말이었습니다. 전에 프로젝트에 이런식의 프로그래밍을 적용 시켰는데, 함수 내부에서 포인터로 사용하는 것보다 in에 해당하는 객체 사용 코딩이 편하더군요. 그리고 말씀하신대로, MEC++ 전반에 지역객체로 생성한 Refernece문제에 관한 언급이 있는데, 이것의 관리가 C++의 가장 큰 벽으로 작용하는 것이 아닐까 생각이 됩니다. OOP 적이려면 반환을 객체로 해야 하는데, 이를 포인터로 넘기는 것은 원칙적으로 객체를 넘긴다고 볼수 없고, 해제 문제가 발생하며, reference로 넘기면 말씀하신데로, 해당 scope가 벗어나면 언어상의 lifetime이 끝난 것이므로 영역에 대한 메모리 접근을 OS에서 막을지도 모릅니다. 단, inline에 한하여는 이야기가 달라집니다. (inline의 코드 교체가 compiler에 의하여 결정되므로 이것도 역시 모호해 집니다.) 아예 COM에서는 OOP에서 벗어 나더라도, 범용적으로 쓰일수 있도록 C스펙의 함수와 같이 in, out 의 접두어와 해당 접두어는 pointer로 하는 규칙을 세워놓았지요. 이 설계가 C#에서 buil-in type의 scalar형에 해당하는 것까지 반영된 것이 인상적이 었습니다.(MS가 초기 .net세미나에서 이 때문에 String 연산 차이가 10~20배 정도 난다고 광고하고 다녔었는데, 지금 생각해 보면 다 부질없는 이야기 같습니다.) -상민
'''*(array+ ( i *sizeof(an object in the array) )''' [[BR]]
for( int i = the number of elements in the array -1; i>0; --i)
* '''첫번째 문제는 해당 클래스를 이용하여 배열을 생성 할때이다. . ( The first is the creation of arrays )'''
void *rawMemory = operator new[](10*sizeof(EquipmentPiece));
- NUnit/C++예제 . . . . 4 matches
[[TableOfContents]]
평소대로 하자면 이렇게 하면 될것이다. 하지만 현재 프로젝트는 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmxspec/html/vcmanagedextensionsspec_16_2.asp Managed C++ Extensions]이다. 이것은 C++을 이용해서 .Net을 Platform위에서 프로그래밍을 하기 위하여 Microsoft에서 C++을 확장한 형태의 문법을 제안된 추가 문법을 정의해 놓았다. 이를 이용해야 NUnit이 C++ 코드에 접근할수 있다. 이경우 NUnit 에서 검증할 클래스에 접근하기 위해 다음과 같이 클래스 앞에 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmxspec/html/vcmanagedextensionsspec_16_2.asp __gc] 를 붙여서 선언해야 한다.
__gc의 가 부여하는 능력과 제약 사항에 대해서는 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmxspec/html/vcmanagedextensionsspec_4.asp __gc] 을 참고하자. NUnit 상에서 테스트의 대상 클래스는 무조건 포인터형으로 접근할수 있다. 이제 테스트 클래스의 내용을 보자.
- OperatingSystem . . . . 4 matches
[[TableOfContents]]
In computing, an operating system (OS) is the system software responsible for the direct control and management of hardware and basic system operations. Additionally, it provides a foundation upon which to run application software such as word processing programs and web browsers.
일종의, [[SeparationOfConcerns]]라고 볼 수 있다. 사용자는 OperatingSystem (조금 더 엄밀히 이야기하자면, [[Kernel]]) 이 어떻게 memory 와 I/O를 관리하는지에 대해서 신경쓸 필요가 없다. (프로그래머라면 이야기가 조금 다를 수도 있겠지만 :) )
* [[windows|MicrosoftWindows]]
- PythonForStatement . . . . 4 matches
These represent finite ordered sets indexed by non-negative numbers. The built-in function len() returns the number of items of a sequence. When the length of a sequence is n, the index set contains the numbers 0, 1, ..., n-1. Item i of sequence a is selected by a[i].
- SeminarHowToProgramIt . . . . 4 matches
* ["CrcCard"] (Index Card -- The finalist of Jolt Award for "design tools" along with Rational Rose Enterprise Edition)
* Lifelong Learning as a Programmer -- Teach Yourself Programming in Ten Years (http://www.norvig.com/21-days.html )
||Programmer's Journal, Lifelong Learning & What to Read||2 ||
이 때, OOP가 가능한 언어를 추천하고, 해당 언어의 xUnit 사용법을 미리 익혀오기 바랍니다. (반나절 정도가 필요할 겁니다) http://www.xprogramming.com/software.htm 에서 다운 받을 수 있습니다.
- TkinterProgramming/Calculator2 . . . . 4 matches
'store' : self.doThis, 'off' : self.turnoff,
def turnoff(self, *args):
[ ('Off', '', '', KC1, FUN, 'off'),
- ToyProblems . . . . 4 matches
ToyProblems를 풀게 하되 다음 방법을 이용한다. Seminar:TheParadigmsOfProgramming [http://www.jdl.ac.cn/turing/pdf/p455-floyd.pdf (pdf)]을 학습하게 하는 것이다.
ToyProblems를 풀면서 접하게 될 패러다임들(아마도): CSP, Generators, Coroutines, Various Forms of Recursion, Functional Programming, OOP, Constraint Programming, State Machine, Event Driven Programming, Metaclass Programming, Code Generation, Data Driven Programming, AOP, Generic Programming, Higher Order Programming, Lazy Evaluation, Declarative Programming, ...
* How to Read and Do Proofs
* Proofs and Refutations (번역판 있음)
* The Art and Craft of Problem Solving
- VendingMachine/세연/1002 . . . . 4 matches
[[TableOfContents]]
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
string drinkNames[] = {"coke", "juice", "tea", "cofee", "milk"};
- XMLStudy_2002/Start . . . . 4 matches
[[TableOfContents]]
<!ATTLIST MAIL STATUS (official|informal) 'official'>
<!ATTLIST ADDRESS TYPE (office|home|e-mail) 'e-mail'>
<ADDRESS TYPE="office">대전 유성구 만년동 111번지</ADDRESS>
5. PHONENUMBER 엘리먼트에 OFFICE 또는 HOME 또는 MOBILE 엘리먼트 중에서 하나가 위치하거나 또는 오지 않는 예
<!ELEMENT PHONENUMBER (OFFICE|HOME|MOBILE)?>
- neocoin/Log . . . . 4 matches
* SWEBOK (Software Engineering Body of Knowledge) : SE Reference
* 프로그래밍 언어론 4th 한서 ( Concepts of Programming Language ) : PL 수업
* 4월달에 많이 읽을 생각이었지만, 복병인 중간고사가 나를 괴롭힌다. Green gables of Ann 이 2권 남긴채 저 만치로 관심에서 벗어났다. 5월달에 끝내리
- JXTA는 과거 JXTA를 기고했던 마소 필자가 강의자(숭실대 대학원) 였는데, 거기에서 크게 발전한 것은 없다. JXTA의 구현 방향이 IPv6와 겹치는 부분이 많고, P2P의 서비스의 표준을 만들어 나가는 것에 많은 난관이 있다는 것이 느껴졌음. JMF는 강의자가 JMF의 초심자에 가까웠다. JMF가 계획 시행 초기의 당초 원대한 목표에 따르지 못했고, 미래 지향적인 프레임웍만을 남기고 현재 미미하다는 것에 중점, JavaTV가 일부를 차용하고, 그 일부가 무엇인지만을 알게되었음. JavaTV가 정수였다. 이 강연이 없었다면, 이날 하루를 후회했을 것이다. 현재 HDTV에서 JavaTV가 구현되었고, 올 7,8월 즈음에 skylife로 서비스 될 것으로 예상한다. 그리고 가장 궁금했던 "HDTV 상에서의 uplink는 어떻게 해결하는가"의 대답을 들어서 기뻤다.
- whiteblue/파일읽어오기 . . . . 4 matches
// Read the number of Book...
while (!f.eof())
while (!fin.eof())
while (!fin2.eof())
- 개인키,공개키/김회영,권정욱 . . . . 4 matches
ofstream fout("source_enc.txt");
while (!fin.eof()){
ofstream ffout("resource_enc.txt");
while (!ffin.eof()){
- 논문번역/2012년스터디/이민석 . . . . 4 matches
* 「Experiments in Unconstrained Offline Handwritten Text Recognition」 번역
== Experiments in Unconstrained Offline Handwritten Text Recognition(제약 없는 오프라인 필기 글자 인식에 관한 실험) ==
전처리에서 벌충할 수 없는 서로 다른 글씨체 사이의 변동을 고려하기 위해 우리는 [13]에 서술된 접근법과 비슷한, 다저자/저자 독립식 인식을 위한 글자 이서체 모형을 적용한다. 이서체는 글자 하위 분류, 즉 특정 글자의 서로 다른 실현이다. 이는 베이스라인 시스템과달리HMM이이제서로다른글자 하위 분류를 모델링하는 데 쓰임을 뜻한다. 글자별 하위 분류 개수와 이서체 HMM 개수는 휴리스틱으로 결정하는데, 가령 다저자식에 적용된 시스템에서 우리는 이서체 개수가 저자 수만큼 있다고 가정한다. 초기화에서 훈련 자료는 이서체 HMM들을 임의로 선택하여 이름표를 붙인다. 훈련 도중 모든 글자 표본에 대해 해당하는 모든 이서체에 매개변수 재추정을 병렬 적용한다. 정합 가능성은 특정 모형의 매개변수가 현재 표본에 얼마나 강하게 영향받는 지를 결정한다. 이서체 이름표가 유일하게 결정되지는 않기에 이 절차는 soft vector quantization과 비슷하다.
위 식에서 P(W)는 글자 시퀀스 w의 언어 모형 확률이고 P(X|W)는 이 글자 시퀀스를 그 글자 모형에 따라 입력 데이터 x로서 관찰한 확률이다. 우리의 경우 absolute discounting과 backing-off for smoothing of probability distribution을 이용한 바이그램 언어 모형을 적용하였다. (cf. e.g. [3])
추가로 Bern 대학의 Institute of Informatics and Applied Mathematics, 즉 Horst Bunke와 Urs-Viktor Marti에게 감사한다. 이들은 우리가 필기 양식 데이터베이스인 IAM[10]을 인식 실험에 쓰는 것을 허락하였다.
- 데블스캠프2005/RUR-PLE/SelectableHarvest . . . . 4 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
turn_off()
- 데블스캠프2005/RUR_PLE/조현태 . . . . 4 matches
turn_off()
turn_off()
def move_endof_sub():
def move_endof():
- 데블스캠프2005/주제 . . . . 4 matches
In my life, I have seen many programming courses that were essentially like the usual kind of driving lessons, in which one is taught how to handle a car instead of how to use a car to reach one's destination.
My point is that a program is never a goal in itself; the purpose of a program is to evoke computations and the purpose of the computations is to establish a desired effect.
- 데블스캠프2012 . . . . 4 matches
[[Tableofcontents]]
|| 7 |||| [http://zeropage.org/index.php?mid=seminar&category=61948 페챠쿠챠] |||| [http://zeropage.org/seminar/62023 Kinect] |||| [http://zeropage.org/62033 LLVM+Clang...] |||| |||| 새내기를 위한 파일입출력 |||| CSE Life || 2 ||
|| 8 |||| 페챠쿠챠 |||| Kinect |||| [:데블스캠프2012/셋째날/앵그리버드만들기 앵그리버드 만들기] |||| |||| 새내기를 위한 파일입출력 |||| CSE Life || 3 ||
|| CSE Life || [변형진](16기) ||
- 렌덤워크/조재화 . . . . 4 matches
int count[40][20]; //maximum size of the count array is 40*20
cout<<"input size of the board : "; //input m and n (for make M*N array)
cout<<"the board's size is out of range. try again :";
cout<<"start point is out of range. try again:";
- 비밀키/김태훈 . . . . 4 matches
ofstream fout ("source_enc.txt");
}while(!(fin.eof()));
ofstream fout("normal.txt");
}while(!(fin.eof()));
- 비밀키/최원서 . . . . 4 matches
ofstream fout("output.txt"); // fout과 output.txt를 연결
if (fin.eof())
ofstream fout("output2.txt"); // fout과 output.txt를 연결
if (fin.eof())
- 빵페이지/도형그리기 . . . . 4 matches
||[[TableOfContents]]||
memset(bitmap, 0, sizeof(bitmap));
num = input("plz input number of asterisk: ")
cout << "plz number of asterisk:";
cout << "plz number of asterisk:";
- 새싹교실/2011/學高/1회차 . . . . 4 matches
[[TableOfContents]]
* Kinds of programming language: C, C++, Java, Assembly, Python etc.
* 4 levels of programming: coding -> compile -> linking -> debugging(running). and type of error of an each level.
- 새싹교실/2012/해보자 . . . . 4 matches
[[TableOfContents]]
* sizeof(parameter): 매개변수가 가지고 있는 메모리상의 바이트 단위의 정수를 반환한다.
* sizeof(int) = 4, sizeof(char) = 1, sizeof(short) = 2 etc.
- 숫자를한글로바꾸기/조현태 . . . . 4 matches
int max_size_of_stack;
data_p=(char*)malloc(data_size*sizeof(char));
max_size_of_stack=data_size;
if (where_is_save != max_size_of_stack)
- 압축알고리즘/희경&능규 . . . . 4 matches
ofstream fout("output.txt");
ofstream fout("output.txt");
ofstream fout("input.txt");
ofstream fout("input.txt");
- 이영호/끄적끄적 . . . . 4 matches
head = (HOME *)malloc(sizeof(HOME));
strcpy(head->name, "2 of Clubs");
buf->next = (HOME *)malloc(sizeof(HOME));
sprintf(buf->name, "%s of %s",
- 지도분류 . . . . 4 matches
|| ["VisualSourceSafe"] || Microsoft의 Visual Studio의 일원인 소스 관리 도구 ||
=== Software Engineering ===
||["SoftwareEngineeringClass"]||.||
||SoftwareEngineeringClass ||
- 05학번만의C Study/숙제제출1/이형노 . . . . 3 matches
float tofah(float );
fah=tofah(cel);
float tofah(float cel)
- 05학번만의C++Study/숙제제출1/이형노 . . . . 3 matches
float tofah(float );
fah=tofah(cel);
float tofah(float cel)
- 1002/TPOCP . . . . 3 matches
Seminar:ThePsychologyOfComputerProgramming 맡은 챕터 정리궁리중.
Professional versus amateur programming
Professional
Stages of programming work
- ACM_ICPC/2013년스터디 . . . . 3 matches
[[TableOfContents]]
* graph, dfs - [http://211.228.163.31/30stair/danji/danji.php?pname=danji 단지 번호 붙이기], [http://211.228.163.31/30stair/orders/orders.php?pname=orders orders], [http://211.228.163.31/30stair/bugslife/bugslife.php?pname=bugslife 짝 짓기], [http://211.228.163.31/30stair/sprime/sprime.php?pname=sprime 슈퍼 소수], [http://211.228.163.31/30stair/snail_trails/snail_trails.php?pname=snail_trails 달팽이]
* 곽병학 : Hoffman code - 쓸데없을거 같음..
* proof - [http://prezi.com/fsaynn-iexse/kadanes-algorithm/]
* 위상정렬, critical path에 대해 공부 및 코딩 - 코드 및 해설은 Fundamental of DataStructure를 참고하자.
- AM/AboutMFC . . . . 3 matches
|| Upload:MFC_Macro_1of3_2001.11.06.doc || 분석||
|| Upload:MFC_Macro_code_23of3_2001.11.11.doc ||분석||
|| Upload:MFC_Macro_23of3_2001.11.11.doc ||예제 소스코드 그림 파일로 캡춰||
- APlusProject/ENG . . . . 3 matches
해결 방법: C:\WINDOWS\Microsoft.NET\Framework\v1.1.4322 폴더로 이동
C:\WINDOWS\Microsoft.NET\Framework\v1.1.4322>aspnet_regiis.exe -i
단, 사용하는 OS가 윈도우즈2000이나 XP professional이어야 함.
- AcceleratedC++ . . . . 3 matches
|| ["AcceleratedC++/Chapter3"] || Working with batches of data || 2주차 ||
|| [http://www.acceleratedcpp.com/ Accelerated C++ Official Site] || 각 커파일러의 버전에 맞는 소스코드를 구할 수 있습니다. ||
|| [http://msdn.microsoft.com/visualc/vctoolkit2003/ VSC++ Toolkit] || .net 을 구입할 수 없는 상태에서 STL을 컴파일 해야할 때 사용하면 되는 컴파일러. ||
|| [http://lab.msdn.microsoft.com/express/visualc/default.aspx VS2005C++Express] || .net 2005의 VSC++버전의 Express Edition ||
- AcceleratedC++/Chapter1 . . . . 3 matches
// build the second and fourth lines of the output
// build the first and fifth lines of the output
초기화, end-of-file, buffer, flush, overload, const, associativity(결합방식), 멤버함수, 기본 내장 타입, 기본타입(built-in type)
- AsemblC++ . . . . 3 matches
[http://www.google.co.kr/search?num=20&hl=ko&newwindow=1&client=firefox-a&rls=org.mozilla:ko-KR:official&q=disassembler&spell=1 역어셈블러 구글검색]
.exe 파일에 대한 어셈블리 코드는 역어셈블러(아래 상협이가 말한 softice와 같은 프로그램)만 있으면 쉽게 얻을 수 있습니다. 수정에 관한 보안장치도 전혀 없구요. 하지만 .exe 파일에 대한 어셈블리 코드는 분석하거나 수정하는것 자체가 거의 불가능할 정도로 어렵습니다. 이유는... 시간이 없어서 나중에 쓰도록 하죠-_-; --[상규]
Softice같은 프로그램을 사용해서 시리얼 번호가 있는 프로그램이나 날짜 제한 프로그램을 크랙 하기도 합니다. 이번 디버깅 세미나에서 함 해볼라고 그랬는데 집에 있는 컴퓨터에서 그게 잘 안돌아가서 보류함. - [상협]
- BookShelf/Past . . . . 3 matches
1. SoftwareProjectSurvivalGuide - 20050402
1. Professonal 프로젝트 관리 - 20050502
1. [TheElementsOfProgrammingStyle] - 20051018
1. [JoelOnSoftware] - 20060120
1. [TheElementsOfStyle] - 20060304
1. [IntroductionToTheTheoryOfComputation]
- CMM . . . . 3 matches
Capability Maturity Model. 미국 Software 평가모델의 표준. ISO 표준으로는 ["SPICE"] 가 있다.
* SW-CMM : Capability Maturity Model for Software. 소프트웨어 프로세스의 성숙도를 측정하고 프로세스 개선 계획을 수립하기 위한 모델
* SA-CMM : Software Acquisition Capability Maturity Model. 소프트웨어 획득 과정을 중점적인 대상으로 하여 성숙도를 측정하고 개선하기 위한 모델
- Code/RPGMaker . . . . 3 matches
[[TableOfContents]]
float[] coordinates = { // position of vertices
int[] indices = { // index of each coordinate
// calc normal vector of line
- DataCommunicationSummaryProject/Chapter9 . . . . 3 matches
[[TableOfContents]]
=== Types of Networks ===
* 801.11의 soft handoff 메카니즘
- DevPartner . . . . 3 matches
[[TableOfContents]]
a) DPP를 설치하고 나면 도구(Tools) 메뉴에 DevPartner Profiler란 항목이 최상단에 생깁니다.
b) 이놈을 선택한 후, "DevPartner Profiler" 서브 항목을 클릭해서 활성화시킵니다.
솔루션탐색기에서 솔루션의 속성 페이지(ALT+ENTER)를 열면, "Debug with Profiling"이란 항목이 있습니다. 이 항목의 초기값이 none으로 되어 있기 때문에, None이 아닌 값(대부분 native)으로 맞추고 나서 해당 솔루션을 다시 빌드해야합니다. 링크시 "Compuware Linker Driver..."로 시작하는 메시지가 나오면 프로파일링이 가능하도록 실행파일이 만들어진다는 뜻입니다.
- DevelopmentinWindows/APIExample . . . . 3 matches
wcex.cbSize = sizeof(WNDCLASSEX);
//Microsoft Developer Studio generated resource script.
// Microsoft Developer Studio generated include file.
- Eclipse . . . . 3 matches
* [http://www7b.software.ibm.com/wsdd/library/techarticles/0203_searle/searle1.html Eclipse + Ant]
[1002]의 경우 jmechanic, pmd, 그리고 잘 모르겠는 profiler (패키지 이름은 ru.nlmk 였는데) plugin 랑 Eclipse Tail 깔아서 쓰는중. 그리고 FreeMarker 작업시 FreeMarker plugin 설치해서 작업중.
Eclipse is an open platform for tool integration built by an open community of tool providers. ...
- EightQueenProblem/이선우2 . . . . 3 matches
private int numberOfAnswers;
numberOfAnswers = -1;
if( out != null || numberOfAnswers == -1 ) {
return numberOfAnswers;
numberOfAnswers = -1;
numberOfAnswers = 0;
numberOfAnswers ++;
if( checkOne && numberOfAnswers > 0 ) break;
int sizeOfBoard = 0;
sizeOfBoard = Integer.parseInt( args[0] );
NQueen2 nq = new NQueen2( sizeOfBoard );
System.out.println( "number of answers: " + nq.countAnswers());
System.out.println( "number of answers: " + nq.countAnswers( System.out ));
System.out.println( "number of answers: " + nq.countAnswers( System.out ));
- English Speaking/The Simpsons/S01E04 . . . . 3 matches
* Police Officer 1, 2 : [송지원]
Moe : What's-a matter, Homer? Bloodiest fight of the year.
Police 2 : Good one, Moe. We're looking for a family of Peeping Toms...
Homer : You can't talk that way about my kids! Or at least two of them.
- EnglishSpeaking/TheSimpsons/S01E04 . . . . 3 matches
* Police Officer 1, 2 : [송지원]
Moe : What's-a matter, Homer? Bloodiest fight of the year.
Police 2 : Good one, Moe. We're looking for a family of Peeping Toms...
Homer : You can't talk that way about my kids! Or at least two of them.
- ErdosNumbers/문보창 . . . . 3 matches
temp = new Node[sizeof(Node)];
temp = new Node[sizeof(Node)];
pNode ptr = new Node[sizeof(Node)];
- Expat . . . . 3 matches
Expat is a stream-oriented XML 1.0 parser library, written in C. Expat was one of the first open source XML parsers and has been incorporated into many open source projects, including the Apache HTTP Server, Mozilla, Perl, Python and PHP.
Expat's parsing events are similar to the events defined in the Simple API for XML (SAX), but Expat is not a SAX-compliant parser. Projects incorporating the Expat library often build SAX and DOM parsers on top of Expat.
- Gof/Composite . . . . 3 matches
[[TableOfContents]]
Another example of this pattern occurs in the financial domain, where a portfolio aggregates individual assets. You can support complex aggregations of assets by implementing a portfolio as a Composite that conforms to the interface of an individual asset [BE93].
* 종종 컴포넌트-부모 연결은 ChainOfResponsibilityPattern에 이용된다.
- HASH구하기/권정욱,곽세환 . . . . 3 matches
ofstream fout("hash_enc.txt");
if (fin.eof())
if (fin.eof())
- HolubOnPatterns/밑줄긋기 . . . . 3 matches
[[TableOfContents]]
* 인터페이스 관점에서 프로그래밍 하는 것은 OO 시스템의 기본 개념이며 GoF와 디자인 패턴은 이의 구체적이 예가 된다.
* 깨지기 쉬운 기반 클래스 문제를 프레임워크 기반 프로그래밍에 대한 언급 없이 마칠 수는 없다. MFC(Microsoft's Foundation Class) 라이브러리와 같은 프레임워크는 클래스 라이브러리를 만드는 인기있는 방법이 되었다.
* 이 Life Game말고 Life Game 류를 뜻하는거겟지? - [김준석]
* Clock이 전형적인 GoF Singleton 임을 주의 깊게 보기 바란다.
* 어투는 좀 잘못된 Trade-Off라고 하는듯 하다. - [김준석]
- InsideCPU . . . . 3 matches
[[TableOfContents]]
|| offset || field description ||
|| 0Eh || Nums of reserved sectors ||
|| 10h || Nums of FATs||
- InterWiki . . . . 3 matches
List of valid InterWiki names this wiki knows of:
MoinMoin marks the InterWiki links in a way that works for the MeatBall:ColourBlind and also is MeatBall:LynxFriendly by using a little icon with an ALT attribute. If you hover above the icon in a graphical browser, you'll see to which Wiki it refers. If the icon has a border, that indicates that you used an illegal or unknown BadBadBad:InterWiki name (see the list above for valid ones). BTW, the reasoning behind the icon used is based on the idea that a Wiki:WikiWikiWeb is created by a team effort of several people.
- JollyJumpers/김태진 . . . . 3 matches
if(feof(stdin)) break;
if(feof(stdin)) break;
if(feof(stdin)) break;
- LinkedList/C숙제예제 . . . . 3 matches
pList=(List *)malloc(sizeof(List));
pNew=(List *)malloc(sizeof(List));
pIns=(List *)malloc(sizeof(List));
- LinkedList/숙제 . . . . 3 matches
pList=(List *)malloc(sizeof(List)); // malloc은 (List *)가 단위인 크기가 List인 메모리 공간을 생성하고 그 메모리 공간 첫 주소를 반환한다. 그 주소가 pList에 대입(정의)된다.
pNew=(List *)malloc(sizeof(List));
pIns=(List *)malloc(sizeof(List));
- Metaphor . . . . 3 matches
Choose a system metaphor to keep the team on the same page by naming classes and methods consistently. What you name your objects is very important for understanding the overall design of the system and code reuse as well. Being able to guess at what something might be named if it already existed and being right is a real time saver. Choose a system of names for your objects that everyone can relate to without specific, hard to earn knowledge about the system. For example the Chrysler payroll system was built as a production line. At Ford car sales were structured as a bill of materials. There is also a metaphor known as the naive metaphor which is based on your domain itself. But don't choose the naive metaphor unless it is simple enough.
- OpenCamp/첫번째 . . . . 3 matches
* 13:30~14:15 Protocols of Web 김수경
* 14:15~15:00 Reverse Engineering of Web for Android Apps 정진경
* 데블스도 그렇고 이번 OPEN CAMP도 그렇고 항상 ZP를 통해서 많은 것을 얻어가는 것 같습니다. Keynote는 캠프에 대한 집중도를 높여주었고, AJAX, Protocols, OOP , Reverse Engineering of Web 주제를 통해서는 웹 개발을 위해서는 어떤 지식들이 필요한 지를 알게되었고, NODE.js 주제에서는 현재 웹 개발자들의 가장 큰 관심사가 무엇있지를 접해볼 수 있었습니다. 마지막 실습시간에는 간단한 웹페이지를 제작하면서 JQuery와 PHP를 접할 수 있었습니다. 제 기반 지식이 부족하여 모든 주제에 대해서 이해하지 못한 것은 아쉽지만 이번을 계기로 삼아서 더욱 열심히 공부하려고 합니다. 다음 Java Conference도 기대가 되고, 이런 굉장한 행사를 준비해신 모든 분들 감사합니다. :) - [권영기]
- PHP . . . . 3 matches
Professional Homepage Preprocessor 맞나요? 틀리면 수정해주세요~
지금은 Professional HTML Preprocessor이라는 이름으로 쓰입니다. -[강희경]
PHP약어를 풀어쓰면 PHP: Hypertext Preprocessor입니다. 약어의 첫번째 글자가 약어이기 때문에 많은 사람에게 혼란을 줍니다. 이와 같은 약어를 재귀적 약어라고 부릅니다. 궁금하신 분은 Free On-Line Dictionary of Computing사이트를 방문해보세요.
- PairProgrammingForGroupStudy . . . . 3 matches
이 방식을 소프트웨어 개발 업체에서 적용한 것은 Apprenticeship in a Software Studio라는 문서에 잘 나와 있습니다. http://www.rolemodelsoft.com/papers/ApprenticeshipInASoftwareStudio.htm (꼭 읽어보기를 권합니다. 설사 프로그래밍과는 관련없는 사람일지라도)
- PairProgramming토론 . . . . 3 matches
PairProgramming 자체에 대해서는 http://www.pairprogramming.com 를 참조하시고, IEEE Software에 실렸던, 로리 윌리엄스 교수의 글을 읽어보세요 http://www.cs.utah.edu/~lwilliam/Papers/ieeeSoftware.PDF. 다음은 UncleBob과 Rob Koss의 실제 PairProgramming을 기록한 대본입니다. http://www.objectmentor.com/publications/xpepisode.htm
또한, 모든 분야에 있어 전문가는 존재하지 않습니다. 그렇다고 해서, 자신의 전문 영역만 일을 하면 그 프로젝트는 좌초하기 쉽습니다. (이 말이 이해가 되지 않으면 Pete McBreen의 ''Software Craftsmanship''을 읽어보시길) 그 사람이 빠져나가 버리면 아무도 그 사람의 자리를 매꿔주기가 어렵기 때문입니다. 따라서 PairProgramming을 통해 지식 공유와 팀 빌딩을 합니다. 서로 배우는 것, 이것이 PairProgramming의 핵심입니다. 그런데 "배운다는 것"은 꼭 실력의 불균형 상태에서 상대적으로 "적게 아는 사람" 쪽에서만 발생하는 것이 아닙니다.
- Pairsumonious_Numbers/권영기 . . . . 3 matches
memset(checkans, 0, sizeof(int) * M);
memset(temp, 0, sizeof(int) * M);
memset(ans, 0, sizeof(int) * N);
- PerformanceTest . . . . 3 matches
short millitm ; /* fraction of second (in milliseconds) */
단, 정확한 수행시간 측정을 위해서라면 전문 Profiling Tool을 이용해 보는 것은 어떨까요? NuMega DPS 같은 제품들은 수행시간 측정을 아주 편하게 할 수 있고 측정 결과도 소스 코드 레벨까지 지원해 줍니다. 마소 부록 CD에서 평가판을 찾을 수 있습니다. 단, 사용하실 때 Development Studio 가 조금 맛이 갈겁니다. 이거 나중에 NuMega DPS 지우시면 정상으로 돌아갑니다. 그럼 이만. -- '96 박성수
멀티쓰레드로 인해 제어권이 넘어가는 것까지 고려해야 한다면 차라리 도스 같은 싱글테스킹 OS에서 알고리즘 수행시간을 계산하는게 낫지 않을까 하는 생각도 해봅니다. (하지만, 만일 TSR 프로그램 같은 것이 인터럽트 가로챈다면 역시 마찬가지 문제가 발생할듯..) 그리고 단순한 프로그램의 병목부분을 찾기 위한 수행시간 계산이라면 Visual C++ 에 있는 Profiler 를 사용하는 방법도 괜찮을 것 같습니다. 해당 함수들의 수행시간들을 보여주니까요.
- PlatformSDK . . . . 3 matches
[http://www.microsoft.com/msdownload/platformsdk/sdkupdate/psdk-full.htm 다운로드 페이지] : 최신 버전은 VC6 와 호환되지 않는 다고함.
기타 최신버전은 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/sdkintro/sdkintro/devdoc_platform_software_development_kit_start_page.asp MSDN platform SDK 소개 페이지] 에서 다운로드 하는 것이 가능하다.
- ProgrammingLanguageClass . . . . 3 matches
"Students usually demand to be taught the language that they are most likely to use in the world outside (FORTRAN or C). This is a mistake. A well taught student (viz. one who has been taught a clean language) can easily pick up the languages of the world, and he [or she] will be in a far better position to recognize their bad features as he [or she] encounters them."
-- C. H. Lindsey, History of Algol 68. ACM SIGPLAN Notices, 28(3):126, March 1993.
see also SoftwareEngineeringClass
- RUR-PLE/Newspaper . . . . 3 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- RandomWalk2/상규 . . . . 3 matches
int offset=0;
strcpy(&journey[offset],buffer);
offset+=strlen(buffer);
- Refactoring/BadSmellsInCode . . . . 3 matches
* When you can get the data in one parameter by making a request of an object you already know about - ReplaceParameterWithMethod
* to take a bunch of data gleaned from an object and replace it with the object itself - PreserveWholeObject
* Divergent Change - one class that suffers many kinds of changes
- RegularExpression/2011년스터디 . . . . 3 matches
[[TableOfContents]]
<a href ="dfdof></a>
<a href ="dfdof class="dfdfd"></a>
<a href ="dfdof" class=dfdfd" name ="cdef"></a>
- Ruby/2011년스터디/서지혜 . . . . 3 matches
[[TableOfContents]]
pe32.dwSize = sizeof(PROCESSENTRY32);
printf("number of process = %d", countProcess);
pe32.dwSize = sizeof(PROCESSENTRY32);
- Slurpys/곽세환 . . . . 3 matches
temp = str.find_first_not_of('F', 2);
temp = str.find_last_of('C');
temp = str.find_last_of('H');
int numberOfCase;
cin >> numberOfCase;
for (testCase = 0; testCase < numberOfCase; testCase++)
cout << "END OF OUTPUT" << endl;
- SmallTalk/강좌FromHitel/강의3 . . . . 3 matches
* Previous experience of Smalltalk?
* Intended use of this product?
* How many attempts did it take you to download this software?:
- TAOCP/InformationStructures . . . . 3 matches
''새 원소 넣기(inserting an element at the rear of the queue)
하지만 공간낭비가 무한할 수 있다.( F, R이 계속증가하기 때문이다.) 따라서 이런 문제(the problem of the queue overrunning memory)를 해결하려면, M개의 노드(X[1]...X[M])가 순환하도록 한다.
하지만 리스트가 더 많으면 bottom이 움직일 수 있어야 한다.(we must allow the "bottom" elements of the lists to change therir positions.) MIX에서 I번째 한 WORD를 rA에 가져오는 코드는 다음과 같다.
- TheTrip/Leonardong . . . . 3 matches
def getListOfBiggerThan(self, aMean, aList):
def getMeanOfList(self, aList):
def offerAShareOfMoney(self, aExpenses):
expensesBiggerThanMean = self.getListOfBiggerThan(
self.getMeanOfList(aExpenses),
result = result + abs( each - self.getMeanOfList(aExpenses) )
def testGetListOfBiggerThan(self):
mean = self.ex.getMeanOfList(expenses) # mean is 1.5
self.ex.getListOfBiggerThan( mean, expenses ))
def testOfferAShareOfMoney(self):
self.ex.offerAShareOfMoney( [10.0, 20.0, 30.0] ))
self.ex.offerAShareOfMoney( [15.0, 15.01, 3.0, 3.01] ))
- VendingMachine_참관자 . . . . 3 matches
# define OFF 5
char *M_Name[]={"cup","cococa","water","coffee"};
"off"
AddingMenu("coffe",200);
case OFF:
- VisualStudio2005 . . . . 3 matches
2. Visual Studio Professional
http://www.microsoft.com/korea/events/ready2005/vs_main.asp
http://msdn.microsoft.com/vstudio/express/default.aspx
- WhatToExpectFromDesignPatterns . . . . 3 matches
Describing a system in terms of the DesignPatterns that it uses will make it a lot easier to understand.
DesignPatterns capture many of the structures that result from refactoring. Using these patterns early in the life of a design prevents later refactorings. But even if you don't see how to apply a pattern until after you've built your system, the pattern can still show you how to change it. Design patterns thus provide targets for your refactorings.
- XsltVersion . . . . 3 matches
<xsl:value-of select="system-property('xsl:vendor')"/>
(<a href="{system-property('xsl:vendor-url')}"><xsl:value-of select="system-property('xsl:vendor-url')"/></a>)
implementing XSLT v<xsl:value-of select="system-property('xsl:version')"/>
- ZeroPage . . . . 3 matches
* 2013 삼성 Software Friendship 선정
* 2015 Samsung Software Friendship 4기 동아리 선정
* 삼성 Software Friendship 동아리 선정
- [Lovely]boy^_^/Diary/2-2-16 . . . . 3 matches
[[TableOfContents]]
DeleteMe) I envy you. In my case, all final-exams will end at Friday. Shit~!!! -_- Because of dynamics(In fact, statics)... -_-;; --["Wiz"]
* It's 1st day of a winter school vacation. I must do a plan.
* I read a novel named the Brain all day. Today's reading amount is about 600 pages. It's not so interesting as much as the price of fame.
- [Lovely]boy^_^/EnglishGrammer/ReportedSpeech . . . . 3 matches
[[TableOfContents]]
A. You want to tell somebody else what Tom said. There are two ways of doing this :
B. When we use reported speech, the main verb of the sentence is usually past. The rest of the sentence is usually past, too :
- django . . . . 3 matches
[[TableOfContents]]
* [http://linux.softpedia.com/progDownload/PySQLite-Download-6511.html pysqlite다운로드]
* [http://www2.jeffcroft.com/2006/feb/25/django-templates-the-power-of-inheritance/] : Template HTML 파일 사용법
- pragma . . . . 3 matches
Each implementation of C and C++ supports some features unique to its host machine or operating system. Some programs, for instance, need to exercise precise control over the memory areas where data is placed or to control the way certain functions receive parameters. The #pragma directives offer a way for each compiler to offer machine- and operating-system-specific features while retaining overall compatibility with the C and C++ languages. Pragmas are machine- or operating-system-specific by definition, and are usually different for every compiler.
- 강희경 . . . . 3 matches
[[TableOfContents]]
== Profile ==
*[http://aragorn.bawi.org/interests/tao_of_programming_(korean).html]프로그램의 도
*[http://aragorn.bawi.org/interests/tao_of_programming_(english).html]
- 구조체 파일 입출력 . . . . 3 matches
//fread(&p, sizeof(Person), 1 , fpt); // (주소, 구조체 크기, 구조체 개수, 파일 )
fwrite(&p, sizeof(Person), 1, fpt);
fread(&p, sizeof(Person), 1, fp);
- 데블스캠프2005/RUR-PLE . . . . 3 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- 데블스캠프2011/넷째날/Git/권순의 . . . . 3 matches
for( int i=0; i<sizeof(cmds)/sizeof(Cmds); i++)
while(!f.eof()){
- 오목/곽세환,조재화 . . . . 3 matches
// ohbokView.h : interface of the COhbokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// ohbokView.cpp : implementation of the COhbokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COhbokDoc)));
- 오목/재니형준원 . . . . 3 matches
// OmokView.h : interface of the COmokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// omokView.cpp : implementation of the COmokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COmokDoc)));
- 오목/재선,동일 . . . . 3 matches
// singleView.h : interface of the CSingleView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// singleView.cpp : implementation of the CSingleView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(CSingleDoc)));
- 오목/진훈,원명 . . . . 3 matches
[[TableOfContents]]
// OmokView.h : interface of the COmokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// OmokView.cpp : implementation of the COmokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COmokDoc)));
- 윤종하/지뢰찾기 . . . . 3 matches
int iNumOfMine;//주변에 있는 지뢰의 개수
COORD* make_mine_map(CELL** map,COORD size,int iNumOfMine);
void print_map(CELL** map,COORD size,int iNumOfMine,int iCurrentFindedMine);
int click_cell(CELL** map,COORD size,int *iNumOfLeftCell);
void one_right_click_cell(CELL** map,COORD size,COORD *cPosOfMine,int iNumOfMine,int *iFindedRealMine);
void find_mine(CELL** map,COORD size,COORD pos,int *iNumOfLeftCell);
int search_mine(int iNumOfMine,COORD* real_mine_cell,COORD target_cell);
COORD *cPosOfMine;
int iNumOfMine,iCurrentFindedMine=0,iNumOfLeftCell,iIsAlive=TRUE,tempX,tempY,iFindedRealMine=0,i,j;
map=(CELL**)malloc(sizeof(CELL)*size.Y);//1차동적할당
map[i]=(CELL*)malloc(sizeof(CELL)*size.X);//2차동적할당
if(argc==4) iNumOfMine=atoi(argv[3]);////argument로의 지뢰 개수 입력이 있을 경우
scanf("%d",&iNumOfMine);
cPosOfMine=make_mine_map(map,size,iNumOfMine);
iNumOfLeftCell=size.X*size.Y;
print_map(map,size,iNumOfMine,iCurrentFindedMine);
iIsAlive=click_cell(map,size,&iNumOfLeftCell);
one_right_click_cell(map,size,cPosOfMine,iNumOfMine,&iFindedRealMine);
free(cPosOfMine);
}while(iNumOfLeftCell>iNumOfMine && iIsAlive==TRUE && iFindedRealMine!=iNumOfMine);
- 창섭/배치파일 . . . . 3 matches
◇ 사용법 : echo [on/off] [문자열]
- off : 배치 파일 실행중에 명령어를 화면에 출력하지 않도록 합니다.
echo off
- 코드레이스/2007/RUR_PLE . . . . 3 matches
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- 프로그래밍언어와학습 . . . . 3 matches
The fatal metaphor of progress, which means leaving things behind us, has utterly obscured the real idea of growth, which means leaving things inside us.
--G. K. Chesterton (1874-1936), British author. Fancies Versus Fads, "The Romance of Rhyme" (1923).
- 2학기파이선스터디/모듈 . . . . 2 matches
['_StringTypes', '__builtins__', '__doc__', '__file__', '__name__', '_float', '_idmap', '_idmapL', '_int', '_long', 'ascii_letters', 'ascii_lowercase', 'ascii_uppercase', 'atof', 'atof_error', 'atoi', 'atoi_error', 'atol', 'atol_error', 'capitalize', 'capwords', 'center', 'count', 'digits', 'expandtabs', 'find', 'hexdigits', 'index', 'index_error', 'join', 'joinfields', 'letters', 'ljust', 'lower', 'lowercase', 'lstrip', 'maketrans', 'octdigits', 'printable', 'punctuation', 'replace', 'rfind', 'rindex', 'rjust', 'rstrip', 'split', 'splitfields', 'strip', 'swapcase', 'translate', 'upper', 'uppercase', 'whitespace', 'zfill']
- 3D업종 . . . . 2 matches
헤더: C:\Program Files\Microsoft Visual Studio 8\VC\PlatformSDK\Include\gl
라이브러리: C:\Program Files\Microsoft Visual Studio 8\VC\PlatformSDK\Lib
- 3N+1Problem/Leonardong . . . . 2 matches
CUTOFF = 100
if CUTOFF < aEnd - aStart:
* 구하는 범위가 Cutoff보다 크면 시작하는 수가 홀수일 때 CycleLength가 클 것이므로 홀수부터 시작해서 짝수는 무시하고 구한다.
확신이 가지 않는 cutoff부분을 빼더라도 PsyCo를 쓰면 2초 안에 통과한다. 3시간 동안 10초 정도를 줄였는데, 10분만에 10초를 줄였다. 시간을 줄여야 하는데 정말 수가 안 떠오르면 PsyCo가 꽤 도움이 될 것이다. 남용은 조심해야겠다.--[Leonardong]
- 5인용C++스터디/다이얼로그박스 . . . . 2 matches
1-1 Visual Stdio Microsoft Visual C++ 프로그램을 실행 시킨다
1-4 What type of application would you like to create?
- ATmega163 . . . . 2 matches
#put the name of the target mcu here (at90s8515, at90s8535, attiny22, atmega603 etc.)
#put the name of the target file here (without extension)
- AcceleratedC++/Chapter11 . . . . 2 matches
||[[TableOfContents]]||
=== 11.3.6 세 법칙(rule of three) ===
'''Rule of three''' : 복사 생성자, 소멸자, 대입 연산자가 밀접한 관계를 갖는 것을 일컬어 표현하는 말이다.
- AcceleratedC++/Chapter9 . . . . 2 matches
||[[TableOfContents]]||
// as defined in 9.2.1/157, and changed to read into `n' instead of `name'
// get rid of previous contents
- AirSpeedTemplateLibrary . . . . 2 matches
A number of excellent templating mechanisms already exist for Python, including Cheetah, which has a syntax similar to Airspeed.
However, in making Airspeed's syntax identical to that of Velocity, our goal is to allow Python programmers to prototype, replace or extend Java code that relies on Velocity.
- AncientCipher/정진경 . . . . 2 matches
memset (c1,0,sizeof(c1));
memset (c2,0,sizeof(c2));
- C++3DGame . . . . 2 matches
[[TableOfContents]]
Point3D center; // the center of CPU. in world coordinates
Point3D coord[8]; // the 8 corners of the CPU box relatives to the center point
- CVS . . . . 2 matches
* http://www.componentsoftware.com/ :RCS 도 있음
where '/usr/local/cvsroot' is the path of my repository - replace this with yours.
- CategoryMacro . . . . 2 matches
If you click on the title of a category page, you'll get a list of pages belonging to that category
- CategorySoftwareTool . . . . 2 matches
If you click on the title of a category page, you'll get a list of pages belonging to that category
- CategoryTemplate . . . . 2 matches
If you click on the title of a category page, you'll get a list of pages belonging to that category
- CauGlobal/Interview . . . . 2 matches
* 대학에서도 officer (사무일들. 문서 작업들) 작업 많이 하시는지?
Profile : Stanford 기계과 Ph.D 2년
- DataStructure/Tree . . . . 2 matches
[[TableOfContents]]
* Keys in Left Subtree < Keys of Node
* Keys in Right Subtree > Keys of Node(고로 순서대로 정렬되어 있어야 한단 말입니다.)
- DebuggingSeminar_2005/UndName . . . . 2 matches
Microsoft(R) Windows (R) 2000 Operating System
UNDNAME Version 5.00.2184.1Copyright (C) Microsoft Corp. 1981-1999
- DesignPatterns/2011년스터디/1학기 . . . . 2 matches
1. 한번 짜봐야 할 필요성을 느낀다. Life Game으로 넘어가기전에.
1. 오늘은 LifeGame으로 바로 넘어가기 전에 [임상현]의 SE 과제인 파일 비교 프로그램을 설계해보았다.
- DirectX2DEngine . . . . 2 matches
[[TableOfContents]]
* SDK는 이 주소로 받으세요 : [http://www.microsoft.com/downloads/info.aspx?na=90&p=&SrcDisplayLang=en&SrcCategoryId=&SrcFamilyId=1FD20DF1-DEC6-47D0-8BEF-10E266DFDAB8&u=http%3a%2f%2fdownload.microsoft.com%2fdownload%2f5%2ff%2fd%2f5fd259d5-b8a8-4781-b0ad-e93a9baebe70%2fdxsdk_jun2006.exe DOWNLOAD]
- EightQueenProblem/da_answer . . . . 2 matches
QueenPosArr: array of TQueenPos;
QueenPosArr: array of TQueenPos;
- EightQueenProblem/이선우 . . . . 2 matches
private int numberOfBoard;
private int sizeOfBoard;
public NQueen( int sizeOfBoard )
this.sizeOfBoard = sizeOfBoard;
board = new int[sizeOfBoard];
numberOfBoard = 0;
for(int i=from; i<sizeOfBoard; i++ ) board[i] = -1;
if( line == sizeOfBoard ) {
numberOfBoard ++;
for( int i=0; i<sizeOfBoard; i++ ) {
for( int i=0; i<sizeOfBoard; i++ ) {
for( int i=0; i<sizeOfBoard; i++ ) {
for( int i=0; i<sizeOfBoard; i++ ) {
for( int j=0; j<sizeOfBoard; j++ ) {
public void printNumberOfBoard()
System.out.println( "Number of different board: " + numberOfBoard );
nq.printNumberOfBoard();
System.out.println( "Usage: java NQueen size_of_queen" );
- EightQueenProblem2Discussion . . . . 2 matches
이미 알고리즘 수업 시간을 통해 생각해본 문제이기에 주저없이 백트래킹(BackTracking) 기법을 선택해서 슈도코드를 종이에 작성해보았고 그를 바탕으로 구현에 들어갔습니다.(''그냥 호기심에서 질문 하나. 알고리즘 수업에서 백트래킹을 배웠나요? 최근에는 대부분 AI쪽으로 끄집어 내서 가르치는 것이 추세입니다만... 교재가 무엇이었나요? --김창준 Foundations of Algorithms Using C++ Pseudocode, Second Edition 이었습니다. ISBN:0763706205 --이덕준'') 백트래킹은 BruteForce식 알고리즘으로 확장하기에 용이해서 수정엔 그리 많은 시간이 걸리지 않았습니다. 만일 EightQueenProblem에 대한 사전 지식이 없었다면 두번째 과제에서 무척 당황했을것 같습니다. 이번 기회에 코드의 적응도도 중요함을 새삼 확인했습니다. --이덕준
어제 서점에서 ''Foundations of Algorithms Using C++ Pseudocode''를 봤습니다. 알고리즘 수업 시간에 백트래킹과 EightQueenProblem 문제를 교재를 통해 공부한 사람에게 이 활동은 소기의 효과가 거의 없겠더군요. 그럴 정도일줄은 정말 몰랐습니다. 대충 "이런 문제가 있다" 정도로만 언급되어 있을 주 알았는데... 어느 교재에도 구체적 "해답"이 나와있지 않을, ICPC(ACM의 세계 대학생 프로그래밍 경진대회) 문제 같은 것으로 할 걸 그랬나 봅니다. --김창준
- EightQueenProblemSecondTry . . . . 2 matches
* LOC - ''Lines of Code. 보통 SLOC(Source Lines of Code)이라고도 함.''
- Functor . . . . 2 matches
A function object, often called a functor, is a computer programming construct allowing an object to be invoked or called as if it were an ordinary function, usually with the same syntax. The exact meaning may vary among programming languages. A functor used in this manner in computing bears little relation to the term functor as used in the mathematical field of category theory.
- HASH구하기/신소영 . . . . 2 matches
ofstream output("output.txt");
while (input.eof() == false)
- HowManyPiecesOfLand?/하기웅 . . . . 2 matches
BigInteger Piece_of_Land(BigInteger n)
cout << Piece_of_Land(input) << endl;
- ISAPI . . . . 2 matches
* Low-Level Control : access to the whole array of Win32 API or 3rd party API
* Scailability gains are not necessarily automatic : runs faster than others but there is no guarantee of perfect scalability
- JUnit . . . . 2 matches
@echo off
@echo off
- Java Study2003/첫번째과제/방선희 . . . . 2 matches
* Java는 보안능력이 뛰어나다. 예를 들어 네트워크를 통해 내 PC로 download된 Java로 개발된 프로그램은 일반적으로 그 능력이 제한된다. 다시 말해 바이러스처럼 작용할 수 없다는 말이다 (이점은 MicroSoft의 Active X와 비교된다).
* MicroSoft windows에서 신나게 실행되는 게임이 Linux에서도 잘 돌까? 아마도 답은 '아니다' 일 것이다. 그러나 만약 그 게임이 Java로 제작되었다면 답은 '예' 이다. 다시 말해 Java로 개발된 프로그램은 PC, Macintosh, Linux등 machine이나 O/S에 종속되지 않는다.
- JoelOnSoftware . . . . 2 matches
http://korean.joelonsoftware.com/
[임인택]은 ZPHomePage보다는 ZeroWiki를 이용하기 때문에 자유게시판을 잘 안보는데, 우연히 갔다가 JoelOnSoftware에 관한 글이 올라온 걸 보게 되었다. 이전처럼 자유게시판 업데이트 되었을때, RecentChanges에 반영되었으면 좋으련만...
- LIB_2 . . . . 2 matches
MOV S_OFF,SP
High_Task->StackOff = S_OFF;
S_OFF = High_Task->StackOff;
MOV SP,S_OFF
START_TCB.StackOff = 0;
MOV DI,offset oldtimer
MOV AX,offset LIB_ISR
MOV S_OFF,SP
High_Task->StackOff = S_OFF;
S_OFF = High_Task->StackOff;
MOV SP,S_OFF
- Linux/필수명령어/용법 . . . . 2 matches
만일 중간에 다른 점을 발견한다면 더 이상의 작업은 중단하고 차이를 발견한 지점을 알려주고는 종료한다. 또한 계속해서 일치해 나가다가 두 파일 중 어느 하나가 끝나는 경우가 있을 수 있다. 다시 말해, 한 파일이 다른 파일의 앞부분에 해당하는 경우이다. 이때는 어느쪽 파일의 end of file 표시를 만나게 되었는지를 알려주고 종료한다.
- Login Name Tty Idle Login Time Office Office Phone
-26) SIGVTALRM 27) SIGPROF 28) SIGWINCH 29) SIGIO
readme.txt의 파일에서 캐리지 리턴 문자와 eof마크를 제거하고 readable파일로 리다이렉션한다.
- Map연습문제/유주영 . . . . 2 matches
while(!fin.eof())
if(fin.eof())
- MoreEffectiveC++/C++이 어렵다? . . . . 2 matches
[http://zeropage.org/moin/moin.cgi/MoreEffectiveC_2b_2b_2fTechniques3of3 Item 31]
[http://zeropage.org/moin/moin.cgi/MoreEffectiveC_2b_2b_2fTechniques3of3#head-85091850a895b3c073a864be41ed402384d1868c RTTI를 이용해 구현 부분]
- NSIS/예제1 . . . . 2 matches
; eof
MakeNSIS v1.95 - Copyright 1999-2001 Nullsoft, Inc.
- OurMajorLangIsCAndCPlusPlus/stdlib.h . . . . 2 matches
|| typedef size_t || sizeof 키워드의 unsigned 정수형 결과 ||
|| double atof(const char *str); || 문자열을 실수(double precision)로 변환 ||
- ProgrammingPearls/Column4 . . . . 2 matches
[[TableOfContents]]
=== The shallange of binary search ===
=== The Roles of Program Verification ===
- RedThon . . . . 2 matches
{{|Many programmes lose sight of the fact that learning a particular system or language is a means of learning something else, not an goal in itself.
- ReplaceTempWithQuery . . . . 2 matches
그러한 우려는 ' '''단지 그럴지도 모른다.''' ' 라는 가정일 뿐이다. 누구도 실제로 '''프로파일링'''(profiling)해보기 전까지는 알 수 없다. 실제로 문제가 되는지 아닌지는.
ordinary. Whilst the great ocean of truth lay all undiscovered before me.
- RonJeffries . . . . 2 matches
Could you give any advices for Korean young programmers who're just starting their careers? (considering the short history of IT industry in Korea, there are hardly any veterans with decades of experiences like you.) -- JuNe
- STL/참고사이트 . . . . 2 matches
[http://www.halpernwightsoftware.com/stdlib-scratch/quickref.html C++ STL from halper]
Mumits STL 초보 가이드 (약간 오래된 것) http://www.xraylith.wisc.edu/~khan/software/stl/STL.newbie.html
- SWEBOK . . . . 2 matches
[http://object.cau.ac.kr/selab/lecture/undergrad/20021/참고자료/SWEBOKv095.pdf SWEBOK] - Software Engineering Body of Knowledge
- ScheduledWalk/권정욱 . . . . 2 matches
ofstream fout("output.txt");
while (!fin.eof()){
- SearchAndReplaceTool . . . . 2 matches
* Actual Search & Replace (http://www.divlocsoft.com/)
* HandyFile Find and Replace (http://www.silveragesoftware.com/hffr.html)
- SeminarHowToProgramIt/Pipe/VendingMachineParser.py . . . . 2 matches
self.err('Unexpected end of file')
if tok not in ('on', 'off'):
- SolarSystem/상협 . . . . 2 matches
// Calculate The Aspect Ratio Of The Window
void CorrectOfCoordinate(float distance,float x,float y, float z)
CorrectOfCoordinate(distance2,1.0f,1.0f,0.0f);
CorrectOfCoordinate(distance3,1.0f,1.0f,0.0f);
CorrectOfCoordinate(distance4,0.1f,1.2f,0.0f);
CorrectOfCoordinate(distance5,0.07f,0.06f,0.0f);
CorrectOfCoordinate(distance6,0.0f,1.0f,0.0f);
CorrectOfCoordinate(distance7,0.7f,1.0f,0.0f);
CorrectOfCoordinate(distance8,0.1f,1.0f,0.0f);
CorrectOfCoordinate(distance2,0.3f,1.0f,0.0f);
MessageBox(NULL,"Release Of DC And RC Failed.","SHUTDOWN ERROR",
memset(&dmScreenSettings,0,sizeof(dmScreenSettings));
sizeof(PIXELFORMATDESCRIPTOR),
- Spring/탐험스터디/wiki만들기 . . . . 2 matches
if (principal instanceof UserDetails) {
* [http://en.wikipedia.org/wiki/List_of_Markdown_implementations 위키피디아]를 참고하여 Java로 구현된 Markdown implementation 중 Pegdown을 선택했다.
- StacksOfFlapjacks/이동현 . . . . 2 matches
[StacksOfFlapjacks]
//Stacks Of Flapjacks:2005.04.15 이동현
class StacksOfFlapjacks{
StacksOfFlapjacks sof;
while(cin >> arr[j]){ //입력의 끝은 ^Z(EOF)를 흉내내서 종료.
sof.run(arr,j);
- StandardWidgetToolkit . . . . 2 matches
The most succinct description of the Standard Widget Toolkit component is this:
The SWT component is designed to provide efficient, portable access to the user-interface facilities of the operating systems on which it is implemented.
- The Tower of Hanoi . . . . 2 matches
==== Recurrent Problems - The Tower of Hanoi ====
T<sub>n</sub> is the minimum number of moves that will transfer n disks from one peg to another under Lucas's rules.
- TheKnightsOfTheRoundTable . . . . 2 matches
=== TheKnightsOfTheRoundTable ===
{{| The radius of the round table is: r |}}
{{| The radius of the round table is: 2.828 |}}
|| 하기웅 || C++ || 1시간 || [TheKnightsOfTheRoundTable/하기웅] ||
|| 김상섭 || C++ || 엄청 || [TheKnightsOfTheRoundTable/김상섭] ||
|| 문보창 || C++ || 10분 || [TheKnightsOfTheRoundTable/문보창] ||
|| 허준수 || C++|| ? || [TheKnightsOfTheRoundTable/허준수] ||
- TheKnightsOfTheRoundTable/김상섭 . . . . 2 matches
cout << "The radius of the round table is: 0.000" << endl;
cout << "The radius of the round table is: " << temp << endl;
- TheKnightsOfTheRoundTable/하기웅 . . . . 2 matches
cout << "The radius of the round table is: 0.000"<<endl;
cout << "The radius of the round table is: " << 1.0*sqrt(halfSum*(halfSum-a)*(halfSum-b)*(halfSum-c))/halfSum << endl;
- TugOfWar/문보창 . . . . 2 matches
// no10032 - Tug of War
qsort(weight, nPeople, sizeof(int), comp);
[TugOfWar] [문보창]
- UbuntuLinux . . . . 2 matches
[[TableOfContents]]
For more information on the usage of update-rc.d
CTRL + ALT + Left/right arrow key. Switches to the new side of the cube for me.
- UsenetMacro . . . . 2 matches
$offset = strpos($buf, '</b></TD></TR>', $seek);
$subj = substr($buf, $seek, $offset-$seek);
- ViImproved/설명서 . . . . 2 matches
▶Vi 저자 vi와 ex는 The University of California, Berkeley California computer Science Division, Department of Electrical Engineering and Computer Science에서 개발
- VimSettingForPython . . . . 2 matches
set et ts=4 sw=4 softtabstop=4 smarttab expandtab
set nofen
- WantedPages . . . . 2 matches
A list of non-existing pages including a list of the pages where they are referred to:
- WebGL . . . . 2 matches
[[TableOfContents]]
//vertex is coord of points
//index is triangle point index of suface
- WikiWikiWebFaq . . . . 2 matches
'''A:''' A set of pages of information that are open and free for anyone to edit as they wish. The system creates cross-reference hyperlinks between pages automatically. See WikiWikiWeb for more info.
- WorldCupNoise/권순의 . . . . 2 matches
scenario = (int*)malloc(sizeof(int) * getLineNum);
scenario = (int*)malloc(sizeof(int) * getLineNum);
- ZPHomePage/참고사이트 . . . . 2 matches
* [http://microsoft.com]
[http://www.microsoft.com/mscorp/innovation/yourpotential/main.html]
- ZeroPage_200_OK . . . . 2 matches
[[TableOfContents]]
* MSDN - http://msdn.microsoft.com/ko-kr/
* Microsoft Visual Studio (AJAX.NET -> jQuery)
- [Lovely]boy^_^/Diary/2-2-9 . . . . 2 matches
[[TableOfContents]]
* ["TheWarOfGenesis2R"] 시작
* ["TheWarOfGenesis2R"] Start
* I'll delight The AcceleratedC++, that I summary on wiki pages is helpful for beginner of C++.
* This meeting is also helpful. Although a half of members don't attend, I can think many new things.
- maya . . . . 2 matches
* Software engineering
* Software architecture
- ★강원길★ . . . . 2 matches
== Profile ==
홈페이지 : [http://www.cyworld.com/soffmagil] 원길이 홈페이지 에요
- 개인키,공개키/강희경,조동영 . . . . 2 matches
ofstream fout("output1.txt");
ofstream fout1("output2.txt");
- 개인키,공개키/노수민,신소영 . . . . 2 matches
ofstream output("output.txt");
ofstream output("output2.txt");
- 개인키,공개키/임영동,김홍선 . . . . 2 matches
ofstream fout("out.txt");
while(!fin.eof())
- 김민재 . . . . 2 matches
== Profile ==
== History of Activity ==
- 김준호 . . . . 2 matches
== Profile ==
# 3월 17일에는 Microsoft Visual Studio 2008 프로그램을 이용하여 기초적인 c언어를 배웠습니다.
- 데블스캠프2005/RUR-PLE/Newspaper . . . . 2 matches
[[TableOfContents]]
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/Newspaper/Refactoring . . . . 2 matches
[[TableOfContents]]
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/정수민 . . . . 2 matches
turn_off()
turn_off()
- 데블스캠프2010/일반리스트 . . . . 2 matches
a = (int *)malloc(sizeof(int)*MAX);
qsort( a, MAX, sizeof(int), fn_qsort_intcmp );
- 데블스캠프2011/둘째날/후기 . . . . 2 matches
* 씐나는 Cheat-Engine Tutorial이군요. Off-Line Game들 할때 이용했던 T-Search, Game-Hack, Cheat-O-Matic 과 함께 잘 사용해보았던 Cheat-Engine입니다. 튜토리얼이 있는지는 몰랐네요. 포인터를 이용한 메모리를 바꾸는 보안도 찾을수 있는 대단한 성능이 숨겨져있었는지 몰랐습니다. 감격 감격. 문명5할때 문명 5에서는 값을 *100 + 난수로 해놔서 찾기 어려웠는데 참. 이제 튜토리얼을 통해 어떤 숨겨진 값들도 다 찾을 수 있을것 같습니다. 그리고 보여주고 준비해왔던 얘제들을 통해 보안이 얼마나 중요한지 알게되었습니다. 보안에 대해 많은걸 생각하게 해주네요. 유익한시간이었습니다. 다음에 관련 책이 있다면 한번 읽어볼 생각이 드네요.
while (!feof(fpe)) {
while (!feof(fpp)) {
- 레밍즈프로젝트/박진하 . . . . 2 matches
TYPE* m_pData; // the actual array of data
int m_nSize; // # of elements (upperBound - 1)
- 문자반대출력 . . . . 2 matches
* C 에도 라이브러리로 문자열 반전 시켜주는 함수를 제공합니다. strrev()라는 함수를 사용하면 '\0'바로 전 글자부터 거꾸로 만들어주죠. 물론 ANSI 표준은 아니고 Semantec, Borland, Microsoft 에서 제공하는 컴파일러의 경우에 자체 라이브러리로 제공합니다. 이식성을 생각하지 않는 일반적인 코딩에서는 위에 나열한 컴파일러를 이용한다면 사용할 수 있습니다. - 도현
* 제공된 라이브러리를 분석해보는 것도 재미있습니다. see [문자반대출력/Microsoft] --[이덕준]
- 비밀키/박능규 . . . . 2 matches
ofstream fout("output.txt");
// ofstream fout2("result.txt");
- 비밀키/임영동 . . . . 2 matches
ofstream fout("output.txt");
while(!fin.eof())
- 비밀키/조재화 . . . . 2 matches
ofstream fout("output.txt"); // fout과 output.txt를 연결
for(int i=0; !fin.eof(); i++)
- 비밀키/황재선 . . . . 2 matches
ofstream fout("source_enc.txt");
if (fin.eof())
- 수업평가 . . . . 2 matches
||SoftwareEngineeringClass || 6 || 6 || 5 || -8 || 9 || 5 ||1.8 ||
||SoftwareEngineeringClass송기원|| 4 || 3 || 2 || 3 || 12 || 2 || 6 ||
- 스터디제안 . . . . 2 matches
CACM, IEEE Software, IEEE Computer, Seminar:SoftwareDevelopmentMagazine 등의 잡지를 정리해서 그 요약글을 매 달(나눠서) 올리는 스터디는 어떨까?
- 실습 . . . . 2 matches
1) Microsoft Visual Studio를 실행시킨다.
memset(m_szName,NULL,sizeof(char)*21);
- 양아석 . . . . 2 matches
== Profile ==
turn_off()함수를 만들어냄
- 이영호/미니프로젝트#1 . . . . 2 matches
memset(&ina, 0, sizeof(ina));
if(connect(sockfd, (struct sockaddr *)&ina, sizeof(ina)) == -1)
- 전문가의명암 . . . . 2 matches
NoSmok:AlfredNorthWhitehead''''''는 ''Civilization advances by extending the number of important operations which we can perform without thinking of them.''라는 명언을 남겼다.
- 제12회 한국자바개발자 컨퍼런스 후기 . . . . 2 matches
그 다음으로 Track 5에서 있었던 Java와 Eclipse로 개발하는 클라우드, Windows Azure를 들었다. Microsoft사의 직원이 진행하였는데 표준에 맞추려고 노력한다는 말이 생각난다. 그리고 처음엔 Java를 마소에서 어떻게 활용을 한다는 건지 궁금해서 들은 것도 있다. 이 Windows Azure는 클라우드에서 애플리케이션을 운영하든, 클라우드에서 제공한 서비스를 이용하든지 간에, 애플리케이션을 위한 플랫폼이 필요한데, 애플리케이션 개발자들에게 제공되는 서비스를 위한 클라우드 기술의 집합이라고 한다. 그래서 Large로 갈 수록 램이 15GB인가 그렇고.. 뭐 여하튼.. 이클립스를 이용해 어떻게 사용하는지 간단하게 보여주고 하는 시간이었다.
마지막으로 Track 4에서 한 반복적인 작업이 싫은 안드로이드 개발자에게라는 것을 들었는데, 안드로이드 프로그래밍이라는 책의 저자인 사람이 안드로이드 개발에 관한 팁이라고 생각하면 될 만한 이야기를 빠르게 진행하였다. UI 매핑이라던지 파라미터 처리라던지 이러한 부분을 RoboGuice나 AndroidAnnotations를 이용해 해결할 수 있는 것을 설명과 동영상으로 잘 설명했다. 준비를 엄청나게 한 모습이 보였다. 이 부분에 대해서는 이 분 블로그인 [http://blog.softwaregeeks.org/ 클릭!] <-여기서 확인해 보시길...
- 조영준 . . . . 2 matches
[[TableOfContents]]
* [http://codeforces.com/profile/skywave codeforces]
* KCD 5th 참여 http://kcd2015.onoffmix.com/
- 헝가리안표기법 . . . . 2 matches
10, 15년전 Microsoft의 개발자중 헝가리 사람의 프로그래머가 쓰던 변수 명명법. MS내부에서 따라쓰기 시작하던 것이 점차 전세계의 프로그래머들에게 널리 퍼져 이젠 프로그램 코딩시 변수 명명의 표준적인 관례가 되었다.
|| sz || * || null terminated string of characters || char szText[16] ||
- 호너의법칙/김태훈zyint . . . . 2 matches
int asize = (sizeof(a)/sizeof(int));
- 호너의법칙/박영창 . . . . 2 matches
max_exponentials = sizeof(coefficient) / sizeof(double);
- 후각발달특별세미나 . . . . 2 matches
cout << "addr of f in " << funcCount << "th call : " << f << endl;
cout << "addr of b in " << funcCount << "th call : " << b << endl;
- .vimrc . . . . 1 match
set softtabstop=4
- 02_Python . . . . 1 match
[[TableOfContents]]
= Date of Seminar =
- 05학번 . . . . 1 match
//char *p = malloc(sizeof(char)*100);
- 06 SVN . . . . 1 match
http://msdn.microsoft.com
- 0PlayerProject . . . . 1 match
. BitRate/String : Microsoft PCM
- 2002년도ACM문제샘플풀이/문제B . . . . 1 match
[[TableOfContents]]
int numOfData;
index=pattern.find_first_of(c);
cin >> numOfData;
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
- 2011국제퍼실리테이터연합컨퍼런스공유회 . . . . 1 match
* IAF는 International Association of Facilitator의 약자.
- 5인용C++스터디/타이머보충 . . . . 1 match
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
- ACM_ICPC/2011년스터디 . . . . 1 match
[[TableOfContents]]
* 생각치도 못한 표준입출력 때문에 고생했습니다. 저놈의 judge 프로그램을 이해하지 못하겠습니다. 입출력방식이 낯서네요. 입력 종료를 위해 값을 따로 주지 않고 알아서 EOF 까지 받아야한다니... 정올 현역때는 이런 문제 구경하기 힘들었는데ㅜㅜ 제가 뭘 크게 오해하고 있나요. 덕분에 c도 아니고 c++도 아닌 코드가 나왔습니다. 그리고 3N+1 문제가 25일 프로그래밍 경진대회에 1번 문제로 나왔습니다. 허허.. - [정진경]
* 그래서 [정진경]군이 157번[http://koistudy.net/?mid=prob_page&NO=157 The tower of Hanoi]문제를 풀고, 설명한 후 [Mario]문제(선형적인 문제)를 풀게하여 연습을 한 후 다시 파닭문제에 도전하게 되었습니다.
- AcceleratedC++/Chapter13 . . . . 1 match
||[[TableOfContents]]||
// pass the version of `compare' that works on pointers
- Ajax2006Summer/프로그램설치 . . . . 1 match
3. Workspace 설정 후 '''Help''' - '''Software Updates''' - '''Find and Install''' 을 선택합니다.
- AnEasyProblem/강소현 . . . . 1 match
* printJ 함수 내에서 while(num<bin.length-1)문의 1을 빼주지 않아 bin[num+1]가 index bound of exception이 났었습니다.
- Ant . . . . 1 match
[[TableOfContents]]
* [http://developer.java.sun.com/developer/Quizzes/misc/ant.html Test your knowledge of Ant]
- ArtificialIntelligenceClass . . . . 1 match
요새 궁리하는건, othello team 들끼리 OpenSpaceTechnology 로 토론을 하는 시간을 가지는 건 어떨까 하는 생각을 해본다. 다양한 주제들이 나올 수 있을것 같은데.. 작게는 책에서의 knowledge representation 부분을 어떻게 실제 코드로 구현할 것인가부터 시작해서, minimax 나 alpha-beta Cutoff 의 실제 구현 모습, 알고리즘을 좀 더 빠르고 쉬우면서 정확하게 구현하는 방법 (나라면 당연히 스크립트 언어로 먼저 Prototyping 해보기) 등. 이에 대해서 교수님까지 참여하셔서 실제 우리가 당면한 컨텍스트에서부터 시작해서 끌어올려주시면 어떨까 하는 상상을 해보곤 한다.
- AstroAngel . . . . 1 match
[[TableOfContents]]
= Profile =
- BookShelf . . . . 1 match
1. ConceptsOfProgrammingLanguages
1. [TheElementsOfStyle] 4e
Art of UNIX Programming
- Bridge/권영기 . . . . 1 match
memset(man, 0, sizeof(int) * N);
- BusSimulation/영동 . . . . 1 match
cout<<"____________Result of Bus Simulation___________"<<endl;
- CC2호 . . . . 1 match
[http://www.its.strath.ac.uk/courses/c/ University of Strathclyde Computer Centre]
- CProgramming . . . . 1 match
[http://www.its.strath.ac.uk/courses/c/ University of Strathclyde Computer Centre]
- Calendar성훈이코드 . . . . 1 match
int daysOfMonth(int month, int year);
int day = daysOfMonth(month, year);
int daysOfMonth(int month, int year)
printf("Input the first day of week in January (0:Mon -- 6:Sun)");
- CauGlobal/Episode . . . . 1 match
1. 그래서 몇개의 예약을 통해 OK상태로 된 'union of 예약'이 하나의 셋트를 만들면 됩니다.
- Celfin's ACM training . . . . 1 match
|| 9 || 6 || 110602/10213 || How Many Pieces Of Land? || 3 hours || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4143&title=HowManyPiecesOfLand?/하기웅&login=processing&id=celfin&redirect=yes How Many Pieces Of Land?/Celfin] ||
|| 16 || 13 || 111303/10195 || The Knights of the Round Table || 1 hour || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4263&title=TheKnightsOfTheRoundTable/하기웅&login=processing&id=&redirect=yes TheKnightsOfTheRoundTable/Celfin] ||
- Classes . . . . 1 match
[[TableOfContents]]
set softtabstop=4
- ClassifyByAnagram/sun . . . . 1 match
[[TableOfContents]]
* Profiling
g.drawString( "Estimated power: " + String.valueOf(elapsed), 10, 90 );
ch = String.valueOf( str.charAt( i ));
table.put( ch, String.valueOf(Integer.parseInt((String)value)+1));
- ClassifyByAnagram/김재우 . . . . 1 match
e.printStackTrace(); //To change body of catch statement use Options | File Templates.
System.err.println( "Elapsed: " + String.valueOf( System.currentTimeMillis() - start ) );
- ComputerGraphicsClass/Exam2004_2 . . . . 1 match
곡선(수식)을 나타내는 기본 형태(Three basic forms of curves)를 쓰고, 이 중에서 컴퓨터 그래픽스에서 어떤 형태가 가장 적합한지 그 이유를 설명하시오.
- ConnectingTheDots . . . . 1 match
SoftwareDevelopmentMagazine 에 소개된 ModelViewPresenter 관련 구현 예.
- ContestScoreBoard/허아영 . . . . 1 match
#define MAX_OF_TEAM_NUM 100
#define MAX_OF_Q 9
int team_data[MAX_OF_TEAM_NUM+1][MAX_OF_Q+1]; // 0번째 배열은 시간 벌점 다음부터는
int temp_team_num, q_num, q_index[MAX_OF_TEAM_NUM]; // 문제 푼 index
for(i = 0; i <= MAX_OF_TEAM_NUM; i++)
for(int j = 1; j <= MAX_OF_Q; j++)
for(i = 1; i <= MAX_OF_TEAM_NUM; i++)
cout << "team num of q : " << q_index[i] << endl;
- CryptKicker2 . . . . 1 match
now is the time for all good men to come to the aid of the party
- DNS와BIND . . . . 1 match
|| [[TableOfContents]] ||
리소스 레코드들의 (일반적)순서 - SOA(start of authority) 레코드, NS(name server) 레코드, 기타 레코드, A(address), PTR(pointer), CNAME(canonical name)
- DataCommunicationSummaryProject/Chapter12 . . . . 1 match
* GEO 위성에서 어느 한 방향에 집중적으로 전파를 쏘는 안테나를 달아 지면에서는 작은 안테나로도 전파 받을 수 있음 (예: SkyLife)
- DevCpp . . . . 1 match
You can get a more complete list of free compilers at http://www.bloodshed.net/compilers/ :) - [아무개]
- DevelopmentinWindows . . . . 1 match
[[TableOfContents]]
* MFC (Microsoft Foundation Class library)
- Eclipse/PluginUrls . . . . 1 match
* Update URL : http://www.kyrsoft.com/updates/
- EightQueenProblem/밥벌레 . . . . 1 match
Table: array[0..8-1, 0..8-1] of Boolean;
- EightQueenProblem/임인택/java . . . . 1 match
System.out.println("ex) java Queen NumofQueens");
- EnglishSpeaking/TheSimpsons/S01E01 . . . . 1 match
Homer : I don't deserve you as much as a guy with a fat wallet...and a credit card that won't set off that horrible beeping.
- ErdosNumbers/황재선 . . . . 1 match
"Newtonian forms of prime factor matrices";
- Factorial2 . . . . 1 match
Factorial of Number A 란 A! 식으로 표현하며, A 의 계승이라는 표현을 씁니다.
- FactorialFactors/조현태 . . . . 1 match
unsigned int *log_answer = (unsigned int*)malloc((answer+2)*sizeof(unsigned int));
- FactoryMethodPattern . . . . 1 match
#redirect Gof/FactoryMethod
- FileInputOutput . . . . 1 match
ofstream fout("output.txt"); // fout과 output.txt를 연결
- FromDuskTillDawn/변형진 . . . . 1 match
if($this->days) echo "Vladimir needs $this->days litre(s) of blood.<br>";
- FromDuskTillDawn/조현태 . . . . 1 match
int sizeOfTimeTable;
sscanf(readData, "%d", &sizeOfTimeTable);
for(register int i = 0; i < sizeOfTimeTable; ++i)
int numberOfTestCase = 0;
sscanf(readData, "%d", &numberOfTestCase);
for (register int i = 0; i < numberOfTestCase; ++i)
cout << "Vladimir needs " << g_minimumDelayTime / 24 << " litre(s) of blood. " << endl;
- GarbageCollection . . . . 1 match
[[TableOfContents]]
2번째 경우에 대한 힌트를 학교 자료구조 교재인 Fundamentals of data structure in c 의 Linked List 파트에서 힌트를 얻을 수 있고, 1번째의 내용은 원칙적으로 완벽한 예측이 불가능하기 때문에 시스템에서 객체 참조를 저장하는 식으로 해서 참조가 없으면 다시는 쓰지 않는 다는 식으로 해서 처리하는 듯함. (C++ 참조 변수를 통한 객체 자동 소멸 관련 내용과 관련한 부분인 듯, 추측이긴 한데 이게 맞는거 같음;;; 아닐지도 ㅋㅋㅋ)
- Gof/Facade . . . . 1 match
From GoF.
[[TableOfContents]]
예를 들어, 가상 메모리 framework는 Domain을 facade로서 가진다. Domain은 address space를 나타낸다. Domain은 virtual addresses 와 메모리 객체, 화일, 저장소의 offset에 매핑하는 기능을 제공한다. Domain의 main operation은 특정 주소에 대해 메모리 객체를 추가하거나, 삭제하너가 page fault를 다루는 기능을 제공한다.
- Gof/Mediator . . . . 1 match
[[TableOfContents]]
Here's the succession of events by which a list box's selection passes to an entry field.
- Gof/Singleton . . . . 1 match
[[TableOfContents]]
더욱더 유연한 접근 방법으로 '''registry of singletons''' 이 있다. 가능한 Singleton class들의 집합을 정의하는 Instance operation을 가지는 것 대신, Singleton class들을 잘 알려진 registry 에 그들의 singleton instance를 등록하는 것이다.
CList <CNSingleton*, CNSingleton*>* m_ContainerOfSingleton;
delete m_ContainerOfSingleton;
m_ContainerOfSingleton = new CList <CNSingleton*, CNSingleton*>;
m_ContainerOfSingleton->AddTail(new CNSingleton());
POSITION position = m_ContainerOfSingleton->GetHeadPosition();
delete m_ContainerOfSingleton->GetAt(position);
m_ContainerOfSingleton->GetNext(position);
m_ContainerOfSingleton->RemoveAll();
if (m_Index == m_ContainerOfSingleton->GetCount())
POSITION position = m_ContainerOfSingleton->FindIndex(m_Index);
return m_ContainerOfSingleton->GetAt(position);
- HASH구하기/류주영,황재선 . . . . 1 match
ofstream fout("output.txt"); // fout과 output.txt를 연결
- HASH구하기/오후근,조재화 . . . . 1 match
ofstream fout("output.txt");
- HASH구하기/조동영,이재환,노수민 . . . . 1 match
ofstream fout ("output.txt");
- Hacking . . . . 1 match
[[TableOfContents]]
== DDOS(Distributed Denial of Service)의 공격 ==
- HaskellLanguage . . . . 1 match
[[TableOfContents]]
Multiple declarations of `Main.f'
- HomepageTemplate . . . . 1 match
== Profile ==
- JavaScript/2011년스터디/JSON-js분석 . . . . 1 match
if (typeof Date.prototype.toJSON !== 'function') {
return isFinite(this.valueOf()) ?
return this.valueOf();
return this.valueOf();
- JollyJumpers/임인택3 . . . . 1 match
case (length(Ori)-1 =:= length(Res) andalso lists:sum(Res) =:= trunc((hd(Res)+lists:last(Res))*length(Res)/2)) of
- KIV봉사활동/준비물 . . . . 1 match
[[tableofcontents]]
- Karma . . . . 1 match
[http://www.yearofmoo.com/2013/01/full-spectrum-testing-with-angularjs-and-karma.html]
- KnightTour/재니 . . . . 1 match
// Knight.cpp: implementation of the CKnight class.
- LearningGuideToDesignPatterns . . . . 1 match
CompositePattern은 여러부분에서 나타나며, IteratorPattern, ChainOfResponsibilityPattern, InterpreterPattern, VisitorPattern 에서 종종 쓰인다.
=== Chain of Responsibility - Behavioral ===
ObserverPattern 과 MediatorPattern 들을 이용한 message의 전달관계를 관찰하면서, ChainOfResponsibilityPattern 의 message handling 과 비교 & 대조할 수 있다.
- Leonardong . . . . 1 match
== Profile ==
- Lines In The Plane . . . . 1 match
What is the maximum number L<sub>n</sub> of regions defined by lines("unfolding" or "unwinding") in the plane?
- Linux/디렉토리용도 . . . . 1 match
[[TableOfContents]]
* /etc/profile.d : 쉘 로그인 하여 프로파일의 실행되는 스크립트에 대한 정의가 있음.
- LinuxSystemClass . . . . 1 match
학교 수업공부를 하거나 레포트를 쓰는 경우 위의 학교 교재와 함께 'The Design of the Unix Operating System' 을 같이 보면 도움이 많이 된다. 해당 알고리즘들에 대해서 좀 더 구체적으로 서술되어있다. 단, 책이 좀 오래된 감이 있다.
- LispLanguage . . . . 1 match
[[TableOfContents]]
* emacs 강좌 - lisp 이해하기 1: http://ageofblue.blogspot.kr/2012/01/emacs-lisp-1.html
- LogicCircuitClass . . . . 1 match
[[TableOfContents]]
= Who is a professor? =
- Lotto/송지원 . . . . 1 match
nums = (int *)malloc(sizeof(int) * n);
- MFC . . . . 1 match
#Redirect MicrosoftFoundationClasses
- MFC/CollectionClass . . . . 1 match
{{| [[TableOfContents]] |}}
해싱과정은 해시값이라는 정수를 생성한다. 일반적으로 키와 그리고 연된 객체를 맵안의 어디에 저장할 것인가를 결정하기 위해서 기본 어드레스에 대한 offset 으로 해시갑이 설정된다.
- MFC/Control . . . . 1 match
{{| [[TableOfContents]] |}}
= a kind of control =
- MFC/Print . . . . 1 match
{{| [[TableOfContents]] |}}
|| m_nOffsetPage || m_bDocObject가 TRUE일때만 유효. lPrint job 안에서 첫번째 페이지 offset을 준다. ||
- Map/권정욱 . . . . 1 match
while(!fin.eof()){
- MoinMoin . . . . 1 match
Mmmmh , seems that I can enrich so more info: "Moin" has the meaning of "Good Morning" but it is spoken under murmur like "mornin'" although the Syllable is too short alone, so it is spoken twice. If you shorten "Good Morning" with "morn'" it has the same effect with "morn'morn'". --Thomas Albl
- MoinMoinDone . . . . 1 match
* Check for a (configurable) max size in bytes of the RecentChanges page while building it
<META NAME="ROBOTS" CONTENT="NOINDEX,NOFOLLOW">
- MoinMoinRelease . . . . 1 match
This describes how to create a release tarball for MoinMoin. It's of minor interest to anyone except J
- MoniWiki/HotKeys . . . . 1 match
||``<ESC>``||Go 'into'/'out of' the 'Go' form|| ||
- MultiplyingByRotation . . . . 1 match
입력은 텍스트파일이다. 진수,첫번째 숫자의 마지막 숫자(the least significant digit of the first factor)와 두번째 숫자(second factor)로 구성된 3개의 수치가 한줄씩 입력된다. 각 수치는 공백으로 구분된다. 두번째 숫자는 해당 진수보다 적은 숫자이다. 입력파일은 EOF로 끝난다.
- NumericalAnalysisClass . . . . 1 match
''Object-Oriented Implementation of Numerical Methods : An Introduction with Java and Smalltalk'', by Didier H. Besset.
- OurMajorLangIsCAndCPlusPlus/locale.h . . . . 1 match
fatal ("Out of memory");
- OurMajorLangIsCAndCPlusPlus/math.h . . . . 1 match
||double atof ( const char * string ) || 문자열을 실수형으로 변형시킨다||
- OurMajorLangIsCAndCPlusPlus/stdio.h . . . . 1 match
|| int feof(FILE *) || 스트림의 끝이 아닌곳에서는 0, 끝에는 0이 아닌값을 리턴 합니다. ||
- ParserMarket . . . . 1 match
== Offers ==
||BizarStructuredText: ["parser/stx.py"]||Richard Jones||richard@bizarsoftware.com.au||0.8|| ||
- Perforce . . . . 1 match
프로그램은 서버, 클라이언트 환경으로 관리되며, 서버는 소스의 모아서 관리한다. 서버 프로그램은 유닉스, 맥, MSWin 버전으로 제공된다. 클라이언트는 GUI, CMD 버전의 툴을 지원하며 다양한 OS 에서 이용가능하다. 또한 IDE 와 연동역시 지원한다. (IDE에는 3dmax, maya, photoshop, office 등을 포괄하는 방대한 시스템)
- Plugin/Chrome/네이버사전 . . . . 1 match
[[TableOfContents]]
// Use of this source code is governed by a BSD-style license that can be
- Postech/QualityEntranceExam06 . . . . 1 match
4.2 way assoiate 캐시에서 히트 되었나 안되었나, 뭐 그러고 구조 그리고 각 index, tag, byte offset 등 요소 알아 맞추기
- PowerOfCryptography/이영호 . . . . 1 match
buf = log10((double)atof(p_buf)/10); // 첫 두자리를 log취한다.
- ProgrammingContest . . . . 1 match
||[[TableOfContents]]||
http://www.itasoftware.com/careers/programmers.php
- ProgrammingLanguageClass/Report2002_1 . . . . 1 match
= Principles of Programming Languages =
- ProjectZephyrus/ClientJourney . . . . 1 match
''5분 플레이를 시도하려고 할때 학습과 능률 사이를 잘 저울질 할 필요가 있을듯. ["생각을곱하는모임"]의 글에서도 그렇듯, 사람과의 의견교환과 홀로 공부하고 생각하는 것 양자간의 균형을 잡아야겠지. 하지만, 우리가 만나서 플밍할때 해당 라이브러리공부와 플밍을 둘 다 하기엔 시간이 모자르니, 학습부분은 개인적으로 어느정도 해야 겠지. (나도 JTree 보려고 Graphic Java 랑 Core Java, Professional Java 에 있는 JTree 다 읽어보고 집에서 개인적인 예제 코드 작성하고 그랬다. 그정도 했으니까 자네랑 플밍할때 레퍼런스 안뒤져보지. 뭐든지 기본 밑바탕이 되는건 학습량이라 생각. 학습량 * 효율적 방법론 = Output --석천''
- ProjectZephyrus/Thread . . . . 1 match
* 제가 저번학기에 작업했던 메신져가 있습니다. 이번 프로젝트를 하면서 참고할 수 있는 부분을 참고하세요. 저번 학기에 정보처리 실습이란 과목에서 프로젝트로 했던 것입니다. UP 로 Process 를 진행했었고, 높은(?) 점수를 위해서 많은 문서를 남기긴 했는데.. 부족한 면이 많군요 ㅡ.ㅡ;; http://www.inazsoft.net/projectworktool.html 에서 다운로드 받을 수 있습니다. - 구근
- PyIde . . . . 1 match
[[TableOfContents]]
* http://www.die-offenbachs.de/detlev/eric3.html - 스크린샷만 두고 볼때 가장 잘만들어져보이는 IDE.
- Quake2 . . . . 1 match
http://www.vertigosoftware.com/Quake2.htm
- QuestionsAboutMultiProcessAndThread . . . . 1 match
* A) processor라고 쓰신 것이 process, cpu가 processor를 의미하신 것 같군요. process는 실행되고 있는 하나의 프로그램 인스턴스이며, thread는 a flow of control입니다. 즉, 하나의 프로그램 안에 논리적으로 여러 개의 제어 흐름이 존재하느냐(*-thread)와, 하나의 컴퓨터에 논리적으로 여러 개의 프로그램 인스턴스가 실행되고 있느냐(*-process)로 생각하는게 가장 좋습니다. multi-processor(multi-core)는 말 그대로 동시에 물리적으로 여러 개의 흐름을 처리할 독립적인 처리기가 병렬로 존재하느냐입니다. 위에 제시된 예는 적절하지 못한 것 같습니다. - [변형진]
- REFACTORING . . . . 1 match
|| [[TableOfContents]] ||
특별히 때를 둘 필요는 없다. 틈나는 대로. Don Robert 의 The Rule of Three 원칙을 적용해도 좋을 것 같다.
- RPC . . . . 1 match
Microsoft
- Random Walk2/곽세환 . . . . 1 match
ofstream fout("output.txt");
- Refactoring/BigRefactorings . . . . 1 match
[[TableOfContents]]
* You have a class that is doing too much work, at least in part through many conditional statements.[[BR]]''Create a hierarchy of classes in which each subclass represents a special case.''
- ReleaseDebugBuildStartGo의관계 . . . . 1 match
F5는 IDE(통합환경)가 실행 프로세스를 반동결(Soft-ice)상태로 실행시켜, 사용자가 내부 변수의 값을 들여다 볼 수 있거나 중간에 멈출 수 있게 합니다. 디버깅을 할 때에 아주 중요한 역할을 하지요.
- RunTimeTypeInformation . . . . 1 match
[[TableOfContents]]
동적으로 만들어진 변수의 타입을 비교하고, 특정 타입으로 생성하는 것을 가능하게 한다. (자바에서는 instanceof를 생각해보면 될 듯)
- SOLDIERS/송지원 . . . . 1 match
// sort each of x, y array
- ScaleFreeNetwork/OpenSource . . . . 1 match
[[TableOfContents]]
* Complex Network Metrics and Software Evolvability
- SecurityNeeds . . . . 1 match
get around. Anyone know of a wiki that restricts access in such a way?
- SeparatingUserInterfaceCode . . . . 1 match
When separating the presentation from the domain, make sure that no part of the domain code makes any reference to the presentation code. So if you write an application with a WIMP (windows, icons, mouse, and pointer) GUI, you should be able to write a command line interface that does everything that you can do through the WIMP interface -- without copying any code from the WIMP into the command line.
- SharedSourceProgram . . . . 1 match
[http://news.naver.com/news/read.php?mode=LSD&office_id=092&article_id=0000002588§ion_id=105&menu_id=105 ZDnet기사부분발췌]
- SoftwareEngineeringClass/Exam2006_2 . . . . 1 match
4. 심사를 하고 받은 후의 Software Engineer 로써 앞으로 조직의 비전을 위한 자신의 각오, 결단을 기술하시오.
- SystemEngineeringTeam/TrainingCourse . . . . 1 match
* CentOS - RHEL의 클론 버전. 라이센스 문제때문에 들어가지 못한 패키지를 Open Source Software로 교체. 뛰어난 안정성을 자랑함. 다만 안정성을 택한대신 패키지의 종류가 적고 업데이트가 매우 느린편. 아직도 jdk 1.6버전이라는 소문이 있다.
- Temp/Commander . . . . 1 match
print 'include "file"\nExecutes the contents of a file'
- Temp/Parser . . . . 1 match
self.err('Unexpected end of file')
- Trace . . . . 1 match
_ASSERT(nBuf < sizeof(szBuffer));
- Ubiquitous . . . . 1 match
[[TableOfContents]]
QoS(Quality of Service) : QoS 이상의 의미는 없는 듯.
- UglyNumbers/1002 . . . . 1 match
[UglyNumbers/JuNe] 코드 분석. 2시간 동안 보다가 도무지 접근법을 이해 못하다. 한 3시간째쯤 보다가 http://www.acmsolver.org/?itemid=28#ggviewer-offsite-nav-9512048 보고 이해 & 좌절.
- UnitTest . . . . 1 match
SoftwareEngineering 에 있어서 UnitTest 는 '단위 모듈에 대한 테스트' 이다. 즉, 해당 기능이 제대로 돌아감을 확인하는 테스트가 UnitTest 이다.
- UserStory . . . . 1 match
''After several years of debating this question and seeing both in use, I now think they have nothing in common other than their first three letters.''
- VendingMachine/세연/재동 . . . . 1 match
char * name[] = {"coke","juice","tea","cofee","milk"};
- VisitorPattern . . . . 1 match
["Gof/Visitor"]
- VisualBasicClass/2006/Exam1 . . . . 1 match
① 옵션이 on 또는 off 되었다는 것을 알려주는 Value속성을 가지고 있다.
- VoiceChat . . . . 1 match
* 거원소프트에서 만들었다. [http://www.cowon.com/product/d_voice/software/jet-voice-chat/download.html 홈페이지], 가입할 필요가 없고. 한 사람이 채팅서버 역할을 하고 나머지 가 클라이언트가 된다. 음질도 5k, 32k 선택가능.
- VoteMacro . . . . 1 match
||[[Vote(off,일찍 자고 일찍 일어난다 6, 늦게 자고 늦게 일어난다 14, 내 맘대로 19)]]||[[Vote(아침 6, 점심 9, 저녁 13)]]||
- Westside . . . . 1 match
== Profile ==
- WinCVS . . . . 1 match
[[TableOfContents]]
''DeleteMe 맞는 이야기인가요? ["sun"]의 기억으로는 아닌것으로 알고 있고, 홈페이지의 설명에서도 다음과 같이 나와있습니다. 'WinCvs is written using the Microsoft MFC.' '' [[BR]]
- WinampPlugin을이용한프로그래밍 . . . . 1 match
http://download.nullsoft.com/winamp/client/wa502_sdk.zip
- WordIndex . . . . 1 match
This is an index of all words occuring in page titles.
- X . . . . 1 match
[[TableOfContents]]
== Profile ==
- YetAnotherTextMenu . . . . 1 match
유닉스의 철학을 배우자. 유닉스는 작고 잘 만들어진 레고 블럭들을 조립해서 멋진 성을 만들게 해준다. SoftwareTools라는 고전의 교훈이다.
- Yggdrasil/가속된씨플플/2장 . . . . 1 match
cout<<"Please input blank of rows and cols:";
- ZIM/UIPrototype . . . . 1 match
Software for Use와 Contextual Design의 일독을 권합니다. UI쪽(특히 실전)에서는 탁월한 책들입니다. 이 책들에서는 UI 프로토타이핑을 종이를 통해 하기를 강력하게 추천하고 있습니다. 각종 자동화 툴을 써보면 오히려 불편한 경우가 많습니다. 넓은 종이와 다양한 크기의 3M 포스트 잇을 이용해서 버튼 같은 것의 위치를 자유로이 옮겨볼 수 있습니다. 이렇게 만든 프로토타입을 사무실 벽에 걸어넣고 그 앞에서 토론도 하고, 즉석에서 모양을 바꾸기도 합니다. 초기에는 커뮤니케이션 보조 도구로 화이트보드를 많이 사용하기도 합니다. 그러나 한 자리에서 함께 작업할 기회가 적은 경우에는 어쩔 수 없이 전자문서와 이미지에 의존해야겠죠. 제 경우는 주로 스캐너를 이용해서 손으로 그린 이미지 공유를 했습니다. 온라인에서 공동으로 디자인 토론을 할 경우에는 화이트보드가 지원되는 온라인 컨퍼런싱 툴을 씁니다. (e.g. 넷미팅) --김창준
- ZeroPageMagazine . . . . 1 match
S.O.S(the Source of the Source)
- ZeroPageServer/set2001 . . . . 1 match
=== Software (2002.8.15일 전 최종 스펙) ===
- ZeroPageServer/set2002_815 . . . . 1 match
* [[HTML( <STRIKE> .bashrc .bash_profile 한글화</STRIKE> )]]
- ZeroPage_200_OK/note . . . . 1 match
[[TableOfContents]]
if (("f" in _proto) && typeof _proto["f"] === "function")
- ZeroPage성년식 . . . . 1 match
* 참가 신청: 온오프믹스(http://onoffmix.com/event/4096)
- [Lovely]boy^_^/Diary/2-2-11 . . . . 1 match
[[TableOfContents]]
== ToDo List of a this week ==
* 선호랑 ["TheWarOfGenesis2R"]의 일환으로 타일 에디터를 만들었다. BMP 파일 약간 개조해서 뒤에다가 타일 데이터를 덧붙였다.
- [Lovely]boy^_^/EnglishGrammer/QuestionsAndAuxiliaryVerbs . . . . 1 match
But do not use do/does/did if who/what/which is the subject of the sentence.
- [Lovely]boy^_^/USACO/BrokenNecklace . . . . 1 match
ofstream fout("beads.out");
- [Lovely]boy^_^/USACO/MixingMilk . . . . 1 match
ofstream fout("milk.out");
- [Lovely]boy^_^/USACO/WhatTimeIsIt? . . . . 1 match
ofstream fout("clock.out");
- [Lovely]boy^_^/USACO/YourRideIsHere . . . . 1 match
ofstream fout("ride.out");
- [Lovely]boy^_^/[Lovely]boy^_^/USACO/Barn . . . . 1 match
ofstream fout("barn1.out");
- callusedHand/projects/algorithms . . . . 1 match
= Dictionary of Algorithms and Data Structures =
- comein2 . . . . 1 match
== Profile ==
- django/RetrievingObject . . . . 1 match
'num_of_report': 'SELECT COUNT(*) FROM risk_report WHERE risk_report.reporter = employee.id'
- dlaza . . . . 1 match
== profile ==
- fm_jsung . . . . 1 match
== Profile ==
- fnwinter . . . . 1 match
= Profile =
- gester . . . . 1 match
[[TableOfContents]]
== Profile ==
- html5/communicationAPI . . . . 1 match
[[tableofcontents]]
- html5/overview . . . . 1 match
[[tableofcontents]]
- neocoin/CodeScrap . . . . 1 match
if ( m_nTime < (int)::GetPrivateProfileInt("FindBomb", "AMA_Time", 999, ".\FindBomb.ini")){
- neocoin/MilestoneOfReport . . . . 1 match
[[TableOfContents]]
* 실행 방법,과정 (Process of Executing)
- planetjalim . . . . 1 match
== Profile ==
- radiohead4us/PenpalInfo . . . . 1 match
City/State,Country: Seoul Korea Republic of
- snowflower . . . . 1 match
[[TableOfContents]]
= Profile =
||[TheWarOfGenesis2R]||창세기전2 리메이크 프로젝트|| _ ||
||["SRPG제작"]||SRPG에 대한 대략적인 계획 - 현재는 ["TheWarOfGenesis2R"]과 함께|| _ ||
- spaurh . . . . 1 match
== Profile ==
- ssulsamo . . . . 1 match
[[TableOfContents]]
== Profile ==
- travelsky . . . . 1 match
== Profile ==
- usa_selfish/김태진 . . . . 1 match
qsort((void*)arr, N, sizeof(cow), compare);
- whiteblue . . . . 1 match
=== Profile ===
- wlsdud1616 . . . . 1 match
== Profile ==
- zennith/MemoryHierarchy . . . . 1 match
== Concept of Locality ==
- 가루치 . . . . 1 match
== Profile ==
- 가위바위보/동기 . . . . 1 match
while(!fin.eof())//0:가위 1:바위 2:보
- 가위바위보/영동 . . . . 1 match
while(!fin.eof()){
- 가위바위보/은지 . . . . 1 match
while (!fin.eof())
- 권형준 . . . . 1 match
== Profile ==
- 기웅 . . . . 1 match
== Profile ==
- 김경환 . . . . 1 match
== Profile ==
- 김범준 . . . . 1 match
== Profile ==
- 김상협 . . . . 1 match
== profile ==
- 김상호 . . . . 1 match
== Profile ==
- 김수경/JavaScript/InfiniteDataStructure . . . . 1 match
* {{{filter(f(a)) := for each a in seq, sequence of a which f(a) is true.}}}
- 김영록 . . . . 1 match
== Profile ==
- 김영준 . . . . 1 match
== Profile~* B) ==
- 김태진 . . . . 1 match
= Curriculum Vitae of ZeroPage 21th, Tae-Jin Kim =
- 김태형 . . . . 1 match
|| [[TableOfContents]] ||
== Profile ==
- 김현종 . . . . 1 match
== Profile ==
- 꿈 . . . . 1 match
== Profile ==
- 날다람쥐 6월9일 . . . . 1 match
//정석: 여기서 ap+1 에서의 1 은 1byte의 1이 아니라 sizeof(int) * 1 의 1이다. 따라서 for문 형태로 작성할 때는 ap + i로 하면 된다.
- 남상재 . . . . 1 match
== Profile ==
- 논문검색 . . . . 1 match
* ["IeeeSoftware"]
- 데블스캠프/2013 . . . . 1 match
[[Tableofcontents]]
- 데블스캠프2005/RUR-PLE/Harvest/김태훈-zyint . . . . 1 match
turn_off()
- 데블스캠프2005/RUR-PLE/Harvest/이승한 . . . . 1 match
turn_off()
- 데블스캠프2005/RUR-PLE/Harvest/정수민 . . . . 1 match
turn_off()
- 데블스캠프2005/RUR-PLE/Harvest/허아영 . . . . 1 match
turn_off()
- 데블스캠프2005/RUR-PLE/TwoMoreSelectableHarvest/이승한 . . . . 1 match
turn_off()
- 데블스캠프2006/CPPFileInput . . . . 1 match
num = atof(temp.c_str());
- 데블스캠프2009/목요일/연습문제/MFC/송지원 . . . . 1 match
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
- 데블스캠프2009/월요일/연습문제/svn코드레이스/박준호 . . . . 1 match
ptr=(int*)malloc(sizeof(int)*(n*n));
- 데블스캠프2010/다섯째날/ObjectCraft/미션1/서민관 . . . . 1 match
zergling* z1 = (zergling*)malloc(sizeof(zergling));
- 데블스캠프2011 . . . . 1 match
[[Tableofcontents]]
- 데블스캠프2011/네째날/이승한 . . . . 1 match
* [http://blog.softwaregeeks.org/wp-content/uploads/2011/04/Reverse-Engineering-%EC%95%88%EB%93%9C%EB%A1%9C%EC%9D%B4%EB%93%9C-%ED%95%99%EC%8A%B5.pdf Reverse Engineering, 안드로이드 학습 발표자료] - 진성주, JCO 발표 자료
- 데블스캠프2011/넷째날/Android . . . . 1 match
[[Tableofcontents]]
- 데블스캠프2011/둘째날/Machine-Learning . . . . 1 match
* 자동 분류할 데이터 다운로드 : http://office.buzzni.com/media/svm_data.tar.gz
- 데블스캠프2012/넷째날/묻지마Csharp/Mission3/김수경 . . . . 1 match
/// the contents of this method with the code editor.
- 데블스캠프2012/다섯째날/C로배우는C++원리 . . . . 1 match
Student *temp = (Student*)malloc(sizeof(Student));
- 로그인하기 . . . . 1 match
UserPreferences 페이지에서 이름과 패스워드를 적고 Profile 만들기 버튼을 누른다. ChangeYourCss 페이지나 CssMarket 에서 개인 취향에 맞는 스타일 시트를 등록해서 사용하면 더 좋다.
- 문원명 . . . . 1 match
== Profile ==
- 문자열연결/조현태 . . . . 1 match
ofstream outputFile("result.out");
- 박성현 . . . . 1 match
== Profile ==
- 박소연 . . . . 1 match
== Profile ==
- 박재홍 . . . . 1 match
== Profile ==
- 박효정 . . . . 1 match
== Profile ==
- 배열초기화 . . . . 1 match
memset(a, 0, sizeof(a));
- 벡터/김홍선,노수민 . . . . 1 match
while(!fin.eof())
- 변준원 . . . . 1 match
= profile =
- 병역문제어떻게해결할것인가 . . . . 1 match
[[TableOfContents]]
* MOU체결 기관으로는 SW 마에스트로, BoB( Best of Best)가 알려져 있으며, 소마가 훨~씬 널럴하고 쉬우니 소마를 추천
- 상욱 . . . . 1 match
[[TableOfContents]]
=== Profile ===
- 상협/Diary/7월 . . . . 1 match
[[TableOfContents]]
* Designing Object-Oriented Software 이책이랑 Refactoring 책 빌려야징..
- 상협/Diary/8월 . . . . 1 match
[[TableOfContents]]
* Designing Object-Oriented Software 이책 다보기 Failure (집에 내려가서 해야징.)
- 상협/감상 . . . . 1 match
[[TableOfContents]]
|| [PatternOrientedSoftwareArchitecture]|| || 1권(1) || - || 뭣도 모르고 보니깐 별로 감이 안온다 -_-; ||
- 새싹교실/2011 . . . . 1 match
[[TableOfContents]]
각 파트의 역할, program의 실행원리, software(layer 활용), complier와 interpreter 역할
- 새싹교실/2011/學高/4회차 . . . . 1 match
[[TableOfContents]]
* The sum of your integers plus 7 is 19
- 새싹교실/2011/무전취식/레벨11 . . . . 1 match
[[TableOfContents]]
// assume 'S' is on the left side of the maze
- 새싹교실/2012/부부동반 . . . . 1 match
[[TableOfContents]]
* Hardware / Programming Language / Software의 상관관계
- 새싹교실/2012/앞부분만본반 . . . . 1 match
[[TableOfContents]]
A system of linear equation is said to be consistent if it has either one solution or infinitely many solutions; a system is inconsistent if it has no solution.
- 새싹교실/2013/케로로반/실습자료 . . . . 1 match
Social Executive of Computer Science and Engineering will hold a bar event. There are many pretty girls and handsome guys. It will be great day for you. Just come to the bar event and drink. There are many side dishes and beer. Please enjoy the event. but DO NOT drink too much, or FBI will come to catch you. Thank you.
- 서지혜 . . . . 1 match
[[TableOfContents]]
= PROFILE =
* [http://cacm.acm.org/magazines/2010/1/55760-what-should-we-teach-new-software-developers-why/fulltext 어느 교수님의 고민] - 우리는 무엇을 가르치고, 무엇을 배워야 하는가?
- 성당과시장 . . . . 1 match
국내에서는 최근(2004) 이만용씨가 MS의 초대 NTO인 [http://www.microsoft.com/korea/magazine/200311/focusinterview/fi.asp 김명호 박사의 인터뷰]를 반론하는 [http://zdnet.co.kr/news/column/mylee/article.jsp?id=69285&forum=1 이만용의 Open Mind- MS NTO 김명호 박사에 대한 반론] 컬럼을 개재하여 화제가 되고 있다.
- 세여니 . . . . 1 match
== Profile ==
- 손동일 . . . . 1 match
== Profile ==
- 송년회 . . . . 1 match
이런 연말모임도 해 보면 좋겠습니다.[http://news.naver.com/news/read.php?mode=LSD&office_id=028&article_id=0000089874§ion_id=103&menu_id=103]--[Leonardong]
- 수 . . . . 1 match
http://prof.cau.ac.kr/~sw_kim/include.htm
- 순수원서 . . . . 1 match
== Profile ==
- 시간맞추기 . . . . 1 match
your time is off. }}}
- 시간맞추기/문보창 . . . . 1 match
cout << "your time is off.\n";
- 시간맞추기/조현태 . . . . 1 match
cout << "your time is off." << second;
- 신기훈 . . . . 1 match
로그인할 때 profile만들기?
- 신혜지 . . . . 1 match
== Profile ==
- 쓰레드에관한잡담 . . . . 1 match
1. real-time process - 1.hard real-time(산업용), 2.soft real-time(vedio decoder 등)
- 알고리즘8주숙제/test . . . . 1 match
ofstream fout("test.txt");
- 압축알고리즘/태훈,휘동 . . . . 1 match
}while( !fin.eof() );
- 우리가나아갈방향 . . . . 1 match
Gof 꺼 올려놨으니 그거 먼저보라니까.. 충고 안듣으시더니. -_-; DPSC가 더 어려울텐데.. 흡. --석천
- 위시리스트 . . . . 1 match
The art of computer programming 1 ~ 4A
- 위키로프로젝트하기 . . . . 1 match
[[TableOfContents]]
== Wiki Project Life Cycle ==
* How - 목표를 위한 방법과 일정의 기록이다. Offline 또는 Online 상에서 한 일에 대한 ["ThreeFs"] 를 남겨라.
* 공동 번역 - 영어 원문을 링크를 걸거나 전문을 실은뒤 같이 번역을 해 나가는 방법이다. Offline 으로만으로도 가능한 방법이지만 효율적인 방법으로 다른 방법들을 곁들일 수 있겠다.
* 온라인이라는 잇점이 있다. 시간과 공간의 제약을 덜 받는다. 하지만, 오프라인을 배제해서는 안된다. 각각의 대화수단들은 장단점들이 존재한다. 위키의 프로젝트는 가급적 Offline에서의 프로젝트, 스터디와 이어져야 그 효과가 클 것이다. ZeroPage 의 ["정모"] 때 자신이 하고 있는 일에 대한 상황을 발표하고, 서로 의사소통을 할 수 있겠다.
- 유주영 . . . . 1 match
== Profile ==
- 윤성만 . . . . 1 match
== Profile ==
- 윤성복 . . . . 1 match
== Profile ==
- 윤정훈 . . . . 1 match
== Profile ==
- 윤현수 . . . . 1 match
|| [[TableOfContents]] ||
== Profile ==
- 이병윤 . . . . 1 match
[[TableOfContents]]
== Profile ==
- 이영호/문자열검색 . . . . 1 match
fgets(buf, sizeof(buf), stdin); // 문자열이라고 했으니 space를 포함한다.
- 이충현 . . . . 1 match
= Profile =
- 임수연 . . . . 1 match
== Profile ==
- 임인택/AdvancedDigitalImageProcessing . . . . 1 match
http://www.ph.tn.tudelft.nl/Courses/FIP/noframes/fip-Morpholo.html#Heading98
- 임인택/내손을거친책들 . . . . 1 match
* The Haskell School of Expression
* TheElementsOfStyle + TheElementsOfProgrammingStyle
- 정규표현식 . . . . 1 match
[[tableofcontents]]
- 정규표현식/스터디/메타문자사용하기/예제 . . . . 1 match
[[tableofcontents]]
- 정규표현식/스터디/문자집합으로찾기 . . . . 1 match
[[tableofcontents]]
- 정규표현식/스터디/문자하나찾기/예제 . . . . 1 match
[[tableofcontents]]
- 정렬/Leonardong . . . . 1 match
ofstream fout("sorted.txt");
- 정렬/aekae . . . . 1 match
ofstream fout("output.txt");
- 정렬/강희경 . . . . 1 match
ofstream fout("output.txt");
- 정렬/곽세환 . . . . 1 match
ofstream fout("output.txt");
- 정렬/문원명 . . . . 1 match
ofstream fout("output.txt");
- 정렬/방선희 . . . . 1 match
ofstream fout("output.txt");
- 정렬/변준원 . . . . 1 match
ofstream fout("SoretedData.txt");
- 정렬/장창재 . . . . 1 match
ofstream fout("output.txt");
- 정모 . . . . 1 match
[[TableOfContents]]
* on/offline 모임 시간
-> Online (주로 Wiki를 통해 이루어지는) 에서 결정할 내용과 Offline 에서 결정할 내용을 구분하지 못한다.
-> Offline 에서 충분이 결정할 수 있는 일들을 Online(Wiki) 으로 미루어버린다.
- 정모/2002.7.11 . . . . 1 match
* ["PatternOrientedSoftwareArchitecture"] - 패턴의 관점에서 보는 소프트웨어 구조
- 정모/2011.11.16 . . . . 1 match
[[TableOfContents]]
* [http://onoffmix.com/event/4096 ZP성년식]
- 정모/2011.11.9 . . . . 1 match
[[TableOfContents]]
* [http://onoffmix.com/event/4096 ZP성년식];
- 정모/2011.3.21 . . . . 1 match
[[TableOfContents]]
1. 준석이 OMS(World of Warcraft) : 동영상을 적절하게 사용해서 집중력을 높여준 세미나였다. 아쉬운 점은 쪼----금 길었다는거;;
- 정모/2011.5.9 . . . . 1 match
* [http://onoffmix.com/event/2823 IFA 국제퍼실리테이터 컨퍼런스 2011 공유회]
- 정모/2011.9.20 . . . . 1 match
[[TableOfContents]]
* [http://onoffmix.com/event/3672 개발자를 위한 공감세미나]
- 정모/2012.7.25 . . . . 1 match
[[TableOfContents]]
* 학회실 안쪽 에어컨이 마스터 에어컨이라 6피 전체와 연결되어 있으니 에어컨 on/off시에 주의 바람.
- 정진수 . . . . 1 match
== Profile ==
- 조동영 . . . . 1 match
||[[TableOfContents]]||
== Profile ==
- 조윤희 . . . . 1 match
== Profile ==
- 조응택 . . . . 1 match
== Profile ==
- 조재화 . . . . 1 match
== Profile ==
- 졸업논문/요약본 . . . . 1 match
Web environment has became a standalone platform. Object-oriented languages, such as python, are suitable for web. Django is a web application framework written by python, and helps web developers writting web application more agile by abstracting database. Django provides high level abstraction on database, higher than CLI which uses ODBC. Django, for instance, creates database tables when developer writes classes in python, and modifies tables when developer modifies classes in python. In addition, django helps developers using database on host-language(python) level by abstracting insertion, deletion, update, retrieving of recodes to class method. Therefore, web developers make programs more agile.
- 주승범 . . . . 1 match
== Profile ==
- 최대공약수 . . . . 1 match
The GCD of 4 and 8 is 4
- 최대공약수/허아영 . . . . 1 match
printf("The GCD of %d and %d is %d\n", x, y, x2);
- 큐와 스택/문원명 . . . . 1 match
cin 이 string을 입력 받는 코드는 {{{~cpp C:\Program Files\Microsoft Visual Studio\VC98\Include\istream}}} 에 정의 되어 있습니다. 궁금하시면, Debug 모드로 따라가 보세요.
- 파이썬으로익스플로어제어 . . . . 1 match
자세한 내용은 http://msdn.microsoft.com/library/default.asp?url=/workshop/browser/webbrowser/reference/objects/internetexplorer.asp 에의 컴포넌트들을 참조하세요. 주로 알아야 할 객체는 WebBrowser, Document 객체입니다. (login 예제는 나중에~) --[1002]
- 파일 입출력_1 . . . . 1 match
num = atof(temp.c_str());
- 프로그램내에서의주석 . . . . 1 match
See Also Seminar:CommentOrNot , NoSmok:DonaldKnuth 's comment on programs as works of literature
- 한재만 . . . . 1 match
== Profile ==
- 허아영 . . . . 1 match
[http://prof.cau.ac.kr/~sw_kim 김승욱교수님 홈페이지]
- 허아영/C코딩연습 . . . . 1 match
|| [[TableOfContents]] ||
[[ The contents of score array ]]
- 형노 . . . . 1 match
=== Profile # ===
- 호너의법칙/남도연 . . . . 1 match
ofstream outputFILE;
- 홈페이지Template . . . . 1 match
== Profile ==
- 홍길동 . . . . 1 match
== Profile ==
- 황세중 . . . . 1 match
== profile ==
- 0 . . . . 1 match
Found 624 matching pages out of 7555 total pages (2880 pages are searched)
You can also click here to search title.
